May 04, 2005Trento Seminar1 Process Algebras & Network Motifs section 1.

Slides:



Advertisements
Similar presentations
On Theory Construction and Verification Author: Robert R. Sterling Source: The Accounting Review, Vol. 45, No. 3 (Jul., 1970). Pp Published by:
Advertisements

Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
Models and interpretations in the fifties: Carnap and Kemeny Pierre Wagner Université Paris 1 Panthéon-Sorbonne.
CMSC 104, Version 8/061L04Algorithms1.ppt Algorithms, Part 1 of 3 Topics Definition of an Algorithm Algorithm Examples Syntax versus Semantics Reading.
Shared Vision It all starts with a “Vision Statement”
1.Describe in detail what you see (make observations). 2.What questions would you as a biologist ask after seeing the mold?
Theories of Mind: An Introduction to Cognitive Science Jay Friedenberg Gordon Silverman.
1 New York State Mathematics Core Curriculum 2005.
The student is expected to: 2A know the definition of science and understand that it has limitations...; 2B know that hypotheses are tentative and testable.
Who Am I? Hallie Booth – Special Education (K-12) – Science 6-8 (Gifted and Talented 6 th ) – Science Coach 6-12 – CTE LDC Coach 9-12 – Middle School LDC.
Pillar I: Teacher Teams and Small Learning Communities (Part 2) Creating shared expectations for students Tony Gerdes and Jacqui Thomas.
Achieving Authentic Inquiry in Your Classroom Presented by Eric Garber.
Department of Mathematical Sciences School of Science and Technology B.A. in Mathematics CIP Code: Program Code: Program Quality Improvement.
Texas A&M University Page 1 9/16/ :22:47 PM Wei Zhao Texas A&M University Is Computer Stuff Science, Engineering, or Something else?
Relevance of Maths for CS John Barnden School of Computer Science University of Birmingham Intro to Maths for CS 2013/14.
Proof Systems KB |- Q iff there is a sequence of wffs D1,..., Dn such that Dn is Q and for each Di in the sequence: a) either Di is in KB or b) Di can.
The Research Process Fun and Excitement for Economics Majors!!!
The Process of Science Science is the quest to understand nature.
Section 1.1 Section 1.2.
Section 1: The Nature of Science
Recognizing Activities of Daily Living from Sensor Data Henry Kautz Department of Computer Science University of Rochester.
Linguistics Introduction.
Institute of Professional Studies School of Research and Graduate Studies Introduction to Business and Management Research Lecture One (1)
1 Machine Learning (Extended) Dr. Ata Kaban Algorithms to enable computers to learn –Learning = ability to improve performance automatically through experience.
+ Chapter 7 Using Integrated Teaching Methods. + Integrated Teaching Methods Combining direct and indirect delivery of instruction Encourages self-directed.
Algorithms, Part 1 of 3 Topics  Definition of an Algorithm  Algorithm Examples  Syntax versus Semantics Reading  Sections
Five Major Misconceptions about Evolution. Evolution has never been observed. Evolution violates the 2nd law of thermodynamics. There are no transitional.
Computational Semantics Day 5: Inference Aljoscha.
(Finite) Mathematical Induction In our first lesson on sequences and series, you were told that How can we be certain that this will be true for all counting.
1.2 Science in Context. The scientific method is the heart of science. Science and scientists operate with in a scientific community and our entire society.
What is Science?. The Goal of Science to investigate and understand the natural world To explain events in the natural world To use those explanations.
About the lecturer Dr. Qing Lu (Henry) – Grew up in Shanghai, China – Lived in Singapore from 1994 to 2014 – Came to IEU last September Contact information.
College of Computer Science, SCU Computer English Lecture 1 Computer Science Yang Ning 1/46.
1-1 What is Science? 1.Science- organized way of using evidence to learn about the natural world. 2. Observation- use of one or more of the senses (sight,
1 UMBC CMSC 104, Section Fall 2002 Algorithms, Part 1 of 3 Topics Definition of an Algorithm Algorithm Examples Syntax versus Semantics Reading.
Math II Unit 2 (Part 2). Exponents Exponents EQ: How do you use properties of exponents to simplify algebraic expressions?
Connected Math Program Teaching and Learning Through Problem Solving.
Lecture 8-2CS250: Intro to AI/Lisp What do you mean, “What do I mean?” Lecture 8-2 November 18 th, 1999 CS250.
Introduction to ScienceSection 1 Section 1: The Nature of Science Preview Key Ideas Bellringer How Science Takes Place The Branches of Science Scientific.
© 2006 by The McGraw-Hill Companies, Inc. All rights reserved. 1 Chapter 1 Introduction to Research in Communication Research: –Process of asking questions.
Introduction to ScienceSection 1 SCSh8 Students will understand important features of the process of scientific inquiry.
1.3 Scientific Thinking and Processes KEY CONCEPT Science is a way of thinking, questioning, and gathering evidence.
What’s it all about Alfie? Scientific tools and the scientific method Scientific tools and the scientific method What is chemistry? What is chemistry?
Teaching with CHRONOS Data and Tools A Framework for Design Cathy Manduca Science Education Resource Center Carleton College June 13, 2006.
May 04, 2005Trento Seminar1 Process Algebras & Network Motifs section 3.
How might The Science of Learning transform educator preparation? Education Writers Association 69 th National Seminar May
Deciphering “Evidence” in the New Era of Education Research Standards Ben Clarke, Ph.D. Research Associate - Center for Teaching and Learning, University.
Beluga Whales Case Study Understandings About Scientific Inquiry.
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Southern Regional Education Board Annual Leadership Forum
Section 1: The Nature of Science
Algorithms I: An Introduction to Algorithms
THEORY IN EDUCATIONAL RESEARCH
MATHEMATICS ASSIGNMENT
Warm-Up On a clean sheet of paper, write “Warm-up [today’s date]” and then answer the following question: What kinds of activities does a scientist engage.
School of Information Management Nanjing University China
2008/09/17: Lecture 4 CMSC 104, Section 0101 John Y. Park
INQUIRY PROCESSES.
Internet of Things A Process Calculus Approach
If I keep a plant from getting energy from sunlight, it will die.
The method scientists use to find answers to questions
Scientific Thinking and Processes Notes
Adv. Chemistry Chapter 1 Mrs. Baker
Section 1: The Nature of Science
Introduction to Biology
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Section 1: The Nature of Science
Scientific Theory Scientific Law Comparison Table
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Presentation transcript:

May 04, 2005Trento Seminar1 Process Algebras & Network Motifs section 1

May 04, 2005Trento Seminar2 Process algebras and network motifs 1  Introduction  Goals  Methods  Motivations  Review of  -calculus  Syntax  Structural Equivalence  Semantics  Stochastics  Introduction  Goals  Methods  Motivations  Review of  -calculus  Syntax  Structural Equivalence  Semantics  Stochastics  Review of Kinetic Proofreading  Origins  Dynamics  Examples  Modeling in  -calculus  Introduction of reflective calculi  Syntax  Structural Equivalence  Semantics  A New Approach to Stochastics  Modeling in a reflective calculus  Review of Kinetic Proofreading  Origins  Dynamics  Examples  Modeling in  -calculus  Introduction of reflective calculi  Syntax  Structural Equivalence  Semantics  A New Approach to Stochastics  Modeling in a reflective calculus

May 04, 2005Trento Seminar3 Introduction - Goals  Conducting original research  The Questions are more important than the answers  Sizing problems  Decomposing problems  Working as a team  ‘Symmetry of ignorance’  Division of labor  Communication  Facility with the analytic tools  Process algebras  Dynamical systems  Exposure to the domain  Transcription networks  Signaling networks  Conducting original research  The Questions are more important than the answers  Sizing problems  Decomposing problems  Working as a team  ‘Symmetry of ignorance’  Division of labor  Communication  Facility with the analytic tools  Process algebras  Dynamical systems  Exposure to the domain  Transcription networks  Signaling networks not Ex.1: i am not a biologist; i don’t even know how much i don’t know. 30 Ex.2: it’s been 30 years since i practiced continuous mathematics at the heart of dynamical systems

May 04, 2005Trento Seminar4 Introduction - methods  Work together on a hard problem  For which the answer is not yet worked out  Everyone is a peer  We will teach each other  Get our hands dirty  Do the math  Build executable models  Set ambitious goals  Drive with concrete deliverables  Work together on a hard problem  For which the answer is not yet worked out  Everyone is a peer  We will teach each other  Get our hands dirty  Do the math  Build executable models  Set ambitious goals  Drive with concrete deliverables

May 04, 2005Trento Seminar5 Introduction - motivations  Biology is transforming itself into a computational science  Has yet to absorb the deep messages of computing  Computing is a young field with some profound things to say to the physical sciences  Scale-invariance  Proposition-as-types paradigm  Why network motifs?  Why kinetic proofreading?  Biology is transforming itself into a computational science  Has yet to absorb the deep messages of computing  Computing is a young field with some profound things to say to the physical sciences  Scale-invariance  Proposition-as-types paradigm  Why network motifs?  Why kinetic proofreading?

May 04, 2005Trento Seminar6 Propositions-as-types paradigm logicPrograms Games semantics Category theory FormulaeTypesGamesObjects ProofsProgramsStrategiesMorphisms

May 04, 2005Trento Seminar7 Propositions-as-types paradigm logicPrograms FormulaeTypes ProofsPrograms Intuitionistic Logic Linear Logic Simply typed -calculus Proof nets CCS

May 04, 2005Trento Seminar8  Deep organizing principle of equality P  Q  E.P:E  Q:E P is effectively the same as Q iff no experiment can distinguish them  Process algebras refine this notion by ‘extending in time’ P  Q   e.P  e P  Q.Q  e Q & P  Q  e.Q  e Q  P.P  e P & P  Q  These notions coincide exactly when the experiments E are Hennessy-Milner formulae…  Deep organizing principle of equality P  Q  E.P:E  Q:E P is effectively the same as Q iff no experiment can distinguish them  Process algebras refine this notion by ‘extending in time’ P  Q   e.P  e P  Q.Q  e Q & P  Q  e.Q  e Q  P.P  e P & P  Q  These notions coincide exactly when the experiments E are Hennessy-Milner formulae… Propositions-as-types paradigm

May 04, 2005Trento Seminar9 But this is a scientific principle! The analytic tools currently brought to bear on the physical sciences are remarkably silent on such matters and yet they have practical implication for a broad range of scientific concerns But this is a scientific principle! The analytic tools currently brought to bear on the physical sciences are remarkably silent on such matters and yet they have practical implication for a broad range of scientific concerns Propositions-as-types paradigm

May 04, 2005Trento Seminar10 Why these biological investigations?  Why network motifs?  Understand the search for organizing principles (and principles of organization) from the eyes of biologists  Additionally, there ongoing efforts to find evidence of statistically significant over (and under) representation of certain kinds of networks  Why kinetic proofreading?  Well-understood from a dynamical systems point of view  Lots of literature  Significant evidence of the occurrence of this phenomena in a wide range of networks  Why network motifs?  Understand the search for organizing principles (and principles of organization) from the eyes of biologists  Additionally, there ongoing efforts to find evidence of statistically significant over (and under) representation of certain kinds of networks  Why kinetic proofreading?  Well-understood from a dynamical systems point of view  Lots of literature  Significant evidence of the occurrence of this phenomena in a wide range of networks

May 04, 2005Trento Seminar11 Why these biological investigations?  A radical proposition: network motifs : types :: networks : programs  We don’t seek individual motifs  We seek ensembles of motifs that cohere  What is the measure of that coherence?  It gives rise to an interesting and useful observation- based equality  Where the motifs are the observations  And ‘interesting’ and ‘useful’ have to do with separation of classes of networks  Kinetic proofreading is not a single motif -- it is a scheme of motifs -- a set of observations  A radical proposition: network motifs : types :: networks : programs  We don’t seek individual motifs  We seek ensembles of motifs that cohere  What is the measure of that coherence?  It gives rise to an interesting and useful observation- based equality  Where the motifs are the observations  And ‘interesting’ and ‘useful’ have to do with separation of classes of networks  Kinetic proofreading is not a single motif -- it is a scheme of motifs -- a set of observations

May 04, 2005Trento Seminar12 Propositions-as-types paradigm logicPrograms Games semantics Category theory FormulaeTypesGamesObjects ProofsProgramsStrategiesMorphisms MotifGenotype networkPhenotype BiologyBiology not Ex.1: i am not a biologist; i don’t even know how much i don’t know.