The article presents the results of experimental research of thermal processes in industrial premises with energy-saving technologies of heating and their analysis by geometric modeling tools and graphic computer tech...
详细信息
The article presents the results of experimental research of thermal processes in industrial premises with energy-saving technologies of heating and their analysis by geometric modeling tools and graphic computer technologies. The effectiveness of using the method of forced feeding of air heated by infrared emitter involving compromise graphical optimization was analyzed by geometric way.
Due to the enormous processing gains that are theoretically achievable by using quantum algorithms instead of classical algorithms to solve rather generic classes of numerical problems, it makes sense that one should ...
详细信息
ISBN:
(纸本)0780388739
Due to the enormous processing gains that are theoretically achievable by using quantum algorithms instead of classical algorithms to solve rather generic classes of numerical problems, it makes sense that one should evaluate their potential applicability, appropriateness, and efficiency for solving virtually any computationally intensive task. Since many types of control and optimization problems may be couched in terms of partially observable Markov decision processes (POMDPs), and since solutions to these types of problems are invariably extremely difficult to obtain, the use of quantum algorithms to help solve POMDP problems is investigated here. Quantum algorithms are indeed found likely to provide significant efficiency improvements in several computationally intensive tasks associated with solving POMDPs, particularly in the areas of searching, optimization, and parameter optimization and estimation.
Due to the enormous processing gains that are theoretically achievable by using quantum algorithms instead of classical algorithms to solve rather generic classes of numerical problems, it makes sense that one should ...
详细信息
Due to the enormous processing gains that are theoretically achievable by using quantum algorithms instead of classical algorithms to solve rather generic classes of numerical problems, it makes sense that one should evaluate their potential applicability, appropriateness, and efficiency for solving virtually any computationally intensive task. Since many types of control and optimization problems may be couched in terms of partially observable Markov decision processes (POMDPs), and since solutions to these types of problems are invariably extremely difficult to obtain, the use of quantum algorithms to help solve POMDP problems is investigated here. Quantum algorithms are indeed found likely to provide significant efficiency improvements in several computationally intensive tasks associated with solving POMDPs, particularly in the areas of searching, optimization, and parameter optimization and estimation.
Decision procedures aggregating the preferences of multiple agents can produce cycles and hence outcomes which have been described heuristically as “chaotic.” We make this description precise by constructing an expl...
Decision procedures aggregating the preferences of multiple agents can produce cycles and hence outcomes which have been described heuristically as “chaotic.” We make this description precise by constructing an explicit dynamical system from the agents' preferences and a voting rule. The dynamics form a one-dimensional statistical mechanics model; this suggests the use of the topological entropy to quantify the complexity of the system. We compute the expected complexity of a voting rule and the degree of cohesion/diversity among agents using random matrix models—ensembles of statistical mechanics models—in some representative cases.
The one-particle sector of the simplest one-dimensional quantum lattice-gas automaton has been observed to simulate both the (relativistic) Dirac and (nonrelativistic) Schrodinger equations, in different continuum lim...
详细信息
The one-particle sector of the simplest one-dimensional quantum lattice-gas automaton has been observed to simulate both the (relativistic) Dirac and (nonrelativistic) Schrodinger equations, in different continuum limits. By analyzing the discrete analogues of plane waves in this sector we find conserved quantities corresponding to energy and momentum. We show that the Klein paradox obtains so that in some regimes the model must be considered to be relativistic and the negative energy modes interpreted as positive energy modes of antiparticles. With a formally similar approach - the Bethe ansatz - we find the evolution eigenfunctions in the two-particle sector of the quantum lattice-gas automaton and conclude by discussing consequences of these calculations and their extension to more particles, additional velocities, and higher dimensions.
Classical lattice gas automata effectively simulate physical processes, such as diffusion and fluid flow (in certain parameter regimes), despite their simplicity at the microscale. Motivated by current interest in qua...
Classical lattice gas automata effectively simulate physical processes, such as diffusion and fluid flow (in certain parameter regimes), despite their simplicity at the microscale. Motivated by current interest in quantum computation we recently defined quantum lattice gas automata; in this paper we initiate a project to analyze which physical processes these models can effectively simulate. Studying the single particle sector of a one-dimensional quantum lattice gas we find discrete analogs of plane waves and wave packets, and then investigate their behavior in the presence of inhomogeneous potentials.
A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, we begin an investigation of exactly unitary cellular automata. After proving that there...
详细信息
A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, we begin an investigation of exactly unitary cellular automata. After proving that there can be no nontrivial, homogeneous, local, unitary, scalar cellular automaton in one dimension,we weaken the homogeneity condition and show that there are nontrivial, exactly unitary, partitioning cellular automata. We find a one-parameter Family of evolution rules which are best interpreted as those for a one-particle quantum automaton. This model is naturally reformulated as a two component cellular automaton which we demonstrate to limit to the Dirac equation. We describe two generalizations of this automaton, the second of which, to multiple interacting particles, is the correct definition of a quantum lattice gas.
Failure to find homogeneous scalar unitary cellular automata (CA) in one dimension led to consideration of only ''approximately unitary'' CA - which motivated our recent proof of a No-go Lemma in one d...
详细信息
Failure to find homogeneous scalar unitary cellular automata (CA) in one dimension led to consideration of only ''approximately unitary'' CA - which motivated our recent proof of a No-go Lemma in one dimension. In this note we extend the one dimensional result to prove the absence of nontrivial homogeneous scalar unitary CA on Euclidean lattices in any dimension.
In most virtual reality applications, 3-d space is a passive, ambient continuum in which the objects of study are placed. When the 3-d space itself is the object of study, as with mathematical manifolds, VR is especia...
ISBN:
(纸本)9780897917360
In most virtual reality applications, 3-d space is a passive, ambient continuum in which the objects of study are placed. When the 3-d space itself is the object of study, as with mathematical manifolds, VR is especially important as a visualization medium. We describe the visualization of such spaces in the CAVE virtual environment.
暂无评论