A quantum BP neural networks model with learning algorithm is proposed. First, based on the universality of single qubit rotation gate and two-qubit controlled-NOT gate, a quantum neuron model is constructed, which is...A quantum BP neural networks model with learning algorithm is proposed. First, based on the universality of single qubit rotation gate and two-qubit controlled-NOT gate, a quantum neuron model is constructed, which is composed of input, phase rotation, aggregation, reversal rotation and output. In this model, the input is described by qubits, and the output is given by the probability of the state in which （1） is observed. The phase rotation and the reversal rotation are performed by the universal quantum gates. Secondly, the quantum BP neural networks model is constructed, in which the output layer and the hide layer are quantum neurons. With the application of the gradient descent algorithm, a learning algorithm of the model is proposed, and the continuity of the model is proved. It is shown that this model and algorithm are superior to the conventional BP networks in three aspects： convergence speed, convergence rate and robustness, by two application examples of pattern recognition and function approximation.展开更多
Multifrequency polarimetric SAR imagery provides a very convenient approach for signal processing and acquisition of radar image. However, the amount of information is scattered in several images, and redundancies exi...Multifrequency polarimetric SAR imagery provides a very convenient approach for signal processing and acquisition of radar image. However, the amount of information is scattered in several images, and redundancies exist between different bands and polarizations. Similar to signal-polarimetric SAR image, multifrequency polarimetric SAR image is corrupted with speckle noise at the same time. A method of information compression and speckle reduction for multifrequency polarimetric SAR imagery is presented based on kernel principal component analysis （KPCA）. KPCA is a nonlinear generalization of the linear principal component analysis using the kernel trick. The NASA/JPL polarimetric SAR imagery of P, L, and C bands quadpolarizations is used for illustration. The experimental results show that KPCA has better capability in information compression and speckle reduction as compared with linear PCA.展开更多
Unstructured P2P has power-law link distribution, and the random walk in power-law networks is analyzed. The analysis results show that the probability that a random walker walks through the high degree nodes is high ...Unstructured P2P has power-law link distribution, and the random walk in power-law networks is analyzed. The analysis results show that the probability that a random walker walks through the high degree nodes is high in the power-law network, and the information on the high degree nodes can be easily found through random walk. Random walk spread and random walk search method （RWSS） is proposed based on the analysis result. Simulation results show that RWSS achieves high success rates at low cost and is robust to high degree node failure.展开更多
The admission control issue in the design of a centralized bandwidth broker model for dynamic control and management of QoS provisioning is studied. A two-phase differentiated flow treatment based dynamic admission co...The admission control issue in the design of a centralized bandwidth broker model for dynamic control and management of QoS provisioning is studied. A two-phase differentiated flow treatment based dynamic admission control scheme under the centralized bandwidth broker model is proposed. In the proposed scheme, the flow requests are classified into two classes and get differentiated treatment according to their QoS demands. We demonstrate that this admission control scheme can not only improve the resource utilization but also guarantee the flows＇ QoS. Furthermore, the admission control is divided into two phases： edge admission control and interior admission control. During the interior phase, the PoQ scheme is adopted, which enhances the call processing capability of the bandwidth broker. The simulation results show that the proposed scheme can result in lower flow blocking probability and higher resource utilization. And it also reduces the number of QoS state accesses/updates, thereby increasing the overall call processing capability of the bandwidth broker.展开更多
An approach to detection of moving objects in video sequences, with application to video surveillance is presented. The algorithm combines two kinds of change points, which are detected from the region-based frame dif...An approach to detection of moving objects in video sequences, with application to video surveillance is presented. The algorithm combines two kinds of change points, which are detected from the region-based frame difference and adjusted background subtraction. An adaptive threshold technique is employed to automatically choose the threshold value to segment the moving objects from the still background. And experiment results show that the algorithm is effective and efficient in practical situations. Furthermore, the algorithm is robust to the effects of the changing of lighting condition and can be applied for video surveillance system.展开更多
In general-sum games, taking all agent＇s collective rationality into account, we define agents＇ global objective, and propose a novel multi-agent reinforcement learning（RL） algorithm based on global policy. In eac...In general-sum games, taking all agent＇s collective rationality into account, we define agents＇ global objective, and propose a novel multi-agent reinforcement learning（RL） algorithm based on global policy. In each learning step, all agents commit to select the global policy to achieve the global goal. We prove this learning algorithm converges given certain restrictions on stage games of learned Q values, and show that it has quite lower computation time complexity than already developed multi-agent learning algorithms for general-sum games. An example is analyzed to show the algorithm＇ s merits.展开更多
A key problem of electronic commerce （for short e-commerce） is fair exchange which guarantees that at the end of the transaction, either both parties involved in the trausaction receive each other＇s items or none d...A key problem of electronic commerce （for short e-commerce） is fair exchange which guarantees that at the end of the transaction, either both parties involved in the trausaction receive each other＇s items or none do. A non-interactive optimistic fair exchange e-commerce protocol model based on the publicly verifiable secret sharing is presented. The main idea of our exchange protocol is to interchange verifiable and recoverable keys of the symmetric encryption for participants＇ items. So it is especially suitable for exchange of large-size items. Furthermore, our protocol is efficient and simple as it does not need interactive proof system which has been adopted by a large quantity of previously proposed fair exchange protocols. Based on a modified （2,2） secret sharing scheme, a concrete non-interactive fair exchange e-commerce protocol is designed.展开更多
The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal...The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example.展开更多
SHTQS is an intelligent telephone-besed spoken dialyze system providing the infomation about the best route between two sites in Shanghai. Instead of separated parts of speech decoding and language parsing, a close co...SHTQS is an intelligent telephone-besed spoken dialyze system providing the infomation about the best route between two sites in Shanghai. Instead of separated parts of speech decoding and language parsing, a close cool,ration is carded out in SHTQS by integrating automatic speech recognizer （AS,R）, language understanding, dialogue management and speech generatot. In such a way, the erroneous analysis and uncertainty happening in the preceding stages would be recovered and determined acourately with high-level knowledge, Moreover, instead of shallow word-level analysis or simply keyword or key phrase matching, a deeper analysis is performed in our system by integrating a robust parser and a semantic interpreter. The robust parser is particularly important for spontanecos speech inputs because most of the inquiry sentences/phrases are ill-formed. In addition, in designinga mixed-initiative dialogue system, understanding users＇ inquiries is essential; however, simply matching keywords and/or key phrases can hardly achieve this. Therefore, a semantic interpreter is incorporated in oar system. The performnce of is also evaluated. The dialogue efficiency is 4.4 sentences per query on an average and the case precision rate of language understanding module is up to 81%. The results are satisfactory.展开更多
基金the National Natural Science Foundation of China (50138010)
文摘A quantum BP neural networks model with learning algorithm is proposed. First, based on the universality of single qubit rotation gate and two-qubit controlled-NOT gate, a quantum neuron model is constructed, which is composed of input, phase rotation, aggregation, reversal rotation and output. In this model, the input is described by qubits, and the output is given by the probability of the state in which （1） is observed. The phase rotation and the reversal rotation are performed by the universal quantum gates. Secondly, the quantum BP neural networks model is constructed, in which the output layer and the hide layer are quantum neurons. With the application of the gradient descent algorithm, a learning algorithm of the model is proposed, and the continuity of the model is proved. It is shown that this model and algorithm are superior to the conventional BP networks in three aspects： convergence speed, convergence rate and robustness, by two application examples of pattern recognition and function approximation.
基金the Specialized Research Found for the Doctoral Program of Higher Education (20070699013)the Natural Science Foundation of Shaanxi Province (2006F05)the Aeronautical Science Foundation (05I53076).
文摘Multifrequency polarimetric SAR imagery provides a very convenient approach for signal processing and acquisition of radar image. However, the amount of information is scattered in several images, and redundancies exist between different bands and polarizations. Similar to signal-polarimetric SAR image, multifrequency polarimetric SAR image is corrupted with speckle noise at the same time. A method of information compression and speckle reduction for multifrequency polarimetric SAR imagery is presented based on kernel principal component analysis （KPCA）. KPCA is a nonlinear generalization of the linear principal component analysis using the kernel trick. The NASA/JPL polarimetric SAR imagery of P, L, and C bands quadpolarizations is used for illustration. The experimental results show that KPCA has better capability in information compression and speckle reduction as compared with linear PCA.
文摘Unstructured P2P has power-law link distribution, and the random walk in power-law networks is analyzed. The analysis results show that the probability that a random walker walks through the high degree nodes is high in the power-law network, and the information on the high degree nodes can be easily found through random walk. Random walk spread and random walk search method （RWSS） is proposed based on the analysis result. Simulation results show that RWSS achieves high success rates at low cost and is robust to high degree node failure.
文摘The admission control issue in the design of a centralized bandwidth broker model for dynamic control and management of QoS provisioning is studied. A two-phase differentiated flow treatment based dynamic admission control scheme under the centralized bandwidth broker model is proposed. In the proposed scheme, the flow requests are classified into two classes and get differentiated treatment according to their QoS demands. We demonstrate that this admission control scheme can not only improve the resource utilization but also guarantee the flows＇ QoS. Furthermore, the admission control is divided into two phases： edge admission control and interior admission control. During the interior phase, the PoQ scheme is adopted, which enhances the call processing capability of the bandwidth broker. The simulation results show that the proposed scheme can result in lower flow blocking probability and higher resource utilization. And it also reduces the number of QoS state accesses/updates, thereby increasing the overall call processing capability of the bandwidth broker.
文摘An approach to detection of moving objects in video sequences, with application to video surveillance is presented. The algorithm combines two kinds of change points, which are detected from the region-based frame difference and adjusted background subtraction. An adaptive threshold technique is employed to automatically choose the threshold value to segment the moving objects from the still background. And experiment results show that the algorithm is effective and efficient in practical situations. Furthermore, the algorithm is robust to the effects of the changing of lighting condition and can be applied for video surveillance system.
文摘In general-sum games, taking all agent＇s collective rationality into account, we define agents＇ global objective, and propose a novel multi-agent reinforcement learning（RL） algorithm based on global policy. In each learning step, all agents commit to select the global policy to achieve the global goal. We prove this learning algorithm converges given certain restrictions on stage games of learned Q values, and show that it has quite lower computation time complexity than already developed multi-agent learning algorithms for general-sum games. An example is analyzed to show the algorithm＇ s merits.
基金This project was partially supported by the National Natural Science Foundation of China (60273049, 90104005).
文摘A key problem of electronic commerce （for short e-commerce） is fair exchange which guarantees that at the end of the transaction, either both parties involved in the trausaction receive each other＇s items or none do. A non-interactive optimistic fair exchange e-commerce protocol model based on the publicly verifiable secret sharing is presented. The main idea of our exchange protocol is to interchange verifiable and recoverable keys of the symmetric encryption for participants＇ items. So it is especially suitable for exchange of large-size items. Furthermore, our protocol is efficient and simple as it does not need interactive proof system which has been adopted by a large quantity of previously proposed fair exchange protocols. Based on a modified （2,2） secret sharing scheme, a concrete non-interactive fair exchange e-commerce protocol is designed.
基金the National Natural Science Foundation of China (60773065).
文摘The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example.
文摘SHTQS is an intelligent telephone-besed spoken dialyze system providing the infomation about the best route between two sites in Shanghai. Instead of separated parts of speech decoding and language parsing, a close cool,ration is carded out in SHTQS by integrating automatic speech recognizer （AS,R）, language understanding, dialogue management and speech generatot. In such a way, the erroneous analysis and uncertainty happening in the preceding stages would be recovered and determined acourately with high-level knowledge, Moreover, instead of shallow word-level analysis or simply keyword or key phrase matching, a deeper analysis is performed in our system by integrating a robust parser and a semantic interpreter. The robust parser is particularly important for spontanecos speech inputs because most of the inquiry sentences/phrases are ill-formed. In addition, in designinga mixed-initiative dialogue system, understanding users＇ inquiries is essential; however, simply matching keywords and/or key phrases can hardly achieve this. Therefore, a semantic interpreter is incorporated in oar system. The performnce of is also evaluated. The dialogue efficiency is 4.4 sentences per query on an average and the case precision rate of language understanding module is up to 81%. The results are satisfactory.
