pinecone/core-2020-05-10-deduplication huggingface dataset:
Information extraction in structured documents using tree automata induction

Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work for IE from structured documents formatted in HTML or XML uses techniques for IE from strings, such as grammar and automata induction. However, such documents have a tree structure. Hence it is natural to investigate methods that are able to recognise and exploit this tree structure. We do this by exploring the use of tree automata for IE in structured documents. Experimental results on benchmark data sets show that our approach compares favorably with previous approaches.status: publishe
An extension of Kedlaya's algorithm to superelliptic curves

International audienceWe present an algorithm for counting points on superelliptic curves y^r=f(x) over a finite field F_q of small characteristic different from r. This is an extension of an algorithm for hyperelliptic curves due to Kedlaya. In this extension, the complexity, assuming r and the genus are fixed, is O(log^{3+epsilon}q) in time and space, just like for hyperelliptic curves. We give some numerical examples obtained with our first implementation, thus proving that cryptographic sizes are now reachable
Computation of Discrete Logarithms in GF(2^607)

International audienceWe describe in this article how we have been able to extend the record for computations of discrete logarithms in characteristic 2 from the previous record over GF(2^503) to a newer mark of GF(2^607), using Coppersmith's algorithm. This has been made possible by several practical improvements to the algorithm. Although the computations have been carried out on fairly standard hardware, our opinion is that we are nearing the current limits of the manageable sizes for this algorithm, and that going substantially further will require deeper improvements to the method
Weakest precondition for general recursive programs formalized in Coq.

This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is a deep embedding using the computational power intrinsic to type theory. Since Coq accepts only structural recursive functions, the computational embedding of general recursive programs is non-trivial. To justify the embedding, an operational semantics is defined and the equivalence between wp and the operational semantics is proved. Three major healthiness conditions, namely: Strictness, Monotonicity and Conjunctivity are proved as well
Web-based knowledge-based system on liquid retaining structure design as instructional tool

A novice engineer often faces many difficulties during the design of liquid retaining structures, which involve making many decisions on the basis of judgment, heuristics, code of practice, rules of thumb, and previous experience. There is a need to develop programming environments that can incorporate engineering judgment along with algorithmic tools. In this paper, the development of a web-based knowledge-based system in design of liquid retaining structures, using blackboard architecture with hybrid knowledge representation techniques including production rule system and object-oriented approach, is presented. It is based on British Standards Codes of Practice BS8007 and BS8110. Tailor-made explanations are furnished to direct and assist inexperienced designers or civil engineering students to learn and capture how to design liquid retaining structures effectively and sustainably in their design practices. The use of this intelligent tutoring system in disseminating heuristic knowledge as well as experience to practitioners and civil engineering students is demonstrated.Department of Civil and Environmental Engineering2002-2003 > Academic research: refereed > Publication in refereed journalpreprint_postprin
Standardized Payment Procedures as Key Enabling Factor for Mobile Commerce

Companies are not going to invest into the development of innovative applications or services unless these can be charged for appropriately. Thus, the existence of standardized and widely accepted mobile payment procedures is crucial for successful business-to-customer mobile commerce. In this paper we reflect on the acceptance of mobile payment and examine the characteristics of current mobile payment procedures. The outcomes of the paper are a categorization of current mobile payment procedures with strategic, participation and operational criteria and, based on these results, the derivation of the five mobile payment standard types prepaid, mobile money, conventional settlement, premium rate number and dual-card. Finally, a prospect is given to possible further development of mobile payment procedures in the direction of an integrative universal mobile payment system (UMPS).
Low-power FSMs in FPGA: Encoding alternatives

The final publication is available at Springer via http://dx.doi.org/10.1007/3-540-45716-X_36Proceedings of 12th International Workshop, PATMOS 2002 Seville, Spain, September 11–13, 2002In this paper, the problem of state encoding of FPGA-based synchronous finite state machines (FSMs) for low-power is addressed. Four codification schemes have been studied: First, the usual binary encoding and the One-Hot approach suggested by the FPGA vendor; then, a code that minimizes the output logic; finally, the so-called Two-Hot code strategy. FSMs of the MCNC and PREP benchmark suites have been analyzed. Main results show that binary state encoding fit well with small machines (up to 8 states), meanwhile One-Hot is better for large FSMs (over 16 states). A power saving of up to the 57% can be achieved selecting the appropriate encoding. An areapower correlation has been observed in spite of the circuit or encoding scheme. Thus, FSMs that make use of fewer resources are good candidates to consume less power.Ministry of Science of Spain, under Contract TIC2001-2688-C03-03, has supported
this work. Additional funds have been obtained from Projects 658001 and 658004 of
the Fundación General de la Universidad Autónoma de Madrid
Automatic symbolic modelling of co-evolutionarily learned robot skills

