Equivalence between transition systems. Modal logic and first order logic. In pictures: forth condition. Bisimilation. In pictures: back condition
|
|
- Candace Walsh
- 5 years ago
- Views:
Transcription
1 odal logic and first order logic odal logic: local ie of the strctre ( here can I get by folloing links from here ). First order logic: global ie of the strctre (can see eerything, qantifiers do not follo edges). eaningfl eqialence beteen strctres: first order logic: (artial) isomorhism modal logic: to strctres shold hae the same edge-folloing behaior Eqialence beteen transition systems Trace eqialence? A a a b c B a choice beteen b and c is made at different oints b c GS odal Logic: lectre 3 1 GS odal Logic: lectre 3 2 Bisimilation In ictres: forth condition Let = (W,R,V) and = (W,R,V ) be to Krike strctres. A non-emty binary relation is called a bisimlation beteen and if the folloing conditions are satisfied: if (, ) then and satisfy the same roositional letters if (, ) and R(,) in, then there exists in sch that R (, ) and (, ) (the forth condition) if (, ) and R (, ) in, then there exists in sch that R(,) and (, ) (the back condition) R = {, q} = {,q} = {,q} GS odal Logic: lectre 3 3 GS odal Logic: lectre 3 4 In ictres: forth condition In ictres: back condition = {, q} = {, q} = {, q} R R R = {,q} = {,q} = {,q} = {,q} GS odal Logic: lectre 3 5 GS odal Logic: lectre 3 6 1
2 In ictres: back condition Bisimilar strctres = {, q} = {,q} R R = {, q} = {,q} We shall call and bisimilar if there is a non-emty bisimlation relation beteen them. Sometimes e consider rooted strctres: strctres here there is a distingished root/initial state of the system. For rooted strctres, and are bisimilar if there is a bisimlation sch that (root of, root of ) are in. Let s look at rooted examles. GS odal Logic: lectre 3 7 GS odal Logic: lectre 3 8 Examles: are and bisimilar? Examles: are and bisimilar? = {, q} = {, q} = {, q} y = {,q} y = {,q} x = {,q} = {,q} x = {,q} root = {,q} = {,q} GS odal Logic: lectre 3 9 easier if e color orlds satisfying same roositional ariables the same color! GS odal Logic: lectre 3 10 Are and bisimilar? Are and bisimilar? GS odal Logic: lectre 3 11 GS odal Logic: lectre
3 Are and bisimilar? Bisimlation and modal logic Sose and are to Krike strctres and is a bisimlation beteen and sch that (, ). Theorem: for eery formla φ of basic modal logic,, = φ iff, = φ In other ords, modal logic cannot distingish bisimilar strctres (can describe them to bisimlation eqialence). GS odal Logic: lectre 3 13 GS odal Logic: lectre 3 14 Proof, = φ iff, = φ if (, ) Proof contined, = φ iff, = φ if (, ) Proof by indction on φ. φ is a roositional ariable: from (, ) and satisfy the same roositional ariables φ is ψ:, = ψ iff, ψiff (by the indctie hyothesis), ψiff, = ψ φ is ψ χ:, = ψ χ iff, ψor, = χ iff (by the indctie hyothesis), ψor, = χ iff, = ψ χ. Proof by indction on φ. φ is []ψ:, = []ψ iff for all sch that R(,),, = ψ. Sose, = []ψ and, []ψ. Then there is a orld in sch that R (, ) and, ψ. By the back condition, there is a in sch that R(,) and (, ). By the indctie hyothesis,, ψ. So, []ψ: a contradiction. Similarly for, = []ψ and, []ψ. GS odal Logic: lectre 3 15 GS odal Logic: lectre 3 16 Reerse? Conterexamle for the infinite case odal logic does not distigish bisimilar strctres. Is the reerse tre: if to strctres are indistingishable by modal formlas, they are bisimilar? This is tre for finite strctres. If to finite strctres satisfy the same modal formlas, then they are bisimilar GS odal Logic: lectre 3 17 a branch of length n for eery n a branch of length n for eery n, ls an infinite branch GS odal Logic: lectre
4 Some other illminating roerties Examle Define modal deth of φ as the maximal deth of nesting of modalities in φ. For examle, ( [] ) ( [] ) [](( [] ) ( [] )) has modal deth 2. A formla of modal deth n can t see frther than n stes from the crrent orld. If e change something abot the orlds accessible in more than n stes, the trth ale of formla ill not change. ( [] ) ( []) [](( [] ) ( [])) GS odal Logic: lectre 3 19 GS odal Logic: lectre 3 20 Examle Examle ( [] ) ( []) [](( [] ) ( [])) ( [] ) ( []) [](( [] ) ( [])) GS odal Logic: lectre 3 21 GS odal Logic: lectre 3 22 Illminating roerties contined Examle: nraelling Tree model: eery satisfiable formla has a tree model. We obtain it by nraelling the original model into a tree (and roing that it is bisimilar to the original model). By or reios reslt, e already kno that eery satisfiable formla has a finite model. If e nrael a finite cyclic model, e get an infinite tree. Hoeer, e kno that the formla only cares abot orlds accessible in n stes, here n is the formla s modal deth. So e can cho the infinite tree after n leels. Each satisfiable formla has a finite tree model. GS odal Logic: lectre 3 23 GS odal Logic: lectre
5 Examle: nraelling Original strctre Unraelled strctre Examle: nraelling Each orld is bisimilar to all coies of itself in the tree GS odal Logic: lectre 3 25 GS odal Logic: lectre 3 26 Bisimilarity checking algorithm Sose e are gien to rooted grahs (W,R, ) and (W,R, ) (ignore V for the moment). We ant to check if they are bisimilar ith resect to back and forth conditions, that is if there is a bisimlation beteen them sch that (, ). This is basically the same as saying: is there a bisimlation-indced eqialence relation on the set of ertices of the grah (W,R) = (W W, R R ) sch that and are in the same eqialence class? Relational coarsest artition Let V, V W Define R -1 (V) as { in W: for some in V, R(,)} V is stable ith resect to V if either V R -1 (V ) or V R -1 (V ) =. Intitiely, V is `a kind of ertices and to be an eqialence class, V shold either only see ertices in V or not see any ertices in V. Otherise ertices in V are not eqialent ith resect to seeing ertices in V. If V is not stable ith resect to V, say V slits V. We need to find a coarsest stable artition of W, i.e. sch that none of the eqialence classes slits another. GS odal Logic: lectre 3 27 GS odal Logic: lectre 3 28 Relational coarsest artition algorithm Examle Start ith any artition of Q of W (for examle, Q={W, }). Reeat ntil the reslting artition is stable: find a set S hich is a nion of some of the eqialence classes in Q, sch that S slits some of the classes in Q relace Q = {Q 1,,Q n } ith {Q 1 R -1 (S), Q 1 -R -1 (S),, Q n R -1 (S), Q n -R -1 (S)} Q = { W, } slitter: W; R -1 (W) ={,x} Q = {{,x}, {,,y} } no stable x y GS odal Logic: lectre 3 29 GS odal Logic: lectre
6 Exercise The algorithm aboe ignores roositional ariables. Write a ersion hich does not ignore ariables (checks for bisimlation satisfying all three conditions). GS odal Logic: lectre
Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
Spanning Trees ith Many Leaes in Graphs ithot Diamonds and Blossoms Pal Bonsma Florian Zickfeld Technische Uniersität Berlin, Fachbereich Mathematik Str. des 7. Jni 36, 0623 Berlin, Germany {bonsma,zickfeld}@math.t-berlin.de
More informationChapter 3. Systems of Linear Equations: Geometry
Chapter 3 Systems of Linear Equations: Geometry Motiation We ant to think about the algebra in linear algebra (systems of equations and their solution sets) in terms of geometry (points, lines, planes,
More informationAnnouncements Wednesday, September 06
Announcements Wednesday, September 06 WeBWorK due on Wednesday at 11:59pm. The quiz on Friday coers through 1.2 (last eek s material). My office is Skiles 244 and my office hours are Monday, 1 3pm and
More informationAnnouncements Wednesday, September 06. WeBWorK due today at 11:59pm. The quiz on Friday covers through Section 1.2 (last weeks material)
Announcements Wednesday, September 06 WeBWorK due today at 11:59pm. The quiz on Friday coers through Section 1.2 (last eeks material) Announcements Wednesday, September 06 Good references about applications(introductions
More informationarxiv: v1 [math.co] 25 Sep 2016
arxi:1609.077891 [math.co] 25 Sep 2016 Total domination polynomial of graphs from primary sbgraphs Saeid Alikhani and Nasrin Jafari September 27, 2016 Department of Mathematics, Yazd Uniersity, 89195-741,
More informationGraphs and Networks Lecture 5. PageRank. Lecturer: Daniel A. Spielman September 20, 2007
Graphs and Networks Lectre 5 PageRank Lectrer: Daniel A. Spielman September 20, 2007 5.1 Intro to PageRank PageRank, the algorithm reportedly sed by Google, assigns a nmerical rank to eery web page. More
More informationAxiomatizing the Cyclic Interval Calculus
Axiomatizing the Cyclic Interal Calcls Jean-François Condotta CRIL-CNRS Uniersité d Artois 62300 Lens (France) condotta@cril.ni-artois.fr Gérard Ligozat LIMSI-CNRS Uniersité de Paris-Sd 91403 Orsay (France)
More information1 Introduction. Control 2:
Introduction Kinematics of Wheeled Mobile Robots (No legs here. They ork like arms. We e seen arms already) For control purposes, the kinematics of heeled mobile robots (WMRs) that e care about are the
More informationExercise 4. An optional time which is not a stopping time
M5MF6, EXERCICE SET 1 We shall here consider a gien filtered probability space Ω, F, P, spporting a standard rownian motion W t t, with natral filtration F t t. Exercise 1 Proe Proposition 1.1.3, Theorem
More informationConnectivity and Menger s theorems
Connectiity and Menger s theorems We hae seen a measre of connectiity that is based on inlnerability to deletions (be it tcs or edges). There is another reasonable measre of connectiity based on the mltiplicity
More informationReaction-Diusion Systems with. 1-Homogeneous Non-linearity. Matthias Buger. Mathematisches Institut der Justus-Liebig-Universitat Gieen
Reaction-Dision Systems ith 1-Homogeneos Non-linearity Matthias Bger Mathematisches Institt der Jsts-Liebig-Uniersitat Gieen Arndtstrae 2, D-35392 Gieen, Germany Abstract We describe the dynamics of a
More informationLecture 5 November 6, 2012
Hypercbe problems Lectre 5 Noember 6, 2012 Lectrer: Petr Gregor Scribe by: Kryštof Měkta Updated: Noember 22, 2012 1 Partial cbes A sbgraph H of G is isometric if d H (, ) = d G (, ) for eery, V (H); that
More informationlanguages are not CFL and hence are not This lemma enables us to prove that some recognizable by any PDA.
Introdction to Comtabilit Theor Lectre7: The Pming Lemma for Contet Free Langages Prof. Amos Israeli 1 The Pming Lemma Let Abe a contet free langage. There eists a nmber sch that for eer w A, if w then
More informationTHE CATEGORY OF CGWH SPACES
THE CATEGORY OF CGWH SPACES N. P. STRICKLAND It is ell-knon that the category U of compactly generated eak Hasdorff spaces is a conenient setting for homotopy theory and algebraic topology. In this paper
More informationDistributed Weighted Vertex Cover via Maximal Matchings
Distribted Weighted Vertex Coer ia Maximal Matchings FABRIZIO GRANDONI Uniersità di Roma Tor Vergata JOCHEN KÖNEMANN Uniersity of Waterloo and ALESSANDRO PANCONESI Sapienza Uniersità di Roma In this paper
More informationExistence of HCMU metrics on higher genus Riemann surfaces
Existence of HCMU metrics on higher gens Riemann srfaces October 4, 0 bstract We will generalize the reslt in [CCW05] and roe the existence of HCMU metrics on higher gens K-srfaces, i.e. Riemann srfaces
More informationSECTION 6.7. The Dot Product. Preview Exercises. 754 Chapter 6 Additional Topics in Trigonometry. 7 w u 7 2 =?. 7 v 77w7
754 Chapter 6 Additional Topics in Trigonometry 115. Yo ant to fly yor small plane de north, bt there is a 75-kilometer ind bloing from est to east. a. Find the direction angle for here yo shold head the
More informationConstrained tri-connected planar straight line graphs
Constrained tri-connected lanar straight line grahs Marwan Al-Jbeh Gill Bareet Mashhood Ishae Diane L. Soaine Csaba D. Tóth Andrew Winslow Abstract It is known that for any set V of n 4 oints in the lane,
More informationModel checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle]
Chater 5 Model checking, verification of CTL One must verify or exel... doubts, and convert them into the certainty of YES or NO. [Thomas Carlyle] 5. The verification setting Page 66 We introduce linear
More informationFinding Shortest Hamiltonian Path is in P. Abstract
Finding Shortest Hamiltonian Path is in P Dhananay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune, India bstract The roblem of finding shortest Hamiltonian ath in a eighted comlete grah belongs
More informationSimpler Testing for Two-page Book Embedding of Partitioned Graphs
Simpler Testing for Two-page Book Embedding of Partitioned Graphs Seok-Hee Hong 1 Hiroshi Nagamochi 2 1 School of Information Technologies, Uniersity of Sydney, seokhee.hong@sydney.ed.a 2 Department of
More informationIntro to path analysis Richard Williams, University of Notre Dame, https://www3.nd.edu/~rwilliam/ Last revised April 6, 2015
Intro to path analysis Richard Williams, Uniersity of Notre Dame, https://3.nd.ed/~rilliam/ Last reised April 6, 05 Sorces. This discssion dras heaily from Otis Ddley Dncan s Introdction to Strctral Eqation
More informationPrinciples. Model (System Requirements) Answer: Model Checker. Specification (System Property) Yes, if the model satisfies the specification
Model Checking Princiles Model (System Requirements) Secification (System Proerty) Model Checker Answer: Yes, if the model satisfies the secification Counterexamle, otherwise Krike Model Krike Structure
More informationNon-linear consolidation of soil with vertical and horizontal drainage under time-dependent loading
Uniersity of Wollongong Research Online Faculty of Engineering - Papers (Archie) Faculty of Engineering and Information Sciences Non-linear consolidation of soil ith ertical and horizontal drainage under
More information1 The space of linear transformations from R n to R m :
Math 540 Spring 20 Notes #4 Higher deriaties, Taylor s theorem The space of linear transformations from R n to R m We hae discssed linear transformations mapping R n to R m We can add sch linear transformations
More informationA proof of topological completeness for S4 in (0,1)
A proof of topological completeness for S4 in (,) Grigori Mints and Ting Zhang 2 Philosophy Department, Stanford University mints@csli.stanford.edu 2 Computer Science Department, Stanford University tingz@cs.stanford.edu
More informationPredicting Popularity of Twitter Accounts through the Discovery of Link-Propagating Early Adopters
Predicting Poplarity of Titter Acconts throgh the Discoery of Link-Propagating Early Adopters Daichi Imamori Gradate School of Informatics, Kyoto Uniersity Sakyo, Kyoto 606-850 Japan imamori@dl.soc.i.kyoto-.ac.jp
More informationCOMPUTING SCIENCE. University of Newcastle upon Tyne. Behaviour-Preserving Transition Insertions in Unfolding Prefixes. V.
UNIVERSITY OF NEWCASTLE University of Newcastle on Tyne COMPUTING SCIENCE Behavior-Preserving Transition Insertions in Unfolding Prefixes V. Khomenko TECHNICAL REPORT SERIES No. CS-TR-952 March, 2006 TECHNICAL
More informationMath 144 Activity #9 Introduction to Vectors
144 p 1 Math 144 ctiity #9 Introduction to Vectors Often times you hear people use the words speed and elocity. Is there a difference between the two? If so, what is the difference? Discuss this with your
More informationA proof of topological completeness for S4 in (0,1)
A proof of topological completeness for S4 in (0,1) G. Mints, T. Zhang Stanford University ASL Winter Meeting Philadelphia December 2002 ASL Winter Meeting 1 Topological interpretation of S4 A topological
More information1 :: Mathematical notation
1 :: Mathematical notation x A means x is a member of the set A. A B means the set A is contained in the set B. {a 1,..., a n } means the set hose elements are a 1,..., a n. {x A : P } means the set of
More informationRestricted cycle factors and arc-decompositions of digraphs. J. Bang-Jensen and C. J. Casselgren
Restricted cycle factors and arc-decompositions of digraphs J. Bang-Jensen and C. J. Casselgren REPORT No. 0, 0/04, spring ISSN 0-467X ISRN IML-R- -0-/4- -SE+spring Restricted cycle factors and arc-decompositions
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More information3.3 Operations With Vectors, Linear Combinations
Operations With Vectors, Linear Combinations Performance Criteria: (d) Mltiply ectors by scalars and add ectors, algebraically Find linear combinations of ectors algebraically (e) Illstrate the parallelogram
More informationGRAY CODES FAULTING MATCHINGS
Uniersity of Ljbljana Institte of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 19, 1000 Ljbljana, Sloenia Preprint series, Vol. 45 (2007), 1036 GRAY CODES FAULTING MATCHINGS Darko
More informationModel (In-)Validation from a H and µ perspective
Model (In-)Validation from a H and µ perspectie Wolfgang Reinelt Department of Electrical Engineering Linköping Uniersity, S-581 83 Linköping, Seden WWW: http://.control.isy.li.se/~olle/ Email: olle@isy.li.se
More informationThe Faraday Induction Law and Field Transformations in Special Relativity
Apeiron, ol. 10, No., April 003 118 The Farada Indction Law and Field Transformations in Special Relatiit Aleander L. Kholmetskii Department of Phsics, elars State Uniersit, 4, F. Skorina Aene, 0080 Minsk
More informationSpring, 2008 CIS 610. Advanced Geometric Methods in Computer Science Jean Gallier Homework 1, Corrected Version
Spring, 008 CIS 610 Adanced Geometric Methods in Compter Science Jean Gallier Homework 1, Corrected Version Febrary 18, 008; De March 5, 008 A problems are for practice only, and shold not be trned in.
More informationSAT based Abstraction-Refinement using ILP and Machine Learning Techniques
SAT based Abstraction-Refinement using ILP and Machine Learning Techniques 1 SAT based Abstraction-Refinement using ILP and Machine Learning Techniques Edmund Clarke James Kukula Anubhav Guta Ofer Strichman
More informationChords in Graphs. Department of Mathematics Texas State University-San Marcos San Marcos, TX Haidong Wu
AUSTRALASIAN JOURNAL OF COMBINATORICS Volme 32 (2005), Pages 117 124 Chords in Graphs Weizhen G Xingde Jia Department of Mathematics Texas State Uniersity-San Marcos San Marcos, TX 78666 Haidong W Department
More informationPyramidal Sum Labeling In Graphs
ISSN : 48-96, Vol 8, Issue 4, ( Part -I) April 8, pp-9 RESEARCH ARTICLE Pyramidal Sum Labeling In Graphs OPEN ACCESS HVelet Getzimah, D S T Ramesh ( department Of Mathematics, Pope s College, Sayerpuram-68,Ms
More informationThe Dot Product
The Dot Product 1-9-017 If = ( 1,, 3 ) and = ( 1,, 3 ) are ectors, the dot product of and is defined algebraically as = 1 1 + + 3 3. Example. (a) Compute the dot product (,3, 7) ( 3,,0). (b) Compute the
More informationA Linear Time Algorithm for Computing Longest Paths in 2-Trees
A Linear Time Algorithm for Compting Longest Paths in 2-Trees Minko Marko Tzetalin Vassile Krassimir Mane Febrary 25, 2013 Abstract We propose a practical linear time algorithm for the Longest Path problem
More informationStudy on the Mathematic Model of Product Modular System Orienting the Modular Design
Natre and Science, 2(, 2004, Zhong, et al, Stdy on the Mathematic Model Stdy on the Mathematic Model of Prodct Modlar Orienting the Modlar Design Shisheng Zhong 1, Jiang Li 1, Jin Li 2, Lin Lin 1 (1. College
More informationMemoryfull Branching-Time Logic
Memoryfull Branching-Time Logic Orna Kuferman 1 and Moshe Y. Vardi 2 1 Hebrew University, School of Engineering and Comuter Science, Jerusalem 91904, Israel Email: orna@cs.huji.ac.il, URL: htt://www.cs.huji.ac.il/
More informationG 2(X) X SOLVABILITY OF GRAPH INEQUALITIES. 1. A simple graph inequality. Consider the diagram in Figure 1.
SOLVABILITY OF GRAPH INEQUALITIES MARCUS SCHAEFER AND DANIEL ŠTEFANKOVIČ Abstract. We inestigate a new type of graph inequality (in the tradition of Cetkoić and Simić [Contributions to Graph Theory and
More informationStochastic Frontier Estimation Capabilities: LIMDEP and Stata (Richard Hofler, University of Central Florida)
Stochastic Frontier Estimation Capabilies: LIMDEP and (Richard Hofler, Uniersy of Central Florida) PREFACE Stochastic Frontier and Data Enelopment Analysis Software Only two of the large integrated econometrics
More informationNP and NP-Completeness
0/2/206 Algorithms NP-Completeness 7- Algorithms NP-Completeness 7-2 Efficient Certification NP and NP-Completeness By a solution of a decision problem X we understand a certificate witnessing that an
More informationNumerical Simulation of Density Currents over a Slope under the Condition of Cooling Period in Lake Biwa
Nmerical Simlation of Densit Crrents oer a Slope nder the Condition of Cooling Period in Lake Bia Takashi Hosoda Professor, Department of Urban Management, Koto Uniersit, C1-3-65, Kotodai-Katsra, Nishiko-k,
More informationMath 144 Activity #10 Applications of Vectors
144 p 1 Math 144 Actiity #10 Applications of Vectors In the last actiity, yo were introdced to ectors. In this actiity yo will look at some of the applications of ectors. Let the position ector = a, b
More informationPollock s undercutting defeat
Argumentation in Artificial Intelligence, With Alications in the Law Course at the Institute of Logic and Cognition, Sun Yat-Sen University Ib Abstract Argumentation and Argument Structure Bart Verheij
More informationMinimize Cost of Materials
Question 1: Ho do you find the optimal dimensions of a product? The size and shape of a product influences its functionality as ell as the cost to construct the product. If the dimensions of a product
More informationNetwork Farthest-Point Diagrams and their Application to Feed-Link Network Extension
Network Farthest-Point Diagrams and their Alication to Feed-Link Network Extension Prosenjit Bose Kai Dannies Jean-Lo De Carfel Christoh Doell Carsten Grimm Anil Maheshwari Stefan Schirra Michiel Smid
More informationarxiv: v1 [math.co] 10 Nov 2010
arxi:1011.5001 [math.co] 10 No 010 The Fractional Chromatic Nmber of Triangle-free Graphs with 3 Linyan L Xing Peng Noember 1, 010 Abstract Let G be any triangle-free graph with maximm degree 3. Staton
More informationSTABILITY FOR INNER FIBRATIONS REVISITED
Theory and Alications of Categories, Vol. 33, No. 19, 2018,. 523 536. STABILITY FOR INNER FIBRATIONS REVISITED DANNY STEVENSON Abstract. In this aer we rove a stability reslt for inner fibrations in terms
More informationDerivation of the basic equations of fluid flows. No. Conservation of mass of a solute (applies to non-sinking particles at low concentration).
Deriation of the basic eqations of flid flos. No article in the flid at this stage (net eek). Conseration of mass of the flid. Conseration of mass of a solte (alies to non-sinking articles at lo concentration).
More informationForced repetitions over alphabet lists
Forced reetitions over alhabet lists Neerja Mhaskar 1 and Michael Soltys 2 1 McMaster University Det. of Comting & Software 1280 Main Street West Hamilton, Ontario L8S 4K1, CANADA ohlin@mcmaster.ca 2 California
More informationMatching Transversal Edge Domination in Graphs
Available at htt://vamuedu/aam Al Al Math ISSN: 19-9466 Vol 11, Issue (December 016), 919-99 Alications and Alied Mathematics: An International Journal (AAM) Matching Transversal Edge Domination in Grahs
More information5. Biconnected Components of A Graph
5. Biconnected Components of A Graph If one city s airport is closed by bad eather, can you still fly beteen any other pair of cities? If one computer in a netork goes don, can a message be sent beteen
More informationChange of Variables. (f T) JT. f = U
Change of Variables 4-5-8 The change of ariables formla for mltiple integrals is like -sbstittion for single-ariable integrals. I ll gie the general change of ariables formla first, and consider specific
More informationTopic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar
15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider
More informationThe Minimal Estrada Index of Trees with Two Maximum Degree Vertices
MATCH Commnications in Mathematical and in Compter Chemistry MATCH Commn. Math. Compt. Chem. 64 (2010) 799-810 ISSN 0340-6253 The Minimal Estrada Index of Trees with Two Maximm Degree Vertices Jing Li
More informationMinimal Obstructions for Partial Representations of Interval Graphs
Minimal Obstrctions for Partial Representations of Interal Graphs Pael Klaík Compter Science Institte Charles Uniersity in Prage Czech Repblic klaik@ik.mff.cni.cz Maria Samell Department of Theoretical
More informationPropagation of error for multivariable function
Proagation o error or mltiariable nction No consider a mltiariable nction (,,, ). I measrements o,,,. All hae ncertaint,,,., ho ill this aect the ncertaint o the nction? L tet) o (Eqation (3.8) ± L ),...,,
More informationCTL, the branching-time temporal logic
CTL, the branching-time temoral logic Cătălin Dima Université Paris-Est Créteil Cătălin Dima (UPEC) CTL 1 / 29 Temoral roerties CNIL Safety, termination, mutual exclusion LTL. Liveness, reactiveness, resonsiveness,
More informationConsistent Numerical Model for Wind Buffeting Analysis of Long-Span Bridges
Consistent Nmerical Model for Wind Bffeting Analysis of Long-pan Bridges Dorian JANJIC Technical Director TDV GesmbH Graz, Astria Heinz PIRCHER Director TDV GesmbH Graz, Astria mmary The bffeting analysis
More informationEE2 Mathematics : Functions of Multiple Variables
EE2 Mathematics : Fnctions of Mltiple Variables http://www2.imperial.ac.k/ nsjones These notes are not identical word-for-word with m lectres which will be gien on the blackboard. Some of these notes ma
More informationON THE INJECTIVE DOMINATION OF GRAPHS
Palestine Journal of Mathematics Vol. 7(1)(018), 0 10 Palestine Polytechnic Uniersity-PPU 018 ON THE INJECTIVE DOMINATION OF GRAPHS Anwar Alwardi, R. Rangarajan and Akram Alqesmah Communicated by Ayman
More informationAn Introduction To Range Searching
An Introduction To Range Searching Jan Vahrenhold eartment of Comuter Science Westfälische Wilhelms-Universität Münster, Germany. Overview 1. Introduction: Problem Statement, Lower Bounds 2. Range Searching
More informationANOVA INTERPRETING. It might be tempting to just look at the data and wing it
Introdction to Statistics in Psychology PSY 2 Professor Greg Francis Lectre 33 ANalysis Of VAriance Something erss which thing? ANOVA Test statistic: F = MS B MS W Estimated ariability from noise and mean
More information2 The Bhaduri-Marglin model
The Bhaduri-Marglin model n this chapter the basics o the Bhaduri-Marglin model ill be discussed. Doing so, attention ill be directed on hich eatures o the model ill hae to be altered hen endogeniing labor
More informationNotes on Optical Pumping Procedure & Theory
Notes on Otical Puming Procedure & Theory Pre-lab 1. Why is the exeriment called otical uming? What is umed? 2. What is the exerimental signature of having cancelled all magnetic fields in the samle cell?
More informationLogistic Regression. Machine Learning Fall 2018
Logistic Regression Machine Learning Fall 2018 1 Where are e? We have seen the folloing ideas Linear models Learning as loss minimization Bayesian learning criteria (MAP and MLE estimation) The Naïve Bayes
More informationModel Theory of Modal Logic Lecture 5. Valentin Goranko Technical University of Denmark
Model Theory of Modal Logic Lecture 5 Valentin Goranko Technical University of Denmark Third Indian School on Logic and its Applications Hyderabad, January 29, 2010 Model Theory of Modal Logic Lecture
More informationSpace-Time Behavior Based Correlation
Space-Time Behaior Based Correlation Eli Shechtman Michal Irani Dept. of Compter Science and Applied Math The Weizmann Institte of Science 761 Rehoot, Israel Abstract We introdce a behaior-based similarity
More informationPROFIT MAXIMIZATION. π = p y Σ n i=1 w i x i (2)
PROFIT MAXIMIZATION DEFINITION OF A NEOCLASSICAL FIRM A neoclassical firm is an organization that controls the transformation of inuts (resources it owns or urchases into oututs or roducts (valued roducts
More informationLECTURE 2: CROSS PRODUCTS, MULTILINEARITY, AND AREAS OF PARALLELOGRAMS
LECTURE : CROSS PRODUCTS, MULTILINEARITY, AND AREAS OF PARALLELOGRAMS MA1111: LINEAR ALGEBRA I, MICHAELMAS 016 1. Finishing up dot products Last time we stated the following theorem, for which I owe you
More informationBest approximation by linear combinations of characteristic functions of half-spaces
Best aroximation by linear combinations of characteristic functions of half-saces Paul C. Kainen Deartment of Mathematics Georgetown University Washington, D.C. 20057-1233, USA Věra Kůrková Institute of
More informationFiltrations and Basic Proof Theory Notes for Lecture 5
Filtrations and Basic Proof Theory Notes for Lecture 5 Eric Pacuit March 13, 2012 1 Filtration Let M = W, R, V be a Kripke model. Suppose that Σ is a set of formulas closed under subformulas. We write
More information4.2 First-Order Logic
64 First-Order Logic and Type Theory The problem can be seen in the two qestionable rles In the existential introdction, the term a has not yet been introdced into the derivation and its se can therefore
More informationArtificial Neural Networks. Part 2
Artificial Neural Netorks Part Artificial Neuron Model Folloing simplified model of real neurons is also knon as a Threshold Logic Unit x McCullouch-Pitts neuron (943) x x n n Body of neuron f out Biological
More informationWork and Heat Definitions
Work and Heat Definitions FL- Surroundings: Everything outside system + q -q + System: he part of S the orld e are observing. Heat, q: transfer of energy resulting from a temperature difference Work, :
More informationModal Logic. UIT2206: The Importance of Being Formal. Martin Henz. March 19, 2014
Modal Logic UIT2206: The Importance of Being Formal Martin Henz March 19, 2014 1 Motivation The source of meaning of formulas in the previous chapters were models. Once a particular model is chosen, say
More informationMA3H1 TOPICS IN NUMBER THEORY PART III
MA3H1 TOPICS IN NUMBER THEORY PART III SAMIR SIKSEK 1. Congruences Modulo m In quadratic recirocity we studied congruences of the form x 2 a (mod ). We now turn our attention to situations where is relaced
More informationFive Basic Concepts of Axiomatic Rewriting Theory
Fie Basic Concepts of Axiomatic Rewriting Theory Pal-André Melliès Institt de Recherche en Informatiqe Fondamentale (IRIF) CNRS, Uniersité Paris Diderot Abstract In this inited talk, I will reiew fie basic
More informationJumping Boxes. Representing lambda-calculus boxes by jumps. Beniamino Accattoli 1 and Stefano Guerrini 2
mping Boxes Representing lambda-calcls boxes by jmps Beniamino Accattoli 1 and Stefano Gerrini 2 1 Dip. di Informatica e Sistemistica A. Rberti. Sapienza Uniersità di Roma. Via Ariosto, 25-00185 Roma,
More informationLogics for Bisimulation and Divergence
Logics for Bisimulation and Divergence Xinxin Liu, Tingting Yu (B), and Wenhui Zhang State Key Laboratory of Computer Science, Institute of Softare, CAS, University of Chinese Academy of Sciences, Beijing,
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 12
8.3: Algebraic Combinatorics Lionel Levine Lecture date: March 7, Lecture Notes by: Lou Odette This lecture: A continuation of the last lecture: comutation of µ Πn, the Möbius function over the incidence
More informationSolution sheet ξi ξ < ξ i+1 0 otherwise ξ ξ i N i,p 1 (ξ) + where 0 0
Advanced Finite Elements MA5337 - WS7/8 Solution sheet This exercise sheets deals with B-slines and NURBS, which are the basis of isogeometric analysis as they will later relace the olynomial ansatz-functions
More informationSUBJECT:ENGINEERING MATHEMATICS-I SUBJECT CODE :SMT1101 UNIT III FUNCTIONS OF SEVERAL VARIABLES. Jacobians
SUBJECT:ENGINEERING MATHEMATICS-I SUBJECT CODE :SMT0 UNIT III FUNCTIONS OF SEVERAL VARIABLES Jacobians Changing ariable is something e come across er oten in Integration There are man reasons or changing
More information6.4 VECTORS AND DOT PRODUCTS
458 Chapter 6 Additional Topics in Trigonometry 6.4 VECTORS AND DOT PRODUCTS What yo shold learn ind the dot prodct of two ectors and se the properties of the dot prodct. ind the angle between two ectors
More informationLecture 3. (2) Last time: 3D space. The dot product. Dan Nichols January 30, 2018
Lectre 3 The dot prodct Dan Nichols nichols@math.mass.ed MATH 33, Spring 018 Uniersity of Massachsetts Janary 30, 018 () Last time: 3D space Right-hand rle, the three coordinate planes 3D coordinate system:
More informationNUCLEATION AND SPINODAL DECOMPOSITION IN TERNARY-COMPONENT ALLOYS
NUCLEATION AND SPINODAL DECOMPOSITION IN TERNARY-COMPONENT ALLOYS COLLEEN ACKERMANN AND WILL HARDESTY Abstract. The Cahn-Morral System has often been sed to model the dynamics of phase separation in mlti-component
More informationCS 331: Artificial Intelligence Naïve Bayes. Naïve Bayes
CS 33: Artificial Intelligence Naïe Bayes Thanks to Andrew Moore for soe corse aterial Naïe Bayes A special type of Bayesian network Makes a conditional independence assption Typically sed for classification
More informationy p 2 p 1 y p Flexible System p 2 y p2 p1 y p u, y 1 -u, y 2 Component Breakdown z 1 w 1 1 y p 1 P 1 P 2 w 2 z 2
ROBUSTNESS OF FLEXIBLE SYSTEMS WITH COMPONENT-LEVEL UNCERTAINTIES Peiman G. Maghami Λ NASA Langley Research Center, Hamton, VA 368 Robustness of flexible systems in the resence of model uncertainties at
More informationConcept of Stress at a Point
Washkeic College of Engineering Section : STRONG FORMULATION Concept of Stress at a Point Consider a point ithin an arbitraril loaded deformable bod Define Normal Stress Shear Stress lim A Fn A lim A FS
More informationarxiv: v2 [math.co] 6 Jul 2017
COUNTING WORDS SATISFYING THE RHYTHMIC ODDITY PROPERTY FRANCK JEDRZEJEWSKI arxiv:1607.07175v2 [math.co] 6 Jul 2017 Abstract. This aer describes an enumeration of all words having a combinatoric roerty
More informationTABLEAUX VARIANTS OF SOME MODAL AND RELEVANT SYSTEMS
Bulletin of the Section of Logic Volume 17:3/4 (1988), pp. 92 98 reedition 2005 [original edition, pp. 92 103] P. Bystrov TBLEUX VRINTS OF SOME MODL ND RELEVNT SYSTEMS The tableaux-constructions have a
More informationarxiv: v2 [cs.si] 27 Apr 2017
Opinion Dynamics in Networks: Conergence, Stability and Lack of Explosion arxi:1607.038812 [cs.si] 27 Apr 2017 Tng Mai Georgia Institte of Technology maitng89@gatech.ed Vijay V. Vazirani Georgia Institte
More informationModal and Temporal Logics
Modal and Temporal Logics Colin Stirling School of Informatics University of Edinburgh July 23, 2003 Why modal and temporal logics? 1 Computational System Modal and temporal logics Operational semantics
More information