<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (Vaguery)</title>
    <link>https://pinboard.in/u:Vaguery/public/</link>
    <description>recent bookmarks from Vaguery</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://iopscience.iop.org/article/10.1088/1742-5468/ae120e"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2403.18369"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2408.03458"/>
	<rdf:li rdf:resource="https://www.mdpi.com/2504-3110/9/7/475"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2302.08600"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2109.06298"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2409.02086"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2304.02354"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2407.11713"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2312.13944"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2108.08353"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2105.11143"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2209.10687"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1203.4667"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1602.00546"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1805.02354"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1511.09203"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2104.03704"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2007.15642"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1908.07874"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1804.02795"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1702.08411"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1705.08756"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1709.08999"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2012.09715"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2102.00113"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1801.05247"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2012.05503"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2104.08636"/>
	<rdf:li rdf:resource="https://github.com/thi-ng/geom"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2009.00295"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2005.02901"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/cond-mat/0203237"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1902.00565"/>
	<rdf:li rdf:resource="https://www.researchgate.net/publication/10726190_Random_Packings_of_Spheres_and_Spherocylinders_Simulated_by_Mechanical_Contraction"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1709.10043"/>
	<rdf:li rdf:resource="http://www.cleonis.nl/physics/phys256/coupling.php"/>
	<rdf:li rdf:resource="https://www.biorxiv.org/content/10.1101/120097v1?rss=1"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2004.13935"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1603.07147"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1904.02630"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1803.04221"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1803.04918"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1903.00441"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1707.00083"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1904.05970"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1901.02950"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1311.2032"/>
	<rdf:li rdf:resource="http://htsang.wikidot.com/research"/>
	<rdf:li rdf:resource="http://manual.gromacs.org/documentation/2019/how-to/index.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1803.11511"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1012.0369"/>
	<rdf:li rdf:resource="http://simjs.com/index.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1911.09792"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/math/0508248"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1812.01502"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1803.02875"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1806.03333"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1410.8001"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1804.01804"/>
	<rdf:li rdf:resource="https://www.biorxiv.org/content/10.1101/376632v1?rss=1"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1907.08103"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1802.00296"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1909.00196"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1809.02331"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1909.12501"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1904.08684"/>
	<rdf:li rdf:resource="https://queue.acm.org/detail.cfm?id=3212479"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1810.01999"/>
	<rdf:li rdf:resource="http://theorangeduck.com/page/subspace-neural-physics-fast-data-driven-interactive-simulation"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://iopscience.iop.org/article/10.1088/1742-5468/ae120e">
    <title>A new mathematical model for brain memory working. Optimal control behavior for Hopfield networks - IOPscience</title>
    <dc:date>2025-12-01T13:11:59+00:00</dc:date>
    <link>https://iopscience.iop.org/article/10.1088/1742-5468/ae120e</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Abstract
Recent works have highlighted the need for a new dynamical paradigm in the modeling of brain function and evolution. Specifically, these models should incorporate non-constant and asymmetric synaptic weights Tij in the neuron–neuron interaction matrix, moving beyond the classical Hopfield framework. Krotov and Hopfield proposed a non-constant yet symmetric model, resulting in a vector field that describes gradient-type dynamics, which includes a Lyapunov-like energy function. Firstly, we will outline the general conditions for generating a Hopfield-like vector field of gradient type, recovering the Krotov–Hopfield condition as a particular case. Secondly, we address the issue of symmetry, which we abandon for two key physiological reasons: (1) actual neural connections have a distinctly directional character (axons and dendrites), and (2) the gradient structure derived from symmetry forces the dynamics towards stationary points, leading for every pattern to a recognition or to a free association, if the equilibrium is rather far from the input. We propose a novel model that incorporates a set of limited but variable controls , which are used to adjust an initially constant interaction matrix, . Additionally, we introduce a reasonable controlled variational functional for optimization. This allows us to simulate three potential outcomes when a pattern is submitted to the learning system: (1) if the dynamics converges to an existing stationary point without activating controls, the system has recognized or has made a free association to an incoming pattern; (2) if a new stationary point is reached through control activation, the system has learned a new pattern; and (3) if the dynamics wanders without reaching any stationary point, the system is unable to recognize or learn the submitted pattern. An additional feature (4) models the processes of forgetting and restoring memory. Numerical simulations on a basic neural network model support the theoretical results proposed.

]]></description>
<dc:subject>neural-networks simulation Hopfield-networks rather-interesting nonlinear-dynamics to-understand optimal-control</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:a65bf7835b75/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Hopfield-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optimal-control"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2403.18369">
    <title>[2403.18369] Damage Mechanics Challenge: Predictions based on the phase field fracture model</title>
    <dc:date>2025-10-29T22:03:01+00:00</dc:date>
    <link>https://arxiv.org/abs/2403.18369</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In this work, we describe our contribution to the Purdue-SANDIA-LLNL \emph{Damage Mechanics Challenge}. The phase field fracture model is adopted to blindly estimate the failure characteristics of the challenge test, an unconventional three-point bending experiment on an additively manufactured rock resembling a type of gypsum. The model is formulated in a variationally consistent fashion, incorporating a volumetric-deviatoric strain energy decomposition, and the numerical implementation adopts a monolithic unconditionally stable solution scheme. Our focus is on providing an efficient and simple yet rigorous approach capable of delivering accurate predictions based solely on physical parameters. Model inputs are Young's modulus E, Poisson's ratio ν, toughness Gc and strength σc (as determined by the choice of phase field length scale ℓ). We show that a single mode I three-point bending test is sufficient to calibrate the model, and that the calibrated model can then reliably predict the force versus displacement responses, crack paths and surface crack morphologies of more intricate three-point bending experiments that are inherently mixed-mode. Importantly, our peak load, crack trajectory and crack surface morphology predictions for the challenge test, submitted before the experimental data was released, show a remarkable agreement with experiments. The characteristics of the challenge, and how changes in these can impact the predictive abilities of phase field fracture models, are also discussed.
]]></description>
<dc:subject>materials-science engineering finite-elements nonlinear-dynamics simulation rather-interesting to-understand consider:metamaterials consider:numerical-methods consider:approximation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:06e153960f94/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:finite-elements"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:metamaterials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:numerical-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:approximation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2408.03458">
    <title>[2408.03458] Complex Dynamics in Reaction-Phase Separation Systems</title>
    <dc:date>2025-08-17T14:15:14+00:00</dc:date>
    <link>https://arxiv.org/abs/2408.03458</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We investigate the emergence of sustained spatio-temporal behaviors in reaction-phase separation systems. We focus on binary systems, in which either one or both species can phase separate, and we discuss the stability of the homogeneous state determining the conditions for the emergence of a Hopf-type bifurcation. We then examine the effects of a specific autocatalytic chemical reaction, and computationally determine the full solutions to the partial differential equations. We find that when both species phase separate, sustained pulsed dynamics arise in one dimension. When considered in two dimensions, the system generates persistent, complex dynamic droplets, which do not generally appear if only one of the species can phase separate. We finally discuss the emergence of dynamics with complex features, which can be understood using the framework of a cellular automata.
]]></description>
<dc:subject>pattern-formation reaction-diffusion-systems nonlinear-dynamics rather-interesting simulation to-simulate to-write-about consider:object-boundaries</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:bd6e5c1bf1b4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:pattern-formation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:reaction-diffusion-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:object-boundaries"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.mdpi.com/2504-3110/9/7/475">
    <title>The Continued Fraction Structure in Physical Fractal Theory</title>
    <dc:date>2025-08-10T11:59:39+00:00</dc:date>
    <link>https://www.mdpi.com/2504-3110/9/7/475</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The objective of this study is to reveal the intrinsic connection between fractal operators in physical fractal spaces and continued fractions. The specific contributions include: (1) reviewing fundamental concepts of continued fractions and physical fractal theory; (2) establishing algebraic structure consistency between continued fractions and fractal operators through the medium of generation mappings; (3) discussing the convergence of fractal operators by employing theory from continued fraction analysis; and (4) confirming the correspondence between fixed points of infinite continued fractions and algebraic equations governing fractal operators.
]]></description>
<dc:subject>biophysics fractals continued-fractions models-and-modes rather-interesting simulation to-simulate to-write-about consider:nonlinearity</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:faf23619376e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biophysics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:fractals"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:continued-fractions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:models-and-modes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:nonlinearity"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2302.08600">
    <title>[2302.08600] On the Role of Memory in Robust Opinion Dynamics</title>
    <dc:date>2024-09-21T13:56:03+00:00</dc:date>
    <link>https://arxiv.org/abs/2302.08600</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We investigate opinion dynamics in a fully-connected system, consisting of n identical and anonymous agents, where one of the opinions (which is called correct) represents a piece of information to disseminate. In more detail, one source agent initially holds the correct opinion and remains with this opinion throughout the execution. The goal for non-source agents is to quickly agree on this correct opinion, and do that robustly, i.e., from any initial configuration. The system evolves in rounds. In each round, one agent chosen uniformly at random is activated: unless it is the source, the agent pulls the opinions of ℓ random agents and then updates its opinion according to some rule. We consider a restricted setting, in which agents have no memory and they only revise their opinions on the basis of those of the agents they currently sample. As restricted as it is, this setting encompasses very popular opinion dynamics, such as the voter model and best-of-k majority rules.