Proceeding of: 6th International Work-Conference on Artificial and Natural Neural Networks, IWANN 2001 Granada, Spain, June 13–15, 2001Evolutionary based learning systems have proven to be very powerful techniques for solving a wide range of tasks, from prediction to optimization. However, in some cases the learned concepts are unreadable for humans. This prevents a deep semantic analysis of what has been really learned by those systems. We present in this paper an alternative to obtain symbolic models from subsymbolic learning. In the first stage, a subsymbolic learning system is applied to a given task. Then, a symbolic classifier is used for automatically generating the symbolic counterpart of the subsymbolic model. We have tested this approach to obtain a symbolic model of a neural network. The neural network defines a simple controller af an autonomous robot. a competitive coevolutive method has been applied in order to learn the right weights of the neural network. The results show that the obtained symbolic model is very accurate in the task of modelling the subsymbolic system, adding to this its readability characteristic
Evolutionary cellular configurations for designing feed-forward neural networks architectures

Proceeding of: 6th International Work-Conference on Artificial and Natural Neural Networks, IWANN 2001 Granada, Spain, June 13–15, 2001In the recent years, the interest to develop automatic methods to determine appropriate architectures of feed-forward neural networks has increased. Most of the methods are based on evolutionary computation paradigms. Some of the designed methods are based on direct representations of the parameters of the network. These representations do not allow scalability, so to represent large architectures, very large structures are required. An alternative more interesting are the indirect schemes. They codify a compact representation of the neural network. In this work, an indirect constructive encoding scheme is presented. This scheme is based on cellular automata representations in order to increase the scalability of the method
Feature Selection, Ranking of Each Feature and Classification for the Diagnosis of Community Acquired Legionella Pneumonia

Diagnosis of community acquired legionella pneumonia (CALP) is currently performed by means of laboratory techniques which may delay diagnosis several hours. To determine whether ANN can categorize CALP and non-legionella community-acquired pneumonia (NLCAP) and be standard for use by clinicians, we prospectively studied 203 patients with community-acquired pneumonia (CAP) diagnosed by laboratory tests. Twenty one clinical and analytical variables were recorded to train a neural net with two classes (LCAP or NLCAP class). In this paper we deal with the problem of diagnosis, feature selection, and ranking of the features as a function of their classification importance, and the design of a classifier the criteria of maximizing the ROC (Receiving operating characteristics) area, which gives a good trade-off between true positives and false negatives. In order to guarantee the validity of the statistics; the train-validation-test databases were rotated by the jackknife technique, and a multistarting procedure was done in order to make the system insensitive to local maxima
Nonlinear Fault Detection for Hydraulic Systems

One of the most important areas in the robotics industry is the development
of robots capable of working in hazardous environments. As humans cannot
safely or cheaply work in these environments, providing a high level of robotic functionality is important. Our work in this area focuses on a fault detection method known as analytical redundancy, or AR. In this paper we discuss the application to a hydraulic servovalve system of our novel rigorous nonlinear AR technique. AR is a model-based state-space technique that is theoretically guaranteed to derive the maximum number of independent tests of the consistency of sensor data with the system model and past control inputs. Conventional linear AR is only valid for linear sampled data systems. However, our new nonlinear AR (NLAR) technique maintains traditional linear AR’s mathematical guarantee to generate the maximum possible number of independent tests in the nonlinear domain. Thus NLAR allows us to gain the benefits of AR testing for nonlinear systems with both continuous and sampled data
Reflection and reification in process system evolution : experience and opportunity

Process systems aim to support many people involved in many processes over a long period of time. They provide facilities for storing and manipulating processes in both the representation and enactment domains. This paper argues that process systems should support ongoing transformations between these domains, at any level of granularity. The notion of creating a enactment model instance from a representation is merely one restricted transformation. Especially when process evolution is considered the case for thinking in terms of model instances is weak. This argument is supported by our experience of the ProcessWeb process system facilities for developing and evolving process models. The idea of hyper-code, which supports very general transformations between representation and enactment domains, is described. This offers the prospect of further improvements in this area.Postprin
Understanding contextual interactions to design navigational context-aware applications

Context-aware technology has stimulated rigorous research into novel ways to support people in a wide range of tasks and situations. However, the effectiveness of these technologies will ultimately be dependent on the extent to which contextual interactions are understood and accounted for in their design. This study involved an investigation of contextual interactions required for route navigation. The purpose was to illustrate the heterogeneous nature of humans in interaction with their environmental context. Participants were interviewed to determine how each interacts with or use objects/information in the environment in which to navigate/orientate. Results revealed that people vary individually and collectively. Usability implications for the design of navigational context-aware applications are identified and discussed
On Fibring Semantics for BDI Logics

