From clusters of particles to 2D bubble clusters

Slides:



Advertisements
Similar presentations
Bioinspired Computing Lecture 16
Advertisements

Finding what happens in a space of ever so many dimensions R. Stephen Berry The University of Chicago Brijuni, 28 August – 1 September 2006.
1 Closed-Form MSE Performance of the Distributed LMS Algorithm Gonzalo Mateos, Ioannis Schizas and Georgios B. Giannakis ECE Department, University of.
Transfer FAS UAS SAINT-PETERSBURG STATE UNIVERSITY COMPUTATIONAL PHYSICS Introduction Physical basis Molecular dynamics Temperature and thermostat Numerical.
Movement-Assisted Sensor Deployment Author : Guiling Wang, Guohong Cao, Tom La Porta Presenter : Young-Hwan Kim.
Potential Energy Surface. The Potential Energy Surface Captures the idea that each structure— that is, geometry—has associated with it a unique energy.
Optimization methods Review
The Wales Group in Context: Exploring Energy Landscapes Research Review by Ryan Babbush Applied Computation 298r February 8, 2013.
Stochastic Parameter Optimization for Empirical Molecular Potentials function optimization simulated annealing tight binding parameters.
Geometry 5 Level 1. Interior angles in a triangle.
Force directed graph drawing Thomas van Dijk. The problem Given a set of vertices and edges, compute positions for the vertices. If the edges don’t have.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Aspects of Conditional Simulation and estimation of hydraulic conductivity in coastal aquifers" Luit Jan Slooten.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Molecular Simulation. Molecular Simluation Introduction: Introduction: Prerequisition: Prerequisition: A powerful computer, fast graphics card, A powerful.
Performance Optimization
Design Optimization School of Engineering University of Bradford 1 Numerical optimization techniques Unconstrained multi-parameter optimization techniques.
Finding the Tools--and the Questions--to Understand Dynamics in Many Dimensions R. Stephen Berry The University of Chicago TELLURIDE, APRIL 2007.
13 Basics of Genetic Algorithms and some possibilities Peter Spijker Technische Universiteit Eindhoven Department of Biomedical Engineering Division of.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Numerical Meshes from Seismic Images Karl Apaza Agüero Paulo Roma Cavalcanti Antonio Oliveira Claudio Esperança COPPE – Sistemas - UFRJ.
Continuous Time Monte Carlo and Driven Vortices in a Periodic Potential V. Gotcheva, Yanting Wang, Albert Wang and S. Teitel University of Rochester Lattice.
D Nagesh Kumar, IIScOptimization Methods: M2L3 1 Optimization using Calculus Optimization of Functions of Multiple Variables: Unconstrained Optimization.
Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular Motion Mehmet Serkan Apaydin, Douglas L. Brutlag, Carlos.
Molecular Modeling: Geometry Optimization C372 Introduction to Cheminformatics II Kelsey Forsythe.
Molecular Modeling: Geometry Optimization C372 Introduction to Cheminformatics II Kelsey Forsythe.
Objectives of this course
Geometry Optimisation Modelling OH + C 2 H 4 *CH 2 -CH 2 -OH CH 3 -CH 2 -O* 3D PES.
JM - 1 Introduction to Bioinformatics: Lecture XVI Global Optimization and Monte Carlo Jarek Meller Jarek Meller Division of Biomedical.
06 - Boundary Models Overview Edge Tracking Active Contours Conclusion.
Deformable Models Segmentation methods until now (no knowledge of shape: Thresholding Edge based Region based Deformable models Knowledge of the shape.
Non Negative Matrix Factorization
MonteCarlo Optimization (Simulated Annealing) Mathematical Biology Lecture 6 James A. Glazier.
7.1. Mean Shift Segmentation Idea of mean shift:
Introduction to Artificial Neural Network Models Angshuman Saha Image Source: ww.physiol.ucl.ac.uk/fedwards/ ca1%20neuron.jpg.
Outline Potential Energy Surface (PES)
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
In your study of geometry so far, you have focused your attention on two-dimensional shapes. You have investigated the special properties of triangles,
Geometry Review AREA 1. Find the measure of each interior angle of the regular polygon shown below. 2.
Molecular Mechanics Part 2
3-D Space Figures and Nets
Molecular Modelling - Lecture 2 Techniques for Conformational Sampling Uses CHARMM force field Written in C++
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
July 11, 2006Bayesian Inference and Maximum Entropy Probing the covariance matrix Kenneth M. Hanson T-16, Nuclear Physics; Theoretical Division Los.
Lecture 13. Geometry Optimization References Computational chemistry: Introduction to the theory and applications of molecular and quantum mechanics, E.
CHAPTER 10 Widrow-Hoff Learning Ming-Feng Yeh.
Motion Estimation using Markov Random Fields Hrvoje Bogunović Image Processing Group Faculty of Electrical Engineering and Computing University of Zagreb.
Image Source: ww.physiol.ucl.ac.uk/fedwards/ ca1%20neuron.jpg
Review Session BS123A/MB223 UC-Irvine Ray Luo, MBB, BS.
Steepest Descent Method Contours are shown below.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
Lecture 18, CS5671 Multidimensional space “The Last Frontier” Optimization Expectation Exhaustive search Random sampling “Probabilistic random” sampling.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Computational Biology BS123A/MB223 UC-Irvine Ray Luo, MBB, BS.
CSC2535: Computation in Neural Networks Lecture 8: Hopfield nets Geoffrey Hinton.
Geometry Optimizations Lecture CompChem 2 Chemistry 347 Hope College.
Robot Motion Planning Robotics meet Computer Science.
J. Kubalík, Gerstner Laboratory for Intelligent Decision Making and Control Artificial Neural Networks II - Outline Cascade Nets and Cascade-Correlation.
The Nudged Elastic Band Method and its Implementation in VASP
Weihua Gao Ganapathi Kamath Kalyan Veeramachaneni Lisa Osadciw
Widrow-Hoff Learning (LMS Algorithm).
Maria Okuniewski Nuclear Engineering Dept.
Optimization Part II G.Anuradha.
Introduction to Neural Networks
Modelling Language Evolution Lecture 3: Evolving Syntax
Constrained Molecular Dynamics as a Search and Optimization Tool
Boltzmann Machine (BM) (§6.4)
Mobile-Assisted Localization in Sensor Network
Colloidal matter: Packing, geometry, and entropy
Classic Motion Planning Methods
Presentation transcript:

From clusters of particles to 2D bubble clusters Edwin Flikkema, Simon Cox IMAPS, Aberystwyth University, UK

Introduction and overview The minimal perimeter problem for 2D equal area bubble clusters. Systems of interacting particles Global optimisation 2D particle clusters to 2D bubble clusters Voronoi construction 2D particle systems: -log(r) or 1/rp repulsive potential Harmonic or polygonal confining potentials Results

2D bubble clusters Minimal perimeter problem: 2D cluster of N bubbles. All bubbles have equal area. Free or confined to the interior of a circle or polygon. Minimize total perimeter (internal + external). Objective: apply techniques used in interacting particle clusters to this minimal perimeter problem.

Systems of interacting particles System energy: Usually: Example: Lennard-Jones potential: LJ13: Ar13 Used in: Molecular Dynamics, Monte Carlo, Energy landscapes

Energy landscapes Energy vs coordinate Stationary points of U: zero net force on each particle Minima of U correspond to (meta-)stable states. Global minimum is the most stable state. Local optimisation (finding a nearby minimum) relatively easy: Steepest descent, L-BFGS, Powell, etc. Global optimisation: hard. Energy vs coordinate Local optimisation

Global optimisation methods Inspired by simulated annealing: Basin hopping Minima hopping Evolutionary algorithms: Genetic algorithm Other: Covariance matrix adaption Simply starting from many random geometries

2D particle systems Energy: Repulsive inter-particle potential: Confining potential: or harmonic polygonal

2D particle clusters Pictures of particle clusters: e.g. N=41, bottom 3 in energy -945.419508 -945.421319 -945.419781

Particles to bubbles Qhull Surface Evolver particle cluster Voronoi cells optimized perimeter

2D particle clusters Polygonal confining potential: e.g. triangular unit vectors contour lines discontinuous gradient: smoothing needed?

Technical details List of unique 2D geometries produced Problem: permutational isomers. Distinguishing by energy U not sufficient: Spectrum of inter-particle distances compared. Gradient-based local optimisers have difficulty with polygonal potential due to discontinuous gradient Smoothing needed? Use gradient-less optimisers (e.g. Powell)?

Results: bubble clusters: Free, circle, hexagon

Results: bubble clusters: pentagon, square, triangle Elec. J. Combinatorics 17:R45 (2010)

Conclusions Optimal geometries of clusters of interacting particles can be used as candidates for the minimal perimeter problem. Various potentials have been tried. 1/r seems to work slightly better than –log(r). Using multiple potentials is recommended. Polygonal potentials have been introduced to represent confinement to a polygon

Acknowledgements Simon Cox Adil Mughal

Energy landscapes Energy vs coordinate Stationary points of U: zero net force on each particle Minima of U correspond to (meta-)stable states. Global minimum is the most stable state. Saddle points (first order): transition states Network of minima connected by transition states Local optimisation (finding a nearby minimum) relatively easy: L-BFGS, Powell, etc. Global optimisation: hard. Local optimisation Energy vs coordinate

2D clusters: perimeter is fit to data for free clusters