The document discusses the author's work using computational chemistry methods to develop new drugs through structure-based drug design, explores information theoretic properties of confined electronic systems, and proposes a novel 3D quantum mechanics-based structural descriptor called Sr that could be used for molecular similarity comparisons based on approximating the electron density distribution.
Semi-global Leaderless Consensus with Input Saturation Constraints via Adapti...IJRES Journal
In this paper, the problems of semi-global leaderless consensus for continuous-time multi-agent
systems under input saturation restraints are investigated. We consider the leaderless consensus problems
under fixed undirected communication topology. New necessary synthesis conditions are established for
achieving semi-global leaderless consensus via the distributed adaptive protocols, which is designed by utilizing
low gain feedback tactics and the relative state measurements of the neighboring agents. Finally, simulation
results illustrate the theoretic developments.
Dealing with Notations and conventions in tensor analysis-Einstein's summation convention covariant and contravariant and mixed tensors-algebraic operations in tensor symmetric and skew symmetric tensors-tensor calculus-Christoffel symbols-kinematics in Riemann space-Riemann-Christoffel tensor.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Numerical Solutions of Second Order Boundary Value Problems by Galerkin Resid...iosrjce
IOSR Journal of Mathematics(IOSR-JM) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of mathemetics and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in mathematics. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Semi-global Leaderless Consensus with Input Saturation Constraints via Adapti...IJRES Journal
In this paper, the problems of semi-global leaderless consensus for continuous-time multi-agent
systems under input saturation restraints are investigated. We consider the leaderless consensus problems
under fixed undirected communication topology. New necessary synthesis conditions are established for
achieving semi-global leaderless consensus via the distributed adaptive protocols, which is designed by utilizing
low gain feedback tactics and the relative state measurements of the neighboring agents. Finally, simulation
results illustrate the theoretic developments.
Dealing with Notations and conventions in tensor analysis-Einstein's summation convention covariant and contravariant and mixed tensors-algebraic operations in tensor symmetric and skew symmetric tensors-tensor calculus-Christoffel symbols-kinematics in Riemann space-Riemann-Christoffel tensor.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Numerical Solutions of Second Order Boundary Value Problems by Galerkin Resid...iosrjce
IOSR Journal of Mathematics(IOSR-JM) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of mathemetics and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in mathematics. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
It is shown that any singular Lagrangian theory: 1) can be formulated without the use of constraints by introducing a Clairaut-type version of the Hamiltonian formalism; 2) leads to a special kind of nonabelian gauge theory which is similar to the Poisson gauge theory; 3) can be treated as the many-time classical dynamics. A generalization of the Legendre transform to the zero Hessian case is done by using the mixed (envelope/general) solution of the multidimensional Clairaut equation. The equations of motion are written in the Hamilton-like form by introducing new antisymmetric brackets. It is shown that any classical degenerate Lagrangian theory is equivalent to the many-time classical dynamics. Finally, the relation between the presented formalism and the Dirac approach to constrained systems is given.
Slides for Introductory session on K Means Clustering.
simple and good. ppt
Could be used for taking classes for MCA students on Clustering Algorithms for Data mining.
Prepared By K.T.Thomas HOD of Computer Science, Santhigiri College Vazhithala
Fractional pseudo-Newton method and its use in the solution of a nonlinear sy...mathsjournal
The following document presents a possible solution and a brief stability analysis for a nonlinear system,
which is obtained by studying the possibility of building a hybrid solar receiver; It is necessary to mention that
the solution of the aforementioned system is relatively difficult to obtain through iterative methods since the
system is apparently unstable. To find this possible solution is used a novel numerical method valid for one and
several variables, which using the fractional derivative, allows us to find solutions for some nonlinear systems in
the complex space using real initial conditions, this method is also valid for linear systems. The method described
above has an order of convergence (at least) linear, but it is easy to implement and it is not necessary to invert
some matrix for solving nonlinear systems and linear systems.
Nelly Litvak – Asymptotic behaviour of ranking algorithms in directed random ...Yandex
There is a vast empirical research on the behaviour of ranking algorithms, e.g. Google PageRank, in scale-free networks. In this talk, we address this problem by analytical probabilistic methods. In particular, it is well-known that the PageRank in scale-free networks follows a power law with the same exponent as in-degree. Recent probabilistic analysis has provided an explanation for this phenomenon by obtaining a natural approximation for PageRank based on stochastic fixed-point equations. For these equations, explicit solutions can be constructed on weighted branching trees, and their tail behavior can be described in great detail.
In this talk we present a model for generating directed random graphs with prescribed degree distributions where we can prove that the PageRank of a randomly chosen node does indeed converge to the solution of the corresponding fixed-point equation as the number of nodes in the graph grows to infinity. The proof of this result is based on classical random graph coupling techniques combined with the now extensive literature on the behavior of branching recursions on trees.
Report on Efficient Estimation for High Similarities using Odd Sketches AXEL FOTSO
This is a short report of the paper "Efficient Estimation for High Similarities using Odd Sketches" produced for the course Softskills seminar at Telecom Paristech
Dumitru Vulcanov - Numerical simulations with Ricci flow, an overview and cos...SEENET-MTP
Lecture by prof. dr Dumitru Vulcanov (dean of the Faculty of Physics, West University of Timisoara, Romania) on October 21, 2010 at the Faculty of Science and Mathematics, Nis, Serbia.
Master Thesis on the Mathematial Analysis of Neural NetworksAlina Leidinger
Master Thesis submitted on June 15, 2019 at TUM's chair of Applied Numerical Analysis (M15) at the Mathematics Department.The project was supervised by Prof. Dr. Massimo Fornasier. The thesis took a detailed look at the existing mathematical analysis of neural networks focusing on 3 key aspects: Modern and classical results in approximation theory, robustness and Scattering Networks introduced by Mallat, as well as unique identification of neural network weights. See also the one page summary available on Slideshare.
Comparative Study of the Effect of Different Collocation Points on Legendre-C...IOSR Journals
We seek to explore the effects of three basic types of Collocation points namely points at zeros of Legendre polynomials, equally-spaced points with boundary points inclusive and equally-spaced points with boundary point non-inclusive. Established in literature is the fact that type of collocation point influences to a large extent the results produced via collocation method (using orthogonal polynomials as basis function). We
analyse the effect of these points on the accuracy of collocation method of solving second order BVP. For equally-spaced points we further consider the effect of including the boundary points as collocation points. Numerical results are presented to depict the effect of these points and the nature of problem that is best handled by each.
Computer Science
Active and Programmable Networks
Active safety systems
Ad Hoc & Sensor Network
Ad hoc networks for pervasive communications
Adaptive, autonomic and context-aware computing
Advance Computing technology and their application
Advanced Computing Architectures and New Programming Models
Advanced control and measurement
Aeronautical Engineering,
Agent-based middleware
Alert applications
Automotive, marine and aero-space control and all other control applications
Autonomic and self-managing middleware
Autonomous vehicle
Biochemistry
Bioinformatics
BioTechnology(Chemistry, Mathematics, Statistics, Geology)
Broadband and intelligent networks
Broadband wireless technologies
CAD/CAM/CAT/CIM
Call admission and flow/congestion control
Capacity planning and dimensioning
Changing Access to Patient Information
Channel capacity modelling and analysis
Civil Engineering,
Cloud Computing and Applications
Collaborative applications
Communication application
Communication architectures for pervasive computing
Communication systems
Computational intelligence
Computer and microprocessor-based control
Computer Architecture and Embedded Systems
Computer Business
Computer Sciences and Applications
Computer Vision
Computer-based information systems in health care
Computing Ethics
Computing Practices & Applications
Congestion and/or Flow Control
Content Distribution
Context-awareness and middleware
Creativity in Internet management and retailing
Cross-layer design and Physical layer based issue
Cryptography
Data Base Management
Data fusion
Data Mining
Data retrieval
Data Storage Management
Decision analysis methods
Decision making
Digital Economy and Digital Divide
Digital signal processing theory
Distributed Sensor Networks
Drives automation
Drug Design,
Drug Development
DSP implementation
E-Business
E-Commerce
E-Government
Electronic transceiver device for Retail Marketing Industries
Electronics Engineering,
Embeded Computer System
Emerging advances in business and its applications
Emerging signal processing areas
Enabling technologies for pervasive systems
Energy-efficient and green pervasive computing
Environmental Engineering,
Estimation and identification techniques
Evaluation techniques for middleware solutions
Event-based, publish/subscribe, and message-oriented middleware
Evolutionary computing and intelligent systems
Expert approaches
Facilities planning and management
Flexible manufacturing systems
Formal methods and tools for designing
Fuzzy algorithms
Fuzzy logics
GPS and location-based app
Manifold Blurring Mean Shift algorithms for manifold denoising, presentation,...Florent Renucci
(General) To retrieve a clean dataset by deleting outliers.
(Computer Vision) the recovery of a digital image that has been contaminated by additive white Gaussian noise.
It is shown that any singular Lagrangian theory: 1) can be formulated without the use of constraints by introducing a Clairaut-type version of the Hamiltonian formalism; 2) leads to a special kind of nonabelian gauge theory which is similar to the Poisson gauge theory; 3) can be treated as the many-time classical dynamics. A generalization of the Legendre transform to the zero Hessian case is done by using the mixed (envelope/general) solution of the multidimensional Clairaut equation. The equations of motion are written in the Hamilton-like form by introducing new antisymmetric brackets. It is shown that any classical degenerate Lagrangian theory is equivalent to the many-time classical dynamics. Finally, the relation between the presented formalism and the Dirac approach to constrained systems is given.
Slides for Introductory session on K Means Clustering.
simple and good. ppt
Could be used for taking classes for MCA students on Clustering Algorithms for Data mining.
Prepared By K.T.Thomas HOD of Computer Science, Santhigiri College Vazhithala
Fractional pseudo-Newton method and its use in the solution of a nonlinear sy...mathsjournal
The following document presents a possible solution and a brief stability analysis for a nonlinear system,
which is obtained by studying the possibility of building a hybrid solar receiver; It is necessary to mention that
the solution of the aforementioned system is relatively difficult to obtain through iterative methods since the
system is apparently unstable. To find this possible solution is used a novel numerical method valid for one and
several variables, which using the fractional derivative, allows us to find solutions for some nonlinear systems in
the complex space using real initial conditions, this method is also valid for linear systems. The method described
above has an order of convergence (at least) linear, but it is easy to implement and it is not necessary to invert
some matrix for solving nonlinear systems and linear systems.
Nelly Litvak – Asymptotic behaviour of ranking algorithms in directed random ...Yandex
There is a vast empirical research on the behaviour of ranking algorithms, e.g. Google PageRank, in scale-free networks. In this talk, we address this problem by analytical probabilistic methods. In particular, it is well-known that the PageRank in scale-free networks follows a power law with the same exponent as in-degree. Recent probabilistic analysis has provided an explanation for this phenomenon by obtaining a natural approximation for PageRank based on stochastic fixed-point equations. For these equations, explicit solutions can be constructed on weighted branching trees, and their tail behavior can be described in great detail.
In this talk we present a model for generating directed random graphs with prescribed degree distributions where we can prove that the PageRank of a randomly chosen node does indeed converge to the solution of the corresponding fixed-point equation as the number of nodes in the graph grows to infinity. The proof of this result is based on classical random graph coupling techniques combined with the now extensive literature on the behavior of branching recursions on trees.
Report on Efficient Estimation for High Similarities using Odd Sketches AXEL FOTSO
This is a short report of the paper "Efficient Estimation for High Similarities using Odd Sketches" produced for the course Softskills seminar at Telecom Paristech
Dumitru Vulcanov - Numerical simulations with Ricci flow, an overview and cos...SEENET-MTP
Lecture by prof. dr Dumitru Vulcanov (dean of the Faculty of Physics, West University of Timisoara, Romania) on October 21, 2010 at the Faculty of Science and Mathematics, Nis, Serbia.
Master Thesis on the Mathematial Analysis of Neural NetworksAlina Leidinger
Master Thesis submitted on June 15, 2019 at TUM's chair of Applied Numerical Analysis (M15) at the Mathematics Department.The project was supervised by Prof. Dr. Massimo Fornasier. The thesis took a detailed look at the existing mathematical analysis of neural networks focusing on 3 key aspects: Modern and classical results in approximation theory, robustness and Scattering Networks introduced by Mallat, as well as unique identification of neural network weights. See also the one page summary available on Slideshare.
Comparative Study of the Effect of Different Collocation Points on Legendre-C...IOSR Journals
We seek to explore the effects of three basic types of Collocation points namely points at zeros of Legendre polynomials, equally-spaced points with boundary points inclusive and equally-spaced points with boundary point non-inclusive. Established in literature is the fact that type of collocation point influences to a large extent the results produced via collocation method (using orthogonal polynomials as basis function). We
analyse the effect of these points on the accuracy of collocation method of solving second order BVP. For equally-spaced points we further consider the effect of including the boundary points as collocation points. Numerical results are presented to depict the effect of these points and the nature of problem that is best handled by each.
Computer Science
Active and Programmable Networks
Active safety systems
Ad Hoc & Sensor Network
Ad hoc networks for pervasive communications
Adaptive, autonomic and context-aware computing
Advance Computing technology and their application
Advanced Computing Architectures and New Programming Models
Advanced control and measurement
Aeronautical Engineering,
Agent-based middleware
Alert applications
Automotive, marine and aero-space control and all other control applications
Autonomic and self-managing middleware
Autonomous vehicle
Biochemistry
Bioinformatics
BioTechnology(Chemistry, Mathematics, Statistics, Geology)
Broadband and intelligent networks
Broadband wireless technologies
CAD/CAM/CAT/CIM
Call admission and flow/congestion control
Capacity planning and dimensioning
Changing Access to Patient Information
Channel capacity modelling and analysis
Civil Engineering,
Cloud Computing and Applications
Collaborative applications
Communication application
Communication architectures for pervasive computing
Communication systems
Computational intelligence
Computer and microprocessor-based control
Computer Architecture and Embedded Systems
Computer Business
Computer Sciences and Applications
Computer Vision
Computer-based information systems in health care
Computing Ethics
Computing Practices & Applications
Congestion and/or Flow Control
Content Distribution
Context-awareness and middleware
Creativity in Internet management and retailing
Cross-layer design and Physical layer based issue
Cryptography
Data Base Management
Data fusion
Data Mining
Data retrieval
Data Storage Management
Decision analysis methods
Decision making
Digital Economy and Digital Divide
Digital signal processing theory
Distributed Sensor Networks
Drives automation
Drug Design,
Drug Development
DSP implementation
E-Business
E-Commerce
E-Government
Electronic transceiver device for Retail Marketing Industries
Electronics Engineering,
Embeded Computer System
Emerging advances in business and its applications
Emerging signal processing areas
Enabling technologies for pervasive systems
Energy-efficient and green pervasive computing
Environmental Engineering,
Estimation and identification techniques
Evaluation techniques for middleware solutions
Event-based, publish/subscribe, and message-oriented middleware
Evolutionary computing and intelligent systems
Expert approaches
Facilities planning and management
Flexible manufacturing systems
Formal methods and tools for designing
Fuzzy algorithms
Fuzzy logics
GPS and location-based app
Manifold Blurring Mean Shift algorithms for manifold denoising, presentation,...Florent Renucci
(General) To retrieve a clean dataset by deleting outliers.
(Computer Vision) the recovery of a digital image that has been contaminated by additive white Gaussian noise.
UCSD NANO 266 Quantum Mechanical Modelling of Materials and Nanostructures is a graduate class that provides students with a highly practical introduction to the application of first principles quantum mechanical simulations to model, understand and predict the properties of materials and nano-structures. The syllabus includes: a brief introduction to quantum mechanics and the Hartree-Fock and density functional theory (DFT) formulations; practical simulation considerations such as convergence, selection of the appropriate functional and parameters; interpretation of the results from simulations, including the limits of accuracy of each method. Several lab sessions provide students with hands-on experience in the conduct of simulations. A key aspect of the course is in the use of programming to facilitate calculations and analysis.
Recommendation algorithms are intensively used to improve user experience and maximise revenue of several websites: ads targeting, recommendation of products on ecommerce websites, job offers you may be interested in, contact suggestion on social networks, ...
To do so, collaborative filtering algorithms are one of the most popular methods but several other approaches may be used.
It this presentation, we introduce the main strategies (model based vs memory based algorithms) to elaborate a recommendation engine, and we describe how to implement a collaborative filtering algorithm with only 10 lines of code.
AN EFFICIENT PARALLEL ALGORITHM FOR COMPUTING DETERMINANT OF NON-SQUARE MATRI...ijdpsjournal
One of the most significant challenges in Computing Determinant of Rectangular Matrices is high time
complexity of its algorithm. Among all definitions of determinant of rectangular matrices, Radic’s
definition has special features which make it more notable. But in this definition, C(N
M
) sub matrices of the
order m×m needed to be generated that put this problem in np-hard class. On the other hand, any row or
column reduction operation may hardly lead to diminish the volume of calculation. Therefore, in this paper
we try to present the parallel algorithm which can decrease the time complexity of computing the
determinant of non-square matrices to O(N
).
AN EFFICIENT PARALLEL ALGORITHM FOR COMPUTING DETERMINANT OF NON-SQUARE MATRI...ijdpsjournal
One of the most significant challenges in Computing Determinant of Rectangular Matrices is high time
complexity of its algorithm. Among all definitions of determinant of rectangular matrices, Radic’s
definition has special features which make it more notable. But in this definition, C(N
M
) sub matrices of the
order m×m needed to be generated that put this problem in np-hard class. On the other hand, any row or
column reduction operation may hardly lead to diminish the volume of calculation. Therefore, in this paper
we try to present the parallel algorithm which can decrease the time complexity of computing the
determinant of non-square matrices to O(N).
Connect With STEM Learning Report (2015-2016)David Thompson
Connect With STEM harnessed Connectors, individuals with diverse and vibrant networks, to bring STEM fields directly to our partner schools.
We formally shuttered the Connect With STEM experiment in early 2019. We documented our learning in the attached report that describes our experience in building and running Connect With STEM between 2015 and 2016.
Five Things to Know about Networks Within FirmsDavid Thompson
We pulled together five things we think everyone should know about networks within firms. For more background on each point, have a look here - http://bit.ly/2sAopzF
Our mission at CwS, is to increase both the visibility of a variety of STEM careers and the diverse types of people doing those jobs in a way that doesn’t place additional burden on already strained educators. In doing this, we hope to introduce students to professions that they can see themselves undertaking in the future. It is not that we think everyone should be a scientist. Rather, we think everyone should be able to see himself or herself as a scientist or working in the STEM fields.
This presentation was given in Phoenix, AZ on January 23rd 2016 as part of the 21st Century STEM: Integrate to Innovate conference.
Some complementary thoughts to accompany a recent Drug Discov. Today paper (http://goo.gl/SolB6Q) on the positioning of crowdsourcing, and the need to ask the right crowd, the right questions. Presented at the 125th Annual Drug, Chemical and Associated Technologies (DCAT) Meeting in NYC, NY March 18th 2015
Some thoughts on the link between engaging at scale and gaming. Presented at the 2nd Annual Enterprise Gamification Forum in NYC, NY September 30th 2014
Social: A Network Leader's Perfect Diversity PlatformDavid Thompson
A model of individual and group behavioural change, planning, and measurement. Oh, with some 'social' thrown in too. Social: A Network Leader's Perfect Diversity Platform" in NYC, NY June 17th 2014
Redressing the Baseline: Exploit vs. ExploreDavid Thompson
My presentation exploring the individual and organizational tensions at play, at work. "Redressing the Baseline: Exploit vs. Explore" in NYC, NY May 8th 2014
My presentation with Amy Fry on Wicked Problems, Digital, and Creativity - Change Management 2.0 - at the "Public Relations Society of America International Conference" in Philadelphia, PA October 27th 2013
A presentation I made at the FutureWork Institute "Emerging Majorities: Workplace & Marketplace Innovations" meeting in New York City, on June 11th 2013
A slightly modified version of the presentation Christopher Tan and I made at the Social Media, Mobile, and Gaming for Pharma. meeting in New York City, on December 11th 2012
Crowd computing: All your base are belong to usDavid Thompson
Results from the Boehringer Ingelheim Pharmacueticals, Inc. 'Predicting a biological response' Kaggle competition. The central thesis is that a lot of problems can be framed with gaming elements, lowering the barrier to participation, and increasing engagement. Presented at the Bio-IT Cloud Summit, Data-focused Cloud Applications session, Sept. 12-13, Hotel Kabuki, San Francisco, CA
Competitive data science: A tale of two web servicesDavid Thompson
Initial results from the Boehringer Ingelheim Pharmacueticals, Inc. 'Predicting a biological response' Kaggle competition. Presented at the Fall ACS 2012 #CINF session "When Chemists and Computers Collide: Putting Cheminformatics in the Hands of Medicinal Chemists"
An update of the work of the U.S. Social Media Advisory Committee at Boehringer Ingelheim Pharmaceuticals, Inc. This was presented at the Social Media for Pharma. conference in Philadelphia, May 23rd 2012
What happens once you’ve taken the pulse of your employee population? This case study demonstrates some of our activities following a U.S. Employee Engagement survey in 2010 - and how those activities generated real benefits both to the organization and the employees involved. This was presented at the tri-state Society for Human Resource Management conference in Springfield, April 27th 2012
Diversity 2.0 - The Diversity and Inclusion Social Media RevolutionDavid Thompson
With the inexorable growth of social media technologies, the global lexicon across cultures, generations, and professional industries has changed—permanently. In this webinar, Tanya Odom and David Thompson described core elements of social media, and how diversity and inclusion (d&i) practitioners can use these tools to complement their d&I activities. This was presented at a Linkage, Inc. webinar, March 16th 2012
Internal Social Media: Weaving the threads togetherDavid Thompson
Brief overview of the work of the U.S. Social Media Advisory Committee at Boehringer Ingelheim Pharmaceuticals, Inc. This was presented at the Social Media for Pharm conference in New York City, December 7th 2011
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension.
For more information, visit-www.vavaclasses.com
How to Split Bills in the Odoo 17 POS ModuleCeline George
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
The Art Pastor's Guide to Sabbath | Steve ThomasonSteve Thomason
What is the purpose of the Sabbath Law in the Torah. It is interesting to compare how the context of the law shifts from Exodus to Deuteronomy. Who gets to rest, and why?
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
2. Overview
A little bit about why we make drugs, and
how computational chemistry is used (my
day job)
A little bit about confined electronic
systems, informational entropy, and
complexity (my evening job)
A novel 3D QM based structural descriptor
(my afternoon job?)
3. Drugs - why do we make them?
1. Money
2. And I guess you can help people too
3. But mainly for the money
4. Drugs - how do we make them?
From a computational perspective I will
limit myself to Structure-Based Drug
Design (SBDD)
5. Drugs - how do we make them?
What are we trying to do?
+ = ?
In SBDD we use computational chemistry to capture some
part of this incredibly complex interaction by modeling the
protein-ligand binding event
We typically ‘ignore’:
Protein flexibility, polarization and other electronic factors,
solvent, entropy . . .
6. And what have I been doing?
Detailed analysis of the in-house high-throughput virtual
screening protocol
Accepted in J. Chem. Inf. Mod.
Fragment-based de novo design
CONFIRM
Submitted to J. Comput.-Aided Mol. Design
A large scale critical assessment of docking programs
Binding mode prediction
Enrichment rates in virtual screening
Method development: Docking pose assessment tool
7. The Hospital that ate my Wife
Given the tools of our trade:
I can still work on problems in electronic structure
Information theoretic properties of strongly
correlated systems
Prof. Kalidas D. Sen, University of Hyderabad
Dr. Ali Alavi, University of Cambridge
8. Electrons and how they get along
PhD in small model quantum systems
Particles-in-a-box
Exact solutions
Archetypal systems for investigating electron
correlation
Electron correlation arises as a consequence of the
simultaneous interactions of mutually repelling
particles
It is what makes QM a ‘tricky’ problem both
conceptually, and practically
9. Basic physics of these systems
Two regions of behaviour
Small R - kinetic dominance
Large R - Coulombic dominance
E ~ A/R2 + B/R + …
Wigner ‘crystal’ formation at large R
10. Properties of interest
r r
Eigenvalues and
eigenvectors:
E i , "i (x1...x N )
r 2 r r
Density: n (r1 ) = N ! | " | ds1dx 2 ...dx N
Second order rr N(N - 1) 2 r r
density matrix: n 2 (r , r ') = ! |" | ds1ds 2dx 3 ...dx N
2
Physical rr 2 rr r
exchange- n xc (r , r ') = r n 2 (r , r ')# n (r ')
correlation n (r )
hole:
r r 2 r r
First order
density matrix:
$ 1 (x, x') = N ! | " | dx 2 ...dx N
FCI, RHF, UHF, and LDA solutions for both the spherical
(N=2, 3, 4, and 5) and cubic/planar (N=3, and 4) geometries
12. Spherical two electron system
RHF solution is surprisingly simple (S=0)
1 µ max
" (r) =
4#
$ µ =1
Cµ j 0 (% µ 0 r)
And rapidly convergent for even large R
! max=7)
(µ
13. Spherical two electron system:
RHF and informational entropy
Sr = " $ # (r) ln[ #(r)]dr
S p = " $ % (p) ln[% (p)]dp
ST = Sr + S p
!
16. A novel descriptor?
Doesn’t Sr look a little familiar?
Continuous form of a measure used in molecular
similarity:
S = "# pi ln[ pi ]
i
Could we use Sr as a measure of similarity?
Moreover, could Sr be a 3D QM-based structural
descriptor?
!
Literature search has shown that this has not been
considered before (I think)
17. A novel descriptor?
We want to make this useful
But we still have the problem of finding ρ in a timely fashion
Why don’t we approximate ρ?
We construct a pro-molecular density from a sum of fitted s-
Gaussians
"(r) # " Mol (r) = % "$ (r) = % % c$i exp(&'$i (r & R$ ) 2 )
$ $ i
Turns out that this isn’t as bad as you might think
!
18. Homebrew quantum mechanics
All of this has been done on my iMac at home
Molecular integrations performed using the
Becke/Lebedev grids in PyQuante[1]
Co-opted James into doing MathCad checks for
me. . .
[1] Python Quantum Chemistry - http://pyquante.sourceforge.net/
20. Homebrew quantum mechanics
Molecule Sr
H2O -7.42
H2S 3.94
Benzene -27.09
Cyclohexane (chair) -35.94
Perhaps Sr isn’t that discriminatory?
Plan B - Sr (r) = " #(r)ln[ # (r)]
22. Conclusions and outlook
Hopefully you have a feel for what I have been
working on, and why it might be interesting/useful
Work with Prof. Sen is being written up
Extend to planes - see if signature holds for N>2
At BI incorporate descriptor into a QSAR model
Is it of any use at all - what about Sp?