A New Binary Sequence Family with Low Correlation and Large Size

Size: px
Start display at page:

Download "A New Binary Sequence Family with Low Correlation and Large Size"

Transcription

1 1 Nw inary qunc Family wit ow orrlation an arg iz Nam ul u an uang ong, mbr, bstract For o an an intgr wit, a nw amily o binary squncs o prio is construct For a givn, as maximum corrlation "#%$, amily siz )(, an maximum linar span +*,/1 2 imilarly, a nw amily o o binary squncs o prio 4 is also prsnt or vn 5 7 an an intgr wit 8, wr maximum corrlation, amily siz, an maximum linar span ar ) : /(, (, an +*;)<1 2, rspctivly nw amily (or ) contains oztas an umar s construction [1] (or Uaya s [1]) as a subst i squncs ar xclu rom bot constructions s a goo caniat wit low corrlation an larg amily siz, t amily is iscuss in tail by analyzing its istribution o corrlation valus nx rms Family o binary squncs, larg amily siz, linar span, squncs wit low corrlation NOUON n co ivision multipl accss () communication systms, psuonois squncs ar assign to istinct usrs in a common cannl at t sam tim [18] o istinguis ac usr an minimiz mutual intrrnc, w must av low crosscorrlation btwn istinct squncs Furtrmor, w must also av low autocorrlation btwn a squnc an its tim sit vrsion in orr to acquir t accurat pas inormation at t rcivr capacity o t systm can b incras by obtaining an incras numbr o squncs wic support a largr numbr o istinct usrs onsquntly, a amily o squncs wit low corrlation an larg amily siz plays important rols in communication systms construction o a amily o binary squncs o is bas on t combination o a binary squnc an its cimations suc tat t rsulting squncs av low corrlation aciving t wll known lowr bouns riv by Wlc [2], ilnikov [17], an vnstin [1] For o, ol squncs [] constitut on o t amilis wit optimal corrlation aciving t ilnikov boun amily o asami (small st) squncs [] givs squncs wit optimal corrlation aciving t Wlc s lowr boun or vn n orr to obtain binary squncs wit larg linar span as wll as low corrlation, oztas an umar construct a nw amily o binary squncs or o, so call ollik squncs [1] t as t sam prio, amily siz, an maximum corrlation as tos o t amily o ol squncs, is work was support by N rant PN 2277 autors ar wit t partmnt o lctrical an omputr nginring, Univrsity o Watrloo, Watrloo, ON N2 1, anaa (mail: nyyu@ngmailuwatrlooca, ggong@calliopuwatrlooca) but largr linar span giving bttr potntial cryptograpic proprty imilarly, Uaya construct a nw amily o binary squncs wit low corrlation but larg linar span or vn [1] n [7], im an No gnraliz ts two constructions at t pric o t cras o maximum linar span an t incras o maximum corrlation otr known approacs ar summariz as ollows n [2], ang t al sow tat a binary cyclic co bas on trtrm squncs [1] as ivvalu nonzro wigt istribution, wic is intical to t ual co o t tripl rror corrcting co From ts cyclic cos, quivalnt amilis o binary squncs wit sixvalu corrlation o maximum F %, amily siz "J, an maximum linar span ", can b construct n [12], it is sown tat N linar binary cos bcom nonlinar cyclic cos atr a propr prmutation From ts cos, anbag, umar, an llst prsnt a nw gnraliz construction o binary squnc amilis in [1], incluing rock an lsart otals squncs in [5] n tis papr, a nw amily OQP+U o binary squncs an an intgr Z For a givn, maximum corrlation o prio + is construct or o W wit squncs in O P is [ "#%$ an its amily siz is + imilarly, a nw amily OQ]@^U o binary squncs o + is also prsnt or vn W an an intgr wit a b, wr maximum corrlation an amily siz ar c rspctivly maximum an minimum linar spans o squncs in bot O P an OQ]@ /; <;/i ar Qg an Qg, rspctivly s incrass, w obtain a nw amily O P ^U (or Oc]@^U ) o xponntially incras amily siz wit maximum corrlation linarly incras rom its optimal j valu inc t amily O P (or Oc]+U ) contains O P (or Oc]@^ ) as a subst, it contains O P (or Oc]@ ) as a subst r, O P is t amily o ollik squncs construct by oztas an umar, an OQ]@ is t on construct by Uaya, wr squncs ar xclu in bot constructions For a spciic application, w can coos a propr valu an t corrsponing amily O P ^U (or OQ]@ ) For xampl, a small valu o can b cosn i low corrlation is mor crucial tan larg amily siz in t application larg amily siz is mor important, on t otr an, w can allows coos a larg valu o lxibility u to our nw squnc amily to av aaptiv amily siz an maximum corrlation or practical applications Furtrmor, our nw squnc amily as goo potntial cryptograpic proprty wit larg linar span implmntation o OkP@ (or O ] ^U ) is xtrmly asy by summing linar back sit

2 @ U r Q 2 rgistr (F) outputs amily OQP" wit maximum corrlation " an amily siz "J is a goo xampl or compromis btwn corrlation an amily siz is papr is organiz as ollows n ction, w giv som prliminaris on concpts an initions o cos an squncs lso, w rviw a wigt istribution o a linar cyclic subco o t scon orr ullr co [11], wic will b us to invstigat a corrlation istribution o squncs in our nw amily n ction, w prsnt nw amilis OQP@ an O ] ^U o binary squncs o or o an vn, rspctivly, an analyz corrlation an linar span o ac amily n ction, t istribution o corrlation valus o squncs in OFP" is riv in trms o t wigt istribution o a linar cyclic subco o t scon orr ullr co n ction, an xampl o squncs in O P is givn an implmntation bas on Fs is iscuss oncluing rmarks an som obsrvations ar givn in ction PN ollowing notations will b us trougout tis papr is t init il wit lmnts an, t multiplicativ group o i is a vctor spac ovr wit a st o all binary tupls t b positiv intgrs an trac unction rom to is not by, i, ") # N $U%$ ( *) + is simply not as + i t contxt is clar asic concpts (a) oolan unction " t, + b a vctor in i wit / an,c a unction rom to n, t unction %,c taking on valus or 1 is call a oolan unction [11] oolan unction consists o a sum o all possibl proucts o 21 s wit coicints or [4], i, %,c " N ;:<:<: 21 "" 21 :<:<: 1 wr maximum valu o wit nonzro :<:<: 1 is call t gr o t oolan unction %,c (1) is call an algbraic normal orm o a oolan unction [4] (b) ullr cos For, t rt orr ullr () is in by a st o all vctors "7i o lngt %@ o lngt givn by [11] %@ [ :<:<: 1 " wr 1 o " 5@ vctors o lngt or 7i, "" " 7 (1) (2) ar basis, is t vctor wos t lmnt is t prouct o t t lmnts rspctivly n, +J i is all zro or all on vctor o lngt, an i is always t ual o t xtn amming co wic is also obtain rom a ylvstrtyp aamar matrix [11] n (2), t t lmnt o a cowor in + i is givn by a oolan unction + " ; N wit gr o at most, wr " ; N ar t t lmnts rspctivly w rmov t t componnts corrsponing to ; " O P, tn w obtain a punctur co + i or, wr ac cowor as lngt + 4 (c) rac rprsntation o a binary prioic squnc t O b a st o all binary squncs o prio Q " an b a st o all unctions rom to For any unction, can b rprsnt as [4] * +[ %W NW wr Q" is a cost lar o a cyclotomic cost moulo, an ZN is t siz o t cyclotomic cost containing Q For any squnc []J WO, tr xists ^ suc tat ] %_ N`c " wr _ is a primitiv lmnt o n, is call a trac rprsntation o [ linar span o t squnc [ is qual to a %c, or quivalntly t gr o t sortst b linar back sit rgistrs tat can gnrat [ () Wigt an xponntial sum o a binary cowor or squnc t [5] " b a binary cowor o lngt 5] 5] Q, or a binary squnc o prio Q numbr o s in t cowor is call a (amming) wigt larly, t total sum o aitiv caractrs o a cowor or squnc [ wit wigt is givn by Q Qa an [ is rprsnt by a trac rprsntation +, i, ] _ or a primitiv lmnt _ o, tn t xponntial sum o + ovr is givn by l [ kj g g"i wit + nc, t xponntial sum o + as ontoon corrsponnc wit t wigt o a cowor or squnc givn by () orrlation o binary squncs t [ an m b binary squncs o prio Q corrlation o [ an m is in by npo +r/[ q Zs Jt ` wr r is a pas sit o t squnc m an t inics ar ruc moulo Q m is cyclically quivalnt to [, i,

3 U U g 8 m ];5]Q q " 5]7 n n o, +r< is t autocorrlation o [, o +r/ n o or sort Otrwis, +r/ is t crosscorrlation o [ q an m W may writ ]J _ or + wit a givn r an a primitiv lmnt _ o n, npo +r/[ q wit xponntial sum o () inary signal st nc, Zs t no q [ g"i kj +r< can b prsnt by t For binary cyclically istinct squncs o prio Q, " )g )g )g wit b, lt O g " g an n # $ # 1 $ r/ or any rab QJ k; b n i W larly, is maximum o all i, n wr r nontrivial auto an crosscorrlations o t squncs in O n st O will b call a +Q" signal st or amily o squncs, wr is t st siz or amily siz, an n is t maximum corrlation magnitu o O Wigt istribution o a linar subco o n tis papr, w consir a componntwis sum o a pair o binary squncs, wr t sum is quivalnt to a cowor o a linar cyclic subco o t punctur scon orr ullr co us, w can apply t wigt istribution o t subco or t istribution o corrlation valus o t squncs (a) Wigt istribution o a cowor st wit rank + For o a, w consir a cowor givn by +[ 4 1 N`( 7i () wr ac wit is an lmnt in For on t otr an, w consir a cowor givn by 1 ( wr ac i or, an Wit " rspct to a basis o, a * is an xpansion o wit or all pplying tis xpansion to () or (4), w s tat + a U ** is quivalnt to a oolan unction o gr lss tan or qual to 2, an it may b writtn as ollows: %,c " N,",$# %^,$#p, N )( wr is an +* binary uppr triangular matrix, % is a binary vctor in, an ( " o lngt Obviously, is trmin by s or nonzro, an % by Wil, + " N runs troug ac nonzro binary tupl in i, %,c proucs ac lmnt o a cowor o lngt +i in 7i quivalntly, + orms a cowor in 7i or ( (4) (5) For a givn nonzro, it is wll known tat t wigt istribution o a st o cowors o a quaratic oolan unction %,c or all % is trmin by a rank o a symplctic matrix, # [11] quivalntly, w can consir a symplctic orm j + /k + + / / associat [5] W list t wit + or givn s wit ollowing act rgaring t istribution o xponntial sums o + Fact 1 (orm 2 in [5]): t b givn suc tat at last on s o + in () or (4) is nonzro or, wr 21 For an intgr wit `, i j + / as a rank, or quivalntly j +/" as +/i54 solutions in or all /, tn t xponntial sum /74 o taks on valus o an or all, an its istribution is givn by g"i j wit + g : +/ 4 _+/ tims tims tims (b) Wigt istribution o a linar subco wit multipl ranks For a st o istinct nonzro s, w can consir a st o cowors givn by,c in (5) or all % quivalntly, w can consir a st o cowors givn by or istinct sts o s suc tat at last on is nonzro in ac st o s or 4 n, may av istinct multipl ranks ac o wic corrspons to ac st o givn onsquntly, t xponntial sum o can tak on valus +/ 4 o an or ac possibl rom Fact 1 urtr constituts a linar subco or t sts o s s, w may us t wigt istribution o t subco in orr to invstigat t istribution o xponntial sums o Nxt, w spciy t known wigt istributions o two linar cyclic subcos o 7i or o, wic will b us in a latr sction or trmining t corrlation istribution o a nw amily o squncs For ]Z in an wit ;< +Z7ik or o, a linar cyclic subco n@ givn by +[]* Q or as t istribution o wigts an corrsponing xponntial sums in abl, wr n / For ] in or o, a linar cyclic subco givn by # + %]* 2@ or ( as t istribution o wigts an corrsponing xponntial sums in abl n bot abls, t xponntial sum mans a g"i j g wit +"[ r ar svral n irnt ways to stablis t valiity o wigt istribution o, s [11], or xampl, s [] an [11] For tos o n # NW F OF N QUN W Z n tis sction, w prsnt nw amilis o binary squncs wit larg amily sizs as wll as larg linar spans or o an vn

