Algorithm of Superposition of Boolean Functions Given with Truth Vectors
|
|
- Wesley Ross
- 5 years ago
- Views:
Transcription
1 IJCSI Iteratioal Joural of Computer Sciece Issues, Vol 9, Issue 4, No, July ISSN (Olie: wwwijcsiorg 9 Algorithm of Superpositio of Boolea Fuctios Give with Truth Vectors Aatoly Plotikov, Aleader Petrov, Ato Petrov 3 Departmet of Computer Systems ad Networks, Volodymyr Dalh East-Ukraiia Natioal Uiversity Luhask, 934, Ukraie Departmet Applied Iformatics, AGH Uiversity of Sciece ad Techology Krakow, Polad Departmet of Computer Systems ad Networks, the Dalh East-Ukraiia atioal uiversity 3 Departmet of Computer Systems ad Networks, Volodymyr Dalh East-Ukraiia Natioal Uiversity Luhask, 934, Ukraie Abstract I this paper are eamied the practical problems of costructio of arbitrary superpositio of Boolea fuctios whe all fuctios are give with truth vectors Keywords: Boolea Fuctio, True Vector, Truth Table, Superpositio Problem statemet Let there be a set E = {;} The the mappig of f: E E is called a Boolea fuctio A Boolea fuctio f (,,, E ( i E, i =,,, ca be completely defied with truth table: Table : Truth table f (,,,, f(,,,, f(,,,, f(,,,, f(,,,, f(,,,, f(,,,, The first colums of this table cotai the leicographically ordered value sets of Boolea variables ad the last colum of this table is the value of the give fuctio of every set This last colum is called truth vector of the Boolea fuctio f (,,, It is obvious that it is ot ecessary to write all sets of values of Boolea variables for determiig the Boolea fuctio It is eough to submit the truth row that correspods with it Eample Let the Boolea fuctio of three variables be represeted with the truth vector: ( The we ca write the appropriate truth table: 3 f (,, 3 Let there be a system of Boolea fuctios: f (,,, f(,,, m f(,,, m f(,,, m ( The the fuctio f ( f (,,,, f (,,,,, f (,,, m m m F(,,, m is called a superpositio of fuctios of the system ( I simple terms superpositio is the costructio of ew fuctio by meas of replacemet of some variables of the iitial fuctio by the appropriate fuctios Copyright (c Iteratioal Joural of Computer Sciece Issues All Rights Reserved
2 IJCSI Iteratioal Joural of Computer Sciece Issues, Vol 9, Issue 4, No, July ISSN (Olie: wwwijcsiorg The fuctio f is called basic fuctio ad the fuctio f k is called substitutio fuctio Suppose we wat to perform superpositio of Boolea fuctios Such problem arises, for eample, while aalyzig cryptosystems (see [,, 5] ad Boolea multipoles [3, 4] To cosider the practical problems of costructio of superpositio of Boolea fuctios, we assume that every Boolea fuctio of the system ( is give with truth vector Thus, the purpose of this paper is to develop a algorithm of costructio of truth vector of fuctio, which is the result of superpositio of fuctios, which are also give with truth vectors Let us cosider reasoability of represetatio of a Boolea fuctio as a truth vector There are differet forms of represetatio of Boolea fuctios [3] Thus, the tabular represetatio i form of S-blocks is used to defie the system of Boolea fuctios i cryptosystems This represetatio is absolutely icoveiet for aalysis whe it is ecessary to retrace the chages of every bit i process of cipherig The other most popular form of represetatio of Boolea fuctios is represetatio of fuctio i disjuctive ormal form (DNF Let oly oe bit be used for represetatio of every literal (complemeted or ucomplemeted variable of DNF The for represetatio of every elemetary cojuctio of DNF bits are required Assumed that the fuctio f takes the uit value i half of sets, which occurs i cryptosystems, we come to coclusio that it is required to eped bits to represet the fuctio At the same time it is required bits to represet Boolea fuctio with truth vector It is obvious that if 3 the > =, thus the represetatio of fuctio with truth vector is more efficiet I geeral, other forms of represetatio of Boolea fuctio are ot so efficiet as a truth vector Essetial ad fictitious variables Let us cosider the cocepts of essetial ad fictitious variables of the fuctio f Let there be the Boolea fuctio f (,,, Let us desigate the set of values of variables,,, of the fuctio f as (,,, It is said that the fuctio f heavily depeds upo the variable k (k =,,, if two sets (,, k,, k,, (,, k,, k,, ca eist ad f( f( Such variable is called essetial variable Otherwise the variable k is called fictitious variable It is easy to see that if the variable k i fuctio f is fictitious, the truth table of this fuctio ad, accordigly, its truth vector ca be halved by deletig, for eample, all sets, i which the variable k = O the cotrary, if it is ecessary to eter the fictitious variable i fuctio f (,,,, the its truth table will double ( i, i,, i Let there be the Boolea fuctio which is give with truth vector Let us cosider the procedure of eterig of the fictitious variable k ( k{, i i,, i } ito the fuctio As a result, we obtai truth vector of the f ( i,,, i i Boolea fuctio which is equivalet to the fuctio We will cosider the truth vector of the fuctio as array with legth ad the truth vector of the fuctio f as array F with legth Theorem Let the Boolea fuctio, which depeds upo variables, is give with the array If the fictitious variable k, which is etered ito, takes k- place i the set of variables of the fuctio f ( i,,, i i (if couted from left to right, the it is ecessary to copy k cells of the array i cosecutive order to costruct the truth vector of the fuctio f (the array F ad doubly place the same value i the cells of the array F i cosecutive order Copyright (c Iteratioal Joural of Computer Sciece Issues All Rights Reserved
3 IJCSI Iteratioal Joural of Computer Sciece Issues, Vol 9, Issue 4, No, July ISSN (Olie: wwwijcsiorg Provig I fact, the procedure of costructio of the array F depeds upo the umber k of the iput fictitious variable k Let this umber take k-place (if couted from left to right i set of values of variables of the fuctio f ( i,,, i i Assumig that the sets of values + of variables of the fuctio f are ordered leicographically, we ca see that the variable k i the truth table f possess the same value i successio i k sets (k =,,, + This proves Theorem QED Thus, the procedure of eterig of oe fictitious variable i the Boolea fuctio, which is give with truth vector, is completely defied with the Theorem Eample Let it be ecessary to eter the fictitious ( variable ito the fuctio, 3 = ( = Thus, =, k = It is easy to see that the truth table of the f (,, 3 fuctio will be the followig: 3 f 3 (,, I this case it is obviously that it is ecessary to copy k = = cells of the array successively ad doubly place them successively ito the array F It is clear, that if it is ecessary to eter several fictitious variables ito the fuctio, it ca be doe by meas of eterig fictitious variables oe by oe ito the iitial fuctio, ad the i every fuctio, which would obtaied at the previous stage Theorem Let there be the fuctio (,,,, which is defied with truth vector, ad p fictitious variables should be etered ito it The the time of f( costructio of the fuctio,,, p is equal to p Provig Let us defie the time required for eterig of fictitious variable ito the fuctio I accordace with Theorem it is ecessary to copy every k bits of truth vector ad doubly place them ito the truth vector of the fuctio f(,,, The total umber of the bits, placed ito the truth vector of the fuctio f, obviously is equal to, ad the total umber of copied bits is equal to Cosequetly, the time of eterig of the first fictitious variable is equal to O( +O( = O( It is easy to see that the time of eterig of the secod fictitious variable is equal to O( Cosequetly, the time required for eterig of the first two fictitious variables will be equal to O( + O( = O( Similarly we come to coclusio that it is ecessary to eped p time uits for eterig of p fictitious variables ito the fuctio QED 3 Algorithm of costructio of superpositio Thus, let there be a system of Boolea fuctios ( Let us say, that X {,, } is the set of variables of the basic fuctio f, ad Xi {,, m} is the set of variables of substitutio fuctio f i (i =,,, Further, we suppose that X i X ( i It is clear that, i geeral, the relatio ( may be ot satisfied Therefore we suppose that the ecessary fictitious variables are beforehad etered ito the basic fuctio We shall carry out the costructio of truth vector f of the resultig fuctio r bit by bit The umber of the bit, which is costructed, will determie couter cotet (, which has positios The couter cotet is ( (,,, writte as sequece I fact, the couter cotet determies the set of variables of the Boolea fuctio f Copyright (c Iteratioal Joural of Computer Sciece Issues All Rights Reserved
4 IJCSI Iteratioal Joural of Computer Sciece Issues, Vol 9, Issue 4, No, July ISSN (Olie: wwwijcsiorg Firstly let us cosider the substitutio of the fuctio f(,, m ito the basic fuctio f istead of the variable k (k =,,,, m We suppose that we have three arrays: F, F ad F r, which represet the truth vectors of the basic fuctio, the substitutio fuctio ad the resultig fuctio respectively, ad three couters C(, ( C(m ad Let us write C( =, whe the couter cotet is zero, ad C( := C(+, whe the couter cotet is icreased by Fially, we will desigate the cotet of the array F r ( with umber (address as Fr( ( Algorithm A Step Fi ( : Step Copy to couter C(m those positios of the couter ( which correspod to variables of the fuctio f Also, copy all positios of the couter ( to C( Step 3 Fid the value of F ( C( m i the array F Step 4 Substitute the value F ( C( m for the k th positio of the couter C( Step 5 Fid the value of FC ( ( i the array F Step 6 Write Fr( ( F( C(, that is, write the value of the bit with umber ( i the array F r Step 7 Fi ( : ( Step 8 If C ( r the go to Step Step 9 The array F r is completely formed Eample 3 Let it be ecessary to substitute the Boolea f(,, 3 fuctio = ( for the variable i (, 3, 4 the fuctio = ( To satisfy the relatio ( we eter the fictitious variable ito the basic fuctio Usig the procedure, determied by Theorem, we obtai ew epressio for f (,, 3, 4 the basic fuctio: = ( Now we ca use the algorithm A to costruct the truth fr vector of the resultig fuctio : ( C (4 Step Fi = r := Step Have: Cm ( = C(3 :=, C(4 := Step 3 Fid F ( C( m = f ( := Step 4 Obtai C( = C(4 := 8 (high-order positio ( of the couter chages by Step 5 Fid FC ( ( = FC ( (4:= Step 6 Write Fr( ( = F r ( := C (4 Step 7 Fi r := + = C (4 4 Step 8 As r = < the go to Step Step Have: C(3 :=, C(4 := Step 3 Fid F ( := Step 4 Obtai C(4 := Step 5 Fid f( := f ( Step 6 Write r := C (4 Step 7 Fi r := + = C (4 4 Step 8 As r = < the go to Step Step Have: C(3 :=, C(4 := Step 3 Fid F ( := Step 4 Obtai C(4 := Step 5 Fid F ( := Step 6 Write F r ( := ad so o Cosequetly we obtai the truth vector of the fr (,, 3, 4 resultig fuctio = ( Theorem 3 The algorithm A fids the truth vector of the resultig fuctio Provig Let there be the basic fuctio f (,,, ad the substitutio fuctio f(,, m (m We ca suppose without loss of geerality that the first m variables of the fuctios f ad f coicide ad the fuctio f is substituted for the variable Suppose that it is ecessary to fid the value of the resultig Boolea fuctio fr( f,,, i the set (,,, Let (,,, m be the subset of the first m values of variables Accordig to the algorithm A the value of the substitutio fuctio f ( should be foud at Step 3 It is obvious that the value of the resultig fuctio i the set will deped upo which value the fuctio f takes i the set As this fuctio replaces the variable, the resultig fuctio f r takes the same value i the set as the fuctio f i the set ( f(,,, Copyright (c Iteratioal Joural of Computer Sciece Issues All Rights Reserved
5 IJCSI Iteratioal Joural of Computer Sciece Issues, Vol 9, Issue 4, No, July ISSN (Olie: wwwijcsiorg 3 which should be foud at Step 5 of the algorithm A QED Theorem 4 The ruig time of algorithm A is equal to O(( m Provig I fact, carryig out of Step takes uits of time Carryig out of Step takes, obviously, m uits of time Each of Steps 3 6 takes oe uit of time I the geeral case, Step 7, as Step, takes uits of time Step 8 also takes oe uit of time Thus, o-time eecutio of Steps 8 takes m++5 uits of time, therefore, it is ecessary to sped (m = O(( m uits of time for costructio of the truth vector of the resultig fuctio QED Refereces [] AD Plotikov, Logical cryptoaalysis o the eample of the cryptosystem DES [] Data Ecryptio Stadard (DES Federal Iformatio Processig Stadards Publicatio (FIPS PUB 46-3 Natioal Bureau of Stadards, Gaithersburg, MD (999 [3] AD Zakrevskij, Solvig large systems of Boolea equatios Iformatics, 4, 4 pp 4 53 [4] S Rudeau, Boolea fuctios ad equatios Amsterdam- Lodo-New York: North- Hollad ad America Elsevier, 974 [5] JA Clark,, J L Jacob, S Maitra, ad P Staica, Almost Boolea Fuctios: the Desig of Boolea Fuctios by Spectral Iversio Computatioal Itelligece, Volume, Number 3, 4 pp Aatoly Plotikov has got his PhD i 969, He is a professor of Volodymyr Dalh East-Ukraiia Natioal Uiversity, Luhask He is also a associate member of AMS (USA ad a reviewer of the joural Mathematical Reviews His scietific iterests iclude algorithms, combiatorial optimizatio, compleity theory Aleader Petrov is a professor of Departmet Applied Iformatics, AGH Uiversity of Sciece ad Techology, Krakow, Polad Ato Petrov is a professor of Volodymyr Dalh East-Ukraiia Natioal Uiversity, Luhask His scietific iterests iclude algorithms ad Boolea fuctios Copyright (c Iteratioal Joural of Computer Sciece Issues All Rights Reserved
A Block Cipher Using Linear Congruences
Joural of Computer Sciece 3 (7): 556-560, 2007 ISSN 1549-3636 2007 Sciece Publicatios A Block Cipher Usig Liear Cogrueces 1 V.U.K. Sastry ad 2 V. Jaaki 1 Academic Affairs, Sreeidhi Istitute of Sciece &
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationSeed and Sieve of Odd Composite Numbers with Applications in Factorization of Integers
IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578, p-issn: 319-75X. Volume 1, Issue 5 Ver. VIII (Sep. - Oct.01), PP 01-07 www.iosrjourals.org Seed ad Sieve of Odd Composite Numbers with Applicatios i
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationPAijpam.eu ON DERIVATION OF RATIONAL SOLUTIONS OF BABBAGE S FUNCTIONAL EQUATION
Iteratioal Joural of Pure ad Applied Mathematics Volume 94 No. 204, 9-20 ISSN: 3-8080 (prited versio); ISSN: 34-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/0.2732/ijpam.v94i.2 PAijpam.eu
More informationBIBECHANA A Multidisciplinary Journal of Science, Technology and Mathematics
Mohd Yusuf Yasi / BIBECHANA 8 (2012) 31-36 : BMHSS, p. 31 BIBECHANA A Multidiscipliary Joural of Sciece, Techology ad Mathematics ISSN 2091-0762 (olie) Joural homepage: http://epjol.ifo/ide.php/bibechana
More informationSection 4.3. Boolean functions
Sectio 4.3. Boolea fuctios Let us take aother look at the simplest o-trivial Boolea algebra, ({0}), the power-set algebra based o a oe-elemet set, chose here as {0}. This has two elemets, the empty set,
More informationTHIS paper analyzes the behavior of those complex
IAENG Iteratioal Joural of Computer Sciece 39:4 IJCS_39_4_6 Itrisic Order Lexicographic Order Vector Order ad Hammig Weight Luis Gozález Abstract To compare biary -tuple probabilities with o eed to compute
More informationFIR Filter Design: Part II
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we cosider how we might go about desigig FIR filters with arbitrary frequecy resposes, through compositio of multiple sigle-peak
More informationKinetics of Complex Reactions
Kietics of Complex Reactios by Flick Colema Departmet of Chemistry Wellesley College Wellesley MA 28 wcolema@wellesley.edu Copyright Flick Colema 996. All rights reserved. You are welcome to use this documet
More informationResearch Article A Unified Weight Formula for Calculating the Sample Variance from Weighted Successive Differences
Discrete Dyamics i Nature ad Society Article ID 210761 4 pages http://dxdoiorg/101155/2014/210761 Research Article A Uified Weight Formula for Calculatig the Sample Variace from Weighted Successive Differeces
More informationTHE POTENTIALS METHOD FOR A CLOSED QUEUEING SYSTEM WITH HYSTERETIC STRATEGY OF THE SERVICE TIME CHANGE
Joural of Applied Mathematics ad Computatioal Mechaics 5, 4(), 3-43 www.amcm.pcz.pl p-issn 99-9965 DOI:.75/amcm.5..4 e-issn 353-588 THE POTENTIALS METHOD FOR A CLOSED QUEUEING SYSTEM WITH HYSTERETIC STRATEGY
More informationLecture Notes for CS 313H, Fall 2011
Lecture Notes for CS 313H, Fall 011 August 5. We start by examiig triagular umbers: T () = 1 + + + ( = 0, 1,,...). Triagular umbers ca be also defied recursively: T (0) = 0, T ( + 1) = T () + + 1, or usig
More informationInverse Matrix. A meaning that matrix B is an inverse of matrix A.
Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix
More informationPOWER SERIES SOLUTION OF FIRST ORDER MATRIX DIFFERENTIAL EQUATIONS
Joural of Applied Mathematics ad Computatioal Mechaics 4 3(3) 3-8 POWER SERIES SOLUION OF FIRS ORDER MARIX DIFFERENIAL EQUAIONS Staisław Kukla Izabela Zamorska Istitute of Mathematics Czestochowa Uiversity
More informationComparison Study of Series Approximation. and Convergence between Chebyshev. and Legendre Series
Applied Mathematical Scieces, Vol. 7, 03, o. 6, 3-337 HIKARI Ltd, www.m-hikari.com http://d.doi.org/0.988/ams.03.3430 Compariso Study of Series Approimatio ad Covergece betwee Chebyshev ad Legedre Series
More informationStatistics 511 Additional Materials
Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability
More informationIP Reference guide for integer programming formulations.
IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationLecture 2 Clustering Part II
COMS 4995: Usupervised Learig (Summer 8) May 24, 208 Lecture 2 Clusterig Part II Istructor: Nakul Verma Scribes: Jie Li, Yadi Rozov Today, we will be talkig about the hardess results for k-meas. More specifically,
More informationSignal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.
Sigal Processig Lecture 02: Discrete Time Sigals ad Systems Ahmet Taha Koru, Ph. D. Yildiz Techical Uiversity 2017-2018 Fall ATK (YTU) Sigal Processig 2017-2018 Fall 1 / 51 Discrete Time Sigals Discrete
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationEE260: Digital Design, Spring n Binary logic and Gates n Boolean Algebra. n Basic Properties n Algebraic Manipulation
EE26: Digital Desig, Sprig 28 2-Ja-8 EE 26: Itroductio to Digital Desig Boolea lgebra: Logic Represetatios ad alysis Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Overview Biary
More information1 Counting and Stirling Numbers
1 Coutig ad Stirlig Numbers Natural Numbers: We let N {0, 1, 2,...} deote the set of atural umbers. []: For N we let [] {1, 2,..., }. Sym: For a set X we let Sym(X) deote the set of bijectios from X to
More informationThe standard deviation of the mean
Physics 6C Fall 20 The stadard deviatio of the mea These otes provide some clarificatio o the distictio betwee the stadard deviatio ad the stadard deviatio of the mea.. The sample mea ad variace Cosider
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More informationOPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES
OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES Peter M. Maurer Why Hashig is θ(). As i biary search, hashig assumes that keys are stored i a array which is idexed by a iteger. However, hashig attempts to bypass
More informationComplex Stochastic Boolean Systems: Generating and Counting the Binary n-tuples Intrinsically Less or Greater than u
Proceedigs of the World Cogress o Egieerig ad Computer Sciece 29 Vol I WCECS 29, October 2-22, 29, Sa Fracisco, USA Complex Stochastic Boolea Systems: Geeratig ad Coutig the Biary -Tuples Itrisically Less
More informationPoincaré Problem for Nonlinear Elliptic Equations of Second Order in Unbounded Domains
Advaces i Pure Mathematics 23 3 72-77 http://dxdoiorg/4236/apm233a24 Published Olie Jauary 23 (http://wwwscirporg/oural/apm) Poicaré Problem for Noliear Elliptic Equatios of Secod Order i Ubouded Domais
More informationNUMERICAL METHODS FOR SOLVING EQUATIONS
Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:
More information6.003 Homework #3 Solutions
6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationApply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.
Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α
More informationComputability and computational complexity
Computability ad computatioal complexity Lecture 4: Uiversal Turig machies. Udecidability Io Petre Computer Sciece, Åbo Akademi Uiversity Fall 2015 http://users.abo.fi/ipetre/computability/ 21. toukokuu
More information7. Modern Techniques. Data Encryption Standard (DES)
7. Moder Techiques. Data Ecryptio Stadard (DES) The objective of this chapter is to illustrate the priciples of moder covetioal ecryptio. For this purpose, we focus o the most widely used covetioal ecryptio
More informationPrinciple Of Superposition
ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give
More informationMost text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t
Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said
More informationTHE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.
THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of
More informationChapter 7: The z-transform. Chih-Wei Liu
Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More informationLargest families without an r-fork
Largest families without a r-for Aalisa De Bois Uiversity of Salero Salero, Italy debois@math.it Gyula O.H. Katoa Réyi Istitute Budapest, Hugary ohatoa@reyi.hu Itroductio Let [] = {,,..., } be a fiite
More informationt distribution [34] : used to test a mean against an hypothesized value (H 0 : µ = µ 0 ) or the difference
EXST30 Backgroud material Page From the textbook The Statistical Sleuth Mea [0]: I your text the word mea deotes a populatio mea (µ) while the work average deotes a sample average ( ). Variace [0]: The
More informationTeaching Mathematics Concepts via Computer Algebra Systems
Iteratioal Joural of Mathematics ad Statistics Ivetio (IJMSI) E-ISSN: 4767 P-ISSN: - 4759 Volume 4 Issue 7 September. 6 PP-- Teachig Mathematics Cocepts via Computer Algebra Systems Osama Ajami Rashaw,
More informationμ are complex parameters. Other
A New Numerical Itegrator for the Solutio of Iitial Value Problems i Ordiary Differetial Equatios. J. Suday * ad M.R. Odekule Departmet of Mathematical Scieces, Adamawa State Uiversity, Mubi, Nigeria.
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationAnnotations to the assignments and the solution sheet. Note the following points
WS 26/7 Trial Exam: Fudametals of Computer Egieerig Seite: Aotatios to the assigmets ad the solutio sheet This is a multiple choice examiatio, that meas: Solutio approaches are ot assessed. For each sub-task
More informationON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS
Joural of Algebra, Number Theory: Advaces ad Applicatios Volume, Number, 00, Pages 7-89 ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS OLCAY KARAATLI ad REFİK KESKİN Departmet
More informationProof of Fermat s Last Theorem by Algebra Identities and Linear Algebra
Proof of Fermat s Last Theorem by Algebra Idetities ad Liear Algebra Javad Babaee Ragai Youg Researchers ad Elite Club, Qaemshahr Brach, Islamic Azad Uiversity, Qaemshahr, Ira Departmet of Civil Egieerig,
More informationStructural Functionality as a Fundamental Property of Boolean Algebra and Base for Its Real-Valued Realizations
Structural Fuctioality as a Fudametal Property of Boolea Algebra ad Base for Its Real-Valued Realizatios Draga G. Radojević Uiversity of Belgrade, Istitute Mihajlo Pupi, Belgrade draga.radojevic@pupi.rs
More informationL 5 & 6: RelHydro/Basel. f(x)= ( ) f( ) ( ) ( ) ( ) n! 1! 2! 3! If the TE of f(x)= sin(x) around x 0 is: sin(x) = x - 3! 5!
aylor epasio: Let ƒ() be a ifiitely differetiable real fuctio. At ay poit i the eighbourhood of =0, the fuctio ca be represeted as a power series of the followig form: X 0 f(a) f() ƒ() f()= ( ) f( ) (
More informationPH 425 Quantum Measurement and Spin Winter SPINS Lab 1
PH 425 Quatum Measuremet ad Spi Witer 23 SPIS Lab Measure the spi projectio S z alog the z-axis This is the experimet that is ready to go whe you start the program, as show below Each atom is measured
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationFormulas for the number of gridlines
This is the authors versio of the paper. The fial publicatio has appeared i Moatsh. Math. 164 (011), 157 170. Formulas for the umber of gridlies Ae-Maria Ervall-Hytöe Kaisa Matomäki Petti Haukkae Jorma
More information2.4 - Sequences and Series
2.4 - Sequeces ad Series Sequeces A sequece is a ordered list of elemets. Defiitio 1 A sequece is a fuctio from a subset of the set of itegers (usually either the set 80, 1, 2, 3,... < or the set 81, 2,
More informationProblem Set # 5 Solutions
MIT./8.4/6.898/8.435 Quatum Iformatio Sciece I Fall, 00 Sam Ocko October 5, 00 Problem Set # 5 Solutios. Most uitar trasforms are hard to approimate. (a) We are dealig with boolea fuctios that take bits
More informationA NEW CLASS OF 2-STEP RATIONAL MULTISTEP METHODS
Jural Karya Asli Loreka Ahli Matematik Vol. No. (010) page 6-9. Jural Karya Asli Loreka Ahli Matematik A NEW CLASS OF -STEP RATIONAL MULTISTEP METHODS 1 Nazeeruddi Yaacob Teh Yua Yig Norma Alias 1 Departmet
More informationTHE N-POINT FUNCTIONS FOR INTERSECTION NUMBERS ON MODULI SPACES OF CURVES
THE N-POINT FUNTIONS FOR INTERSETION NUMBERS ON MODULI SPAES OF URVES KEFENG LIU AND HAO XU Abstract. We derive from Witte s KdV equatio a simple formula of the -poit fuctios for itersectio umbers o moduli
More informationSection 14. Simple linear regression.
Sectio 14 Simple liear regressio. Let us look at the cigarette dataset from [1] (available to dowload from joural s website) ad []. The cigarette dataset cotais measuremets of tar, icotie, weight ad carbo
More informationABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS
ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS EDUARD KONTOROVICH Abstract. I this work we uify ad geeralize some results about chaos ad sesitivity. Date: March 1, 005. 1 1. Symbolic Dyamics Defiitio
More informationThe z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j
The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.
More informationU8L1: Sec Equations of Lines in R 2
MCVU U8L: Sec. 8.9. Equatios of Lies i R Review of Equatios of a Straight Lie (-D) Cosider the lie passig through A (-,) with slope, as show i the diagram below. I poit slope form, the equatio of the lie
More informationSequences of Definite Integrals, Factorials and Double Factorials
47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology
More informationInformation Theory Model for Radiation
Joural of Applied Mathematics ad Physics, 26, 4, 6-66 Published Olie August 26 i SciRes. http://www.scirp.org/joural/jamp http://dx.doi.org/.426/jamp.26.487 Iformatio Theory Model for Radiatio Philipp
More informationInternational Contest-Game MATH KANGAROO Canada, Grade 11 and 12
Part A: Each correct aswer is worth 3 poits. Iteratioal Cotest-Game MATH KANGAROO Caada, 007 Grade ad. Mike is buildig a race track. He wats the cars to start the race i the order preseted o the left,
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationChapter 2 The Solution of Numerical Algebraic and Transcendental Equations
Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said
More informationGEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING ECE 06 Summer 07 Problem Set #5 Assiged: Jue 3, 07 Due Date: Jue 30, 07 Readig: Chapter 5 o FIR Filters. PROBLEM 5..* (The
More informationON WELLPOSEDNESS QUADRATIC FUNCTION MINIMIZATION PROBLEM ON INTERSECTION OF TWO ELLIPSOIDS * M. JA]IMOVI], I. KRNI] 1.
Yugoslav Joural of Operatios Research 1 (00), Number 1, 49-60 ON WELLPOSEDNESS QUADRATIC FUNCTION MINIMIZATION PROBLEM ON INTERSECTION OF TWO ELLIPSOIDS M. JA]IMOVI], I. KRNI] Departmet of Mathematics
More informationPairs of disjoint q-element subsets far from each other
Pairs of disjoit q-elemet subsets far from each other Hikoe Eomoto Departmet of Mathematics, Keio Uiversity 3-14-1 Hiyoshi, Kohoku-Ku, Yokohama, 223 Japa, eomoto@math.keio.ac.jp Gyula O.H. Katoa Alfréd
More informationOptimization Methods MIT 2.098/6.255/ Final exam
Optimizatio Methods MIT 2.098/6.255/15.093 Fial exam Date Give: December 19th, 2006 P1. [30 pts] Classify the followig statemets as true or false. All aswers must be well-justified, either through a short
More information6.1. Sequences as Discrete Functions. Investigate
6.1 Sequeces as Discrete Fuctios The word sequece is used i everyday laguage. I a sequece, the order i which evets occur is importat. For example, builders must complete work i the proper sequece to costruct
More informationAnalysis of Experimental Measurements
Aalysis of Experimetal Measuremets Thik carefully about the process of makig a measuremet. A measuremet is a compariso betwee some ukow physical quatity ad a stadard of that physical quatity. As a example,
More informationELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems
Departmet of Electrical Egieerig Uiversity of Arasas ELEG 4603/5173L Digital Sigal Processig Ch. 1 Discrete-Time Sigals ad Systems Dr. Jigxia Wu wuj@uar.edu OUTLINE 2 Classificatios of discrete-time sigals
More informationThe Local Harmonious Chromatic Problem
The 7th Workshop o Combiatorial Mathematics ad Computatio Theory The Local Harmoious Chromatic Problem Yue Li Wag 1,, Tsog Wuu Li ad Li Yua Wag 1 Departmet of Iformatio Maagemet, Natioal Taiwa Uiversity
More informationAdvanced Course of Algorithm Design and Analysis
Differet complexity measures Advaced Course of Algorithm Desig ad Aalysis Asymptotic complexity Big-Oh otatio Properties of O otatio Aalysis of simple algorithms A algorithm may may have differet executio
More informationAnalytic Theory of Probabilities
Aalytic Theory of Probabilities PS Laplace Book II Chapter II, 4 pp 94 03 4 A lottery beig composed of umbered tickets of which r exit at each drawig, oe requires the probability that after i drawigs all
More informationStability Analysis of the Euler Discretization for SIR Epidemic Model
Stability Aalysis of the Euler Discretizatio for SIR Epidemic Model Agus Suryato Departmet of Mathematics, Faculty of Scieces, Brawijaya Uiversity, Jl Vetera Malag 6545 Idoesia Abstract I this paper we
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationKNOWLEDGE OF NUMBER SENSE, CONCEPTS, AND OPERATIONS
DOMAIN I. COMPETENCY.0 MATHEMATICS KNOWLEDGE OF NUMBER SENSE, CONCEPTS, AND OPERATIONS Skill. Apply ratio ad proportio to solve real-world problems. A ratio is a compariso of umbers. If a class had boys
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationChapter 2: Numerical Methods
Chapter : Numerical Methods. Some Numerical Methods for st Order ODEs I this sectio, a summar of essetial features of umerical methods related to solutios of ordiar differetial equatios is give. I geeral,
More informationµ and π p i.e. Point Estimation x And, more generally, the population proportion is approximately equal to a sample proportion
Poit Estimatio Poit estimatio is the rather simplistic (ad obvious) process of usig the kow value of a sample statistic as a approximatio to the ukow value of a populatio parameter. So we could for example
More informationOn Some Properties of Digital Roots
Advaces i Pure Mathematics, 04, 4, 95-30 Published Olie Jue 04 i SciRes. http://www.scirp.org/joural/apm http://dx.doi.org/0.436/apm.04.46039 O Some Properties of Digital Roots Ilha M. Izmirli Departmet
More informationCS 270 Algorithms. Oliver Kullmann. Growth of Functions. Divide-and- Conquer Min-Max- Problem. Tutorial. Reading from CLRS for week 2
Geeral remarks Week 2 1 Divide ad First we cosider a importat tool for the aalysis of algorithms: Big-Oh. The we itroduce a importat algorithmic paradigm:. We coclude by presetig ad aalysig two examples.
More informationREGRESSION (Physics 1210 Notes, Partial Modified Appendix A)
REGRESSION (Physics 0 Notes, Partial Modified Appedix A) HOW TO PERFORM A LINEAR REGRESSION Cosider the followig data poits ad their graph (Table I ad Figure ): X Y 0 3 5 3 7 4 9 5 Table : Example Data
More informationBinary codes from graphs on triples and permutation decoding
Biary codes from graphs o triples ad permutatio decodig J. D. Key Departmet of Mathematical Scieces Clemso Uiversity Clemso SC 29634 U.S.A. J. Moori ad B. G. Rodrigues School of Mathematics Statistics
More informationCS161: Algorithm Design and Analysis Handout #10 Stanford University Wednesday, 10 February 2016
CS161: Algorithm Desig ad Aalysis Hadout #10 Staford Uiversity Wedesday, 10 February 2016 Lecture #11: Wedesday, 10 February 2016 Topics: Example midterm problems ad solutios from a log time ago Sprig
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationA statistical method to determine sample size to estimate characteristic value of soil parameters
A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig
More informationOPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE
Joural of ELECTRICAL EGIEERIG, VOL. 56, O. 7-8, 2005, 200 204 OPTIMAL PIECEWISE UIFORM VECTOR QUATIZATIO OF THE MEMORYLESS LAPLACIA SOURCE Zora H. Perić Veljo Lj. Staović Alesadra Z. Jovaović Srdja M.
More informationImplicit function theorem
Jovo Jaric Implicit fuctio theorem The reader kows that the equatio of a curve i the x - plae ca be expressed F x, =., this does ot ecessaril represet a fuctio. Take, for example F x, = 2x x =. (1 either
More informationCONTENTS. Course Goals. Course Materials Lecture Notes:
INTRODUCTION Ho Chi Mih City OF Uiversity ENVIRONMENTAL of Techology DESIGN Faculty Chapter of Civil 1: Orietatio. Egieerig Evaluatio Departmet of mathematical of Water Resources skill Egieerig & Maagemet
More informationSection 5.1 The Basics of Counting
1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of
More informationLarge holes in quasi-random graphs
Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,
More informationA representation approach to the tower of Hanoi problem
Uiversity of Wollogog Research Olie Departmet of Computig Sciece Workig Paper Series Faculty of Egieerig ad Iformatio Scieces 98 A represetatio approach to the tower of Haoi problem M. C. Er Uiversity
More information