This study examines BDI logics in the context of Gabbay\u27s fibring semantics. We show that dovetailing (a special form of fibring) can be adopted as a semantic methodology to combine BDI logics. We develop a set of interaction axioms that can capture static as well as dynamic aspects of the mental states in BDI systems, using Catach\u27s incestual schema G^[a, b, c, d]. Further we exemplify the constraints required on fibring function to capture the semantics of interactions among modalities. The advantages of having a fibred approach is discussed in the final section
An intelligent decision support system in construction management by data warehousing technique

The integration of a Data Warehouse and a Decision Support System (DSS) can provide construction managers with sufficient information for decision making without interrupting daily work of an On-Line Transaction Processing system. In this paper, the concepts of the data warehouse, On-Line Analysis Processing and DSS are first reviewed. The method of creating a data warehouse is then shown, changing the data in the data warehouse into a multidimensional data cube and integrating the data warehouse with a DSS. An application example is given to illustrate the use of the Construction Management Decision Support System developed in this study. This prototype system can enable the right data to be tracked down and provides the required information in a direct, rapid and meaningful way. Construction managers can view data from various perspectives with significantly reduced query time, thus making decisions more efficiently. Moreover, the approach can be applied to other fields.Department of Civil and Environmental EngineeringAuthor name used in this publication: K. W. Chau2002-2003 > Academic research: refereed > Publication in refereed journalpreprint_postprin
Coinductive interpreters for process calculi

This paper suggests functional programming languages with coinductive types as suitable devices for prototyping process calculi. The proposed approach is independent of any particular process calculus and makes explicit the different ingredients present in the design of any such calculi. In particular structural aspects of the underlying behaviour model (e.g. the dichotomies such as active vs reactive, deterministic vs nondeterministic) become clearly separated from the interaction structure which defines the synchronisation discipline. The approach is illustrated by the detailed development in Charity of an interpreter for a family of process languages
On termination of logic programs with floating point computations

Static analysis, proceedingsNumerical computations form an essential part of almost any real-world program. Traditional approaches to termination of logic programs are restricted to domains isomorphic to N, more recent works study termination of integer computations. Termination of computations involving real numbers is cumbersome and counter-intuitive due to rounding errors and implementation conventions. We present a novel technique that allows us to prove termination of such computations. Our approach extends the previous work on termination of integer computations.status: publishe
Reuse of results in termination analysis of typed logic programs

Recent works by the authors address the problem of automating the selection of a candidate norm for the purpose of termination analysis. These works illustrate a powerful technique in which a collection of simple type-based norms, one for each data type in the program, are combined together to provide the candidate norm. This paper extends these results by investigating type polymorphism. We show that by considering polymorphic types we reduce, without sacrificing precision, the number of type-based norms which should be combined to provide the candidate norm. Moreover, we show that when a generic polymorphic typed program component occurs in one or more specific type contexts, we need not reanalyze it. All of the information concerning its termination and its effect on the termination of other predicates in that context can be derived directly from the context independent analysis of that component based on norms derived from the polymorphic types.status: publishe
Metamagnetic Quantum Criticality in Sr3Ru2O7

We consider the metamagnetic transition in the bilayer ruthenate, ${\rm Sr_3Ru_2O_7}$, and use this to motivate a renormalization group treatment of a zero-temperature quantum-critical end-point. We summarize the results of mean field theory and give a pedagogical derivation of the renormalization-group equations. These are then solved to yield numerical results for the susceptibility, the specific heat and the resistivity exponent which can be compared with measured data on ${\rm Sr_3Ru_2O_7}$ to provide a powerful test for the standard framework of metallic quantum criticality. The observed approach to the critical point is well-described by our theory explaining a number of unusual features of experimental data. The puzzling behaviour very near to the critical point itself, though, is not accounted for by this, or any other theory with a Fermi surface
On the transformation of object-oriented conceptual models to logical theories

This paper describes a semi-automatic transformation from object-oriented conceptual models to logical theories. By associating a logical theory with a conceptual model, we are able to combine the best of both worlds. On one hand, the object-oriented software development paradigm is recognized to be well-suited to build maintainable and-communicable conceptual models. On the other hand, the logical programming paradigm offers very powerful and semantically founded concepts to represent knowledge and the use of logical inference systems makes it possible to prototype solutions to computational tasks: Since our method makes this mapping from conceptual models to logical theories traceable, dealing with the evolution of the problem domain and requirements becomes more manageable. Moreover a path is offered towards building prototypes for object-oriented conceptual models.status: publishe
Dynamics and Thermodynamics of Systems with Long Range Interactions: an
  Introduction

