Applications of Discrete Mathematics to the Analysis of Algorithms
|
|
- Kerry Clark
- 6 years ago
- Views:
Transcription
1 Applications of Discrete Mathematics to the Analysis of Algorithms Conrado Martínez Univ. Politècnica de Catalunya, Spain May 2007
2 Goal Given some algorithm taking inputs from some set Á, we would like to analyze the performance of the algorithm as a function of the input size (and possibly other parameters).
3 Why? To predict the resources (time, space.... ) that the algorithm will consume To compare algorithm with competing alternatives To improve the algorithm, by spotting the performance bottlenecks To explain observed behavior
4 Why? To predict the resources (time, space.... ) that the algorithm will consume To compare algorithm with competing alternatives To improve the algorithm, by spotting the performance bottlenecks To explain observed behavior
5 Why? To predict the resources (time, space.... ) that the algorithm will consume To compare algorithm with competing alternatives To improve the algorithm, by spotting the performance bottlenecks To explain observed behavior
6 Why? To predict the resources (time, space.... ) that the algorithm will consume To compare algorithm with competing alternatives To improve the algorithm, by spotting the performance bottlenecks To explain observed behavior
7 The performance Á Æ depends on each particular instance of the input We have to introduce some notion of size: Á Æ; we may safely assume that each Á Ò Ü ¾ Á Ü Ò is finite Worst case: [worst] Òµ ÑÜ Üµ Ü ¾ Á Ò
8 To analyze typical behavior or the performance of randomized algorithms, we have to assume some probabilistic distribution on the input and/or the algorithm s choices; hence, we consider the performance as a family of random variables Ò Ò¼ ; Ò Á Ò Æ Average case: [avg] Òµ Ò ¼ È Ò
9 When we assume uniformly distributed inputs ÈÜ ½ Á Ò for all Ü ¾ Á Ò our problem is one of counting, e.g., È Ü¾ÁÒ Ò Üµ Á Ò
10 One of the most important tools in the analysis of algorithms are generating functions: Þ Ùµ Ò¼ ¼ È Ò Þ Ò Ù For the uniform distribution Þ Ùµ È Ò¼ ȼ ÒÞ Ò Ù È Þ Ùµ Ò¼ ÒÞ Ò Þ ½µ with Ò Ü ¾ Á Ü Ò Üµ and Ò Á Ò
11 The equations before can be expressed symbolically Þ Ùµ ܾÁ Þ Ü Ù Üµ The ratio of the Ò th coefficients of Þ Ùµ and Þ ½µ is the probability generating function of Ò Ô Ò Ùµ ¼ È Ò Ù ÞÒ Þ Ùµ Þ Ò Þ ½µ
12 Taking derivatives w.r.t. Ù and setting Ù ½ we get the expected value, second factorial moment,... Öµ Þµ Ö Þ Ùµ Ù Ö Ò¼ Ù½ Ò Ö Þ Ò For example, Î Ò Ò ¾ Ò ¾ Þ Ò ¾µ Þµ Þ Ò Þµµ ¾
13 The symbolic method translates combinatorial constructions to functional equations over generating functions. Example: Consider the counting generating function of a combinatorial class : If then Þµ «¾ Þ «Þµ Þµ Þµ Ò¼ µ¾ Ò Þ Ò Þ «¾ Þ «¼ ¾ ½ Þ ¼ ¾ Þ ½
14 A dictionary of (labelled) combinatorial constructions and G.F. s ËÕ µ ½ Þ ½ ½ ËØ µ ÜÔ µ ÝÐ µ ÐÓ ½ ½
15 A trivial example: since a binary tree is either an empty tree (leaf) or a root together with two binary (sub)trees, we have Hence the counting GF of binary trees is Þµ ½ Þ ¾ Þµ
16 Solving the equation before for Þµ and since ¼µ ¼ ½, Þµ Ô ½ ½ Þ ¾Þ ½ Þ ¼ Þ ¼ Extracting the Ò th coefficient of Þµ we find ¾Ò Þ Ò Ò Þµ Ò ½
17 A more sophisticated example arises in the analysis of the number of branch mispredictions made by quicksort (Kaligosi, Martínez, Sanders, 2006).
18 We have a random permutation of ½Ò and we scan it from left to right. Assume ½. For ¾, we say there is a left brach misprediction whenever ½ and, or ½ and. For Ò, there is a right BM if ½ and, or ½ and. Additionally, there is a left BM if ¾ and a right BM if Ò.
19 We have a random permutation of ½Ò and we scan it from left to right. Assume ½. For ¾, we say there is a left brach misprediction whenever ½ and, or ½ and. For Ò, there is a right BM if ½ and, or ½ and. Additionally, there is a left BM if ¾ and a right BM if Ò.
20 We have a random permutation of ½Ò and we scan it from left to right. Assume ½. For ¾, we say there is a left brach misprediction whenever ½ and, or ½ and. For Ò, there is a right BM if ½ and, or ½ and. Additionally, there is a left BM if ¾ and a right BM if Ò.
21 We want to know the expected number of branch mispredictions when the choosen pivot is the th element of the array. We transform the original problem to counting bitstrings. Given a bistring Ü of length starting with a 0 and containing Ø ½ 0 s, the number of left BMs is the number of times we find a 0 followed by a 1, or a 1 followed by a 0 in Ü. We go from a permutation to a bitstring Ü by setting Ü ¼ if ½, and Ü ½ otherwise.
22 We want to know the expected number of branch mispredictions when the choosen pivot is the th element of the array. We transform the original problem to counting bitstrings. Given a bistring Ü of length starting with a 0 and containing Ø ½ 0 s, the number of left BMs is the number of times we find a 0 followed by a 1, or a 1 followed by a 0 in Ü. We go from a permutation to a bitstring Ü by setting Ü ¼ if ½, and Ü ½ otherwise.
23 We want to know the expected number of branch mispredictions when the choosen pivot is the th element of the array. We transform the original problem to counting bitstrings. Given a bistring Ü of length starting with a 0 and containing Ø ½ 0 s, the number of left BMs is the number of times we find a 0 followed by a 1, or a 1 followed by a 0 in Ü. We go from a permutation to a bitstring Ü by setting Ü ¼ if ½, and Ü ½ otherwise.
24 0 A 1 1 B 0 ÒØÖ number of strings of length Ò with Ø 0 s ending at state and incurring Ö BMs ÒØÖ number of strings of length Ò with Ø 0 s ending at state and incurring Ö BMs
25 0 A 1 1 B 0 Ü Ù Þµ Ü Ù Þµ ÒÖØ ÒÖØ ÒØÖ Ü Ø Ù Ö Þ Ò ÒØÖ Ü Ø Ù Ö Þ Ò
26 0 A 1 1 B 0 ½ ÜÞ ÜÙÞ Þ ÞÙ
27 0 A 1 1 B 0 ½ Þ ÙÞ ÜÙ ½ Þµ ½ ÙÝ ¾ Þ ¾ ½ Þ Take derivatives with respect to Ù, set Ù ½, and extract the coefficient Ê Ø of Þ ½ Ý Ø in ; then multiply by the number of random permutations producing a bitstring with Ø ½ 0 s among the first bits and sum for all Ø.
28 Another important set of techniques comes from complex variable analysis. Under suitable technical conditions, if Þµ is analytic in a disk Þ ¾ Þ ½ and has a single dominant singularity at Þ ½ then Þµ Þµ µ Þ Ò Þµ Þ Ò Þµ This is one of the useful transfer lemmas of Flajolet and Odlyzko (1990). Many other similar results are extremely useful when computing asymptotic estimates for the Ò th coefficient of a generating function.
29 In recent years, complex analysis techniques and perturbation theory have been used to prove powerful results such as Hwang s quasi power theorem, which allows one to prove the convergence in law to a Gaussian distribution of many combinatorial parameters in strings, permutations, trees, etc., as well as local limits and the speed of convergence.
30 Another example is motivated by the analysis of a combinatorial algorithm that shuffles two trees. Given two binary trees Ì ½ and Ì ¾ their shuffle or intersection is defined as follows Ì ½ Ì ¾ if ̽ or Ì ¾, Æ Ä ½ Ä ¾ Ê ½ Ê ¾ µ if Ì Æ Ä Ê µ
31 Let Ë Ü Ýµ Ì ½Ì ¾µ¾ ÈÖ Ì ½ Ì ¾ µ Ì ½ Ì ¾ Ü Ì½ Ý Ì¾ The coefficient of Ü Ñ Ý Ò in Ë Ü Ýµ is the average size of the intersection of a pair of trees with sizes Ñ and Ò, resp.
32 If we assume independently drawn trees then ÈÖ Ì ½ Ì ¾ µ ÈÖ Ì ½ µ ÈÖ Ì ¾ µ If we assume that the total size of Ì ½ Ì ¾ µ is Ò and all possible partitions are equally likely (binary search tree probability model) ÈÖ Ì ½ Ì ¾ µ ÈÖ Ì ½µ ÈÖ Ì ¾ µ Ì ½ Ì ¾ ½
33 Furthermore, In the uniform probability model ÈÖ Ì µ ½ Ò, with Ò Ì. In the binary search tree model ÈÖ Ì µ ½ if Ì, ÈÖ Äµ ÈÖ Êµ Ì if Ì Æ Ä Êµ.
34 In the binary search tree probability model, the symbolic method yields the hyperbolic PDE that Ë Ü Ýµ satisfies ¾ Ë Ü Ýµ ÜÝ ½ ½ ܵ ¾ ½ ݵ ¾ Ë Ü Ýµ ¾ ½ ܵ ½ ݵ and Ë Ü ¼µ Ë ¼ ݵ ¼.
35 If we consider Þµ ½ Þ Þ ¼ Ë Ø Øµ Ø then Þ Ò Þµ is the average size of the intersection of a pair of trees of total size Ò drawn according to the binary search tree probability model.
36 A delicate analysis of the solution of the PDE for Ë Ü Ýµ shows that ½ Ô Ô Þµ ¾ ¾µ  ¼ ¾ ¾i ÐÒ ½ Þ with  ¼ ܵ the Bessel function of first kind of order 0.
37 The function Þµ has a unique dominant singulary at Þ ½; as Þ ½, we have ½ Ô Â ¼ ¾ ¾i ÐÒ ½ Ô ¾ ½ Þ ½ Ö ÐÒ ½ ½ Þ ½ ½ Ç ½ Þµ ¾Ô ¾ ½ ÐÒ ½ Þµ
38 Applying transfer lemmas Ô Ò Þ Ò Þµ Ò¾ ¾ ½ ½ Ô ½ Ç ÐÒ Ò ÐÓ Ò and ¾ Ô ¾ ¾ Ô ¾ Ô ¾µ ¼¼¼
39 Conclusion We ve just scratched the surface of the rich number of applications of discrete mathematics for the analysis of algorithms. I hope I have convinced you that Analysis of Algorithms is deeply rooted in mathematics, most notably discrete mathematics.
40 Several of the talks in the minisymposium show nice applications of the techniques briefly described here, arising in the analysis of sorting and selection algorithms, automata theory, multidimensional data structures, polynomial factorization, decomposable combinatorial structures, union find data structures, etc. Other talks will present other elegant and powerful techniques that we haven t presented now.
A Language for Task Orchestration and its Semantic Properties
DEPARTMENT OF COMPUTER SCIENCES A Language for Task Orchestration and its Semantic Properties David Kitchin, William Cook and Jayadev Misra Department of Computer Science University of Texas at Austin
More informationRandomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity
Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity László Babai Peter G. Kimmel Department of Computer Science The University of Chicago 1100 East 58th Street Chicago,
More informationSelf-Testing Polynomial Functions Efficiently and over Rational Domains
Chapter 1 Self-Testing Polynomial Functions Efficiently and over Rational Domains Ronitt Rubinfeld Madhu Sudan Ý Abstract In this paper we give the first self-testers and checkers for polynomials over
More informationNarrowing confidence interval width of PAC learning risk function by algorithmic inference
Narrowing confidence interval width of PAC learning risk function by algorithmic inference Bruno Apolloni, Dario Malchiodi Dip. di Scienze dell Informazione, Università degli Studi di Milano Via Comelico
More informationBlock vs. Stream cipher
Block vs. Stream cipher Idea of a block cipher: partition the text into relatively large (e.g. 128 bits) blocks and encode each block separately. The encoding of each block generally depends on at most
More informationCONVEX OPTIMIZATION OVER POSITIVE POLYNOMIALS AND FILTER DESIGN. Y. Genin, Y. Hachez, Yu. Nesterov, P. Van Dooren
CONVEX OPTIMIZATION OVER POSITIVE POLYNOMIALS AND FILTER DESIGN Y. Genin, Y. Hachez, Yu. Nesterov, P. Van Dooren CESAME, Université catholique de Louvain Bâtiment Euler, Avenue G. Lemaître 4-6 B-1348 Louvain-la-Neuve,
More informationSoft-decision Decoding of Chinese Remainder Codes
Soft-decision Decoding of Chinese Remainder Codes Venkatesan Guruswami Amit Sahai Ý Madhu Sudan Þ Abstract Given Ò relatively prime integers Ô Ô Ò and an integer Ò, the Chinese Remainder Code, ÊÌ É ÔÔÒ,
More informationF O R SOCI AL WORK RESE ARCH
7 TH EUROPE AN CONFERENCE F O R SOCI AL WORK RESE ARCH C h a l l e n g e s i n s o c i a l w o r k r e s e a r c h c o n f l i c t s, b a r r i e r s a n d p o s s i b i l i t i e s i n r e l a t i o n
More informationMargin Maximizing Loss Functions
Margin Maximizing Loss Functions Saharon Rosset, Ji Zhu and Trevor Hastie Department of Statistics Stanford University Stanford, CA, 94305 saharon, jzhu, hastie@stat.stanford.edu Abstract Margin maximizing
More informationu x + u y = x u . u(x, 0) = e x2 The characteristics satisfy dx dt = 1, dy dt = 1
Õ 83-25 Þ ÛÐ Þ Ð ÚÔÜØ Þ ÝÒ Þ Ô ÜÞØ ¹ 3 Ñ Ð ÜÞ u x + u y = x u u(x, 0) = e x2 ÝÒ Þ Ü ÞØ º½ dt =, dt = x = t + c, y = t + c 2 We can choose c to be zero without loss of generality Note that each characteristic
More informationPeriodic monopoles and difference modules
Periodic monopoles and difference modules Takuro Mochizuki RIMS, Kyoto University 2018 February Introduction In complex geometry it is interesting to obtain a correspondence between objects in differential
More informationAn Improved Quantum Fourier Transform Algorithm and Applications
An Improved Quantum Fourier Transform Algorithm and Applications Lisa Hales Group in Logic and the Methodology of Science University of California at Berkeley hales@cs.berkeley.edu Sean Hallgren Ý Computer
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 17, pp. 76-92, 2004. Copyright 2004,. ISSN 1068-9613. ETNA STRONG RANK REVEALING CHOLESKY FACTORIZATION M. GU AND L. MIRANIAN Ý Abstract. For any symmetric
More informationLearnability and the Doubling Dimension
Learnability and the Doubling Dimension Yi Li Genome Institute of Singapore liy3@gis.a-star.edu.sg Philip M. Long Google plong@google.com Abstract Given a set of classifiers and a probability distribution
More informationPrivacy Amplification Theorem for Noisy Main Channel
Privacy Amplification Theorem for Noisy Main Channel Valeri Korjik, Guillermo Morales-Luna, and Vladimir B. Balakirsky Telecommunications, CINVESTAV-IPN, Guadalajara Campus Prol. López Mateos Sur No. 590,
More informationThe Generalization of Quicksort
The Generalization of Quicksort Shyue-Horng Shiau Chang-Biau Yang Ý Department of Computer Science and Engineering National Sun Yat-Sen University Kaohsiung, Taiwan 804, Republic of China shiaush@cse.nsysu.edu.tw
More informationhal , version 1-27 Mar 2014
Author manuscript, published in "2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), New York, NY. : United States (2005)" 2 More formally, we denote by
More informationFramework for functional tree simulation applied to 'golden delicious' apple trees
Purdue University Purdue e-pubs Open Access Theses Theses and Dissertations Spring 2015 Framework for functional tree simulation applied to 'golden delicious' apple trees Marek Fiser Purdue University
More informationMutually orthogonal latin squares (MOLS) and Orthogonal arrays (OA)
and Orthogonal arrays (OA) Bimal Roy Indian Statistical Institute, Kolkata. Bimal Roy, Indian Statistical Institute, Kolkata. and Orthogonal arrays (O Outline of the talk 1 Latin squares 2 3 Bimal Roy,
More informationAnalysis of Spectral Kernel Design based Semi-supervised Learning
Analysis of Spectral Kernel Design based Semi-supervised Learning Tong Zhang IBM T. J. Watson Research Center Yorktown Heights, NY 10598 Rie Kubota Ando IBM T. J. Watson Research Center Yorktown Heights,
More informationData selection. Lower complexity bound for sorting
Data selection. Lower complexity bound for sorting Lecturer: Georgy Gimel farb COMPSCI 220 Algorithms and Data Structures 1 / 12 1 Data selection: Quickselect 2 Lower complexity bound for sorting 3 The
More informationFast Fourier Transform Solvers and Preconditioners for Quadratic Spline Collocation
Fast Fourier Transform Solvers and Preconditioners for Quadratic Spline Collocation Christina C. Christara and Kit Sun Ng Department of Computer Science University of Toronto Toronto, Ontario M5S 3G4,
More informationCitation Osaka Journal of Mathematics. 43(2)
TitleIrreducible representations of the Author(s) Kosuda, Masashi Citation Osaka Journal of Mathematics. 43(2) Issue 2006-06 Date Text Version publisher URL http://hdl.handle.net/094/0396 DOI Rights Osaka
More informationAn Introduction to Optimal Control Applied to Disease Models
An Introduction to Optimal Control Applied to Disease Models Suzanne Lenhart University of Tennessee, Knoxville Departments of Mathematics Lecture1 p.1/37 Example Number of cancer cells at time (exponential
More informationCost Distribution Shaping: The Relations Between Bode Integral, Entropy, Risk-Sensitivity, and Cost Cumulant Control
Cost Distribution Shaping: The Relations Between Bode Integral, Entropy, Risk-Sensitivity, and Cost Cumulant Control Chang-Hee Won Abstract The cost function in stochastic optimal control is viewed as
More informationAn Example file... log.txt
# ' ' Start of fie & %$ " 1 - : 5? ;., B - ( * * B - ( * * F I / 0. )- +, * ( ) 8 8 7 /. 6 )- +, 5 5 3 2( 7 7 +, 6 6 9( 3 5( ) 7-0 +, => - +< ( ) )- +, 7 / +, 5 9 (. 6 )- 0 * D>. C )- +, (A :, C 0 )- +,
More information5. Analytic Combinatorics
ANALYTIC COMBINATORICS P A R T O N E 5. Analytic Combinatorics http://aofa.cs.princeton.edu Analytic combinatorics is a calculus for the quantitative study of large combinatorial structures. Features:
More informationThe Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies Parikshit Gopalan Georgia Tech. parik@cc.gatech.edu Phokion G. Kolaitis Ý IBM Almaden. kolaitis@us.ibm.com Christos
More informationarxiv: v1 [math.dg] 19 Mar 2012
BEREZIN-TOEPLITZ QUANTIZATION AND ITS KERNEL EXPANSION XIAONAN MA AND GEORGE MARINESCU ABSTRACT. We survey recent results [33, 34, 35, 36] about the asymptotic expansion of Toeplitz operators and their
More informationWorst case complexity of the optimal LLL algorithm
Worst case complexity of the optimal LLL algorithm ALI AKHAVI GREYC - Université de Caen, F-14032 Caen Cedex, France aliakhavi@infounicaenfr Abstract In this paper, we consider the open problem of the
More informationEntropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors Omer Reingold Ý Salil Vadhan Þ Avi Wigderson Ü February 23, 2001 Abstract The main contribution of this work is
More informationFrequency domain representation and singular value decomposition
EOLSS Contribution 643134 Frequency domain representation and singular value decomposition AC Antoulas Department of Electrical and Computer Engineering Rice University Houston, Texas 77251-1892, USA e-mail:
More informationMacLane s coherence theorem expressed as a word problem
MacLane s coherence theorem expressed as a word problem Paul-André Melliès Preuves, Programmes, Systèmes CNRS UMR-7126, Université Paris 7 ÑÐÐ ÔÔ ºÙ ÙºÖ DRAFT In this draft, we reduce the coherence theorem
More information! " # $! % & '! , ) ( + - (. ) ( ) * + / 0 1 2 3 0 / 4 5 / 6 0 ; 8 7 < = 7 > 8 7 8 9 : Œ Š ž P P h ˆ Š ˆ Œ ˆ Š ˆ Ž Ž Ý Ü Ý Ü Ý Ž Ý ê ç è ± ¹ ¼ ¹ ä ± ¹ w ç ¹ è ¼ è Œ ¹ ± ¹ è ¹ è ä ç w ¹ ã ¼ ¹ ä ¹ ¼ ¹ ±
More informationFinding small factors of integers. Speed of the number-field sieve. D. J. Bernstein University of Illinois at Chicago
The number-field sieve Finding small factors of integers Speed of the number-field sieve D. J. Bernstein University of Illinois at Chicago Prelude: finding denominators 87366 22322444 in R. Easily compute
More informationIntegrability in QCD and beyond
Integrability in QCD and beyond Vladimir M. Braun University of Regensburg thanks to Sergey Derkachov, Gregory Korchemsky and Alexander Manashov KITP, QCD and String Theory Integrability in QCD and beyond
More informationCausality and Boundary of wave solutions
Causality and Boundary of wave solutions IV International Meeting on Lorentzian Geometry Santiago de Compostela, 2007 José Luis Flores Universidad de Málaga Joint work with Miguel Sánchez: Class. Quant.
More informationarxiv: v2 [math.gt] 15 Mar 2017
BAND-PASSES AND LONG VIRTUAL KNOT CONCORDANCE MICAH CHRISMAN arxiv:1603.00267v2 [math.gt] 15 Mar 2017 Abstract. Every classical knot is band-pass equivalent to the unknot or the trefoil. The band-pass
More informationCorrelation at Low Temperature: I. Exponential Decay
Correlation at Low Temperature: I. Exponential Decay Volker Bach FB Mathematik; Johannes Gutenberg-Universität; D-55099 Mainz; Germany; email: vbach@mathematik.uni-mainz.de Jacob Schach Møller Ý Département
More informationOptimal Control of PDEs
Optimal Control of PDEs Suzanne Lenhart University of Tennessee, Knoville Department of Mathematics Lecture1 p.1/36 Outline 1. Idea of diffusion PDE 2. Motivating Eample 3. Big picture of optimal control
More informationETIKA V PROFESII PSYCHOLÓGA
P r a ž s k á v y s o k á š k o l a p s y c h o s o c i á l n í c h s t u d i í ETIKA V PROFESII PSYCHOLÓGA N a t á l i a S l o b o d n í k o v á v e d ú c i p r á c e : P h D r. M a r t i n S t r o u
More informationOn the Performance of Random Vector Quantization Limited Feedback Beamforming in a MISO System
1 On the Performance of Random Vector Quantization Limited Feedback Beamforming in a MISO System Chun Kin Au-Yeung, Student Member, IEEE, and David J. Love, Member, IEEE Abstract In multiple antenna wireless
More informationQuantum Algorithms for Element Distinctness
Quantum Algorithms for Element Distinctness Harry Buhrman Christoph Dürr Þ Mark Heiligman Ü Peter Høyer ß Frédéric Magniez Miklos Santha Ronald de Wolf ÝÝ Abstract We present several applications of quantum
More informationLecture 16: Modern Classification (I) - Separating Hyperplanes
Lecture 16: Modern Classification (I) - Separating Hyperplanes Outline 1 2 Separating Hyperplane Binary SVM for Separable Case Bayes Rule for Binary Problems Consider the simplest case: two classes are
More informationCombinatorial/probabilistic analysis of a class of search-tree functionals
Combinatorial/probabilistic analysis of a class of search-tree functionals Jim Fill jimfill@jhu.edu http://www.mts.jhu.edu/ fill/ Mathematical Sciences The Johns Hopkins University Joint Statistical Meetings;
More informationÇÙÐ Ò ½º ÅÙÐ ÔÐ ÔÓÐÝÐÓ Ö Ñ Ò Ú Ö Ð Ú Ö Ð ¾º Ä Ò Ö Ö Ù Ð Ý Ó ËÝÑ ÒÞ ÔÓÐÝÒÓÑ Ð º Ì ÛÓ¹ÐÓÓÔ ÙÒÖ Ö Ô Û Ö Ö ÖÝ Ñ ¹ ÝÓÒ ÑÙÐ ÔÐ ÔÓÐÝÐÓ Ö Ñ
ÅÙÐ ÔÐ ÔÓÐÝÐÓ Ö Ñ Ò ÝÒÑ Ò Ò Ö Ð Ö Ò Ó Ò Ö ÀÍ ÖÐ Òµ Ó Ò ÛÓÖ Û Ö Ò ÖÓÛÒ Ö Ú ½ ¼¾º ¾½ Û Åº Ä Ö Ö Ú ½ ¼¾º ¼¼ Û Äº Ñ Ò Ëº Ï ÒÞ ÖÐ Å ÒÞ ½ º¼ º¾¼½ ÇÙÐ Ò ½º ÅÙÐ ÔÐ ÔÓÐÝÐÓ Ö Ñ Ò Ú Ö Ð Ú Ö Ð ¾º Ä Ò Ö Ö Ù Ð Ý Ó ËÝÑ
More informationEquality and Monodic First-Order Temporal Logic
Equality and Monodic First-Order Temporal Logic Anatoli Degtyarev, Michael Fisher, and Alexei Lisitsa Logic and Computation Group, Department of Computer Science University of Liverpool, Liverpool L69
More informationRandom Matrices and Transfer Matrix Techniques for the Integer Quantum Hall Effect
Random Matrices and Transfer Matrix Techniques for the Integer Quantum Hall Effect Dissertation zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften an der Mathematisch-Naturwissenschaftlichen
More informationPseudorandom generators without the XOR Lemma
Pseudorandom generators without the XOR Lemma [Extended Abstract] Madhu Sudan Ý Luca Trevisan Þ Salil Vadhan Ü ØÖØ ½ ÁÒØÖÓÙØÓÒ Impagliazzo and Wigderson [IW97] have recently shown that if there exists
More informationHomomorphism Preservation Theorem. Albert Atserias Universitat Politècnica de Catalunya Barcelona, Spain
Homomorphism Preservation Theorem Albert Atserias Universitat Politècnica de Catalunya Barcelona, Spain Structure of the talk 1. Classical preservation theorems 2. Preservation theorems in finite model
More informationLA PRISE DE CALAIS. çoys, çoys, har - dis. çoys, dis. tons, mantz, tons, Gas. c est. à ce. C est à ce. coup, c est à ce
> ƒ? @ Z [ \ _ ' µ `. l 1 2 3 z Æ Ñ 6 = Ð l sl (~131 1606) rn % & +, l r s s, r 7 nr ss r r s s s, r s, r! " # $ s s ( ) r * s, / 0 s, r 4 r r 9;: < 10 r mnz, rz, r ns, 1 s ; j;k ns, q r s { } ~ l r mnz,
More informationAverage Case Analysis of QuickSort and Insertion Tree Height using Incompressibility
Average Case Analysis of QuickSort and Insertion Tree Height using Incompressibility Tao Jiang, Ming Li, Brendan Lucier September 26, 2005 Abstract In this paper we study the Kolmogorov Complexity of a
More informationCramér-Rao Bounds for Parametric Shape Estimation in Inverse Problems
Cramér-Rao Bounds for Parametric Shape Estimation in Inverse Problems Jong Chul Ye Philips Research - USA 345 Scarborough Road Briarcliff Manor, NY 10510 Yoram Bresler and Pierre Moulin Coordinated Science
More informationImplicit Formae in Genetic Algorithms
Implicit Formae in Genetic Algorithms Márk Jelasity ½ and József Dombi ¾ ¾ ½ Student of József Attila University, Szeged, Hungary jelasity@inf.u-szeged.hu Department of Applied Informatics, József Attila
More informationTwo-scale homogenization of a hydrodynamic Elrod-Adams model
March 2004 1 Two-scale homogenization of a hydrodynamic Elrod-Adams model G. Bayada MAPLY CNRS UMR-5585 / LAMCOS CNRS UMR-5514, INSA Lyon, 69621 Villeurbanne cedex, France S. Martin MAPLY CNRS UMR-5585,
More informationGeneral Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations
General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations OFER ARIELI AND ARNON AVRON, Department of Computer Science, School of Mathematical Sciences, Tel-Aviv University,
More informationPose Determination from a Single Image of a Single Parallelogram
Ê 32 Ê 5 ¾ Vol.32, No.5 2006 9 ACTA AUTOMATICA SINICA September, 2006 Û Ê 1) 1, 2 2 1 ( ÔÅ Æ 100041) 2 (Ñ Ò º 100037 ) (E-mail: fmsun@163.com) ¼ÈÙ Æ Ü Äµ ÕÑ ÅÆ ¼ÈÙ ÆÄ Ä Äº ¼ÈÙ ÆÄ Ü ÜÓ µ É» Ì É»²ÂÄÎ ¼ÐÅÄÕ
More informationOC330C. Wiring Diagram. Recommended PKH- P35 / P50 GALH PKA- RP35 / RP50. Remarks (Drawing No.) No. Parts No. Parts Name Specifications
G G " # $ % & " ' ( ) $ * " # $ % & " ( + ) $ * " # C % " ' ( ) $ * C " # C % " ( + ) $ * C D ; E @ F @ 9 = H I J ; @ = : @ A > B ; : K 9 L 9 M N O D K P D N O Q P D R S > T ; U V > = : W X Y J > E ; Z
More informationForward and Backward Chaining in Linear Logic
Forward and Backward Chaining in Linear Logic James Harland ½ David Pym ¾ Michael Winikoff ½ ½ Department of Computer Science, Royal Melbourne Institute of Technology ¾ Queen Mary and Westfield College,
More informationOn the Average Complexity of Brzozowski s Algorithm for Deterministic Automata with a Small Number of Final States
On the Average Complexity of Brzozowski s Algorithm for Deterministic Automata with a Small Number of Final States Sven De Felice 1 and Cyril Nicaud 2 1 LIAFA, Université Paris Diderot - Paris 7 & CNRS
More informationSpeeding up characteristic 2: I. Linear maps II. The Å(Ò) game III. Batching IV. Normal bases. D. J. Bernstein University of Illinois at Chicago
Speeding up characteristic 2: I. Linear maps II. The Å(Ò) game III. Batching IV. Normal bases D. J. Bernstein University of Illinois at Chicago NSF ITR 0716498 Part I. Linear maps Consider computing 0
More informationOperational domain theory and topology of a sequential programming language
Operational domain theory and topology of a sequential programming language Martín Escardó Ho Weng Kin School of Computer Science, University of Birmingham, UK, revised 17th October 2005 Abstract A number
More informationprobability of k samples out of J fall in R.
Nonparametric Techniques for Density Estimation (DHS Ch. 4) n Introduction n Estimation Procedure n Parzen Window Estimation n Parzen Window Example n K n -Nearest Neighbor Estimation Introduction Suppose
More informationLower and Upper Bound Theory
Lower and Upper Bound Theory Adnan YAZICI Dept. of Computer Engineering Middle East Technical Univ. Ankara - TURKEY 1 Lower and Upper Bound Theory How fast can we sort? Most of the sorting algorithms are
More informationPartial Quicksort. Conrado Martínez
Partial Quicksort Conrado Martínez Abstract This short note considers the following common problem: rearrange a given array with n elements, so that the first m places contain the m smallest elements in
More informationLund Institute of Technology Centre for Mathematical Sciences Mathematical Statistics
Lund Institute of Technology Centre for Mathematical Sciences Mathematical Statistics STATISTICAL METHODS FOR SAFETY ANALYSIS FMS065 ÓÑÔÙØ Ö Ü Ö Ì ÓÓØ ØÖ Ô Ð ÓÖ Ø Ñ Ò Ý Ò Ò ÐÝ In this exercise we will
More informationPlanning for Reactive Behaviors in Hide and Seek
University of Pennsylvania ScholarlyCommons Center for Human Modeling and Simulation Department of Computer & Information Science May 1995 Planning for Reactive Behaviors in Hide and Seek Michael B. Moore
More informationLABELLED DEDUCTION. SEÁN MATTHEWS Max-Planck-Insitut für Informatik. LUCA VIGANÒ University of Freiburg
LABELLED DEDUCTN LABELLED DEDUCTN Edited by DAVD BASN University of Freiburg MARCELL D AGSTN University of Ferrara DV M GABBAY King s College SEÁN MATTHEWS Max-Planck-nsitut für nformatik LUCA VGANÒ University
More informationFront-end. Organization of a Modern Compiler. Middle1. Middle2. Back-end. converted to control flow) Representation
register allocation instruction selection Code Low-level intermediate Representation Back-end Assembly array references converted into low level operations, loops converted to control flow Middle2 Low-level
More informationRecursion Theoretic Methods in Descriptive Set Theory and Infinite Dimensional Topology. Takayuki Kihara
Recursion Theoretic Methods in Descriptive Set Theory and Infinite Dimensional Topology Takayuki Kihara Department of Mathematics, University of California, Berkeley, USA Joint Work with Arno Pauly (University
More informationProblem. Problem Given a dictionary and a word. Which page (if any) contains the given word? 3 / 26
Binary Search Introduction Problem Problem Given a dictionary and a word. Which page (if any) contains the given word? 3 / 26 Strategy 1: Random Search Randomly select a page until the page containing
More informationChunksort: A Generalized Partial Sort Algorithm
Chunksort: A Generalized Partial Sort Algorithm Conrado Martínez Univ. Politècnica de Catalunya, Spain Ottawa-Carleton Discrete Math Day May 2006 1 Introduction 2 The algorithm 3 The analysis 4 Conclusions
More informationI118 Graphs and Automata
I8 Graphs and Automata Takako Nemoto http://www.jaist.ac.jp/ t-nemoto/teaching/203--.html April 23 0. Û. Û ÒÈÓ 2. Ø ÈÌ (a) ÏÛ Í (b) Ø Ó Ë (c) ÒÑ ÈÌ (d) ÒÌ (e) É Ö ÈÌ 3. ÈÌ (a) Î ÎÖ Í (b) ÒÌ . Û Ñ ÐÒ f
More informationAutomatic Control III (Reglerteknik III) fall Nonlinear systems, Part 3
Automatic Control III (Reglerteknik III) fall 20 4. Nonlinear systems, Part 3 (Chapter 4) Hans Norlander Systems and Control Department of Information Technology Uppsala University OSCILLATIONS AND DESCRIBING
More informationSorting. Chapter 11. CSE 2011 Prof. J. Elder Last Updated: :11 AM
Sorting Chapter 11-1 - Sorting Ø We have seen the advantage of sorted data representations for a number of applications q Sparse vectors q Maps q Dictionaries Ø Here we consider the problem of how to efficiently
More information3. Generating Functions
ANALYTIC COMBINATORICS P A R T O N E 3. Generating Functions http://aofa.cs.princeton.edu ANALYTIC COMBINATORICS P A R T O N E 3. Generating Functions OF OGFs Solving recurrences Catalan numbers EGFs Counting
More informationPARAMETERIZING CONJUGACY CLASSES OF MAXIMAL UNRAMIFIED TORI VIA BRUHAT-TITS THEORY
PARAMETERIZING CONJUGACY CLASSES OF MAXIMAL UNRAMIFIED TORI VIA BRUHAT-TITS THEORY STEPHEN DEBACKER ABSTRACT. Let denote a field with nontrivial discrete valuation. We assume that is complete with perfect
More informationString averages and self-organizing maps for strings
String averages and selforganizing maps for strings Igor Fischer, Andreas Zell Universität Tübingen WilhelmSchickardInstitut für Informatik Köstlinstr. 6, 72074 Tübingen, Germany fischer, zell @informatik.unituebingen.de
More informationAnalysis of Approximate Quickselect and Related Problems
Analysis of Approximate Quickselect and Related Problems Conrado Martínez Univ. Politècnica Catalunya Joint work with A. Panholzer and H. Prodinger LIP6, Paris, April 2009 Introduction Quickselect finds
More informationHITCHIN KOBAYASHI CORRESPONDENCE, QUIVERS, AND VORTICES INTRODUCTION
ËÁ Ì ÖÛÒ ËÖĐÓÒÖ ÁÒØÖÒØÓÒÐ ÁÒ ØØÙØ ÓÖ ÅØÑØÐ ÈÝ ÓÐØÞÑÒÒ ¹½¼¼ ÏÒ Ù ØÖ ÀØÒßÃÓÝ ÓÖÖ ÓÒÒ ÉÙÚÖ Ò ÎÓÖØ ÄÙ ÐÚÖÞßÓÒ ÙÐ Ç Ö ÖßÈÖ ÎÒÒ ÈÖÖÒØ ËÁ ½¾ ¾¼¼ µ ÂÒÙÖÝ ½ ¾¼¼ ËÙÓÖØ Ý Ø Ù ØÖÒ ÖÐ ÅÒ ØÖÝ Ó ÙØÓÒ ËÒ Ò ÙÐØÙÖ ÚÐÐ Ú
More informationT i t l e o f t h e w o r k : L a M a r e a Y o k o h a m a. A r t i s t : M a r i a n o P e n s o t t i ( P l a y w r i g h t, D i r e c t o r )
v e r. E N G O u t l i n e T i t l e o f t h e w o r k : L a M a r e a Y o k o h a m a A r t i s t : M a r i a n o P e n s o t t i ( P l a y w r i g h t, D i r e c t o r ) C o n t e n t s : T h i s w o
More informationMean, Median, Mode, More. Tilmann Gneiting University of Washington
Mean, Median, Mode, More ÓÖ ÉÙ ÒØ Ð ÇÔØ Ñ Ð ÈÓ ÒØ ÈÖ ØÓÖ Tilmann Gneiting University of Washington Mean, Median, Mode, More or Quantiles as Optimal Point Predictors Tilmann Gneiting University of Washington
More informationA Generalization of Principal Component Analysis to the Exponential Family
A Generalization of Principal Component Analysis to the Exponential Family Michael Collins Sanjoy Dasgupta Robert E. Schapire AT&T Labs Research 8 Park Avenue, Florham Park, NJ 7932 mcollins, dasgupta,
More informationB œ c " " ã B œ c 8 8. such that substituting these values for the B 3 's will make all the equations true
System of Linear Equations variables Ð unknowns Ñ B" ß B# ß ÞÞÞ ß B8 Æ Æ Æ + B + B ÞÞÞ + B œ, "" " "# # "8 8 " + B + B ÞÞÞ + B œ, #" " ## # #8 8 # ã + B + B ÞÞÞ + B œ, 3" " 3# # 38 8 3 ã + 7" B" + 7# B#
More informationRandomized Sorting Algorithms Quick sort can be converted to a randomized algorithm by picking the pivot element randomly. In this case we can show th
CSE 3500 Algorithms and Complexity Fall 2016 Lecture 10: September 29, 2016 Quick sort: Average Run Time In the last lecture we started analyzing the expected run time of quick sort. Let X = k 1, k 2,...,
More informationOn Partial Sorting. Conrado Martínez. Univ. Politècnica de Catalunya, Spain
Univ. Politècnica de Catalunya, Spain 10th Seminar on the Analysis of Algorithms MSRI, Berkeley, U.S.A. June 2004 1 Introduction 2 3 Introduction Partial sorting: Given an array A of n elements and a value
More informationAnalytic Combinatorics: A Primer
Analytic Combinatorics: A Primer Conrado Martínez Univ. Politècnica de Catalunya, Spain April 2011 What is this course about? Analytic Combinatorics seeks to develop mathematical techniques that help us
More informationBlock-tridiagonal matrices
Block-tridiagonal matrices. p.1/31 Block-tridiagonal matrices - where do these arise? - as a result of a particular mesh-point ordering - as a part of a factorization procedure, for example when we compute
More informationObservations on the Stability Properties of Cooperative Systems
1 Observations on the Stability Properties of Cooperative Systems Oliver Mason and Mark Verwoerd Abstract We extend two fundamental properties of positive linear time-invariant (LTI) systems to homogeneous
More informationData Structures and Algorithms
Data Structures and Algorithms Autumn 2018-2019 Outline 1 Algorithm Analysis (contd.) Outline Algorithm Analysis (contd.) 1 Algorithm Analysis (contd.) Growth Rates of Some Commonly Occurring Functions
More informationx 0, x 1,...,x n f(x) p n (x) = f[x 0, x 1,..., x n, x]w n (x),
ÛÜØ Þ ÜÒ Ô ÚÜ Ô Ü Ñ Ü Ô Ð Ñ Ü ÜØ º½ ÞÜ Ò f Ø ÚÜ ÚÛÔ Ø Ü Ö ºÞ ÜÒ Ô ÚÜ Ô Ð Ü Ð Þ Õ Ô ÞØÔ ÛÜØ Ü ÚÛÔ Ø Ü Ö L(f) = f(x)dx ÚÜ Ô Ü ÜØ Þ Ü Ô, b] Ö Û Þ Ü Ô Ñ ÒÖØ k Ü f Ñ Df(x) = f (x) ÐÖ D Ü Ü ÜØ Þ Ü Ô Ñ Ü ÜØ Ñ
More informationAlso, course highlights the importance of discrete structures towards simulation of a problem in computer science and engineering.
The objectives of Discrete Mathematical Structures are: To introduce a number of Discrete Mathematical Structures (DMS) found to be serving as tools even today in the development of theoretical computer
More informationThis document has been prepared by Sunder Kidambi with the blessings of
Ö À Ö Ñ Ø Ò Ñ ÒØ Ñ Ý Ò Ñ À Ö Ñ Ò Ú º Ò Ì ÝÊ À Å Ú Ø Å Ê ý Ú ÒØ º ÝÊ Ú Ý Ê Ñ º Å º ² ºÅ ý ý ý ý Ö Ð º Ñ ÒÜ Æ Å Ò Ñ Ú «Ä À ý ý This document has been prepared by Sunder Kidambi with the blessings of Ö º
More informationI N F S Y S R E S E A R C H R E P O R T PROBABILISTIC LOGIC UNDER COHERENCE: COMPLEXITY AND ALGORITHMS INSTITUT FÜR INFORMATIONSSYSTEME
I N F S Y S R E S E A R C H R E P O R T INSTITUT FÜR INFORMATIONSSYSTEME ABTEILUNG WISSENSBASIERTE SYSTEME PROBABILISTIC LOGIC UNDER COHERENCE: COMPLEXITY AND ALGORITHMS Veronica BIAZZO Thomas LUKASIEWICZ
More informationQuick Sort Notes , Spring 2010
Quick Sort Notes 18.310, Spring 2010 0.1 Randomized Median Finding In a previous lecture, we discussed the problem of finding the median of a list of m elements, or more generally the element of rank m.
More informationOn Urquhart s C Logic
On Urquhart s C Logic Agata Ciabattoni Dipartimento di Informatica Via Comelico, 39 20135 Milano, Italy ciabatto@dsiunimiit Abstract In this paper we investigate the basic many-valued logics introduced
More informationCombinatorial Enumeration. Jason Z. Gao Carleton University, Ottawa, Canada
Combinatorial Enumeration Jason Z. Gao Carleton University, Ottawa, Canada Counting Combinatorial Structures We are interested in counting combinatorial (discrete) structures of a given size. For example,
More informationsolve EB œ,, we can row reduce the augmented matrix
PY Decomposition: Factoring E œ P Y Motivation To solve EB œ,, we can row reduce the augmented matrix Ò + + ÞÞÞ+ ÞÞÞ + l, Ó µ ÞÞÞ µ Ò- - ÞÞÞ- ÞÞÞ-. Ó " # 3 8 " # 3 8 When we get to Ò-" -# ÞÞÞ -3 ÞÞÞ-8Ó
More informationâ, Đ (Very Long Baseline Interferometry, VLBI)
½ 55 ½ 5 Í Vol.55 No.5 2014 9 ACTA ASTRONOMICA SINICA Sep., 2014» Á Çý è 1,2 1,2 å 1,2 Ü ô 1,2 ï 1,2 ï 1,2 à 1,3 Æ Ö 3 ý (1 Á Í 200030) (2 Á Í û À 210008) (3 541004) ÇÅè 1.5 GHz Á è, î Í, û ÓÆ Å ò ½Ò ¼ï.
More informationSME 3023 Applied Numerical Methods
UNIVERSITI TEKNOLOGI MALAYSIA SME 3023 Applied Numerical Methods Solution of Nonlinear Equations Abu Hasan Abdullah Faculty of Mechanical Engineering Sept 2012 Abu Hasan Abdullah (FME) SME 3023 Applied
More information