A group key assignment scheme based on multi-dimensional space circle properties is proposed, which enable the members of a group to obtain the group key by both the public information published on the notice board an...
详细信息
A group key assignment scheme based on multi-dimensional space circle properties is proposed, which enable the members of a group to obtain the group key by both the public information published on the notice board and the secret information of their own. The proposed scheme can be divided into three phases: user registration, group key assignment, and group key computation. The proposed scheme has such advantages as easy operations of group key update and member's join/leave, and the security properties of forward secrecy and backward secrecy.
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...
详细信息
Crowd sourcing (CS) systems offer a new way for businesses and individuals to leverage on the power of mass collab.ration 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 collab.ration 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.
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.
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 ...
详细信息
Software testing is the key validation technique used by industry up to today, but remain error prone and expensive cost. Automatically generating test cases from formal models of the system under test is a promising ...
详细信息
Software testing is the key validation technique used by industry up to today, but remain error prone and expensive cost. Automatically generating test cases from formal models of the system under test is a promising improvement approach to cut down the testing cost. This paper introduces a technique that automatically generate real-time conformance test cases from timed automata specifications. First, both reactive system and its environment is modeled by restricted automata with the notion of deterministic, input enabled and output urgent. Then demonstration is given to show how to efficiently generate real-time test cases with optimal execution time from diagnostic trace. Finally, we formally specify user's single purpose or coverage criteria to convert the test case generation problem into a reachability problem. This approach is implemented using model checkers as test case generation tools and experiment results on three different coverage criteria specifications show feasibility and effectiveness of our technique.
Using Particle Swarm Optimization to handle complex functions with high-dimension it has the problems of low convergence speed and sensitivity to local convergence. The convergence of particle swarm algorithm is studi...
详细信息
Using Particle Swarm Optimization to handle complex functions with high-dimension it has the problems of low convergence speed and sensitivity to local convergence. The convergence of particle swarm algorithm is studied from the dynamic system theory, and the condition for the convergence of particle swarm algorithm is given. The analysis provided qualitative guidelines for the general algorithm parameter selection. Results of numerical tests show the efficiency of the results.
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.
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.
In this paper, we propose a method to improve adaptive loop filter (ALF) efficiency with temporal prediction. For one frame, two sets of adaptive loop filter parameters are adaptively selected by rate distortion optim...
详细信息
In this paper, we propose a method to improve adaptive loop filter (ALF) efficiency with temporal prediction. For one frame, two sets of adaptive loop filter parameters are adaptively selected by rate distortion optimization. The first set of ALF parameters is estimated by minimizing the mean square error between the original frame and the current reconstructed frame. The second set of filter parameters is the one that is used in the latest prior frame. The proposed algorithm is implemented in HM3.0 software. Compared with the HM3.0 anchor, the proposed method achieves 0.4%, 0.3% and 0.3% BD bitrate reduction in average for high efficiency low delay B, high efficiency low delay P and high efficiency random access configuration, respectively. The encoding and decoding time increase by 1% and 2% on average, respectively.
暂无评论