We review theoretical results obtained recently in the framework of
statistical mechanics to study systems with long range forces. This fundamental
and methodological study leads us to consider the different domains of
applications in a trans-disciplinary perspective (astrophysics, nuclear
physics, plasmas physics, metallic clusters, hydrodynamics,...) with a special
emphasis on Bose-Einstein condensates.Comment: Chapter of the forthcoming "Lecture Notes in Physics" volume:
  ``Dynamics and Thermodynamics of Systems with Long Range Interactions'', T.
  Dauxois, S. Ruffo, E. Arimondo, M. Wilkens Eds., Lecture Notes in Physics
  Vol. 602, Springer (2002). (see http://link.springer.de/series/lnpp/
Improved Quantum Communication Complexity Bounds for Disjointness and
  Equality

We prove new bounds on the quantum communication complexity of the
disjointness and equality problems. For the case of exact and non-deterministic
protocols we show that these complexities are all equal to n+1, the previous
best lower bound being n/2. We show this by improving a general bound for
non-deterministic protocols of de Wolf. We also give an O(sqrt{n}c^{log^*
n})-qubit bounded-error protocol for disjointness, modifying and improving the
earlier O(sqrt{n}log n) protocol of Buhrman, Cleve, and Wigderson, and prove an
Omega(sqrt{n}) lower bound for a large class of protocols that includes the
BCW-protocol as well as our new protocol.Comment: 11 pages LaTe
Path Integrals and Their Application to Dissipative Quantum Systems

Introduction
  Path Integrals
  - Introduction
  - Propagator
  - Free Particle
  - Path Integral Representation of Quantum Mechanics
  - Particle on a Ring
  - Particle in a Box
  - Driven Harmonic Oscillator
  - Semiclassical Approximation
  - Imaginary Time Path Integral
  Dissipative Systems
  - Introduction
  - Environment as Collection of Harmonic Oscillators
  - Effective Action
  Damped Harmonic Oscillator
  - Partition Function
  - Ground State Energy and Density of States
  - Position Autocorrelation FunctionComment: 55 pages, 13 figures. To be published in "Coherent Evolution in Noisy
  Environments", Lecture Notes in Physics
  (http://link.springer.de/series/lnpp/) (Springer Verlag,
  Berlin-Heidelberg-New York
Five Lectures On Dissipative Master Equations

1 First Lecture: Basics
  1.1 Physical Derivation of the Master Equation
  1.2 Some Simple Implications
  1.3 Steady State
  1.4 Action to the Left
  2 Second Lecture: Eigenvalues and Eigenvectors of L
  2.1 A Simple Case First
  2.2 The General Case
  3 Third Lecture: Completeness of the Damping Bases
  3.1 Phase Space Functions
  3.2 Completeness of the Eigenvectors of L
  3.3 Positivity Conservation
  3.4 Lindblad Form of Liouville Operators
  4 Fourth Lecture: Quantum-Optical Applications
  4.1 Periodically Driven Damped Oscillator
  4.2 Conditional and Unconditional Evolution
  4.3 Physical Signicance of Statistical Operators
  5 Fifth Lecture: Statistics of Detected Atoms
  5.1 Correlation Functions
  5.2 Waiting Time Statistics
  5.3 Counting StatisticsComment: 58 pages, 10 figures; book chapter to appear in ``Coherent Evolution
  in Noisy Environments'', Lecture Notes in Physics, (Springer Verlag,
  Berlin-Heidelberg-New York). Notes of lectures given in Dresden,23-27 April
  200
Quantum Communication and Decoherence

In this contribution we will give a brief overview on the methods used to
overcome decoherence in quantum communication protocols. We give an
introduction to quantum error correction, entanglement purification and quantum
cryptography. It is shown that entanglement purification can be used to create
``private entanglement'', which makes it a useful tool for cryptographic
protocols.Comment: 31 pages, 10 figures, LaTeX, book chapter to appear in ``Coherent
  Evolution in Noisy Environments'', Lecture Notes in Physics, (Springer
  Verlag, Berlin-Heidelberg-New York). Minor typos correcte
How to correct small quantum errors

The theory of quantum error correction is a cornerstone of quantum
information processing. It shows that quantum data can be protected against
decoherence effects, which otherwise would render many of the new quantum
applications practically impossible. In this paper we give a self contained
introduction to this theory and to the closely related concept of quantum
channel capacities. We show, in particular, that it is possible (using
appropriate error correcting schemes) to send a non-vanishing amount of quantum
data undisturbed (in a certain asymptotic sense) through a noisy quantum
channel T, provided the errors produced by T are small enough.Comment: LaTeX2e, 23 pages, 6 figures (3 eps, 3 pstricks
Providing Authentication & Authorization Mechanisms for Active Service Charging

Active network technology enables fast deployment of new network services tailored to the specific needs of end users, among others features. Nevertheless proper charging for these new added value services require suitable authentication and authorization mechanisms. In this article we describe a security architecture for SARA (Simple Active Router-Assistant) architecture, an active network platform deployed in the context of the IST-GCAP project. The proposed solution provides all the required security features, and it also grants proper scalability of the overall system, by using a distributed key-generation algorithm.Publicad