996 resultados para Boolean operations


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We propose a more general method for detecting a set of entanglement measures, i.e., negativities, in an arbitrary tripartite quantum state by local operations and classical communication. To accomplish the detection task using this method, three observers do not need to perform partial transposition maps by the structural physical approximation; instead, they only need to collectively measure some functions via three local networks supplemented by a classical communication. With these functions, they are able to determine the set of negativities related to the tripartite quantum state.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present a modified method for detecting the concurrence in an arbitrary two-qubit quantum state rho(AB) with local operations and classical communication. In this method, it is not necessary for the two observers to prepare the quantum state rho(AB) by the structural physical approximation. Their main task is to measure four specific functions via two local quantum networks. With these functions they can determine the concurrence and then the entanglement of formation.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Knowledge management is a critical issue for the next-generation web application, because the next-generation web is becoming a semantic web, a knowledge-intensive network. XML Topic Map (XTM), a new standard, is appearing in this field as one of the structures for the semantic web. It organizes information in a way that can be optimized for navigation. In this paper, a new set of hyper-graph operations on XTM (HyO-XTM) is proposed to manage the distributed knowledge resources.HyO-XTM is based on the XTM hyper-graph model. It is well applied upon XTM to simplify the workload of knowledge management.The application of the XTM hyper-graph operations is demonstrated by the knowledge management system of a consulting firm. HyO-XTM shows the potential to lead the knowledge management to the next-generation web.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The primary goal of this research is to develop theoretical tools for analysis, synthesis, application of primitive manipulator operations. The primary method is to extend and apply traditional tools of classical mechanics. The results are of such a general nature that they address many different aspects of industrial robotics, including effector and sensor design, planning and programming tools and design of auxiliary equipment. Some of the manipulator operations studied are: (1) Grasping an object. The object will usually slide and rotate during the period between first contact and prehension. (2) Placing an object. The object may slip slightly in the fingers upon contact with the table as the base aligns with the table. (3) Pushing. Often the final stage of mating two parts involves pushing one object into the other.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper discusses the use of relation algebra operations on formal contexts. These operations are a generalisation of some of the context operations that are described in the standard FCA textbook (Ganter & Wille, 1999). This paper extends previous research in this area with respect to applications and implementations. It also describes a software tool (FcaFlint) which in combination with FcaStone facilitates the application of relation algebra operations to contexts stored in many formats.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Reducing the energy consumption of water distribution networks has never had more significance. The greatest energy savings can be obtained by carefully scheduling the operations of pumps. Schedules can be defined either implicitly, in terms of other elements of the network such as tank levels, or explicitly by specifying the time during which each pump is on/off. The traditional representation of explicit schedules is a string of binary values with each bit representing pump on/off status during a particular time interval. In this paper, we formally define and analyze two new explicit representations based on time-controlled triggers, where the maximum number of pump switches is established beforehand and the schedule may contain less switches than the maximum. In these representations, a pump schedule is divided into a series of integers with each integer representing the number of hours for which a pump is active/inactive. This reduces the number of potential schedules compared to the binary representation, and allows the algorithm to operate on the feasible region of the search space. We propose evolutionary operators for these two new representations. The new representations and their corresponding operations are compared with the two most-used representations in pump scheduling, namely, binary representation and level-controlled triggers. A detailed statistical analysis of the results indicates which parameters have the greatest effect on the performance of evolutionary algorithms. The empirical results show that an evolutionary algorithm using the proposed representations improves over the results obtained by a recent state-of-the-art Hybrid Genetic Algorithm for pump scheduling using level-controlled triggers.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper reprots on the use of banchmarking to improve the links between business and operations strategies. The use of benchmarking as a toll to facilitate improvements in these crucial links is examined. The existing literature on process benchmarking is used to from a structured questionnaire to apply to six case studies of major manuifacturing companies. Four of these case studies are presented in this paper to highlight the use of benchmarking in this application. Initial researh results are presented drawing upon the critical success factors indentified both in the literature and on the case results. Recommendations for further work are outlined