4 @ 8 J ) g 4 W UON OF N Wigt xponntial um istribution / 2 / / / " 2 / 2 / / 2 < onstruction o OQP@ or o W UON OF # N $% () Wigt xponntial um istribution /+*, " $ 7$/ % 7$, 1 / % $ /+* 7$, 7 $ 8 7$ $U, %;: / onstruction 1: For o W an an intgr wit 4, a amily O P U o binary squncs is in by "" O P [ ) % 5@ %@ N@ " wr is a binary squnc o prio +: wit _ or a primitiv lmnt _ o, wr +, t trac rprsntation o, is givn by or ( +[ :<:<: #%$ F@ + U paramtrs o a nw signal st OFP"U ar trmin by t ollowing torm orm 1: For o 4 squncs o an an intgr () wit, t amily OQP@^U cyclically istinct binary corrlation o squncs is valu an maximum corrlation is 5 ^#%$ ror, O P constituts a ^#%$ signal st n orr to sow orm 1, i, to trmin amily siz an corrlation o O P ^U, w n t ollowing lmmas mma 1: ll squncs in O P U ar cyclically istinct us, t amily siz o O P ^U Proo: onsir a tim sit vrsion o a squnc in OcP^U rprsnt by ;J ;J ; " or J J 7 5J", an t is intical to anotr squnc o (), i, or all i an only i J "@ NJ or : kb4* (7) an or From ;< + 7$ [ or o, is a uniqu solution aciving in (7), it only givs a trivial solution or b us, squncs in O P ^U rprsnt by or in wit b, ar cyclically istinct crosscorrlation o two squncs an in O P is givn by n P Q r/k j g"i wr (8) + wr " J [ )J wit kb4 an a primitiv lmnt o n otr wors, t sum o an a r sit vrsion o can b consir as a cowor givn c b () 4 _ wr _ is by in (8) us, w n to invstigat t xponntial sum o + or t corrlation o a pair o squncs n t ollowing, w classiy t xponntial sum in trms o valus o 8 s as 1 or 4 n tis cas, + is corrspons to a trivial xponntial sum corrsponing to inpas autocorrlation o a squnc us, its xponntial sum as 2 an or ` n tis cas, + nc, w av t xponntial sum or any rom t ortogonality o t trac unction [4] as t last on 8 or : 4 n tis cas, + is quivalnt to a quaratic oolan unction us, w n to invstigat t numbr o roots o its symplctic orm j + /

5 ) W W ] 5 in orr to apply Fact 1 or trmining t istribution o xponntial sums o + + mma 2: For o an an intgr wit, lt s o + in (8) b givn suc tat at last on is nonzro or : 4 n, t symplctic orm j +/" associat wit as at most U%7 roots in or all / Proo: For givn s, t symplctic orm j +/" associat wit + is givn by j +/"F + / / / / (1) / $ $ + / + wr Na $ $ j /k or all / i an only i N From (), _+[ $ $ 8+ U [ $ ; $ [ ; $ $ 8+ U [ $ ; $ [ ; [ $ ; $ [ ; J $ [ $ $ [ ; U / [ ; Not tat < [ t n, w av wr +[ :<:<: #%$U $ N < < ; (11) + /%; [ ; + ) [ ) (12) $ i $ ogtr wit (11), + + ; (1) :<:<: #%$ [ ; 7 $ $ ) (14) For _+, w av to count t numbr o solutions in t quation + ; k (15) :<:<: #%$ s in an in or givn Nxt, w vriy tat :<:<: #%$ + is not a constant polynomial o (i, a trivial polynomial), or rom (12), an or rom () n, at last on is nonzro or bcaus / at last on is nonzro, on t otr an, cannot b zro altoug may b zro or all : ror, :<:<: #%$ + is a polynomial o wit at last on nonzro coicint o or b kb4 For t nontrivial polynomial :<:<: #%$ +, t quation in (15) can b ivi into our classs i) [ an N :<:<: #%$U N, ii) [ an ; [ :<:<: #%$ +, W iii) [ an ; k :<:<: #%$ iv) +[ an ; [ :<:<: #%$ us, t ltan si o (15) can b prsnt by W [ :<:<: #%$U 7 [ ] $ $ F or ] J )" n, #%$ kl :<:<: #%$U #%$U ] ] #%$U [ #%$ #%$ #%$ $ #%$1$ #%$ #%$ an #%$U +[ W N ) us, solutions or W #%$U +[ ar all solutions or W N W is qual to tat or W #%$ maximum gr o W #%$U + is " g, W #%$ N most " g solutions, t solutions o W #%$ N ar isjoint or irnt ] J )" numbr o solutions o (15) is at most U % g, on t otr an, t solutions o W #%$ + ar isjoint or irnt ] J 8 solutions o (15) is at most " 7 " g manwil, a possibl numbr o roots o j +/" is +/i54, an vic vrsa ror, t numbr o solutions or inc t as at wr, so t total, so t total numbr o From Fact 1, is a positiv o intgr or o For any valu o in, tror, t maximum numbr o solutions o j /k is "%7 From mma 2, w s tat j + /4 as +/i54 solutions or an intgr wr is a positiv o intgr lss tan or qual to W From Fact 1, or all, t "<74 xponntial sum o + can tak on valus o an or an intgr wr is a positiv o intgr lss tan or qual to t tis point, w n to sow tat it +<74 can tak on valus o an or all s suc tat

