Computational Models: Class 6
|
|
- Emil Bell
- 5 years ago
- Views:
Transcription
1 Computational Models: Class 6 Benny Chor School of Computer Science Tel Aviv University November 23, 2015 Based on slides by Maurice Herlihy, Brown University, and modifications by Iftach Haitner and Yishay Mansour. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
2 Backing Up Homework Submissions We had a number of cases where submitted homework assignments were lost. Please scan your hard copy submission and save it. If your submitted assignment disappears, you will be asked to the scanned copy to the grader. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
3 And Now for Something Completely Different: A General Model of Computing Tel Aviv shoreline, looking south from the marina towards Jaffa, November 26, Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
4 Class 6: Outline A General Model of Computing: Turing Machines (TMs) Alternative Models of Computers Multitape TMs, RAMs, Non Deterministic TMs The Church Turing thesis The language classes R = RE core Sipser s book, 3.1, 3.2, & 3.3 Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
5 A Finite Automaton Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
6 A Pushdown Automaton Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
7 A Turing Machine Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
8 Part I Turing Machines (TMs) Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
9 Turing Machines Machines so far (DFA, PDA) read input only once Turing Machines Can back up over the input Can overwrite the input Can write information on tape and come back to it later Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
10 Turing Machines Input string is written on a tape: At each step, machine reads a symbol, and then writes a new symbol, and either moves read/write head to right, or moves read/write head to left Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
11 TM vs. PDA vs. DFA A DFA has no media for writing it must all be in its finite state. A PDA is restricted to reading from the stack in LIFO manner. A Turing machine can both write on the tape and read from it. The TM read-write head can move both to the left and to the right. The TM read-write tape is infinite to the right, but at any given instance, only a finite portion of it is utilized. The special final (accepting/rejecting) states of TM take immediate effect (so the head need not be at some special position, and input need not be exhausted). Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
12 Effects of A Single Step In a single step, the machine changes current state, current head position and tape content at current position. Each step has very local, small effect. But many small effects can accumulate to a meaningful task. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
13 Example B = {w#w w {0, 1} } Algorithm 1 (A pseudocode" for TM accepting the language B) 1 Check that input contains a single #, If false then reject. 2 Zig-zag across the tape, check identical 0 and identical 1 on two sides of #, and replace them by X. If not identical, reject. 3 When all the letters to the left of the # are marked X, check for remaining letters right of # If there remaining letters are reject, otherwise accept. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
14 Execution Example for TM on input # # X # X # X # X X # X X # X X X # X X X X X X X # X X X X X X = accept Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
15 The Transition Function, δ Let us first understand this function δ : Q Γ Q Γ {L, R}. where δ(q, a) = (p, b, L) means: in state q where head reads tape symbol a, the machine: writes b over a (a = b is possible), moves the head left (this is what the L stands for), enters state p. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
16 The Transition Function, δ (2) The transition function, now with a move to the right δ(q, a) = (p, b, R) means: in state q where head reads tape symbol a, the machine: writes b over a (a = b is possible), moves the head right (this is what the R stands for), enters state p. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
17 Turing Machine Formal Definition Definition 2 (Turing machine) A Turing machine (TM) is a 7-tuple (Q, Σ, Γ, δ, q 0, q a, q r ), where Q is a finite set of states, Σ the input alphabet, not containing the blank symbol Γ is the tape alphabet, where Γ and Σ Γ. δ : Q Γ Q Γ {L, R} is the transition function, q 0 Q is the start state, q a Q is the accept state, and q r Q is the reject state. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
18 Model of Computation Before we start: an input of length n, w = w 1 w 2... w n Σ is placed on n leftmost tape squares, one tape square per input letter. Rest of tape contains blanks since Σ, leftmost blank indicates end of input. read/write head is on leftmost square of tape The computation": M computes" according to transition function δ. Computation continues until q a or q r is reached. Otherwise M runs forever. If M tries to move head beyond left-hand-end of tape, it doesn t move (still M does not crash) Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
19 TM Configurations A TM configuration is a convenient notation for recording the state, head location, and tape contents of a TM in a given instant. Think of it as a snapshot. For example, configuration 1011q means: Current state is q 7, left hand side of tape (to the left of the head) is 1011, right hand side of tape is 0111, and head is on 0 (leftmost entry of right hand side). Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
20 Configurations: The Yield Relation If δ(q i, b) = (q j, c, L), then configuration uaq i bv yields configuration uq j acv. If δ(q i, b) = (q j, c, R), then configuration uaq i bv yields configuration uacq j v. Special case (1): when head is at left end and tries to move left, it changes state and writes on tape but does not move, so if δ(q i, b) = (q j, c, L), configuration q i bv yields q j cv. Special case (2): What happens when head is at right end? We let wq i and wq i denote the same configuration, so moves to the right can now be accomodated. The new configuration is longer as it annexed one blank. This allows configurations to grow in length with computation. Yet at any given moment, they are finitely long. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
21 Special Configurations Starting configuration: q 0 w Accepting configuration: w 0 q a w 1 Rejecting configuration: w 0 q r w 1 Halting configurations: w 0 q a w 1 and w 0 q r w 1 Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
22 Accepting a Language A Turing machine M accepts an input w, if there is a sequence of configurations C 1, C 2,..., C k such that C 1 is the start configuration of M on w, each C i yields C i+1, C k is an accepting configuration. The collection of strings accepted by M is called the language of M, and is denoted L(M). Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
23 Enumerable Languages, the Class RE Definition 3 A language L is called recursively enumerable if some Turing machine accepts L. (in the textbook, this is called Turing-recognizable) Definition 4 RE is the class of all recursively enumerable languages. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
24 TM Behavior on an Input On an input, w, a TM may accept reject loop (run forever) Major concern: In general, we never know if the TM will halt. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
25 Decider TMs Definition 5 A TM M decides a language L, if it accepts it, and M halts on every input in Σ. Namely the TM either reaches state q a (in case w L(M)) or it reaches state q r (in case w / L(M)), but it does not loop. Such TM is called a decider. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
26 Decidable Languages, the Class R Definition 6 A language L is decidable, if some Turing machine decides it. (in the textbook, this called Turing-decidable, or recursive ) Definition 7 R is the class of all decidable languages. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
27 A Minor, Technical Point Question 8 To implement algorithms, it is sometimes helpful to tell when a TM is at the left end of the tape. Answer: Mark it with a special symbol. When head reads this symbol, TM knows it is on the leftmost tape square. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
28 Part II Some Examples Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
29 Example A = {0 2n : n 0} Algorithm 9 (A TM deciding A (pseudocode)) On input w: 1 Move to the right, erasing every other 0 2 Accept if tape contains a single 0. 3 Reject if tape contains an odd number of 0 (greater than one). 4 Return to the start of the tape, and go to Step 1 Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
30 Example A = {0 2n : n 0} TM formal definition Definition 10 (M 2 = (Q, Σ, Γ, δ, q 1, q a, q r )) Q = {q 1, q 2, q 3, q 4, q 5, q a, q r } Σ = {0} input alphabet Γ = {0, x, } tape alphabet q 1 start state q a accept state q r reject state Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
31 Example A = {0 2n : n 0} Transition Function Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
32 Example B = {w#w w {0, 1} } TM formal definition Recall that we saw a pseudo code earlier in the class. Definition 11 (M 1 = (Q, Σ, Γ, δ, q 1, q a, q r )) Q = {q 1,..., q 14, q a, q r }. Σ = {0, 1, #} input alphabet Γ = {0, 1, #, x, } tape alphabet q 1 start state q a accept state q r reject state Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
33 Example B = {w#w : w {0, 1} } Transition Function Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
34 Example: C = {a i b j c k : i j = k i, j, k 1} Algorithm 12 (A TM deciding C (pseudocode)) 1 Scan from left to right to check that input is a + b + c + 2 Return to start of tape 3 Cross off one a and scan right until b occurs. Shuttle between b s and c s, crossing off one of each, until all b s are gone. 4 Restore the crossed-off b s and repeat previous step if more a s exist. If all a s crossed off, check if all c s crossed off. If yes, accept, otherwise reject. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
35 Example: Element Distinctness Consider the element distinctness problem E = {#x 1 #x 2 #... #x l : x i {0, 1} i j = x i x j } Verbally, List of strings in {0, 1} separated by # s. List is in language (& machine should accept), if all strings are different. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
36 Decider for E = {#x 1 #x 2 #... #x l : x i {0, 1} i j = x i x j } Algorithm 13 (A TM deciding E (pseudocode)) Input: w 1 Place a mark" on leftmost tape symbol. If symbol not #, reject. 2 Scan right to next # and place mark on top. If none, reject. 3 Compare the two strings to right of marked # s (how?). If equal, reject. 4 If possible, move rightmost mark to next # on right and go to Step 3. 5 If possible, move leftmost mark to next # on right and rightmost mark to # after that, and go to Step 3. 6 Accept. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
37 Decider for E = {#x 1 #x 2 #... #x l : x i {0, 1} i j = x i x j } #011#00#1111 Ok #011#00#1111 #011#00#1111 #011#00#1111 Question 14 How do we mark a symbol? Answer: For each tape symbol #, add tape symbol # to the tape alphabet Γ. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
38 Part III Alternative Strong Models of Computing Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
39 Turing Machine Variants For example, suppose the Turing machine head is allowed to stay put. δ : Q Γ Q Γ {L, R, S} Question 15 Does this add any power? Answer: No. Replace each S transition with two transitions: R then L. (ahmm... why not vice-versa?) Important notion here: Two-way emulation (model A capable of emulating model B; model B capable of emulating model A). Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
40 Multitape Turing Machines Constant number of infinite tapes Each tape has its own head Initially, input string on tape 1 and rest blank For the transition function: δ : Q Γ k Q Γ k {L, R} k, the expression δ(q i, a 1,..., a k ) = (q j, b 1,..., b k, L, R,..., L) means: Assuming the machine is in state q i and heads 1 through k reading a 1,..., a k : the machine goes to state q j, heads 1 thought k write b 1,..., b k, each head moves right or left as specified. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
41 Equivalence Of Multitape TM and Singletape TM Theorem 16 A singletape TM can emulate a multitape TM. Corollary 17 A language is enumerable [resp., decidable], if and only if there is some multitape Turing machine that accepts [resp., decides] it. One direction is trivial. To prove the other direction, we will show how to convert a multitape TM, M, into an equivalent singletape TM, S. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
42 Emulation Idea a b a... x # a b a # x #... S emulates k tapes of M by storing them all on a single tape with delimiter #. S marks the current positions of the k heads by placing above the letters in current positions. It knows which tape the mark belongs to by counting (up to k) from the # s to the left. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
43 The Emulator Algorithm 18 (The Emulator (pseudocode)) On input w = w 1 w n : 1 Write on the tape # w 1 w 2 w n # # # # 2 Scan the tape from first # to (k + 1)-st # to read symbols under virtual heads. 3 Rescan the tape to write new symbols and move heads 4 When M moves head onto unused blank square, S will try to move virtual head onto #. S handles it by writing blank on tape, and shifting the rest of tape one square to the right. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
44 Random Access Machine (RAM) CPU 3 Registers (Instruction Register (IR), Program Counter (PC), Accumulator (ACC)) Memory Operation: Increment PC Set IR MEM[PC] Execute instruction in IR Repeat Instructions are typically compare, add/subtract, multiply/divide, shift left/right. We assume no limit on the registers size All instructions above (as well as other common instructions) are doable on a TM but implementing them requires some work. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
45 RAM: Schematic Picture Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
46 RAM: Instructions Instruction Meaning 00 HALT Stop Computation 01 LOAD x ACC MEM[x] 02 LOADI x ACC x 03 STORE x MEM[x] ACC 04 ADD x ACC ACC + MEM[x] 05 ADDI x ACC ACC + x 06 SUB x ACC ACC - MEM[x] 07 SUBI x ACC ACC - x 08 JUMP x PC x 09 JZERO x PC x if ACC = 0 10 JGT x PC x if ACC > 0 Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
47 RAM: Example Program A program that multiplies two numbers (in locations 1000 & 1001), and stores the result in 1002 Memory Machine Code Assembly LOAD STORE LOADI STORE LOAD JZERO SUBI STORE LOAD ADD JUMP HALT Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
48 TM is (at least) as strong as RAM Theorem 19 A Turing machine can emulate this RAM model. Proof s idea: We can emulate the RAM model with a multi-tape Turing machine: One tape for each register (IR, PC, ACC) One tape for the Memory Memory tape will be entries of the form <address> <contents> in increasing order of addresses. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
49 Emulator s Tapes Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
50 The Emulator Algorithm 20 (Emulator (high-level description)) 1 Scan through memory until reach an address that matches the PC 2 Copy contents of memory at that address to the IR 3 Increment PC 4 Based on the instruction code: Copy a value into PC Copy a value into Memory Copy a value into the ACC Perform an arithmetic operation, a shift, or a comparison Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
51 Beyond RAM A RAM can be modeled (emulated) by a Turing Machine. Any current machine (architecture, manufacturer, operating system, power supply, etc.) can be modeled by a Turing Machine. If there is an algorithm for it, a Turning Machine can do it. Note that at this point, we don t care how long it might take, just that it can be done. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
52 Turing Completeness A computation model is called Turing Complete if it can emulate a (general) Turing Machine. Turing Complete can compute anything a TM could Of course it might not be convenient... Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
53 And Now for Something Completely Different: The Church Turing Thesis A stormy day at Tel Aviv, looking south west over the marina, November 26, Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
54 Part IV Church-Turing Thesis Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
55 What is an Algorithm? Informally: 1 A recipe 2 A procedure 3 A computer program 4 Who cares? I know it when I see it :-( 5 The notion of algorithm has long history in Mathematics (starting with Euclid s gcd algorithm), but not precisely defined until 20 th century Informal notions rarely questioned, still they were insufficient Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
56 Computation Model Many models have been proposed for general-purpose computation. Remarkably, all reasonable models were shown to be equivalent to Turing machines. The notion of an algorithm is model-independent! We don t really care about Turing machines per se. We do care about understanding computation, and because of their simplicity, Turing machines are a good model to use. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
57 Models Equivalent to TM. All reasonable programming languages (e.g., Java, Pascal, C, Python, Scheme, Mathematica, Maple, Cobol,... ). λ-calculus of Alonzo Church Turing machines of Alan Turing Recursive functions of Godel and Kleene Counter machines of Minsky Normal algorithms of Markov Unrestricted grammars Two stack automata Random access machines (RAMs) Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
58 Church-Turing Thesis The intuitive notion of reasonable models of computation equals Turing machine algorithms. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
59 Wild" Models of Computation Consider MUntel s ℵ-AXP16 c processor (to be released, Jan ) Definition 21 (ℵ-AXP16 c ) Like a Turing machine, except Takes first step in 1 second. Takes second step in 1/2 second. Takes i-th step in 2 i seconds... After 2 seconds, the ℵ-AXP16 c decides any enumerable language! Question 22 Does the ℵ-AXP16 c invalidate the Church-Turing Thesis? Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
60 Part V Non-Deterministic Turing Machines Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
61 Non-Deterministic Turing Machines Transition function: δ : Q Γ P(Q Γ {L, R}) Computation of a deterministic TM can be viewed as a path in configuration space. Computation of a non-deterministic TM (NTM) can be viewed as a tree in configuration space. NTM accepts an input if there is ( ) an accepting branch in its computation tree. NTM rejects an input if all ( ) branches in its computation tree are either rejecting or infinite (looping). Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
62 Equivalence of TM and NTM Theorem 23 A Turing Machine can emulate a non-deterministic Turing machine. Corollary 24 A language is enumerable [resp., recursive], if and only if there is some non-deterministic Turing machine that accepts [resp., decides] it. One direction is trivial. To prove the other direction, we will show how to convert a non-deterministic TM, N, into an equivalent deterministic TM, D. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
63 Basic idea D tries all possible branches If D finds any accepting branch, it accepts. If all branches reject, D rejects. If all branches reject or loop, D loops. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
64 Emulator s Tapes a b # input tape (never altered) simulation tape address tape The emulating machine D has three tapes Input tape is never altered (only read from), Emulation tape serves as N s tape, Address tape keeps track of D s location in N s computation tree. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
65 Computation Tree We view N s non-deterministic computation as a tree in the configurations space. Each tree branch is a branch of N s non-deterministic computation Each tree node is a configuration of N Root is starting configuration The number of children of each node, denoted by b, is at most the number of N s states, times the size of Γ, times 2 (left/right). D traverses this tree until if finds an accepting configuration (if any). Question 25 How to traverse this tree? depth-first search? breadth-first search? Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
66 Address Tape The address tape contains a pointer into the configuration tree. Concretely, a string in Σ b, where Σ b = {1,..., b}. Definition 26 By incrementing the value of the address tape, we mean increasing its value by 1 (in base b). Question 27 Can a TM implement the increment function? Question 28 Can a TM compute the value of the node indexed by the address tape (with respect to to a given input w)? Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
67 Simulating Non-Determinism (1) The address tape: every node in the tree has at most b children every node in the tree is assigned an address that is a string over the alphabet Σ b = {1, 2,..., b} to get to node with address 231 start at root take second child of root take third child of current node take first child of current node ignore meaningless addresses (choices not available for configuration along branch) Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
68 Simulating Non-Determinism (2) Initially, the input tape contains w, and the other two tapes are empty. Copy input tape to simulation tape. Use simulation tape to simulate N on input w on a finite portion of one non-deterministic branch. On each choice, consult the next symbol on address tape. Accept if accepting configuration reached. Skip to next step if symbols on address tape exhausted non-deterministic choice invalid rejecting configuration reached Replace string on address tape with the lexicographically next string. Jump to Step 2 to simulate this branch of N s computation. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
69 The Emulator Algorithm 29 (Emulator (pseudocode)) 1 Compute the configuration of N indexed by the address tape : 1 Copy input tape (i.e., w) to emulation tape. 2 Use emulation tape to emulate the run of N on w, using the address tape to resolve non-deterministic choices. Break current emulation, if symbols on address tape are exhausted (i.e., end of branch) non-deterministic choice is invalid rejecting configuration was reached 2 Accept if accepting configuration reached. 3 Increment the value of address tape. 4 Go back to 1. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
70 Part VI Decidability vs. Enumerability Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
71 Decidability vs. Enumerability (R = RE co RE) R the class of decidable languages. RE the class of enumerable languages co RE the class of languages whose complement is enumerable co RE = {L : L RE} L R = L RE L R = L R Thm (next slide): R = RE co RE Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
72 Theorem R = RE co RE Theorem 30 R = RE co RE. Proof: R RE co RE L R = L RE L R = L R = L RE = L co RE R RE co RE For L RE co RE, let M 1 be a TM that accepts L, and let M 2 be a TM that accepts L. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
73 Algorithm for Deciding L Algorithm 31 (M - a decider for L) Input: w. Run both M 1 and M 2 in in parallel". Accept if M 1 accepts Reject if M 2 accepts We next show that M decides L. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
74 M decides L Claim 32 M decides L Proof: Every string is in either L or in L (of course not in both). Thus either M 1 or M 2 accepts the input w. Since M halts whenever M 1 or M 2 accepts, M always halts (and hence is a decider). Moreover, M accepts strings in L and rejects strings in L. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
75 Emulating TM s In Parallel Question 33 Hey - what does it mean to emulate M 1, M 2 in parallel? Answer: M has two tapes, one for each machine. Algorithm 34 (TM M) Do (forever) 1 Emulate the next step of M 1 2 Emulate the next step of M 2 3 If this is accepting configuration for some M i, halt and return i. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
76 Revised (Brave New) View of the World of Languages Artwork on board. Benny Chor (Tel Aviv University) Computational Models, Class 6 November 23, / 75
Problem Solving Agents
Problem Solving Agents A problem solving agent is one which decides what actions and states to consider in completing a goal Examples: Finding the shortest path from one city to another 8-puzzle Problem
More informationResidual Finite States Automata
Residual Finite States Automata François Denis LIF, CMI, Université de Provence, Marseille Aurélien Lemay, Alain Terlutte Ý GRAPPA-LIFL, Université de Lille I January 7, 2002 Abstract We define a new variety
More informationUninformed Search (Ch )
1 Uninformed Search (Ch. 3-3.4) 3 Terminology review State: a representation of a possible configuration of our problem Action: -how our agent interacts with the problem -can be different depending on
More informationKnot Theory Week 2: Tricolorability
Knot Theory Week 2: Tricolorability Xiaoyu Qiao, E. L. January 20, 2015 A central problem in knot theory is concerned with telling different knots apart. We introduce the notion of what it means for two
More informationCENG 466 Artificial Intelligence. Lecture 4 Solving Problems by Searching (II)
CENG 466 Artificial Intelligence Lecture 4 Solving Problems by Searching (II) Topics Search Categories Breadth First Search Uniform Cost Search Depth First Search Depth Limited Search Iterative Deepening
More informationIntroduction. AI and Searching. Simple Example. Simple Example. Now a Bit Harder. From Hammersmith to King s Cross
Introduction AI and Searching We have seen how models of the environment allow an intelligent agent to dry run scenarios in its head without the need to act Logic allows premises to be tested Machine learning
More informationh01: Perkovic Ch1 (Introduction to CS), 2.1, 2.2 (Expr, Vars, Assignment, Strings), 2.3 (Lists, Tuples)
Name: (as it would appear on official course roster) Umail address: Optional: name you wish to be called if different from name above. Optional: name of "homework buddy" (leaving this blank signifies "I
More informationCS472 Foundations of Artificial Intelligence. Final Exam December 19, :30pm
CS472 Foundations of Artificial Intelligence Final Exam December 19, 2003 12-2:30pm Name: (Q exam takers should write their Number instead!!!) Instructions: You have 2.5 hours to complete this exam. The
More informationSolving Problems by Searching chap3 1. Problem-Solving Agents
Chapter3 Solving Problems by Searching 20070315 chap3 1 Problem-Solving Agents Reflex agents cannot work well in those environments - state/action mapping too large - take too long to learn Problem-solving
More informationPlanning and Acting in Partially Observable Stochastic Domains
Planning and Acting in Partially Observable Stochastic Domains Leslie Pack Kaelbling and Michael L. Littman and Anthony R. Cassandra (1998). Planning and Acting in Partially Observable Stochastic Domains,
More informationUninformed Search (Ch )
1 Uninformed Search (Ch. 3-3.4) 7 Small examples 8-Queens: how to fit 8 queens on a 8x8 board so no 2 queens can capture each other Two ways to model this: Incremental = each action is to add a queen to
More informationSearch I. Tuomas Sandholm Carnegie Mellon University Computer Science Department. [Read Russell & Norvig Chapter 3]
Search I Tuomas Sandholm Carnegie Mellon University Computer Science Department [Read Russell & Norvig Chapter 3] Search I Goal-based agent (problem solving agent) Goal formulation (from preferences).
More informationInverting a Batting Average - an Application of Continued Fractions (Preliminary Version)
Inverting a Batting Average - an Application of Continued Fractions (Preliminary Version) Allen Back August 30, 2000 Contents Introduction and Motivation 2 Continued Fractions 2 2. Comparison of Two Numbers
More informationTERMINATION FOR HYBRID TABLEAUS
TERMINATION FOR HYBRID TABLEAUS THOMAS BOLANDER AND PATRICK BLACKBURN Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Braüner [5]. Their
More informationTRINITY COLLEGE DUBLIN
TRINITY COLLEGE DUBLIN COLÁISTE NA TRÍONÓIDE, BAILE ÁTHA CLIATH On the Semantics of Markov Automata Yuxin Deng 1 Matthew Hennessy 21 1 Shanghai Jiao Tong University 2 Trinity College Dublin Computer Science
More informationLecture 1: Knot Theory
Math 7H Professor: Padraic Bartlett Lecture 1: Knot Theory Week 1 UCSB 015 1 Introduction Outside of mathematics, knots are ways to loop a single piece of string around itself: In mathematics, we mean
More informationCSE 3401: Intro to AI & LP Uninformed Search II
CSE 3401: Intro to AI & LP Uninformed Search II Required Readings: R & N Chapter 3, Sec. 1-4. 1 {Arad}, {Zerind, Timisoara, Sibiu}, {Zerind, Timisoara, Arad, Oradea, Fagaras, RimnicuVilcea }, {Zerind,
More informationUninformed search strategies
AIMA sections 3.4,3.5 search use only the information available in the problem denition Breadth-rst search Uniform-cost search Depth-rst search Depth-limited search Iterative deepening search Breadth-rst
More informationApplication of Bayesian Networks to Shopping Assistance
Application of Bayesian Networks to Shopping Assistance Yang Xiang, Chenwen Ye, and Deborah Ann Stacey University of Guelph, CANADA Abstract. We develop an on-line shopping assistant that can help a e-shopper
More informationTransposition Table, History Heuristic, and other Search Enhancements
Transposition Table, History Heuristic, and other Search Enhancements Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract Introduce heuristics for improving the efficiency
More informationPrincess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) Computer Science Department
Princess Nora University Faculty of Computer & Information Systems 1 ARTIFICIAL INTELLIGENCE (CS 370D) Computer Science Department (CHAPTER-3-PART2) PROBLEM SOLVING AND SEARCH (Course coordinator) Searching
More informationAlgorithms and Data Structures
Algorithms and Data Structures CMPSC 465 LECTURES 22-23 Binary Search Trees Adam Smith S. Raskhodnikova and A. Smith. Based on slides by C. Leiserson and E. Demaine. 1 Heaps: Review Heap-leap-jeep-creep(A):
More informationProblem Solving as Search - I
Problem Solving as Search - I Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University Slides prepared from Artificial Intelligence A Modern approach by Russell & Norvig Problem-Solving
More informationBalanced Binary Trees
CSE : AVL TREES 2 Balanced Binary Trees Recall: Worst case for find in a BST is : Worst case for find in a Balanced BST is: 3 Balanced Binary Trees Deterministic Balancing Change insert and delete operations
More informationUninformed search methods
Lecture 3 Uninformed search methods Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework 1 Access through the course web page http://www.cs.pitt.edu/~milos/courses/cs2710/ Two
More informationBreaking Up is Hard to Do: An Investigation of Decomposition for Assume-Guarantee Reasoning
Breaking Up is Hard to Do: An Investigation of Decomposition for Assume-Guarantee Reasoning Jamieson M. Cobleigh Dept. of Computer Science University of Massachusetts Amherst, MA 01003, USA jcobleig@cs.umass.edu
More informationCT PET-2018 Part - B Phd COMPUTER APPLICATION Sample Question Paper
CT PET-2018 Part - B Phd COMPUTER APPLICATION Sample Question Paper Note: All Questions are compulsory. Each question carry one mark. 1. Error detection at the data link layer is achieved by? [A] Bit stuffing
More informationUninformed search methods II.
CS 2710 Foundations of AI Lecture 4 Uninformed search methods II. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework assignment 1 is out Due on Tuesday, September 12, 2017 before
More informationA Finite Model Theorem for the Propositional µ-calculus
A Finite Model Theorem for the Propositional µ-calculus Dexter Kozen Department of Computer Science Cornell University Ithaca, New York 14853-7501 Abstract We prove a finite model theorem and infinitary
More informationUninformed search methods II.
CS 1571 Introduction to AI Lecture 5 Uninformed search methods II. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Uninformed methods Uninformed search methods use only information available in
More informationUninformed Search Strategies
Uninformed Search Strategies Instructor: Dr. Wei Ding Fall 2010 1 Uninformed Search Strategies Also called blind search. Have no additional information about states beyond that provided in the problem
More informationFrom Bombe stops to Enigma keys
From Bombe stops to Enigma keys A remarkably succinct description of the Bombe written many years ago, reads as follows:- The apparatus for breaking Enigma keys, by testing a crib and its implications
More informationReal World Search Problems. CS 331: Artificial Intelligence Uninformed Search. Simpler Search Problems. Example: Oregon. Search Problem Formulation
Real World Search Problems S 331: rtificial Intelligence Uninformed Search 1 2 Simpler Search Problems ssumptions bout Our Environment Fully Observable Deterministic Sequential Static Discrete Single-agent
More informationOptimizing Cyclist Parking in a Closed System
Optimizing Cyclist Parking in a Closed System Letu Qingge, Killian Smith Gianforte School of Computing, Montana State University, Bozeman, MT 59717, USA Abstract. In this paper, we consider the two different
More information1.1 The size of the search space Modeling the problem Change over time Constraints... 21
Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 I What Are the Ages of My Three Sons? : : : : : : : : : : : : : : : : : 9 1 Why Are Some Problems Dicult to Solve? : : :
More information/435 Artificial Intelligence Fall 2015
Final Exam 600.335/435 Artificial Intelligence Fall 2015 Name: Section (335/435): Instructions Please be sure to write both your name and section in the space above! Some questions will be exclusive to
More informationUninformed search methods
Lecture 3 Uninformed search methods Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework assignment 1 is out Due on Tuesday, September 12, 2017 before the lecture Report and programming
More informationSyntax and Parsing II
Syntax and Parsing II Dependency Parsing Slav Petrov Google Thanks to: Dan Klein, Ryan McDonald, Alexander Rush, Joakim Nivre, Greg Durrett, David Weiss Lisbon Machine Learning School 2015 Notes for 2016
More informationCritical Systems Validation
Critical Systems Validation Objectives To explain how system reliability can be measured and how reliability growth models can be used for reliability prediction To describe safety arguments and how these
More informationProvider ICD 10 Compliant Release A S K E S I S W E B I N A R F E B R U A R Y 1 9,
Provider 7.2.6 ICD 10 Compliant Release A S K E S I S W E B I N A R F E B R U A R Y 1 9, 2 0 1 4 Agenda ICD 10 overview Application development path to compliance Objectives Components CMS 1500 Documentation
More informationSEARCH TREE. Generating the children of a node
SEARCH TREE Node: State in state tree Root node: Top of state tree Children: Nodes that can be reached from a given node in 1 step (1 operator) Expanding: Generating the children of a node Open: Closed:
More informationChapter 4 (sort of): How Universal Are Turing Machines? CS105: Great Insights in Computer Science
Chapter 4 (sort of): How Universal Are Turing Machines? CS105: Great Insights in Computer Science Some Probability Theory If event has probability p, 1/p tries before it happens (on average). If n distinct
More informationDESIGN AND ANALYSIS OF ALGORITHMS (DAA 2017)
DESIGN AND ANALYSIS OF ALGORITHMS (DAA 2017) Veli Mäkinen 12/05/2017 1 COURSE STRUCTURE 7 weeks: video lecture -> demo lecture -> study group -> exercise Video lecture: Overview, main concepts, algorithm
More informationOnline Companion to Using Simulation to Help Manage the Pace of Play in Golf
Online Companion to Using Simulation to Help Manage the Pace of Play in Golf MoonSoo Choi Industrial Engineering and Operations Research, Columbia University, New York, NY, USA {moonsoo.choi@columbia.edu}
More informationBetter Search Improved Uninformed Search CIS 32
Better Search Improved Uninformed Search CIS 32 Functionally PROJECT 1: Lunar Lander Game - Demo + Concept - Open-Ended: No One Solution - Menu of Point Options - Get Started NOW!!! - Demo After Spring
More informationExtensive Games with Perfect Information
Extensive Games with Perfect Information A strategic situation in which players play a game over time. At the point of making the decision, players are informed about the action chosen before by the others.
More informationThe system design must obey these constraints. The system is to have the minimum cost (capital plus operating) while meeting the constraints.
Computer Algorithms in Systems Engineering Spring 2010 Problem Set 6: Building ventilation design (dynamic programming) Due: 12 noon, Wednesday, April 21, 2010 Problem statement Buildings require exhaust
More informationDecision Trees. an Introduction
Decision Trees an Introduction Outline Top-Down Decision Tree Construction Choosing the Splitting Attribute Information Gain and Gain Ratio Decision Tree An internal node is a test on an attribute A branch
More informationOPTIMAL FLOWSHOP SCHEDULING WITH DUE DATES AND PENALTY COSTS
J. Operation Research Soc. of Japan VoJ. 1, No., June 1971. 1971 The Operations Research Society of Japan OPTMAL FLOWSHOP SCHEDULNG WTH DUE DATES AND PENALTY COSTS JATNDER N.D. GUPTA Assistant Professor,
More informationTraveling Waves vs. Standing Waves
The Physics Classroom» Physics Tutorial» Waves» Traveling Waves vs. Standing Waves Waves - Lesson 4 - Standing Waves Traveling Waves vs. Standing Waves Traveling Waves vs. Standing Waves Formation of Standing
More informationCMSC131. Introduction to Computational Thinking. (with links to some external Scratch exercises) How do you accomplish a task?
CMSC131 Introduction to Computational Thinking (with links to some external Scratch exercises) How do you accomplish a task? When faced with a task, we often need to undertake several steps to accomplish
More informationUsing Markov Chains to Analyze a Volleyball Rally
1 Introduction Using Markov Chains to Analyze a Volleyball Rally Spencer Best Carthage College sbest@carthage.edu November 3, 212 Abstract We examine a volleyball rally between two volleyball teams. Using
More informationCSC384: Introduction to Artificial Intelligence. Search
CSC384: Introduction to Artificial Intelligence Search Chapter 3 of R&N 3 rd edition is very useful reading. Chapter 4 of R&N 3 rd edition is worth reading for enrichment. We ll touch upon some of the
More informationUrban OR: Quiz 2 Solutions (2003) ( 1 ρ 1 )( 1 ρ 1 ρ 2 ) ( 1 12 )( ) σ S ] 24 [ 2 = 60, 2 2 ] ( 2 ) 3
Problem 1: (a) Wo = ƒ λ Urban OR: Quiz 2 Solutions (2003) 2 2 E [ S i ] 12 1 12 9 i = + = 1 min i = 1 2 60 2 60 2 W W = o 1 q1 = = 1. 25 min ( 1 ρ 1 ) ( 1 12 ) 60 W W = o 1 q2 = = 6. 25 min ( 1 ρ 1 )(
More informationLecture 1 Temporal constraints: source and characterization
Real-Time Systems Lecture 1 Temporal constraints: source and characterization Basic concepts about real-time Requirements of Real-Time Systems Adapted from the slides developed by Prof. Luís Almeida for
More informationECO 199 GAMES OF STRATEGY Spring Term 2004 Precept Materials for Week 3 February 16, 17
ECO 199 GAMES OF STRATEGY Spring Term 2004 Precept Materials for Week 3 February 16, 17 Illustration of Rollback in a Decision Problem, and Dynamic Games of Competition Here we discuss an example whose
More informationArtificial Intelligence. Uninformed Search Strategies
Artificial Intelligence Uninformed search strategies Uninformed Search Strategies Uninformed strategies use only the information available in the problem definition Also called Blind Search No info on
More informationCSE 3402: Intro to Artificial Intelligence Uninformed Search II
CSE 3402: Intro to Artificial Intelligence Uninformed Search II Required Readings: Chapter 3, Sec. 1-4. 1 {Arad}, {Zerind, Timisoara, Sibiu}, {Zerind, Timisoara, Arad, Oradea, Fagaras, RimnicuVilcea },
More informationENHANCED PARKWAY STUDY: PHASE 2 CONTINUOUS FLOW INTERSECTIONS. Final Report
Preparedby: ENHANCED PARKWAY STUDY: PHASE 2 CONTINUOUS FLOW INTERSECTIONS Final Report Prepared for Maricopa County Department of Transportation Prepared by TABLE OF CONTENTS Page EXECUTIVE SUMMARY ES-1
More informationThe Game of Yinsh (Phase II)
The Game of Yinsh (Phase II) COL333 October 27, 2018 1 Goal The goal of this assignment is to learn the adversarial search algorithms (minimax and alpha beta pruning), which arise in sequential deterministic
More informationBulgarian Olympiad in Informatics: Excellence over a Long Period of Time
Olympiads in Informatics, 2017, Vol. 11, 151 158 2017 IOI, Vilnius University DOI: 10.15388/ioi.2017.12 151 Bulgarian Olympiad in Informatics: Excellence over a Long Period of Time Emil KELEVEDJIEV 1,
More informationDiscrete Math 2/10/19
Discrete Math Instructor s Information: Name: Dr. Najah Al-shanableh Office hours: Sunday and Tuesday : 9:30-11:00 am Monday and Wednesday: 11:00 am 12:00 pm E-Mail: najah2746@aabu.edu.jo Office Tel.:
More informationSUPPLEMENT MATERIALS
SUPPLEMENT MATERIALS This document provides the implementation details of LW-FQZip 2 and the detailed experimental results of the comparison studies. 1. Implementation details of LW-FQZip 2 LW-FQZip 2
More informationControl System Nur Istianah-THP-FTP-UB-2014
Control System Control System Control is the process of causing a system variable to conform to some desired value. Manual control Automatic control (involving machines only). A control system is an interconnection
More informationA Point-Based Algorithm to Generate Final Table States of Football Tournaments
International Journal of Computing Academic Research (IJCAR) ISSN 2305-9184, Volume 7, Number 3 (June 2018), pp.38-42 MEACSE Publications http://www.meacse.org/ijcar A Point-Based Algorithm to Generate
More informationFree Computer Design Tools For The Richard Joyner Offset Pendant Chucks By: Bill Kloepping, February 2018
Free Computer Design Tools For The Richard Joyner Offset Pendant Chucks By: Bill Kloepping, February 2018 Free Excel spreadsheets allow you to quickly see how different chuck set-up combinations look when
More informationNCSS Statistical Software
Chapter 256 Introduction This procedure computes summary statistics and common non-parametric, single-sample runs tests for a series of n numeric, binary, or categorical data values. For numeric data,
More informationGame Theory (MBA 217) Final Paper. Chow Heavy Industries Ty Chow Kenny Miller Simiso Nzima Scott Winder
Game Theory (MBA 217) Final Paper Chow Heavy Industries Ty Chow Kenny Miller Simiso Nzima Scott Winder Introduction The end of a basketball game is when legends are made or hearts are broken. It is what
More informationThe Evolution of Transport Planning
The Evolution of Transport Planning On Proportionality and Uniqueness in Equilibrium Assignment Michael Florian Calin D. Morosan Background Several bush-based algorithms for computing equilibrium assignments
More informationa fraction rock star in no time! This is a free calculator for adding, subtracting, multiplying, and dividing two fractions and/or mixed numbers.
Fraction calculator The longest markings will be the quarter inch markings, ie. the first marking is 1/4 inch, the second is 1/2 (2/4) inch, the third is 3/4 inch. Calculate 3/4 by long division of 3 divided
More informationArithmetic Coding Modification to Compress SMS
G8-5 2011 International Conference on Electrical Engineering and Informatics 17-19 July 2011, Bandung, Indonesia Arithmetic Coding Modification to Compress SMS Ario Yudo Husodo #1, Rinaldi Munir *2 #*
More informationCS 173: Discrete Structures, Spring 2010 Homework 9 Solutions
CS 173: Discrete Structures, Spring 010 Homework 9 Solutions This homework contains 5 prolems worth a total of 5 regular points. 1. Off to the races! [10 points] You decide to take in a day of races at
More informationCRICKET ONTOLOGY. Project Description :- Instructor :- Prof: Navjyothi Singh
Instructor :- Prof: Navjyothi Singh CRICKET ONTOLOGY Project Team :- PV Sai Krishna (200402036) Abhilash I (200501004) Phani Chaitanya (200501076) Kranthi Reddy (200502008) Vidyadhar Rao (200601100) Project
More informationA handy systematic method for data hazards detection in an instruction set of a pipelined microprocessor
A hy systematic method for data hazards detection in an instruction set of a pipelined microprocessor Ahmed M Mahran Computer Systems Engineering Department, Faculty of Engineering, Alexria University,
More informationScarborough Spring 2013 Math Exam I 1. "On my honor, as an Aggie, I have neither given nor received unauthorized aid on this academic work.
Scarborough Spring 2013 Math 365-501 Exam I 1 Math 365 Exam 1 Spring 2013 Scarborough NEATLY PRINT NAME: STUDENT ID: DATE: "On my honor, as an Aggie, I have neither given nor received unauthorized aid
More informationPetacat: Applying ideas from Copycat to image understanding
Petacat: Applying ideas from Copycat to image understanding How Streetscenes Works (Bileschi, 2006) 1. Densely tile the image with windows of different sizes. 2. HMAX C2 features are computed in each window.
More informationFor IEC use only. Technical Committee TC3: Information structures, documentation and graphical symbols
For IEC use only 3/686/INF 2003-08 INTERNATIONAL ELECTROTECHNICAL COMMISSION Technical Committee TC3: Information structures, documentation and graphical symbols Labels to be used in database standards
More informationSafety Criticality Analysis of Air Traffic Management Systems: A Compositional Bisimulation Approach
Third SESAR Innovation Days 26 28 November 2013, KTH, Stockholm, Sweden Safety Criticality Analysis of Air Traffic Management Systems: A Compositional Bisimulation Approach Elena De Santis, Maria Domenica
More informationFirst-Server Advantage in Tennis Matches
First-Server Advantage in Tennis Matches Iain MacPhee and Jonathan Rougier Department of Mathematical Sciences University of Durham, U.K. Abstract We show that the advantage that can accrue to the server
More information4. Please Do Break the Crystal
4. Please Do Break the Crystal Tell the broken plate you are sorry. Mary Robertson. Programming constructs and algorithmic paradigms covered in this puzzle: Break statements, radix representations. You
More informationReduction of Bitstream Transfer Time in FPGA
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 9, Issue 2, Ver. III (Mar - Apr. 2014), PP 82-86 Reduction of Bitstream Transfer Time in
More informationDepth-bounded Discrepancy Search
Depth-bounded Discrepancy Search Toby Walsh* APES Group, Department of Computer Science University of Strathclyde, Glasgow Gl 1XL. Scotland tw@cs.strath.ac.uk Abstract Many search trees are impractically
More informationQueue analysis for the toll station of the Öresund fixed link. Pontus Matstoms *
Queue analysis for the toll station of the Öresund fixed link Pontus Matstoms * Abstract A new simulation model for queue and capacity analysis of a toll station is presented. The model and its software
More informationReliability Analysis Including External Failures for Low Demand Marine Systems
Reliability Analysis Including External Failures for Low Demand Marine Systems KIM HyungJu a*, HAUGEN Stein a, and UTNE Ingrid Bouwer b a Department of Production and Quality Engineering NTNU, Trondheim,
More informationAnalysis of Professional Cycling Results as a Predictor for Future Success
Analysis of Professional Cycling Results as a Predictor for Future Success Alex Bertrand Introduction As a competitive sport, road cycling lies in a category nearly all its own. Putting aside the sheer
More informationarxiv: v1 [stat.ap] 18 Nov 2018
Modeling Baseball Outcomes as Higher-Order Markov Chains Jun Hee Kim junheek1@andrew.cmu.edu Department of Statistics & Data Science, Carnegie Mellon University arxiv:1811.07259v1 [stat.ap] 18 Nov 2018
More informationNUMB3RS Activity: Walkabout. Episode: Mind Games
Teacher Page 1 NUMB3RS Activity: Walkabout Topic: Random Walks & Grade Level: 8-12 Objective: Learn about random walks and use them to compute an approximation to. Materials: TI-83/84 Plus calculator or
More informationTechnology. In the My Files [My Files] submenu you can store all the programs that you have made on the NXT or downloaded from your computer.
NXT Main Menu My Files Files are automatically placed into the appropriate folders. When you download a program using a Sound file to the NXT, the program will be placed under Software files while the
More informationRepetition Structures
Repetition Structures Chapter 5 5-1 Chapter 5 Objectives The Loop Instruction The While Instruction Nested Loops 5-2 The Loop Instruction Simple control structure allows o Instruction (or block of instructions)
More informationLossless Comparison of Nested Software Decompositions
Lossless Comparison of Nested Software Decompositions Mark Shtern and Vassilios Tzerpos York University Toronto, Ontario, Canada {mark,bil}@cse.yorku.ca Abstract Reverse engineering legacy software systems
More informationif all agents follow RSS s interpretation then there will be zero accidents.
RSS Concept RSS - Mobileye SFF - Nvidia Safety Goal Guaranteeing that an agent will never be involved in an accident is impossible. Hence, our ultimate goal is to guarantee that an agent will be careful
More informationReliable Real-Time Recognition of Motion Related Human Activities using MEMS Inertial Sensors
Reliable Real-Time Recognition of Motion Related Human Activities using MEMS Inertial Sensors K. Frank,, y; M.J. Vera-Nadales, University of Malaga, Spain; P. Robertson, M. Angermann, v36 Motivation 2
More informationDecision Trees. Nicholas Ruozzi University of Texas at Dallas. Based on the slides of Vibhav Gogate and David Sontag
Decision Trees Nicholas Ruozzi University of Texas at Dallas Based on the slides of Vibhav Gogate and David Sontag Announcements Course TA: Hao Xiong Office hours: Friday 2pm-4pm in ECSS2.104A1 First homework
More informationA computational study of on-demand accuracy level decomposition for twostage stochastic programs
A computational study of on-demand accuracy level decomposition for twostage stochastic programs Christian Wolf, Universität Paderborn, Germany Csaba I. Fábián, Kecskemét College, Hungary Achim Koberstein,
More informationComp115: Databases. Relational Algebra
Comp115: Databases Relational Algebra Instructor: Manos Athanassoulis Up to now we have been discussing how to: (i) model the requirements (ii) translate them into relational schema (iii) refine the schema
More informationSolenoid Valves used in Safety Instrumented Systems
I&M V9629R1 Solenoid Valves used in Safety Instrumented Systems Operating Manual in accordance with IEC 61508 ASCO Valves Page 1 of 7 Table of Contents 1 Introduction...3 1.1 Terms and Abbreviations...3
More informationHierarchical ORAM Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM. Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi 2017/12/5
Hierarchical ORAM Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM Hubert Chan, Yue Guo, Wei-Kai Lin, Elaine Shi 2017/12/5 Random Access Machine, RAM Maybe the standard model of algorithms
More informationProgramming a recess with interrupted cut
Tricks Following on from the article on parameterized programming, which featured in DECO Magazine no 33, we would now like to show you another example of PELD programming. Machining a recess can sometimes
More informationORF 201 Computer Methods in Problem Solving. Final Project: Dynamic Programming Optimal Sailing Strategies
Princeton University Department of Operations Research and Financial Engineering ORF 201 Computer Methods in Problem Solving Final Project: Dynamic Programming Optimal Sailing Strategies Due 11:59 pm,
More informationSTATE LOTTERIES ACT 1966 LOTTERIES (LUCKY LOTTERIES) RULES
STATE LOTTERIES ACT 1966 LOTTERIES (LUCKY LOTTERIES) RULES This consolidation includes amendments as at 27 March 2017. It is provided for convenient reference only and regard should be had to the full
More information