A Top-k aggregate query, which is a powerful technique when dealing with large quantity of data, ranks groups of tuples by their aggregate values and returns k groups with the highest aggregate values. However, compar...
详细信息
ISBN:
(纸本)9781424467013;9780769540191
A Top-k aggregate query, which is a powerful technique when dealing with large quantity of data, ranks groups of tuples by their aggregate values and returns k groups with the highest aggregate values. However, compared to Top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. As a powerful semantic of Top-k in uncertain database, Global Top-k return k highest-ranked tuples according to their probabilities of being in the Top-k answers in possible worlds. We propose a x-tuple based method to process Global Top-k aggregate queries in uncertain database. Our method has two levels, group state generation and G-x-Top-k query processing. In the former level, group states, which satisfy the properties of x-tuple, are generated one after the other according to their aggregate values, while in the latter level, dynamic programming based Global x-tuple Top-k query processing are employed to return the answers. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions.
In the paper, particle gradient multi-objective evolutionary algorithm (PGMOEA) on GPU is presented. PGMOEA extends the classical particle dynamic multiobjective evolutionary algorithm by incorporating the gradient in...
详细信息
In the paper, particle gradient multi-objective evolutionary algorithm (PGMOEA) on GPU is presented. PGMOEA extends the classical particle dynamic multiobjective evolutionary algorithm by incorporating the gradient information of each particle from evolutionary programming. We perform experiments to compare PGMOEA on GPU with PGMOEA on CPU and demonstrate that PGMOEA on GPU is much more effective and efficient than PGMOEA on CPU.
Much research has been done on integrated use of ISO management system standards. Integrated use of management systems is identified to have shared values of varied integration impacts on resources efficiency building...
详细信息
Much research has been done on integrated use of ISO management system standards. Integrated use of management systems is identified to have shared values of varied integration impacts on resources efficiency building and sustainable development of business processes. However, little research has been done on integrated use of business continuity management systems (BCMS), records management systems (RMS) and knowledge management systems (KMS). This paper proposes a holistic integration management approach for collaboration, optimization and innovation of the three management systems through mapping/building/operationalizing cycle for supply of efficiency building strategy to the dynamic accumulation, sharing, and exchanges of memory, evidence and knowledge of organization.
Developing an integration management system for business continuity, records and knowledge (IMS of BRK) is beneficial to the collaboration, optimization and innovation of business continuity management system (BCMS), ...
详细信息
Developing an integration management system for business continuity, records and knowledge (IMS of BRK) is beneficial to the collaboration, optimization and innovation of business continuity management system (BCMS), records management system (RMS) and knowledge management system (KMS) for organization. Comprehensive research and development requirements along with a cogent framework, however, have not been proposed for integrating three of them, which were proposed independently. Based on situational analysis of cross boundaries integration feasibilities in terms of common understandings, general principles and best practice frameworks from relevant national and international standards, this paper proposes integration thinking to combine the advantages of the three paradigms to sustainable competitive advantages; supported by international best practices, the authors propose an integration route covering five levels of integration framework, two integration approaches and three integration controls for dynamic accumulation, sharing and exchange of evidence, memory and knowledge in digital world and global competition.
A multi-objective particle swarm optimization algorithm based on ε- dominance is proposed. The ε-dominance is applied to update the external set in order to obtain the Pareto set with better distribution, and the d...
详细信息
A multi-objective particle swarm optimization algorithm based on ε- dominance is proposed. The ε-dominance is applied to update the external set in order to obtain the Pareto set with better distribution, and the dynamic adjustment strategy, which made the algorithm achieving the search and approximation to the Pareto set, is adopted in the iterative process of the ε-Pareto solution set. Three benchmark cases were tested and the results show that this algorithm is much more efficient than the DNPSO.
Top-k query is a powerful technique in uncertain databases because of the existence of exponential possible worlds, and it is necessary to combine score and confidence of tuples to derive top k answers. Different sema...
详细信息
Top-k query is a powerful technique in uncertain databases because of the existence of exponential possible worlds, and it is necessary to combine score and confidence of tuples to derive top k answers. Different semantics, the combination methods of score and confidence, lead to different results. U-kRanks and Global Top-k are two semantics of Top-k queries in uncertain database, which consider every alternative in x-tuple as single one and return the tuple which has the highest probability appearing at top k or a given rank. However, no matter which alternative (tuple) of an x-tuple appears in a possible world, it undoubtedly believes that this x-tuple appears in the same possible world accordingly. Thus, instead of ranking every individual tuple, we define two novel Top-k queries semantics in uncertain database, Uncertain x-kRanks queries (U-x-kRanks) and Global x-Top-k queries (G-x-Top-k), which return k entities according to the score and the confidence of alternatives in x-tuple, respectively. In order to reduce the search space, we present an efficient algorithm to process U-x-kRanks queries and G-x-Top-k queries. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions.
Based on chaotic Tent map, this paper proposed a new 5×L (L≥32) bits extensible Hash function with symmetric keys. The structure only performed Boolean algorithm and shift operation. In order to generate fast di...
详细信息
Based on chaotic Tent map, this paper proposed a new 5×L (L≥32) bits extensible Hash function with symmetric keys. The structure only performed Boolean algorithm and shift operation. In order to generate fast diffusion, confusion and avalanche effect, Chaos series were embedded in the whole algorithm. The security against statistical attack, birthday attack were analyzed in detail. Many simulations were shown that the Hash value was highly sensitive to initial condition and parameter, and also to a message bit. Performance comparisons with MD5 showed that this scheme was a feasible scheme, and can be applied in e-commerce.
Our previous work has preliminarily investigated the batch processing model and its implementation. To solve the problem of setting batch processing areas for the applications of batch processing in workflow, this pap...
详细信息
Our previous work has preliminarily investigated the batch processing model and its implementation. To solve the problem of setting batch processing areas for the applications of batch processing in workflow, this paper proposes a method of discovering batch processing area from workflow logs. Its mining process includes phrases of mining initial workflow model, identifying batch processing feature of activity and discovering batch processing area in the initial workflow model. The result of simulation experiments shows that this method can work effectively for several different size of data sets.
Batch processing process denotes the process used in the workflow management systems (WfMSs) supporting dynamic batch processing. During the run time of their concurrent process instances, multiple activity cases of t...
详细信息
Batch processing process denotes the process used in the workflow management systems (WfMSs) supporting dynamic batch processing. During the run time of their concurrent process instances, multiple activity cases of the same type may be vertically combined together according to some batch logics and submitted for execution as a whole. Therefore, it is necessary to study the actual way process instances are executed. In this paper, we propose an algorithm to mine batch processing process from system logs. A case study is also done to illustrate its effectiveness.
暂无评论