6 g n orr to o so, w n t ollowing act rom [11] (Not w sligtly cang t rprsntation o t rsult in [11]) is vry positiv o intgr lss tan or qual to Fact 2 ( [11], pag 454): t b a st o symplctic orms o (1) For som ix intgr wit 1, assum tat t rank o vry nonzro orm in is at last n, t maximum siz o is givn by +/ % or o ;/ g g or vn ) n t ollowing, w consir a spciic linariz polynomial an invstigat a rank o t symplctic orm corrsponing to t polynomial mma : For an intgr, consir a symplctic orm +/"[ / + wr a linariz polynomial + is givn by 7 k $ $ wr can b any lmnt in For o, t rank o +/" is at last an vry possibl rank or 5W occurs at last onc wn runs troug For vn, on t otr an, t rank is at last an vry possibl rank or a occurs at last onc wn runs troug Proo: Not tat t o cas in mma is implicitly known rom orm 1 an orollary 17 o aptr 15 in [11] r, w rprouc it or compltnss t b an intgr wit y w av /W / + wr a U $ $ n, t maximum # gr o + $ $ is g an tus t rank o / is at last ( is o, t rank is at last bcaus it soul b vn) For o, assum tat t rank nvr occurs or all s wit : À, an tus t rank o / is at last n, rom Fact 2, t maximum siz o a st +/ o suc + / s is g owvr, its actual siz g wn s wit : run troug, j wic is gratr tan ror, t rank o occurs at last onc wn s run troug For vn, 4 i t rank nvr occurs, tn t minimum rank is imilarly, t maximum siz o a st o suc ;/ / s is g g, wic is smallr tan its actual siz +/ g ror, t rank o occurs at last onc wn s run troug inc + contains vry + s or wn s wit 5 run troug, t assrtion o mma ollows Using mma, w av t ollowing rsult + mma 4: For o an an intgr wit, lt 8 s o + in (8) b givn suc tat at last on is nonzro or 4, an n, t xponntial / 4 sum o + can tak on valus o an or an intgr wr to is vry positiv o intgr lss tan or qual, tn t linariz polynomial givn in (14) (i, it is intical to (1)) is o t orm o + in mma From mma, t xponntial / 4 sum o or is qual to or or all s " suc tat us, w can say tat Proo: For, by J t xponntial sum o taks on valus o an or vry intgr suc tat J "" +/74 <74 Now, it suics to sow tat t xponntial sum taks on valus o at last onc wn Or quivalntly, w n to sow t symplctic orm j + / in (1) as a rank o at last onc or som s ssum tat tis rank nvr occurs or all s n, t rank o j / is at last 5 From Fact 2, t maximum siz o a st o suc j / s is +/ g owvr, rom () an (1), its actual siz is +U, wic is gratr tan ror, t rank o occurs at last onc wn s run troug is complts t proo o mma 4 ombining t cass 1, 2, an, w av t ollowing rsult on t corrlation o squncs in OFP" mma 5: corrlation o binary squncs in O P is n valu an maximum corrlation 5 "#%$ Proo: For a trac rprsntation + o ac squnc in O P, w can consir t xponntial sum o + in (8) n cass 1 an 2, t xponntial sum as " an valus For all s in cas, rom mma 4, t xponntial /74 sum taks on an or ac intgr suc tat 5 7 " us, t xponntial sum taks on nonzro istinct valus ncluing an, tror, t 4 ovrall xponntial sum is valu quivalntly, t 5 corrlation o squncs in OQP" is valu inc maximum valu or is trmin by rom mma 4, n N@/ 4 ^#%$ Proo o orm 1 rsults ollow irctly rom mmas 1 an 5 mark 1: ++F F@, + 5` (1) wic rprsnts t ollik quncs introuc by oztas an umar [1] From mma 4, a positiv o intgr lss tan is only <, so nc, Finally, ollik squncs givn by (1) av ourvalu + corrlation, or or xampl 1: +[ F@ or an o / an U (17) From mma 4, is a positiv o intgr lss tan, so an us, From mma 5, squncs givn by (17) av

7 8 J 7 +N % + ;, t corrsponing + in (8) constituts a sixvalu corrlation, or For squncs rprsnt by an linar cyclic subco wit iv nonzro istinct wigts i w assum tat can b any lmnt in n act, t corrlation istribution o O P can b riv rom abl tails will b iscuss in ction xampl 2:, or / +F@ + / / (18) an o imilarly, an From mma 5, squncs givn by (18) av igtvalu corrlation, or + " / or onstruction o O ] or onstruction 2: For vn an an intgr wit b, a amily O ] ^U o binary squncs is in by Oc]@[ ) %@ 5@ " wr is a binary squnc o prio +: wit _ or a primitiv lmnt _ o, wr +, t trac rprsntation o, is givn by +F@ F@ (1) + or ( + orm 2: For vn a an an intgr wit : b, t amily O ] ^U cyclically istinct binary squncs o prio +a corrlation o squncs is valu an maximum corrlation " ror, + [ O ] ^U constituts a signal st n orr to prov orm 2, w n t ollowing lmmas inc tir proos ar similar to tos or O P U, w omit t tails mma : ll squncs in OQ]@^U ar cyclically istinct nc, t amily siz o OQ]+U + Proo: imilar to t proo o mma 1, ; or all in i an only i (7) is aciv ;< +, tn is not a actor o ;< 5 +5 sinc ; < 5 or any intgr nc, i is a solution o, tn it cannot b a solution o $U anwil, w av at last two quations o, or in (7) bcaus b or vn us, (7) as a uniqu solution givn by nc, all squncs in O ] U ar cyclically istinct o invstigat t corrlation o squncs in O ] ^U, w n to consir + givn by N (2) wr [ " J kb4 an c b 4 (21) )J wit or all 5, t xponntial sum o + as a valu o Otrwis, w av to consir t numbr o solutions o j /k in orr to riv t istribution o xponntial sums o + in an an intgr wit b, lt s o in (2) b givn suc tat at last on is n, t symplctic orm j + / associat wit + as at most "% roots in ( or all / mma 7: For vn nonzro or a Proo: W av j /k / $ $ 8+ / J ) us, j +/"[ or all / i an only i Using t sam approac as w i in t proo o mma 2, w obtain intical to (1) an t quation (15) Following t sam stps as in t proo o mma 2, w can riv tat t numbr o solutions o j /k is at most mma 8: For vn an an intgr wit b, lt 8 s o in (2) b givn suc tat at last on is nonzro or 5, an n, t xponntial <74 sum o + can tak on valus o an or an intgr j wr is zro or vry positiv vn intgr lss tan or qual to nc, t corrlation o binary squncs in Oc]@^U is n valu an maximum corrlation is [ Proo: For vn, w s tat wil ac wit kb4 runs troug, ac o in (1) runs troug From mma, tror, w obtain tat t xponntial /74 sum o + taks on valus o an or vry intgr " suc tat Nxt, w will sow tat t cass an also occur all s o in (1) ar zro, tn [ as at most our solutions, i,, an wr t last tr solutions ar vali only i us, w av a uniqu solution or suc tat nc, t cas occurs at last onc pplying Fact 2, w also obtain tat t xponntial / 4 sum o + can tak on valus o at last onc suc tat in t similar way to t proo o mma 4

8 8 ror, t xponntial sum o + taks on valus o +/74 an or an intgr wr J " ncluing n an +, t corrlation is valu Furtrmor, [4 or Proo o orm 2 rsults ollow irctly rom mma an mma 8 mark [ F@, + ( (22) wic rprsnts t squncs construct by Uaya [1] From mma 8, an nc, an Finally, t squncs givn by (22) as sixvalu corrlation, + or or Q xampl :, F@ + + or ( an vn From mma 8, an tus, Q squncs givn by (2) blongs to Q 8 or %@ (2) nc, t corrlation o mark : ontrary to o, in (2) os not constitut a linar cyclic subco bcaus wit kb may not run troug all lmnts in ror, w soul us irnt mtos rom o to invstigat t corrlation istribution in O ], wic is a problm w ar working on inar spans o O P ^U an Oc]@^U linar spans o binary squncs in OFP" an O ] ^U ar trmin by t numbr o s wit Qb4 orm : n t amily O P ^U + s in ar qual to t squnc rprsnt by F@ o t squnc n, an tr ar aving linar span (or Oc]@ ), consir a U b t linar span k [ 7 squncs in O P (or Oc]@^U ) U From tis rsult, t linar span o squncs in OcP" (or O ] ^U ) an its istribution ar sown in abl Proo: Firstly, consir t linar span o squncs in O P ^U n onstruction 1, a squnc rprsnt by + as a total Q trac trms an ac trac trm as t linar span s o t squnc ar qual to, it as Q + nonzro trac trms an t corrsponing linar span o t squnc is givn by [ k ` ) N PN N NU OF OPONN QUN N (O 1 ) Numbr o squncs +*,/1 2 ( +*,/1 2 ( % 7 ( +*, 2 $ 2( % 7 ( 2 +*; 2 2 (/1 s ar s ar nonzro, t numbr o + corrsponing squncs givn by + is pplying tis rsult to ac wit, w obtain t linar span ^U o binary squncs in OFP@ wit t istribution sown in abl Using t similar approac to o cas, w s tat t linar span o squncs in O ] ^U is t sam as OQP^U orollary 1: maximum an minimum linar spans o squncs in O P an OQ]@ / ar Qg /;<% an Qg, rspctivly omparison o amilis o binary squncs n abl, w giv som comparisons o t amilis O P ^U an Oc]@^U wit wll known amilis o binary squncs wit low corrlation n abl, w inclu a amily o binary squncs construct rom ang t al s invstigation o a binary cyclic co bas on trtrm squncs [2] o, ac squnc in t amily is rprsnt + N Q or ( in On t otr an, a amily o squncs in by F@ +$7 rom t ual o t tripl n rror corrcting co, as t sam prio, amily siz,, an maximum linar span as tos o ang t al s or %@ in or o [11] n trms o prios an maximum linar spans, nw amilis O P ^U an Oc]+U ar intical to t amilis o ollik squncs an Uaya s, rspctivly t t xpns o maximum corrlation n 5, owvr, w av largr amily sizs in O P ^U an OQ])^U tan in tos amilis asically, w obtain O P an OQ]@ wit xponntially incras amily sizs by t linar incras o n 5 rom optimal corrlation Furtrmor, w can coos an t corrsponing amily O P ^U (or Oc]@^U ) or its spciic application For xampl, i low corrlation is mor crucial tan a larg amily siz in t application, tn a small valu o is cosn Otrwis, w coos a larg valu o in orr to gt a larg amily siz onsiring t lxibility u to, OFP@^U an O ] av largr amily sizs tan any otr amilis o binary squncs in abl n OcP"U an O ] ^U, squncs ar not inclu or incrasing tir minimum linar spans us, ty av largr minimum linar spans tan any otr binary squnc amilis in abl xcpt or bnt squncs, wic will b goo proprty or potntial cryptograpic applications