Qualitatively speaking, we show that lack of memory prevents efficient convergence. Specifically, we prove that no dynamics can achieve correct convergence in an expected number of steps that is sub-quadratic in n, even under a strong version of the model in which activated agents have complete access to the current configuration of the entire system, i.e., the case ℓ=n. Conversely, we prove that the simple voter model (in which ℓ=1) correctly solves the problem, while almost matching the aforementioned lower bound.
These results suggest that, in contrast to symmetric consensus problems (that do not involve a notion of correct opinion), fast convergence on the correct opinion using stochastic opinion dynamics may indeed require the use of memory. This insight may reflect on natural information dissemination processes that rely on a few knowledgeable individuals.
]]></description>
<dc:subject>agent-based social-networks simulation opinion epidemiology to-write-about to-simulate consider:looking-to-see</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d1f0c368b473/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:agent-based"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:social-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:opinion"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:epidemiology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:looking-to-see"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2109.06298">
    <title>[2109.06298] Uniformly distributed sequences generated by a greedy minimization of the $L_2$ discrepancy</title>
    <dc:date>2024-09-17T20:46:18+00:00</dc:date>
    <link>https://arxiv.org/abs/2109.06298</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The aim of this paper is to develop greedy algorithms which generate uniformly distributed sequences in the d-dimensional unit cube [0,1]d. The figures of merit are three different variants of L2 discrepancy. Theoretical results along with numerical experiments suggest that the resulting sequences have excellent distribution properties. The approach we follow here is motivated by recent work of Steinerberger and Pausinger who consider similar greedy algorithms, where they minimize functionals that can be related to the star discrepancy or energy of point sets. In contrast to many greedy algorithms where the resulting elements of the sequence can only be given numerically, we will find that in the one-dimensional case our algorithms yield rational numbers which we can describe precisely. In particular, we will observe that any initial segment of a sequence in [0,1) can be naturally extended to a uniformly distributed sequence where all subsequent elements are of the form xN=2n−12N for some n∈{1,…,N}. We will also investigate the dependence of the L2 discrepancy of the resulting sequences on the dimension d.
]]></description>
<dc:subject>discrepancy numerical-methods rather-interesting algorithms low-discrepancy-sequences simulation nudge-targets consider:looking-to-see consider:performance-measures</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:de2649ccabc1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:discrepancy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:numerical-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:low-discrepancy-sequences"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:performance-measures"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2409.02086">
    <title>[2409.02086] Taming Randomness in Agent-Based Models using Common Random Numbers</title>
    <dc:date>2024-09-04T22:48:29+00:00</dc:date>
    <link>https://arxiv.org/abs/2409.02086</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Random numbers are at the heart of every agent-based model (ABM) of health and disease. By representing each individual in a synthetic population, agent-based models enable detailed analysis of intervention impact and parameter sensitivity. Yet agent-based modeling has a fundamental signal-to-noise problem, in which small differences between simulations cannot be reliably differentiated from stochastic noise resulting from misaligned random number realizations. We introduce a novel methodology that eliminates noise due to misaligned random numbers, a first for agent-based modeling. Our approach enables meaningful individual-level analysis between ABM scenarios because all differences are driven by mechanistic effects rather than random number noise. A key result is that many fewer simulations are needed for some applications. We demonstrate the benefits of our approach on three disparate examples and discuss limitations.
]]></description>
<dc:subject>agent-based stochastic-systems nonlinear-dynamics simulation numerical-methods software-development-is-not-programming rather-interesting to-write-about to-pass-along reproducibility</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d69b0e73e586/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:agent-based"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:stochastic-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:numerical-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:software-development-is-not-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-pass-along"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:reproducibility"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2304.02354">
    <title>[2304.02354] Neural Cellular Automata for Solidification Microstructure Modelling</title>
    <dc:date>2024-08-08T14:04:20+00:00</dc:date>
    <link>https://arxiv.org/abs/2304.02354</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We propose Neural Cellular Automata (NCA) to simulate the microstructure development during the solidification process in metals. Based on convolutional neural networks, NCA can learn essential solidification features, such as preferred growth direction and competitive grain growth, and are up to six orders of magnitude faster than the conventional Cellular Automata (CA). Notably, NCA delivers reliable predictions also outside their training range, which indicates that they learn the physics of the solidification process. While in this study we employ data produced by CA for training, NCA can be trained based on any microstructural simulation data, e.g. from phase-field models.
]]></description>
<dc:subject>materials-science simulation cellular-automata neural-networks to-understand metallurgy rather-interesting collective-behavior algorithms to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:73312bb556c6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cellular-automata"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metallurgy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:collective-behavior"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2407.11713">
    <title>[2407.11713] AutoFreeFem: Automatic code generation with FreeFEM++ and LaTex output for shape and topology optimization of non-linear multi-physics problems</title>
    <dc:date>2024-08-08T13:42:08+00:00</dc:date>
    <link>https://arxiv.org/abs/2407.11713</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[For an educational purpose we develop the Python package AutoFreeFem which generates all ingredients for shape optimization with non-linear multi-physics in FreeFEM++ and also outputs the expressions for use in LaTex. As an input, the objective function and the weak form of the problem have to be specified only once. This ensures consistency between the simulation code and its documentation. In particular, AutoFreeFem provides the linearization of the state equation, the adjoint problem, the shape derivative, as well as a basic implementation of the level-set based mesh evolution method for shape optimization. For the computation of shape derivatives we utilize the mathematical Lagrangian approach for differentiating PDE-constrained shape functions. Differentiation is done symbolically using Sympy. In numerical experiments we verify the accuracy of the computed derivatives. Finally, we showcase the capabilities of AutoFreeFem by considering shape optimization of a non-linear diffusion problem, linear and non-linear elasticity problems, a thermo-elasticity problem and a fluid-structure interaction problem.
]]></description>
<dc:subject>engineering-design finite-elements-analysis Python numerical-methods scientific-computing simulation rather-interesting library to-understand to-write-about consider:optimization consider:benchmarking</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3ed33361e396/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:finite-elements-analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Python"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:numerical-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:scientific-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:library"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:benchmarking"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2312.13944">
    <title>[2312.13944] Docking-based generative approaches in the search for new drug candidates</title>
    <dc:date>2024-07-03T10:48:08+00:00</dc:date>
    <link>https://arxiv.org/abs/2312.13944</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Despite the great popularity of virtual screening of existing compound libraries, the search for new potential drug candidates also takes advantage of generative protocols, where new compound suggestions are enumerated using various algorithms. To increase the activity potency of generative approaches, they have recently been coupled with molecular docking, a leading methodology of structure-based drug design. In this review, we summarize progress since docking-based generative models emerged. We propose a new taxonomy for these methods and discuss their importance for the field of computer-aided drug design. In addition, we discuss the most promising directions for further development of generative protocols coupled with docking.
]]></description>
<dc:subject>biochemistry pharmaceutical design-automation rather-interesting simulation molecular-design molecular-biology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:9f055f81cf4a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biochemistry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:pharmaceutical"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:design-automation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:molecular-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:molecular-biology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2108.08353">
    <title>[2108.08353] Deterministic cellular automata resembling diffusion</title>
    <dc:date>2024-03-31T01:02:42+00:00</dc:date>
    <link>https://arxiv.org/abs/2108.08353</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We investigate number conserving cellular automata with up to five inputs and two states with the goal of comparing their dynamics with diffusion. For this purpose, we introduce the concept of decompression ratio describing expansion of configurations with finite support. We find that a large number of number-conserving rules exhibit abrupt change in the decompression ratio when the density of the initial pattern is increasing, somewhat analogous to the second order phase transition. The existence of this transition is formally proved for rule 184. Small number of rules exhibit infinite decompression ratio, and such rules may be useful for "engineering" of CA rules which are good models of diffusion, although they will most likely require more than two states.
]]></description>
<dc:subject>cellular-automata diffusion simulation rather-interesting to-write-about to-simulate consider:clarification</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:7bb43ea2ff22/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cellular-automata"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:diffusion"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:clarification"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2105.11143">
    <title>[2105.11143] A multi-grid Cellular Automaton model for simulating dendrite growth and its application in additive manufacturing</title>
    <dc:date>2024-03-29T14:37:49+00:00</dc:date>
    <link>https://arxiv.org/abs/2105.11143</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The dendrite growth in casting and additive manufacturing is rather important and related to the formation of some defects. However, quantitatively simulating the growth of dendrites with arbitrary crystallographic orientations in 3-dimension(3D) is still very challenging. In the present work, we develop a multi-grid Cellular Automaton (CA) model for the dendrite growth. In this model, the interfacial area is further discretized into a child grid, on which the decentered octahedron growth algorithm is performed. The model is comprehensively and quantitatively verified by comparing with the prediction of analytical models and a published x-ray imaging observation result, proving that the model is quantitatively and morphologically accurate. After that, with the temperature gradient and cooling rate extracted from a finite-volume-method(FVM)-based thermal-fluid model, the model was applied in reproducing the dendrite growth process of nickel-based superalloy during a single-track electron beam melting process. The simulation results agree fairly well with the experimental observation, demonstrating the feasibility and effectiveness of using the model in additive manufacturing.
]]></description>
<dc:subject>cellular-automata rather-interesting simulation materials-science to-write-about to-simulate consider:grid-interactions</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:eac4a64275b3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cellular-automata"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:grid-interactions"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2209.10687">
    <title>[2209.10687] Motion Planning for a Climbing Robot with Stochastic Grasps</title>
    <dc:date>2023-10-10T10:14:45+00:00</dc:date>
    <link>https://arxiv.org/abs/2209.10687</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Motion planning for a multi-limbed climbing robot must consider the robot's posture, joint torques, and how it uses contact forces to interact with its environment. This paper focuses on motion planning for a robot that uses nontraditional locomotion to explore unpredictable environments such as martian caves. Our robotic concept, ReachBot, uses extendable and retractable booms as limbs to achieve a large reachable workspace while climbing. Each extendable boom is capped by a microspine gripper designed for grasping rocky surfaces. ReachBot leverages its large workspace to navigate around obstacles, over crevasses, and through challenging terrain. Our planning approach must be versatile to accommodate variable terrain features and robust to mitigate risks from the stochastic nature of grasping with spines. In this paper, we introduce a graph traversal algorithm to select a discrete sequence of grasps based on available terrain features suitable for grasping. This discrete plan is complemented by a decoupled motion planner that considers the alternating phases of body movement and end-effector movement, using a combination of sampling-based planning and sequential convex programming to optimize individual phases. We use our motion planner to plan a trajectory across a simulated 2D cave environment with at least 95% probability of success and demonstrate improved robustness over a baseline trajectory. Finally, we verify our motion planning algorithm through experimentation on a 2D planar prototype.
]]></description>
<dc:subject>motion-planning robotics simulation rather-interesting adaptive-control control-theory to-understand to-visualize</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:b45bfd4b7b0a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:motion-planning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:robotics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:adaptive-control"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-visualize"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1203.4667">
    <title>[1203.4667] Turing machines can be efficiently simulated by the General Purpose Analog Computer</title>
    <dc:date>2022-05-14T10:50:13+00:00</dc:date>
    <link>https://arxiv.org/abs/1203.4667</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The Church-Turing thesis states that any sufficiently powerful computational model which captures the notion of algorithm is computationally equivalent to the Turing machine. This equivalence usually holds both at a computability level and at a computational complexity level modulo polynomial reductions. However, the situation is less clear in what concerns models of computation using real numbers, and no analog of the Church-Turing thesis exists for this case. Recently it was shown that some models of computation with real numbers were equivalent from a computability perspective. In particular it was shown that Shannon's General Purpose Analog Computer (GPAC) is equivalent to Computable Analysis. However, little is known about what happens at a computational complexity level. In this paper we shed some light on the connections between this two models, from a computational complexity level, by showing that, modulo polynomial reductions, computations of Turing machines can be simulated by GPACs, without the need of using more (space) resources than those used in the original Turing computation, as long as we are talking about bounded computations. In other words, computations done by the GPAC are as space-efficient as computations done in the context of Computable Analysis.
]]></description>
<dc:subject>analog-computing representation simulation computational-complexity to-understand nonlinear-dynamics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:adde835968e4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:analog-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computational-complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1602.00546">
    <title>[1602.00546] On the Functions Generated by the General Purpose Analog Computer</title>
    <dc:date>2022-04-02T12:23:34+00:00</dc:date>
    <link>https://arxiv.org/abs/1602.00546</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We consider the General Purpose Analog Computer (GPAC), introduced by Claude Shannon in 1941 as a mathematical model of Differential Analysers, that is to say as a model of continuous-time analog (mechanical, and later one electronic) machines of that time. We extend the model properly to a model of computation not restricted to univariate functions (i.e. functions f:ℝ→ℝ) but also to the multivariate case of (i.e. functions f:ℝn→ℝm), and establish some basic properties. In particular, we prove that a very wide class of (continuous and discontinuous) functions can be uniformly approximated over their full domain. Technically: we generalize some known results about the GPAC to the multidimensional case: we extend naturally the notion of \emph{generable} function, from the unidimensional to the multidimensional case. We prove a few stability properties of this class, mostly stability by arithmetic operations, composition and ODE solving. We establish that generable functions are always analytic. We prove that generable functions include some basic (useful) generable functions, and that we can (uniformly) approximate a wide range of functions this way. This extends some of the results from \cite{Sha41} to the multidimensional case, and this also strengths the approximation result from \cite{Sha41} over a compact domain to a uniform approximation result over unbounded domains. We also discuss the issue of constants, and we prove that involved constants can basically assumed to always be polynomial time computable numbers.
]]></description>
<dc:subject>analog-computing rather-interesting looking-to-see simulation diffyQs nonlinear-dynamics classification to-write-about to-simulate consider:feature-discovery consider:structure-function</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:42bbe78494a1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:analog-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:diffyQs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:feature-discovery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:structure-function"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1805.02354">
    <title>[1805.02354] Transient phases in the Vicsek model of flocking</title>
    <dc:date>2022-03-19T12:11:35+00:00</dc:date>
    <link>https://arxiv.org/abs/1805.02354</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The Vicsek model of flocking is studied by computer simulation. We confined our studies here to the morphologies and the lifetimes of transient phases. In our simulation, we have identified three distinct transient phases, namely, vortex phase, colliding phase and multi-domain phase. The mapping of Vicsek model to XY model in the v→0 limit prompted us to explore the possibility of finding any vortex kind of phases in the Vicsek model. We have obtained rotating vortex phase and measured the lifetime of this vortex phase. We have also measured the lifetimes of other two transient phases, i.e., colliding phase and multi-domain phase. We have measured the integrated lifetime (τt) of all these transient phases and studied this as function of density (ρ) and noise (η). In the low noise regime, we proposed here a scaling law τtN−a=F(ρN−b) where F(x) is a scaling function like F(x)∼x−s. By the method of data collapse, we have estimated the exponents as a=−0.110±0.010, b=0.950±0.010 and s=1.027±0.008. The integrated lifetime τ (defined in the text differently) was observed to decrease as the noise approaches the critical noise from below. This behaviour is quite unusual and contrary to the critical slowing down observed in the case of equilibrium phase transitions. We have provided a possible explanation from the time evolution of the distribution of the directions of velocities.
]]></description>
<dc:subject>flocking boids simulation complexology self-organization collective-behavior to-write-about to-visualize</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c4d2ad67eead/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:flocking"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:boids"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:complexology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:self-organization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:collective-behavior"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-visualize"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1511.09203">
    <title>[1511.09203] Statistical mechanics of complex economies</title>
    <dc:date>2022-03-15T15:55:57+00:00</dc:date>
    <link>https://arxiv.org/abs/1511.09203</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In the pursuit of ever increasing efficiency and growth, our economies have evolved to remarkable degrees of complexity, with nested production processes feeding each other in order to create products of greater sophistication from less sophisticated ones, down to raw materials. The engine of such an expansion have been competitive markets that, according to General Equilibrium Theory (GET), achieve efficient allocations under specific conditions. We study large random economies within the GET framework, as templates of complex economies, and we find that a non-trivial phase transition occurs: the economy freezes in a state where all production processes collapse when either the number of primary goods or the number of available technologies fall below a critical threshold. As in other examples of phase transitions in large random systems, this is an unintended consequence of the growth in complexity. Our findings suggest that the Industrial Revolution can be regarded as a sharp transition between different phases, but also imply that well developed economies can collapse if too many intermediate goods are introduced.
]]></description>
<dc:subject>economics agent-based simulation looking-to-see complexology now-do-MMT to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:8eb136b79800/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:economics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:agent-based"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:complexology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:now-do-MMT"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2104.03704">
    <title>[2104.03704] Diffusion and escape from polygonal channels: extreme values and geometric effects</title>
    <dc:date>2022-03-06T11:58:15+00:00</dc:date>
    <link>https://arxiv.org/abs/2104.03704</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Polygonal billiards are an example of pseudo-chaotic dynamics, a combination of integrable evolution and sudden jumps due to conical singular points that arise from the corners of the polygons. Such pseudo-chaotic behaviour, often characterised by an algebraic separation of nearby trajectories, is believed to be linked to the wild dependence that particle transport has on the fine details of the billiard table. Here we address this relation through a detailed numerical study of the statistics of displacement in a family of polygonal channel billiards with parallel walls. We show that transport is characterised by strong anomalous diffusion, with a mean square displacement that scales in time faster than linear, and with a probability density of the displacement exhibiting exponential tails and ballistic fronts. In channels of finite length the distribution of first-passage times is characterised by fat tails, with a mean first-passage time that diverges when the aperture angle is rational. These findings have non trivial consequences for a variety of experiments.
]]></description>
<dc:subject>billiards simulation diffusion statistical-mechanics rather-interesting nonlinear-dynamics looking-to-see to-write-about consider:simulation consider:visualization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:a4152eda9c31/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:billiards"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:diffusion"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:statistical-mechanics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:visualization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2007.15642">
    <title>[2007.15642] Graphical Conditions for Rate Independence in Chemical Reaction Networks</title>
    <dc:date>2022-03-02T11:35:57+00:00</dc:date>
    <link>https://arxiv.org/abs/2007.15642</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Chemical Reaction Networks (CRNs) provide a useful abstraction of molecular interaction networks in which molecular structures as well as mass conservation principles are abstracted away to focus on the main dynamical properties of the network structure. In their interpretation by ordinary differential equations, we say that a CRN with distinguished input and output species computes a positive real function f:R+\rightarrowR+, if for any initial concentration x of the input species, the concentration of the output molecular species stabilizes at concentration f (x). The Turing-completeness of that notion of chemical analog computation has been established by proving that any computable real function can be computed by a CRN over a finite set of molecular species. Rate-independent CRNs form a restricted class of CRNs of high practical value since they enjoy a form of absolute robustness in the sense that the result is completely independent of the reaction rates and depends solely on the input concentrations. The functions computed by rate-independent CRNs have been characterized mathematically as the set of piecewise linear functions from input species. However, this does not provide a mean to decide whether a given CRN is rate-independent. In this paper, we provide graphical conditions on the Petri Net structure of a CRN which entail the rate-independence property either for all species or for some output species. We show that in the curated part of the Biomodels repository, among the 590 reaction models tested, 2 reaction graphs were found to satisfy our rate-independence conditions for all species, 94 for some output species, among which 29 for some non-trivial output species. Our graphical conditions are based on a non-standard use of the Petri net notions of place-invariants and siphons which are computed by constraint programming techniques for efficiency reasons.
]]></description>
<dc:subject>reaction-networks rather-interesting theoretical-biology nonlinear-dynamics simulation abstraction to-write-about consider:feature-discovery</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:961a3a9f2b02/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:reaction-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:theoretical-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:abstraction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:feature-discovery"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1908.07874">
    <title>[1908.07874] Analog circuits for mixed-signal neuromorphic computing architectures in 28 nm FD-SOI technology</title>
    <dc:date>2022-02-11T15:27:58+00:00</dc:date>
    <link>https://arxiv.org/abs/1908.07874</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Developing mixed-signal analog-digital neuromorphic circuits in advanced scaled processes poses significant design challenges. We present compact and energy efficient sub-threshold analog synapse and neuron circuits, optimized for a 28 nm FD-SOI process, to implement massively parallel large-scale neuromorphic computing systems. We describe the techniques used for maximizing density with mixed-mode analog/digital synaptic weight configurations, and the methods adopted for minimizing the effect of channel leakage current, in order to implement efficient analog computation based on pA-nA small currents. We present circuit simulation results, based on a new chip that has been recently taped out, to demonstrate how the circuits can be useful for both low-frequency operation in systems that need to interact with the environment in real-time, and for high-frequency operation for fast data processing in different types of spiking neural network architectures.
]]></description>
<dc:subject>neural-networks analog-computing rather-interesting representation simulation engineering-design to-write-about to-understand consider:getting-a-dang-simulator</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:f8c80b9f3af0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:analog-computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:getting-a-dang-simulator"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1804.02795">
    <title>[1804.02795] Weak Rigidity Theory and its Application to Multi-agent Formation Stabilization</title>
    <dc:date>2022-01-24T12:29:52+00:00</dc:date>
    <link>https://arxiv.org/abs/1804.02795</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[This paper introduces the notion of weak rigidity to characterize a framework by pairwise inner products of inter-agent displacements. Compared to distance-based rigidity, weak rigidity requires fewer constrained edges in the graph to determine a geometric shape in an arbitrarily dimensional space. A necessary and sufficient graphical condition for infinitesimal weak rigidity of planar frameworks is derived. As an application of the proposed weak rigidity theory, a gradient based control law and a non-gradient based control law are designed for a group of single-integrator modeled agents to stabilize a desired formation shape, respectively. Using the gradient control law, we prove that an infinitesimally weakly rigid formation is locally exponentially stable. In particular, if the number of agents is one greater than the dimension of the space, a minimally infinitesimally weakly rigid formation is almost globally asymptotically stable. In the literature of rigid formation, the sensing graph is always required to be rigid. Using the non-gradient control law based on weak rigidity theory, the sensing graph is unnecessary to be rigid for local exponential stability of the formation. A numerical simulation is performed for illustrating effectiveness of our main results.
]]></description>
<dc:subject>agent-based simulation numerical-methods mechanics rather-interesting to-write-about to-understand consider:visualization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:cb4d2381c591/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:agent-based"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:numerical-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mechanics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:visualization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1702.08411">
    <title>[1702.08411] The revival of the Baldwin Effect</title>
    <dc:date>2021-11-04T12:52:29+00:00</dc:date>
    <link>https://arxiv.org/abs/1702.08411</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The idea that a genetically fixed behavior evolved from the once differential learning ability of individuals that performed the behavior is known as the Baldwin effect. A highly influential paper [Hinton G.E., Nowlan S.J., 1987. How learning can guide evolution. Complex Syst. 1, 495-502] claimed that this effect can be observed in silico, but here we argue that what was actually shown is that the learning ability is easily selected for. Then we demonstrate the Baldwin effect to happen in the in silico scenario by estimating the probability and waiting times for the learned behavior to become innate. Depending on parameter values, we find that learning can increase the chance of fixation of the learned behavior by several orders of magnitude compared with the non-learning situation.
]]></description>
<dc:subject>evolutionary-biology theoretical-biology simulation rather-interesting to-write-about to-simulate consider:constant-learning-in-GP</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d8eddbc38602/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:evolutionary-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:theoretical-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:constant-learning-in-GP"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1705.08756">
    <title>[1705.08756] Short and random: Modelling the effects of (proto-)neural elongations</title>
    <dc:date>2021-11-04T09:54:31+00:00</dc:date>
    <link>https://arxiv.org/abs/1705.08756</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[To understand how neurons and nervous systems first evolved, we need an account of the origins of neural elongations: Why did neural elongations (axons and dendrites) first originate, such that they could become the central component of both neurons and nervous systems? Two contrasting conceptual accounts provide different answers to this question. Braitenberg's vehicles provide the iconic illustration of the dominant input-output (IO) view. Here the basic role of neural elongations is to connect sensors to effectors, both situated at different positions within the body. For this function, neural elongations are thought of as comparatively long and specific connections, which require an articulated body involving substantial developmental processes to build. Internal coordination (IC) models stress a different function for early nervous systems. Here the coordination of activity across extended parts of a multicellular body is held central, in particular for the contractions of (muscle) tissue. An IC perspective allows the hypothesis that the earliest proto-neural elongations could have been functional even when they were initially simple short and random connections, as long as they enhanced the patterning of contractile activity across a multicellular surface. The present computational study provides a proof of concept that such short and random neural elongations can play this role. While an excitable epithelium can generate basic forms of patterning for small body-configurations, adding elongations allows such patterning to scale up to larger bodies. This result supports a new, more gradual evolutionary route towards the origins of the very first full neurons and nervous systems.
]]></description>
<dc:subject>artificial-life evolutionary-biology neural-networks rather-interesting simulation self-organization to-write-about to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:21541c9410b0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:artificial-life"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:evolutionary-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:self-organization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1709.08999">
    <title>[1709.08999] Optimal Stationary Synchronization of Heterogeneous Linear Multi-Agent Systems</title>
    <dc:date>2021-10-06T11:26:55+00:00</dc:date>
    <link>https://arxiv.org/abs/1709.08999</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In this paper, we address the output synchronization of heterogeneous linear networks. In the literature, all agents are typically required to synchronize exactly to a common trajectory. Here, we introduce optimal stationary synchronization (OSS) instead which permits non-zero steady-state synchronization errors. As a benefit, we are able to relax standard requirements. E.g., agents are allowed to participate in the network even when they usually cannot synchronize exactly. In addition, OSS enables agents to save input-energy by synchronizing within tolerable error-bounds. Our new method combines the synchronization of bounded exosystems with local infinite-time linear quadratic tracking (LQT). This results in an optimal balance of each agent's synchronization error versus its consumed input-energy. Moreover, we extend recent results in LQT such that the derived time-invariant optimal control guarantees that the synchronization error satisfies given strict bounds. All these aspects are demonstrated by an illustrative simulation example with a detailed analysis.
]]></description>
<dc:subject>collective-behavior nonlinear-dynamics agent-based simulation control-theory operations-research rather-interesting rather-odd to-write-about to-simulate consider:visualization consider:explaining-better mechanism-design</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:efe6d1d95716/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:collective-behavior"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:agent-based"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:control-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:operations-research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-odd"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:visualization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:explaining-better"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mechanism-design"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2012.09715">
    <title>[2012.09715] Approximating inverse cumulative distribution functions to produce approximate random variables</title>
    <dc:date>2021-06-27T10:12:23+00:00</dc:date>
    <link>https://arxiv.org/abs/2012.09715</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[For random variables produced through the inverse transform method, approximate random variables are introduced, which are produced by approximations to a distribution's inverse cumulative distribution function. These approximations are designed to be computationally inexpensive, and much cheaper than exact library functions, and thus highly suitable for use in Monte Carlo simulations. Two approximations are presented for the Gaussian distribution: a piecewise constant on equally spaced intervals, and a piecewise linear using geometrically decaying intervals. The error of the approximations are bounded and the convergence demonstrated, and the computational savings measured for C and C++ implementations. Implementations tailored for Intel and Arm hardwares are inspected, alongside hardware agnostic implementations built using OpenMP. The savings are incorporated into a nested multilevel Monte Carlo framework with the Euler-Maruyama scheme to exploit the speed ups without losing accuracy, offering speed ups by a factor of 5--7. These ideas are empirically extended to the Milstein scheme, and the Cox-Ingersoll-Ross process' non central chi-squared distribution, which offer speed ups by a factor of 250 or more.
]]></description>
<dc:subject>numerical-methods approximation rather-interesting simulation sampling performance-measure computational-complexity nudge-targets consider:representation consider:performance-measures consider:lexicase consider:extreme-values</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:8ed61cde1044/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:numerical-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:sampling"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computational-complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:performance-measures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:lexicase"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:extreme-values"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2102.00113">
    <title>[2102.00113] A universal solution scheme for fractional and classical PDEs</title>
    <dc:date>2021-06-27T10:10:43+00:00</dc:date>
    <link>https://arxiv.org/abs/2102.00113</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We propose a unified meshless method to solve classical and fractional PDE problems with (−Δ)α2 for α∈(0,2]. The classical (α=2) and fractional (α<2) Laplacians, one local and the other nonlocal, have distinct properties. Therefore, their numerical methods and computer implementations are usually incompatible. We notice that for any α≥0, the Laplacian (−Δ)α2 of generalized inverse multiquadric (GIMQ) functions can be analytically written by the Gauss hypergeometric function, and thus propose a GIMQ-based method. Our method unifies the discretization of classical and fractional Laplacians and also bypasses numerical approximation to the hypersingular integral of fractional Laplacian. These two merits distinguish our method from other existing methods for the fractional Laplacian. Extensive numerical experiments are carried out to test the performance of our method. Compared to other methods, our method can achieve high accuracy with fewer number of unknowns, which effectively reduces the storage and computational requirements in simulations of fractional PDEs. Moreover, the meshfree nature makes it free of geometric constraints and enables simple implementation for any dimension d≥1. Additionally, two approaches of selecting shape parameters, including condition number-indicated method and random-perturbed method, are studied to avoid the ill-conditioning issues when large number of points.
]]></description>
<dc:subject>numerical-methods diffy-Qs nonlinear-dynamics inverse-problems rather-interesting to-understand simulation representation consider:performance-measures consider:lexicase</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d31989508c16/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:numerical-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:diffy-Qs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:inverse-problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:performance-measures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:lexicase"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1801.05247">
    <title>[1801.05247] Using the Maximum Entropy Principle to Combine Simulations and Solution Experiments</title>
    <dc:date>2021-06-20T10:46:24+00:00</dc:date>
    <link>https://arxiv.org/abs/1801.05247</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Molecular dynamics (MD) simulations allow investigating the structural dynamics of biomolecular systems with unrivaled time and space resolution. However, in order to compensate for the inaccuracies of the utilized empirical force fields, it is becoming common to integrate MD simulations with experimental data obtained from ensemble measurements. We here review the approaches that can be used to combine MD and experiment under the guidance of the maximum entropy principle. We mostly focus on methods based on Lagrangian multipliers, either implemented as reweighting of existing simulations or through an on-the-fly optimization. We discuss how errors in the experimental data can be modeled and accounted for. Finally, we use simple model systems to illustrate the typical difficulties arising when applying these methods.
]]></description>
<dc:subject>simulation aggregation algorithms information-theory rather-interesting to-understand consider:simpler-landscape-results consider:landscape-structure</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:78ebfa32c717/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:aggregation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:simpler-landscape-results"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:landscape-structure"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2012.05503">
    <title>[2012.05503] Geometric algorithms for sampling the flux space of metabolic networks</title>
    <dc:date>2021-05-22T21:50:23+00:00</dc:date>
    <link>https://arxiv.org/abs/2012.05503</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Systems Biology is a fundamental field and paradigm that introduces a new era in Biology. The crux of its functionality and usefulness relies on metabolic networks that model the reactions occurring inside an organism and provide the means to understand the underlying mechanisms that govern biological systems. Even more, metabolic networks have a broader impact that ranges from resolution of ecosystems to personalized medicine.The analysis of metabolic networks is a computational geometry oriented field as one of the main operations they depend on is sampling uniformly points from polytopes; the latter provides a representation of the steady states of the metabolic networks. However, the polytopes that result from biological data are of very high dimension (to the order of thousands) and in most, if not all, the cases are considerably skinny. Therefore, to perform uniform random sampling efficiently in this setting, we need a novel algorithmic and computational framework specially tailored for the properties of metabolic networks.We present a complete software framework to handle sampling in metabolic networks. Its backbone is a Multiphase Monte Carlo Sampling (MMCS) algorithm that unifies rounding and sampling in one pass, obtaining both upon termination. It exploits an improved variant of the Billiard Walk that enjoys faster arithmetic complexity per step. We demonstrate the efficiency of our approach by performing extensive experiments on various metabolic networks. Notably, sampling on the most complicated human metabolic network accessible today, Recon3D, corresponding to a polytope of dimension 5 335 took less than 30 hours. To our knowledge, that is out of reach for existing software.
]]></description>
<dc:subject>dynamical-systems reaction-networks simulation algorithms approximation sampling rather-interesting to-write-about consider:general-case consider:ReQ systems-biology</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:59ee2e9eec9c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:reaction-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:sampling"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:general-case"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:ReQ"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:systems-biology"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2104.08636">
    <title>[2104.08636] Avoiding the bullies: The resilience of cooperation among unequals</title>
    <dc:date>2021-05-19T10:41:16+00:00</dc:date>
    <link>https://arxiv.org/abs/2104.08636</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Can egalitarian norms or conventions survive the presence of dominant individuals who are ensured of victory in conflicts? We investigate the interaction of power asymmetry and partner choice in games of conflict over a contested resource. We introduce three models to study the emergence and resilience of cooperation among unequals when interaction is random, when individuals can choose their partners, and where power asymmetries dynamically depend on accumulated payoffs. We find that the ability to avoid bullies with higher competitive ability afforded by partner choice mostly restores cooperative conventions and that the competitive hierarchy never forms. Partner choice counteracts the hyper dominance of bullies who are isolated in the network and eliminates the need for others to coordinate in a coalition. When competitive ability dynamically depends on cumulative payoffs, complex cycles of coupled network-strategy-rank changes emerge. Effective collaborators gain popularity (and thus power), adopt aggressive behavior, get isolated, and ultimately lose power. Neither the network nor behavior converge to a stable equilibrium. Despite the instability of power dynamics, the cooperative convention in the population remains stable overall and long-term inequality is completely eliminated. The interaction between partner choice and dynamic power asymmetry is crucial for these results: without partner choice, bullies cannot be isolated, and without dynamic power asymmetry, bullies do not lose their power even when isolated. We analytically identify a single critical point that marks a phase transition in all three iterations of our models. This critical point is where the first individual breaks from the convention and cycles start to emerge.
]]></description>
<dc:subject>cultural-dynamics evolutionary-economics agent-based rather-interesting simulation to-simulate to-write-about consider:structural-variants</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:583bc79ffed3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cultural-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:evolutionary-economics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:agent-based"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:structural-variants"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://github.com/thi-ng/geom">
    <title>thi-ng/geom: 2D/3D geometry toolkit for Clojure/Clojurescript</title>
    <dc:date>2021-05-18T22:11:15+00:00</dc:date>
    <link>https://github.com/thi-ng/geom</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[thi.ng/geom is a comprehensive and modular geometry & visualization toolkit for Clojure/ClojureScript. It provides a large set of purely math & geometry oriented data types, a polymorphic, largely protocol based API to transform/convert types and various ways to create interactive visualizations in SVG, WebGL, OpenGL, both in the browser and in desktop environments.

