The semantics of the core features of XML Schema in terms of XQuery 1.0 and XPath 2.0 data model algebraically defined is given. The database state is represented as a many sorted algebra whose sorts are sets of data ...
详细信息
The semantics of the core features of XML Schema in terms of XQuery 1.0 and XPath 2.0 data model algebraically defined is given. The database state is represented as a many sorted algebra whose sorts are sets of data type values and different kinds of nodes and whose operations are data type operations and node accessors. The values of some node accessors, such as "parent", "children" and "attributes", define a document tree with a definite order of nodes. The values of other node accessors help to make difference between kinds of nodes, learn the names, types and values associated with the corresponding document entities, etc., i.e., provide primitive facilities for a query language. As a result, a document can be easily mapped to its implementation in terms of nodes and accessors defined on them.
The structure and application of a universal communication architecture for high-dynamic robot systems were presented. The architecture consists of a middleware for robotic and process control applications - extended ...
详细信息
ISBN:
(纸本)0780386531
The structure and application of a universal communication architecture for high-dynamic robot systems were presented. The architecture consists of a middleware for robotic and process control applications - extended (MiRPA-X) and a communication protocol Industrial Automation Protocol (IAP) based on the IEEE1394 communication standard. Both are implemented with ANSI C under the real-time operating system QNX Neutrino. IAP provides network management functions to control participant states and global object directory to virtually unite all participant paremeters.
The contribution of this paper is fourfold. First, we sketch an architecture of agent-enabled business process management that cleanly separates between agent capabilities, business process modeling, and the modeling ...
详细信息
Modeling and managing business processes that span multiple organizations involves new challenges, mainly regarding the ability to cope with change, decentralization, and the required support for interoperability. In ...
详细信息
作者：
Giovanni AdagioDistributed Programming Laboratory
School of Computer Science and Communication Systems Swiss Federal Institute of Technology in Lausanne (EPFL) Institute of Mathematics School of Basic Sciences Swiss Federal Institute of Technology in Lausanne (EPFL) Switzerland
This paper contributes to the characterization of synchronous models of distributed computing using topological techniques. We consider a generic synchronous model with send-omission failures and use a topological str...
This paper contributes to the characterization of synchronous models of distributed computing using topological techniques. We consider a generic synchronous model with send-omission failures and use a topological structure corresponding to a bounded number of rounds of the model. We observe some nice properties of the structure and derive from these properties necessary and sufficient conditions to solve consensus in this model.
The purpose of Generic Evolutionary Algorithms programming Library (GEA1) system is to provide researchers with an easy-to-use, widely applicable and extendable programming library which solves real-world optimization...
The purpose of Generic Evolutionary Algorithms programming Library (GEA1) system is to provide researchers with an easy-to-use, widely applicable and extendable programming library which solves real-world optimization problems by means of evolutionary algorithms. It contains algorithms for various evolutionary methods, implemented genetic operators for the most common representation forms for individuals, various selection methods, and examples on how to use and expand the library. All these functions assure that GEA can be effectively applied on many problems. GraphGEA is a graphical user interface to GEA written with the GTK API. The numerous parameters of the evolutionary algorithm can be set in appropriate dialog boxes. The program also checks the correctness of the parameters and saving/restoring of parameter sets is also possible. The selected evolutionary algorithm can be executed interactively on the specified optimization problem through the graphical user interface of GraphGEA, and the results and behavior of the EA can be observed on several selected graphs and drawings. While the main purpose of GEA is solving optimization problems, that of GraphGEA is education and analysis. It can be of great help for students understanding the characteristics of evolutionary algorithms and researchers of the area can use it to analyze an EA's behavior on particular problems.
Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In...
详细信息
Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In...
ISBN:
(纸本)9780898714906
Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In most applications, however, only normal dominance constraints are used. The satisfiability problem of normal dominance constraints can be reduced in linear time to the configuration problem of dominance graphs, as shown recently. In this paper, we give a polynomial time algorithm testing configurability of dominance graphs (and thus satisfiability of normal dominance constraints). Previous to our work no polynomial time algorithms were known.
We investigate the motion of a self-localized quasiparticle in a discrete lattice taking into account the interaction of the quasiparticle with the vibrations of the lattice. Using an original method to control the ve...
We investigate the motion of a self-localized quasiparticle in a discrete lattice taking into account the interaction of the quasiparticle with the vibrations of the lattice. Using an original method to control the velocity of solitonlike excitations in a discrete system, the dependence of their velocity, momentum, and energy on the carrying wave vector is analyzed. The velocity of the solitonlike excitations is found to saturate at wave vectors below those predicted by continuum models. This is as found in experimental observations. Also, the properties of the Peierls-Nabarro relief, caused by the lattice discreteness, and pinning of a soliton by this barrier, are studied. The influence of the initial condition on the Peierls-Nabarro barrier and soliton motion is investigated. For low-width solitons, a critical value of the wave vector is needed to overcome the Peierls-Nabarro barrier.
暂无评论