339 resultados para particle Swarm Optimization
Resumo:
The role of oxide surface chemical composition and solvent on ion solvation and ion transport of ``soggy sand'' electrolytes are discussed here. A ``soggy sand'' electrolyte system comprising dispersions of hydrophilic/hydrophobic functionalized aerosil silica in lithium perchlorate methoxy polyethylene glycol solution was employed for the study. Static and dynamic rheology measurements show formation of an attractive particle network in the case of the composite with unmodified aerosil silica (i.e., with surface silanol groups) as well as composites with hydrophobic alkane groups. While particle network in the composite with hydrophilic aerosil silica (unmodified) were due to hydrogen bonding, hydrophobic aerosil silica particles were held together via van der Waals forces. The network strength in the latter case (i.e., for hydrophobic composites) were weaker compared with the composite with unmodified aerosil silica. Both unmodified silica as well as hydrophobic silica composites displayed solid-like mechanical strength. No enhancement in ionic conductivity compared to the liquid electrolyte was observed in the case of the unmodified silica. This was attributed to the existence of a very strong particle network, which led to the ``expulsion'' of all conducting entities from the interfacial region between adjacent particles. The ionic conductivity for composites with hydrophobic aerosil particles displayed ionic conductivity dependent on the size of the hydrophobic chemical moiety. No spanning attractive particle network was observed for aerosil particles with surfaces modified with stronger hydrophilic groups (than silanol). The composite resembled a sol, and no percolation in ionic conductivity was observed.
Resumo:
We present a new computationally efficient method for large-scale polypeptide folding using coarse-grained elastic networks and gradient-based continuous optimization techniques. The folding is governed by minimization of energy based on Miyazawa–Jernigan contact potentials. Using this method we are able to substantially reduce the computation time on ordinary desktop computers for simulation of polypeptide folding starting from a fully unfolded state. We compare our results with available native state structures from Protein Data Bank (PDB) for a few de-novo proteins and two natural proteins, Ubiquitin and Lysozyme. Based on our simulations we are able to draw the energy landscape for a small de-novo protein, Chignolin. We also use two well known protein structure prediction software, MODELLER and GROMACS to compare our results. In the end, we show how a modification of normal elastic network model can lead to higher accuracy and lower time required for simulation.
Resumo:
The problem of identification of parameters of a beam-moving oscillator system based on measurement of time histories of beam strains and displacements is considered. The governing equations of motion here have time varying coefficients. The parameters to be identified are however time invariant and consist of mass, stiffness and damping characteristics of the beam and oscillator subsystems. A strategy based on dynamic state estimation method, that employs particle filtering algorithms, is proposed to tackle the identification problem. The method can take into account measurement noise, guideway unevenness, spatially incomplete measurements, finite element models for supporting structure and moving vehicle, and imperfections in the formulation of the mathematical models. Numerical illustrations based on synthetic data on beam-oscillator system are presented to demonstrate the satisfactory performance of the proposed procedure.
Resumo:
The overall performance of random early detection (RED) routers in the Internet is determined by the settings of their associated parameters. The non-availability of a functional relationship between the RED performance and its parameters makes it difficult to implement optimization techniques directly in order to optimize the RED parameters. In this paper, we formulate a generic optimization framework using a stochastically bounded delay metric to dynamically adapt the RED parameters. The constrained optimization problem thus formulated is solved using traditional nonlinear programming techniques. Here, we implement the barrier and penalty function approaches, respectively. We adopt a second-order nonlinear optimization framework and propose a novel four-timescale stochastic approximation algorithm to estimate the gradient and Hessian of the barrier and penalty objectives and update the RED parameters. A convergence analysis of the proposed algorithm is briefly sketched. We perform simulations to evaluate the performance of our algorithm with both barrier and penalty objectives and compare these with RED and a variant of it in the literature. We observe an improvement in performance using our proposed algorithm over RED, and the above variant of it.
Resumo:
The present work concerns with the static scheduling of jobs to parallel identical batch processors with incompatible job families for minimizing the total weighted tardiness. This scheduling problem is applicable in burn-in operations and wafer fabrication in semiconductor manufacturing. We decompose the problem into two stages: batch formation and batch scheduling, as in the literature. The Ant Colony Optimization (ACO) based algorithm called ATC-BACO algorithm is developed in which ACO is used to solve the batch scheduling problems. Our computational experimentation shows that the proposed ATC-BACO algorithm performs better than the available best traditional dispatching rule called ATC-BATC rule.
Resumo:
The notion of optimization is inherent in protein design. A long linear chain of twenty types of amino acid residues are known to fold to a 3-D conformation that minimizes the combined inter-residue energy interactions. There are two distinct protein design problems, viz. predicting the folded structure from a given sequence of amino acid monomers (folding problem) and determining a sequence for a given folded structure (inverse folding problem). These two problems have much similarity to engineering structural analysis and structural optimization problems respectively. In the folding problem, a protein chain with a given sequence folds to a conformation, called a native state, which has a unique global minimum energy value when compared to all other unfolded conformations. This involves a search in the conformation space. This is somewhat akin to the principle of minimum potential energy that determines the deformed static equilibrium configuration of an elastic structure of given topology, shape, and size that is subjected to certain boundary conditions. In the inverse-folding problem, one has to design a sequence with some objectives (having a specific feature of the folded structure, docking with another protein, etc.) and constraints (sequence being fixed in some portion, a particular composition of amino acid types, etc.) while obtaining a sequence that would fold to the desired conformation satisfying the criteria of folding. This requires a search in the sequence space. This is similar to structural optimization in the design-variable space wherein a certain feature of structural response is optimized subject to some constraints while satisfying the governing static or dynamic equilibrium equations. Based on this similarity, in this work we apply the topology optimization methods to protein design, discuss modeling issues and present some initial results.
Resumo:
Perfectly hard particles are those which experience an infinite repulsive force when they overlap, and no force when they do not overlap. In the hard-particle model, the only static state is the isostatic state where the forces between particles are statically determinate. In the flowing state, the interactions between particles are instantaneous because the time of contact approaches zero in the limit of infinite particle stiffness. Here, we discuss the development of a hard particle model for a realistic granular flow down an inclined plane, and examine its utility for predicting the salient features both qualitatively and quantitatively. We first discuss Discrete Element simulations, that even very dense flows of sand or glass beads with volume fraction between 0.5 and 0.58 are in the rapid flow regime, due to the very high particle stiffness. An important length scale in the shear flow of inelastic particles is the `conduction length' delta = (d/(1 - e(2))(1/2)), where d is the particle diameter and e is the coefficient of restitution. When the macroscopic scale h (height of the flowing layer) is larger than the conduction length, the rates of shear production and inelastic dissipation are nearly equal in the bulk of the flow, while the rate of conduction of energy is O((delta/h)(2)) smaller than the rate of dissipation of energy. Energy conduction is important in boundary layers of thickness delta at the top and bottom. The flow in the boundary layer at the top and bottom is examined using asymptotic analysis. We derive an exact relationship showing that the a boundary layer solution exists only if the volume fraction in the bulk decreases as the angle of inclination is increased. In the opposite case, where the volume fraction increases as the angle of inclination is increased, there is no boundary layer solution. The boundary layer theory also provides us with a way of understanding the cessation of flow when at a given angle of inclination when the height of the layer is decreased below a value h(stop), which is a function of the angle of inclination. There is dissipation of energy due to particle collisions in the flow as well as due to particle collisions with the base, and the fraction of energy dissipation in the base increases as the thickness decreases. When the shear production in the flow cannot compensate for the additional energy drawn out of the flow due to the wall collisions, the temperature decreases to zero and the flow stops. Scaling relations can be derived for h(stop) as a function of angle of inclination.
Resumo:
There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.
Resumo:
Circular dichroism studies have revealed that addition of testis specific protein, TP in vitro, to rat testes nucleosome core particle resulted in a decrease in the compaction of the core particle DNA. This was also corroborated by thermal denaturation analysis. Addition of TP to nucleosome core particle resulted in the conversion of a biphasic transition towards a single phase. However, at the same time there was a 20% reduction in the overall hyperchromicity of core particle DNA at core particle to TP molar ratios of 1:2 and 1:3. These observations along with our earlier report, showing the DNA melting properties of TP, suggest that TP may play an important role in the disassembly process of nucleosome core particle during spermiogenesis.
Resumo:
A modified set of governing equations for gas-particle flows in nozzles is suggested to include the inertial forces acting on the particle phase. The problem of gas-particle flow through a nozzle is solved using a first order finite difference scheme. A suitable stability condition for the numerical scheme for gas-particle flows is defined. Results obtained from the present set of equations are compared with those of the previous set of equations. It is also found that present set of equations give results which are in good agreement with the experimental observation.
Resumo:
Introduction Dicalcium strontium propionate (DCSP) undergoes a ferroelectric phase transition at about 28 1.5 K, with the spontaneous polarization occurring along the tetragonal C-axis.1 Takashige et al.2,3 have recently reported ferroelectricity in annealed samples of dicalcium lead propionate (DCLP) in the range 191 K to 331 K. The removal of the inner biasing field by annealing has been known in the case of DCLP3 and DCSP.4 Because of the possible dependence of the inner biasing field on the particle size, a study of the temperature dependence of the dielectric behaviour of the powdered samples of these compounds was undertaken.
Resumo:
The optimization of a photovoltaic pumping system based on an induction motor driven pump that is powered by a solar array is presented in this paper. The motor-pump subsystem is analyzed from the point of view of optimizing the power requirement of the induction motor, which has led to an optimum u-f relationship useful in controlling the motor. The complete pumping system is implemented using a dc-dc converter, a three-phase inverter, and an induction motor-pump set. The dc-dc converter is used as a power conditioner and its duty cycle is controlled so as to match the load to the array. A microprocessor-based controller is used to carry out the load-matching.
Resumo:
The ion energy distribution of inductively coupled plasma ion source for focused ion beam application is measured using a four grid retarding field energy analyzer. Without using any Faraday shield, ion energy spread is found to be 50 eV or more. Moreover, the ion energy distribution is found to have double peaks showing that the power coupling to the plasma is not purely inductive, but a strong parasitic capacitive coupling is also present. By optimizing the various source parameters and Faraday shield, ion energy distribution having a single peak, well separated from zero energy and with ion energy spread of 4 eV is achieved. A novel plasma chamber, with proper Faraday shield is designed to ignite the plasma at low RF powers which otherwise would require 300-400 W of RF power. Optimization of various parameters of the ion source to achieve ions with very low energy spread and the experimental results are presented in this article. (C) 2010 Elsevier Ltd. All rights reserved.