9 J J 8 g J OPON OF F OF N QUN W OW OON Family o quncs Prio Family iz inar pan (aximum, inimum) ol [] o asami (mall t) [] $ 2 vn asami (arg t) [] / ( 2 vn or nt [14] 1 vn oztas an umar 2 o Uaya [1] 2 vn ang t al (triplt) [2] [11] 2 5 o otaus [15] 2 5 o rock [1] / 2 o lsartotals [1] 2 / 2 o Nw Family 1 2 +*; 2 $ o Nw Family *; 2 $ vn Nw Family 1 / 2 ( 2 +*; 2 2 (<1 o Nw Family 1 2 ( 2 +*; 2 2 (<1 vn $ " # "$ 2 % / ( < [] linar spans o rock an lsartotals squncs ar not givn in [1] UON OF OON U OF O P n many applications, a amily o binary squncs wit bot low corrlation an larg amily siz is rquir us, w n to consir a amily o squncs wic can b a goo compromis btwn corrlation an amily siz s a goo caniat o suc a amily, w xtnsivly iscuss a nw squnc amily OQP" by analyzing its corrlation istribution For o a +, a amily OQP o binary squncs is givn by O P N ) F@ wr prio + wit _ o, " _ is givn by is a binary squnc o or a primitiv lmnt k F@ F@ + or ( From orm 1, w know tat t amily O P as J cyclically istinct binary squncs o prio " corrlation o squncs in O P is sixvalu an its maximum is onsquntly, OQP+ constituts J c % signal st is ata o OQP is list in abl Nxt, w will invstigat t istribution o corrlation valus o squncs in OQP" corrlation o a pair o squncs in OQP@ is riv rom t xponntial sum o [JF@ ; JF@ [ J o %@ )J J ), an an Wit Q ] O@ or 4 ", as a orm + ]* (24) or ] an pning on s, t xponntial sum o can b classii into two xclusiv cass o acilitat t analysis, assum tat can b any lmnt in as 1 c or n tis cas, + ]* ) constituts a linar cyclic subco o i or ]Z us, t istribution o t xponntial sums o + is intical to abl wit < as 2 t last on or 4 n tis cas, t istribution o t xponntial sums o + ollows rom t ollowing lmma mma : For givn s wit at last on nonzro, + in (24) as ivvalu xponntial sum or all ]Z in, an t istribution is g"i wr "4 : "4 < + 4 "4 4 /, an "54 tims tims (25) ar intgrs suc tat Proo: is ix to an lmnt in, t xponntial sum o ollows t istribution in Fact 1 pning on

10 g _ 8 : 1 t rank o its symplctic orm inc, it is obvious tat t symplctic orm o + wit at last on nonzro may av a pair o istinct ranks an pning on 4 4, wr an, rspctivly For a subst o, assum tat i, + as t rank an otrwis, as t rank, wr Q an runs troug all lmnts in, t ovrall istribution o t xponntial sums bcoms (25) atr summing up t istributions or an y combining bot cass 1 an 2, w s tat as sixvalu xponntial sum or any in n, + quivalntly constituts a linar cyclic subco o 7i wit iv nonzro istinct wigts or ], an s in wit t assumption tat ac trmin by can b any lmnt in nc, ac cowor in t subco as an its imnsion is u to ]Z, an in inc t subco contains t ual o t oubl rror corrcting co, t co contains t ual o our subco ror, it is clar tat t minimum istanc o t ual o our subco is at last anwil, w also know tat i t numbr o nonzro istinct wigts o a co is lss tan or qual to a minimum istanc o its ual co, tn its wigt istribution is an xplicit unction o its cowor lngt, imnsion, an istinct wigts (aptr, orm 2 in [11]) nc, i w apply tis to our subco, w s tat its wigt istribution is trmin by t cowor lngt, imnsion, an istinct wigts bcaus it as at most nonzro istinct wigts onsquntly, t subco as t sam wigt istribution as in abl o ction bcaus it as n t sam cowor lngt, imnsion, an wigts as tos o Now, w riv # valus o an in mma mma 1: For an in mma, / / N Proo: For givn s wit at last on nonzro, t xponntial sum o as t istribution o (25) F or 4, on t otr an, + %]* n tis cas, t xponntial sum o as t istribution / y summing up t istributions o bot cass, t ovrall istribution o xponntial sums o in abl or is givn by tims 4 : + "54 4@ 4 + "54 4 tims g"i or all sts o s in < / ) (2) orovr, tis istribution is intical to t wigt istribution in abl Not tat ompar wit abl, t valus o an ollow immiatly o ar, w assum tat can b any lmnt in n squncs aspct, owvr, s in (24) cannot b wit nonzro us, w must rmov tis cas rom t istribution in (2) in orr to obtain t istribution o corrlation valus o squncs in O P orm 4: complt istribution o corrlation valus is as ollows o any pair o binary squncs in O J tims 7$ 7$ n P P / "Ï < )@<N : 7$ tims tims (27) Proo: (2) sows t istribution o xponntial sums o + or all ]Z an s in o corrlation valus o squncs in OFP@ o invstigat t istribution, w n to consir t istribution o xponntial sums o witout ;, wic mans rmoving t istribution o (25) rom (2) orovr, not tat wit rspct to t corrlation o squncs, ] an run troug all lmnts in by J an J as wll rspctivly y aitionally multiplying ac istribution o xponntial sums by "J, tror, w gt t istribution o corrlation valus o (27) From orm, t linar span o squncs in O P t ollowing istribution [ <; + 4 <;/ Qg <;/ g g ) tim tims tims N P N PNON as n tis sction, w giv an xampl o squncs in OkP or an prsnt t implmntation o squncs in OcP"U (or O ] ) bas on linar back sit rgistrs (Fs) n xampl o O P onsir a init il gnrat by a primitiv lmnt _ satisying _ n O P, t t usr s squnc ) is givn by an valuation o (17) at _ 5), i, $ ( #" %$ " 7 $ $ ( %$ " 7 $ ( #" %$ 7 $ ( 47 %$ )( wr a or cyclically istinct binary squncs in OFP@ (28) W av 184 t )

11 n ) 2 11 wr %_, an w not ) )g cimation squnc rom ) n, ) is givn by "@ " "@" " " " " "@" is obtain rom a linar com g, or tir sits n or From orm 4, t corrlation istribution o squncs From (28), w s tat bination o squncs ) )) g ) g ) tail, or N, ) itr or, ;, in O P or is givn by ) tims 8 < " +r/[ ( : ), t (2) tims tims tims tims tims wic is also vrii rom computr xprimnts F mplmntation From t prvious xampl, w s tat t procss or ob Ẍ W taining a squnc in O P is unrstoo by aing N squncs wit irnt back polynomials an irnt initial stats nc, O P is asy to implmnt by summing F outputs just lik ol squncs + For, stag Fs ar rquir to implmnt squncs in OQP" wr t Fs av irnt caractristic polynomials or gnrating cyclically istinct squncs pciically, lt b a primitiv polynomial ovr o gr an _ b a root o in W comput wic is a minimal polynomial o _ ovr wit (or mor tails about computation o minimal polynomials, s [4]) Using 7%+ as 4 t caractristic polynomial o t t F or (st 4 +[ + ), t initial stats o F or 5 can b arbitrary incluing zro For, on t otr an, t initial stat o F is givn by "%_ g< wit, wic is ix or all usrs gnric scription o an F implmntation o OFP^U is sown in Fig For vn, t squnc amily OQ]+U can b implmnt in t similar way to OQP", wic is omitt r n, t implmntation o O ] ^U is similar to Fig 1 xcpt tat F as a siz o wit a ix initial stat Fig 2 sows t F implmntation o O P or in t prvious xampl n Fig 2, ac stag F gnrats an squnc initial stats o t uppr two Fs ar irntly loa accoring to an ) wit a usr inx On t otr an, t initial stats o t lowr two Fs ar as sown in t igur initial stats o F 2 an F ar givn by NJNJNJNJ " arying initial stats Fix initial stats F : F 1: F (( ): #%$U F ( : # F : Fig 1 F implmntation o ( 7, tn t initial stat o F is st as zro arying initial stat * * * * * * * zro initial stat or * * * * * * * zro initial stat or or, Fig 2 F implmntation o wit caractristic polynomials ( $, 2 $, an $ ( 4 $ an [, rspctivly, wic can b obtain rom (2) ccoring to irnt initial stats o uppr two Fs, 184 cyclically istinct binary squncs ar gnrat to support as many irnt usrs ONUON N O OON Nw amilis o binary squncs o prio W5 bn prsnt in tis papr For o an an intgr wit :, a nw amily O P as amily siz o +U an maximum corrlation o 5 "#%$ For vn + an an intgr wit b, on t otr an, a nw amily OQ]@^U as amily siz o +U an maximum corrlation o [4 maximum an minimum linar spans o bot OQP" an O ] / ar Qg /;<% an Qg, rspctivly From t lxibility u to, our nw squnc amilis av aaptiv amily siz an maximum corrlation larg linar spans o OQP" an O ] ^U imply tat ty av goo potntial cryptograpic proprty

