For 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

Size: px
Start display at page:

Download "For 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"

Transcription

1 Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA , USA Fax: (40) Keywords: decetive function, fast transforms, tness functions, Haar functions, Walsh functions Abstract Walsh functions are orthogonal, rectangular functions that take values 1 and form a convenient basis for the exansion of genetic algorithm tness functions. Since their introduction into genetic algorithms [, ], they have been used to comute the average tness values of schemata, to decide whether functions are hard or easy for genetic algorithms, and to design decetive functions for the genetic algorithm. In [10], Haar functions were introduced as an alternative to Walsh functions and it was shown that Haar functions are in general more comutationally advantageous. This aer revisits Haar functions, albeit with a slight variation to [10]'s denition, uses the functions to construct fully decetive functions for the genetic algorithm (as was done with Walsh functions [5]), and studies fast Haar transforms and fast Walsh-Haar transforms. 1 Introduction Orthonormal bases have catured the attention of researchers in a variety of elds. In wavelet theory, \orthonormal wavelet bases are used as a tool to describe mathematically the `increment in information' needed to go from a coarse aroximation to a higher resolution aroximation [3]. Digital electronics brought the necessity for more ractical bases than Fourier's sine/cosine functions. Orthogonal, rectangular functions are better suited for digital electronics and have also been introduced as theoretical tools for the analysis of genetic algorithms [, ]. One of the reasons behind the success of Walsh's rectangular functions as a theoretical tool in genetic algorithms is related to the exansion of schemata in terms of Walsh coecients. More recisely, the shorter the order of the schema (the smaller the number of xed ositions), the fewer Walsh coecients it needs in the exansion. In [5], Walsh functions were used to construct fully-decetive functions. After the introduction of Haar functions, in which we use a variation to the denition found in [10], we make use of these functions to construct, in a more ecient way than with Walsh functions, similar decetive functions. We then study two fast transforms, the fast Haar transform, and the fast Walsh-Haar transform. Because of the interdeendent nature of fast transforms, the comutation of a single term is built uon the values of revious levels: many more levels for Walsh than Haar. We conclude the aer by reiterating the comutational advantage that Haar functions have over their Walsh counterarts, and observe that it might be advantageous to use Haar functions rather than Walsh's for some alications. In some cases, such as with symmetrical functions and for very small roblem sizes, it might be referable to use Walsh functions. Haar Functions The Haar functions [6] form a comlete set of orthogonal rectangular basis functions. They take values of 1, 0 and?1, multilied by owers of and are usually dened on an interval normalized to [0; 1) [1]. In the following, the Haar functions are dened on [0; `), for any ositive integer `, and are normalized, H 0(x) 1 for 0 x < ` 1 for 0 x < `?1 H 1(x)?1 for `?1 x < ` H (x) H 3(x). H q m(x). H `?1(x) < : < : >< >: >< >: for 0 x < `?? for `? x < `?1 0 elsewhere in [0; `) for ()`? x < (3)`?? for (3)`? x < (4)`? 0 elsewhere in [0; `) ( ) q for (m)`?q?1 x and x < (m 1)`?q?1?( ) q for (m 1)`?q?1 x (1) and x < (m )`?q?1 0 elsewhere in [0; `) ( )`?1 for (`?1? 1) x?( )`?1 and x < `? 1 for `? 1 x < ` 0 elsewhere in [0; `)

