Influence of adaptive mesh refinement and the hydro solver on shear-induced mass stripping in a minor-merger scenario

We compare two different codes for simulations of cosmological structure formation to investigate the sensitivity of hydrodynamical instabilities to numerics, in particular, the hydro solver and the application of adaptive mesh refinement (AMR). As a simple test problem, we consider an initially spherical gas cloud in a wind, which is an idealized model for the merger of a subcluster or galaxy with a big cluster. Based on an entropy criterion, we calculate the mass stripping from the subcluster as a function of time. Moreover, the turbulent velocity field is analyzed with a multi-scale filtering technique. We find remarkable differences between the commonly used PPM solver with directional splitting in the Enzo code and an unsplit variant of PPM in the Nyx code, which demonstrates that different codes can converge to systematically different solutions even when using uniform grids. For the test case of an unbound cloud, AMR simulations reproduce uniform-grid results for the mass stripping quite well, although the flow realizations can differ substantially. If the cloud is bound by a static gravitational potential, however, we find strong sensitivity to spurious fluctuations which are induced at the cutoff radius of the potential and amplified by the bow shock. This gives rise to substantial deviations between uniform-grid and AMR runs performed with Enzo, while the mass stripping in Nyx simulations of the subcluster is nearly independent of numerical resolution and AMR. Although many factors related to numerics are involved, our study indicates that unsplit solvers with advanced flux limiters help to reduce grid effects and to keep numerical noise under control, which is important for hydrodynamical instabilities and turbulent flows.Comment: 23 pages, 18 figures, accepted for publication by Astronomy and Computin

Fast micro-differential evolution for topological active net optimization

This paper studies the optimization problem of topological active net (TAN), which is often seen in image segmentation and shape modeling. A TAN is a topological structure containing many nodes, whose positions must be optimized while a predefined topology needs to be maintained. TAN optimization is often time-consuming and even constructing a single solution is hard to do. Such a problem is usually approached by a ``best improvement local search'' (BILS) algorithm based on deterministic search (DS), which is inefficient because it spends too much efforts in nonpromising probing. In this paper, we propose the use of micro-differential evolution (DE) to replace DS in BILS for improved directional guidance. The resultant algorithm is termed deBILS. Its micro-population efficiently utilizes historical information for potentially promising search directions and hence improves efficiency in probing. Results show that deBILS can probe promising neighborhoods for each node of a TAN. Experimental tests verify that deBILS offers substantially higher search speed and solution quality not only than ordinary BILS, but also the genetic algorithm and scatter search algorithm

Differential evolution with an evolution path: a DEEP evolutionary algorithm

Utilizing cumulative correlation information already existing in an evolutionary process, this paper proposes a predictive approach to the reproduction mechanism of new individuals for differential evolution (DE) algorithms. DE uses a distributed model (DM) to generate new individuals, which is relatively explorative, whilst evolution strategy (ES) uses a centralized model (CM) to generate offspring, which through adaptation retains a convergence momentum. This paper adopts a key feature in the CM of a covariance matrix adaptation ES, the cumulatively learned evolution path (EP), to formulate a new evolutionary algorithm (EA) framework, termed DEEP, standing for DE with an EP. Without mechanistically combining two CM and DM based algorithms together, the DEEP framework offers advantages of both a DM and a CM and hence substantially enhances performance. Under this architecture, a self-adaptation mechanism can be built inherently in a DEEP algorithm, easing the task of predetermining algorithm control parameters. Two DEEP variants are developed and illustrated in the paper. Experiments on the CEC'13 test suites and two practical problems demonstrate that the DEEP algorithms offer promising results, compared with the original DEs and other relevant state-of-the-art EAs

A computational method for the coupled solution of reaction–diffusion equations on evolving domains and manifolds: application to a model of cell migration and chemotaxis

In this paper, we devise a moving mesh finite element method for the approximate solution of coupled bulk–surface reaction–diffusion equations on an evolving two dimensional domain. Fundamental to the success of the method is the robust generation of bulk and surface meshes. For this purpose, we use a novel moving mesh partial differential equation (MMPDE) approach. The developed method is applied to model problems with known analytical solutions; these experiments indicate second-order spatial and temporal accuracy. Coupled bulk–surface problems occur frequently in many areas; in particular, in the modelling of eukaryotic cell migration and chemotaxis. We apply the method to a model of the two-way interaction of a migrating cell in a chemotactic field, where the bulk region corresponds to the extracellular region and the surface to the cell membrane

A framework for smart production-logistics systems based on CPS and industrial IoT

Industrial Internet of Things (IIoT) has received increasing attention from both academia and industry. However, several challenges including excessively long waiting time and a serious waste of energy still exist in the IIoT-based integration between production and logistics in job shops. To address these challenges, a framework depicting the mechanism and methodology of smart production-logistics systems is proposed to implement intelligent modeling of key manufacturing resources and investigate self-organizing configuration mechanisms. A data-driven model based on analytical target cascading is developed to implement the self-organizing configuration. A case study based on a Chinese engine manufacturer is presented to validate the feasibility and evaluate the performance of the proposed framework and the developed method. The results show that the manufacturing time and the energy consumption are reduced and the computing time is reasonable. This paper potentially enables manufacturers to deploy IIoT-based applications and improve the efficiency of production-logistics systems

Proceedings of the 2011 New York Workshop on Computer, Earth and Space Science

The purpose of the New York Workshop on Computer, Earth and Space Sciences is to bring together the New York area's finest Astronomers, Statisticians, Computer Scientists, Space and Earth Scientists to explore potential synergies between their respective fields. The 2011 edition (CESS2011) was a great success, and we would like to thank all of the presenters and participants for attending. This year was also special as it included authors from the upcoming book titled "Advances in Machine Learning and Data Mining for Astronomy". Over two days, the latest advanced techniques used to analyze the vast amounts of information now available for the understanding of our universe and our planet were presented. These proceedings attempt to provide a small window into what the current state of research is in this vast interdisciplinary field and we'd like to thank the speakers who spent the time to contribute to this volume.Comment: Author lists modified. 82 pages. Workshop Proceedings from CESS 2011 in New York City, Goddard Institute for Space Studie