Embracing Clojure’s approach of data transformations, the library’s core philosophy is based on a functional approach to generative design tasks with hundreds of hours spent on refining & optimizing the core API for both Clojure & Clojurescript.

Unlike most other open source projects, this project has been developed in a literate programming style and has been in active, regular development since late 2011, currently in its 4th iteration/rewrite cycle.

You’re highly encouraged to consult the source code, which contains documentation, examples, diagrams and general usage pattern hints.

This project is part of the thi.ng collection of Clojure & Clojurescript libraries and makes uses of several other projects in this collection (see dependencies further below).

]]></description>
<dc:subject>clojure physics simulation graphics library to-understand to-use consider:granular-materials consider:mechanisms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:534786dcaee0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:clojure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:physics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:graphics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:library"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-use"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:granular-materials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:mechanisms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2009.00295">
    <title>[2009.00295] Predictive Accuracy of Wall-Modelled Large-Eddy Simulation on Unstructured Grids</title>
    <dc:date>2020-11-29T15:21:01+00:00</dc:date>
    <link>https://arxiv.org/abs/2009.00295</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The predictive accuracy of wall-modelled LES is influenced by a combination of the subgrid model, the wall model, the numerical dissipation induced primarily by the convective numerical scheme, and also by the density and topology of the computational grid. The latter factor is of particular importance for industrial flow problems, where unstructured grids are typically employed due to the necessity to handle complex geometries. Here, a systematic simulation-based study is presented, investigating the effect of grid-cell type on the predictive accuracy of wall-modelled LES in the framework of a general-purpose finite-volume solver. Following standard practice for meshing near-wall regions, it is proposed to use prismatic cells. Three candidate shapes for the base of the prisms are considered: a triangle, a quadrilateral, and an arbitrary polygon. The cell-centre distance is proposed as a metric to determine the spatial resolution of grids with different cell types. The simulation campaign covers two test cases with attached boundary layers: fully-developed turbulent channel flow, and a zero-pressure-gradient flat-plate turbulent boundary layer. A grid construction strategy is employed, which adapts the grid metric to the outer length scale of the boundary layer. The results are compared with DNS data concerning mean wall shear stress and profiles of flow statistics. The principle outcome is that unstructured simulations may provide the same accuracy as simulations on structured orthogonal hexahedral grids. The choice of base shape of the near-wall cells has a significant impact on the computational cost, but in terms of accuracy appears to be a factor of secondary importance.
]]></description>
<dc:subject>simulation fluid-dynamics representation looking-to-see rather-interesting modeling-is-not-mathematics to-write-about consider:simulation approximation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:a4de464b0f00/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:fluid-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:modeling-is-not-mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:approximation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2005.02901">
    <title>[2005.02901] Marginally jammed states of hard disks in a one-dimensional channel</title>
    <dc:date>2020-11-27T00:31:37+00:00</dc:date>
    <link>https://arxiv.org/abs/2005.02901</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We have studied a class of marginally jammed states in a system of hard disks confined in a narrow channel---a quasi-one-dimensional system---whose exponents are not those predicted by theories valid in the infinite dimensional limit. The exponent γ which describes the distribution of small gaps takes the value 1 rather than the infinite dimensional value 0.41269…. Our work shows that there exist jammed states not found within the tiling approach of Ashwin and Bowles. The most dense of these marginal states is an unusual state of matter that is asymptotically crystalline.
]]></description>
<dc:subject>granular-materials simulation constraint-satisfaction rather-interesting nonlinear-dynamics to-write-about to-simulate consider:animation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:f30e0e3c8a7e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:granular-materials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:constraint-satisfaction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:animation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/cond-mat/0203237">
    <title>[cond-mat/0203237] Model of coarsening and vortex formation in vibrated granular rods</title>
    <dc:date>2020-10-15T10:29:17+00:00</dc:date>
    <link>https://arxiv.org/abs/cond-mat/0203237</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Neicu and Kudrolli observed experimentally spontaneous formation of the long-range orientational order and large-scale vortices in a system of vibrated macroscopic rods. We propose a phenomenological theory of this phenomenon, based on a coupled system of equations for local rods density and tilt. The density evolution is described by modified Cahn-Hilliard equation, while the tilt is described by the Ginzburg-Landau type equation. Our analysis shows that, in accordance to the Cahn-Hilliard dynamics, the islands of the ordered phase appear spontaneously and grow due to coarsening. The generic vortex solutions of the Ginzburg-Landau equation for the tilt correspond to the vortical motion of the rods around the cores which are located near the centers of the islands.
]]></description>
<dc:subject>granular-materials simulation models rather-interesting to-understand nonlinear-dynamics phase-transitions to-write-about consider:looking-to-see consider:simulation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:2718437398e7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:granular-materials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:phase-transitions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:simulation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1902.00565">
    <title>[1902.00565] Random packing of rods in small containers</title>
    <dc:date>2020-10-14T11:31:57+00:00</dc:date>
    <link>https://arxiv.org/abs/1902.00565</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We conduct experiments and simulations to study the disordered packing of rods in small containers. Experiments study cylindrical rods with aspect ratio ranging from 4 to 32; simulations use of spherocylinders with similar aspect ratios. In all cases, rods pack randomly in cylindrical containers whose smallest dimension is larger than the rod length. Packings in smaller containers have lower volume fractions than those in larger containers, demonstrating the influence of the boundaries. The volume fraction extrapolated to infinite container size decreases with increasing aspect ratio, in agreement with previous work. X-ray tomography experiments show that the boundary effects depend on the orientation of the boundary, indicating a strong influence of gravity, whereas the simulation finds boundary effects that are purely geometric. In all cases, the boundary influence extends approximately half a particle length into the interior of the container.
]]></description>
<dc:subject>granular-materials packing looking-to-see materials-science to-write-about simulation condensed-matter liquid-crystals experiment</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:9f1c6eb61ca8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:granular-materials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:packing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:condensed-matter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:liquid-crystals"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:experiment"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.researchgate.net/publication/10726190_Random_Packings_of_Spheres_and_Spherocylinders_Simulated_by_Mechanical_Contraction">
    <title>(PDF) Random Packings of Spheres and Spherocylinders Simulated by Mechanical Contraction</title>
    <dc:date>2020-10-14T11:12:16+00:00</dc:date>
    <link>https://www.researchgate.net/publication/10726190_Random_Packings_of_Spheres_and_Spherocylinders_Simulated_by_Mechanical_Contraction</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We introduce a simulation technique for creating dense random packings of hard particles. The technique is particularly suited to handle particles of different shapes. Dense amorphous packings of spheres have been formed, which are consistent with the existing work on random sphere packings. Packings of spherocylinders have also been simulated out to the large aspect ratio of alpha=160.0. Our method packs randomly oriented spherocylinders to densities that reproduce experimental results on anisotropic powders and colloids very well. Interestingly, the highest packing density of phi=0.70 is achieved for very short spherocylinders rather than spheres. This suggests that slightly changing the shapes of the particles forming a hard sphere glass could cause it to melt. Comparisons between the equilibrium phase diagram for hard spherocylinders and the densest possible amorphous packings have interesting implications on the crystallization of spherocylinders as a function of aspect ratio.
]]></description>
<dc:subject>granular-materials simulation liquid-crystals materials-science industrial-engineering to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:791c4477416a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:granular-materials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:liquid-crystals"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:materials-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:industrial-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1709.10043">
    <title>[1709.10043] Revealing new dynamical patterns in a reaction-diffusion model with cyclic competition via a novel computational framework</title>
    <dc:date>2020-08-05T16:25:00+00:00</dc:date>
    <link>https://arxiv.org/abs/1709.10043</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Understanding how patterns and travelling waves form in chemical and biological reaction-diffusion models is an area which has been widely researched, yet is still experiencing fast development. Surprisingly enough, we still do not have a clear understanding about all possible types of dynamical regimes in classical reaction-diffusion models such as Lotka-Volterra competition models with spatial dependence. In this work, we demonstrate some new types of wave propagation and pattern formation in a classical three species cyclic competition model with spatial diffusion, which have been so far missed in the literature. These new patterns are characterised by a high regularity in space, but are different from patterns previously known to exist in reaction-diffusion models, and may have important applications in improving our understanding of biological pattern formation and invasion theory. Finding these new patterns is made technically possible by using an automatic adaptive finite element method driven by a novel a posteriori error estimate which is proven to provide a reliable bound for the error of the numerical method. We demonstrate how this numerical framework allows us to easily explore the dynamical patterns both in two and three spatial dimensions.
]]></description>
<dc:subject>pattern-formation Turing-systems reaction-networks rather-interesting simulation to-understand to-simulate pattern-discovery consider:feature-discovery</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:4712e9eddddb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:pattern-formation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Turing-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:reaction-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:pattern-discovery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:feature-discovery"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cleonis.nl/physics/phys256/coupling.php">
    <title>Rotational-vibrational coupling</title>
    <dc:date>2020-07-15T20:35:59+00:00</dc:date>
    <link>http://www.cleonis.nl/physics/phys256/coupling.php</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Rotational-vibrational coupling occurs when there is a 1:2 ratio of rotation frequency of an object and a natural internal vibration frequency. The animation on the right shows the simplest example of this phenomenon. The motion depicted in the animation is for the idealized situation that the force exerted by the spring is proportional to the amount of extension. Note that in this demonstration the spring isn't alternating between pulling and pushing, the spring is exerting a contracting force all the time; given the chance the idealized spring would contract all the way down to zero length. Also, since the animation keeps on looping, the animation depicts what would occur if there would not be any friction.

