Simple Expressions for Success Run Distributions in Bernoulli Trials
|
|
- Angela Wells
- 5 years ago
- Views:
Transcription
1 Siple Epressions for Success Run Distributions in Bernoulli Trials Marco Muselli Istituto per i Circuiti Elettronici Consiglio Nazionale delle Ricerche via De Marini, Genova, Ital Eail: uselli@ice.ge.cnr.it Abstract New siple forulae for soe probabilit distributions of success runs in Bernoulli trials are found b using the classical definition of run. These epressions contain onl one suation of ordinar binoial coefficients and thus allow a faster and efficient coputation. Kewords: Bernoulli trials, nuber of success runs, longest success run, discrete distributions of order k. 1 Introduction Most recent studies on success runs in Bernoulli trials follow the fraework contained in the fundaental book of Feller 1968 and in particular his definition of run as a recurrent pattern. According to this definition two consecutive success runs a not be separated b an failure. As an eaple, the sequence SSSSSS where the sbol S denotes a success can be interpreted as containing 3 success runs of length 2 or 2 success runs of length 3. In practice, if we search for runs of length k, the counting of consecutive successes ust be restarted when the desired value k is reached see Feller, 1968, pag It follows fro this definition that the location of success runs in a sequence of n Bernoulli trials depends on the reference length k. Although this can see quite unnatural, soe atheatical derivations are greatl siplified particularl when dealing with asptotical epressions. Moreover, in soe cases, such as the probabilit distribution for the longest run, the final relation does not depend on the definition eploed during the proof. In the present work the stud of success runs in Bernoulli trials is carried out b using the classical definition which asserts that two consecutive runs ust be separated b one or ore failures. Following this approach in section 2 basic epressions for k and L n k 1 are derived, where k is the nuber of success runs with length k or ore and L n is the length of the longest success run in n Bernoulli trials. Unlike corresponding forulae obtained b hilippou and Makri 1986 and Hirano 1986, onl ordinar first order binoial coefficients are eploed and suations over an inde set deterined b the solutions of a diophantine equation are not involved. In particular, the epression for the distribution of L n reported in Burr and Cane 1961 and Godbole 1990 is again obtained b following a new procedure which allows to find sipler forulae containing a single suation section 3. Such an approach can be etended to the derivation of probabilit distributions of siilar rando variables, such as the kth order negative binoial and the kth order geoetric ones introduced b hilippou, Georghiou and hilippou, Their interest fro a coputational point of view is evident. 1
2 2 Basic epressions for the distribution of M k n and L n Referring to the classical definition of success runs, let S n, k and L n denote respectivel the nuber of successes, the nuber of success runs with length k or ore and the length of the longest success run in n Bernoulli trials, each with success probabilit p 0 p 1. The probabilit of having a failure will be denoted with q 1 p in the following. Let us begin with a theore that provides a first epression for the distribution of k : Theore 1 If k have k is the nuber of success runs with length k or ore in n Bernoulli trials, we where k, n and are positive integers. roof. Consider the following events 1 n k n k A j {A sequence of k consecutive successes starts in X j } p n q 1 where X j is the outcoe of the jth trial and denote with J {j 1,..., j } a subset of {1,..., n} containing eactl different indices; we can write k A j1 A j2 A j j 1,j 2,...,j j J A j having denoted with A j the copleent of the set A j. Thus b appling the inclusion-eclusion principle see Feller, 1968, pag. 106 we obtain k 1 r 2 where r is given b r A j1 A j j 1,...,j n k 1 j 1,...,j A j1 A j, S n n 3 The bounds for the nuber of failures can be easil obtained b noting that at least 1 failures are needed for separating the success runs with length k or ore starting in the positions j 1,..., j. On the other hand, the realization of these runs requires at least k successes. Now, suppose without loss of generalit that the indices j 1,..., j are ordered in an increasing wa j 1 j ; according to the classical definition of run the sequences of n trials contained in the event A j for j > 1 ust have a failure as the j 1th outcoe X j 1 F. It follows that the probabilit A j1 A j, S n n is nonnull onl if j 1 + k + 1 j 2, j 1 + k + 1 j, j + k 1 n Since j 1 1, b cobining these inequalities we obtain that r 0 for 1 + k k 1 > n > n + 1 k + 1 > n + 1 k having denoted with the integer not greater than. 2
3 In the opposite case we note that j 1,...,j A j1 A j, S n n N, p n q 5 where N, is the nuber of different sequences of n Bernoulli trials having eactl n successes and containing success runs with length k or ore. In fact, onl these sequences, each of which has probabilit p n q of occurring, provide a nonnull contribution to the suation on the left hand side in 5. A careful cobinatorial reasoning leads to an eplicit epression for N, ; in fact, if we consider + 1 the position of the failures we have different was of placing success runs of length k so that each of the is separated fro the neighbors at least b a failure. Then we can put the n k reaining n k successes into ever configuration in possible was. Thus we obtain for N, the following epression N, + 1 n k B considering 6 and 5 the equation 3 for r becoes r n k and 2 gives the desired epression 1 for k b 4. n k B interchanging the order of suation in 1 we have: p n q 6 if we use the upper bound for provided k n k 1 in+1, n p n q k n k 7 siilar to the epression for N n k found in Godbole 1990 b eploing the alternative definition of success run. The analog between the two forulae is ephasized b setting j in 7. Fro theore 1 we can directl obtain the relation for the distribution of the longest success run L n in n Bernoulli trials. For this ai it is useful to enunciate the following Lea 1 If k and n are positive integers, we have n k n k 0 for 0 < n/k roof. Consider the function f given b f 1 1 k +1 1 n k n+ 1 3
4 and copute its th derivative in the point 0 +1 f n k + i! n k 0 i1 0 Now, the direct coputation of the first derivatives ields epressions containing a coon ultiplicative factor 1 1 ν where ν is a positive integer. Consequentl we obtain n k 1! f Thus, consider the following two cases: when 0 < n + 1/k + 1 we have + 1 < n /k and for + 1 < n /k 8 consequentl n k n k n k 0 9 when n + 1/k + 1 < n/k we have n k 0 for ever + 1; then n k 0 for n /k < + 1 and 9 is again verified. B taking into account 8 we can write in+1, n k n k 0 n k n k and b virtue of lea 1 we obtain that the left hand side is null for 0 < n/k. This result allows to find the correct epression for the distribution of L n Theore 2 If L n denotes the length of the longest success run in n Bernoulli trials, we have n n L n k 1 p n q k n k n k 0 where k and n are positive integers. roof. Since M k n denotes the nuber of success runs with length k or ore, it follows fro 1 that L n k 1 n+1 1 k 1 4 n k n k p n q 10 11
5 and b interchanging the suations on and : L n k n k n k n k n k p n q p n q being Now, we note that L n k 1 1 L n k n k n k p n q and b interchanging the order of suation n in+1, L n k 1 p n q n k n k 12 In fact the inequalit 1 gives the upper bound + 1 for while n k leads to n /k. But, b virtue of 10 and lea 1 we obtain fro 12 the desired relation 11. Theore 2 provides the well known epression for L n k 1 alread obtained b Burr and Cane 1961 and Godbole 1990 with other ethods. Fro this result also the forulae for L n k, S n r and L n k, S n r presented in Gibbons 1971 follows directl. Incidentall, equation 12 could be obtained b setting 0 in 7; in this wa the achieveent of 11 would have been shorter. Unfortunatel, the proof of theore 1 onl holds for positive values of and thus the passage above would not be theoreticall acceptable. 3 Siplified epressions for soe success run distributions Fro equations 1 and 11 obtained for the distributions of k and L n respectivel follow soe interesting siplified epressions. The contain onl a single suation of ordinar first order binoial coefficients and therefore their corresponding coputation tie is considerabl lowered. Theore 3 If k have k is the nuber of success runs with length k or ore in n Bernoulli trials, we 1 where k, n and are positive integers. p k q 1 n k 1 n k 13 5
6 roof. B setting j n k in 1, we obtain k 1 1 n k +1 j0 n k j + 1 n k +1 p k q n k j0 n k j n k j + 1 Now, if we ake use of the ascal triangle identit, we have n k +1 j0 n k +1 j0 n k +1 j0 n k 1 p k+j q n k j n k j p/q j 14 n k j + 1 n k p/q j j n k j n k j n k + p/q j 1 j n k j n k j n k + p/q j n k + 1 j n k j j 1/q n k +1 n k + 1/q n k 15 In the last passage the following relation has been eploed see Feller, 1968, pag. 63: ν 0 h ν h ν r ν t ν h r 1 + t r which holds for r, h non-negative integers and for ever real nuber t. B substituting 15 in 14 we obtain the desired relation 13. Fro 13 it is possible to obtain the corresponding siplified epression for the distribution of the longest success run L n. This forula has alread been found b Labiris and apastavridis 1985 and Hwang 1986 in the stud of reliabilit for consecutive-k-out-of-n sstes. Corollar 1 If L n denotes the length of the longest success run in n Bernoulli trials, we have L n k p k q 1 n k 1 n k 16 where k and n are positive integers. roof. It is sufficient to proceed as in the first part of the proof of theore 2 b noting that L n k 1 1 L n k k p k q 1 n k 1 n k 6
7 The siplified forulae 13 and 16 per M k n and L n k 1 can be used for obtaining epressions with single suation of other interesting probabilit distributions. As an eaple let us consider the kth order negative binoial rando variable NB k,r defined as the waiting tie till the rth success run of length k or ore introduced b hilippou, Georghiou and hilippou, 1983, with the alternative definition of run. In case of classical definition of success run we have the following Theore 4 The rando variable NB k,r is characterized b the following probabilit distribution NB k,r +1 k+1 r 1 r 1 r 1 p k q 1 k 1 2 k roof. B definition of NB k,r ever sequence of n Bernoulli trials belonging to the event {NB k,r } ust end with k successes preceded b a failure. Thus, we have NB k,r p k q M k k 1 r 1 and b using the epression 13 for M k k 1 r 1 we obtain k NB k,r p k q 1 r+1 p k q 1 r 1 r 1 + 1k 1 + 1k k+1 r 1 r 1 r 1 p k q 1 k 1 2 k 1 1 This theore also allows to obtain the forula for the probabilit distribution of the kth order geoetric rando variable G k ; it is sufficient to set r 1 in 17 G k +1 k p k q 1 k 1 2 k 1 1 In this case the two epressions deriving fro different definitions of success run coincide Godbole, Acknowledgeent Thanks are due to prof. F. Fagnola for his valuable coents as well as to the referee for bringing to attention the paper of Labiris and apastavridis and the work of Hwang. References Burr, E.J. and G. Cane 1961, Longest run of consecutive observations having a specified attribute, Bioetrika 48, Feller, W. 1968, An Introduction to robabilit Theor and Its Applications, vol. 1 Wile, New York, 3rd ed. 7
8 Gibbons, J.D Nonparaetric Statistical Inference Mc Graw-Hill, New York. Godbole, A , Specific forulae for soe success run distributions, Statist. robab. Lett. 10, Hirano, K. 1986, Soe properties of the distributions of order k, in: A.N. hilippou, A.F. Horada and G.E. Bergu, eds., Fibonacci Nubers with Applications. roc. 1st Internat. Conf. on Fibonacci Nubers and their Applications Reidel, Dordrecht. Hwang, F.K. 1986, Siplified reliabilities for consecutive-k-out-of-n sstes, SIAM J. Alg. Disc. Meth. 7, Labiris, M. and S. apastavridis 1985, Eact reliabilit forulas for linear & circular consecutive-k-out-of-n:f sstes, IEEE Trans. Reliabilit R-34, hilippou, A.N., Georghiou, C. and G.N. hilippou 1983, A generalized geoetric distribution and soe of its properties, Statist. robab. Lett. 1, hilippou, A.N. and F.S. Makri 1986, Successes, runs and longest runs, Statist. robab. Lett. 4,
#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES
#A5 INTEGERS 10 (010), 697-703 COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES Bruce E Sagan 1 Departent of Matheatics, Michigan State University, East Lansing,
More informationProblem Set 2 Due Sept, 21
EE6: Rando Processes in Sstes Lecturer: Jean C. Walrand Proble Set Due Sept, Fall 6 GSI: Assane Guee This proble set essentiall reviews notions of conditional epectation, conditional distribution, and
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationNumerical solution of Boundary Value Problems by Piecewise Analysis Method
ISSN 4-86 (Paper) ISSN 5-9 (Online) Vol., No.4, Nuerical solution of Boundar Value Probles b Piecewise Analsis Method + O. A. TAIWO; A.O ADEWUMI and R. A. RAJI * Departent of Matheatics, Universit of Ilorin,
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationA PROOF OF A CONJECTURE OF MELHAM
A PROOF OF A CONJECTRE OF MELHAM EMRAH KILIC, ILKER AKKS, AND HELMT PRODINGER Abstract. In this paper, we consider Melha s conecture involving Fibonacci and Lucas nubers. After rewriting it in ters of
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More information1. INTRODUCTION AND RESULTS
SOME IDENTITIES INVOLVING THE FIBONACCI NUMBERS AND LUCAS NUMBERS Wenpeng Zhang Research Center for Basic Science, Xi an Jiaotong University Xi an Shaanxi, People s Republic of China (Subitted August 00
More informationComputability and Complexity Random Sources. Computability and Complexity Andrei Bulatov
Coputabilit and Copleit 29- Rando Sources Coputabilit and Copleit Andrei Bulatov Coputabilit and Copleit 29-2 Rando Choices We have seen several probabilistic algoriths, that is algoriths that ake soe
More informationA PROOF OF MELHAM S CONJECTURE
A PROOF OF MELHAM S CONJECTRE EMRAH KILIC 1, ILKER AKKS, AND HELMT PRODINGER 3 Abstract. In this paper, we consider Melha s conecture involving Fibonacci and Lucas nubers. After rewriting it in ters of
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informationPoly-Bernoulli Numbers and Eulerian Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018, Article 18.6.1 Poly-Bernoulli Nubers and Eulerian Nubers Beáta Bényi Faculty of Water Sciences National University of Public Service H-1441
More informationThe Frobenius problem, sums of powers of integers, and recurrences for the Bernoulli numbers
Journal of Nuber Theory 117 (2006 376 386 www.elsevier.co/locate/jnt The Frobenius proble, sus of powers of integers, and recurrences for the Bernoulli nubers Hans J.H. Tuenter Schulich School of Business,
More informationClosed-form evaluations of Fibonacci Lucas reciprocal sums with three factors
Notes on Nuber Theory Discrete Matheatics Print ISSN 30-32 Online ISSN 2367-827 Vol. 23 207 No. 2 04 6 Closed-for evaluations of Fibonacci Lucas reciprocal sus with three factors Robert Frontczak Lesbank
More informationEXPLICIT CONGRUENCES FOR EULER POLYNOMIALS
EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS Zhi-Wei Sun Departent of Matheatics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn Abstract In this paper we establish soe explicit
More informationSampling How Big a Sample?
C. G. G. Aitken, 1 Ph.D. Sapling How Big a Saple? REFERENCE: Aitken CGG. Sapling how big a saple? J Forensic Sci 1999;44(4):750 760. ABSTRACT: It is thought that, in a consignent of discrete units, a certain
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More information4 = (0.02) 3 13, = 0.25 because = 25. Simi-
Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =
More informationTEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES
TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES S. E. Ahed, R. J. Tokins and A. I. Volodin Departent of Matheatics and Statistics University of Regina Regina,
More informationA RECURRENCE RELATION FOR BERNOULLI NUMBERS. Mümün Can, Mehmet Cenkci, and Veli Kurt
Bull Korean Math Soc 42 2005, No 3, pp 67 622 A RECURRENCE RELATION FOR BERNOULLI NUMBERS Müün Can, Mehet Cenci, and Veli Kurt Abstract In this paper, using Gauss ultiplication forula, a recurrence relation
More informationEFFECTIVE MODAL MASS & MODAL PARTICIPATION FACTORS Revision I
EFFECTIVE MODA MASS & MODA PARTICIPATION FACTORS Revision I B To Irvine Eail: to@vibrationdata.co Deceber, 5 Introduction The effective odal ass provides a ethod for judging the significance of a vibration
More informationAnalysis of Polynomial & Rational Functions ( summary )
Analysis of Polynoial & Rational Functions ( suary ) The standard for of a polynoial function is ( ) where each of the nubers are called the coefficients. The polynoial of is said to have degree n, where
More informationAlgorithms for Bernoulli and Related Polynomials
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 10 (2007, Article 07.5.4 Algoriths for Bernoulli Related Polynoials Ayhan Dil, Veli Kurt Mehet Cenci Departent of Matheatics Adeniz University Antalya,
More informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
More information8.1 Exponents and Roots
Section 8. Eponents and Roots 75 8. Eponents and Roots Before defining the net famil of functions, the eponential functions, we will need to discuss eponent notation in detail. As we shall see, eponents
More informationPOWER SUM IDENTITIES WITH GENERALIZED STIRLING NUMBERS
POWER SUM IDENTITIES WITH GENERALIZED STIRLING NUMBERS KHRISTO N. BOYADZHIEV Abstract. We prove several cobinatorial identities involving Stirling functions of the second ind with a coplex variable. The
More informationLeft-to-right maxima in words and multiset permutations
Left-to-right axia in words and ultiset perutations Ay N. Myers Saint Joseph s University Philadelphia, PA 19131 Herbert S. Wilf University of Pennsylvania Philadelphia, PA 19104
More informationON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS
Palestine Journal of Matheatics Vol 4) 05), 70 76 Palestine Polytechnic University-PPU 05 ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS Julius Fergy T Rabago Counicated by
More informationThe full procedure for drawing a free-body diagram which isolates a body or system consists of the following steps. 8 Chapter 3 Equilibrium
8 Chapter 3 Equilibriu all effect on a rigid bod as forces of equal agnitude and direction applied b direct eternal contact. Eaple 9 illustrates the action of a linear elastic spring and of a nonlinear
More informationModified Systematic Sampling in the Presence of Linear Trend
Modified Systeatic Sapling in the Presence of Linear Trend Zaheen Khan, and Javid Shabbir Keywords: Abstract A new systeatic sapling design called Modified Systeatic Sapling (MSS, proposed by ] is ore
More informationElastic Force: A Force Balance: Elastic & Gravitational Force: Force Example: Determining Spring Constant. Some Other Forces
Energy Balance, Units & Proble Solving: Mechanical Energy Balance ABET Course Outcoes: 1. solve and docuent the solution of probles involving eleents or configurations not previously encountered (e) (e.g.
More informationLecture 3: October 2, 2017
Inforation and Coding Theory Autun 2017 Lecturer: Madhur Tulsiani Lecture 3: October 2, 2017 1 Shearer s lea and alications In the revious lecture, we saw the following stateent of Shearer s lea. Lea 1.1
More informationLost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies
OPERATIONS RESEARCH Vol. 52, No. 5, Septeber October 2004, pp. 795 803 issn 0030-364X eissn 1526-5463 04 5205 0795 infors doi 10.1287/opre.1040.0130 2004 INFORMS TECHNICAL NOTE Lost-Sales Probles with
More informationTHE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT
THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationBeyond Mere Convergence
Beyond Mere Convergence Jaes A. Sellers Departent of Matheatics The Pennsylvania State University 07 Whitore Laboratory University Park, PA 680 sellers@ath.psu.edu February 5, 00 REVISED Abstract In this
More informationCHARACTER SUMS AND RAMSEY PROPERTIES OF GENERALIZED PALEY GRAPHS. Nicholas Wage Appleton East High School, Appleton, WI 54915, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 CHARACTER SUMS AND RAMSEY PROPERTIES OF GENERALIZED PALEY GRAPHS Nicholas Wage Appleton East High School, Appleton, WI 54915, USA
More informationPage 1 Lab 1 Elementary Matrix and Linear Algebra Spring 2011
Page Lab Eleentary Matri and Linear Algebra Spring 0 Nae Due /03/0 Score /5 Probles through 4 are each worth 4 points.. Go to the Linear Algebra oolkit site ransforing a atri to reduced row echelon for
More informationA symbolic operator approach to several summation formulas for power series II
A sybolic operator approach to several suation forulas for power series II T. X. He, L. C. Hsu 2, and P. J.-S. Shiue 3 Departent of Matheatics and Coputer Science Illinois Wesleyan University Blooington,
More informationEfficient Filter Banks And Interpolators
Efficient Filter Banks And Interpolators A. G. DEMPSTER AND N. P. MURPHY Departent of Electronic Systes University of Westinster 115 New Cavendish St, London W1M 8JS United Kingdo Abstract: - Graphical
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationSequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson) February 5,
Sequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson) February 5, 2015 31 11 Motif Finding Sources for this section: Rouchka, 1997, A Brief Overview of Gibbs Sapling. J. Buhler, M. Topa:
More informationThe concavity and convexity of the Boros Moll sequences
The concavity and convexity of the Boros Moll sequences Ernest X.W. Xia Departent of Matheatics Jiangsu University Zhenjiang, Jiangsu 1013, P.R. China ernestxwxia@163.co Subitted: Oct 1, 013; Accepted:
More information8.1 Force Laws Hooke s Law
8.1 Force Laws There are forces that don't change appreciably fro one instant to another, which we refer to as constant in tie, and forces that don't change appreciably fro one point to another, which
More informationThe Frequent Paucity of Trivial Strings
The Frequent Paucity of Trivial Strings Jack H. Lutz Departent of Coputer Science Iowa State University Aes, IA 50011, USA lutz@cs.iastate.edu Abstract A 1976 theore of Chaitin can be used to show that
More informationDerivative at a point
Roberto s Notes on Differential Calculus Capter : Definition of derivative Section Derivative at a point Wat you need to know already: Te concept of liit and basic etods for coputing liits. Wat you can
More informationarxiv: v1 [cs.ds] 3 Feb 2014
arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/
More informationFinite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields
Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for
More informationOn Process Complexity
On Process Coplexity Ada R. Day School of Matheatics, Statistics and Coputer Science, Victoria University of Wellington, PO Box 600, Wellington 6140, New Zealand, Eail: ada.day@cs.vuw.ac.nz Abstract Process
More informationLectures 8 & 9: The Z-transform.
Lectures 8 & 9: The Z-transfor. 1. Definitions. The Z-transfor is defined as a function series (a series in which each ter is a function of one or ore variables: Z[] where is a C valued function f : N
More informationSTUDY KNOWHOW PROGRAM STUDY AND LEARNING CENTRE. Functions & Graphs
STUDY KNOWHOW PROGRAM STUDY AND LEARNING CENTRE Functions & Graphs Contents Functions and Relations... 1 Interval Notation... 3 Graphs: Linear Functions... 5 Lines and Gradients... 7 Graphs: Quadratic
More informationAbout the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry
About the definition of paraeters and regies of active two-port networks with variable loads on the basis of projective geoetry PENN ALEXANDR nstitute of Electronic Engineering and Nanotechnologies "D
More informationCHAPTER 8 CONSTRAINED OPTIMIZATION 2: SEQUENTIAL QUADRATIC PROGRAMMING, INTERIOR POINT AND GENERALIZED REDUCED GRADIENT METHODS
CHAPER 8 CONSRAINED OPIMIZAION : SEQUENIAL QUADRAIC PROGRAMMING, INERIOR POIN AND GENERALIZED REDUCED GRADIEN MEHODS 8. Introduction In the previous chapter we eained the necessary and sufficient conditions
More informationLATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS.
i LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS. C. A. CHURCH, Jr. and H. W. GOULD, W. Virginia University, Morgantown, W. V a. In this paper we give
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationA Bernstein-Markov Theorem for Normed Spaces
A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :
More informationResearch Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials
Discrete Dynaics in Nature and Society Volue 202, Article ID 927953, pages doi:055/202/927953 Research Article Soe Forulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynoials Yuan He and
More informationEFFECT OF WALL REINFORCEMENTS, APPLIED LATERAL FORCES AND VERTICAL AXIAL LOADS ON SEISMIC BEHAVIOR OF CONFINED CONCRETE MASONRY WALLS
EFFECT OF WALL REINFORCEMENTS, APPLIED LATERAL FORCES AND VERTICAL AXIAL LOADS ON SEISMIC BEHAVIOR OF CONFINED CONCRETE MASONRY WALLS 984 Koji YOSHIMURA 1, Kenji KIKUCHI 2, Masauki KUROKI 3, Lizhen LIU
More informationR. L. Ollerton University of Western Sydney, Penrith Campus DC1797, Australia
FURTHER PROPERTIES OF GENERALIZED BINOMIAL COEFFICIENT k-extensions R. L. Ollerton University of Western Sydney, Penrith Capus DC1797, Australia A. G. Shannon KvB Institute of Technology, North Sydney
More informationThe degree of a typical vertex in generalized random intersection graph models
Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent
More informationCSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13
CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture
More informationPure Core 1. Revision Notes
Pure Core Revision Notes Ma 06 Pure Core Algebra... Indices... Rules of indices... Surds... 4 Simplifing surds... 4 Rationalising the denominator... 4 Quadratic functions... 5 Completing the square....
More informationThe Euler-Maclaurin Formula and Sums of Powers
DRAFT VOL 79, NO 1, FEBRUARY 26 1 The Euler-Maclaurin Forula and Sus of Powers Michael Z Spivey University of Puget Sound Tacoa, WA 98416 spivey@upsedu Matheaticians have long been intrigued by the su
More informationLecture 21. Interior Point Methods Setup and Algorithm
Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and
More informationA STUDY OF THE DESIGN OF A CANTILEVER TYPE MULTI-D.O.F. DYNAMIC VIBRATION ABSORBER FOR MICRO MACHINE TOOLS
ICSV4 Cairns Australia 9- Jul, 7 A STUDY OF THE DESIGN OF A CANTILEVER TYPE MULTI-D.O.F. DYNAMIC VIBRATION ABSORBER FOR MICRO MACHINE TOOLS Sung-Hun Jang, Sung-Min Ki, Shil-Geun Ki,Young-Hu Choi and Jong-Kwon
More informationIntroduction to Discrete Optimization
Prof. Friedrich Eisenbrand Martin Nieeier Due Date: March 9 9 Discussions: March 9 Introduction to Discrete Optiization Spring 9 s Exercise Consider a school district with I neighborhoods J schools and
More informationRandom Variables and Densities
Rando Variables and Densities Review: Probabilit and Statistics Sa Roweis Rando variables X represents outcoes or states of world. Instantiations of variables usuall in lower case: We will write p() to
More informationLecture 9 November 23, 2015
CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)
More informationRandomized Recovery for Boolean Compressed Sensing
Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch
More informationTABLE FOR UPPER PERCENTAGE POINTS OF THE LARGEST ROOT OF A DETERMINANTAL EQUATION WITH FIVE ROOTS. By William W. Chen
TABLE FOR UPPER PERCENTAGE POINTS OF THE LARGEST ROOT OF A DETERMINANTAL EQUATION WITH FIVE ROOTS By Willia W. Chen The distribution of the non-null characteristic roots of a atri derived fro saple observations
More informationDivisibility of Polynomials over Finite Fields and Combinatorial Applications
Designs, Codes and Cryptography anuscript No. (will be inserted by the editor) Divisibility of Polynoials over Finite Fields and Cobinatorial Applications Daniel Panario Olga Sosnovski Brett Stevens Qiang
More informationMULTIPLAYER ROCK-PAPER-SCISSORS
MULTIPLAYER ROCK-PAPER-SCISSORS CHARLOTTE ATEN Contents 1. Introduction 1 2. RPS Magas 3 3. Ites as a Function of Players and Vice Versa 5 4. Algebraic Properties of RPS Magas 6 References 6 1. Introduction
More informationarxiv: v2 [math.nt] 5 Sep 2012
ON STRONGER CONJECTURES THAT IMPLY THE ERDŐS-MOSER CONJECTURE BERND C. KELLNER arxiv:1003.1646v2 [ath.nt] 5 Sep 2012 Abstract. The Erdős-Moser conjecture states that the Diophantine equation S k () = k,
More information27 Oscillations: Introduction, Mass on a Spring
Chapter 7 Oscillations: Introduction, Mass on a Spring 7 Oscillations: Introduction, Mass on a Spring If a siple haronic oscillation proble does not involve the tie, you should probably be using conservation
More informationSoft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis
Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES
More informationacceleration of 2.4 m/s. (b) Now, we have two rubber bands (force 2F) pulling two glued objects (mass 2m). Using F ma, 2.0 furlongs x 2.0 s 2 4.
5.. 5.6. Model: An object s acceleration is linearl proportional to the net force. Solve: (a) One rubber band produces a force F, two rubber bands produce a force F, and so on. Because F a and two rubber
More information2. THE FUNDAMENTAL THEOREM: n\n(n)
OBTAINING DIVIDING FORMULAS n\q(ri) FROM ITERATED MAPS Chyi-Lung Lin Departent of Physics, Soochow University, Taipei, Taiwan, 111, R.O.C. {SubittedMay 1996-Final Revision October 1997) 1. INTRODUCTION
More informationWhat is Probability? (again)
INRODUCTION TO ROBBILITY Basic Concepts and Definitions n experient is any process that generates well-defined outcoes. Experient: Record an age Experient: Toss a die Experient: Record an opinion yes,
More informationKONINKL. NEDERL. AKADEMIE VAN WETENSCHAPPEN AMSTERDAM Reprinted from Proceedings, Series A, 61, No. 1 and Indag. Math., 20, No.
KONINKL. NEDERL. AKADEMIE VAN WETENSCHAPPEN AMSTERDAM Reprinted fro Proceedings, Series A, 6, No. and Indag. Math., 20, No., 95 8 MATHEMATIC S ON SEQUENCES OF INTEGERS GENERATED BY A SIEVIN G PROCES S
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationAn Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control
An Extension to the Tactical Planning Model for a Job Shop: Continuous-Tie Control Chee Chong. Teo, Rohit Bhatnagar, and Stephen C. Graves Singapore-MIT Alliance, Nanyang Technological Univ., and Massachusetts
More informationEvaluation of various partial sums of Gaussian q-binomial sums
Arab J Math (018) 7:101 11 https://doiorg/101007/s40065-017-0191-3 Arabian Journal of Matheatics Erah Kılıç Evaluation of various partial sus of Gaussian -binoial sus Received: 3 February 016 / Accepted:
More informationLinear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions
Linear recurrences and asyptotic behavior of exponential sus of syetric boolean functions Francis N. Castro Departent of Matheatics University of Puerto Rico, San Juan, PR 00931 francis.castro@upr.edu
More informationA NOTE ON ENTROPY OF LOGIC
Yugoslav Journal of Operations Research 7 07), Nuber 3, 385 390 DOI: 0.98/YJOR5050B A NOTE ON ENTROPY OF LOGIC Marija BORIČIĆ Faculty of Organizational Sciences, University of Belgrade, Serbia arija.boricic@fon.bg.ac.rs
More informationChapter 4 Analytic Trigonometry
Analtic Trigonometr Chapter Analtic Trigonometr Inverse Trigonometric Functions The trigonometric functions act as an operator on the variable (angle, resulting in an output value Suppose this process
More informationBernoulli numbers and generalized factorial sums
Bernoulli nubers and generalized factorial sus Paul Thoas Young Departent of Matheatics, College of Charleston Charleston, SC 29424 paul@ath.cofc.edu June 25, 2010 Abstract We prove a pair of identities
More informationEstimation of the Mean of the Exponential Distribution Using Maximum Ranked Set Sampling with Unequal Samples
Open Journal of Statistics, 4, 4, 64-649 Published Online Septeber 4 in SciRes http//wwwscirporg/ournal/os http//ddoiorg/436/os4486 Estiation of the Mean of the Eponential Distribution Using Maiu Ranked
More informationA Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science
A Better Algorith For an Ancient Scheduling Proble David R. Karger Steven J. Phillips Eric Torng Departent of Coputer Science Stanford University Stanford, CA 9435-4 Abstract One of the oldest and siplest
More informationNOTES AND CORRESPONDENCE. Two Extra Components in the Brier Score Decomposition
752 W E A T H E R A N D F O R E C A S T I N G VOLUME 23 NOTES AND CORRESPONDENCE Two Extra Coponents in the Brier Score Decoposition D. B. STEPHENSON School of Engineering, Coputing, and Matheatics, University
More informationON THE 2-PART OF THE BIRCH AND SWINNERTON-DYER CONJECTURE FOR QUADRATIC TWISTS OF ELLIPTIC CURVES
ON THE 2-PART OF THE BIRCH AND SWINNERTON-DYER CONJECTURE FOR QUADRATIC TWISTS OF ELLIPTIC CURVES LI CAI, CHAO LI, SHUAI ZHAI Abstract. In the present paper, we prove, for a large class of elliptic curves
More informationDescent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA,
Descent polynoials arxiv:1710.11033v2 [ath.co] 13 Nov 2017 Alexander Diaz-Lopez Departent of Matheatics and Statistics, Villanova University, 800 Lancaster Avenue, Villanova, PA 19085, USA, alexander.diaz-lopez@villanova.edu
More informationOn a Multisection Style Binomial Summation Identity for Fibonacci Numbers
Int J Contep Math Sciences, Vol 9, 04, no 4, 75-86 HIKARI Ltd, www-hiarico http://dxdoiorg/0988/ics0447 On a Multisection Style Binoial Suation Identity for Fibonacci Nubers Bernhard A Moser Software Copetence
More informationPhysics 207: Lecture 26. Announcements. Make-up labs are this week Final hwk assigned this week, final quiz next week.
Torque due to gravit Rotation Recap Phsics 07: ecture 6 Announceents Make-up labs are this week Final hwk assigned this week, final quiz net week Toda s Agenda Statics Car on a Hill Static Equilibriu Equations
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationLecture 21 Principle of Inclusion and Exclusion
Lecture 21 Principle of Inclusion and Exclusion Holden Lee and Yoni Miller 5/6/11 1 Introduction and first exaples We start off with an exaple Exaple 11: At Sunnydale High School there are 28 students
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probability and Stochastic Processes: A Friendly Introduction for Electrical and oputer Engineers Roy D. Yates and David J. Goodan Proble Solutions : Yates and Goodan,1..3 1.3.1 1.4.6 1.4.7 1.4.8 1..6
More informationAcyclic Colorings of Directed Graphs
Acyclic Colorings of Directed Graphs Noah Golowich Septeber 9, 014 arxiv:1409.7535v1 [ath.co] 6 Sep 014 Abstract The acyclic chroatic nuber of a directed graph D, denoted χ A (D), is the iniu positive
More information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
More information