Efficient and accurate approach for powder compaction problems

 In this paper, a new approach for powder cold compaction simulations is presented. A density-dependent plastic model within the framework of finite strain multiplicative hyperelastoplasticity is used to describe the highly nonlinear material behaviour; the Coulomb dry friction model is used to capture friction effects at die-powder contact; and an Arbitrary Lagrangian–Eulerian (ALE) formulation is used to avoid the (usual) excessive distortion of Lagrangian meshes caused by large mass fluxes. Several representative examples, involving structured and unstructured meshes are simulated. The results obtained agree with the experimental data and other numerical results reported in the literature. It is shown that, contrary to other Lagrangian and adaptive h-remeshing approaches recently reported for this type of problems, the present approach verifies the mass conservation principle with very low relative errors (less than 1% in all ALE examples and exactly in the pure Lagrangian examples). Moreover, thanks to the use of an ALE formulation and in contrast with other simulations, the presented density distributions do not present spurious oscillations. Received: 20 March 2002 / Accepted: 15 October 2002 The partial financial support of the Ministerio de Ciencia y Tecnología (grant number DPI 2001-2204) is gratefully acknowledged.     

红外热像视频的细微变化放大

目的 针对红外热像视频对比度低、成像模糊和难以进行细节观测的缺点,提出一种基于欧拉视角的红外热像视频细微变化放大方法。该方法可以将红外热像视频中细微的色彩变化和动作变化进行放大,将原本人眼无法察觉到的变化清晰地展示出来。方法 该方法首先采用对比度金字塔算法对红外热像视频中每一帧图像进行空域分解,其次对各个尺度的图像进行时域滤波,选择出感兴趣的变化频率并进行线性放大,然后对放大后的信号进行重构,最后对重构得到的图像进行降噪处理,从而获得细微变化放大的红外视频。结果 针对色彩放大和动作放大,实验采集了若干红外热像视频。其中,对人脸侧面的颜色进行放大时,选择像素值变化频率在0.751 Hz 范围内的信号进行滤波并放大,得到像素值变化被放大100倍的视频;对吉他弦的动作进行放大时,选择变化频率在100120 Hz范围内的信号进行滤波并放大,得到弦的动作幅度被放大的视频。结果表明该方法可以使视频中所选择的变化频段得到有效增强。结论 本文方法可以放大红外视频中原本无法观测到的细微变化,并使之清晰呈现,在军用和民用领域中有着广泛用途。     

Expected runtimes of evolutionary algorithms for the Eulerian cycle problem

Evolutionary algorithms are randomized search heuristics, which are applied to problems whose structure is not well understood, as well as to problems in combinatorial optimization. They have successfully been applied to different kinds of arc routing problems. To start the analysis of evolutionary algorithms with respect to the expected optimization time on these problems, we consider the Eulerian cycle problem. We show that a variant of the well-known (1+1)$(1+1)$ EA working on the important encoding of permutations is able to find an Eulerian tour of an Eulerian graph in expected polynomial time. Altering the operator used for mutation in the considered algorithm, the expected optimization time changes from polynomial to exponential.     

A particle‐based moving interface method (PMIM) for modeling the large deformation of boundaries in soft matter systems

The mechanics of the interaction between a fluid and a soft interface undergoing large deformations appear in many places, such as in biological systems or industrial processes. We present an Eulerian approach that describes the mechanics of an interface and its interactions with a surrounding fluid via the so‐called Navier boundary condition. The interface is modeled as a curvilinear surface with arbitrary mechanical properties across which discontinuities in pressure and tangential fluid velocity can be accounted for using a modified version of the extended finite element method. The coupling between the interface and the fluid is enforced through the use of Lagrange multipliers. The tracking and evolution of the interface are then handled in a Lagrangian step with the grid‐based particle method. We show that this method is ideal to describe large membrane deformations and Navier boundary conditions on the interface with velocity/pressure discontinuities. The validity of the model is assessed by evaluating the numerical convergence for a axisymmetrical flow past a spherical capsule with various surface properties. We show the effect of slip length on the shear flow past a two‐dimensional capsule and simulate the compression of an elastic membrane lying on a viscous fluid substrate. Copyright © 2015 John Wiley & Sons, Ltd.     

Numerical simulations of particle migration in a viscoelastic fluid subjected to shear flow