In molecular physics it is recognized that there is a coupling of rotational and vibrational energy-levels. In molecular physics rotational-vibrational coupling is also called rovibronic coupling and Coriolis coupling. The physics of actual diatomic molecules is more complicated than the example in the animation, but because of its simplicity the animation is useful for illustrating the basic principles.

]]></description>
<dc:subject>dynamical-systems simulation physics rather-interesting via:twitter to-write-about to-simulate consider:exponents consider:varying-constants</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c4a410a72bee/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:physics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:via:twitter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:exponents"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:varying-constants"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.biorxiv.org/content/10.1101/120097v1?rss=1">
    <title>Fragmentation modes and the evolution of life cycles | bioRxiv</title>
    <dc:date>2020-06-14T12:42:05+00:00</dc:date>
    <link>https://www.biorxiv.org/content/10.1101/120097v1?rss=1</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Reproduction is a defining feature of living systems. Reproduction modes range from binary fission in bacteria to various modes of collective-level reproduction in multicellular organisms. However, the evolution of these modes and their adaptive significance is unclear. We develop a model in which groups arise from the division of single cells that do not separate, but stay together until the moment of group fragmentation. Fragmentation occurs via either complete or partial fission, resulting in a wide range of life cycles. By determining the relationship between life cycle and population growth rate, we define optimal fragmentation modes that have a surprisingly narrow class of solutions. Our model and results provide a framework for analysing the evolution of simple life cycles and for testing the adaptive significance of different modes of reproduction.

]]></description>
<dc:subject>theoretical-biology life-history artificial-life simulation rather-interesting to-write-about to-simulate consider:visualization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:670e114b9954/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:theoretical-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:life-history"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:artificial-life"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:visualization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2004.13935">
    <title>[2004.13935] An Averaging Processes on Hypergraphs</title>
    <dc:date>2020-06-14T11:09:51+00:00</dc:date>
    <link>https://arxiv.org/abs/2004.13935</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Consider the following iterated process on a hypergraph H. Each vertex v has an initial vertex weight. At each step, we uniformly at random select an edge F in H, and for each vertex v in F we replace the weight of v by the average value of the vertex weights over all vertices in F. This is a generalization of an interactive process on graphs, first proposed by Aldous and Lanoue. In this paper, we use the eigenvalues of a Laplacian for hypergraphs to bound the rate of convergence for the iterated averaging process.
]]></description>
<dc:subject>hypergraphs dynamical-systems stochastic-systems rather-interesting simulation to-write-about to-simulate consider:structure consider:extreme-values</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:bc1e179bbbe4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:hypergraphs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:stochastic-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:structure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:extreme-values"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1603.07147">
    <title>[1603.07147] Frustration of freezing in a two dimensional hard-core fluid due to particle shape anisotropy</title>
    <dc:date>2020-05-24T10:45:31+00:00</dc:date>
    <link>https://arxiv.org/abs/1603.07147</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The freezing mechanism suggested for a fluid composed of hard disks [Huerta et al., Phys. Rev. E, 2006, 74, 061106] is used here to probe the fluid-to-solid transition in a hard-dumbbell fluid composed of overlapping hard disks with a variable length between disk centers. Analyzing the trends in the shape of second maximum of the radial distribution function of the planar hard-dumbbell fluid it has been found that the type of transition could be sensitive to the length of hard-dumbbell molecules. From the NpT Monte Carlo simulations data we show that if a hard-dumbbell length does not exceed 15% of the disk diameter, the fluid-to-solid transition scenario follows the case of a hard-disk fluid, i.e., the isotropic hard-dumbbell fluid experiences freezing. However, for a hard-dumbbell length larger than 15% of disk diameter, there is evidence that fluid-to-solid transition may change to continuous transition, i.e., such an isotropic hard-dumbbell fluid will avoid freezing.
]]></description>
<dc:subject>simulation physics! condensed-matter rather-interesting dimers have-proposed to-write-about to-simulate consider:animation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:2ee3c1e2d639/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:physics!"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:condensed-matter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:dimers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:have-proposed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:animation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1904.02630">
    <title>[1904.02630] Hydrodynamic Mobility Reversal of Squirmers near Flat and Curved Surfaces</title>
    <dc:date>2020-05-22T21:18:09+00:00</dc:date>
    <link>https://arxiv.org/abs/1904.02630</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Self-propelled particles have been experimentally shown to orbit spherical obstacles and move along surfaces. Here, we theoretically and numerically investigate this behavior for a hydrodynamic squirmer interacting with spherical objects and flat walls using three different methods of approximately solving the Stokes equations: The method of reflections, which is accurate in the far field; lubrication theory, which describes the close-to-contact behavior; and a lattice Boltzmann solver that accurately accounts for near-field flows. The method of reflections predicts three distinct behaviors: orbiting/sliding, scattering, and hovering, with orbiting being favored for lower curvature as in the literature. Surprisingly, it also shows backward orbiting/sliding for sufficiently strong pushers, caused by fluid recirculation in the gap between the squirmer and the obstacle leading to strong forces opposing forward motion. Lubrication theory instead suggests that only hovering is a stable point for the dynamics. We therefore employ lattice Boltzmann to resolve this discrepancy and we qualitatively reproduce the richer far-field predictions. Our results thus provide insight into a possible mechanism of mobility reversal mediated solely through hydrodynamic interactions with a surface.
]]></description>
<dc:subject>active-matter nanotechnology biophysics rather-interesting simulation fluid-dynamics to-understand to-write-about to-simulate consider:animations</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:209748cf4968/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:active-matter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nanotechnology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biophysics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:fluid-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:animations"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1803.04221">
    <title>[1803.04221] Extremal dependence of random scale constructions</title>
    <dc:date>2020-05-18T21:18:32+00:00</dc:date>
    <link>https://arxiv.org/abs/1803.04221</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[A bivariate random vector can exhibit either asymptotic independence or dependence between the largest values of its components. When used as a statistical model for risk assessment in fields such as finance, insurance or meteorology, it is crucial to understand which of the two asymptotic regimes occurs. Motivated by their ubiquity and flexibility, we consider the extremal dependence properties of vectors with a random scale construction (X1,X2)=R(W1,W2), with non-degenerate R>0 independent of (W1,W2). Focusing on the presence and strength of asymptotic tail dependence, as expressed through commonly-used summary parameters, broad factors that affect the results are: the heaviness of the tails of R and (W1,W2), the shape of the support of (W1,W2), and dependence between (W1,W2). When R is distinctly lighter tailed than (W1,W2), the extremal dependence of (X1,X2) is typically the same as that of (W1,W2), whereas similar or heavier tails for R compared to (W1,W2) typically result in increased extremal dependence. Similar tail heavinesses represent the most interesting and technical cases, and we find both asymptotic independence and dependence of (X1,X2) possible in such cases when (W1,W2) exhibit asymptotic independence. The bivariate case often directly extends to higher-dimensional vectors and spatial processes, where the dependence is mainly analyzed in terms of summaries of bivariate sub-vectors. The results unify and extend many existing examples, and we use them to propose new models that encompass both dependence classes.
]]></description>
<dc:subject>probability-theory representation bivariate-distributions correlation simulation approximation rather-interesting to-understand to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:98f5d851db63/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:probability-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:bivariate-distributions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:correlation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1803.04918">
    <title>[1803.04918] Uniform phases in fluids of hard isosceles triangles: one component and binary mixtures</title>
    <dc:date>2020-05-17T22:21:12+00:00</dc:date>
    <link>https://arxiv.org/abs/1803.04918</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We formulate the scaled particle theory for a general mixture of hard isosceles triangles and calculate different phase diagrams for the one-component fluid and for certain binary mixtures. The fluid of hard triangles exhibits a complex phase behavior: (i) the presence of a triatic phase with sixfold symmetry, (ii) the isotropic-uniaxial nematic transition is of first order for certain ranges of aspect ratios, and (iii) the one-component system exhibits nematic-nematic transitions ending in critical points. We found the triatic phase to be stable not only for equilateral triangles but also for triangles of similar aspect ratios. We focus the study of binary mixtures on the case of symmetric mixtures: equal particle areas with aspect ratios (κi) symmetric with respect to the equilateral one: κ1κ2=3. For these mixtures we found, aside from first-order isotropic-nematic and nematic-nematic transitions (the latter ending in a critical point): (i) A region of triatic phase stability even for mixtures made of particles that do not form this phase at the one-component limit, and (ii) the presence of a Landau point at which two isotropic-nematic first-order transitions and a nematic-nematic demixing transition coalesce. This phase behavior is analog to that of a symmetric three-dimensional mixture of rods and plates.
]]></description>
<dc:subject>condensed-matter simulation granular-materials rather-interesting metamaterials to-write-about to-simulate consider:simulation consider:generalizations</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:36df0ef26007/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:condensed-matter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:granular-materials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metamaterials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:generalizations"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1903.00441">
    <title>[1903.00441] The free energy of compressed lattice knots</title>
    <dc:date>2020-05-14T00:52:20+00:00</dc:date>
    <link>https://arxiv.org/abs/1903.00441</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[A compressed knotted ring polymer in a confining cavity is modelled by a knotted lattice polygon confined in a cube in ℤ3. The GAS algorithm [17] is used to sample lattice polygons of fixed knot type in a confining cube and to estimate the free energy of confined lattice knots. Lattice polygons of knot types the unknot, the trefoil knot, and the figure eight knot, are sampled and the free energies are estimated as functions of the concentration of monomers in the confining cube. The data show that the free energy is a function of knot type at low concentrations, and (mean-field) Flory-Huggins theory [12,15] is used to model the free energy as a function of monomer concentration. The Flory interaction parameter of knotted lattice polygons in ℤ3 is also estimated.]]></description>
