In this paper, two probabilistic adaptive algorithms for jointly detecting active users in a DS-CDMA system are compared. The first one, which is based on the theory of hidden Markov models (HMM) is proposed within th...
详细信息
In this paper, two probabilistic adaptive algorithms for jointly detecting active users in a DS-CDMA system are compared. The first one, which is based on the theory of hidden Markov models (HMM) is proposed within the CDMA scenario and compared with the previously developed Viterbi-based algorithm. Both techniques are completely blind in the sense that no knowledge of the signature sequences, channel state information or training sequences is required for any user. After convergence, an estimate of the signature of each user convolved with its physical channel impulse response (CIR), and estimated data sequences are provided. This CIR estimate can then be used to switch to any decision-directed (DD) adaptation scheme. Performance of the algorithms is verified with simulations as well as with experimental data from an underwater acoustics (UWA) environment. In both cases, performance is found to be highly satisfactory, showing the near-far resistance of the analyzed algorithms.
This work is an attempt to face learning and structural design problems simultaneously for feedforward neural networks by employing genetic algorithms and hybrid algorithm. In the learning process, the disadvantages o...
详细信息
This work is an attempt to face learning and structural design problems simultaneously for feedforward neural networks by employing genetic algorithms and hybrid algorithm. In the learning process, the disadvantages of backpropagation as a learning algorithm can be avoided by using hybrid algorithm. On the other hand the ability of genetic algorithms to perform global search intelligently make this method as a robust learning algorithm, while in the same time design the structure. The proposed algorithm shows good performances where all of the trials of learning processes converge to the desired condition and most of structural design end with desired efficient structure.
Robustness is a major consideration in any controls application. A controller that goes unstable with only a slight disturbance is useless especially in the harsh environment of an automobile. Therefore any scheme tha...
详细信息
Robustness is a major consideration in any controls application. A controller that goes unstable with only a slight disturbance is useless especially in the harsh environment of an automobile. Therefore any scheme that increases the robustness without harming response time is very welcome. Adaptation is one such scheme and in our case we have two slowly varying values that lend themselves to it. Our original control scheme is a two surface sliding control that reduces the relative order to one. Therefore the adaptive derivations follow a standard sliding derivation. This derivation results in two adaptive laws that are implemented in both simulation and on a microprocessor controlled car engine.
Reverse Auction is one of the best-known market-based mechanisms for allocation of delay-constrained tasks to distributed sensor nodes in wireless sensor network as a typical application in pervasive computing. Howeve...
详细信息
Reverse Auction is one of the best-known market-based mechanisms for allocation of delay-constrained tasks to distributed sensor nodes in wireless sensor network as a typical application in pervasive computing. However, costly message exchanges with enormous overheads among resource-constrained sensor nodes for decision making are required. In this paper, a novel energy/delay-efficient distributed message exchange protocol for winner determination in reverse auction-based task allocation is proposed. The main objective of this protocol is the reduction in the overhead, delay and energy consumption in message exchanges for determining the winning bidder. Simulation results show that the proposed protocol can achieve superior performance compared with static and online adaptive scheduling schemes with centralized message exchanges.
Describes three adaptive bidding load balancing algorithms, each of which balances the workload on hosts (nodes) using different amounts of system state information in a heterogeneous distributed system model. A key f...
详细信息
Describes three adaptive bidding load balancing algorithms, each of which balances the workload on hosts (nodes) using different amounts of system state information in a heterogeneous distributed system model. A key feature of these algorithms is that they attempt to balance the virtual delay (unfinished work) of each node. Using simulation, the algorithms are examined and compared with Eager's (1986) 'shortest algorithm', an efficient algorithm in homogeneous systems. Results show that the simple algorithms we consider in this paper, which use very little system state information, yield dramatic performance improvements over the case of no load balancing and perform much better than Eager's algorithm.< >
As there is a conflict about block step size between the requirements of the convergence velocity and parameters' maladjustment within FBLMS algorithm, a modified FBLMS algorithm is well presented in this paper wh...
详细信息
As there is a conflict about block step size between the requirements of the convergence velocity and parameters' maladjustment within FBLMS algorithm, a modified FBLMS algorithm is well presented in this paper which uses a variable block step size to solve the contradiction between convergence rate and precision. The modified FBLMS algorithm is simulated in the MATLAB platform. The simulation results prove that this algorithm not only has a faster convergence speed, a faster tracking speed and a smaller stationary error, but also has a better anti-jamming capability.
In this paper, we propose an identification and control method for a control stage with eddy current. The proposed method is that we first obtain the system parameters using an adaptive algorithm and then we design a ...
详细信息
In this paper, we propose an identification and control method for a control stage with eddy current. The proposed method is that we first obtain the system parameters using an adaptive algorithm and then we design a model-based controller to achieve good performance. The detailed theoretical analysis is given. The experimental results show that the proposed method can guarantee the parameter convergence and improve the control performance.
Very high level of acoustic noise in fMRI scanner rooms disrupts speech communication between the subject and the physician/researcher. Enhancing speech in such an environment is challenging due to the broadband and d...
详细信息
Very high level of acoustic noise in fMRI scanner rooms disrupts speech communication between the subject and the physician/researcher. Enhancing speech in such an environment is challenging due to the broadband and dynamic nature of the noise. Sub-band adaptive methods prove to be very effective in cancelling such noise. In this paper we present the results of using sub-band adaptive methods for enhancing speech corrupted by noise from a 3-Tesla fMRI scanner. We also observe that the performance depends on the synthesis filter bank structure.
In a multivariable system, when multiple parameters jump simultaneously, a multiple models adaptive feedforward decoupling controller using hierarchical Dimension-By-Dimension technology is presented to solve the prob...
详细信息
ISBN:
(纸本)9781424438716
In a multivariable system, when multiple parameters jump simultaneously, a multiple models adaptive feedforward decoupling controller using hierarchical Dimension-By-Dimension technology is presented to solve the problems such as too many models, long computing time and so on. To find the optimal parameter, it adopts one-dimension search in series instead of multiple-dimension search in parallel. During the one-dimension series search, a hierarchical structure is utilized to reduce the number of the models furthermore. According to the switching index the best model is chosen. At last the global convergence is obtained. In the simulation example, when compared with the conventional multiple models adaptive controller, it reduces the number of the fixed models greatly.
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies on using scores to prune irrelevant ans...
详细信息
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies on using scores to prune irrelevant answers as early as possible in the evaluation process. In this context, evaluating the same query plan for all answers might be too rigid because, at any time in the evaluation, answers have gone through the same number and sequence of operations, which limits the speed at which scores grow. Therefore, adaptive query processing that permits different plans for different partial matches and maximizes the best scores is more appropriate. In this paper, we propose an architecture and adaptive algorithms for efficiently computing top-k matches to XML queries. Our techniques can be used to evaluate both exact and approximate matches where approximation is defined by relaxing XPath axes. In order to compute the scores of query answers, we extend the traditional tf*idf measure to account for document structure. We conduct extensive experiments on a variety of benchmark data and queries, and demonstrate the usefulness of the adaptive approach for computing top-k queries in XML.
暂无评论