12 12 For ac wit b OcP^ (or O ], OQP@^U (or O ] U ) contains ) as a subst us, t nw amily contains oztas an umar s cas corrsponing to OFP" (or Uaya s cas corrsponing to O ] ) as a subst i squncs ar xclu rom bot cass amily O P is consir as a goo caniat wit larg amily siz as wll as low corrlation For O P, w urtr riv t corrlation istribution o squncs in O P t t n, w prsnt t F implmntation o O P ^U (or OQ]@ ) an sow tat it is xtrmly asy to implmnt t squnc amilis by mans o F structurs Finally, w woul lik to point out on intrsting rsmblanc btwn our nw binary squnc amily O P (or Oc]@ ) an t quatrnary squnc amily O a in [8], an awar work by umar, llst, alrbank, an ammons Jr, in 1 From O 1, i w rplac t trac unction rom alois ring i to by t trac unction rom to, an rplac t scalar actor o t sum o tos monomial trac trms by a scalar actor, an a t sum o t rmaining quaratic monomial trac trms wit coicint, tn O a bcoms O P (or Oc]+U ) in our construction wr NOWN autors woul lik to tank t anonymous rviwrs or tir lpul commnts autors rsarc is support by N rant PN 2277 FN [1] oztas an P umar, inary squncs wit ollik corrlation but largr linar span, rans norm ory, vol 4, no 2, pp 5257, ar 14 [2] ang, P aal, W olomb, ong, llst, an P umar, On a conjctur ial autocorrlation squnc an a rlat triplrror corrcting cyclic co, rans norm ory, vol 4, no 2, pp 887, ar 2 [] ol, aximal rcursiv squncs wit valu rcursiv crosscorrlation unctions, rans norm ory, vol 14, pp 15415, Jan 18 [4] W olomb an ong, ignal sign or oo orrlation or Wirlss ommunication, ryptograpy an aar ambrig Univrsity Prss, 25 [5] llst an P umar, quncs wit ow orrlation captr in anbook o oing ory it by Plss an uman lsvir cinc Publisrs, 18 [] asami, Wigt numrators or svral classs o subcos o t 2n orr ullr cos, normation an ontrol, vol 18, pp 4, 171 [7] im an J No, Nw amilis o binary squncs wit low corrlation, rans norm ory, vol 4, no 11, pp 55, Nov 2 [8] P umar, llst, alrbank, an ammons Jr, arg amilis o quatrnary squncs wit low corrlation, rans norm ory, vol 42, no 2, pp 5752, ar 1 [] P umar an coltz, ouns on t linar span o bnt squncs, rans norm ory, vol 2, no, pp 85482, Nov 18 [1] vnstin, ouns or cos as solutions o xtrmum problms or systm o ortogonal polynomials,, ctur Nots in omputr cinc 7 rlin: pringrrlag, pp 2542, 1 [11] F J acwilliams an N J loan, ory o rrororrcting os mstram: Nortollan, 177 [12] Ncav, rock co in a cyclic orm, iscr at ppl vol 1, pp 584, 11 [1] J No, W olomb, ong,, an P aal, inary psuoranom squncs o prio wit ial autocorrlation, rans norm ory, vol44, no 2, pp , ar 18 [14] J Olsn, coltz, an Wlc, ntunction squncs, rans norm ory, vol 28, no, pp 85884, Nov 182 [15] O otaus, oii ol os, rans norm ory, vol, no 2, pp 545, ar 1 [1] anbag, P umar, an llst, mprov binary cos an squnc amilis rom 4 linar cos, rans norm ory, vol 42, no 5, pp , pt 1 [17] ilnikov, On mutual corrlation o squncs, ovit at okl,, vo12, pp 1721, 171 [18] imon, J Omura, coltz, an vitt, pra pctrum ommunications, vols omputr cinc Prss, ockvill, 185 [1] P Uaya, Polypas an rquncy opping squncs obtain rom init rings, P issrtation, pt lc ng, nian nst cnol, anpur, 12 [2] Wlc, owr bouns on t maximum cross corrlation o t signals, rans norm ory, 2, pp 7, ay 174

Online Supplement: Advance Selling in a Supply Chain under Uncertain Supply and Demand

Online Supplement: Advance Selling in a Supply Chain under Uncertain Supply and Demand Onlin Supplmnt Avanc Slling in a Supply Cain unr Uncrtain Supply an Dman. Proos o Analytical sults Proo o Lmma. Using a = minl 0 ; x g; w can rwrit () as ollows (x ; w ; x ; w ) = a +(m0 w )a +( +" x w

More information

Minimum Spanning Trees

Minimum Spanning Trees Yufi Tao ITEE Univrsity of Qunslan In tis lctur, w will stuy anotr classic prolm: finin a minimum spannin tr of an unirct wit rap. Intrstinly, vn tou t prolm appars ratr iffrnt from SSSP (sinl sourc sortst

More information

10. EXTENDING TRACTABILITY

10. EXTENDING TRACTABILITY Coping with NP-compltnss 0. EXTENDING TRACTABILITY ining small vrtx covrs solving NP-har problms on trs circular arc covrings vrtx covr in bipartit graphs Q. Suppos I n to solv an NP-complt problm. What

More information

3-2-1 ANN Architecture

3-2-1 ANN Architecture ARTIFICIAL NEURAL NETWORKS (ANNs) Profssor Tom Fomby Dpartmnt of Economics Soutrn Mtodist Univrsity Marc 008 Artificial Nural Ntworks (raftr ANNs) can b usd for itr prdiction or classification problms.

More information

Exponential Functions

Exponential Functions Eponntial Functions Dinition: An Eponntial Function is an unction tat as t orm a, wr a > 0. T numbr a is calld t bas. Eampl: Lt i.. at intgrs. It is clar wat t unction mans or som valus o. 0 0,,, 8,,.,.

More information

Chapter Finding Small Vertex Covers. Extending the Limits of Tractability. Coping With NP-Completeness. Vertex Cover

Chapter Finding Small Vertex Covers. Extending the Limits of Tractability. Coping With NP-Completeness. Vertex Cover Coping With NP-Compltnss Chaptr 0 Extning th Limits o Tractability Q. Suppos I n to solv an NP-complt problm. What shoul I o? A. Thory says you'r unlikly to in poly-tim algorithm. Must sacriic on o thr

More information

First order differential equation Linear equation; Method of integrating factors

First order differential equation Linear equation; Method of integrating factors First orr iffrntial quation Linar quation; Mtho of intgrating factors Exampl 1: Rwrit th lft han si as th rivativ of th prouct of y an som function by prouct rul irctly. Solving th first orr iffrntial

More information

Kernels. ffl A kernel K is a function of two objects, for example, two sentence/tree pairs (x1; y1) and (x2; y2)

Kernels. ffl A kernel K is a function of two objects, for example, two sentence/tree pairs (x1; y1) and (x2; y2) Krnls krnl K is a function of two ojcts, for xampl, two sntnc/tr pairs (x1; y1) an (x2; y2) K((x1; y1); (x2; y2)) Intuition: K((x1; y1); (x2; y2)) is a masur of th similarity (x1; y1) twn (x2; y2) an ormally:

More information

Abstract Interpretation: concrete and abstract semantics

Abstract Interpretation: concrete and abstract semantics Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion

More information

VLSI Testing Assignment 2

VLSI Testing Assignment 2 1. 5-vlu D-clculus trut tbl or t XOR unction: XOR 0 1 X D ~D 0 0 1 X D ~D 1 1 0 X ~D D X X X X X X D D ~D X 0 1 ~D ~D D X 1 0 Tbl 1: 5-vlu D-clculus Trut Tbl or t XOR Function Sinc 2-input XOR t wors s

More information

cycle that does not cross any edges (including its own), then it has at least

cycle that does not cross any edges (including its own), then it has at least W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th

More information

The second condition says that a node α of the tree has exactly n children if the arity of its label is n.

The second condition says that a node α of the tree has exactly n children if the arity of its label is n. CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is

More information

PROBLEM SET Problem 1.

PROBLEM SET Problem 1. PROLEM SET 1 PROFESSOR PETER JOHNSTONE 1. Problm 1. 1.1. Th catgory Mat L. OK, I m not amiliar with th trminology o partially orr sts, so lt s go ovr that irst. Dinition 1.1. partial orr is a binary rlation

More information

dy 1. If fx ( ) is continuous at x = 3, then 13. If y x ) for x 0, then f (g(x)) = g (f (x)) when x = a. ½ b. ½ c. 1 b. 4x a. 3 b. 3 c.

dy 1. If fx ( ) is continuous at x = 3, then 13. If y x ) for x 0, then f (g(x)) = g (f (x)) when x = a. ½ b. ½ c. 1 b. 4x a. 3 b. 3 c. AP CALCULUS BC SUMMER ASSIGNMENT DO NOT SHOW YOUR WORK ON THIS! Complt ts problms during t last two wks of August. SHOW ALL WORK. Know ow to do ALL of ts problms, so do tm wll. Itms markd wit a * dnot

More information

Physics 43 HW #9 Chapter 40 Key

Physics 43 HW #9 Chapter 40 Key Pysics 43 HW #9 Captr 4 Ky Captr 4 1 Aftr many ours of dilignt rsarc, you obtain t following data on t potolctric ffct for a crtain matrial: Wavlngt of Ligt (nm) Stopping Potntial (V) 36 3 4 14 31 a) Plot

