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 ...
详细信息
The paper presents the Electronic Tool Integration platform (ETI), a community platform designed for project-oriented, domainspecific, public or private interactive experimentation with heterogeneous tools. ETI manage...
详细信息
To increase efficiency of modern information-protection systems, a new approach to design of fast encryption algorithms is proposed based on controlled two-place operations. Models, design, and mathematical features o...
To increase efficiency of modern information-protection systems, a new approach to design of fast encryption algorithms is proposed based on controlled two-place operations. Models, design, and mathematical features of controlled two-place operations are considered. Principles of application of such operations to iterative cryptoschemes are discussed.
A special attention about scalability has to be paid to QoS solutions for Core Internet Networks as they deal with a lot of flows and demand many resources. This paper analyses and proposes integrated solutions from t...
详细信息
To reduce speech recognition error rate we can use better statistical language models. These models can be improved by grouping words into word equivalence classes. Clustering algorithms can be used to automatically d...
详细信息
To reduce speech recognition error rate we can use better statistical language models. These models can be improved by grouping words into word equivalence classes. Clustering algorithms can be used to automatically do this word grouping. We present an incremental clustering algorithm and two iterative clustering algorithms. Also, we compare them with previous algorithms. The experimental results show that the two iterative algorithms perform as well as previous ones. It should be pointed out that one of them, that uses the leaving one out technique, has the ability to automatically determine the optimum number of classes. These iterative algorithms are used by the incremental one. On the other hand, the proposed incremental algorithm achieves the best results of the compared algorithms, its behavior is the most regular with the variation of the number of classes and can automatically determine the optimum number of classes.
This paper suggests the use of the DTM technology as a solution to the transmission of applications with strict need of bandwidth, instead of the use of the traditional ATM technology. The DTM is a broadband network a...
详细信息
Trees with labeled edges have widespread applicability, for examplefor the representation of dependency syntax trees. Given a fixednumber of nodes and constraints on how edges may be drawn betweenthem, the task of fin...
Trees with labeled edges have widespread applicability, for examplefor the representation of dependency syntax trees. Given a fixednumber of nodes and constraints on how edges may be drawn betweenthem, the task of finding solution trees is known as a configurationproblem. In this paper, we formalize the configuration problem oflabeled trees and argue that it can be regarded as a constraintsatisfaction problem which can be solved directly and efficiently byconstraint propagation. In particular, we derive and prove correcta formulation of dependency parsing as a constraint satisfactionproblem. Our approach, based on constraints on finite sets and a new family of`selection' constraints, is especially well-suited for the compactrepresentation and efficient processing of ambiguity. We addressvarious issues of interest to the computational linguist such aslexical ambiguity, structural ambiguity, valency constraints,grammatical principles, and linear precedence. Finally we turn to thechallenge of efficient processing and characterize the servicesexpected of a constraint programming system: we define a formalconstraint language and specify its operational semantics withinference rules of propagation and distribution. This framework generalizes our presentation of immediate syntacticdependence for dependency parsing (Duchier, 1999a)and extends naturally to our corresponding treatment of linearprecedence (Duchier and Debusmann, 2001) based on a notion of topological ratherthan syntactic dependencies.
The goal of functional testing is to prove that the software performs in conformance with its specification. Functional testing emphasizes the behavioral characteristics of objects by focusing on the interface that is...
详细信息
ISBN:
(纸本)9789549641332
The goal of functional testing is to prove that the software performs in conformance with its specification. Functional testing emphasizes the behavioral characteristics of objects by focusing on the interface that is the public, and defining, feature of a class. There are functional test cases for each individual method and functional test cases that treat the class as a unified component. An algorithm that guides the construction of functional test cases for a class is presented. That algorithm can easily be modified to produce test cases at a greater level of coverage. The input to the algorithm will be portions of the class specification that is produced to guide the design process as much as for the testing process.
Compiler-directed data speculation has been implemented on Itanium systems to allow for a compiler to move a load across a store even when the two operations are potentially aliased This not only breaks data dependenc...
详细信息
Compiler-directed data speculation has been implemented on Itanium systems to allow for a compiler to move a load across a store even when the two operations are potentially aliased This not only breaks data dependency to reduce critical path length, but also allows a load to be scheduled far apart from its uses to hide cache miss latencies. However, the effectiveness of data speculation is affected by the sophistication of alias analysis technique as well as the aggressiveness of the instruction scheduler. In general, the more sophisticated is the alias analysis technique, the less performance gain is from data speculation, and the more aggressive is the instruction scheduler, the more opportunity is for data speculation. In this paper we evaluate in various scenarios the performance potentials of data speculation for SPEC2000C benchmarks. For each scenario, we determine the performance contributions of data speculation due to both critical path reduction and cache miss latency reduction. We also show interesting statistics about the effects of scheduling constraints, the percentage of critical dependencies, the impacts of cache miss latencies, and the distances between the load locations before and after data speculation.
暂无评论