The adaptive algorithm synthesis theory is used to develop new, algorithms applied to radar signals in the detection of turbulent zones in clouds and precipitation. The efficiency of these new algorithms is analyzed. ...
详细信息
The adaptive algorithm synthesis theory is used to develop new, algorithms applied to radar signals in the detection of turbulent zones in clouds and precipitation. The efficiency of these new algorithms is analyzed. Simulations of weather radar signals on the one hand and modeling and testing of the processing algorithms on the other hand are performed for comparativie analysis. The results demonstrate a significant superiority of the new algorithms in comparison with the widely used pulse-pair algorithm.
The authors propose software for the analysis and solution to the algebraic eigenvalue problem using an MIMD computer with GPUs, which includes parallel algorithms and programs with the functions of automatic adaptive...
详细信息
The authors propose software for the analysis and solution to the algebraic eigenvalue problem using an MIMD computer with GPUs, which includes parallel algorithms and programs with the functions of automatic adaptive configuration of the variable computer environment (multilevel parallelism, variable topology of interprocessor communications, mixed word length, caching, etc.) on the mathematical properties of the problem identified in the computer and the architectural features to ensure the reliability of the solution results and the efficient use of computing resources.
In this paper, we propose two new adaptive algorithms for noise subspace estimation and tracking that are based on Rayleigh's quotient. They have a low computational complexity, a fast convergence, an ensured orth...
详细信息
ISBN:
(纸本)0780379462
In this paper, we propose two new adaptive algorithms for noise subspace estimation and tracking that are based on Rayleigh's quotient. They have a low computational complexity, a fast convergence, an ensured orthogonality of the subspace vectors, and a good numerical stability. We also show how these algorithms can be used for blind channel estimation in a MC-CDMA system.
Distributed protocols that run in dynamic environments such as the Internet are often not able to use an upper bound on the number of potentially participating processes. In these settings adaptive and uniform algorit...
详细信息
ISBN:
(纸本)9783540680673
Distributed protocols that run in dynamic environments such as the Internet are often not able to use an upper bound on the number of potentially participating processes. In these settings adaptive and uniform algorithms are desirable where the step complexity of all operations is a function of the number of concurrently participating processes (adaptive) and the algorithm does not need to know an upper bound on the number of participating processes (uniform). adaptive algorithms, however, are generally not adaptive with respect to their memory consumption - if no upper bound on the number of participating processes is known in advance - they require unbounded MWMR registers and an unbounded number of such registers (even if only finitely many distinct processes appear), making them impractical for real systems. In this paper we ask whether this must be the case: Can adaptive algorithms where no upper bound on the number of participating processes is known in advance be uniformly implemented with finite memory (if only finitely many distinct processes keep reappearing)? We will show that in the dynamic setting it is impossible to implement long-lived adaptive splitters, collect and renaming with infinitely many bounded MWMR registers, making such adaptive algorithms impractical in dynamic settings. On the positive side we provide algorithms that implement a long-lived uniform adaptive splitter if unbounded registers are available and that implement a non-uniform adaptive splitter with finitely many bounded registers if an upper bound on the number of participating processes is known in advance.
We introduce a novel Gravity Search adaptive algorithm, which replicates the movement of a ball descending along the inner surface of a bowl filled with liquid. By choosing the appropriate viscosity of the liquid, gra...
详细信息
ISBN:
(纸本)9781467300810
We introduce a novel Gravity Search adaptive algorithm, which replicates the movement of a ball descending along the inner surface of a bowl filled with liquid. By choosing the appropriate viscosity of the liquid, gravity, and the mass of the ball, the movement of the ball can be controlled to achieve the desired performance. The physical law of conservation of energy makes the algorithm very stable. We also show that the Normalized LMS algorithm is a special form of the proposed Gravity Search adaptive algorithm. Simulation results comparing the performance of Normalized LMS algorithm and the Gravity Search adaptive algorithm are provided. The results show that the Gravity Search adaptive algorithm has superior immunity to the random perturbation of the error signal compared to the Normalized LMS algorithm.
On the base of FCM arithmetic which is in existence, in order to get the preferable separating effect, we bring forward an adaptive algorithm for the weight of the feature weighted of FCM which founds on the feature c...
详细信息
ISBN:
(纸本)9780769538839
On the base of FCM arithmetic which is in existence, in order to get the preferable separating effect, we bring forward an adaptive algorithm for the weight of the feature weighted of FCM which founds on the feature contribution balance principle and the most separate degree principle of intra-cluster. The arithmetic avoids each feature of the feature data originated can't be compared non-comparatives of each feature of the feature vector originated by adopting different units, and ignores the features whose contribution is small for clustering, and reduces the complicacy of the calculation. And by the simulation of the IRIS, we find the calculation method for weight is efficiency.
In active sound control, the sound field generated by the operation of a number of secondary actuators is adjusted to destructively interfere, to the greatest possible extent, with the sound field caused by the origin...
详细信息
Web service may be used to construct autonomic business processes, where several Web services interact with each other to carry out complex transactions or workflows. During the execution of an autonomic process, if o...
详细信息
ISBN:
(纸本)0780389638
Web service may be used to construct autonomic business processes, where several Web services interact with each other to carry out complex transactions or workflows. During the execution of an autonomic process, if one component service fails or becomes overloaded, a mechanism is needed to ensure that the running process is not interrupted and the failed service is quickly and efficiently replaced. In this paper we present two algorithms to solve the problem. The first algorithm uses the backup path approach so that the predecessor of a failed service may quickly switch to a predefined backup path. The second algorithm uses the replacement path approach to re-construct a new process by skipping a failed service. All these dynamic adaptations can be done by business process itself or a QoS broker which is part of an autonomic system. The simulation result shows that, when producing the information needed for dynamic adaptation, the running time of business process composition increases only by a constant factor regardless of the system size.
Many types of automated visual surveillance systems have been presented in the recent literature. Most of the schemes require custom equipment, or involve significant complexity and storage needs. After studying the a...
详细信息
ISBN:
(纸本)9781479930807
Many types of automated visual surveillance systems have been presented in the recent literature. Most of the schemes require custom equipment, or involve significant complexity and storage needs. After studying the area in detail, this work presents four novel algorithms to perform automated, real-time intruder detection in surveillance networks. Built using machine learning techniques, the proposed algorithms are adaptive and portable, do not require any expensive or sophisticated component, are lightweight, and efficient with runtimes of the order of hundredths of a second. Two of the proposed algorithms have been developed by us. With application to two complementary data sets and quantitative performance comparisons with two representative existing schemes, we show that it is possible to easily obtain high detection accuracy with low false positives.
We study the multi-armed bandit (MAB) problem with composite and anonymous feedback. In this model, the reward of pulling an arm spreads over a period of time (we call this period as reward interval) and the player re...
详细信息
ISBN:
(纸本)9781577358664
We study the multi-armed bandit (MAB) problem with composite and anonymous feedback. In this model, the reward of pulling an arm spreads over a period of time (we call this period as reward interval) and the player receives partial rewards of the action, convoluted with rewards from pulling other arms, successively. Existing results on this model require prior knowledge about the reward interval size as an input to their algorithms. In this paper, we propose adaptive algorithms for both the stochastic and the adversarial cases, without requiring any prior information about the reward interval. For the stochastic case, we prove that our algorithm guarantees a regret that matches the lower bounds (in order). For the adversarial case, we propose the first algorithm to jointly handle non-oblivious adversary and unknown reward interval size. We also conduct simulations based on real-world dataset. The results show that our algorithms outperform existing benchmarks.
暂无评论