More information

ENGR 7181 LECTURE NOTES WEEK 3 Dr. Amir G. Aghdam Concordia University

ENGR 7181 LECTURE NOTES WEEK 3 Dr. Amir G. Aghdam Concordia University ENGR 78 LECTURE NOTES WEEK Dr. ir G. ga Concoria Univrity DT Equivalnt Tranfr Function for SSO Syt - So far w av tui DT quivalnt tat pac ol uing tp-invariant tranforation. n t ca of SSO yt on can u t following

More information

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA NE APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA Mirca I CÎRNU Ph Dp o Mathmatics III Faculty o Applid Scincs Univrsity Polithnica o Bucharst Cirnumirca @yahoocom Abstract In a rcnt papr [] 5 th indinit intgrals

More information

Analysis of Algorithms - Elementary graphs algorithms -

Analysis of Algorithms - Elementary graphs algorithms - Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsarch Cntr) anras.rmahl@mh.s Autumn 004 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring

More information

2. Finite Impulse Response Filters (FIR)

2. Finite Impulse Response Filters (FIR) .. Mthos for FIR filtrs implmntation. Finit Impuls Rspons Filtrs (FIR. Th winow mtho.. Frquncy charactristic uniform sampling. 3. Maximum rror minimizing. 4. Last-squars rror minimizing.. Mthos for FIR

More information

Addition of angular momentum

Addition of angular momentum Addition of angular momntum April, 07 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat

More information

Rikkert Frederix. Figure 2: As in fig. 1, for the transverse momentum of the 1 st jet.

Rikkert Frederix. Figure 2: As in fig. 1, for the transverse momentum of the 1 st jet. Z+jts Exclusiv jt multiplicity an arst an 3r arst jt pt spctra Uncrtainty ban contains rn. & fac. scal, PDF & mrging scal pnnc Ratr goo agrmnt btwn ata an tory Figur 1: Exclusiv jt multiplicity. Data from

More information

SPH4U Electric Charges and Electric Fields Mr. LoRusso

SPH4U Electric Charges and Electric Fields Mr. LoRusso SPH4U lctric Chargs an lctric Fils Mr. LoRusso lctricity is th flow of lctric charg. Th Grks first obsrv lctrical forcs whn arly scintists rubb ambr with fur. Th notic thy coul attract small bits of straw

More information

Analysis of Algorithms - Elementary graphs algorithms -

Analysis of Algorithms - Elementary graphs algorithms - Analysis of Algorithms - Elmntary graphs algorithms - Anras Ermahl MRTC (Mälaralns Ral-Tim Rsach Cntr) anras.rmahl@mh.s Autumn 00 Graphs Graphs ar important mathmatical ntitis in computr scinc an nginring

More information

3) Use the average steady-state equation to determine the dose. Note that only 100 mg tablets of aminophylline are available here.

3) Use the average steady-state equation to determine the dose. Note that only 100 mg tablets of aminophylline are available here. PHA 5127 Dsigning A Dosing Rgimn Answrs provi by Jry Stark Mr. JM is to b start on aminophyllin or th tratmnt o asthma. H is a non-smokr an wighs 60 kg. Dsign an oral osing rgimn or this patint such that

More information

Y 0. Standing Wave Interference between the incident & reflected waves Standing wave. A string with one end fixed on a wall

Y 0. Standing Wave Interference between the incident & reflected waves Standing wave. A string with one end fixed on a wall Staning Wav Intrfrnc btwn th incint & rflct wavs Staning wav A string with on n fix on a wall Incint: y, t) Y cos( t ) 1( Y 1 ( ) Y (St th incint wav s phas to b, i.., Y + ral & positiv.) Rflct: y, t)

More information

Pipe flow friction, small vs. big pipes

Pipe flow friction, small vs. big pipes Friction actor (t/0 t o pip) Friction small vs larg pips J. Chaurtt May 016 It is an intrsting act that riction is highr in small pips than largr pips or th sam vlocity o low and th sam lngth. Friction

More information

Chapter Taylor Theorem Revisited

Chapter Taylor Theorem Revisited Captr 0.07 Taylor Torm Rvisitd Atr radig tis captr, you sould b abl to. udrstad t basics o Taylor s torm,. writ trascdtal ad trigoomtric uctios as Taylor s polyomial,. us Taylor s torm to id t valus o

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!

More information

Edge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work?

Edge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work? E-Trir D Flip-Flop Funamntal-Mo Squntial Ciruits PR A How o lip-lops work? How to analys aviour o lip-lops? R How to sin unamntal-mo iruits? Funamntal mo rstrition - only on input an an at a tim; iruit

More information

SOURCES OF ERROR AND LIMITS OF APPLYING THE ENERGETIC-BASED-REGULARIZATION METHOD

SOURCES OF ERROR AND LIMITS OF APPLYING THE ENERGETIC-BASED-REGULARIZATION METHOD Sourcs o rror an limit o applying t nrgtic-bas rgularization mto X ntrnational Conrnc on Computational Plasticity. Funamntals an Applications COMPLAS X. Oñat, D.R.J. Own, D. Pric an M. Ciumnti s SOURCS

More information

The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function

The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function A gnraliation of th frquncy rsons function Th convolution sum scrition of an LTI iscrt-tim systm with an imuls rsons h[n] is givn by h y [ n] [ ] x[ n ] Taing th -transforms of both sis w gt n n h n n

More information

A RELATIVISTIC LAGRANGIAN FOR MULTIPLE CHARGED POINT-MASSES

A RELATIVISTIC LAGRANGIAN FOR MULTIPLE CHARGED POINT-MASSES A RELATIVISTIC LAGRANGIAN FOR MULTIPLE CHARGED POINT-MASSES ADRIAAN DANIËL FOKKER (1887-197) A translation of: Ein invariantr Variationssatz für i Bwgung mhrrr lctrischr Massntilshn Z. Phys. 58, 386-393

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013 18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:

More information

Trigonometric functions

Trigonometric functions Robrto s Nots on Diffrntial Calculus Captr 5: Drivativs of transcndntal functions Sction 5 Drivativs of Trigonomtric functions Wat you nd to know alrady: Basic trigonomtric limits, t dfinition of drivativ,

More information

Addition of angular momentum

Addition of angular momentum Addition of angular momntum April, 0 Oftn w nd to combin diffrnt sourcs of angular momntum to charactriz th total angular momntum of a systm, or to divid th total angular momntum into parts to valuat th

More information

The Matrix Exponential

The Matrix Exponential Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!

More information

Additional Math (4047) Paper 2 (100 marks) y x. 2 d. d d

Additional Math (4047) Paper 2 (100 marks) y x. 2 d. d d Aitional Math (07) Prpar b Mr Ang, Nov 07 Fin th valu of th constant k for which is a solution of th quation k. [7] Givn that, Givn that k, Thrfor, k Topic : Papr (00 marks) Tim : hours 0 mins Nam : Aitional

More information

Atomic Physics. Final Mon. May 12, 12:25-2:25, Ingraham B10 Get prepared for the Final!

Atomic Physics. Final Mon. May 12, 12:25-2:25, Ingraham B10 Get prepared for the Final! # SCORES 50 40 30 0 10 MTE 3 Rsults P08 Exam 3 0 30 40 50 60 70 80 90 100 SCORE Avrag 79.75/100 std 1.30/100 A 19.9% AB 0.8% B 6.3% BC 17.4% C 13.1% D.1% F 0.4% Final Mon. Ma 1, 1:5-:5, Ingraam B10 Gt

More information

Derangements and Applications

Derangements and Applications 2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir

More information

University of Washington Department of Chemistry Chemistry 453 Winter Quarter 2014 Lecture 20: Transition State Theory. ERD: 25.14

University of Washington Department of Chemistry Chemistry 453 Winter Quarter 2014 Lecture 20: Transition State Theory. ERD: 25.14 Univrsity of Wasinton Dpartmnt of Cmistry Cmistry 453 Wintr Quartr 04 Lctur 0: Transition Stat Tory. ERD: 5.4. Transition Stat Tory Transition Stat Tory (TST) or ctivatd Complx Tory (CT) is a raction mcanism

More information

64. A Conic Section from Five Elements.

64. A Conic Section from Five Elements. . onic Sction from Fiv Elmnts. To raw a conic sction of which fiv lmnts - points an tangnts - ar known. W consir th thr cass:. Fiv points ar known.. Four points an a tangnt lin ar known.. Thr points an

More information

Section 11.6: Directional Derivatives and the Gradient Vector

Section 11.6: Directional Derivatives and the Gradient Vector Sction.6: Dirctional Drivativs and th Gradint Vctor Practic HW rom Stwart Ttbook not to hand in p. 778 # -4 p. 799 # 4-5 7 9 9 35 37 odd Th Dirctional Drivativ Rcall that a b Slop o th tangnt lin to th

More information

MAT 270 Test 3 Review (Spring 2012) Test on April 11 in PSA 21 Section 3.7 Implicit Derivative

