Radial Basis Function (RBF) networks are widely applied in function approximation, system identification, chaotic time series forecasting, etc. To use a RBF network, a training algorithm is absolutely necessary for de...
详细信息
ISBN:
(纸本)3540464816
Radial Basis Function (RBF) networks are widely applied in function approximation, system identification, chaotic time series forecasting, etc. To use a RBF network, a training algorithm is absolutely necessary for determining the network parameters. The existing training algorithms, such as Orthogonal Least Squares (OLS) algorithm, clustering and gradient descent algorithm, have their own shortcomings. In this paper, we make an attempt to explore the applicability of quantum-behaved Particle Swarm Optimization, a newly proposed evolutionary search technique, in training RBF neural network. The proposed QPSO-Trained RBF network was test on nonlinear system identification problem, and the results show that it can identifying the system more quickly and precisely than that trained by Particle Swarm algorithm.
quantum computing is an important field of research that applies concepts of quantum physics to building more efficient computers. Although only rudimentary quantum computers have been built so far, many researchers b...
详细信息
ISBN:
(纸本)9780387446394
quantum computing is an important field of research that applies concepts of quantum physics to building more efficient computers. Although only rudimentary quantum computers have been built so far, many researchers believe that quantum computing has great potential and the quantum computers can efficiently perform some tasks which are otherwise not feasible on a classical computer. The Hamiltonian cycle problem is to determine whether a given graph has a Hamiltonian cycle or not. This problem belongs to the class of NP-complete problems, widely believed to intractable or hard on classical computers. Design of faster-than-classical quantumalgorithms for important algorithmic problems has been an interesting intellectual adventure and achievement all along and their existence keeps being one of the key stimuli to those trying to overcome enormous technology problems to build (powerful) quantum computers. In this paper, we have used undirected graphs with varied number of vertices and we have shown how to determine the existence of a Hamiltonian cycle in a given graph. We have also illustrated how quantum search can be applied to obtain the solution of the Hamiltonian cycle problem much faster than the classical approach.
Computers today become faster by becoming smaller. By reducing the size of transistors, engineers are able to fit more of them on a given size microprocessor, thus increasing the processor's computational power. T...
详细信息
ISBN:
(纸本)1595933158
Computers today become faster by becoming smaller. By reducing the size of transistors, engineers are able to fit more of them on a given size microprocessor, thus increasing the processor's computational power. This process cannot continue forever. It has been estimated that sometime within the next two decades, at the current rate, engineers will be faced with the problem of building something that is smaller than an atom. This is as far as our current "classical" computing paradigm will take us. quantum computing is a potential solution to this problem. This paradigm of computing seeks to directly exploit quantum mechanical phenomena to perform calculations or in some way boost computational efficiency. Some problems can theoretically be solved on a quantum computer exponentially faster than on a, classical computer. An overview of the subject is provided here with emphasis on quantuminformationprocessing and physical realizations of a quantum computer. Included is a brief history of the subject, a discussion of quantum computing notions such as parallelism and entanglement and their use in quantumalgorithms, and conjecture on the prospects and pitfalls of this theory. Copyright 2006 ACM.
This paper considers kernel density estimation for unsupervised data classification. A new methodology is proposed for finding the kernel scale using Bayesian statistics. K-nearest neighbourhoods are sampled by consid...
详细信息
The proceedings contain 29 papers. The topics discussed include: optimization of spanning tree adders;estimating adders for a low density parity check decoder;sublinear constant multiplication algorithms;new identitie...
详细信息
ISBN:
(纸本)0819463922
The proceedings contain 29 papers. The topics discussed include: optimization of spanning tree adders;estimating adders for a low density parity check decoder;sublinear constant multiplication algorithms;new identities and transformations for hardware power operators;interconnection scheme for networks of online modules;reconfigurable architecture for the efficient solution of large-scale non-Hermitian eigenvalue problems;high-resolution iris image reconstruction from low-resolution imagery;using mean-squared error to assess visual image quality;time-frequency analysis of classical and quantum noise;application of time-frequency analysis methods to speaker verification;time-frequency decomposition based on information;time-frequency approximations with applications to filtering, modulation, and propagation;and on the development of a high-order texture analysis using the PWD and Rènyl entropy.
The process of disguising a plaintext into ciphertext is called encryption and back into plaintext is called decryption. A cryptographic algorithm, is also called a cipher, is the mathematical function used for encryp...
详细信息
ISBN:
(纸本)9780387446394
The process of disguising a plaintext into ciphertext is called encryption and back into plaintext is called decryption. A cryptographic algorithm, is also called a cipher, is the mathematical function used for encryption and decryption. Many algorithms are available for this purpose. Triple DES is such an algorithm. Encryption using triple DES is possible in two different ways;they are triple DES with two keys and triple DES with three different keys. Cryptanalysis can be used to recover the plaintext of a message from the ciphertext without access to or knowing the key. Exhaustive key search remains the most practical and efficient attack on Triple DES with two keys. The principles of quantum mechanics can be used to build and analyze a quantum computer and its algorithms. quantum searching is one such algorithm. The key search in Triple DES with two keys is possible using quantum search algorithm, which is more efficient compare to any other methods. In this paper we are presenting how quantum search can be used to crack Triple DES with two keys searching for a key.
The computational resources used for science and research in particular and in daily life in general are approaching an unavoidable limit. This limit is set by the relevance of a quantum mechanical description of the ...
The computational resources used for science and research in particular and in daily life in general are approaching an unavoidable limit. This limit is set by the relevance of a quantum mechanical description of the system used for the computation and determined by the presence or absence of disturbing quantum effects. This happens because the ideas behind the development of computational hardware in the last decades has relied on the rules of classical physics. Following the miniaturization undergone by the components used for data processing the quantum effects might soon not be negligible and the classi- cal description could become inaccurate. The field of quantum computation aims to offer solutions on this issue by creating and us- ing a purely quantum system to make computations. Theoretical and experimental results have proven that constructing a computational system described by quantum mechanical laws is feasible. Additionally, such device might indeed enhance the computational power required for at least some selected problems outperforming the current technologies. The general ideas and principles that such technology should follow in the first stage are well settled and backed by research on different areas in physics and information science. On the other hand, efforts towards building the actual devices capable of handling the quan- tum systems are still in a development stage. Among the main issues to be solved is to find out an appropriate physical system in which to carry out the computations and storing information. The physical processes required to manipulate the quantum system and drive the desired computational algorithms also still need to be found. One of the approaches currently being investigated to provide the physical system as well as the set of tools necessary to perform the logic operations is that referred as the rare-earth ions doped crystals for quantum computing scheme. There are promising re- sults that make this approach interest
Entanglement has been termed a critical resource for quantuminformationprocessing and is thought to be the reason that certain quantumalgorithms, such as Shor's factoring algorithm, can achieve exponentially be...
详细信息
Entanglement has been termed a critical resource for quantuminformationprocessing and is thought to be the reason that certain quantumalgorithms, such as Shor's factoring algorithm, can achieve exponentially better performance than their classical counterparts. The nature of this resource is still not fully understood: here we use numerical simulation to investigate how entanglement between register qubits varies as Shor's algorithm is run on a quantum computer. The shifting patterns in the entanglement are found to relate to the choice of basis for the quantum Fourier transform.
In addition to treating quantum communication, entanglement, error correction, and algorithms in great depth, this book also addresses a number of interesting miscellaneous topics, such as Maxwell's demon, Landaue...
详细信息
ISBN:
(数字)9780191706783
ISBN:
(纸本)9780199215706
In addition to treating quantum communication, entanglement, error correction, and algorithms in great depth, this book also addresses a number of interesting miscellaneous topics, such as Maxwell's demon, Landauer's erasure, the Bekenstein bound, and Caratheodory's treatment of the second law of thermodynamics. All mathematical derivations are based on clear physical pictures which make even the most involved results — such as the Holevo bound — look comprehensible and transparent. quantuminformation is a fascinating topic precisely because it shows that the laws of informationprocessing are actually dependent on the laws of physics. However, it is also very interesting to see that information theory has something to teach us about physics. Both of these directions are discussed throughout the book. Other topics covered in the book are quantum mechanics, measures of quantum entanglement, general conditions of quantum error correction, pure state entanglement and Pauli matrices, pure states and Bell's inequalities, and computational complexity of quantumalgorithms.
quantum computation has shown a lot of promise in being able to provide computational results not possible with the modern computer. However, the design of new algorithms has been slow. One reason for this could be th...
详细信息
quantum computation has shown a lot of promise in being able to provide computational results not possible with the modern computer. However, the design of new algorithms has been slow. One reason for this could be that we simply do not understand this new paradigm of computation enough to fully utilize it. We present here is an improvement of our previous generalization the basic quantum gates and a new perspective on quantum computation and quantuminformation. The goal is to obtain a more abstract approach to quantum computation and quantumalgorithms in which physical systems are viewed as the implementation for the computing paradigm and not the reason for the it
暂无评论