12,209 research outputs found
Genetic learning particle swarm optimization
Social learning in particle swarm optimization (PSO) helps collective efficiency, whereas individual reproduction in genetic algorithm (GA) facilitates global effectiveness. This observation recently leads to hybridizing PSO with GA for performance enhancement. However, existing work uses a mechanistic parallel superposition and research has shown that construction of superior exemplars in PSO is more effective. Hence, this paper first develops a new framework so as to organically hybridize PSO with another optimization technique for âlearning.â This leads to a generalized âlearning PSOâ paradigm, the *L-PSO. The paradigm is composed of two cascading layers, the first for exemplar generation and the second for particle updates as per a normal PSO algorithm. Using genetic evolution to breed promising exemplars for PSO, a specific novel *L-PSO algorithm is proposed in the paper, termed genetic learning PSO (GL-PSO). In particular, genetic operators are used to generate exemplars from which particles learn and, in turn, historical search information of particles provides guidance to the evolution of the exemplars. By performing crossover, mutation, and selection on the historical information of particles, the constructed exemplars are not only well diversified, but also high qualified. Under such guidance, the global search ability and search efficiency of PSO are both enhanced. The proposed GL-PSO is tested on 42 benchmark functions widely adopted in the literature. Experimental results verify the effectiveness, efficiency, robustness, and scalability of the GL-PSO
Measuring cellular traction forces on non-planar substrates
Animal cells use traction forces to sense the mechanics and geometry of their
environment. Measuring these traction forces requires a workflow combining cell
experiments, image processing and force reconstruction based on elasticity
theory. Such procedures have been established before mainly for planar
substrates, in which case one can use the Green's function formalism. Here we
introduce a worksflow to measure traction forces of cardiac myofibroblasts on
non-planar elastic substrates. Soft elastic substrates with a wave-like
topology were micromolded from polydimethylsiloxane (PDMS) and fluorescent
marker beads were distributed homogeneously in the substrate. Using feature
vector based tracking of these marker beads, we first constructed a hexahedral
mesh for the substrate. We then solved the direct elastic boundary volume
problem on this mesh using the finite element method (FEM). Using data
simulations, we show that the traction forces can be reconstructed from the
substrate deformations by solving the corresponding inverse problem with a
L1-norm for the residue and a L2-norm for 0th order Tikhonov regularization.
Applying this procedure to the experimental data, we find that cardiac
myofibroblast cells tend to align both their shapes and their forces with the
long axis of the deformable wavy substrate.Comment: 34 pages, 9 figure
Improvements in meta-heuristic algorithms for minimum cost design of reinforced concrete rectangular sections under compression and biaxial bending
A numerical procedure is proposed in this paper for achieving the minimum cost design of reinforced concrete rectangular sections under compression and biaxial bending by using biologically-inspired meta-heuristic optimization algorithms. The problem formulation includes the costs of concrete, reinforcement and formwork, obtaining the detailed optimum design in which the section dimensions and the reinforcement correspond to values used in practice. The formulation has been simplified in order to reduce the computational cost while ensuring the rigor necessary to achieve safe designs. The numerical procedure includes the possibility of using high-strength concrete and several design constraints, such as mĂnimum reinforcement and limiting the neutral axis depth. Two numerical examples are presented, drawing comparisons between the results obtained by ACI318 and EC2 standards
ĂlĆlĂ©nyek kollektĂv viselkedĂ©sĂ©nek statisztikus fizikĂĄja = Statistical physics of the collective behaviour of organisms
Experiments: We have carried out quantitative experiments on the collective motion of cells as a function of their density. A sharp transition could be observed from the random motility in sparse cultures to the flocking of dense islands of cells. Using ultra light GPS devices developed by us, we have determined the existing hierarchical relations within a flock of 10 homing pigeons. Modelling: From the simulations of our new model of flocking we concluded that the information exchange between particles was maximal at the critical point, in which the interplay of such factors as the level of noise, the tendency to follow the direction and the acceleration of others results in large fluctuations. Analysis: We have proposed a novel link-density based approach to finding overlapping communities in large networks. The algorithm used for the implementation of this technique is very efficient for most real networks, and provides full statistics quickly. Correspondingly, we have developed a by now popular, user-friendly, freely downloadable software for finding overlapping communities. Extending our method to the time-dependent regime, we found that large groups in evolving networks persist for longer if they are capable of dynamically altering their membership, thus, an ability to change the group composition results in better adaptability. We also showed that knowledge of the time commitment of members to a given community can be used for estimating the community's lifetime. Experiments: We have carried out quantitative experiments on the collective motion of cells as a function of their density. A sharp transition could be observed from the random motility in sparse cultures to the flocking of dense islands of cells. Using ultra light GPS devices developed by us, we have determined the existing hierarchical relations within a flock of 10 homing pigeons. Modelling: From the simulations of our new model of flocking we concluded that the information exchange between particles was maximal at the critical point, in which the interplay of such factors as the level of noise, the tendency to follow the direction and the acceleration of others results in large fluctuations. Analysis: We have proposed a novel link-density based approach to finding overlapping communities in large networks. The algorithm used for the implementation of this technique is very efficient for most real networks, and provides full statistics quickly. Correspondingly, we have developed a by now popular, user-friendly, freely downloadable software for finding overlapping communities. Extending our method to the time-dependent regime, we found that large groups in evolving networks persist for longer if they are capable of dynamically altering their membership, thus, an ability to change the group composition results in better adaptability. We also showed that knowledge of the time commitment of members to a given community can be used for estimating the community's lifetime
Dynamic Offloading Technique for Latency-Sensitive Internet of Things Applications using Fog Computing
Internet of Things (IoT) has evolved as a novel paradigm that provides com-putation power to different entities connected to it. IoT offers services to multiple sectors such as home automation, industrial automation, traffic management, healthcare sector, agriculture industry etc. IoT generally relies on cloud data centers for extended analytics, processing and storage support. The cloud offers highly scalable and robust platform for IoT applications. But latency sensitive IoT applications suffer delay issues as the cloud lies in remote location. Edge/fog computing was introduced to overcome the issues faced by delay-sensitive IoT applications. These platforms lie close to the IoT network, reducing the delay and response time. The fog nodes are usually distributed in nature. The data has to be properly offloaded to available fog nodes using efficient strategies to gain benefit from the integration. Differ-ent offloading schemes are available in the literature to overcome this prob-lem This paper proposes a novel offloading approach by combining two effi-cient metaheuristic algorithms, Honey Badger Algorithm (HBA) and Fla-mingo Search Algorithm (FSA) termed as HB-FS algorithm. The HB-FS is executed in an iterative manner optimizing the objective function in each it-eration. The performance evaluation of the proposed approach is done with different existing metaheuristic algorithms and the evaluations show that the proposed work outperforms the existing algorithms in terms of latency, response time and execution time. The methodology also offers better degree of imbalance with proper load balancing under different conditions
- âŠ