925 resultados para LOGIC GATE
Resumo:
Mode of access: Internet.
Resumo:
Includes bibliography.
Resumo:
Mode of access: Internet.
Resumo:
At head of cover title: Generalized computer program.
Resumo:
Mode of access: Internet.
Resumo:
This paper proposes a novel application of fuzzy logic to web data mining for two basic problems of a website: popularity and satisfaction. Popularity means that people will visit the website while satisfaction refers to the usefulness of the site. We will illustrate that the popularity of a website is a fuzzy logic problem. It is an important characteristic of a website in order to survive in Internet commerce. The satisfaction of a website is also a fuzzy logic problem that represents the degree of success in the application of information technology to the business. We propose a framework of fuzzy logic for the representation of these two problems based on web data mining techniques to fuzzify the attributes of a website.
Resumo:
We calculate the electron exchange coupling for a phosphorus donor pair in silicon perturbed by a J-gate potential and the boundary effects of the silicon host geometry. In addition to the electron-electron exchange interaction we also calculate the contact hyperfine interaction between the donor nucleus and electron as a function of the varying experimental conditions. Donor separation, depth of the P nuclei below the silicon oxide layer and J-gate voltage become decisive factors in determining the strength of both the exchange coupling and hyperfine interaction-both crucial components for qubit operations in the Kane quantum computer. These calculations were performed using an anisotropic effective-mass Hamiltonian approach. The behaviour of the donor exchange coupling as a function of the parameters varied in this work provides relevant information for the experimental design of these devices.
Resumo:
Race is fundamental in shaping the development of Australian law just as it has played its part in other former colonies, such as the United States, where a body of critical race theory has been established on the basis of this premise. Drawing on this theory I argue that the possessive logic of patriarchal white sovereignty works ideologically to naturalise the nation as a white possession by informing and circulating a coherent set of meanings about white possession as part of common sense knowledge and socially produced conventions in the High Court's Yorta Yorta decision.
Resumo:
Photon counting induces an effective non-linear optical phase shift in certain states derived by linear optics from single photons. Although this non-linearity is non-deterministic, it is sufficient in principle to allow scalable linear optics quantum computation (LOQC). The most obvious way to encode a qubit optically is as a superposition of the vacuum and a single photon in one mode-so-called 'single-rail' logic. Until now this approach was thought to be prohibitively expensive (in resources) compared to 'dual-rail' logic where a qubit is stored by a photon across two modes. Here we attack this problem with real-time feedback control, which can realize a quantum-limited phase measurement on a single mode, as has been recently demonstrated experimentally. We show that with this added measurement resource, the resource requirements for single-rail LOQC are not substantially different from those of dual-rail LOQC. In particular, with adaptive phase measurements an arbitrary qubit state a alpha/0 > + beta/1 > can be prepared deterministically.
Resumo:
We describe an approach for characterizing the process performed by a quantum gate using quantum process tomography, by first modeling the gate in an extended Hilbert space, which includes nonqubit degrees of freedom. To prevent unphysical processes from being predicted, present quantum process tomography procedures incorporate mathematical constraints, which make no assumptions as to the actual physical nature of the system being described. By contrast, the procedure presented here assumes a particular class of physical processes, and enforces physicality by fitting the data to this model. This allows quantum process tomography to be performed using a smaller experimental data set, and produces parameters with a direct physical interpretation. The approach is demonstrated by example of mode matching in an all-optical controlled-NOT gate. The techniques described are general and could be applied to other optical circuits or quantum computing architectures.
Resumo:
This paper defines the 3D reconstruction problem as the process of reconstructing a 3D scene from numerous 2D visual images of that scene. It is well known that this problem is ill-posed, and numerous constraints and assumptions are used in 3D reconstruction algorithms in order to reduce the solution space. Unfortunately, most constraints only work in a certain range of situations and often constraints are built into the most fundamental methods (e.g. Area Based Matching assumes that all the pixels in the window belong to the same object). This paper presents a novel formulation of the 3D reconstruction problem, using a voxel framework and first order logic equations, which does not contain any additional constraints or assumptions. Solving this formulation for a set of input images gives all the possible solutions for that set, rather than picking a solution that is deemed most likely. Using this formulation, this paper studies the problem of uniqueness in 3D reconstruction and how the solution space changes for different configurations of input images. It is found that it is not possible to guarantee a unique solution, no matter how many images are taken of the scene, their orientation or even how much color variation is in the scene itself. Results of using the formulation to reconstruct a few small voxel spaces are also presented. They show that the number of solutions is extremely large for even very small voxel spaces (5 x 5 voxel space gives 10 to 10(7) solutions). This shows the need for constraints to reduce the solution space to a reasonable size. Finally, it is noted that because of the discrete nature of the formulation, the solution space size can be easily calculated, making the formulation a useful tool to numerically evaluate the usefulness of any constraints that are added.
Resumo:
We demonstrate a new architecture for an optical entangling gate that is significantly simpler than previous realizations, using partially polarizing beam splitters so that only a single optical mode-matching condition is required. We demonstrate operation of a controlled-z gate in both continuous-wave and pulsed regimes of operation, fully characterizing it in each case using quantum process tomography. We also demonstrate a fully resolving, nondeterministic optical Bell-state analyzer based on this controlled-z gate. This new architecture is ideally suited to guided optics implementations of optical gates.
Resumo:
We investigate the use of nanocrystal quantum dots as a quantum bus element for preparing various quantum resources for use in photonic quantum technologies. Using the Stark-tuning property of nanocrystal quantum dots as well as the biexciton transition, we demonstrate a photonic controlled-NOT (CNOT) interaction between two logical photonic qubits comprising two cavity field modes each. We find the CNOT interaction to be a robust generator of photonic Bell states, even with relatively large biexciton losses. These results are discussed in light of the current state of the art of both microcavity fabrication and recent advances in nanocrystal quantum dot technology. Overall, we find that such a scheme should be feasible in the near future with appropriate refinements to both nanocrystal fabrication technology and microcavity design. Such a gate could serve as an active element in photonic-based quantum technologies.
Resumo:
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of logic programs. In particular, we give a translation of a defeasible theory D into a meta-program P(D). We show that under a condition of decisiveness, the defeasible consequences of D correspond exactly to the sceptical conclusions of P(D) under the stable model semantics. Without decisiveness, the result holds only in one direction (all defeasible consequences of D are included in all stable models of P(D)). If we wish a complete embedding for the general case, we need to use the Kunen semantics of P(D), instead.