Search

We propose and investigate an extension of the Caspar-Klug symmetry principles for viral capsid assembly to the programmable assembly of size-controlled triply-periodic polyhedra, discrete variants of the Primitive, Diamond, and Gyroid cubic minimal surfaces. Inspired by a recent class of programmable DNA origami colloids, we demonstrate that the economy of design in these crystalline assemblies -- in terms of the growth of the number of distinct particle species required with the increased size-scale (e.g. periodicity) -- is comparable to viral shells. We further test the role of geometric specificity in these assemblies via dynamical assembly simulations, which show that conditions for simultaneously efficient and high-fidelity assembly require an intermediate degree of flexibility of local angles and lengths in programmed assembly. Off-target misassembly occurs via incorporation of a variant of disclination defects, generalized to the case of hyperbolic crystals. The possibility of these topological defects is a direct consequence of the very same symmetry principles that underlie the economical design, exposing a basic tradeoff between design economy and fidelity of programmable, size controlled assembly., Comment: 15 pages, 5 figures, 6 supporting movies (linked), Supporting Appendix

Epithelial morphogenesis, a signature problem of tissue biology and tissue mechanics, continues to inspire biologists and physicists alike. Many treatments focus on tissue fluidization, apical/basal ratio changes, or mechanical instabilities. In contrast to these approaches, shape-programmable materials, where the local lengths in the material change in a prescribed way, offer an appealing analogy. In this analogy, certain in-plane collective cell behaviors could also actively alter the local lengths in a tissue and therefore provide the ingredients necessary for shape programming. In this Letter we demonstrate that this is indeed the case for directed, active T1 rearrangements of cells. We determine the required shape programming parameters associated to tissue patches with both fixed numbers of rearrangements and patches at steady state between directed T1 events and counterbalancing randomly oriented ones using a simple free-boundary vertex model approach. Along the way we uncover a surprising connection between tissues with active T1 events and the central limit theorem, and through it, the physics of entropic springs., Comment: 5 pages, 4 figures

This article presents an approach to the two-dimensional Schr\"odinger equation based on automatic learning methods with neural networks. It is intended to determine the ground state of a particle confined in any two-dimensional potential, starting from the knowledge of the solutions to a large number of arbitrary sample problems. A network architecture with two hidden layers is proposed to predict the wave function and energy of the ground state. Several accuracy indicators are proposed for validating the estimates provided by the neural network. The testing of the trained network is done by applying it to a large set of confinement potentials different from those used in the learning process. Some particular cases with symmetrical potentials are solved as concrete examples, and a good network prediction accuracy is found., Comment: 29 pages, 13 figures, 2 tables

In this work we approach the Schr\"odinger equation in quantum wells with arbitrary potentials, using the machine learning technique. Two neural networks with different architectures are proposed and trained using a set of potentials, energies, and wave functions previously generated with the classical finite element method. Three accuracy indicators have been proposed for testing the estimates given by the neural networks. The networks are trained by the gradient descent method and the training validation is done with respect to a large training data set. The two networks are then tested for two different potential data sets and the results are compared. Several cases with analytical potential have also been solved., Comment: 20 pages

The vast majority of mesh-based modelling applications iteratively transform the mesh vertices under prescribed geometric conditions. This occurs in particular in methods cycling through the constraint set such as Position-Based Dynamics (PBD). A common case is the approximate local area preservation of triangular 2D meshes under external editing constraints. At the constraint level, this yields the nonconvex optimal triangle projection under prescribed area problem, for which there does not currently exist a direct solution method. In current PBD implementations, the area preservation constraint is linearised. The solution comes out through the iterations, without a guarantee of optimality, and the process may fail for degenerate inputs where the vertices are colinear or colocated. We propose a closed-form solution method and its numerically robust algebraic implementation. Our method handles degenerate inputs through a two-case analysis of the problem's generic ambiguities. We show in a series of experiments in area-based 2D mesh editing that using optimal projection in place of area constraint linearisation in PBD speeds up and stabilises convergence.

We study how symmetry can enrich strong-randomness quantum critical points and phases, and lead to robust topological edge modes coexisting with critical bulk fluctuations. These are the disordered analogues of gapless topological phases. Using real-space and density matrix renormalization group approaches, we analyze the boundary and bulk critical behavior of such symmetry-enriched random quantum spin chains. We uncover a new class of symmetry-enriched infinite randomness fixed points: while local bulk properties are indistinguishable from conventional random singlet phases, nonlocal observables and boundary critical behavior are controlled by a different renormalization group fixed point. We also illustrate how such new quantum critical points emerge naturally in Floquet systems., Comment: 4+epsilon pages+supp mat, 2 figures. v2: New discussion of Floquet systems. A new co-author has been added

Micro-expressions are brief and subtle facial expressions that go on and off the face in a fraction of a second. This kind of facial expressions usually occurs in high stake situations and is considered to reflect a human's real intent. There has been some interest in micro-expression analysis, however, a great majority of the methods are based on classically established computer vision methods such as local binary patterns, histogram of gradients and optical flow. A novel methodology for micro-expression recognition using the Riesz pyramid, a multi-scale steerable Hilbert transform is presented. In fact, an image sequence is transformed with this tool, then the image phase variations are extracted and filtered as proxies for motion. Furthermore, the dominant orientation constancy from the Riesz transform is exploited to average the micro-expression sequence into an image pair. Based on that, the Mean Oriented Riesz Feature description is introduced. Finally the performance of our methods are tested in two spontaneous micro-expressions databases and compared to state-of-the-art methods.