Accumulating commonsense knowledge (CK) has proven very useful for many natural language processing tasks. So far the most reliable way of acquisition is still relying on knowledge contributors to offer CK. Unfortunat...
详细信息
Decoding algorithms for syntax based machine translation suffer from high computational complexity, a consequence of intersecting a language model with a context free grammar. Left-to-right decoding, which generates t...
详细信息
ISBN:
(纸本)9781622765034
Decoding algorithms for syntax based machine translation suffer from high computational complexity, a consequence of intersecting a language model with a context free grammar. Left-to-right decoding, which generates the target string in order, can improve decoding efficiency by simplifying the language model evaluation. This paper presents a novel left to right decoding algorithm for tree-to-string translation, using a bottom-up parsing strategy and dynamic future cost estimation for each partial translation. Our method outperforms previously published tree-to-string decoders, including a competing left-to-right method.
Searching frequent patterns in transactional databases is considered as one of the most important data mining problems and Apriori is one of the typical algorithms for this task. Developing fast and efficient algorith...
详细信息
Crowd sourcing (CS) systems offer a new way for businesses and individuals to leverage on the power of mass collaboration to accomplish complex tasks in a divide-and-conquer manner. In existing CS systems, no facility...
Crowd sourcing (CS) systems offer a new way for businesses and individuals to leverage on the power of mass collaboration to accomplish complex tasks in a divide-and-conquer manner. In existing CS systems, no facility has been provided for analyzing the trustworthiness of workers and providing decision support for allocating tasks to workers, which leads to high dependency of the quality of work on the behavior of workers in CS systems as shown in this paper. To address this problem, trust management mechanisms are urgently needed. Traditional trust management techniques are focused on identifying the most trustworthy service providers (SPs) as accurately as possible. Little thoughts were given to the question of how to utilize these SPs due to two common assumptions: 1) an SP can serve an unlimited number of requests in one time unit, and 2) a service consumer (SC) only needs to select one SP for interaction to complete a task. However, in CS systems, these two assumptions are no longer valid. Thus, existing models cannot be directly used for trust management in CS systems. This paper takes the first step towards a systematic investigation of trust management in CS systems by extending existing trust management models for CS trust management and conducting extensive experiments to study and analyze the performance of various trust management models in crowd sourcing. In this paper, the following key contributions are made. We 1) propose extensions to existing trust management approaches to enable them to operate in CS systems, 2) design a simulation test-bed based on the system characteristics of Amazon's Mechanical Turk (AMT) to make evaluation close to practical CS systems, 3) discuss the effect of incorporating trust management into CS system on the overall social welfare, and 4) identify the challenges and opportunities for future trust management research in CS systems.
Relational Database Model (RDM) has been proven to be a very useful data-storage technique. As information is stored as data in relational databases, the induction of concepts from data is a pivotal topic in the data ...
详细信息
The Web Services Business Process Execution Language (BPEL) is a language used to specify compositions of web services. In the last few years, a considerable amount of work has been done on modeling (parts of) BPE...
详细信息
The Web Services Business Process Execution Language (BPEL) is a language used to specify compositions of web services. In the last few years, a considerable amount of work has been done on modeling (parts of) BPEL and developing verification techniques and tools for BPEL. Petri nets and formal languages have been widely used to model Web services composition, but temporal value passing calculus of communicating systems (TVPCCS) language seems to be more adequate for several reasons. Generally BPEL programs are mapped to other languages and then the verification is performed, A more promising way is to directly build TVPCCS model, to check it and then map it to a BPEL process model. This paper describes a mapping from TVPCCS onto BPEL process model.
Some expanded fuzzy rough sets models have been investigated to handle fuzzy databases with uncertain, imprecise and incomplete real-valued information. In this paper, we make further research on fuzzy rough sets mode...
详细信息
Some expanded fuzzy rough sets models have been investigated to handle fuzzy databases with uncertain, imprecise and incomplete real-valued information. In this paper, we make further research on fuzzy rough sets models in fuzzy environment, and we generalize rough fuzzy sets model based on a covering to fuzzy rough sets model based on a fuzzy covering. The lower and upper approximations of fuzzy subsets are defined based on a fuzzy covering, and basic properties are investigated. Then, the axiom definition of the lower approximation operator is given. It is shown that the rough fuzzy sets model based on a covering is a special instance of the fuzzy rough sets model based on a fuzzy covering.
The Web Services Business Process Execution Language (BPEL) is a language used to specify compositions of web *** the last few years,a considerable amount of work has been done on modeling (parts of) BPEL and developi...
详细信息
The Web Services Business Process Execution Language (BPEL) is a language used to specify compositions of web *** the last few years,a considerable amount of work has been done on modeling (parts of) BPEL and developing verification techniques and tools for *** nets and formal languages have been widely used to model Web services composition,but temporal value passing calculus of communicating systems (TVPCCS) language seems to be more adequate for several *** BPEL programs are mapped to other languages and then the verification is performed,A more promising way is to directly build TVPCCS model,to check it and then map it to a BPEL process *** paper describes a mapping from TVPCCS onto BPEL process model.
Most of quantum codes have been constructed by using classical linear codes over finite field. However, little is known about the construction of quantum codes from symmetric designs. In this work, we present the cons...
详细信息
The motivation for this work was that little is known about the construction of asymmetric quantum error-correcting codes from linear codes over finite rings. In this work, attempts are made to construct asymmetric qu...
详细信息
The motivation for this work was that little is known about the construction of asymmetric quantum error-correcting codes from linear codes over finite rings. In this work, attempts are made to construct asymmetric quantum error-correcting codes from linear codes over finite rings Zp2, where p is any prime. Furthermore, we present explicit parameters for infinite families of asymmetric quantum error correcting codes which derived from linear over finite rings.
暂无评论