<dc:subject>lattice-polymers molecular-design physics! simulation rather-interesting to-simulate looking-to-see virtual-experiments</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:5eba82b2292b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:lattice-polymers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:molecular-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:physics!"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:virtual-experiments"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1707.00083">
    <title>[1707.00083] Notes on Growing a Tree in a Graph</title>
    <dc:date>2020-05-04T11:54:41+00:00</dc:date>
    <link>https://arxiv.org/abs/1707.00083</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We study the height of a spanning tree T of a graph G obtained by starting with a single vertex of G and repeatedly selecting, uniformly at random, an edge of G with exactly one endpoint in T and adding this edge to T.]]></description>
<dc:subject>graph-theory network-theory probability-theory rather-interesting looking-to-see simulation feature-construction to-write-about to-simulate consider:variation consider:inverse-problem</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:dc0a1c70540d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:graph-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:network-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:probability-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:feature-construction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:variation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:inverse-problem"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1904.05970">
    <title>[1904.05970] Transverse excitations and zigzag transition in quasi-1D hard-disk system</title>
    <dc:date>2020-05-03T12:07:57+00:00</dc:date>
    <link>https://arxiv.org/abs/1904.05970</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Molecular dynamics computer simulations of collective excitations in a system of hard disks confined to a narrow channel of the specific width, that resembles 2D triangular lattice at disk close packing, are performed. We found that transverse excitations, which for hard-disk system are absent in the limit of 1D and are of acoustic nature in the limit of 2D, in the case of q1D hard-disk system emerge in the form of transverse optical excitations and could be considered as a tool to detect the structural transition to a zigzag ordering. By analyzing density evolution of longitudinal static structure factor and pair distribution function we have shown that driving force of zigzag ordering is caging phenomenon that in the case of hard-disk system is governed by excluded volume interaction with first and second neighbors and is of entropic origin.
]]></description>
<dc:subject>packing feature-discovery condensed-matter simulation rather-interesting constrained-dynamics to-simulate experiment consider:looking-to-see</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d342d0ef3be2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:packing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:feature-discovery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:condensed-matter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:constrained-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:experiment"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:looking-to-see"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1901.02950">
    <title>[1901.02950] Spectral Approach to Verifying Non-linear Arithmetic Circuits</title>
    <dc:date>2020-03-20T16:35:16+00:00</dc:date>
    <link>https://arxiv.org/abs/1901.02950</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[This paper presents a fast and effective computer algebraic method for analyzing and verifying non-linear integer arithmetic circuits using a novel algebraic spectral model. It introduces a concept of algebraic spectrum, a numerical form of polynomial expression; it uses the distribution of coefficients of the monomials to determine the type of arithmetic function under verification. In contrast to previous works, the proof of functional correctness is achieved by computing an algebraic spectrum combined with a local rewriting of word-level polynomials. The speedup is achieved by propagating coefficients through the circuit using And-Inverter Graph (AIG) datastructure. The effectiveness of the method is demonstrated with experiments including standard and Booth multipliers, and other synthesized non-linear arithmetic circuits up to 1024 bits containing over 12 million gates.
]]></description>
<dc:subject>nonlinear-dynamics electronics engineering-design rather-interesting digital-circuits verification testing simulation to-write-about to-simulate consider:genetic-programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:86a6958a9054/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:electronics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:digital-circuits"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:verification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:testing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:genetic-programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1311.2032">
    <title>[1311.2032] A Simple, Faster Method for Kinetic Proximity Problems</title>
    <dc:date>2020-03-08T18:58:14+00:00</dc:date>
    <link>https://arxiv.org/abs/1311.2032</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[For a set of n points in the plane, this paper presents simple kinetic data structures (KDS's) for solutions to some fundamental proximity problems, namely, the all nearest neighbors problem, the closest pair problem, and the Euclidean minimum spanning tree (EMST) problem. Also, the paper introduces KDS's for maintenance of two well-studied sparse proximity graphs, the Yao graph and the Semi-Yao graph. 
