Topic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar
|
|
- Trevor Patrick
- 5 years ago
- Views:
Transcription
1 15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider the roblem of boolean function evaluation and rove that randomized algorithms (in the exected case) erform better than deterministic algorithms. The boolean circuits that we consider, can be naturally extended to obtain a game tree. We will then state Von Neumann s minimax theorem and its extension - Yao s rincile. Finally, we show how Yao s rincile can be used to obtain lower bounds on the exected running time of randomized algorithms. 4.2 Boolean Function Evalutation Figure 4.2.1: A deth 2k AND-OR circuit Boolean functions in general can be formulated using various forms. For the uroses of this lecture we shall focus on functions that have only two kinds of gates: AND and OR. The number of inuts to each gate is restricted to two. The functions are nested by alternating AND and OR gates, so that the circuit corresonding to the function is similar to Figure 4.2. We assume that the circuit forms a full binary tree (each internal node being an AND or OR gate) of height 2k. The number of inuts of the circuit is 2 2k. The root node is an AND gate and all 1
2 the nodes at height 2k 1 are OR gates. Note that, the functions considered are monotone and therefore comlementation is not ermitted and also the wires are not allowed to overla or branch out. The roblem of boolean function evaluation is to comute the result of the function (circuit) while minimizing the number of queries. An algorithm makes a query if it looks at one of the inut values. We make a quick digression to game trees, so that it is easier to comare games with boolean circuits. Game trees are used extensively by comuter rograms to lay games. In a game tree each node corresonds to a osition and each adjacent out-edge a legal move that can be layed from the osition. The root of the game tree is the current osition from which the analysis is being erformed. The even nodes corresond to ositions from which layer 1 (or comuter) icks the move and the odd nodes osition from which layer 2 (oonent) moves. To decide on the best move from the current osition, layer 1 icks the move that maximizes an evaluation function. In doing so he assumes that the oonent lays otimally and therefore icks the move that minimizes the evaluation function at the next ste. The boolean circuit can be naturally viewed as a game tree, where the edges are directed from the root to the leaves. The OR gates corresond to the ositions from which layer 1 moves (MAX nodes) and the AND gates the ositions from which the oonent moves (MIN nodes). The number of rounds of a game tree is defined as the number of moves erformed by a single layer. Therefore a round of the boolean circuit can be thought of as a air of AND followed by an OR gate. In the game tree (boolean circuit) considered above, there are k rounds. It is well known that an AND-OR circuit can be converted to a NOR circuit. Secifically, a circuit where the AND gates and the OR gates alternate can be converted to a NOR circuit, by relacing each gate of the AND-OR circuit with a NOR gate. Consider the the root (AND gate) and the two children (OR gates), assume that the wires of the two children are A, B, C and D. Then, (A B) (C D) = ( (A B) (C D)) = (A NOR B) NOR (C NOR D) Therefore, by induction (on deth) the AND-OR circuit can be converted to a NOR circuit by simle relacement. For the rest of the lecture, we will use an equivalent NOR circuit. We now return back to the question of comuting the value of the circuit for a given set of inuts while minimizing the number of inuts examined (number of queries erformed). Assume that the number of inut values n = 2 2k Exercise The number of inut values examined by any deterministic boolean function evaluation algorithm is n = 2 2k. We make the following imortant observation. Consider any NOR gate, and assume that its inuts are A and B. If a deterministic algorithm comutes that A = 0, then it needs the value of B to comute A NOR B. If a deterministic algorithm comutes that A = 1, then we can assume that it does not comute/examine the value of B. To erform better than the deterministic algorithm, we ick one out of A and B randomly and evaluate/examine its value. If exactly one of A and B 2
3 is 1, then the randomized algorithm has a 0.5 robability of comuting/examining the wire with value 1 first. This leads us to the following algorithm. Assume that the tree used by the recursive function is T, rooted at r. Further assume that the two children of r are L and R. Eval-Rand ( Tree T ) 1. ick x {L, R} uniformly at random 2. a := Eval-Rand ( subtree rooted at x ) 3. if a = 1 then 4. else (a) return 0 (a) Eval-Rand ( subtree rooted at y {L, R}\x ) Theorem The exected number of queries erformed by function Eval-Rand: cost(eval-rand) 3 k = n log 4 3 Proof: By induction on the number of rounds of the circuit. Let X k be the random variable that denotes the number of queries erformed by the algorithm on a circuit with k rounds. We want to comute E[X k ]. Let o denote the outut of the circuit. Assume that the values carried by the two wires to r are i 1 1 and i1 2 and the values carried by the wires to the left gate at deth one are i2 1 and i 2 2 and that of the right gate being i2 3 and i2 4. We break the analysis of the exected cost into two cases. The two cases are shown in Figure 4.2. Case 1: Outut o = 1. In this case, though it might be necessary to examine both inuts of deth 1, randomization hels imrove the cost at deth 2. We have, (o = 1) = (i 1 1 = 0 and i 2 1 = 0) (i 1 1 = 0) = (i 2 1 = 1 or i 2 2 = 1), (i 1 2 = 0) = (i 2 3 = 1 or i 2 4 = 1) In this case, both the recursive calls Eval-Rand ( Tree rooted at L ) and Eval-Rand ( Tree rooted at R ) are erformed. Consider either of the two calls. The child x is chosen at random and evaluated with cost E[X k 1 ]. The value a = 0 with robability 0.5 and the function has to erform an additional recursive call with cost E[X k 1 ]. The value a = 1 with robability 0.5 in which case we incur no additional cost besides E[X k 1 ] used to comute the value of a. Therefore in total, E[X k o = 1] = 2E[X k 1 ]Pr[x = 0] + E[X k 1 ]Pr[x = 1] E[X k 1 ] + 0.5E[X k 1 ] < 3E[X k 1 ] 3
4 Figure 4.2.2: Two cases in the analysis of the number of queries erformed by Eval-Rand Case 2: Outut o = 0. Using the same notations, we have, (o = 0) = (i 1 1 = 1 or i 1 2 = 1) In the worst case, exactly one of i 1 i = 1 and w.l.o.g assume i1 1 = 0 and i1 2 = 1. i 1 1 = 0 = (i 2 1 = 1 or i 2 2 = 1) and i 1 2 = 1 = (i 2 3 = 0 and i 2 4 = 0) Once again, w.l.o.g assume i 2 1 = 1 and i2 2 = 0. In the function call Eval-Rand( T ), x = L and therefore a = 0 with robability 0.5. In this case, the entire of right subtree has to be queried with cost 2E[X k 1 ]. Furthermore, in the function call Eval-Rand(Tree rooted at L), a = 1 with robability 0.5 in which case the exected number of queries is E[X k 1 ]; a = 0 with robability 0.5 in which case the exected number of queries is E[X k 1 ]. Now consider the function call Eval-Rand(T ), x = R and therefore a = 1 with robability 0.5, and here we incur a cost of 2E[X k 1 ] to comute the value of a. Using the notation, a 1, a l and a r to denote the values of a in the function calls Eval-Rand(T ), Eval-Rand(L) and Eval-Rand(R) resectively we have, E[X k o = 0] E[X k a 1 = 0]Pr[a 1 = 0] + E[X k a 1 = 1]Pr[a 1 = 1] = 0.5(4E[X k 1 ]Pr[a l = 0] + 3E[X k 1 ]Pr[a l = 1]) + 0.5(2E[X k 1 ]) = 0.5( )E[X k 1 ] < 3E[X k 1 ] The roof follows induction (on the number of rounds) with a trivial base case. 4
5 Moves H T H 1-1 T -1 1 Figure 4.3.3: Payoff Matrix for matching ennies game. Row Player: Roberta and Column Player: Charles 4.3 Games In this section we will focus on two layer zero sum games. Zero sum games have the roerty that one layer s loss is exactly the other layer s gain. A standard examle is the game stone, aer and scissors. We will assume that the two layers are Roberta and Charles. The ayoff (rules) of a game is usually exressed in a ayoff matrix M, where the rows corresond to the ossible moves for Roberta and the columns the ossible moves for Charles. An entry M i,j in the matrix corresonds to the ayoff awarded to Roberta if she lays i and Charles lays j. In general, if the game suorts n moves for Roberta and m for Charles, the ayoff matrix is of size n m. We will consider the game of matching ennies. Roberta and Charles simultaneously show one side of their enny. If the dislayed sides match then Roberta wins one dollar and if the sides don t match then Charles wins a dollar. The ayoff matrix for the game is shown in Figure If Roberta icks move i, then she is guaranteed a ayoff min j M i,j. The lower bounds for the gain of Roberta ˆV R and Charles ˆV C is given by ˆV R = max i min M i,j j and ˆV C = min j max M i,j. i In the game of matching ennies, ˆV R = 1 and ˆV C = 1. Claim For any ayoff matrix ˆV R ˆV C Proof: Let ˆV R = M i,k and ˆV C = M l,j. We have for all m, ˆV R M i,m, and secifically, ˆV R M i,j. Similarly, for all m, ˆV C M m,j, and secifically ˆV C M i,j and therefore ˆV R ˆV C. In games where V = ˆV R = ˆV C, the game is said to have a solution and V is called the value of the game. In such games, the two layers can advertise what they are going to lay without any harm. Definition A ure strategy is defined as a deterministic choice to lay in a game. Definition A mixed strategy is defined by a robability distribution on deterministic strategies. 5
6 We will now focus on mixed strategies. Let i be the robability that Roberto icks move i and let q j be the robability that Charles icks move j. Therefore, Exected ayoff = n m i q j M i,j = T Mq, i=1 j=1 where vectors and q contain the robabilities of selecting moves. Similar to the revious definition for ure strategies, we can obtain lower bounds on the ayoffs for Roberta and Charles as ˆV R = max min T Mq q and ˆV C = min q max T Mq Note that the min and max are comuted over all ossible distributions and q over deterministic choices. Theorem (Von Neumann s Minimax Theorem [Ne28]) For any two erson zero sum game with game matrix M, max min T Mq = min max T Mq q q Note that in the above theorem, if Roberta announces the robability distribution that she is using, Charles icks a single move (corresonding to the maximum term in vector T M) and his strategy becomes deterministic. Therefore an equivalent definition is ˆV R = max min j T Me j, where e j is a vector with 0 in all ositions excet j which is set to 1. This equivalent definition of ˆV R leads to Loomis theorem. Theorem (Loomis Theorem [Lo46]) For any two layer zero sum game secified by game matrix M, max min T Me j = min max e T j i Mq i 4.4 Yao s Princile We can use the above ideas from game theory to lower bound the running time of randomized algorithms. This is the only known technique currently used to establish lower bounds. Consider any randomized algorithm that uses a finite number of random bits. Fixing the values of the random bits secifies a deterministic algorithm. The values for the random bits can themselves be used to label each such deterministic algorithm. Informally a randomized algorithm can be viewed as secifying a robability distribution over several deterministic algorithms. Consider a matrix M similar to the game matrix. For any randomized algorithm, the rows of M corresond to different inuts and the columns corresond to different deterministic algorithms 6
7 (obtained by fixing the random bits of a randomized algorithm). The ayoff M i,j of the matrix corresonds to the running time of algorithm A j on inut I i. Let vector denote the robability distribution on the inuts and vector q the robability distribution on the algorithms and e j the (0, 1)-vector with 1 in exactly osition j. Using the same ideas from the revious section, we have, M i,j = C(A j, I i ), E[C(A j, I )] = T Me j, E[C(A q, I i )] = e T i Mq Using we have, max min E[C(I, A q )] = min q q max E[C(I, A q )] Droing the max term on the left side and the min term on the right side from the above equation gives us Yao s rincile. Proosition (Yao s Princile [Ya77]) For all distributions over I and q over A, min E[C(I, A)] max E[C(I, A q)] A A I I We will now show a simle examle and illustrate how Yao s rincile can be alied to establish a lower bound on randomized algorithms. The find-bill roblem can be stated as follows. There are n boxes and exactly one box contains a dollar bill, and the rest of the boxes are emty. A robe is defined as oening a box to see if it contains the dollar bill. The objective is to locate the box containing the dollar bill while minimizing the number of robes erformed. Consider the following randomized algorithm: 1. select x {H, T } uniformly at random 2. if x = H then 3. else (a) robe boxes in order from 1 through n and sto if bill is located (a) robe boxes in order from n through 1 and sto if bill is located The exected number of robes made by the algorithm is (n+1)/2. Since, if the dollar bill is in the i th box, then with robability 0.5, i robes are made and with robability 0.5, (n i + 1) robes are needed. Lemma A lower bound on the exected number of robes required by any randomized algorithm to solve the find-bill roblem is (n + 1)/2. 7
8 Proof: To use Yao s rincile we need to secify a distribution on the inut. In this case, we assume that the bill is located in any one of the n boxes uniformly at random. We only consider deterministic algorithms that does not robe the same box twice. By symmetry we can assume that the robe order for the deterministic algorithm is 1 through n. We therefore have, min E[C(A, I )] = A A n i=1 i n = 1 n n i=1 max I I E[C(I, A q)], i = n by using Yao s rincile. Therefore any randomized algorithm A q requires at least (n + 1)/2 robes in exectation. References [Lo46] L. H. Loomis. On a theorem of von Neumann Proceedings of the National Academy of Sciences of the U.S.A., 32: , [Ne28] J. von Neumann. Zur Theorie der Gesellschaftssiele. Mathematische Annalen, 100: , [Sn85] M. Snir. Lower bounds on robabilistic linear decision trees. Theoretical Comuter Science, 38:69-82, [Ya77] A. C-C. Yao. Probabilistic comutations: Towards a unified measure of comlexity. Proceedings of the 17th Annual Symosium on Foundations of Comuter Science, ,
Extension of Minimax to Infinite Matrices
Extension of Minimax to Infinite Matrices Chris Calabro June 21, 2004 Abstract Von Neumann s minimax theorem is tyically alied to a finite ayoff matrix A R m n. Here we show that (i) if m, n are both inite,
More information4. Score normalization technical details We now discuss the technical details of the score normalization method.
SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules
More informationRANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES
RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES AARON ZWIEBACH Abstract. In this aer we will analyze research that has been recently done in the field of discrete
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More information1 Gambler s Ruin Problem
Coyright c 2017 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins
More informationThe non-stochastic multi-armed bandit problem
Submitted for journal ublication. The non-stochastic multi-armed bandit roblem Peter Auer Institute for Theoretical Comuter Science Graz University of Technology A-8010 Graz (Austria) auer@igi.tu-graz.ac.at
More informationwhere x i is the ith coordinate of x R N. 1. Show that the following upper bound holds for the growth function of H:
Mehryar Mohri Foundations of Machine Learning Courant Institute of Mathematical Sciences Homework assignment 2 October 25, 2017 Due: November 08, 2017 A. Growth function Growth function of stum functions.
More informationEE/Stats 376A: Information theory Winter Lecture 5 Jan 24. Lecturer: David Tse Scribe: Michael X, Nima H, Geng Z, Anton J, Vivek B.
EE/Stats 376A: Information theory Winter 207 Lecture 5 Jan 24 Lecturer: David Tse Scribe: Michael X, Nima H, Geng Z, Anton J, Vivek B. 5. Outline Markov chains and stationary distributions Prefix codes
More informationThe Knuth-Yao Quadrangle-Inequality Speedup is a Consequence of Total-Monotonicity
The Knuth-Yao Quadrangle-Ineuality Seedu is a Conseuence of Total-Monotonicity Wolfgang W. Bein Mordecai J. Golin Lawrence L. Larmore Yan Zhang Abstract There exist several general techniues in the literature
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More informationStatic Dictionaries on AC 0 RAMs: Query time ( log n= log log n) is necessary and sufficient
q Static Dictionaries on AC 0 RAMs: Query time ( = log ) is necessary and sufficient Arne Andersson Lund University arne@dna.lth.se Peter Bro Miltersen y University of Toronto bmilter@cs.toronto.edu Søren
More information15-451/651: Design & Analysis of Algorithms October 23, 2018 Lecture #17: Prediction from Expert Advice last changed: October 25, 2018
5-45/65: Design & Analysis of Algorithms October 23, 208 Lecture #7: Prediction from Exert Advice last changed: October 25, 208 Prediction with Exert Advice Today we ll study the roblem of making redictions
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationBrownian Motion and Random Prime Factorization
Brownian Motion and Random Prime Factorization Kendrick Tang June 4, 202 Contents Introduction 2 2 Brownian Motion 2 2. Develoing Brownian Motion.................... 2 2.. Measure Saces and Borel Sigma-Algebras.........
More informationThe Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule
The Grah Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule STEFAN D. BRUDA Deartment of Comuter Science Bisho s University Lennoxville, Quebec J1M 1Z7 CANADA bruda@cs.ubishos.ca
More information1 1 c (a) 1 (b) 1 Figure 1: (a) First ath followed by salesman in the stris method. (b) Alternative ath. 4. D = distance travelled closing the loo. Th
18.415/6.854 Advanced Algorithms ovember 7, 1996 Euclidean TSP (art I) Lecturer: Michel X. Goemans MIT These notes are based on scribe notes by Marios Paaefthymiou and Mike Klugerman. 1 Euclidean TSP Consider
More informationLecture 9: Connecting PH, P/poly and BPP
Comutational Comlexity Theory, Fall 010 Setember Lecture 9: Connecting PH, P/oly and BPP Lecturer: Kristoffer Arnsfelt Hansen Scribe: Martin Sergio Hedevang Faester Although we do not know how to searate
More informationLecture: Condorcet s Theorem
Social Networs and Social Choice Lecture Date: August 3, 00 Lecture: Condorcet s Theorem Lecturer: Elchanan Mossel Scribes: J. Neeman, N. Truong, and S. Troxler Condorcet s theorem, the most basic jury
More informationModel checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle]
Chater 5 Model checking, verification of CTL One must verify or exel... doubts, and convert them into the certainty of YES or NO. [Thomas Carlyle] 5. The verification setting Page 66 We introduce linear
More informationConvex Optimization methods for Computing Channel Capacity
Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem
More informationA Social Welfare Optimal Sequential Allocation Procedure
A Social Welfare Otimal Sequential Allocation Procedure Thomas Kalinowsi Universität Rostoc, Germany Nina Narodytsa and Toby Walsh NICTA and UNSW, Australia May 2, 201 Abstract We consider a simle sequential
More informationFor q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i
Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 9519-0103, USA khuri@juiter.sjsu.edu Fax: (40)94-500 Keywords:
More informationOutline. CS21 Decidability and Tractability. Regular expressions and FA. Regular expressions and FA. Regular expressions and FA
Outline CS21 Decidability and Tractability Lecture 4 January 14, 2019 FA and Regular Exressions Non-regular languages: Puming Lemma Pushdown Automata Context-Free Grammars and Languages January 14, 2019
More informationSolution sheet ξi ξ < ξ i+1 0 otherwise ξ ξ i N i,p 1 (ξ) + where 0 0
Advanced Finite Elements MA5337 - WS7/8 Solution sheet This exercise sheets deals with B-slines and NURBS, which are the basis of isogeometric analysis as they will later relace the olynomial ansatz-functions
More information1-way quantum finite automata: strengths, weaknesses and generalizations
1-way quantum finite automata: strengths, weaknesses and generalizations arxiv:quant-h/9802062v3 30 Se 1998 Andris Ambainis UC Berkeley Abstract Rūsiņš Freivalds University of Latvia We study 1-way quantum
More informationDecoding Linear Block Codes Using a Priority-First Search: Performance Analysis and Suboptimal Version
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 3, MAY 1998 133 Decoding Linear Block Codes Using a Priority-First Search Performance Analysis Subotimal Version Yunghsiang S. Han, Member, IEEE, Carlos
More informationAM 221: Advanced Optimization Spring Prof. Yaron Singer Lecture 6 February 12th, 2014
AM 221: Advanced Otimization Sring 2014 Prof. Yaron Singer Lecture 6 February 12th, 2014 1 Overview In our revious lecture we exlored the concet of duality which is the cornerstone of Otimization Theory.
More information16. Binary Search Trees
Dictionary imlementation 16. Binary Search Trees [Ottman/Widmayer, Ka..1, Cormen et al, Ka. 12.1-12.] Hashing: imlementation of dictionaries with exected very fast access times. Disadvantages of hashing:
More informationSums of independent random variables
3 Sums of indeendent random variables This lecture collects a number of estimates for sums of indeendent random variables with values in a Banach sace E. We concentrate on sums of the form N γ nx n, where
More informationNamed Entity Recognition using Maximum Entropy Model SEEM5680
Named Entity Recognition using Maximum Entroy Model SEEM5680 Named Entity Recognition System Named Entity Recognition (NER): Identifying certain hrases/word sequences in a free text. Generally it involves
More informationEvaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models
Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Ketan N. Patel, Igor L. Markov and John P. Hayes University of Michigan, Ann Arbor 48109-2122 {knatel,imarkov,jhayes}@eecs.umich.edu
More information16. Binary Search Trees
Dictionary imlementation 16. Binary Search Trees [Ottman/Widmayer, Ka..1, Cormen et al, Ka. 1.1-1.] Hashing: imlementation of dictionaries with exected very fast access times. Disadvantages of hashing:
More informationA Note on Guaranteed Sparse Recovery via l 1 -Minimization
A Note on Guaranteed Sarse Recovery via l -Minimization Simon Foucart, Université Pierre et Marie Curie Abstract It is roved that every s-sarse vector x C N can be recovered from the measurement vector
More informationTopic 7: Using identity types
Toic 7: Using identity tyes June 10, 2014 Now we would like to learn how to use identity tyes and how to do some actual mathematics with them. By now we have essentially introduced all inference rules
More informationGIVEN an input sequence x 0,..., x n 1 and the
1 Running Max/Min Filters using 1 + o(1) Comarisons er Samle Hao Yuan, Member, IEEE, and Mikhail J. Atallah, Fellow, IEEE Abstract A running max (or min) filter asks for the maximum or (minimum) elements
More informationCombinatorics of topmost discs of multi-peg Tower of Hanoi problem
Combinatorics of tomost discs of multi-eg Tower of Hanoi roblem Sandi Klavžar Deartment of Mathematics, PEF, Unversity of Maribor Koroška cesta 160, 000 Maribor, Slovenia Uroš Milutinović Deartment of
More informationSection 0.10: Complex Numbers from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative
Section 0.0: Comlex Numbers from Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.
More informationLecture 21: Quantum Communication
CS 880: Quantum Information Processing 0/6/00 Lecture : Quantum Communication Instructor: Dieter van Melkebeek Scribe: Mark Wellons Last lecture, we introduced the EPR airs which we will use in this lecture
More informationECE 534 Information Theory - Midterm 2
ECE 534 Information Theory - Midterm Nov.4, 009. 3:30-4:45 in LH03. You will be given the full class time: 75 minutes. Use it wisely! Many of the roblems have short answers; try to find shortcuts. You
More informationarxiv: v1 [quant-ph] 3 Feb 2015
From reversible comutation to quantum comutation by Lagrange interolation Alexis De Vos and Stin De Baerdemacker 2 arxiv:502.0089v [quant-h] 3 Feb 205 Cmst, Imec v.z.w., vakgroe elektronica en informatiesystemen,
More informationMATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK
Comuter Modelling and ew Technologies, 5, Vol.9, o., 3-39 Transort and Telecommunication Institute, Lomonosov, LV-9, Riga, Latvia MATHEMATICAL MODELLIG OF THE WIRELESS COMMUICATIO ETWORK M. KOPEETSK Deartment
More informationLecture 6. 2 Recurrence/transience, harmonic functions and martingales
Lecture 6 Classification of states We have shown that all states of an irreducible countable state Markov chain must of the same tye. This gives rise to the following classification. Definition. [Classification
More informationImprovement on the Decay of Crossing Numbers
Grahs and Combinatorics 2013) 29:365 371 DOI 10.1007/s00373-012-1137-3 ORIGINAL PAPER Imrovement on the Decay of Crossing Numbers Jakub Černý Jan Kynčl Géza Tóth Received: 24 Aril 2007 / Revised: 1 November
More information6 Stationary Distributions
6 Stationary Distributions 6. Definition and Examles Definition 6.. Let {X n } be a Markov chain on S with transition robability matrix P. A distribution π on S is called stationary (or invariant) if π
More informationResearch of PMU Optimal Placement in Power Systems
Proceedings of the 5th WSEAS/IASME Int. Conf. on SYSTEMS THEORY and SCIENTIFIC COMPUTATION, Malta, Setember 15-17, 2005 (38-43) Research of PMU Otimal Placement in Power Systems TIAN-TIAN CAI, QIAN AI
More informationThe Mathematics of Winning Streaks
The Mathematics of Winning Streaks Erik Leffler lefflererik@gmail.com under the direction of Prof. Henrik Eriksson Deartment of Comuter Science and Communications Royal Institute of Technology Research
More informationRadial Basis Function Networks: Algorithms
Radial Basis Function Networks: Algorithms Introduction to Neural Networks : Lecture 13 John A. Bullinaria, 2004 1. The RBF Maing 2. The RBF Network Architecture 3. Comutational Power of RBF Networks 4.
More informationCSE 311 Lecture 02: Logic, Equivalence, and Circuits. Emina Torlak and Kevin Zatloukal
CSE 311 Lecture 02: Logic, Equivalence, and Circuits Emina Torlak and Kevin Zatloukal 1 Toics Proositional logic A brief review of Lecture 01. Classifying comound roositions Converse, contraositive, and
More informationCircuits. Lecture 11 Uniform Circuit Complexity
Circuits Lecture 11 Uniform Circuit Complexity 1 Recall 2 Recall Non-uniform complexity 2 Recall Non-uniform complexity P/1 Decidable 2 Recall Non-uniform complexity P/1 Decidable NP P/log NP = P 2 Recall
More informationImproved Capacity Bounds for the Binary Energy Harvesting Channel
Imroved Caacity Bounds for the Binary Energy Harvesting Channel Kaya Tutuncuoglu 1, Omur Ozel 2, Aylin Yener 1, and Sennur Ulukus 2 1 Deartment of Electrical Engineering, The Pennsylvania State University,
More informationInformation collection on a graph
Information collection on a grah Ilya O. Ryzhov Warren Powell February 10, 2010 Abstract We derive a knowledge gradient olicy for an otimal learning roblem on a grah, in which we use sequential measurements
More informationLecture 14: Introduction to Decision Making
Lecture 14: Introduction to Decision Making Preferences Utility functions Maximizing exected utility Value of information Actions and consequences So far, we have focused on ways of modeling a stochastic,
More informationarxiv:cond-mat/ v2 25 Sep 2002
Energy fluctuations at the multicritical oint in two-dimensional sin glasses arxiv:cond-mat/0207694 v2 25 Se 2002 1. Introduction Hidetoshi Nishimori, Cyril Falvo and Yukiyasu Ozeki Deartment of Physics,
More informationAn introduction to forest-regular languages
An introduction to forest-regular languages Mika Raento Basic Research Unit, Helsinki Institute for Information Technology Deartment of Comuter Science, University of Helsinki Mika.Raento@cs.Helsinki.FI
More informationSolutions to exercises on delays. P (x = 0 θ = 1)P (θ = 1) P (x = 0) We can replace z in the first equation by its value in the second equation.
Ec 517 Christohe Chamley Solutions to exercises on delays Ex 1: P (θ = 1 x = 0) = P (x = 0 θ = 1)P (θ = 1) P (x = 0) = 1 z)µ (1 z)µ + 1 µ. The value of z is solution of µ c = δµz(1 c). We can relace z
More informationVarious Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems
Int. J. Oen Problems Comt. Math., Vol. 3, No. 2, June 2010 ISSN 1998-6262; Coyright c ICSRS Publication, 2010 www.i-csrs.org Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various
More informationAsymptotically Optimal Simulation Allocation under Dependent Sampling
Asymtotically Otimal Simulation Allocation under Deendent Samling Xiaoing Xiong The Robert H. Smith School of Business, University of Maryland, College Park, MD 20742-1815, USA, xiaoingx@yahoo.com Sandee
More informationOn a Markov Game with Incomplete Information
On a Markov Game with Incomlete Information Johannes Hörner, Dinah Rosenberg y, Eilon Solan z and Nicolas Vieille x{ January 24, 26 Abstract We consider an examle of a Markov game with lack of information
More informationLilian Markenzon 1, Nair Maria Maia de Abreu 2* and Luciana Lee 3
Pesquisa Oeracional (2013) 33(1): 123-132 2013 Brazilian Oerations Research Society Printed version ISSN 0101-7438 / Online version ISSN 1678-5142 www.scielo.br/oe SOME RESULTS ABOUT THE CONNECTIVITY OF
More informationJohn Weatherwax. Analysis of Parallel Depth First Search Algorithms
Sulementary Discussions and Solutions to Selected Problems in: Introduction to Parallel Comuting by Viin Kumar, Ananth Grama, Anshul Guta, & George Karyis John Weatherwax Chater 8 Analysis of Parallel
More informationPositive decomposition of transfer functions with multiple poles
Positive decomosition of transfer functions with multile oles Béla Nagy 1, Máté Matolcsi 2, and Márta Szilvási 1 Deartment of Analysis, Technical University of Budaest (BME), H-1111, Budaest, Egry J. u.
More informationOptimism, Delay and (In)Efficiency in a Stochastic Model of Bargaining
Otimism, Delay and In)Efficiency in a Stochastic Model of Bargaining Juan Ortner Boston University Setember 10, 2012 Abstract I study a bilateral bargaining game in which the size of the surlus follows
More informationCoding Along Hermite Polynomials for Gaussian Noise Channels
Coding Along Hermite olynomials for Gaussian Noise Channels Emmanuel A. Abbe IG, EFL Lausanne, 1015 CH Email: emmanuel.abbe@efl.ch Lizhong Zheng LIDS, MIT Cambridge, MA 0139 Email: lizhong@mit.edu Abstract
More informationInformation collection on a graph
Information collection on a grah Ilya O. Ryzhov Warren Powell October 25, 2009 Abstract We derive a knowledge gradient olicy for an otimal learning roblem on a grah, in which we use sequential measurements
More informationCombining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)
Combining Logistic Regression with Kriging for Maing the Risk of Occurrence of Unexloded Ordnance (UXO) H. Saito (), P. Goovaerts (), S. A. McKenna (2) Environmental and Water Resources Engineering, Deartment
More informationMA3H1 TOPICS IN NUMBER THEORY PART III
MA3H1 TOPICS IN NUMBER THEORY PART III SAMIR SIKSEK 1. Congruences Modulo m In quadratic recirocity we studied congruences of the form x 2 a (mod ). We now turn our attention to situations where is relaced
More informationA New GP-evolved Formulation for the Relative Permittivity of Water and Steam
ew GP-evolved Formulation for the Relative Permittivity of Water and Steam S. V. Fogelson and W. D. Potter rtificial Intelligence Center he University of Georgia, US Contact Email ddress: sergeyf1@uga.edu
More informationConvolutional Codes. Lecture 13. Figure 93: Encoder for rate 1/2 constraint length 3 convolutional code.
Convolutional Codes Goals Lecture Be able to encode using a convolutional code Be able to decode a convolutional code received over a binary symmetric channel or an additive white Gaussian channel Convolutional
More informationAnalysis of Multi-Hop Emergency Message Propagation in Vehicular Ad Hoc Networks
Analysis of Multi-Ho Emergency Message Proagation in Vehicular Ad Hoc Networks ABSTRACT Vehicular Ad Hoc Networks (VANETs) are attracting the attention of researchers, industry, and governments for their
More informationON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS
#A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,
More informationOn the capacity of the general trapdoor channel with feedback
On the caacity of the general tradoor channel with feedback Jui Wu and Achilleas Anastasooulos Electrical Engineering and Comuter Science Deartment University of Michigan Ann Arbor, MI, 48109-1 email:
More informationLimiting Price Discrimination when Selling Products with Positive Network Externalities
Limiting Price Discrimination when Selling Products with Positive Network Externalities Luděk Cigler, Wolfgang Dvořák, Monika Henzinger, Martin Starnberger University of Vienna, Faculty of Comuter Science,
More informationUniversal Finite Memory Coding of Binary Sequences
Deartment of Electrical Engineering Systems Universal Finite Memory Coding of Binary Sequences Thesis submitted towards the degree of Master of Science in Electrical and Electronic Engineering in Tel-Aviv
More informationOnline Appendix to Accompany AComparisonof Traditional and Open-Access Appointment Scheduling Policies
Online Aendix to Accomany AComarisonof Traditional and Oen-Access Aointment Scheduling Policies Lawrence W. Robinson Johnson Graduate School of Management Cornell University Ithaca, NY 14853-6201 lwr2@cornell.edu
More informationCharacterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations
Characterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations PINAR KORKMAZ, BILGE E. S. AKGUL and KRISHNA V. PALEM Georgia Institute of
More informationThe inverse Goldbach problem
1 The inverse Goldbach roblem by Christian Elsholtz Submission Setember 7, 2000 (this version includes galley corrections). Aeared in Mathematika 2001. Abstract We imrove the uer and lower bounds of the
More information7.2 Inference for comparing means of two populations where the samples are independent
Objectives 7.2 Inference for comaring means of two oulations where the samles are indeendent Two-samle t significance test (we give three examles) Two-samle t confidence interval htt://onlinestatbook.com/2/tests_of_means/difference_means.ht
More informationNearly Tight Linear Programming Bounds for Demand Matching in Bipartite Graphs
Nearly Tight Linear Programming Bounds for Demand Matching in Biartite Grahs Mohit Singh Hehui Wu Setember 23, 212 Abstract We consider the demand matching roblem which is a generalization of the maximum
More informationUnit 1 - Computer Arithmetic
FIXD-POINT (FX) ARITHMTIC Unit 1 - Comuter Arithmetic INTGR NUMBRS n bit number: b n 1 b n 2 b 0 Decimal Value Range of values UNSIGND n 1 SIGND D = b i 2 i D = 2 n 1 b n 1 + b i 2 i n 2 i=0 i=0 [0, 2
More informationDimension Characterizations of Complexity Classes
Dimension Characterizations of Comlexity Classes Xiaoyang Gu Jack H. Lutz Abstract We use derandomization to show that sequences of ositive sace-dimension in fact, even ositive k-dimension for suitable
More informationMODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL
Technical Sciences and Alied Mathematics MODELING THE RELIABILITY OF CISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Cezar VASILESCU Regional Deartment of Defense Resources Management
More informationA New Perspective on Learning Linear Separators with Large L q L p Margins
A New Persective on Learning Linear Searators with Large L q L Margins Maria-Florina Balcan Georgia Institute of Technology Christoher Berlind Georgia Institute of Technology Abstract We give theoretical
More informationOutline. EECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Simple Error Detection Coding
Outline EECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Error detection using arity Hamming code for error detection/correction Linear Feedback Shift
More informationProbability Estimates for Multi-class Classification by Pairwise Coupling
Probability Estimates for Multi-class Classification by Pairwise Couling Ting-Fan Wu Chih-Jen Lin Deartment of Comuter Science National Taiwan University Taiei 06, Taiwan Ruby C. Weng Deartment of Statistics
More informationTowards understanding the Lorenz curve using the Uniform distribution. Chris J. Stephens. Newcastle City Council, Newcastle upon Tyne, UK
Towards understanding the Lorenz curve using the Uniform distribution Chris J. Stehens Newcastle City Council, Newcastle uon Tyne, UK (For the Gini-Lorenz Conference, University of Siena, Italy, May 2005)
More informationHomework Solution 4 for APPM4/5560 Markov Processes
Homework Solution 4 for APPM4/556 Markov Processes 9.Reflecting random walk on the line. Consider the oints,,, 4 to be marked on a straight line. Let X n be a Markov chain that moves to the right with
More informationSpace and Nondeterminism
CS 221 Computational Complexity, Lecture 5 Feb 6, 2018 Space and Nondeterminism Instructor: Madhu Sudan 1 Scribe: Yong Wook Kwon Topic Overview Today we ll talk about space and non-determinism. For some
More informationCSE 599d - Quantum Computing When Quantum Computers Fall Apart
CSE 599d - Quantum Comuting When Quantum Comuters Fall Aart Dave Bacon Deartment of Comuter Science & Engineering, University of Washington In this lecture we are going to begin discussing what haens to
More informationSolved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points.
Solved Problems Solved Problems P Solve the three simle classification roblems shown in Figure P by drawing a decision boundary Find weight and bias values that result in single-neuron ercetrons with the
More informationHAUSDORFF MEASURE OF p-cantor SETS
Real Analysis Exchange Vol. 302), 2004/2005,. 20 C. Cabrelli, U. Molter, Deartamento de Matemática, Facultad de Cs. Exactas y Naturales, Universidad de Buenos Aires and CONICET, Pabellón I - Ciudad Universitaria,
More informationParallelism and Locality in Priority Queues. A. Ranade S. Cheng E. Deprit J. Jones S. Shih. University of California. Berkeley, CA 94720
Parallelism and Locality in Priority Queues A. Ranade S. Cheng E. Derit J. Jones S. Shih Comuter Science Division University of California Berkeley, CA 94720 Abstract We exlore two ways of incororating
More informationProof Nets and Boolean Circuits
Proof Nets and Boolean Circuits Kazushige Terui terui@nii.ac.j National Institute of Informatics, Tokyo 14/07/04, Turku.1/44 Motivation (1) Proofs-as-Programs (Curry-Howard) corresondence: Proofs = Programs
More informationFinding Shortest Hamiltonian Path is in P. Abstract
Finding Shortest Hamiltonian Path is in P Dhananay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune, India bstract The roblem of finding shortest Hamiltonian ath in a eighted comlete grah belongs
More informationAn Introduction To Range Searching
An Introduction To Range Searching Jan Vahrenhold eartment of Comuter Science Westfälische Wilhelms-Universität Münster, Germany. Overview 1. Introduction: Problem Statement, Lower Bounds 2. Range Searching
More informationAnalysis of some entrance probabilities for killed birth-death processes
Analysis of some entrance robabilities for killed birth-death rocesses Master s Thesis O.J.G. van der Velde Suervisor: Dr. F.M. Sieksma July 5, 207 Mathematical Institute, Leiden University Contents Introduction
More informationPartitions and Covers
University of California, Los Angeles CS 289A Communication Complexity Instructor: Alexander Sherstov Scribe: Dong Wang Date: January 2, 2012 LECTURE 4 Partitions and Covers In previous lectures, we saw
More informationCryptography. Lecture 8. Arpita Patra
Crytograhy Lecture 8 Arita Patra Quick Recall and Today s Roadma >> Hash Functions- stands in between ublic and rivate key world >> Key Agreement >> Assumtions in Finite Cyclic grous - DL, CDH, DDH Grous
More informationGalois Fields, Linear Feedback Shift Registers and their Applications
Galois Fields, Linear Feedback Shift Registers and their Alications With 85 illustrations as well as numerous tables, diagrams and examles by Ulrich Jetzek ISBN (Book): 978-3-446-45140-7 ISBN (E-Book):
More informationImpossibility of a Quantum Speed-up with a Faulty Oracle
Imossibility of a Quantum Seed-u with a Faulty Oracle Oded Regev Liron Schiff Abstract We consider Grover s unstructured search roblem in the setting where each oracle call has some small robability of
More informationAn Analysis of Reliable Classifiers through ROC Isometrics
An Analysis of Reliable Classifiers through ROC Isometrics Stijn Vanderlooy s.vanderlooy@cs.unimaas.nl Ida G. Srinkhuizen-Kuyer kuyer@cs.unimaas.nl Evgueni N. Smirnov smirnov@cs.unimaas.nl MICC-IKAT, Universiteit
More information