Components, Materials and Discussion of Endurants
|
|
|
- Kenneth Powell
- 10 years ago
- Views:
Transcription
1 0 Dines Bjørner s MAP-i Lecture # 4 Components, Materials and Discussion of Endurants Monday, 25 May 2015: 16:45 17:30 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36 0 Domain Science & Engineering
2 Components Components are discrete endurants which are not considered parts. is component(k) is endurant(k) is part(k) Example 45. Parts and Components: We observe components as associated with atomic parts: The contents, that is, the collection of zero, one or more boxes, of a container is the components of the container part. Conveyor belts transport machine assembly units and are thus considered the components of the conveyor belt. A Prerequisite for Requirements Engineering 203 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
3 Components We now complement the observe part sorts (of earlier). We assume, without loss of generality, that only atomic parts may contain components. Let p:p be some atomic part. Analysis Prompt 15. has components: The domain analysis prompt: has components(p) yields true if atomic part p potentially contains components otherwise false c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
4 Components Let us assume that parts p:p embodies components of sorts {K 1,K 2,...,K n }. Since we cannot automatically guarantee that our domain descriptions secure that each K i ([1 i n]) denotes disjoint sets of entities we must prove it. Domain Description Prompt 6. observe component sorts: The domain description prompt: observe component sorts(e) yields the component sorts and component sort observers domain description text according to the following schema: A Prerequisite for Requirements Engineering 205 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
5 Components 6. observe component sorts schema Narration: [s]... narrative text on component sorts... [o]... narrative text on component sort observers... [i]... narrative text on component sort recognisers... [p]... narrative text on component sort proof obligations... Formalisation: type [s] K1, K2,..., Kn [s] KS = (K1 K2... Kn)-set value [o] components: P KS [i] is K i : K Bool [1 i n] Proof Obligation: [ Disjointness of Component Sorts] [p] m i :(K 1 K 2... K n ) [p] {is Ki (m i ) {is K j (m i ) j {1..m}\{i}} i {1..m}} c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
6 Components Example 46. Container Components: We continue Example 22 on Slide When we apply obs component sorts C to any container c:c we obtain a.a type clause stating the sorts of the various components of a container, b.a union type clause over these component sorts, and c. the component observer function signature. type 60a. K1, K2,..., Kn 60b. KS = (K1 K2... Kn)-set value 60c. obs comp KS: C KS A Prerequisite for Requirements Engineering 207 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
7 Components We have presented one way of tackling the issue of describing components. There are other ways. We leave those other ways to the reader. We are not going to suggest techniques and tools for analysing, let alone describing qualities of components. We suggest that conventional abstraction of modeling techniques and tools be applied. c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
8 Components Materials Continuous endurants(i.e., materials) are entities, m, which satisfy: is material(m) is endurant(m) is continuous(m) Example 47. Parts and Materials: We observe materials as associated with atomic parts: Thus liquid or gaseous materials are observed in pipeline units We shall in this seminar not cover the case of parts being immersed in materials. A Prerequisite for Requirements Engineering 209 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
9 Materials We assume, without loss of generality, that only atomic parts may contain materials. Let p:p be some atomic part. Analysis Prompt 16. has materials: The domain analysis prompt: has materials(p) yields true if the atomic part p:p potentially contains materials otherwise false c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
10 Materials Let us assume that parts p:p embodies materials of sorts {M 1,M 2,...,M n }. Since we cannot automatically guarantee that our domain descriptions secure that each M i ([1 i n]) denotes disjoint sets of entities we must prove it. Domain Description Prompt 7. observe material sorts: The domain description prompt: observe material sorts(e) yields the material sorts and material sort observers domain description text according to the following schema: A Prerequisite for Requirements Engineering 211 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
11 Materials 7. observe material sorts schema Narration: [s]... narrative text on material sorts... [o]... narrative text on material sort observers... [ i]... narrative text on material sort recognisers... [p]... narrative text on material sort proof obligations... Formalisation: type [s] M i [1 i n] [s] MS = M1 M2... Mn value [o] obs mat M i : P M i [1 i n] [o] materials: P MS [i] is M i : M Bool [1 i n] proof obligation [ Disjointness of Material Sorts] [p] m i :(M 1 M 2... M n ) [p] {is Mi (m i ) {is M j (m i ) j {1..m}\{i}} i {1..m}} The M i are all distinct c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
12 Materials 213 Example 48. Pipeline Material: We continue Example 27 on Slide 140 and Example 33 on Slide When we apply obs material sorts U to any unit u:u we obtain a.a type clause stating the material sort LoG for some further undefined liquid or gaseous material, and b. a material observer function signature. type 61a. LoG value 61b. obs mat LoG: U LoG A Prerequisite for Requirements Engineering 213 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
13 Materials Materials-related Part Attributes It seems that the interplay between parts and materials is an area where domain analysis in the sense of this seminar is relevant. c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
14 Materials Materials-related Part Attributes Example 49. Pipeline Material Flow: We continue Examples 27, 33 and 48. Let us postulate a[n attribute] sort Flow. We now wish to examine the flow of liquid (or gaseous) material in pipeline units. We use two types 62F for productive flow, and L for wasteful leak. Flow and leak is measured, for example, in terms of volume of material per second. We then postulate the following unit attributes measured at the point of in- or out-flow or in the interior of a unit. A Prerequisite for Requirements Engineering 215 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
15 Materials Materials-related Part Attributes 63 current flow of material into a unit input connector, 64 maximum flow of material into a unit input connector while maintaining laminar flow, 65 current flow of material out of a unit output connector, 66 maximum flow of material out of a unit output connector while maintaining laminar flow, 67 currentleakofmaterial at a unit input connector, 68 maximum guaranteed leak of material at a unit input connector, 69 currentleak ofmaterial ataunitinput connector, 70 maximum guaranteed leak of material at a unit input connector, 71 current leak of material from within a unit, and 72 maximum guaranteed leak of material from within a unit. c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
16 Materials Materials-related Part Attributes 217 type 62. F, L value 63. attr cur if: U UI F 64. attr max if: U UI F 65. attr cur of: U UI F 66. attr max of: U UI F 67. attr cur il: U UI L 68. attr max il: U UI L 69. attr cur ol: U UI L 70. attr max ol: U UI L 71. attr cur L: U L 72. attr max L: U L The maximum flow attributes are static attributes and are typically provided by the manufacturer as indicators of flows below which laminar flow can be expected. The current flow attributes are dynamic attributes A Prerequisite for Requirements Engineering 217 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
17 Materials Materials-related Part Attributes Laws of Material Flows and Leaks It may be difficult or costly, or both, to ascertain flows and leaks in materials-based domains. But one can certainly speak of these concepts. This casts new light on domain modeling. That is in contrast to incorporating such notions of flows and leaks in requirements modeling where one has to show implement-ability. Modeling flows and leaks is important to the modeling of materialsbased domains. c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
18 Materials Laws of Material Flows and Leaks Example 50. Pipelines: Intra Unit Flow and Leak Law: 73For every unit of a pipeline system, except the well and the sink units, the following law apply. 74The flows into a unit equal a.the leak at the inputs b.plus the leak within the unit c.plus the flows out of the unit d.plus the leaks at the outputs. A Prerequisite for Requirements Engineering 219 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
19 Materials Laws of Material Flows and Leaks axiom [ Well formedness of Pipeline Systems, PLS (1)] 73. pls:pls,b:b\we\si,u:u 73. b obs part Bs(pls) u=obs part U(b) 73. let (iuis,ouis) = obs mereo U(u) in 74. sum cur if(iuis)(u) = 74a.. sum cur il(iuis)(u) 74b.. attr cur L(u) 74c.. sum cur of(ouis)(u) 74d.. sum cur ol(ouis)(u) 73. end c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
20 Materials Laws of Material Flows and Leaks The sum cur if (cf.item74) sums current input flows over all input connectors. 76 The sum cur il (cf.item74a.) sums current input leaks over all input connectors. 77 The sum cur of (cf.item74c.) sums current output flows over all output connectors. 78 The sum cur ol (cf.item74d.) sums current output leaks over all output connectors. 75. sum cur if: UI-set U F 75. sum cur if(iuis)(u) {attr cur if(ui)(u) ui:ui ui iuis} 76. sum cur il: UI-set U L 76. sum cur il(iuis)(u) {attr cur il(ui)(u) ui:ui ui iuis} 77. sum cur of: UI-set U F 77. sum cur of(ouis)(u) {attr cur if(ui)(u) ui:ui ui ouis} 78. sum cur ol: UI-set U L 78. sum cur ol(ouis)(u) {attr cur il(ui)(u) ui:ui ui ouis} : (F L) (F L) F A Prerequisite for Requirements Engineering 221 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
21 Materials Laws of Material Flows and Leaks Example 51. Pipelines: Inter Unit Flow and Leak Law: 79 For every pair of connected units of a pipeline system the following law apply: a. the flow out of a unit directed at another unit minus the leak at that output connector b. equals the flow into that other unit at the connector from the given unit plus the leak at that connector. axiom [ Well formedness of Pipeline Systems, PLS (2)] 79. pls:pls,b,b :B,u,u :U 79. {b,b } obs part Bs(pls) b b u =obs part U(b ) 79. let (iuis,ouis)=obs mereo U(u),(iuis,ouis )=obs mereo U(u ), 79. ui=uid U(u),ui =uid U(u ) in 79. ui iuis ui ouis 79a.. attr cur of(u )(ui ) attr leak of(u )(ui ) 79b.. = attr cur if(u)(ui) + attr leak if(u)(ui) 79. end 79. comment: b precedes b c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
22 Materials Laws of Material Flows and Leaks 223 From the above two laws one can prove the theorem: what is pumped from the wells equals what is leaked from the systems plus what is output to the sinks. We need formalising the flow and leak summation functions. A Prerequisite for Requirements Engineering 223 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
23 Materials No Junk, No Confusion Domain descriptions are, as we have already shown, formulated, both informally and formally, by means of abstract types, that is, by sorts for which no concrete models are usually given. Sorts are made to denote possibly empty, possibly infinite, rarely singleton, sets of entities on the basis of the qualities defined for these sorts, whether external or internal. c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
24 No Junk, No Confusion By junk we shall understand that the domain description unintentionally denotes undesired entities. By confusion we shall understand that the domain description unintentionally have two or more identifications of the same entity or type. The question is can we formulate a [formal] domain description such that it does not denote junk or confusion? The short answer to this is no! A Prerequisite for Requirements Engineering 225 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
25 No Junk, No Confusion So, since one naturally wishes no junk, no confusion what does one do? The answer to that is one proceeds with great care! To avoid junk we have stated a number of sort well-formedness axioms, for example: Slide151 for Well-formedness of Links, L, and Hubs, H, Slide 158 for Well-formedness of Domain Mereologies, Slide161 for Well-formedness of Road Nets, N, Slide 163 for Well-formedness of Pipeline Systems, PLS (0), Slide 182 for Well-formedness of Hub States, HΣ, Slide 220 for Well-formedness of Pipeline Systems, PLS (1), Slide 222 for Well-formedness of Pipeline Systems, PLS (2), Slide 229 for Well-formedness of Pipeline Route Descriptors and Slide 233 for Well-formedness of Pipeline Systems, PLS (3). c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
26 No Junk, No Confusion 227 To avoid confusion we have stated a number of proof obligations: Slide 122 for Disjointness of Part Sorts, Slide 178 for Disjointness of Attribute Types and Slide 212 for Disjointness of Material Sorts. A Prerequisite for Requirements Engineering 227 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
27 No Junk, No Confusion Example 52. No Pipeline Junk: We continueexample 27onSlide140andExample 33on Slide We define a proper pipeline route to be a sequence of pipeline units. a.such that the i th and i+1 st units in sequences longer than 1 are (forward) adjacent, in the sense defined below, and b.such that the route is acyclic, in the sense also defined below. To formalise the above we describe some auxiliary notions. c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
28 No Junk, No Confusion Pipe Routes 81A route descriptor is the sequence of unit identifiers of the units of a route (of a pipeline system). type 80. R = U ω 80. R = { r:route wf Route(r) } 81. RD = UI ω axiom [ Well formedness of Pipeline Route Descriptors, RD] 81. rd:rd r:r rd=descriptor(r) value 81. descriptor: R RD 81. descriptor(r) uid UI(r[ i]) i:nat 1 i len r A Prerequisite for Requirements Engineering 229 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
29 No Junk, No Confusion 82Two units are (forward) adjacent if the output unit identifiers of one shares a unique unit identifier with the input identifiers of the other. value 82. adjacent: U U Bool 82. adjacent(u,u ) 82. let (,ouis)=obs mereo U(u), 82. (iuis,)=obs mereo U(u ) in 82. ouis iuis {} end c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
30 No Junk, No Confusion Given a pipeline system, pls, one can identify the(possibly infinite) set of(possibly infinite) routes of that pipeline system. a. The empty sequence,, is a route of pls. b. Let u be a unit of pls, then u is a route of pls. c. Let u,u be adjacent units of pls then u,u is a route of pls. d. If r and r are routes of pls such that the last element of r is the same as the first element of r, then r tlr is a route of pls. e. No sequence of units is a route unless it follows from a finite number of applications of the basis and induction clauses of Items 83a. 83d.. value 83. Routes: PLS R-infset 83. Routes(pls) 83a.. let rs = 83b.. { u u:u u obs part Us(pls)} 83c.. { u,u u,u :U{u,u } obs part Us(pls) adjacent(u,u )} 83d.. {r tl r r,r :R{r,r } rs r[len r]=hd r } 83e.. in rs end A Prerequisite for Requirements Engineering 231 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
31 No Junk, No Confusion Well-formed Routes 84A route is acyclic if no two route positions reveal the same unique unit identifier. value 84. acyclic Route: R Bool 84. acyclic Route(r) i,j:nat {i,j} inds r i j r[i]=r[j] c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
32 No Junk, No Confusion Well-formed Pipeline Systems 85 A pipeline system is well-formed if a.none of its routes are circular and b. all of its routes are embedded in well-to-sink routes. axiom [ Well formedness of Pipeline Systems, PLS (3)] 85. pls:pls 85a.. non circular(pls) 85b.. are embedded in well to sink Routes(pls) value 85. non circular PLS: PLS Bool 85. non circular PLS(pls) 85. r:r r routes(p) acyclic Route(r) A Prerequisite for Requirements Engineering 233 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
33 No Junk, No Confusion 86 We define well-formedness in terms of well-to-sink routes, i.e., routes which start with a well unit and end with a sink unit. value 86. well to sink Routes: PLS R-set 86. well to sink Routes(pls) 86. let rs = Routes(pls) in 86. {r r:r r rs is We(r[1]) is Si(r[len r])} end c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
34 No Junk, No Confusion A pipeline system is well-formed if all of its routes are embedded in well-to-sink routes. 87. are embedded in well to sink Routes: PLS Bool 87. are embedded in well to sink Routes(pls) 87. let wsrs = well to sink Routes(pls) in 87. r:r r Routes(pls) 87. r :R,i,j:Nat 87. r wsrs 87. {i,j} inds r i j 87. r = r [k] k:nat i k j end A Prerequisite for Requirements Engineering 235 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
35 No Junk, No Confusion Embedded Routes 88For every route we can define the set of all its embedded routes. value 88. embedded Routes: R R-set 88. embedded Routes(r) 88. { r[ k] k:nat i k j i,j:nat i {i,j} inds(r) i j} c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
36 No Junk, No Confusion A Theorem 89 The following theorem is conjectured: a.the set of all routes (of the pipeline system) b.is the set of all well-to-sink routes (of a pipeline system) and c. all their embedded routes theorem: 89. pls:pls 89. let rs = Routes(pls), 89. wsrs = well to sink Routes(pls) in 89a.. rs = 89b.. wsrs 89c.. {{r r :R r embedded Routes(r )} r :R 88. end r wsrs} A Prerequisite for Requirements Engineering 237 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
37 No Junk, No Confusion The above example, besides illustrating one way of coping with junk, also illustrated the need for introducing a number of auxiliary notions: types, functions, axioms and theorems. c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
38 No Junk, No Confusion Discussion of Endurants In Sect a depth-first search for part sorts was hinted at. It essentially expressed that we discover domains epistemologically 16 but understand them ontologically. 17 The Danish philosopher Søren Kirkegaard ( ) expressed it this way: Life is lived forwards, but is understood backwards. The presentation of the of the domain analysis prompts and the domain description prompts results in domain descriptions which are ontological. The depth-first search recognizes the epistemological nature of bringing about understanding. 16 Epistemology: the theory of knowledge, especially with regard to its methods, validity, and scope. Epistemology is the investigation of what distinguishes justified belief from opinion. 17 Ontology: the branch of metaphysics dealing with the nature of being. A Prerequisite for Requirements Engineering 239 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
39 Discussion of Endurants This depth-first search that ends with the analysis of atomic part sorts can be guided, i.e., hastened (shortened), by postulating composite sorts that correspond to vernacular nouns: everyday nouns that stand for classes of endurants. c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15: Domain Science & Engineering
40 Discussion of Endurants We could have chosen our domain analysis prompts and domain description prompts to reflect a bottom-up epistemology, one that reflected how we composed composite understandings from initially atomic parts. We leave such a collection of domain analysis prompts and domain description prompts to the student. A Prerequisite for Requirements Engineering 241 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36
41 0 Dines Bjørner s MAP-i Lecture # 4 End of MAP-i Lecture #4: Components, Materials and Discussion of Endurants Monday, 25 May 2015: 16:45 17:30 c Dines Bjørner 2015, Fredsvej 11, DK 2840 Holte, Denmark May 23, 2015: 15:36 0 Domain Science & Engineering
Lecture 6: Discovering Domain Entities
221 Lecture 6: Discovering Domain Entities DTU Informatics FM 2012 Tutorial Lecture Notes 221 c Dines Bjørner 2011, Fredsvej 11, DK 2840 Holte, Denmark - April 30, 2012: 09:16 5. 5. Discovering Domain
CHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
Mathematical Induction. Lecture 10-11
Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
Lecture Note 1 Set and Probability Theory. MIT 14.30 Spring 2006 Herman Bennett
Lecture Note 1 Set and Probability Theory MIT 14.30 Spring 2006 Herman Bennett 1 Set Theory 1.1 Definitions and Theorems 1. Experiment: any action or process whose outcome is subject to uncertainty. 2.
CMPSCI 250: Introduction to Computation. Lecture #19: Regular Expressions and Their Languages David Mix Barrington 11 April 2013
CMPSCI 250: Introduction to Computation Lecture #19: Regular Expressions and Their Languages David Mix Barrington 11 April 2013 Regular Expressions and Their Languages Alphabets, Strings and Languages
Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it
Formal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
C H A P T E R Regular Expressions regular expression
7 CHAPTER Regular Expressions Most programmers and other power-users of computer systems have used tools that match text patterns. You may have used a Web search engine with a pattern like travel cancun
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding
Graphs without proper subgraphs of minimum degree 3 and short cycles
Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract
SECTION 10-2 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
The TSE Trading Rules 1
The TSE Trading Rules 1 Dines Bjørner Fredsvej 11, DK-2840 Holte, Danmark E Mail: [email protected], URL: www.imm.dtu.dk/ db February 22, 2010 1 This is version 2 of a document first released on January
Software Engineering
Software Engineering Lecture 04: The B Specification Method Peter Thiemann University of Freiburg, Germany SS 2013 Peter Thiemann (Univ. Freiburg) Software Engineering SWT 1 / 50 The B specification method
Geometry: Unit 1 Vocabulary TERM DEFINITION GEOMETRIC FIGURE. Cannot be defined by using other figures.
Geometry: Unit 1 Vocabulary 1.1 Undefined terms Cannot be defined by using other figures. Point A specific location. It has no dimension and is represented by a dot. Line Plane A connected straight path.
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE
A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE DANIEL A. RAMRAS In these notes we present a construction of the universal cover of a path connected, locally path connected, and semi-locally simply
Automata Theory. Şubat 2006 Tuğrul Yılmaz Ankara Üniversitesi
Automata Theory Automata theory is the study of abstract computing devices. A. M. Turing studied an abstract machine that had all the capabilities of today s computers. Turing s goal was to describe the
MA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
Lecture 2 Introduction to Data Flow Analysis
Lecture 2 Introduction to Data Flow Analysis I. Introduction II. Example: Reaching definition analysis III. Example: Liveness analysis IV. A General Framework (Theory in next lecture) Reading: Chapter
Basic Probability Concepts
page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes
So let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
Determination of the normalization level of database schemas through equivalence classes of attributes
Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,
1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: [email protected] Proof: For any element x of the empty set, x is also an element of every set since
Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER
THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER JASPER DEANTONIO Abstract. This paper is a study of the Turing Degrees, which are levels of incomputability naturally arising from sets of natural numbers.
Ideal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Simulation-Based Security with Inexhaustible Interactive Turing Machines Ralf Küsters Institut für Informatik Christian-Albrechts-Universität zu Kiel 24098 Kiel, Germany [email protected]
Metric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
Classification - Examples
Lecture 2 Scheduling 1 Classification - Examples 1 r j C max given: n jobs with processing times p 1,...,p n and release dates r 1,...,r n jobs have to be scheduled without preemption on one machine taking
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
Computational Models Lecture 8, Spring 2009
Slides modified by Benny Chor, based on original slides by Maurice Herlihy, Brown Univ. p. 1 Computational Models Lecture 8, Spring 2009 Encoding of TMs Universal Turing Machines The Halting/Acceptance
Mathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
E3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
Relational Databases
Relational Databases Jan Chomicki University at Buffalo Jan Chomicki () Relational databases 1 / 18 Relational data model Domain domain: predefined set of atomic values: integers, strings,... every attribute
Regular Languages and Finite Automata
Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a
136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics
1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
Notes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
Collatz Sequence. Fibbonacci Sequence. n is even; Recurrence Relation: a n+1 = a n + a n 1.
Fibonacci Roulette In this game you will be constructing a recurrence relation, that is, a sequence of numbers where you find the next number by looking at the previous numbers in the sequence. Your job
Notes on Richard Dedekind s Was sind und was sollen die Zahlen?
Notes on Richard Dedekind s Was sind und was sollen die Zahlen? David E. Joyce, Clark University December 2005 Contents Introduction 2 I. Sets and their elements. 2 II. Functions on a set. 5 III. One-to-one
INCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
6.3 Conditional Probability and Independence
222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted
Scheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
The Relation between Two Present Value Formulae
James Ciecka, Gary Skoog, and Gerald Martin. 009. The Relation between Two Present Value Formulae. Journal of Legal Economics 15(): pp. 61-74. The Relation between Two Present Value Formulae James E. Ciecka,
The Halting Problem is Undecidable
185 Corollary G = { M, w w L(M) } is not Turing-recognizable. Proof. = ERR, where ERR is the easy to decide language: ERR = { x { 0, 1 }* x does not have a prefix that is a valid code for a Turing machine
Reminder: Complexity (1) Parallel Complexity Theory. Reminder: Complexity (2) Complexity-new
Reminder: Complexity (1) Parallel Complexity Theory Lecture 6 Number of steps or memory units required to compute some result In terms of input size Using a single processor O(1) says that regardless of
University of Ostrava. Reasoning in Description Logic with Semantic Tableau Binary Trees
University of Ostrava Institute for Research and Applications of Fuzzy Modeling Reasoning in Description Logic with Semantic Tableau Binary Trees Alena Lukasová Research report No. 63 2005 Submitted/to
a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
A Formal Model of Program Dependences and Its Implications for Software Testing, Debugging, and Maintenance
A Formal Model of Program Dependences and Its Implications for Software Testing, Debugging, and Maintenance Andy Podgurski Lori A. Clarke Computer Engineering & Science Department Case Western Reserve
On Integer Additive Set-Indexers of Graphs
On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that
Lecture 2: Universality
CS 710: Complexity Theory 1/21/2010 Lecture 2: Universality Instructor: Dieter van Melkebeek Scribe: Tyson Williams In this lecture, we introduce the notion of a universal machine, develop efficient universal
The Ergodic Theorem and randomness
The Ergodic Theorem and randomness Peter Gács Department of Computer Science Boston University March 19, 2008 Peter Gács (Boston University) Ergodic theorem March 19, 2008 1 / 27 Introduction Introduction
10.2 Series and Convergence
10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and
Catalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.
7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,
[Refer Slide Time: 05:10]
Principles of Programming Languages Prof: S. Arun Kumar Department of Computer Science and Engineering Indian Institute of Technology Delhi Lecture no 7 Lecture Title: Syntactic Classes Welcome to lecture
The Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
CSG 399 Lecture. The Inductive Approach to Protocol Analysis p.1
The Inductive Approach to Protocol Analysis CSG 399 Lecture The Inductive Approach to Protocol Analysis p.1 Last Time CSP approach: Model system as a CSP process A specification is a property of traces
Measuring the Performance of an Agent
25 Measuring the Performance of an Agent The rational agent that we are aiming at should be successful in the task it is performing To assess the success we need to have a performance measure What is rational
9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.
Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three
(Refer Slide Time: 01.26)
Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture # 27 Pigeonhole Principle In the next few lectures
(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.
(LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of first-order logic will use the following symbols: variables connectives (,,,,
STATISTICS AND DATA ANALYSIS IN GEOLOGY, 3rd ed. Clarificationof zonationprocedure described onpp. 238-239
STATISTICS AND DATA ANALYSIS IN GEOLOGY, 3rd ed. by John C. Davis Clarificationof zonationprocedure described onpp. 38-39 Because the notation used in this section (Eqs. 4.8 through 4.84) is inconsistent
Cost Model: Work, Span and Parallelism. 1 The RAM model for sequential computation:
CSE341T 08/31/2015 Lecture 3 Cost Model: Work, Span and Parallelism In this lecture, we will look at how one analyze a parallel program written using Cilk Plus. When we analyze the cost of an algorithm
Mathematics Review for MS Finance Students
Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
Mining the Software Change Repository of a Legacy Telephony System
Mining the Software Change Repository of a Legacy Telephony System Jelber Sayyad Shirabad, Timothy C. Lethbridge, Stan Matwin School of Information Technology and Engineering University of Ottawa, Ottawa,
Finite covers of a hyperbolic 3-manifold and virtual fibers.
Claire Renard Institut de Mathématiques de Toulouse November 2nd 2011 Some conjectures. Let M be a hyperbolic 3-manifold, connected, closed and oriented. Theorem (Kahn, Markovic) The fundamental group
Automata-based Verification - I
CS3172: Advanced Algorithms Automata-based Verification - I Howard Barringer Room KB2.20: email: [email protected] March 2006 Supporting and Background Material Copies of key slides (already
ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS
ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS DOV TAMARI 1. Introduction and general idea. In this note a natural problem arising in connection with so-called Birkhoff-Witt algebras of Lie
Lights and Darks of the Star-Free Star
Lights and Darks of the Star-Free Star Edward Ochmański & Krystyna Stawikowska Nicolaus Copernicus University, Toruń, Poland Introduction: star may destroy recognizability In (finitely generated) trace
Warm up. Connect these nine dots with only four straight lines without lifting your pencil from the paper.
Warm up Connect these nine dots with only four straight lines without lifting your pencil from the paper. Sometimes we need to think outside the box! Warm up Solution Warm up Insert the Numbers 1 8 into
T-79.186 Reactive Systems: Introduction and Finite State Automata
T-79.186 Reactive Systems: Introduction and Finite State Automata Timo Latvala 14.1.2004 Reactive Systems: Introduction and Finite State Automata 1-1 Reactive Systems Reactive systems are a class of software
The Trip Scheduling Problem
The Trip Scheduling Problem Claudia Archetti Department of Quantitative Methods, University of Brescia Contrada Santa Chiara 50, 25122 Brescia, Italy Martin Savelsbergh School of Industrial and Systems
The Set Data Model CHAPTER 7. 7.1 What This Chapter Is About
CHAPTER 7 The Set Data Model The set is the most fundamental data model of mathematics. Every concept in mathematics, from trees to real numbers, is expressible as a special kind of set. In this book,
virtual class local mappings semantically equivalent local classes ... Schema Integration
Data Integration Techniques based on Data Quality Aspects Michael Gertz Department of Computer Science University of California, Davis One Shields Avenue Davis, CA 95616, USA [email protected] Ingo
Normalization. Reduces the liklihood of anomolies
Normalization Normalization Tables are important, but properly designing them is even more important so the DBMS can do its job Normalization the process for evaluating and correcting table structures
Notes on Complexity Theory Last updated: August, 2011. Lecture 1
Notes on Complexity Theory Last updated: August, 2011 Jonathan Katz Lecture 1 1 Turing Machines I assume that most students have encountered Turing machines before. (Students who have not may want to look
I. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
Chapter 6: Episode discovery process
Chapter 6: Episode discovery process Algorithmic Methods of Data Mining, Fall 2005, Chapter 6: Episode discovery process 1 6. Episode discovery process The knowledge discovery process KDD process of analyzing
Section IV.21. The Field of Quotients of an Integral Domain
IV.21 Field of Quotients 1 Section IV.21. The Field of Quotients of an Integral Domain Note. This section is a homage to the rational numbers! Just as we can start with the integers Z and then build the
CS473 - Algorithms I
CS473 - Algorithms I Lecture 4 The Divide-and-Conquer Design Paradigm View in slide-show mode 1 Reminder: Merge Sort Input array A sort this half sort this half Divide Conquer merge two sorted halves Combine
6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games
6.254 : Game Theory with Engineering Applications Lecture 2: Strategic Form Games Asu Ozdaglar MIT February 4, 2009 1 Introduction Outline Decisions, utility maximization Strategic form games Best responses
CS103B Handout 17 Winter 2007 February 26, 2007 Languages and Regular Expressions
CS103B Handout 17 Winter 2007 February 26, 2007 Languages and Regular Expressions Theory of Formal Languages In the English language, we distinguish between three different identities: letter, word, sentence.
Development of dynamically evolving and self-adaptive software. 1. Background
Development of dynamically evolving and self-adaptive software 1. Background LASER 2013 Isola d Elba, September 2013 Carlo Ghezzi Politecnico di Milano Deep-SE Group @ DEIB 1 Requirements Functional requirements
Automata and Computability. Solutions to Exercises
Automata and Computability Solutions to Exercises Fall 25 Alexis Maciel Department of Computer Science Clarkson University Copyright c 25 Alexis Maciel ii Contents Preface vii Introduction 2 Finite Automata