We use sparse graph representations, the Pie Delaunay graph and the Equilateral Delaunay graph, to provide new solutions for the proximity problems. Then we design KDS's that efficiently maintain these sparse graphs on a set of n moving points, where the trajectory of each point is assumed to be an algebraic function of constant maximum degree s. We use the kinetic Pie Delaunay graph and the kinetic Equilateral Delaunay graph to create KDS's for maintenance of the Yao graph, the Semi-Yao graph, all the nearest neighbors, the closest pair, and the EMST. Our KDS's use O(n) space and O(nlogn) preprocessing time. 
We provide the first KDS's for maintenance of the Semi-Yao graph and the Yao graph. Our KDS processes O(n2β2s+2(n)) (resp. O(n3β22s+2(n)logn)) events to maintain the Semi-Yao graph (resp. the Yao graph); each event can be processed in time O(logn) in an amortized sense. Here, βs(n) is an extremely slow-growing function. 
Our KDS for maintenance of all the nearest neighbors and the closest pair processes O(n2β22s+2(n)logn) events. For maintenance of the EMST, our KDS processes O(n3β22s+2(n)logn) events. For all three of these problems, each event can be handled in time O(logn) in an amortized sense. 
We improve the previous randomized kinetic algorithm for maintenance of all the nearest neighbors by Agarwal, Kaplan, and Sharir, and the previous EMST KDS by Rahmati and Zarei.
]]></description>
<dc:subject>computational-geometry data-structures simulation rather-interesting to-understand to-simulate to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:b13a69d71b9b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computational-geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:data-structures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://htsang.wikidot.com/research">
    <title>DR. HERBERT H. TSANG - http://www.herberttsang.org</title>
    <dc:date>2020-02-09T01:14:49+00:00</dc:date>
    <link>http://htsang.wikidot.com/research</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[RNA design algorithm takes an RNA secondary structure description as input and then try to identify an RNA strand that folds into this function-specific target structure. With new advances in biotechnology and synthetic biology, a reliable RNA design algorithm can be crucial steps to create new biochemical components. Our lab is interested in employing various computational intelligence techniques to propose the new paradigm to help with the RNA design problem. Recently, we have designed an algorithm SIMARD, which is based on the simulated annealing paradigm.
]]></description>
<dc:subject>structural-biology polymer-folding biochemistry biophysics simulation metaheuristics energy-landscapes rather-interesting to-write-about to-simulate to-visualize</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d531cf9636cd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:structural-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:polymer-folding"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biochemistry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biophysics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metaheuristics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:energy-landscapes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-visualize"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://manual.gromacs.org/documentation/2019/how-to/index.html">
    <title>Short How-To guides — GROMACS 2019 documentation</title>
    <dc:date>2020-02-09T01:06:09+00:00</dc:date>
    <link>http://manual.gromacs.org/documentation/2019/how-to/index.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[A number of short guides are presented here to help users getting started with simulations. More detailed tutorials are available for example at the http://www.mdtutorials.com/.

]]></description>
<dc:subject>structural-biology simulation software open-source rather-interesting to-simulate to-write-about consider:looking-to-see</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:9395b17ef4db/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:structural-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:software"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:open-source"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:looking-to-see"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1803.11511">
    <title>[1803.11511] Length segregation in mixtures of spherocylinders induced by imposed topological defects</title>
    <dc:date>2020-01-26T14:06:07+00:00</dc:date>
    <link>https://arxiv.org/abs/1803.11511</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We explore length segregation in binary mixtures of spherocylinders of lengths L1 and L2 with the same diameter D which are tangentially confined on a spherical surface of radius R. The orientation of spherocylinders is constrained along an externally imposed direction field on the sphere which is either along the longitude or the latitude lines of the sphere. In both situations, integer orientational defects at the poles are imposed. We show that these topological defects induce a complex segregation picture also depending on the length ratio factor γ=L2/L1 and the total packing fraction η of the spherocylinders. When the binary mixture is aligned along longitudinal lines of the sphere, shorter rods tend to accumulate at the topological defects of the polar caps whereas longer rods occupy central equatorial area of the spherical surface. In the reverse case of latitude ordering, a state can emerge where longer rods are predominantly both in the cap and in the equatorial areas and shorter rods are localized in between. As a reference situation, we consider a defect-free situation in the flat plane and do not find any length segregation there at similar γ and η, hence the segregation is purely induced by the imposed topological defects. It is also revealed that the shorter rods at γ=4 and η≥0.5 act as obstacles to the rotational relaxation of the longer rods when all orientational constraints are released.
]]></description>
<dc:subject>granular-materials mixing self-organization rather-interesting physics! simulation looking-to-see to-write-about to-simulate packing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:11d862fc943c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:granular-materials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mixing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:self-organization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:physics!"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:packing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1012.0369">
    <title>[1012.0369] Jammed particulate systems are inherently nonharmonic</title>
    <dc:date>2020-01-23T02:10:12+00:00</dc:date>
    <link>https://arxiv.org/abs/1012.0369</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Jammed particulate systems, such as granular media, colloids, and foams, interact via one-sided forces that are nonzero only when particles overlap. We find that systems with one-sided repulsive interactions possess no linear response regime in the large system limit (N→∞) for all pressures p (or compressions Δϕ), and for all N near jamming onset p→0. We perform simulations on 2D frictionless bidisperse mechanically stable disk packings over a range of packing fractions Δϕ=ϕ−ϕJ above jamming onset ϕJ. We apply perturbations with amplitude δ to the packings along each eigen-direction from the dynamical matrix and determine whether the response of the system evolving at constant energy remains in the original eigenmode of the perturbation. For δ>δc, which we calculate analytically, a single contact breaks and fluctuations abruptly spread to all harmonic modes. As δ increases further all discrete harmonic modes disappear into a continuous frequency band. We find that <δc>∼Δϕ/Nλ, where 1>λ>0.5, and thus jammed particulate systems are inherently nonharmonic with no linear vibrational response regime as N→∞ over the full range of Δϕ, and as Δϕ→0 at any N.
]]></description>
<dc:subject>granular-materials physics! nonlinear-dynamics complexology rather-interesting simulation looking-to-see have-you-tried-thwacking-it? ah-yes-I-see-you-did</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:ad58ef1f419b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:granular-materials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:physics!"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:complexology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:have-you-tried-thwacking-it?"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ah-yes-I-see-you-did"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://simjs.com/index.html">
    <title>SIM.JS | Discrete Event Simulation in JavaScript</title>
    <dc:date>2020-01-22T00:47:27+00:00</dc:date>
    <link>http://simjs.com/index.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[SIM.JS is a library for modeling discrete time event systems:

