Papers.

An Ontology for Web Service Ratings and Reputations

Current Web services standards enable publishing service descriptions and finding services by matching requested and published descriptions based on syntactic criteria such as method signatures or service category. Emerging approaches such as DAML-S use DAML to formalize richer models for expressing capabilities of services. DAML-S would go beyond WSDL in terms of the richness of service descriptions. However, neither current Web services standards nor DAML-S provide a basis for selecting a good service or for comparing services that implement the same interface. In our view

Análisis de consultas a un buscador y su aplicación a la jerarquización de páginas web

Anàlisi de consultes en un cercador i l’aplicació a la jerarquització de pàgines web = Análisis de consultas a un buscador y su aplicación a la jerarquización de páginas web

Agent-based Architecture for Autonomic Web Service Selection

Multilingual Terminology Extraction and Validation

This paper presents the automatic terminology extraction approach developed within project LIQUID, which aims at a cost-effective solution for cross-language access to multilingual text databases in technical and scientific domains. The solution is based on a terminology extraction tool and a domain-specific ontology, evaluated in the Gastroenterology domain.

Language Resource Creation and Distribution at the Linguistic Data Consortium: A Progress Report

TIDES Language Resources: A Resource Map for Translingual Information Access

TExtractor: a multilingual terminology extraction tool

Presents TExtractor, a multilingual terminology extraction tool combining linguistic and statistical filters to identify domain terminology across languages.

SLINERC

Bethesda proposals for classification of nonlymphoid hematopoietic neoplasms in mice

Extending the concept of transaction compensation

DB2 and Web services

XML programming with SQL/XML and XQuery

Second edition of the "XML and information retrieval" workshop held at SIGIR'2002, Tampere, Finland, Aug 15 th , 2002

Conceptual model of web service reputation

Current Web services standards enable publishing service descriptions and finding services on a match based on criteria such as method signatures or service category. However, current approaches provide no basis for selecting a good service or for comparing ratings of services. We describe a conceptual model for reputation using which reputation information can be organized and shared and service selection can be facilitated and automated.

Fast subtype checking in the HotSpot JVM

Automatic extraction of object-oriented component interfaces

Methods and metrics for cold-start recommendations

We have developed a method for recommending items that combines content and collaborative data under a single probabilistic framework. We benchmark our algorithm against a naïve Bayes classifier on the cold-start problem, where we wish to recommend items that no one in the community has yet rated. We systematically explore three testing methodologies using a publicly available data set, and explain how these methods apply to specific real-world applications. We advocate heuristic recommenders when benchmarking to give competent baseline performance. We introduce a new performance metric, the CROC curve, and demonstrate empirically that the various components of our testing strategy combine to obtain deeper understanding of the performance characteristics of recommender systems. Though the emphasis of our testing is on cold-start recommending, our methods for recommending and evaluation are general.

Explicit programming

Tools for navigating large social cyberspaces

Observed behavior and perceived value of authors in usenet newsgroups

MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS

Determination of Glass Transition Temperature (Tg) of Adhesive-Based Optical Fiber Components by In-Situ Bragg Grating Strain Sensing

Matching models to real life for defect reduction

An image similarity measure based on graph matching

New approaches to information management: attribute-centric data systems

A model and software architecture for search results visualization on the WWW

Direct pattern matching on compressed text

Searching the Web: challenges and partial solutions

Fast approximate string matching in a dictionary

A model and a visual query language for structured text

A model for visualizing large answers in WWW retrieval

Mobile computing technology at Vindigo

MICE: a prototype MPI implementation in Converse environment

The ACL data collection initiative

Text mining with conceptual graphs

Recovering rationale for design changes: a knowledge-based approach

UNIPEN project of on-line data exchange and recognizer benchmarks

Using Unity to Semi-Automatically Integrate Relational Schema.

Global parameter convergence in systems with monotonic parameterization

Structural transitions in scale-free networks.

Real growing networks such as the World Wide Web or personal connection based networks are characterized by a high degree of clustering, in addition to the small-world property and the absence of a characteristic scale. Appropriate modifications of the (Barabási-Albert) preferential attachment network growth capture all these aspects. We present a scaling theory to describe the behavior of the generalized models and the mean-field rate equation for clustering. This is solved for a specific case with the result C(k) approximately 1/k for the clustering of a node of degree k. This mean-field exponent agrees with simulations, and reproduces the clustering of many real networks.

Shortest paths and load scaling in scale-free trees.

The average node-to-node distance of scale-free graphs depends logarithmically on N, the number of nodes, while the probability distribution function of the distances may take various forms. Here we analyze these by considering mean-field arguments and by mapping the m=1 case of the Barabási-Albert model into a tree with a depth-dependent branching ratio. This shows the origins of the average distance scaling and allows one to demonstrate why the distribution approaches a Gaussian in the limit of N large. The load, the number of the shortest distance paths passing through any node, is discussed in the tree presentation.

Particle creation in a tunneling universe

An expanding closed universe filled with radiation can either recollapse or tunnel to the regime of unbounded expansion, if the cosmological constant is nonzero. We re-examine the question of particle creation during tunneling, with the purpose of resolving a long-standing controversy. Using a perturbative superspace model with a conformally coupled massless scalar field, which is known to give no particle production, we explicitly show that the breakdown of the semiclassical approximation and the ``catastrophic particle production'' claimed earlier in the literature are due to an inappropriate choice of the initial quantum state prior to the tunneling.

The Minimal moose for a little Higgs

Phenomenology of electroweak symmetry breaking from theory space

Mooses, topology and Higgs

Lenguajes de consulta para xml: un análisis comparativo

Lenguajes de consulta para xml: un análisis comparativo

Algorithmic cooling and scalable NMR quantum computers

We present here algorithmic cooling (via polarization heat bath)—a powerful method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. Given that spin-half states represent (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression, by using a set of rapidly thermal-relaxing bits. Such auxiliary bits could be implemented by using spins that rapidly get into thermal equilibrium with the environment, e.g., electron spins. Interestingly, the interaction with the environment, usually a most undesired interaction, is used here to our benefit, allowing a cooling mechanism. Cooling spins to a very low temperature without cooling the environment could lead to a breakthrough in NMR experiments, and our “spin-refrigerating” method suggests that this is possible. The scaling of NMR ensemble computers is currently one of the main obstacles to building larger-scale quantum computing devices, and our spin-refrigerating method suggests that this problem can be resolved.

Binding to Cisplatin-Modified DNA by the Saccharomyces cerevisiae HMGB Protein Nhp6A