Particle migration is a relevant transport mechanism whenever suspensions flow in channels with gap size comparable to particle dimensions (e.g. microfluidic devices). Several theoretical as well as experimental studies have been performed on this topic, showing that the occurring of this phenomenon and the migration direction are related to particle size, flow rate, and the nature of the suspending liquid.In this work we perform a systematic analysis on the migration of a single particle in a sheared viscoelastic fluid through 2D finite element simulations in a Couette planar geometry. To focus on the effects of viscoelasticity alone, inertia is neglected. The suspending medium is modeled as a Giesekus fluid.An ALE particle mover is combined with a DEVSS/SUPG formulation with a log-representation of the conformation tensor giving stable and convergent results up to high flow rates. To optimize the computational effort and reduce the remeshing and projection steps, needed as soon as the mesh becomes too distorted, a ‘backprojection’ of the flow fields is performed, through which the particle in fact moves along the cross-streamline direction only, and the mesh distortion is hence drastically reduced.Our results, in agreement with recent experimental data, show a migration towards the closest walls, regardless of the fluid and geometrical parameters. The phenomenon is enhanced by the fluid elasticity, the shear thinning and strong confinements. The migration velocity trends show the existence of a master curve governing the particle dynamics in the whole channel. Three different regimes experienced by the particle are recognized, related to the particle-wall distance. The existence of a unique migration behavior and its qualitative aspects do not change by varying the fluid parameters or the particle size.     

New Generations: Sequencing Machines and Their Computational Challenges

New generation sequencing systems are changing how molecular biology is practiced. The widely promoted ＄1000 genome will be a reality with attendant changes for healthcare, including personalized medicine. More broadly the genomes of many new organisms with large samplings from populations will be commonplace. What is less appreciated is the explosive demands on computation, both for CPU cycles and storage as well as the need for new computational methods. In this article we will survey some of these develo...     

A parallel two-level method for simulating blood flows in branching arteries with the resistive boundary condition

Computer modeling of blood flows in the arteries is an important and very challenging problem. In order to understand, computationally, the sophisticated hemodynamics in the arteries, it is essential to couple the fluid flow and the elastic wall structure effectively and specify physiologically realistic boundary conditions. The computation is expensive and the parallel scalability of the solution algorithm is a key issue of the simulation. In this paper, we introduce and study a parallel two-level Newton–Krylov–Schwarz method for simulating blood flows in compliant branching arteries by using a fully coupled system of linear elasticity equation and incompressible Navier–Stokes equations with the resistive boundary condition. We first focus on the accuracy of the resistive boundary condition by comparing it with the standard pressure type boundary condition. We then show the parallel scalability results of the two-level approach obtained on a supercomputer with a large number of processors and on problems with millions of unknowns.     

Turbulent premixed flame model based on a recent dispersion model

A model of turbulent premixed combustion is formulated based on a recent dispersion model and on earlier flame models. The dispersion model accounts for the effect of velocity correlation on turbulent dispersion without using parameters that are explicitly dependent on time or space. The earlier flame models are used as a basis for formulating an appropriate chemical source term. The resulting model is more general than the earlier models.The proposed model and one of the earlier models are validated against various experimental flames. It is shown that the proposed model is more accurate and requires less calibration. Furthermore, the proposed model is tested successfully against general criteria for premixed combustion modeling formulated in earlier works. It is therefore concluded that the dispersion model is a useful tool for premixed combustion modeling.     

Gas particle industrial flow simulation using RANSTAD

A turbulent gas particle finite-volume flow simulation of a representative coal classifier is presented. Typical values of the loading ratio permit a one-way coupling analysis. As a case study, the computational fluid dynamics code,ranstad, and the modelling aspects are discussed in some detail. The simulation indicates that small (≈ 30 μm) coal particles pass through the classifier to the furnace but that large (≈ 300 μm) particles are captured and remilled. The computational simulation indicates that the classifier performance can be improved by internal geometric modification. The commitment of the Electricity Commission of New South Wales (Pacific Power) to the exploitation of Computational Engineering for the improvement of all aspects of electricity generation is acknowledged.     

群体机器人觅食任务Eulerian建模与分析

为了提高觅食任务性能,根据蚂蚁觅食原理引入了觅食概率的概念,机器人按照该概率决定是否离开Home区域,通过改变该概率值来调整环境中机器人的数量。为了研究觅食概率对系统性能的影响,利用Eulerian数学建模方法建立了觅食任务模型,并通过仿真实验分析了觅食概率对系统整体性能的影响。实验结果表明:觅食概率越大,环境中机器人数量越增加,机器人之间的干扰也增加,从而降低系统性能。最后通过实验分析给出了觅食概率与环境中任务数量以及机器人数之间的大致关系。