MAT 270 Test 3 Review (Spring 2012) Test on April 11 in PSA 21 Section 3.7 Implicit Derivative MAT 7 Tst Rviw (Spring ) Tst on April in PSA Sction.7 Implicit Drivativ Rmmbr: Equation of t tangnt lin troug t point ( ab, ) aving slop m is y b m( a ). dy Find t drivativ y d. y y. y y y. y 4. y sin(

More information

OVERFLOW IN A CYLINDRICAL PIPE BEND. 1. Introduction. Fig. 1: Overflow in a cylindrical pipe bend

OVERFLOW IN A CYLINDRICAL PIPE BEND. 1. Introduction. Fig. 1: Overflow in a cylindrical pipe bend circular cannl, ovrflow, brink pt, pip bn Dtlf AIGNER; Carstn CHERUBIM Institut of Hyraulic Enginring an Appli Hyromcanics, Drsn Univrsity of Tcnology OVERFLOW IN A CYLINDRICAL PIPE BEND T ovrflow of watr

More information

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0 unction Spacs Prrquisit: Sction 4.7, Coordinatization n this sction, w apply th tchniqus of Chaptr 4 to vctor spacs whos lmnts ar functions. Th vctor spacs P n and P ar familiar xampls of such spacs. Othr

More information

Quasi-Classical States of the Simple Harmonic Oscillator

Quasi-Classical States of the Simple Harmonic Oscillator Quasi-Classical Stats of th Simpl Harmonic Oscillator (Draft Vrsion) Introduction: Why Look for Eignstats of th Annihilation Oprator? Excpt for th ground stat, th corrspondnc btwn th quantum nrgy ignstats

More information

is an appropriate single phase forced convection heat transfer coefficient (e.g. Weisman), and h

is an appropriate single phase forced convection heat transfer coefficient (e.g. Weisman), and h For t BWR oprating paramtrs givn blow, comput and plot: a) T clad surfac tmpratur assuming t Jns-Lotts Corrlation b) T clad surfac tmpratur assuming t Tom Corrlation c) T clad surfac tmpratur assuming

More information

Multiple Short Term Infusion Homework # 5 PHA 5127

Multiple Short Term Infusion Homework # 5 PHA 5127 Multipl Short rm Infusion Homwork # 5 PHA 527 A rug is aministr as a short trm infusion. h avrag pharmacokintic paramtrs for this rug ar: k 0.40 hr - V 28 L his rug follows a on-compartmnt boy mol. A 300

More information

Problem Set 6 Solutions

Problem Set 6 Solutions 6.04/18.06J Mathmatics for Computr Scinc March 15, 005 Srini Dvadas and Eric Lhman Problm St 6 Solutions Du: Monday, March 8 at 9 PM in Room 3-044 Problm 1. Sammy th Shark is a financial srvic providr

More information

Linear Non-Gaussian Structural Equation Models

Linear Non-Gaussian Structural Equation Models IMPS 8, Durham, NH Linar Non-Gaussian Structural Equation Modls Shohi Shimizu, Patrik Hoyr and Aapo Hyvarinn Osaka Univrsity, Japan Univrsity of Hlsinki, Finland Abstract Linar Structural Equation Modling

More information

CPS 616 W2017 MIDTERM SOLUTIONS 1

CPS 616 W2017 MIDTERM SOLUTIONS 1 CPS 616 W2017 MIDTERM SOLUTIONS 1 PART 1 20 MARKS - MULTIPLE CHOICE Instructions Plas ntr your answrs on t bubbl st wit your nam unlss you ar writin tis xam at t Tst Cntr, in wic cas you sould just circl

More information

A NEW SIGNATURE PROTOCOL BASED ON RSA AND ELGAMAL SCHEME

A NEW SIGNATURE PROTOCOL BASED ON RSA AND ELGAMAL SCHEME A NEW SIGNATURE PROTOCOL BASED ON RSA AND ELGAMAL SCHEME ABSTRACT J Ettanfoui and O Kadir Laboratory of Matmatics, Cryptograpy and Mcanics, Fstm, Univrsity Hassan II of Casablanca, Morocco In tis papr,

More information

Schematic of a mixed flow reactor (both advection and dispersion must be accounted for)

Schematic of a mixed flow reactor (both advection and dispersion must be accounted for) Cas stuy 6.1, R: Chapra an Canal, p. 769. Th quation scribin th concntration o any tracr in an lonat ractor is known as th avction-isprsion quation an may b writtn as: Schmatic o a mi low ractor (both

More information

Carriers Concentration in Semiconductors - VI. Prof.P. Ravindran, Department of Physics, Central University of Tamil Nadu, India

Carriers Concentration in Semiconductors - VI. Prof.P. Ravindran, Department of Physics, Central University of Tamil Nadu, India Carrirs Conntration in Smionutors - VI 1 Prof.P. Ravinran, Dpartmnt of Pysis, Cntral Univrsity of Tamil au, Inia ttp://folk.uio.no/ravi/smi01 P.Ravinran, PHY0 Smionutor Pysis, 17 January 014 : Carrirs

More information

G. Gambosi (*), J. Ne~etgil (**), M. Talamo (*)

G. Gambosi (*), J. Ne~etgil (**), M. Talamo (*) EFFICIENT REPRESENTATION OF TAXONOMIES G. Gamosi (*), J. N~tgil (**), M. Talamo (*) (*) Istituto i Analisi i Sistmi Inormatica l C.N.R.~ Vial Manzoni 30, 00185, Roma,Italy (**) Charls Univrsity Malostransk~

More information

a g f 8 e 11 Also: Minimum degree, maximum degree, vertex of degree d 1 adjacent to vertex of degree d 2,...

a g f 8 e 11 Also: Minimum degree, maximum degree, vertex of degree d 1 adjacent to vertex of degree d 2,... Warmup: Lt b 2 c 3 d 1 12 6 4 5 10 9 7 a 8 11 (i) Vriy tat G is connctd by ivin an xampl o a walk rom vrtx a to ac o t vrtics b. (ii) Wat is t sortst pat rom a to c? to? (iii) Wat is t lonst pat rom a

More information

Higher order derivatives

Higher order derivatives Robrto s Nots on Diffrntial Calculus Chaptr 4: Basic diffrntiation ruls Sction 7 Highr ordr drivativs What you nd to know alrady: Basic diffrntiation ruls. What you can larn hr: How to rpat th procss of

More information

EECE 301 Signals & Systems Prof. Mark Fowler

EECE 301 Signals & Systems Prof. Mark Fowler EECE 301 Signals & Systms Prof. Mark Fowlr ot St #21 D-T Signals: Rlation btwn DFT, DTFT, & CTFT 1/16 W can us th DFT to implmnt numrical FT procssing This nabls us to numrically analyz a signal to find

More information

First derivative analysis

First derivative analysis Robrto s Nots on Dirntial Calculus Chaptr 8: Graphical analysis Sction First drivativ analysis What you nd to know alrady: How to us drivativs to idntiy th critical valus o a unction and its trm points

More information

Dual Nature of Matter and Radiation

Dual Nature of Matter and Radiation Higr Ordr Tinking Skill Qustions Dual Natur of Mattr and Radiation 1. Two bas on of rd ligt and otr of blu ligt of t sa intnsity ar incidnt on a tallic surfac to it otolctrons wic on of t two bas its lctrons

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 401 Digital Signal Procssing Prof. Mark Fowlr Dtails of th ot St #19 Rading Assignmnt: Sct. 7.1.2, 7.1.3, & 7.2 of Proakis & Manolakis Dfinition of th So Givn signal data points x[n] for n = 0,, -1

More information

a 1and x is any real number.

a 1and x is any real number. Calcls Nots Eponnts an Logarithms Eponntial Fnction: Has th form y a, whr a 0, a an is any ral nmbr. Graph y, Graph y ln y y Th Natral Bas (Elr s nmbr): An irrational nmbr, symboliz by th lttr, appars

More information

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero. SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain

More information

Searching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.

Searching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list. 3 3 4 8 6 3 3 4 8 6 3 3 4 8 6 () (d) 3 Sarching Linkd Lists Sarching Linkd Lists Sarching Linkd Lists ssum th list is sortd, but is stord in a linkd list. an w us binary sarch? omparisons? Work? What if

More information

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely . DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,

More information

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula 7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting

More information

Thomas Whitham Sixth Form

Thomas Whitham Sixth Form Thomas Whitham Sith Form Pur Mathmatics Cor rvision gui Pag Algbra Moulus functions graphs, quations an inqualitis Graph of f () Draw f () an rflct an part of th curv blow th ais in th ais. f () f () f

More information

On the irreducibility of some polynomials in two variables

On the irreducibility of some polynomials in two variables ACTA ARITHMETICA LXXXII.3 (1997) On th irrducibility of som polynomials in two variabls by B. Brindza and Á. Pintér (Dbrcn) To th mmory of Paul Erdős Lt f(x) and g(y ) b polynomials with intgral cofficints

More information

Hardy-Littlewood Conjecture and Exceptional real Zero. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R.

Hardy-Littlewood Conjecture and Exceptional real Zero. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R. Hardy-Littlwood Conjctur and Excptional ral Zro JinHua Fi ChangLing Company of Elctronic Tchnology Baoji Shannxi P.R.China E-mail: fijinhuayoujian@msn.com Abstract. In this papr, w assum that Hardy-Littlwood

More information

AP Calculus BC AP Exam Problems Chapters 1 3

AP Calculus BC AP Exam Problems Chapters 1 3 AP Eam Problms Captrs Prcalculus Rviw. If f is a continuous function dfind for all ral numbrs and if t maimum valu of f() is 5 and t minimum valu of f() is 7, tn wic of t following must b tru? I. T maimum

More information

Mathematics 1110H Calculus I: Limits, derivatives, and Integrals Trent University, Summer 2018 Solutions to the Actual Final Examination

Mathematics 1110H Calculus I: Limits, derivatives, and Integrals Trent University, Summer 2018 Solutions to the Actual Final Examination Mathmatics H Calculus I: Limits, rivativs, an Intgrals Trnt Univrsity, Summr 8 Solutions to th Actual Final Eamination Tim-spac: 9:-: in FPHL 7. Brought to you by Stfan B lan k. Instructions: Do parts

More information

Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.

Section 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation. MAT 444 H Barclo Spring 004 Homwork 6 Solutions Sction 6 Lt H b a subgroup of a group G Thn H oprats on G by lft multiplication Dscrib th orbits for this opration Th orbits of G ar th right costs of H

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 401 Digital Signal Procssing Prof. Mark Fowlr ot St #18 Introduction to DFT (via th DTFT) Rading Assignmnt: Sct. 7.1 of Proakis & Manolakis 1/24 Discrt Fourir Transform (DFT) W v sn that th DTFT is

More information

perm4 A cnt 0 for for if A i 1 A i cnt cnt 1 cnt i j. j k. k l. i k. j l. i l

perm4 A cnt 0 for for if A i 1 A i cnt cnt 1 cnt i j. j k. k l. i k. j l. i l h 4D, 4th Rank, Antisytric nsor and th 4D Equivalnt to th Cross Product or Mor Fun with nsors!!! Richard R Shiffan Digital Graphics Assoc 8 Dunkirk Av LA, Ca 95 rrs@isidu his docunt dscribs th four dinsional

More information

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018 Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs

More information

Construction of asymmetric orthogonal arrays of strength three via a replacement method

Construction of asymmetric orthogonal arrays of strength three via a replacement method isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy

More information

CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming

CPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of

More information

(Upside-Down o Direct Rotation) β - Numbers

(Upside-Down o Direct Rotation) β - Numbers Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg

More information

Revisiting Wiener s Attack New Weak Keys in RSA

Revisiting Wiener s Attack New Weak Keys in RSA Rvisiting Winr s Attack w Wak Kys in RSA Subhamoy Maitra an Santanu Sarkar Inian Statistical Institut, 0 B T Roa, Kolkata 700 08, Inia {subho, santanu r}@isicalacin Abstract In this papr w rvisit Winr

More information

Homework #3. 1 x. dx. It therefore follows that a sum of the

Homework #3. 1 x. dx. It therefore follows that a sum of the Danil Cannon CS 62 / Luan March 5, 2009 Homwork # 1. Th natural logarithm is dfind by ln n = n 1 dx. It thrfor follows that a sum of th 1 x sam addnd ovr th sam intrval should b both asymptotically uppr-

More information

Limiting value of higher Mahler measure

Limiting value of higher Mahler measure Limiting valu of highr Mahlr masur Arunabha Biswas a, Chris Monico a, a Dpartmnt of Mathmatics & Statistics, Txas Tch Univrsity, Lubbock, TX 7949, USA Abstract W considr th k-highr Mahlr masur m k P )

