Molecular/Cluster Statistical Thermodynamics Methods To Simulate Quasi-Static Deformations At Finite Temperature

The rapid evolution of nanotechnology appeals for the understanding of global response of nanoscale systems based on atomic interactions, hence necessitates novel, sophisticated, and physically based approaches to bridge the gaps between various length and time scales. In this paper, we propose a group of statistical thermodynamics methods for the simulations of nanoscale systems under quasi-static loading at finite temperature, that is, molecular statistical thermodynamics (MST) method, cluster statistical thermodynamics (CST) method, and the hybrid molecular/cluster statistical thermodynamics (HMCST) method. These methods, by treating atoms as oscillators and particles simultaneously, as well as clusters, comprise different spatial and temporal scales in a unified framework. One appealing feature of these methods is their "seamlessness" or consistency in the same underlying atomistic model in all regions consisting of atoms and clusters, and hence can avoid the ghost force in the simulation. On the other hand, compared with conventional MD simulations, their high computational efficiency appears very attractive, as manifested by the simulations of uniaxial compression and nanoindenation. (C) 2008 Elsevier Ltd. All rights reserved.

A micromechanical model of influence of particle fracture and particle cluster on mechanical properties of metal matrix composites

A general analytical model for a composite with an isotropic matrix and two populations of spherical inclusions is proposed. The method is based on the second order moment of stress for evaluating the homogenised effective stress in the matrix and on the secant moduli concept for the plastic deformation. With Webull's statistical law for the strength of SiCp particles, the model can quantitatively predict the influence of particle fracture on the mechanical properties of PMMCs. Application of the proposed model to the particle cluster shows that the particle cluster has neglected influence on the strain and stress curves of the composite. (C) 1998 Elsevier Science B.V.

Scenario Cluster Lagrangian Decomposition in two stage stochastic mixed 0-1 optimization

In this paper we introduce four scenario Cluster based Lagrangian Decomposition (CLD) procedures for obtaining strong lower bounds to the (optimal) solution value of two-stage stochastic mixed 0-1 problems. At each iteration of the Lagrangian based procedures, the traditional aim consists of obtaining the solution value of the corresponding Lagrangian dual via solving scenario submodels once the nonanticipativity constraints have been dualized. Instead of considering a splitting variable representation over the set of scenarios, we propose to decompose the model into a set of scenario clusters. We compare the computational performance of the four Lagrange multiplier updating procedures, namely the Subgradient Method, the Volume Algorithm, the Progressive Hedging Algorithm and the Dynamic Constrained Cutting Plane scheme for different numbers of scenario clusters and different dimensions of the original problem. Our computational experience shows that the CLD bound and its computational effort depend on the number of scenario clusters to consider. In any case, our results show that the CLD procedures outperform the traditional LD scheme for single scenarios both in the quality of the bounds and computational effort. All the procedures have been implemented in a C++ experimental code. A broad computational experience is reported on a test of randomly generated instances by using the MIP solvers COIN-OR and CPLEX for the auxiliary mixed 0-1 cluster submodels, this last solver within the open source engine COIN-OR. We also give computational evidence of the model tightening effect that the preprocessing techniques, cut generation and appending and parallel computing tools have in stochastic integer optimization. Finally, we have observed that the plain use of both solvers does not provide the optimal solution of the instances included in the testbed with which we have experimented but for two toy instances in affordable elapsed time. On the other hand the proposed procedures provide strong lower bounds (or the same solution value) in a considerably shorter elapsed time for the quasi-optimal solution obtained by other means for the original stochastic problem.

Recognition of Membrane-Bound Fusion-Peptide/MPER Complexes by the HIV-1 Neutralizing 2F5 Antibody : Implications for Anti-2F5 Immunogenicity

13 p.

Generating cluster submodels from a multistage stochastic mixed integer optimization model using break stage

We present a scheme to generate clusters submodels with stage ordering from a (symmetric or a nonsymmetric one) multistage stochastic mixed integer optimization model using break stage. We consider a stochastic model in compact representation and MPS format with a known scenario tree. The cluster submodels are built by storing first the 0-1 the variables, stage by stage, and then the continuous ones, also stage by stage. A C++ experimental code has been implemented for reordering the stochastic model as well as the cluster decomposition after the relaxation of the non-anticipativiy constraints until the so-called breakstage. The computational experience shows better performance of the stage ordering in terms of elapsed time in a randomly generated testbed of multistage stochastic mixed integer problems.

Cluster analisiaren aplikazio bat ekonomian Donostiako auzoen ikerketa

Lan honekin Donostiako bizitza kalitatea ikertu nahi dute, hau da etxebizitzetako bizilagunen eta etxebizitzen egitura eta erabileraren arteko erlazio posiblea. Biztanle mota, etxebizitza mota eta Donostiako eremu homogeneoen arteko lotura bilatzen saiatuko dira, Aldagai Anitzeko Analisia, batez ere Osagai Nagusizko Analisia, erabiliz aldagai kopurua murrizteko eta faktore edo osagai gutxitan aldagaien informazio gehiena jasotzeko. Jarraian, Cluster aplikatuko dute auzo homogeneoen taldeak osatzeko.