Accurate 3D Modeling of User Inputted Molecules Using a Nelder Mead Algorithm Ben Parr Period 6.

Slides:



Advertisements
Similar presentations
Hamilton Venus Software User Interface Options
Advertisements

Introduction to Multimedia 1611ICT – Topic 4 Sound, Animation & Video Review The element of sound Role of sound The Animation element Role of animation.
Water Rights Accounting. New Accounting Model New Technology: 1979 versus 2011 – Faster processors – Faster graphics – Larger, faster, memory – Larger,
A Randomized Polynomial- Time Simplex Algorithm for Linear Programming CS3150 Course Presentation.
 Over-all: Very good idea to use more than one source. Good motivation (use of graphics). Good use of simplified, loosely defined -- but intuitive --
Lecture 3 Linear Programming: Tutorial Simplex Method
Mathematical Optimization in Stata: LP and MILP
The Basics Balancing Equations. The Reaction Burning METHANE or any hydrocarbon gives WATER and CARBON DIOXIDE Burning METHANE or any hydrocarbon gives.
Introduction to Algorithms
D Nagesh Kumar, IIScOptimization Methods: M4L1 1 Linear Programming Applications Software for Linear Programming.
C&O 355 Mathematical Programming Fall 2010 Lecture 20 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A.
CSE 380 – Computer Game Programming Pathfinding AI
Let’s Get GUI! Understanding the Windows ® Graphical User Interface © 2006 by Ted Altenberg
How should we define corner points? Under any reasonable definition, point x should be considered a corner point x What is a corner point?
4/5/05Tucker, Sec Applied Combinatorics, 4rth Ed. Alan Tucker Section 4.3 Graph Models Prepared by Jo Ellis-Monaghan.
Geometry Optimization Pertemuan VI. Geometry Optimization Backgrounds Real molecules vibrate thermally about their equilibrium structures. Finding minimum.
BY CHRIS ANDERSON Creating a MIDI Generator Program.
Multimedia Data Introduction to Image Data Dr Mike Spann Electronic, Electrical and Computer Engineering.
Subdue Graph Visualizer by Gayathri Sampath, M.S. (CSE) University of Texas at Arlington.
 Linear Programming and Smoothed Complexity Richard Kelley.
How to optimize automatically the parameters that determine the quality of the basis Javier Junquera Alberto García.
Computer Programming.  Analysis  User requirements  Feasibility and costs  Success criteria  Design and Planning  Classes  Data structures and.
Optimization of Linear Problems: Linear Programming (LP) © 2011 Daniel Kirschen and University of Washington 1.
LP formulation of Economic Dispatch
Accurate 3D Modeling of User Inputted Molecules Computer Systems Lab: Ben Parr Period 6.
How do people communicate with computers?
Geometry Optimisation Modelling OH + C 2 H 4 *CH 2 -CH 2 -OH CH 3 -CH 2 -O* 3D PES.
Lecture 12-2: Introduction to Computer Algorithms beyond Search & Sort.
Chemistry of Living Things Organic Compounds. Types of Compounds Easy definition: – Organic – compounds that contain carbon and have a biological origin.
Final Year Project Interim Presentation Software Visualisation and Comparison Tool Presented By : Shane Lillis, , 4th Year Computer Engineering.
Systems Development Lifecycle Testing and Documentation.
Duality Theory  Every LP problem (called the ‘Primal’) has associated with another problem called the ‘Dual’.  The ‘Dual’ problem is an LP defined directly.
EZYFLO. Aim of EZYFLO To draw simple flowcharts To reduce the memory size of the flowchart To create a software which runs in DOS environment also.
Linear Programming – Simplex Method
ABINIT INPUT MAKER By Simon Pesant and BenjaminTardif 29/01/2007.
1 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.
OR Chapter 2. Simplex method (2,0) (2,2/3) (1,2)(0,2)
3.4: Linear Programming Objectives: Students will be able to… Use linear inequalities to optimize the value of some quantity To solve linear programming.
Intermediate 2 Computing Unit 2 - Software Development.
Linear Programming and Applications
By Danny Nguyen and Jimmy Nguyen.  Graph solids in space.  Use the Distance and Midpoint Formulas for points in space.
Bin Yao, Feifei Li, Piyush Kumar Presenter: Lian Liu.
Linear Programming: Formulations, Geometry and Simplex Method Yi Zhang January 21 th, 2010.
Accurate 3D Modeling of User Inputted Molecules Using a Hill- Climbing Algorithm Ben Parr Period 6.
Team Vertex Jimmy Fifield Nick Marino. Graph Coloring What is the minimum number of colors needed to color every vertex so that no neighboring vertexes.
Advanced Higher Computing Science
Optimization of Motorized Mirrors with SciPy Minimization Methods
IL Marking Get out your CPU / Memory answers Swap with someone else
Non-linear Minimization
Linear Programming Reading: CLRS, Ch. 29 or reference
Perturbation method, lexicographic method
Polygonal Curve Simplification
Haim Kaplan and Uri Zwick
What is an operating system?
The Graphics Rendering Pipeline
Molecular Shapes.
Quantifying the Bessel Beam Part 2
Using Functions
Title of Project Joseph Hallahan Computer Systems Lab
Introduction: Why Study Algorithms?
Formulas.
Chemical Quantities For example – let’s say you want to buy some Bazooka Gum You could buy it by the piece from the deli You could buy it by the box from.
Chapter 2. Simplex method
Empirical and Molecular Formulas
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Points Distance Calculator
Molecular Geometry.
Bonding – Introduction May 12
UMass Lowell Computer Science Analysis of Algorithms Prof
Chapter 2. Simplex method
Presentation transcript:

Accurate 3D Modeling of User Inputted Molecules Using a Nelder Mead Algorithm Ben Parr Period 6

Introduction Create program to let users easily and intuitively create simple molecules (i.e. not macromolecules)‏ Water (H2O)‏ Benzene (C6H6)‏ Nicotine (C10H14N2)‏ Have the program position the atoms correctly Easy viewing for a better understanding of the geometry of molecules

Background Understanding the geometry of molecules is extremely helpful Buying molecule modeling sets for every student in an introductory chemistry is too costly Some software similar to my project is also costly No real feasible option for beginner chemistry students

Current State All graphics and user interface implemented Nelder Mead Algorithm programmed

Nelder Mead Algorithm Start with original simplex Has N+1 vertices where N = 3 * (# of atoms in model)‏ Multiply by 3 because each atom has a x, y, z Each vertex has 3*N dimensions (contains the x,y,z of each atom in the model)‏ Used to minimize an energy function “energy” of the model Run through the algorithm until the tolerance (max energy of vertex – min energy of vertex) is less than .000001

One Possible Variation

What's Next Program energy function that takes into account: The distance between atoms (maximize)‏ The distance between bonded atoms Make them a defined distance away from each other (values from a text file)‏ Create a better original simplex Current original simplex is just for testing purposes Too small may lead to local search Too large could take too long