The library provides constructs to create Entities which are the active actors in the system and encapsulates the state and logic of components in a system.
The entities contend for resources, which can be Facilities (services that are requested by entities; supports FIFO, LIFO with preemption and Processor Sharing service disciplines), Buffers (resources that can store finite amount of tokens) and Stores (resources that can store JavaScript objects).
The entities communicate by waiting on Events or by sending Messages.
Statistics recording and analysis is provided by Data Series Statistics (collection of discrete, time-independent observations), Time Series Statistics (collection of discrete, time-dependent observations) and Population Statistics (the behavior of population growth and decline).
SIM.JS also provides a random number generation library to generate seeded random variates from various distributions, including uniform, exponential, normal, gamma, pareto and others.
]]></description>
<dc:subject>discrete-event-simulator library javascript to-try simulation engineering-design prediction optimization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e6db3adfa73e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:discrete-event-simulator"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:library"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:javascript"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-try"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optimization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1911.09792">
    <title>[1911.09792] Minority Voter Distributions and Partisan Gerrymandering</title>
    <dc:date>2020-01-19T18:38:45+00:00</dc:date>
    <link>https://arxiv.org/abs/1911.09792</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Many people believe that it is disadvantageous for members aligning with a minority party to cluster in cities, as this makes it easier for the majority party to gerrymander district boundaries to diminish the representation of the minority. We examine this effect by exhaustively computing the average representation for every possible 5×5 grid of population placement and district boundaries. We show that, in fact, it is advantageous for the minority to arrange themselves in clusters, as it is positively correlated with representation. We extend this result to more general cases by considering the dual graph of districts, and we also propose and analyze metaheuristic algorithms that allow us to find strong lower bounds for maximum expected representation.]]></description>
<dc:subject>gerrymandering voting looking-to-see simulation rather-interesting fairness optimization multiobjective-optimization to-simulate to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:93dfb88e453c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:gerrymandering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:voting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:fairness"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:multiobjective-optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/math/0508248">
    <title>[math/0508248] Self-contact Sets for 50 Tightly Knotted and Linked Tubes</title>
    <dc:date>2020-01-14T21:45:13+00:00</dc:date>
    <link>https://arxiv.org/abs/math/0508248</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We report on new numerical computations of the set of self-contacts in tightly knotted tubes of uniform circular cross-section. Such contact sets have been obtained before for the trefoil and figure eight knots by simulated annealing -- we use constrained gradient-descent to provide new self-contact sets for those and 48 other knot and link types. The minimum length of all unit diameter tubes in a given knot or link type is called the ropelength of that class of curves. Our computations yield improved upper bounds for the ropelength of all knots and links with 9 or fewer crossings except the trefoil.
]]></description>
<dc:subject>knot-theory simulation rather-interesting algorithms optimization computational-geometry to-write-about to-try</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:05711f6ad73b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:knot-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computational-geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-try"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1812.01502">
    <title>[1812.01502] Parallelising Particle Filters with Butterfly Interactions</title>
    <dc:date>2020-01-12T14:47:48+00:00</dc:date>
    <link>https://arxiv.org/abs/1812.01502</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Bootstrap particle filter (BPF) is the corner stone of many popular algorithms used for solving inference problems involving time series that are observed through noisy measurements in a non-linear and non-Gaussian context. The long term stability of BPF arises from particle interactions which in the context of modern parallel computing systems typically means that particle information needs to be communicated between processing elements, which makes parallel implementation of BPF nontrivial. 
In this paper we show that it is possible to constrain the interactions in a way which, under some assumptions, enables the reduction of the cost of communicating the particle information while still preserving the consistency and the long term stability of the BPF. Numerical experiments demonstrate that although the imposed constraints introduce additional error, the proposed method shows potential to be the method of choice in certain settings.
]]></description>
<dc:subject>parallel-processing distributed-processing algorithms collective-behavior simulation numerical-methods heuristics to-understand to-write-about optimization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:0b8938e31ee0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:parallel-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:distributed-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:collective-behavior"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:numerical-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:heuristics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optimization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1803.02875">
    <title>[1803.02875] Machine Learning Inverse Problem for Topological Photonics</title>
    <dc:date>2020-01-12T14:20:41+00:00</dc:date>
    <link>https://arxiv.org/abs/1803.02875</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Topological concepts open many new horizons for photonic devices, from integrated optics to lasers. The complexity of large scale topological devices asks for an effective solution of the inverse problem: how best to engineer the topology for a specific application? We introduce a novel machine learning approach to the topological inverse problem. We train a neural network system with the band structure of the Aubry-Andre-Harper model and then adopt the network for solving the inverse problem. Our application is able to identify the parameters of a complex topological insulator in order to obtain protected edge states at target frequencies. One challenging aspect is handling the multivalued branches of the direct problem and discarding unphysical solutions. We overcome this problem by adopting a self-consistent method to only select physically relevant solutions. We demonstrate our technique in a realistic topological laser design and by resorting to the widely available open-source TensorFlow library. Our results are general and scalable to thousands of topological components. This new inverse design technique based on machine learning potentially extends the applications of topological photonics, for example, to frequency combs, quantum sources, neuromorphic computing and metrology.
]]></description>
<dc:subject>quantum physics simulation inverse-problems neural-networks deep-learning rather-interesting to-understand</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:a31311ce3822/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:quantum"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:physics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:inverse-problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1806.03333">
    <title>[1806.03333] The rainbow-spectrum of RNA secondary structures</title>
    <dc:date>2020-01-10T21:01:53+00:00</dc:date>
    <link>https://arxiv.org/abs/1806.03333</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In this paper we analyze the length-spectrum of rainbows in RNA secondary structures. A rainbow in a secondary structure is a maximal arc with respect to the partial order induced by nesting. We show that there is a significant gap in this length-spectrum. We shall prove that there asymptotically almost surely exists a unique longest rainbow of length at least n−O(n1/2) and that with high probability any other rainbow has finite length. We show that the distribution of the length of the longest rainbow converges to a discrete limit law and that, for finite k, the distribution of rainbows of length k, becomes for large n a negative binomial distribution. We then put the results of this paper into context, comparing the analytical results with those observed in RNA minimum free energy structures, biological RNA structures and relate our findings to the sparsification of folding algorithms.
]]></description>
<dc:subject>structural-biology RNA-folding hey-I-know-this-guy molecular-design simulation rather-interesting feature-construction to-write-about to-simulate consider:extreme-cases consider:feature-discovery</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:a438e8d14c51/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:structural-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:RNA-folding"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:hey-I-know-this-guy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:molecular-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:feature-construction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:extreme-cases"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:feature-discovery"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1410.8001">
    <title>[1410.8001] The hipster effect: When anticonformists all look the same</title>
    <dc:date>2020-01-10T20:55:37+00:00</dc:date>
    <link>https://arxiv.org/abs/1410.8001</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In such different domains as neurosciences, spin glasses, social science, economics and finance, large ensemble of interacting individuals following (mainstream) or opposing (hipsters) to the majority are ubiquitous. In these systems, interactions generally occur after specific delays associated to transport, transmission or integration of information. We investigate here the impact of anti-conformism combined to delays in the emergent dynamics of large populations of mainstreams and hipsters. To this purpose, we introduce a class of simple statistical systems of interacting agents composed of (i) mainstreams and anti-conformists in the presence of (ii) delays, possibly heterogeneous, in the transmission of information. In this simple model, each agent can be in one of two states, and can change state in continuous time with a rate depending on the state of others in the past. We express the thermodynamic limit of these systems as the number of agents diverge, and investigate the solutions of the limit equation, with a particular focus on synchronized oscillations induced by delayed interactions. We show that when hipsters are too slow in detecting the trends, they will consistently make the same choice, and realizing this too late, they will switch, all together to another state where they remain alike. Similar synchronizations arise when the impact of mainstreams on hipsters choices (and reciprocally) dominate the impact of other hipsters choices, and we show that these may emerge only when the randomness in the hipsters decisions is sufficiently large. Beyond the choice of the best suit to wear this winter, this study may have important implications in understanding synchronization of nerve cells, investment strategies in finance, or emergent dynamics in social science, domains in which delays of communication and the geometry of information accessibility are prominent.
]]></description>
<dc:subject>complexology agent-based collective-behavior evolutionary-economics simulation to-write-about to-simulate coupled-oscillators</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:83f6fd17d7a3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:complexology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:agent-based"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:collective-behavior"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:evolutionary-economics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:coupled-oscillators"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1804.01804">
    <title>[1804.01804] A jigsaw puzzle metamaterial concept</title>
    <dc:date>2020-01-10T20:18:32+00:00</dc:date>
    <link>https://arxiv.org/abs/1804.01804</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[A concept of a planar modular mechanical metamaterial inspired by the nature's principle of local adaptivity is proposed. The metamaterial consists of identical pieces similar to jigsaw puzzle tiles. Their rotation within assembly provides a substantial flexibility in terms of structural behavior and mechanical interlocks enable reassembly. The tile design with a diagonal elliptical opening allows us to vary elastic properties--from stiff to compliant, with positive, zero, or negative Poisson's ratio. The outcomes of experimental testing on additively manufactured specimens confirm that the assembly properties can be accurately designed using optimization approaches with finite element analysis at heart.
]]></description>
<dc:subject>metamaterials engineering-design rather-interesting biological-engineering simulation looking-to-see to-write-about to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:5aa957309126/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metamaterials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biological-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.biorxiv.org/content/10.1101/376632v1?rss=1">
    <title>Commonly-used FRET fluorophores promote collapse of an otherwise disordered protein | bioRxiv</title>
    <dc:date>2020-01-01T13:34:02+00:00</dc:date>
    <link>https://www.biorxiv.org/content/10.1101/376632v1?rss=1</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Significance Statement Proteins can adopt a disordered ensemble, either prior to folding or as a part of their function. Simulations and fluorescence resonance energy transfer (FRET) studies often describe these disordered conformations as more compact than the fully random-coil state, whereas small-angle X-ray scattering studies (SAXS) indicate an expanded ensemble closely approximating the dimensions expected for the random coil. Resolving this discrepancy will enable more accurate predictions of protein folding and function. Here we reconcile these views by showing that the addition of common FRET fluorophores reduces the apparent dimensions of a disordered protein. Detailed analysis of both techniques, along with accounting for a moderate amount of fluorophore-induced contraction, demonstrates that disordered and unfolded proteins often remain well solvated and largely expanded in the absence of denaturant, properties that presumably minimize misfolding and aggregation.

]]></description>
<dc:subject>molecular-dynamics molecular-design rather-interesting biophysics solvation-dynamics simulation consider:combinatorial-chemistry</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:b1c118d44164/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:molecular-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:molecular-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:biophysics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:solvation-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:combinatorial-chemistry"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1907.08103">
    <title>[1907.08103] Patchy particles by self-assembly of star copolymers on a spherical substrate: Thomson solutions in a geometric problem with a color constraint</title>
    <dc:date>2019-12-29T10:08:11+00:00</dc:date>
    <link>https://arxiv.org/abs/1907.08103</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Confinement or geometric frustration is known to alter the structure of soft matter, including copolymeric melts, and can consequently be used to tune structure and properties. Here we investigate the self-assembly of ABC and ABB 3-miktoarm star copolymers confined to a shell using coarse-grained Dissipative Particle Dynamics simulations. In bulk and flat geometries the ABC stars form hexagonal tilings, but this is topologically prohibited in a spherical geometry which normally is alleviated by forming pentagonal tiles. However, the molecular architecture of the ABC stars implies an additional 'color constraint' which only allows even tilings (where all polygons have an even number of edges) and we study the effect of these simultaneous constraints. We find that both ABC and ABB systems form spherical tiling patterns, the type of which depends on the radius of the spherical substrate. For small spherical substrates, all solutions correspond to patterns solving the Thomson problem of placing mobile repulsive electric charges on a sphere. In ABC systems we find three coexisting, possibly different tilings, one in each color, each of them solving the Thomson problem simultaneously. For all except the smallest substrates, we find competing solutions with seemingly degenerate free energies that occur with different probabilities. Statistically, an observer who is blind to the differences between B and C can tell from the structure of the A domains if the system is an ABC or an ABB star copolymer system.
]]></description>
<dc:subject>self-assembly nanohistory rather-interesting emergent-design simulation supramolecular-complexes looking-to-see</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d6e6f0fd7421/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:self-assembly"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nanohistory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:emergent-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:supramolecular-complexes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1802.00296">
    <title>[1802.00296] $S$-Leaping: An adaptive, accelerated stochastic simulation algorithm, bridging $τ$-leaping and $R$-leaping</title>
    <dc:date>2019-11-03T11:48:18+00:00</dc:date>
    <link>https://arxiv.org/abs/1802.00296</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We propose the S-leaping algorithm for the acceleration of Gillespie's stochastic simulation algorithm that combines the advantages of the two main accelerated methods; the τ-leaping and R-leaping algorithms. These algorithms are known to be efficient under different conditions; the τ-leaping is efficient for non-stiff systems or systems with partial equilibrium, while the R-leaping performs better in stiff system thanks to an efficient sampling procedure. However, even a small change in a system's set up can critically affect the nature of the simulated system and thus reduce the efficiency of an accelerated algorithm. The proposed algorithm combines the efficient time step selection from the τ-leaping with the effective sampling procedure from the R-leaping algorithm. The S-leaping is shown to maintain its efficiency under different conditions and in the case of large and stiff systems or systems with fast dynamics, the S-leaping outperforms both methods. We demonstrate the performance and the accuracy of the S-leaping in comparison with the τ-leaping and R-leaping on a number of benchmark systems involving biological reaction networks.
]]></description>
<dc:subject>simulation numerical-methods Markov-models Monte-Carlo-models probability-theory algorithms horse-races rather-interesting to-write-about performance-measure approximation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c4efe05241f4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:numerical-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Markov-models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Monte-Carlo-models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:probability-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:horse-races"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:approximation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1909.00196">
    <title>[1909.00196] Peculiarities of kinetics in the presence of Lévy noises</title>
    <dc:date>2019-10-26T13:04:06+00:00</dc:date>
    <link>https://arxiv.org/abs/1909.00196</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Stochastic evolution of various reaction networks is commonly described in terms of noise assisted escape of an overdamped particle from a potential well, as devised by the paradigmatic Langevin equation. When implemented for systems close to equilibrium, the approach correctly explains emergence of Boltzmann distribution for the ensemble of trajectories generated by Langevin equation and relates intensity of the noise strength to the mobility. 