More information

MCE503: Modeling and Simulation of Mechatronic Systems Discussion on Bond Graph Sign Conventions for Electrical Systems

MCE503: Modeling and Simulation of Mechatronic Systems Discussion on Bond Graph Sign Conventions for Electrical Systems MCE503: Modling and Simulation o Mchatronic Systms Discussion on Bond Graph Sign Convntions or Elctrical Systms Hanz ichtr, PhD Clvland Stat Univrsity, Dpt o Mchanical Enginring 1 Basic Assumption In a

More information

Hydrogen Atom and One Electron Ions

Hydrogen Atom and One Electron Ions Hydrogn Atom and On Elctron Ions Th Schrödingr quation for this two-body problm starts out th sam as th gnral two-body Schrödingr quation. First w sparat out th motion of th cntr of mass. Th intrnal potntial

More information

Full Waveform Inversion Using an Energy-Based Objective Function with Efficient Calculation of the Gradient

Full Waveform Inversion Using an Energy-Based Objective Function with Efficient Calculation of the Gradient Full Wavform Invrsion Using an Enrgy-Basd Objctiv Function with Efficint Calculation of th Gradint Itm yp Confrnc Papr Authors Choi, Yun Sok; Alkhalifah, ariq Ali Citation Choi Y, Alkhalifah (217) Full

More information

Exam 1. It is important that you clearly show your work and mark the final answer clearly, closed book, closed notes, no calculator.

Exam 1. It is important that you clearly show your work and mark the final answer clearly, closed book, closed notes, no calculator. Exam N a m : _ S O L U T I O N P U I D : I n s t r u c t i o n s : It is important that you clarly show your work and mark th final answr clarly, closd book, closd nots, no calculator. T i m : h o u r

More information

Thomas Whitham Sixth Form

Thomas Whitham Sixth Form Thomas Whitham Sith Form Pur Mathmatics Unit C Algbra Trigonomtr Gomtr Calculus Vctor gomtr Pag Algbra Molus functions graphs, quations an inqualitis Graph of f () Draw f () an rflct an part of th curv

More information

A. Limits and Horizontal Asymptotes ( ) f x f x. f x. x "±# ( ).

A. Limits and Horizontal Asymptotes ( ) f x f x. f x. x ±# ( ). A. Limits and Horizontal Asymptots What you ar finding: You can b askd to find lim x "a H.A.) problm is asking you find lim x "# and lim x "$#. or lim x "±#. Typically, a horizontal asymptot algbraically,

More information

Basic Polyhedral theory

Basic Polyhedral theory Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist

More information

Basic Logic Review. Rules. Lecture Roadmap Combinational Logic. Textbook References. Basic Logic Gates (2-input versions)

Basic Logic Review. Rules. Lecture Roadmap Combinational Logic. Textbook References. Basic Logic Gates (2-input versions) Lctur Roadmap ombinational Logic EE 55 Digital Systm Dsign with VHDL Lctur Digital Logic Rrshr Part ombinational Logic Building Blocks Basic Logic Rviw Basic Gats D Morgan s Law ombinational Logic Building

More information

Discrete-Time Output Regulation on Sample-Data Systems

Discrete-Time Output Regulation on Sample-Data Systems ntrnational Journal of Computr Thory an Enginring Vol. 4 No. 5 Octobr Discrt-Tim Output Rgulation on Sampl-Data Systms Muwahia Liaquat an Mohamma ilal Malik bstract n this papr output rgulation problm

More information

Week 3: Connected Subgraphs

Week 3: Connected Subgraphs Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y

More information

Outlines: Graphs Part-4. Applications of Depth-First Search. Directed Acyclic Graph (DAG) Generic scheduling problem.

Outlines: Graphs Part-4. Applications of Depth-First Search. Directed Acyclic Graph (DAG) Generic scheduling problem. Outlins: Graps Part-4 Applications o DFS Elmntary Grap Aloritms Topoloical Sort o Dirctd Acyclic Grap Stronly Connctd Componnts PART-4 1 2 Applications o Dpt-First Sarc Topoloical Sort: Usin dpt-irst sarc

More information

PHYS ,Fall 05, Term Exam #1, Oct., 12, 2005

PHYS ,Fall 05, Term Exam #1, Oct., 12, 2005 PHYS1444-,Fall 5, Trm Exam #1, Oct., 1, 5 Nam: Kys 1. circular ring of charg of raius an a total charg Q lis in th x-y plan with its cntr at th origin. small positiv tst charg q is plac at th origin. What

More information

Notes on Differential Geometry

Notes on Differential Geometry Nots from phz 6607, Spcial an Gnral Rlativity Univrsity of Floria, Fall 2004, Dtwilr Nots on Diffrntial Gomtry Ths nots ar not a substitut in any mannr for class lcturs. Plas lt m know if you fin rrors.

More information

Sundials and Linear Algebra

Sundials and Linear Algebra Sundials and Linar Algbra M. Scot Swan July 2, 25 Most txts on crating sundials ar dirctd towards thos who ar solly intrstd in making and using sundials and usually assums minimal mathmatical background.

More information

CS 491 G Combinatorial Optimization

CS 491 G Combinatorial Optimization CS 49 G Cobinatorial Optiization Lctur Nots Junhui Jia. Maiu Flow Probls Now lt us iscuss or tails on aiu low probls. Thor. A asibl low is aiu i an only i thr is no -augnting path. Proo: Lt P = A asibl

More information

6. Negative Feedback in Single- Transistor Circuits

6. Negative Feedback in Single- Transistor Circuits Lctur 8: Intrductin t lctrnic analg circuit 36--366 6. Ngativ Fdback in Singl- Tranitr ircuit ugn Paprn, 2008 Our aim i t tudy t ffct f ngativ fdback n t mall-ignal gain and t mall-ignal input and utput

More information

2.3 Matrix Formulation

2.3 Matrix Formulation 23 Matrix Formulation 43 A mor complicatd xampl ariss for a nonlinar systm of diffrntial quations Considr th following xampl Exampl 23 x y + x( x 2 y 2 y x + y( x 2 y 2 (233 Transforming to polar coordinats,

More information

ON THE NUMBER OF RATIONAL POINTS ON CURVES OVER FINITE FIELDS WITH MANY AUTOMORPHISMS

ON THE NUMBER OF RATIONAL POINTS ON CURVES OVER FINITE FIELDS WITH MANY AUTOMORPHISMS ON THE NUMBER OF RATIONAL POINTS ON CURVES OVER FINITE FIELDS WITH MANY AUTOMORPHISMS ANTONIO ROJAS-LEÓN Abstract. Using Wil scnt, w giv bouns for th numbr of rational points on two familis of curvs ovr

More information