Related papers: Coupling Chemical Evolution with SPH
We present an implementation of Smoothed Particle Hydrodynamics (SPH) in an adaptive-mesh PPPM algorithm. The code evolves a mixture of purely gravitational particles and gas particles. The code retains the desirable properties of previous…
Since its emergence, SARS-CoV-2 has demonstrated a rapid and unpredictable evolutionary trajectory, characterized by the continual emergence of immune-evasive variants. This poses persistent challenges to public health and vaccine…
The progressive hedging algorithm (PHA) is a cornerstone among algorithms for large-scale stochastic programming problems. However, its traditional implementation is hindered by some limitations, including the requirement to solve all…
The goal of this paper is twofold. First, it explores hybrid evolutionary-swarm metaheuristics that combine the features of PSO and GA in a sequential, parallel and consecutive manner in comparison with their standard basic form: Genetic…
We studied the long-term dynamics of evolutionary Swarm Chemistry by extending the simulation length ten-fold compared to earlier work and by developing and using a new automated object harvesting method. Both macroscopic dynamics and…
Finding the exact close neighbors of each fluid element in mesh-free computational hydrodynamical methods, such as the Smoothed Particle Hydrodynamics (SPH), often becomes a main bottleneck for scaling their performance beyond a few million…
Production of open and hidden charm hadrons in heavy ion collisions is considered within the statistical coalescence model. Charmed quarks and antiquarks are assumed to be created at the initial stage of the reaction and their number is…
Evolving swarm behaviors with artificial agents is computationally expensive and challenging. Because reward structures are often sparse in swarm problems, only a few simulations among hundreds evolve successful swarm behaviors.…
We describe numerical methods for incorporating gas dynamics into cosmological simulations and present illustrative applications to the cold dark matter (CDM) scenario. Our evolution code, a version of TreeSPH (Hernquist \& Katz 1989)…
In this paper we present CRASH_alpha, the first radiative transfer code for cosmological application that follows the parallel propagation of Ly_alpha and ionizing photons. CRASH_alpha is a version of the continuum radiative transfer code…
In last decades optimization and control of complex systems that possessed various conflicted objectives simultaneously attracted an incremental interest of scientists. This is because of the vast applications of these systems in various…
Algorithms for deriving Huffman codes and the recently developed algorithm for compiling PIFO trees to trees of fixed shape (Mohan et al. 2022) are similar, but work with different underlying algebraic operations. In this paper, we exploit…
There is an increasing level of interest in open-endedness in the recent literature of Artificial Life and Artificial Intelligence. We previously proposed the cardinality leap of possibility spaces as a promising mechanism to facilitate…
We frame code generation as a black-box optimization problem within the code space and demonstrate how optimization-inspired techniques can enhance inference scaling. Based on this perspective, we propose SCATTERED FOREST SEARCH (SFS), a…
SLE(kappa; rho), a generalization of chordal Schramm-L\"owner evolution (SLE), is discussed from the point of view of statistical mechanics and conformal field theory (CFT). Certain ratios of CFT correlation functions are shown to be…
We present and test a code for two-fluid simulations of galaxy formation, one of the fluids being collision-less. The hydrodynamical evolution is solved through the SPH method while gravitational forces are calculated using a tree method.…
In [Decompositions and statistics for \beta(1,0)-trees and nonseparable permutations, Advances Appl. Math. 42 (2009) 313--328] we introduced an involution, h, on \beta(1,0)-trees. We neglected, however, to prove that h indeed is an…
We present efficient combinatorial parameterized algorithms for several classical graph-based counting problems in computational chemistry, including (i) Kekule structures, (ii) the Hosoya index, (iii) the Merrifield-Simmons index, and (iv)…
We present a new stellar evolution code and a set of results, demonstrating its capability at calculating full evolutionary tracks for a wide range of masses and metallicities. The code is fast and efficient, and is capable of following…
Somatic variants can be used as lineage markers for the phylogenetic reconstruction of cancer evolution. Since somatic phylogenetics is complicated by sample heterogeneity, novel specialized tree-building methods are required for cancer…