This scenario can be further generalized to include effects of non-thermal, external burst-like forcing modeled by Lévy noise. In the paper forward and reverse kinetics of Langevin equations with Lévy noise are analyzed for simple model of potential wells pointing to the most probable escape which is executed via a single long jump. 
Heavy tails of Lévy noise distributions not only facilitate escape kinetics, but more importantly, change the escape protocol by altering final stationary state to a non-Boltzmann, non-equilibrium form. As a result, contrary to the kinetics induced by a Gaussian white noise, escape rates in environments with Lévy noise are determined not by the barrier height, but instead, by the barrier width. 
We discuss consequences of simultaneous action of thermal and Lévy noises on statistics of passage times and population of reactants in double-well potentials.
]]></description>
<dc:subject>reaction-networks nonlinear-dynamics rather-interesting thermodynamics simulation to-write-about to-simulate probability-theory heavy-tailed-distributions</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:ffc77affc313/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:reaction-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:thermodynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:probability-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:heavy-tailed-distributions"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1809.02331">
    <title>[1809.02331] A unified formal framework for developmental andevolutionary change in gene regulatory network models</title>
    <dc:date>2019-10-26T12:36:43+00:00</dc:date>
    <link>https://arxiv.org/abs/1809.02331</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The two most fundamental processes describing change in biology, development and evolu-tion, occur over drastically different timescales, difficult to reconcile within a unified framework. Development involves temporal sequences of cell states controlled by hierarchies of regulatory structures. It occurs over the lifetime of a single individual, and is associated to the gene expression level change of a given genotype. Evolution, by contrast entails genotypic change through the acquisition/loss of genes and changes in the network topology of interactions among genes. It involves the emergence of new, environmentally selected phenotypes over the lifetimes of many individuals. Here we present a model of regulatory network evolution that accounts for both timescales. We extend the framework of Boolean models of gene regulatory networks (GRN)-currently only applicable to describing development to include evolutionary processes. As opposed to one-to-one maps to specific attractors, we identify the phenotypes of the cells as the relevant macrostates of the GRN. A phenotype may now correspond to multiple attractors, and its formal definition no longer requires a fixed size for the genotype. This opens the possibility for a quantitative study of the phenotypic change of a genotype, which is itself changing over evolutionary timescales. We show how the realization of specific phenotypes can be controlled by gene duplication events (used here as an archetypal evolutionary event able to change the genotype), and how successive events of gene duplication lead to new regulatory structures via selection. At the same time, we show that our generalized framework does not inhibit network controllability and the possibility for network control theory to describe epigenetic signaling during development.
]]></description>
<dc:subject>theoretical-biology boolean-networks reaction-networks simulation to-understand layer-cake-modeling to-simulate evo-devo</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:1d186466317b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:theoretical-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:boolean-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:reaction-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:layer-cake-modeling"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:evo-devo"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1909.12501">
    <title>[1909.12501] Dynamics in a time-discrete food-chain model with strong pressure on preys</title>
    <dc:date>2019-10-11T12:57:22+00:00</dc:date>
    <link>https://arxiv.org/abs/1909.12501</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Ecological systems are complex dynamical systems. Modelling efforts on ecosystems' dynamical stability have revealed that population dynamics, being highly nonlinear, can be governed by complex fluctuations. Indeed, experimental and field research has provided mounting evidence of chaos in species' abundances, especially for discrete-time systems. Discrete-time dynamics, mainly arising in boreal and temperate ecosystems for species with non-overlapping generations, have been largely studied to understand the dynamical outcomes due to changes in relevant ecological parameters. The local and global dynamical behaviour of many of these models is difficult to investigate analytically in the parameter space and, typically, numerical approaches are employed when the dimension of the phase space is large. In this article we provide topological and dynamical results for a map modelling a discrete-time, three-species food chain with two predator species interacting on the same prey population. The domain where dynamics live is characterized, as well as the so-called escaping regions, for which the species go rapidly to extinction after surpassing the carrying capacity. We also provide a full description of the local stability of equilibria within a volume of the parameter space given by the prey's growth rate and the predation rates. We have found that the increase of the pressure of predators on the prey results in chaos. The entry into chaos is achieved via a supercritical Neimarck-Sacker bifurcation followed by period-doubling bifurcations of invariant curves. Interestingly, an increasing predation directly on preys can shift the extinction of top predators to their survival, allowing an unstable persistence of the three species by means of periodic and strange chaotic attractors.
]]></description>
<dc:subject>food-webs rather-interesting theoretical-biology dynamical-systems collective-behavior nonlinear-dynamics looking-to-see simulation to-write-about to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e0e2adccb467/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:food-webs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:theoretical-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:dynamical-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:collective-behavior"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1904.08684">
    <title>[1904.08684] Towards whole program generation of quadrature-free discontinuous Galerkin methods for the shallow water equations</title>
    <dc:date>2019-09-23T10:13:22+00:00</dc:date>
    <link>https://arxiv.org/abs/1904.08684</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The shallow water equations (SWE) are a commonly used model to study tsunamis, tides, and coastal ocean circulation. However, there exist various approaches to discretize and solve them efficiently. Which of them is best for a certain scenario is often not known and, in addition, depends heavily on the used HPC platform. From a simulation software perspective, this places a premium on the ability to adapt easily to different numerical methods and hardware architectures. One solution to this problem is to apply code generation techniques and to express methods and specific hardware-dependent implementations on different levels of abstraction. This allows for a separation of concerns and makes it possible, e.g., to exchange the discretization scheme without having to rewrite all low-level optimized routines manually. In this paper, we show how code for an advanced quadrature-free discontinuous Galerkin (DG) discretized shallow water equation solver can be generated. Here, we follow the multi-layered approach from the ExaStencils project that starts from the continuous problem formulation, moves to the discrete scheme, spells out the numerical algorithms, and, finally, maps to a representation that can be transformed to a distributed memory parallel implementation by our in-house Scala-based source-to-source compiler. Our contributions include: A new quadrature-free discontinuous Galerkin formulation, an extension of the class of supported computational grids, and an extension of our toolchain allowing to evaluate discrete integrals stemming from the DG discretization implemented in Python. As first results we present the whole toolchain and also demonstrate the convergence of our method for higher order DG discretizations.
]]></description>
<dc:subject>numerical-methods approximation modeling-is-not-mathematics rather-interesting simulation consider:symbolic-regression generated-code to-understand to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:655f0a3f7a85/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:numerical-methods"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:modeling-is-not-mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:symbolic-regression"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:generated-code"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-understand"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://queue.acm.org/detail.cfm?id=3212479">
    <title>C Is Not a Low-level Language - ACM Queue</title>
    <dc:date>2019-09-21T22:45:52+00:00</dc:date>
    <link>https://queue.acm.org/detail.cfm?id=3212479</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In the wake of the recent Meltdown and Spectre vulnerabilities, it's worth spending some time looking at root causes. Both of these vulnerabilities involved processors speculatively executing instructions past some kind of access check and allowing the attacker to observe the results via a side channel. The features that led to these vulnerabilities, along with several others, were added to let C programmers continue to believe they were programming in a low-level language, when this hasn't been the case for decades.

Processor vendors are not alone in this. Those of us working on C/C++ compilers have also participated.

]]></description>
<dc:subject>programming-language philosophy-of-engineering rather-good define-your-terms security simulation hardware the-cultural-construction-of-abstractions</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:5b1176980b3a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:programming-language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-good"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:define-your-terms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:security"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:hardware"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:the-cultural-construction-of-abstractions"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1810.01999">
    <title>[1810.01999] Jamming by growth</title>
    <dc:date>2019-09-08T19:39:44+00:00</dc:date>
    <link>https://arxiv.org/abs/1810.01999</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Growth in confined spaces can drive cellular populations through a jamming transition from a fluid-like state to a solid-like state. Experiments have found that jammed budding yeast populations can build up extreme compressive pressures (over 1MPa), which in turn feed back onto cellular physiology by slowing or even stalling cell growth. Using extensive numerical simulations, we investigate how this feedback impacts the mechanical properties of model jammed cellular populations. We find that feedback directs growth toward poorly-coordinated regions, resulting in an excess number of cell-cell contacts that rigidify cell packings. Cell packings posses anomalously large shear and bulk moduli that depend sensitively on the strength of feedback. These results demonstrate that mechanical feedback on the single-cell level is a simple mechanism by which living systems can tune their population-level mechanical properties.
]]></description>
<dc:subject>rather-interesting granular-materials artificial-life simulation to-simulate resource-limitation theoretical-biology packing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d3f9f8b14c27/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:granular-materials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:artificial-life"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:resource-limitation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:theoretical-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:packing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://theorangeduck.com/page/subspace-neural-physics-fast-data-driven-interactive-simulation">
    <title>Subspace Neural Physics: Fast Data-Driven Interactive Simulation</title>
    <dc:date>2019-08-07T11:08:22+00:00</dc:date>
    <link>http://theorangeduck.com/page/subspace-neural-physics-fast-data-driven-interactive-simulation</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Abstract: Data-driven methods for physical simulation are an attractive option for interactive applications due to their ability to trade precomputation and memory footprint in exchange for improved runtime performance. Yet, existing data-driven methods fall short of the extreme memory and performance constraints imposed by modern interactive applications like AAA games and virtual reality. Here, performance budgets for physics simulation range from tens to hundreds of micro-seconds per frame, per object. We present a data-driven physical simulation method that meets these constraints. Our method combines subspace simulation techniques with machine learning which, when coupled, enables a very efficient subspace-only physics simulation that supports interactions with external objects – a longstanding challenge for existing subspace techniques. We also present an interpretation of our method as a special case of subspace Verlet integration, where we apply machine learning to efficiently approximate the physical forces of the system directly in the subspace. We propose several practical solutions required to make effective use of such a model, including a novel training methodology required for prediction stability, and a GPU-friendly subspace decompression algorithm to accelerate rendering.

]]></description>
<dc:subject>simulation deep-learning rather-interesting via:twitter to-write-about to-do consider:eureqa consider:eureqa-hype</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:7525a6f3a3e3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:via:twitter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-do"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:eureqa"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:eureqa-hype"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>