36,556 research outputs found
Recommended from our members
Shape descriptors for mode-shape recognition and model updating
The most widely used method for comparing mode shapes from finite elements and experimental measurements is the Modal Assurance Criterion (MAC), which returns a single numerical value and carries no explicit information on shape features. New techniques, based on image processing (IP) and pattern recognition (PR) are described in this paper. The Zernike moment descriptor (ZMD), Fourier descriptor (FD), and wavelet descriptor (WD), presented in this article, are the most popular shape descriptors having properties that include efficiency of expression, robustness to noise, invariance to geometric transformation and rotation, separation of local and global shape features and computational efficiency. The comparison of mode shapes is readily achieved by assembling the shape features of each mode shape into multi-dimensional shape feature vectors (SFVs) and determining the distances separating them. © 2009 IOP Publishing Ltd
Recommended from our members
Permission form synopses to improve parents' understanding of research: a randomized trial.
ObjectiveWe hypothesized that, among parents of potential neonatal research subjects, an accompanying cover sheet added to the permission form (intervention) would increase understanding of the research, when compared to a standard form (control).Study designThis pilot study enrolled parents approached for one of two index studies: one randomized trial and one observational study. A one-page cover sheet described critical study information. Families were randomized 1:1 to receive the cover sheet or not. Objective and subjective understanding and satisfaction were measured.ResultsThirty-two parents completed all measures (17 control, 15 intervention). There were no differences in comprehension score (16.8±5.7 vs 16.3±3.5), subjective understanding (median 6 vs 6.5), or overall satisfaction with consent (median 7 vs 6.5) between control and intervention groups (all P>0.50).ConclusionA simplified permission form cover sheet had no effect on parents' understanding of studies for which their newborns were being recruited
Protein sliding and hopping kinetics on DNA
Using Monte-Carlo simulations, we deconvolved the sliding and hopping
kinetics of GFP-LacI proteins on elongated DNA from their experimentally
observed seconds-long diffusion trajectories. Our simulations suggest the
following results: (1) in each diffusion trajectory, a protein makes on average
hundreds of alternating slides and hops with a mean sliding time of several
tens of ms; (2) sliding dominates the root mean square displacement of fast
diffusion trajectories, whereas hopping dominates slow ones; (3) flow and
variations in salt concentration have limited effects on hopping kinetics,
while in vivo DNA configuration is not expected to influence sliding kinetics;
furthermore, (4) the rate of occurrence for hops longer than 200 nm agrees with
experimental data for EcoRV proteins
A particle swarm optimization based memetic algorithm for dynamic optimization problems
Copyright @ Springer Science + Business Media B.V. 2010.Recently, there has been an increasing concern from the evolutionary computation community on dynamic optimization problems since many real-world optimization problems are dynamic. This paper investigates a particle swarm optimization (PSO) based memetic algorithm that hybridizes PSO with a local search technique for dynamic optimization problems. Within the framework of the proposed algorithm, a local version of PSO with a ring-shape topology structure is used as the global search operator and a fuzzy cognition local search method is proposed as the local search technique. In addition, a self-organized random immigrants scheme is extended into our proposed algorithm in order to further enhance its exploration capacity for new peaks in the search space. Experimental study over the moving peaks benchmark problem shows that the proposed PSO-based memetic algorithm is robust and adaptable in dynamic environments.This work was supported by the National Nature Science Foundation of China (NSFC) under Grant No. 70431003 and Grant No. 70671020, the National Innovation Research Community Science Foundation of China under
Grant No. 60521003, the National Support Plan of China under Grant No. 2006BAH02A09 and the Ministry of Education, science, and Technology in Korea through the Second-Phase of Brain Korea 21 Project in 2009, the Engineering and Physical Sciences Research
Council (EPSRC) of UK under Grant EP/E060722/01 and the Hong Kong Polytechnic University Research Grants under Grant G-YH60
A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems
Copyright @ Springer-Verlag 2008Dynamic optimization problems challenge traditional evolutionary algorithms seriously since they, once converged, cannot adapt quickly to environmental changes. This paper investigates the application of memetic algorithms, a class of hybrid evolutionary algorithms, for dynamic optimization problems. An adaptive hill climbing method is proposed as the local search technique in the framework of memetic algorithms, which combines the features of greedy crossover-based hill climbing and steepest mutation-based hill climbing. In order to address the convergence problem, two diversity maintaining methods, called adaptive dual mapping and triggered random immigrants, respectively, are also introduced into the proposed memetic algorithm for dynamic optimization problems. Based on a series of dynamic problems generated from several stationary benchmark problems, experiments are carried out to investigate the performance of the proposed memetic algorithm in comparison with some peer evolutionary algorithms. The experimental results show the efficiency of the proposed memetic algorithm in dynamic environments.This work was supported by the National Nature Science Foundation of China (NSFC) under Grant Nos. 70431003 and 70671020, the National Innovation Research Community Science Foundation of China under Grant No. 60521003, and the National Support Plan of China under Grant No. 2006BAH02A09 and the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/01
- …