2 For 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 integers in [0; `): That is: `?1 j0 hj Hj(x); () where the h j's, for j q m, are the Haar coecients given by: h j 1 ` `?1 H j(x): (3) The Haar function, H q m(x), has degree q and order m. Functions with the same degree are such that each one is just a \right-shift of the revious function. The osition of the function is given by the order m. The higher the degree q, the smaller the subinterval with non-zero values for H j(x). Haar functions of degree q contain q more nonzero arts than Haar functions of degree q?1. Consequently, each Haar coecient deends only on the local behavior of. More recisely, the following two results (equivalent to Beaucham's [1]) were obtained in [10]: Result 1 Every Haar coecient of degree q has at most `?q non-zero terms. Each term corresonds to a oint in an interval of the form [(i)`?q ; (i 1)`?q ): Consequently, the linear combination of each Haar coecient h j, where j q m; has at most `?q non-zero terms. In addition, h 0 has at most ` non-zero terms. Result For any xed value x [0; `), has at most ` 1 non-zero terms. In the next section, we use the Haar transform to build fully decetive functions. 3 Designing Fully Decetive 3-Bit Functions In his quest to identify functions that are suitable for genetic algorithms, Goldberg, using Walsh coecients, constructed fully decetive 3-bit functions [5]. We use Haar functions to construct such a function. If 111 is the otimal oint in the search sace of a maximization roblem, then all order-one schemata should lead away from it. In other words, we have: f(?? 1) < f(?? 0), f(?1?) < f(?0?), and f(1??) < f(0??). By using Equation and taking averages, the inequalities roduce: h 4 h 5 h 6 h 7 > 0, h h 3 > 0, and h 1 > 0, resectively. Similarly, for order-two schemata, we want them to lead away from the best. In other words, we should have: f(?00) > f(?01), f(?00) > f(?10), and f(?00) > f(?11); which roduce the following inequalities: h 4 h 6 > 0, (h h 3) >?h 4 h 5? h 6 h 7, and (h h 3) >?(h 4 h 5 h 6 h 7). f(0? 0) > f(0? 1), f(0? 0) > f(1? 0), and f(0? 0) > f(1? 1); h 4 h 5 > 0, h 1 (h 4 h 5? h 6? h 7) > 0, and h 1 (h 4 h 5 h 6 h 7) > 0, resectively. f(00?) > f(01?), f(00?) > f(10?), and f(00?) > f(11?); h > 0, h 1 (h? h 3) > 0, and h 1 (h h 3) > 0, resectively. Finally, since 111 is the otimal oint, we must have: f(111) > f(000), f(111) > f(001), f(111) > f(010), and f(111) > f(011), (h 1 h 4 h 7) (h h 3) < 0, (h 1? h 4 h 7) (h h 3) < 0, (h 1 h 5 h 7)? (h h 3) < 0, and (h 1? h 5 h 7)? (h? h 3) < 0, resectively. f(111) > f(100), f(111) > f(101), and f(111) > f(110), which roduces the following inequalities: h 6 h 7 h 3 < 0,?h 6 h 7 h 3 < 0, and h 7 < 0, resectively. Various solutions for the Haar coecients can be obtained by solving the simultaneous set of inequalities, thus roducing many fully decetive functions. A ossible solution to the inequalities is: h 0 h 1 1; h ; h 3? ; h 4 10; h 5?1; h 6 ; h 7?16: By relacing these values in Equation, we obtain the fully decetive 3-bit function given in Table 1. x ?14?4 0 14?1?30 34 Table 1: A fully decetive 3-bit function. The average tness of?10, for instance, can be exressed as a linear combination of at most four non-zero Walsh coecients: f(?10) w 0 w 1? w? w 3: The comutation of w i, for i 1; ; 3; 4, has terms, requiring the values of at all oints in the interval [0; ), thus bringing the total number of comutations to 3. The average tness of the same schema exressed as a linear combination of Haar coecients yields: f(?10) h 0? (h h3) h5 h7: According to Equation 3 and Result 1 from the revious section, the comutation of h and of h 3 has 3?1 terms each (see Result 1, where q 1 since 1 0, and 3 1 1), the comutation of h 5 and h 7 have 3? terms each (since 5 1 and 7 3), and h 0 requires the comutation of terms. Thus, the total number of comutations is 0 with the Haar exansion, a substantial savings over Walsh's exansion. To take advantage of the many reetitive comutations erformed with orthogonal transformations, fast Walsh and fast Haar transforms have been roosed. In the next section, we exlore and comare fast Haar and Walsh transforms.

3 4 Fast Transforms Fast transforms are reresented by layered owcharts where an intermediate result at a certain stage is obtained by adding (or subtracting) two intermediate results from the revious layer. Thus, when dealing with fast transforms, it is more aroriate to count the number of oerations (additions or subtractions), which is equivalent to counting the number of terms [13]. These are in-lace algorithms, and so memory storage for intermediate-stage comutations is not needed. The calculated air of outut values can relace the corresonding air of data in the receding stage. We study the fast Haar and the fast Walsh-Haar transforms, which are modied Cooley and Tukey algorithms, modeled after the fast Fourier transform. f(000) f(001) f(010) h? f(011)? h 5 f(100)?1 h 1 f(101)? h 6 f(110) f(111) multiliers f(000)?? h 4 h 7? h 3 Figure 1: Fast Haar transform. B A D h 0 w 0 C 1 1 h Fast Haar Transform Fast Haar transforms can be imlemented with on the order of at most ` comutations. More recisely, Roeser and Jernigan's fast Haar transform requires (N? 1) oerations [13], where N `. A ow diagram of their algorithm, with ` 3, is shown in Figure 1. Each term from the leftmost column is either added to (solid line) or subtracted from (dashed line) its adjacent term to roduce a new term for a subsequent stage of the algorithm. Some oerations have multilying factors greater than one and their values can be seen over the corresonding joining lines. The ow diagram going from left to right roduces the Haar coecients (after multilying by 1 `, according to Equation 3), while the oosite direction roduces the value of the function for any oint x [0; `? 1]. For examle, to comute h, we locate it in the gure, and read from right to left to obtain: h 1 [ (f(000) f(001))? (f(010) f(011))]: To comute f(010), we read from left to right (thick line): f(010) h 0 h 1? h h 5: Note that the numbers of terms in the exansions of h and f(010) are consistent with Results 1 and, resectively, from the revious section. We also note that the total number of oerations (additions and subtractions) in Figure 1, is (going from left to right), on the rst layer, 4 on the second, and on the last, i.e., 14, which is equal to (`? 1) for ` 3. Note that the coecients do not occur in sequential order. When ` 3, reading from to to bottom, the order is: h 0; h 4; h ; h 5, h 1; h 6; h 3; h 7. To locate a coecient, the following equation is used [13]: (`?q) (?1 m) for 0 < m < q? 1 and 0 < q < ` where q is the degree, and m the member to be determined. For instance, if ` 3, then the location of h 5, i.e., h 1, is (3?) (?1 1) 3. In the next section, we show an algorithm that gives both Walsh and Haar transforms. f(001) f(010) f(011) f(100) h 4 h h 3 h 1 w 4 w w 6 w 1 Strings Fitness f(101) h 5 w 5 Table : Binary strings with their tness values. f(110) h 6 f(111) h7 Figure : Fast Walsh-Haar transform. w 3 w 7 4. The Fast Walsh-Haar Transform Either the Walsh or the Haar exansion can be obtained from Fino's comosite Walsh-Haar transform [4]. The transform is resented by the ow diagram of Figure for ` 3. The multilying constants emloyed in the routine for the Haar transform are shown in the diagram as the constants

4 j w j ?46 0??6 0 0??11 0? h j 39 0?33 33?10? ?3?10 3?3? 10 3 Table 3: Binary strings with their tness values. associated with the levels. At level B, the multilier is, at level C the multilier is and at level D, the multilier is 1. Each term from the leftmost column is either added to (solid line) or subtracted from (dashed line) its adjacent term to roduce a new term of a subsequent stage of the algorithm. The ow diagram going from left to right roduces the Haar coecients (after multilying by 1 and the ` aroriate level multilier) or the Walsh coecients (after multilying by 1 ). Going in the oosite direction roduces the value of the function for any oint x [0; `? 1]. ` For instance, going from right to left: And h 7 [f(110)? f(111)] 1 : h [f(000) f(001)? f(010)? f(011)] 1 : Going from left to right, we can comute f(110) in terms of Haar coecients: f(110) h 0? h 1? h3 h 7; or as a linear combination of Walsh coecients: f(110) w 0? w 4? w w 6 w 1? w 5? w 3 w 7: We note that the total number of oerations to get Walsh coecients, in Figure, (additions and subtractions), is 3 in each of the 3 layers. i.e., 4, which is equal to 3(`) for ` 3. The Haar coecients are obtained much faster than the Walsh. Indeed, Haar requires (`? 1) oerations comared to Walsh's `(`). Thus, ``? `1 more oerations are needed with Walsh than with Haar functions. For instance, for ` 10, we need to erform ; 19 more oerations when the Walsh fast transform is used instead of the Haar transform. It is generally more advantageous to use the Haar transform rather than its Walsh counterart. However, the next section examines a secial case for which the latter might be referable. 5 Symmetrical Fitness Functions If is a symmetrical function, then many Walsh coecients will vanish while the Haar coecients will have nonzero values. This is due to the symmetry roerties of Walsh transforms. More recisely, the roof of the following result [14] can be found in the Aendix. Result 3 Let be a symmetric function, i.e.,, where x i 1? x i. Then every Walsh coecients w j that contains an odd number of ones in its index j, is zero. The maximum cut roblem illustrates this situation. Given a weighted grah G (V; E) where V f1; : : : ; ng is the set of vertices, E the set of edges, and w ij the weight of the edge between vertices i and j, the roblem consists in artitioning V into two disjoint sets V 0 and V 1, such that the sum of the weights of the edges from E that have one endoint in V 0 and the other in V 1 is maximized. Examle 1 Consider the instance of the maximum cut roblem with four vertices, and ve edges with the following weights: w 1 w 1 6, w 13 w 31 10, w 3 w 3 11, w 4 w 4 15, w 34 w 43, and w ij 0 for all other values of i and j. If we let x i 0 when vertex i is in V 0 and x i 1 when i is in V 1, then each string in f0; 1g 4 will reresent a ossible artition of the vertices. Since w ij w ji for 1 i; j 4, the tness function to maximize is given by ([11]): n?1 n ji1 [x i(1? x j) x j(1? x i)] w ij with n 4. The function is symmetrical and every binary string has the same tness value as its comlement. For instance, f(1010) f(0101) 5. Table gives all ossible solutions with their corresonding tness values. The Walsh and Haar coecients tabulated in Table 3 have to be multilied by We note that although it is more ecient to comute the Haar coecients, it might still be referable to use the Walsh transform in this roblem, since half of the coecients dro out while all but one of the Haar coecients have non-zero value, and since, more imortantly, ` is very small. 6 Conclusion The aim of this article is to bring to the attention of researchers involved in theoretical asects of genetic algorithms the existence and some of the roerties of Haar functions. More recisely, these functions can be used as a tool, to comute tness averages, to comute schemata, and to construct decetive functions. Because of the comutational advantages, Haar functions might be used for certain alications instead of Walsh functions. Using Haar functions a basis, the exansion of the tness function requires substantially fewer terms than with Walsh functions. The Haar coecients too can be written as linear combinations of very few oints that are \close together and do not require the comutation of all oints, as is the case with Walsh coecients. The comutational dierence between Walsh and Haar functions can also be seen by considering fast transforms. With these imlementations, modeled after the fast Fourier transform, Haar coecients require O(N) transformations, whereas O(N log N) transformations are required for Walsh, where N `. We showed that the dierence between the total number of terms required for the comutation of the exansions of Walsh and of Haar remains exonential in ` (of order ``).

5 Acknowledgments The author would like to thank Dr. Frederick Stern for many discussions on the toic, and one of the reviewers' suggestions that have imroved the clarity and style of this work. He would also like to thank Stefan Bischof and Helko Lehmann for getting the aer in camera{ready form. References [1] Beaucham K. G., (194), Alications of Walsh and Related Functions, Academic Press. [] Bethke, A. D., (190), Genetic Algorithms as Function Otimizers, Doctoral dissertation, University of Michigan. [3] Daubechies, I., (199), Ten Lectures on Wavelets, Philadelhia: SIAM, 199. [4] Fino, B.J., (197), Relations Between Haar and Walsh- Hadamard Transforms, Proc. IEEE (Letters), vol 60, [5] Goldberg, D.E., (199), Genetic Algorithms and Walsh Functions Part II: Decetion and its Analysis, Comlex Systems 3, [6] Haar, A., (1910), Zur Theorie der Orthogonalen Funktionensysteme, Math. Annalen 69: [7] Harmuth, H. F., (196), A Generalized Concet of Frequency and Some Alications, IEEE Transactions on Information Theory, IT-14: [] Holland, J.H., (1975), Adatation in Natural and Arti- cial Systems, The University of Michigan Press, Ann Arbor. [9] Karovsky, M.G., (195), Sectral Techniques and Fault Detection, Academic Press. [10] Khuri S (1994) Walsh and Haar Functions in Genetic Algorithms. Proceedings of the 1994 ACM Symosium of Alied Comuting (New York: ACM Press) 01{5. [11] Khuri, S., Back, T., and Heitkotter, J., (1994), An Evolutionary Aroach to Combinatorial Otimization Problems, Proc. of the nd. ACM Comuter Science Conf., Phoenix, Arizona. [1] Kremer, H., (1973), On Theory of Fast Walsh Transform Algorithms, Colloquium on the Theory and Alications of Walsh and Other Non-Sinusoidal Functions, Hateld, U.K. [13] Roeser, P. R., and Jernigan, M. E., (19), Fast Haar Transform Algorithms, IEEE Transactions on Comuters C-31 no : [14] Rudolf, G., (1994), Private communication reroduced in the Aendix. Aendix Result 3 Let be a symmetric function, i.e.,, where x i 1? x i. Then every Walsh coecients w j that contains an odd number of ones in its index j, is zero. Note that 1? x i 1? (1? x i) (?1) (1? x i). The Walsh coecient w j is calculated by w j l?1 l?1 x l?1 ( Y l l Y Y l (?1) j i! 1! (?1) j i! (1? kjk 1 mod ) P Q l (1? xi)j i if kjk 1 even 0 if kjk 1 odd P l where kjk 1 ji denotes the l1{norm of j in binary notation.

2 K. ENTACHER 2 Generalized Haar function systems In the following we x an arbitrary integer base b 2. For the notations and denitions of generalized

2 K. ENTACHER 2 Generalized Haar function systems In the following we x an arbitrary integer base b 2. For the notations and denitions of generalized BIT 38 :2 (998), 283{292. QUASI-MONTE CARLO METHODS FOR NUMERICAL INTEGRATION OF MULTIVARIATE HAAR SERIES II KARL ENTACHER y Deartment of Mathematics, University of Salzburg, Hellbrunnerstr. 34 A-52 Salzburg,

More information

Correspondence Between Fractal-Wavelet. Transforms and Iterated Function Systems. With Grey Level Maps. F. Mendivil and E.R.

Correspondence Between Fractal-Wavelet. Transforms and Iterated Function Systems. With Grey Level Maps. F. Mendivil and E.R. 1 Corresondence Between Fractal-Wavelet Transforms and Iterated Function Systems With Grey Level Mas F. Mendivil and E.R. Vrscay Deartment of Alied Mathematics Faculty of Mathematics University of Waterloo

More information

Computer arithmetic. Intensive Computation. Annalisa Massini 2017/2018

Computer arithmetic. Intensive Computation. Annalisa Massini 2017/2018 Comuter arithmetic Intensive Comutation Annalisa Massini 7/8 Intensive Comutation - 7/8 References Comuter Architecture - A Quantitative Aroach Hennessy Patterson Aendix J Intensive Comutation - 7/8 3

More information

Approximating min-max k-clustering

Approximating 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 information

1 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

1 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 information

MODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL

MODELING 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 information

Generalized Coiflets: A New Family of Orthonormal Wavelets

Generalized Coiflets: A New Family of Orthonormal Wavelets Generalized Coiflets A New Family of Orthonormal Wavelets Dong Wei, Alan C Bovik, and Brian L Evans Laboratory for Image and Video Engineering Deartment of Electrical and Comuter Engineering The University

More information

AN ALGORITHM FOR MATRIX EXTENSION AND WAVELET CONSTRUCTION W. LAWTON, S. L. LEE AND ZUOWEI SHEN Abstract. This paper gives a practical method of exten

AN ALGORITHM FOR MATRIX EXTENSION AND WAVELET CONSTRUCTION W. LAWTON, S. L. LEE AND ZUOWEI SHEN Abstract. This paper gives a practical method of exten AN ALGORITHM FOR MATRIX EXTENSION AND WAVELET ONSTRUTION W. LAWTON, S. L. LEE AND ZUOWEI SHEN Abstract. This aer gives a ractical method of extending an nr matrix P (z), r n, with Laurent olynomial entries

More information

4. Score normalization technical details We now discuss the technical details of the score normalization method.

4. 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 information

Cryptanalysis of Pseudorandom Generators

Cryptanalysis of Pseudorandom Generators CSE 206A: Lattice Algorithms and Alications Fall 2017 Crytanalysis of Pseudorandom Generators Instructor: Daniele Micciancio UCSD CSE As a motivating alication for the study of lattice in crytograhy we

More information

Topic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar

Topic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar 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

More information

CSC165H, Mathematical expression and reasoning for computer science week 12

CSC165H, Mathematical expression and reasoning for computer science week 12 CSC165H, Mathematical exression and reasoning for comuter science week 1 nd December 005 Gary Baumgartner and Danny Hea hea@cs.toronto.edu SF4306A 416-978-5899 htt//www.cs.toronto.edu/~hea/165/s005/index.shtml

More information

Round-off Errors and Computer Arithmetic - (1.2)

Round-off Errors and Computer Arithmetic - (1.2) Round-off Errors and Comuter Arithmetic - (.). Round-off Errors: Round-off errors is roduced when a calculator or comuter is used to erform real number calculations. That is because the arithmetic erformed

More information

Linear diophantine equations for discrete tomography

Linear diophantine equations for discrete tomography Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,

More information

216 S. Chandrasearan and I.C.F. Isen Our results dier from those of Sun [14] in two asects: we assume that comuted eigenvalues or singular values are

216 S. Chandrasearan and I.C.F. Isen Our results dier from those of Sun [14] in two asects: we assume that comuted eigenvalues or singular values are Numer. Math. 68: 215{223 (1994) Numerische Mathemati c Sringer-Verlag 1994 Electronic Edition Bacward errors for eigenvalue and singular value decomositions? S. Chandrasearan??, I.C.F. Isen??? Deartment

More information

Matching Partition a Linked List and Its Optimization

Matching Partition a Linked List and Its Optimization Matching Partition a Linked List and Its Otimization Yijie Han Deartment of Comuter Science University of Kentucky Lexington, KY 40506 ABSTRACT We show the curve O( n log i + log (i) n + log i) for the

More information

Chater Matrix Norms and Singular Value Decomosition Introduction In this lecture, we introduce the notion of a norm for matrices The singular value de

Chater Matrix Norms and Singular Value Decomosition Introduction In this lecture, we introduce the notion of a norm for matrices The singular value de Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A Dahleh George Verghese Deartment of Electrical Engineering and Comuter Science Massachuasetts Institute of Technology c Chater Matrix Norms

More information

Outline. 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) 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 information

The Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule

The 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 information

Introduction Consider a set of jobs that are created in an on-line fashion and should be assigned to disks. Each job has a weight which is the frequen

Introduction Consider a set of jobs that are created in an on-line fashion and should be assigned to disks. Each job has a weight which is the frequen Ancient and new algorithms for load balancing in the L norm Adi Avidor Yossi Azar y Jir Sgall z July 7, 997 Abstract We consider the on-line load balancing roblem where there are m identical machines (servers)

More information

Towards 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. 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 information

Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models

Evaluating 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 information

Finding Shortest Hamiltonian Path is in P. Abstract

Finding 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 information

#A8 INTEGERS 12 (2012) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS

#A8 INTEGERS 12 (2012) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS #A8 INTEGERS 1 (01) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS Mohammadreza Bidar 1 Deartment of Mathematics, Sharif University of Technology, Tehran, Iran mrebidar@gmailcom

More information

substantial literature on emirical likelihood indicating that it is widely viewed as a desirable and natural aroach to statistical inference in a vari

substantial literature on emirical likelihood indicating that it is widely viewed as a desirable and natural aroach to statistical inference in a vari Condence tubes for multile quantile lots via emirical likelihood John H.J. Einmahl Eindhoven University of Technology Ian W. McKeague Florida State University May 7, 998 Abstract The nonarametric emirical

More information

State Estimation with ARMarkov Models

State Estimation with ARMarkov Models Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,

More information

Radial Basis Function Networks: Algorithms

Radial 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 information

Pretest (Optional) Use as an additional pacing tool to guide instruction. August 21

Pretest (Optional) Use as an additional pacing tool to guide instruction. August 21 Trimester 1 Pretest (Otional) Use as an additional acing tool to guide instruction. August 21 Beyond the Basic Facts In Trimester 1, Grade 8 focus on multilication. Daily Unit 1: Rational vs. Irrational

More information

Multi-Operation Multi-Machine Scheduling

Multi-Operation Multi-Machine Scheduling Multi-Oeration Multi-Machine Scheduling Weizhen Mao he College of William and Mary, Williamsburg VA 3185, USA Abstract. In the multi-oeration scheduling that arises in industrial engineering, each job

More information

Combinatorics of topmost discs of multi-peg Tower of Hanoi problem

Combinatorics 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 information

An Analysis of Reliable Classifiers through ROC Isometrics

An 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

Chapter 7 Rational and Irrational Numbers

Chapter 7 Rational and Irrational Numbers Chater 7 Rational and Irrational Numbers In this chater we first review the real line model for numbers, as discussed in Chater 2 of seventh grade, by recalling how the integers and then the rational numbers

More information

Elementary Analysis in Q p

Elementary 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 information

Shadow Computing: An Energy-Aware Fault Tolerant Computing Model

Shadow Computing: An Energy-Aware Fault Tolerant Computing Model Shadow Comuting: An Energy-Aware Fault Tolerant Comuting Model Bryan Mills, Taieb Znati, Rami Melhem Deartment of Comuter Science University of Pittsburgh (bmills, znati, melhem)@cs.itt.edu Index Terms

More information

#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS

#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS #A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS Ramy F. Taki ElDin Physics and Engineering Mathematics Deartment, Faculty of Engineering, Ain Shams University, Cairo, Egyt

More information

Uncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning

Uncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning TNN-2009-P-1186.R2 1 Uncorrelated Multilinear Princial Comonent Analysis for Unsuervised Multilinear Subsace Learning Haiing Lu, K. N. Plataniotis and A. N. Venetsanooulos The Edward S. Rogers Sr. Deartment

More information

Prime Reciprocal Digit Frequencies and the Euler Zeta Function

Prime Reciprocal Digit Frequencies and the Euler Zeta Function Prime Recirocal Digit Frequencies and the Euler Zeta Function Subhash Kak. The digit frequencies for rimes are not all equal. The least significant digit for rimes greater than 5 can only be, 3, 7, or

More information

c Copyright by Helen J. Elwood December, 2011

c Copyright by Helen J. Elwood December, 2011 c Coyright by Helen J. Elwood December, 2011 CONSTRUCTING COMPLEX EQUIANGULAR PARSEVAL FRAMES A Dissertation Presented to the Faculty of the Deartment of Mathematics University of Houston In Partial Fulfillment

More information

WAVELETS, PROPERTIES OF THE SCALAR FUNCTIONS

WAVELETS, PROPERTIES OF THE SCALAR FUNCTIONS U.P.B. Sci. Bull. Series A, Vol. 68, No. 4, 006 WAVELETS, PROPERTIES OF THE SCALAR FUNCTIONS C. PANĂ * Pentru a contrui o undină convenabilă Ψ este necesară şi suficientă o analiză multirezoluţie. Analiza

More information

Rotations in Curved Trajectories for Unconstrained Minimization

Rotations in Curved Trajectories for Unconstrained Minimization Rotations in Curved rajectories for Unconstrained Minimization Alberto J Jimenez Mathematics Deartment, California Polytechnic University, San Luis Obiso, CA, USA 9407 Abstract Curved rajectories Algorithm

More information

Convex Optimization methods for Computing Channel Capacity

Convex 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 information

Unit 1 - Computer Arithmetic

Unit 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 information

On Wald-Type Optimal Stopping for Brownian Motion

On Wald-Type Optimal Stopping for Brownian Motion J Al Probab Vol 34, No 1, 1997, (66-73) Prerint Ser No 1, 1994, Math Inst Aarhus On Wald-Tye Otimal Stoing for Brownian Motion S RAVRSN and PSKIR The solution is resented to all otimal stoing roblems of

More information

Solved 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. (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 information

A construction of bent functions from plateaued functions

A construction of bent functions from plateaued functions A construction of bent functions from lateaued functions Ayça Çeşmelioğlu, Wilfried Meidl Sabancı University, MDBF, Orhanlı, 34956 Tuzla, İstanbul, Turkey. Abstract In this resentation, a technique for

More information

Analysis of some entrance probabilities for killed birth-death processes

Analysis 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 information

Genetic Algorithms, Selection Schemes, and the Varying Eects of Noise. IlliGAL Report No November Department of General Engineering

Genetic Algorithms, Selection Schemes, and the Varying Eects of Noise. IlliGAL Report No November Department of General Engineering Genetic Algorithms, Selection Schemes, and the Varying Eects of Noise Brad L. Miller Det. of Comuter Science University of Illinois at Urbana-Chamaign David E. Goldberg Det. of General Engineering University

More information

Convexification of Generalized Network Flow Problem with Application to Power Systems

Convexification of Generalized Network Flow Problem with Application to Power Systems 1 Convexification of Generalized Network Flow Problem with Alication to Power Systems Somayeh Sojoudi and Javad Lavaei + Deartment of Comuting and Mathematical Sciences, California Institute of Technology

More information

Parallelism 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. 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 information

A Spectral-Factorization Combinatorial-Search Algorithm Unifying the Systematized Collection of Daubechies Wavelets. Abstract.

A Spectral-Factorization Combinatorial-Search Algorithm Unifying the Systematized Collection of Daubechies Wavelets. Abstract. A Sectral-Factorization Combinatorial-Search Algorithm Unifying the Systematized Collection of Daubechies Wavelets Carl Taswell UCSD School of Medicine, La Jolla, CA 92093-0603 Comutational Toolsmiths,

More information

Sums of independent random variables

Sums 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 information

Uniformly best wavenumber approximations by spatial central difference operators: An initial investigation

Uniformly best wavenumber approximations by spatial central difference operators: An initial investigation Uniformly best wavenumber aroximations by satial central difference oerators: An initial investigation Vitor Linders and Jan Nordström Abstract A characterisation theorem for best uniform wavenumber aroximations

More information

Combining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)

Combining 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 information

RANDOM 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 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 information

COMPARISON OF VARIOUS OPTIMIZATION TECHNIQUES FOR DESIGN FIR DIGITAL FILTERS

COMPARISON OF VARIOUS OPTIMIZATION TECHNIQUES FOR DESIGN FIR DIGITAL FILTERS NCCI 1 -National Conference on Comutational Instrumentation CSIO Chandigarh, INDIA, 19- March 1 COMPARISON OF VARIOUS OPIMIZAION ECHNIQUES FOR DESIGN FIR DIGIAL FILERS Amanjeet Panghal 1, Nitin Mittal,Devender

More information

Applicable Analysis and Discrete Mathematics available online at HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS

Applicable Analysis and Discrete Mathematics available online at   HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS Alicable Analysis and Discrete Mathematics available online at htt://efmath.etf.rs Al. Anal. Discrete Math. 4 (010), 3 44. doi:10.98/aadm1000009m HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS Zerzaihi

More information

An Inverse Problem for Two Spectra of Complex Finite Jacobi Matrices

An Inverse Problem for Two Spectra of Complex Finite Jacobi Matrices Coyright 202 Tech Science Press CMES, vol.86, no.4,.30-39, 202 An Inverse Problem for Two Sectra of Comlex Finite Jacobi Matrices Gusein Sh. Guseinov Abstract: This aer deals with the inverse sectral roblem

More information

A SIMPLE AD EFFICIET PARALLEL FFT ALGORITHM USIG THE BSP MODEL MARCIA A. IDA AD ROB H. BISSELIG Abstract. In this aer, we resent a new arallel radix-4

A SIMPLE AD EFFICIET PARALLEL FFT ALGORITHM USIG THE BSP MODEL MARCIA A. IDA AD ROB H. BISSELIG Abstract. In this aer, we resent a new arallel radix-4 Universiteit-Utrecht * Deartment of Mathematics A simle and ecient arallel FFT algorithm using the BSP model by Marcia A. Inda and Rob H. Bisseling Prerint nr. 3 March 2000 A SIMPLE AD EFFICIET PARALLEL

More information

MATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK

MATHEMATICAL 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 information

Recent Developments in Multilayer Perceptron Neural Networks

Recent Developments in Multilayer Perceptron Neural Networks Recent Develoments in Multilayer Percetron eural etworks Walter H. Delashmit Lockheed Martin Missiles and Fire Control Dallas, Texas 75265 walter.delashmit@lmco.com walter.delashmit@verizon.net Michael

More information

Beyond Worst-Case Reconstruction in Deterministic Compressed Sensing

Beyond Worst-Case Reconstruction in Deterministic Compressed Sensing Beyond Worst-Case Reconstruction in Deterministic Comressed Sensing Sina Jafarour, ember, IEEE, arco F Duarte, ember, IEEE, and Robert Calderbank, Fellow, IEEE Abstract The role of random measurement in

More information

GIVEN an input sequence x 0,..., x n 1 and the

GIVEN 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 information

Inequalities for finite trigonometric sums. An interplay: with some series related to harmonic numbers

Inequalities for finite trigonometric sums. An interplay: with some series related to harmonic numbers Kouba Journal of Inequalities and Alications 6 6:73 DOI.86/s366-6-- R E S E A R C H Oen Access Inequalities for finite trigonometric sums. An interlay: with some series related to harmonic numbers Omran

More information

PERFORMANCE BASED DESIGN SYSTEM FOR CONCRETE MIXTURE WITH MULTI-OPTIMIZING GENETIC ALGORITHM

PERFORMANCE BASED DESIGN SYSTEM FOR CONCRETE MIXTURE WITH MULTI-OPTIMIZING GENETIC ALGORITHM PERFORMANCE BASED DESIGN SYSTEM FOR CONCRETE MIXTURE WITH MULTI-OPTIMIZING GENETIC ALGORITHM Takafumi Noguchi 1, Iei Maruyama 1 and Manabu Kanematsu 1 1 Deartment of Architecture, University of Tokyo,

More information

Parallel Quantum-inspired Genetic Algorithm for Combinatorial Optimization Problem

Parallel Quantum-inspired Genetic Algorithm for Combinatorial Optimization Problem Parallel Quantum-insired Genetic Algorithm for Combinatorial Otimization Problem Kuk-Hyun Han Kui-Hong Park Chi-Ho Lee Jong-Hwan Kim Det. of Electrical Engineering and Comuter Science, Korea Advanced Institute

More information

Efficient algorithms for the smallest enclosing ball problem

Efficient algorithms for the smallest enclosing ball problem Efficient algorithms for the smallest enclosing ball roblem Guanglu Zhou, Kim-Chuan Toh, Jie Sun November 27, 2002; Revised August 4, 2003 Abstract. Consider the roblem of comuting the smallest enclosing

More information

ON POLYNOMIAL SELECTION FOR THE GENERAL NUMBER FIELD SIEVE

ON POLYNOMIAL SELECTION FOR THE GENERAL NUMBER FIELD SIEVE MATHEMATICS OF COMPUTATIO Volume 75, umber 256, October 26, Pages 237 247 S 25-5718(6)187-9 Article electronically ublished on June 28, 26 O POLYOMIAL SELECTIO FOR THE GEERAL UMBER FIELD SIEVE THORSTE

More information

Greediness of higher rank Haar wavelet bases in L p w(r) spaces

Greediness of higher rank Haar wavelet bases in L p w(r) spaces Stud. Univ. Babeş-Bolyai Math. 59(2014), No. 2, 213 219 Greediness of higher rank Haar avelet bases in L (R) saces Ekaterine Kaanadze Abstract. We rove that higher rank Haar avelet systems are greedy in

More information

On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm

On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm Gabriel Noriega, José Restreo, Víctor Guzmán, Maribel Giménez and José Aller Universidad Simón Bolívar Valle de Sartenejas,

More information

Information collection on a graph

Information 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 information

ON THE SET a x + b g x (mod p) 1 Introduction

ON THE SET a x + b g x (mod p) 1 Introduction PORTUGALIAE MATHEMATICA Vol 59 Fasc 00 Nova Série ON THE SET a x + b g x (mod ) Cristian Cobeli, Marian Vâjâitu and Alexandru Zaharescu Abstract: Given nonzero integers a, b we rove an asymtotic result

More information

HENSEL S LEMMA KEITH CONRAD

HENSEL S LEMMA KEITH CONRAD HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar

More information

Optimal Approximate Polytope Membership

Optimal Approximate Polytope Membership Otimal Aroximate Polytoe Membershi Sunil Arya Deartment of Comuter Science and Engineering The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong arya@cse.ust.hk Abstract

More information

An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators

An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators S. K. Mallik, Student Member, IEEE, S. Chakrabarti, Senior Member, IEEE, S. N. Singh, Senior Member, IEEE Deartment of Electrical

More information

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2, MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write

More information

Research of PMU Optimal Placement in Power Systems

Research 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 information

Cubic Sieve Congruence of the Discrete Logarithm Problem, and Fractional Part Sequences

Cubic Sieve Congruence of the Discrete Logarithm Problem, and Fractional Part Sequences Cubic Sieve Congruence of the Discrete Logarithm Problem, and Fractional Part Sequences Srinivas Vivek University of Luxembourg, Luxembourg C. E. Veni Madhavan Deartment of Comuter Science and Automation,

More information

Multiplicative group law on the folium of Descartes

Multiplicative group law on the folium of Descartes Multilicative grou law on the folium of Descartes Steluţa Pricoie and Constantin Udrişte Abstract. The folium of Descartes is still studied and understood today. Not only did it rovide for the roof of

More information

Network Configuration Control Via Connectivity Graph Processes

Network Configuration Control Via Connectivity Graph Processes Network Configuration Control Via Connectivity Grah Processes Abubakr Muhammad Deartment of Electrical and Systems Engineering University of Pennsylvania Philadelhia, PA 90 abubakr@seas.uenn.edu Magnus

More information

Improved Capacity Bounds for the Binary Energy Harvesting Channel

Improved 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 information

Covariance Matrix Estimation for Reinforcement Learning

Covariance Matrix Estimation for Reinforcement Learning Covariance Matrix Estimation for Reinforcement Learning Tomer Lancewicki Deartment of Electrical Engineering and Comuter Science University of Tennessee Knoxville, TN 37996 tlancewi@utk.edu Itamar Arel

More information

Intrinsic Approximation on Cantor-like Sets, a Problem of Mahler

Intrinsic Approximation on Cantor-like Sets, a Problem of Mahler Intrinsic Aroximation on Cantor-like Sets, a Problem of Mahler Ryan Broderick, Lior Fishman, Asaf Reich and Barak Weiss July 200 Abstract In 984, Kurt Mahler osed the following fundamental question: How

More information

DETC2003/DAC AN EFFICIENT ALGORITHM FOR CONSTRUCTING OPTIMAL DESIGN OF COMPUTER EXPERIMENTS

DETC2003/DAC AN EFFICIENT ALGORITHM FOR CONSTRUCTING OPTIMAL DESIGN OF COMPUTER EXPERIMENTS Proceedings of DETC 03 ASME 003 Design Engineering Technical Conferences and Comuters and Information in Engineering Conference Chicago, Illinois USA, Setember -6, 003 DETC003/DAC-48760 AN EFFICIENT ALGORITHM

More information

AR PROCESSES AND SOURCES CAN BE RECONSTRUCTED FROM. Radu Balan, Alexander Jourjine, Justinian Rosca. Siemens Corporation Research

AR PROCESSES AND SOURCES CAN BE RECONSTRUCTED FROM. Radu Balan, Alexander Jourjine, Justinian Rosca. Siemens Corporation Research AR PROCESSES AND SOURCES CAN BE RECONSTRUCTED FROM DEGENERATE MIXTURES Radu Balan, Alexander Jourjine, Justinian Rosca Siemens Cororation Research 7 College Road East Princeton, NJ 8 fradu,jourjine,roscag@scr.siemens.com

More information

Approximation of the Euclidean Distance by Chamfer Distances

Approximation of the Euclidean Distance by Chamfer Distances Acta Cybernetica 0 (0 399 47. Aroximation of the Euclidean Distance by Chamfer Distances András Hajdu, Lajos Hajdu, and Robert Tijdeman Abstract Chamfer distances lay an imortant role in the theory of

More information

A generalization of Amdahl's law and relative conditions of parallelism

A generalization of Amdahl's law and relative conditions of parallelism A generalization of Amdahl's law and relative conditions of arallelism Author: Gianluca Argentini, New Technologies and Models, Riello Grou, Legnago (VR), Italy. E-mail: gianluca.argentini@riellogrou.com

More information

LINEAR SYSTEMS WITH POLYNOMIAL UNCERTAINTY STRUCTURE: STABILITY MARGINS AND CONTROL

LINEAR SYSTEMS WITH POLYNOMIAL UNCERTAINTY STRUCTURE: STABILITY MARGINS AND CONTROL LINEAR SYSTEMS WITH POLYNOMIAL UNCERTAINTY STRUCTURE: STABILITY MARGINS AND CONTROL Mohammad Bozorg Deatment of Mechanical Engineering University of Yazd P. O. Box 89195-741 Yazd Iran Fax: +98-351-750110

More information

POINTS ON CONICS MODULO p

POINTS ON CONICS MODULO p POINTS ON CONICS MODULO TEAM 2: JONGMIN BAEK, ANAND DEOPURKAR, AND KATHERINE REDFIELD Abstract. We comute the number of integer oints on conics modulo, where is an odd rime. We extend our results to conics

More information

A Qualitative Event-based Approach to Multiple Fault Diagnosis in Continuous Systems using Structural Model Decomposition

A Qualitative Event-based Approach to Multiple Fault Diagnosis in Continuous Systems using Structural Model Decomposition A Qualitative Event-based Aroach to Multile Fault Diagnosis in Continuous Systems using Structural Model Decomosition Matthew J. Daigle a,,, Anibal Bregon b,, Xenofon Koutsoukos c, Gautam Biswas c, Belarmino

More information

Finite-State Verification or Model Checking. Finite State Verification (FSV) or Model Checking

Finite-State Verification or Model Checking. Finite State Verification (FSV) or Model Checking Finite-State Verification or Model Checking Finite State Verification (FSV) or Model Checking Holds the romise of roviding a cost effective way of verifying imortant roerties about a system Not all faults

More information

CONSTRUCTIVE APPROXIMATION

CONSTRUCTIVE APPROXIMATION Constr. Arox. (1998) 14: 1 26 CONSTRUCTIVE APPROXIMATION 1998 Sringer-Verlag New York Inc. Hyerbolic Wavelet Aroximation R. A. DeVore, S. V. Konyagin, and V. N. Temlyakov Abstract. We study the multivariate

More information

t 0 Xt sup X t p c p inf t 0

t 0 Xt sup X t p c p inf t 0 SHARP MAXIMAL L -ESTIMATES FOR MARTINGALES RODRIGO BAÑUELOS AND ADAM OSȨKOWSKI ABSTRACT. Let X be a suermartingale starting from 0 which has only nonnegative jums. For each 0 < < we determine the best

More information

s v 0 q 0 v 1 q 1 v 2 (q 2) v 3 q 3 v 4

s v 0 q 0 v 1 q 1 v 2 (q 2) v 3 q 3 v 4 Discrete Adative Transmission for Fading Channels Lang Lin Λ, Roy D. Yates, Predrag Sasojevic WINLAB, Rutgers University 7 Brett Rd., NJ- fllin, ryates, sasojevg@winlab.rutgers.edu Abstract In this work

More information

Analysis of Pressure Transient Response for an Injector under Hydraulic Stimulation at the Salak Geothermal Field, Indonesia

Analysis of Pressure Transient Response for an Injector under Hydraulic Stimulation at the Salak Geothermal Field, Indonesia roceedings World Geothermal Congress 00 Bali, Indonesia, 5-9 Aril 00 Analysis of ressure Transient Resonse for an Injector under Hydraulic Stimulation at the Salak Geothermal Field, Indonesia Jorge A.

More information

Notes on duality in second order and -order cone otimization E. D. Andersen Λ, C. Roos y, and T. Terlaky z Aril 6, 000 Abstract Recently, the so-calle

Notes on duality in second order and -order cone otimization E. D. Andersen Λ, C. Roos y, and T. Terlaky z Aril 6, 000 Abstract Recently, the so-calle McMaster University Advanced Otimization Laboratory Title: Notes on duality in second order and -order cone otimization Author: Erling D. Andersen, Cornelis Roos and Tamás Terlaky AdvOl-Reort No. 000/8

More information

COMMUNICATION BETWEEN SHAREHOLDERS 1

COMMUNICATION BETWEEN SHAREHOLDERS 1 COMMUNICATION BTWN SHARHOLDRS 1 A B. O A : A D Lemma B.1. U to µ Z r 2 σ2 Z + σ2 X 2r ω 2 an additive constant that does not deend on a or θ, the agents ayoffs can be written as: 2r rθa ω2 + θ µ Y rcov

More information

Probability Estimates for Multi-class Classification by Pairwise Coupling

Probability 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 information

Strong Matching of Points with Geometric Shapes

Strong Matching of Points with Geometric Shapes Strong Matching of Points with Geometric Shaes Ahmad Biniaz Anil Maheshwari Michiel Smid School of Comuter Science, Carleton University, Ottawa, Canada December 9, 05 In memory of Ferran Hurtado. Abstract

More information

Modeling and Estimating Uncertainty in Parameter. Estimation. Center for Research in Scientic Computation. Box 8205.

Modeling and Estimating Uncertainty in Parameter. Estimation. Center for Research in Scientic Computation. Box 8205. Modeling and Estimating Uncertainty in Parameter Estimation H.T. Banks and Kathleen L. Bihari Center for Research in Scientic Comutation Box 825 North Carolina State University Raleigh, NC 27695-825 Fax:

More information

1-way quantum finite automata: strengths, weaknesses and generalizations

1-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 information