Focus on the problem that noise is existing in the input signals and output signals of visual measurement system, if calculate via the classic least mean square algorithm or recursive least square, it would generate t...
详细信息
Focus on the problem that noise is existing in the input signals and output signals of visual measurement system, if calculate via the classic least mean square algorithm or recursive least square, it would generate the larger errors; Or calculate directly, the calculation work loading is too complex . So the solution of weight vector could be as the limited best optimization solution of Rayleigh Quotient of augmentation input vector self correlation matrix, take iteration estimation to the augmentation input vector and set up the function relationship between step factor and error; The simulation analysis experiment results indicate the standard tolerance of proposed adaptive total least squares algorithm is 0.0375mm; but the one of normal total least squares algorithm is only 0.0598mm . Obviously, the proposed algorithm has more high precision than normal total least squares algorithm, and its structure is simple, the calculation speed is faster .
This paper studies how to construct the conversion unit effectively in the process of binary conversion in English translation. A hardware-based cross-language conversion module construction method based on ATUC is pr...
详细信息
This paper provides a modified fast adaptive algorithm for digital beamforming. It is analgorithm with strict constraint minimum power sampling matrix gradient (CSMG). It has merits ofboth traditional sampling mains g...
详细信息
This paper provides a modified fast adaptive algorithm for digital beamforming. It is analgorithm with strict constraint minimum power sampling matrix gradient (CSMG). It has merits ofboth traditional sampling mains gradient (SMG) and strictly constrained minimum power adaptivealgorithm. 16-element uniform circular array is selected. Some results of computer simulation aregiven. The results indicate that the beam direction will change with constraint angle and can beadaptable to adjust zero very well. The algorithm is fast convergent.
CDMA proves to be an attractive method for multiuser communication due to its potential capacity increase and anti-multipath fading capability. However, its performance is limited by the existence of multiple access i...
详细信息
CDMA proves to be an attractive method for multiuser communication due to its potential capacity increase and anti-multipath fading capability. However, its performance is limited by the existence of multiple access interference energy (MAI), which results in the so called near-far problem. To reduce the MAI effect, different decorrelating structures for multiuser detection have been proposed. For the asynchronous case, the "one-shot decorrelator" was proposed, based on inversion of the partial correlation matrix, which may however be singular. As an alternative, the so called "multishot decorrelator", which does not suffer from the aforementioned singularities, was also suggested. However, both detectors, based on inversion of some matrix, are not robust to errors in users' relative delays. The application of the adaptive "Bootstrap algorithm" with the one-shot structure proved to easily handle variation in delay estimates and outperform the decorrelating detector. We propose and compare a Bootstrap algorithm suitable for the multishot matched filtering, multiuser detector in a multipath environment, examine its performance, and compare it to that of other detectors. We also propose the extension of the multishot structure to a multistage receiver, by adding an appropriate canceler.
In this paper, the Lyapunov second method is used to derive adaptive control laws that can be used to control the spacing between vehicles in a platoon. The decentralized adaptive algorithm to compensate for parametri...
详细信息
ISBN:
(纸本)9781424430536;9780769531519
In this paper, the Lyapunov second method is used to derive adaptive control laws that can be used to control the spacing between vehicles in a platoon. The decentralized adaptive algorithm to compensate for parametric variations is investigated and the terminal sliding mode longitudinal control laws for each vehicle in the platoon are designed. From the simulation of the vehicle platoon, convergence rate of spacing errors of the vehicle platoon is fast.
The Reynolds stress model(RSM)outperforms the eddy viscosity model(EVM)when simulating complex flows and has increased demand for high-order ***,the complexity of the RSM equations results in poor numerical stability ...
详细信息
The Reynolds stress model(RSM)outperforms the eddy viscosity model(EVM)when simulating complex flows and has increased demand for high-order ***,the complexity of the RSM equations results in poor numerical stability and weak convergence *** of the reasons is that the properties of Reynolds stresses are not fully considered in the design of the numerical *** response to this issue,this study develops an adaptive algorithm to adjustε_(β)values(an empirical parameter in nonlinear weights)according to the magnitude and smoothness of the Reynolds *** algorithm is introduced into the fifth-order weighted compact nonlinear scheme(WCNS)and is applied to the high-order discretization of the *** aeronautic test cases are simulated to investigate the performance of the *** numerical results show that,the adaptive algorithm can reduce the residual by up to 3 orders of magnitude and predict the correct weights for gradient *** results confirm that the application of theε_(β)-adaptive algorithm to the high-order discretization of the RSM is beneficial both for enhancing convergence and improving resolution.
Focusing on some adaptive control problems of nonlinear industrial processes under given conditions. This paper proposes a modified iterative scheme of the closed-loop identification and designs delta-model adaptive c...
详细信息
ISBN:
(纸本)1424404487
Focusing on some adaptive control problems of nonlinear industrial processes under given conditions. This paper proposes a modified iterative scheme of the closed-loop identification and designs delta-model adaptive controller based on plant-parameterization. The modification enables to identify the whole plant using only one coefficient and without the necessity of reducing the order of a new plant model. Moreover, instead of using a least squares algorithm, only a simple formula for identification is used. In addition, introduction of delta-models helps to cope with numerical instabilities of discrete models occurring when a sampling interval is being shortened. Digital simulation demonstrates that the proposed algorithm brings about good control results.
The main goal of this paper is to provide flow protection and, hence, to provide better than best effort service on the Internet, in particular, to protect adaptive TCP flows in the presence of non-adaptive UDP flows....
详细信息
The main goal of this paper is to provide flow protection and, hence, to provide better than best effort service on the Internet, in particular, to protect adaptive TCP flows in the presence of non-adaptive UDP flows. The solution of choice to achieve flow protection is to have routers implement fair bandwidth allocation. To achieve this goal, an adaptive fair queue management algorithm (modified version of FRED) is proposed. AFQ is made adaptive by dynamically varying the number of packets of flow that could be allowed into the buffer with average queue size and buffer size. The drop or accept decision for a packet is based on the buffer occupancy of the flow. Routers maintain per flow accounting for providing flow protection. Implementation complexity of AFQ is comparable to the existing fair queue management schemes such as FRED. The performance of the proposed scheme is better than FRED.
There are two problems in the process of learning optimal cooperative pursuit strategy for multiple agents in MAS (multi-agent system). One is there is usual circulation among the actions chosen by agents which make t...
详细信息
ISBN:
(纸本)0780384032
There are two problems in the process of learning optimal cooperative pursuit strategy for multiple agents in MAS (multi-agent system). One is there is usual circulation among the actions chosen by agents which make the learning process not converging, the other is there are many conflicts among the actions chosen by agents which make the learned pursuit strategy not optimal. In this paper, the procedure of learning optimal pursuit strategy for multi-agent is regard as a Markov game, and the best equilibrium of the game is regard as the converging, stable state of cooperative pursuit learning. An adaptive algorithm for multiple agents to select and attain an optimal, consistent equilibrium is proposed based on fictitious play. The simulation verifies the effectiveness of the algorithm.
This paper presents a new approach to dynamic software tuning called the adaptive algorithm selection method (AASM). The AASM is built into the calling sequence of a library. When the library is called, the AASM is ac...
详细信息
This paper presents a new approach to dynamic software tuning called the adaptive algorithm selection method (AASM). The AASM is built into the calling sequence of a library. When the library is called, the AASM is activated. The AASM selects and executes the optimum algorithm from registered algorithms in a library, based on data and machine type. As a result, the software is automatically tuned and the execution time is shortened. The relation between the data and the best algorithm for a given machine is learned by a neural network from the results of performance tests of the registered algorithms. We experimented on a multi-strings search problem with the AASM on the following machines: the CRAY X-MP/216, FACOM M 1800/30, and SUN Sparc Station 2. From these experiments we demonstrated that the AASM is able to minimize the execution time.< >
暂无评论