The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we introduce a novel method for reconstructing roller bearings vibration signals. As well as the sparse reconstruction algorithm, our approach is based on the Lasso via the alternate direction multiplier method (ADMM) and optimized by least square QR-factorization (LSQR), which takes the priority over the Basis Pursuit and Lasso in iterations and errors. First, we use the discrete cosine...
To achieve a minimal time to through the urban traffic trunk road. However, the traditional analytical algorithm can not be applied in actual traffic widely. By combining the genetic BP neural network with the traditional analytical, A novel dynamic two-direction green wave coordinate control strategy was proposed, which applied in solving the function optimization problem. Finally, the new algorithm...
Traditional swarm intelligence algorithms lack of evolution ability and are easy to fall into premature convergence. Therefore, a new kind of swarm intelligence algorithm, called bacterial colony optimization (BCO) algorithm, was proposed in this paper. The solution space of the problem was considered as a certain culture medium. A single bacterium or a few bacteria were placed randomly in the space...
Interactive genetic algorithms (IGAs) have been successfully applied to optimize problems with aesthetic criteria by embedding the intelligent evaluations of a user into the evolutionary process. User fatigue caused by frequent interactions, however, often greatly impairs the potentials of IGAs on solving complicated optimization problems. Taking the benefits of collective intelligence into account,...
Interactive genetic algorithms (IGAs) are effective methods of solving optimization problems with qualitative indices. The problem of user fatigue resulting from his/her evaluations, however, restricts their applications in complex optimization problems. Employing various surrogate models to evaluate (a part of) individuals instead of a user is a feasible approach to solving the above problem. Previous...
In order to fully utilize spectrum, auction-based dynamic spectrum access has become a promising approach which allows unlicensed wireless users to lease unused bands from spectrum license holders. Traditionally, the property of spectrum goes to a unique winner with the highest bid after the auction, and the bidders with low bids would be probably not served. This also may result in spectrum resource...
In this paper, a Taguchi-sliding-level differential evolution algorithm (TSLDEA) is proposed to use for finding the actual parameters of Chen and Lu chaotic systems. The TSLDEA, a powerful global numerical optimization method, combines the differential evolution algorithm (DEA) with the Taguchi-sliding-level (TSL) method. The TSL method is fused in the crossover operation of a DEA. Then, the systematic...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.