Save this PDF as:

Size: px
Start display at page:

Transcription

1 Computer Science and Engineering, UCSD October 7, 1999 Goldreic-Levin Teorem Autor: Bellare Te Goldreic-Levin Teorem 1 Te problem We æx a an integer n for te lengt of te strings involved. If a is an n-bit string and 1 i n ten a èiè denotes te i-t bit of a. If a; b are n-bit strings ten a; bi = a è1è b è1è + a èè b èè + æææa ènè b ènè denotes te inner product of a and b. Te operations ere are modulo two, meaning we work over te ænite æeld of two elements, so te value above is a bit. We are given an oracle B x : f0; 1g n!f0;1gand a real number æé0 suc tat Pr B x èrè =x; ri : r R èf0;1g ni = 1 +æ : We call æ te advantage of B x. We are not directly given x. We are also given anoter oracle EQ x : f0; 1g n! f0; 1g wic given any y f0; 1g n returns 1 if y = x and 0 oterwise. In oter words, we can test weter or not a given string equals x. Te problem is, given tese two oracles, to ænd x. We want to ægure out ow to do it and also wat is te complexity. More precisely, we wis to design an algoritm A tat given te above two oracles returns a string x 0. Te success probability of A is te probability tat x = x 0, taken over te coin tosses of A. We seek A aving success probability atleast 1=. We let q B denote te number of calls made by A to B x and q E te number of calls to EQ x. We let t be te running time plus te size of te code of A in some æxed RAM model of computation. èalternatively, A is a circuit and t is te size of te circuit.è We want to ægure out q B ;q E ;t as functions of n; æ. Certainly we want tem all to be polyèn; 1=æè, but we want to know exactly wat is te polynomial ere. Te algoritm sould work for any x f0;1g n. Wewould like actually someting sligtly more general. We would like toview q B ;q E ;t as given, and lower bound te success probability ofaas a function of n; æ; q B ;q E ;t. But tis problem does not appear to ave been studied. è1è Background Te context of Goldreic and Levin ë5ë is to ænd a ard-core predicate for any one-way function. Given a lengt-preserving one-way function f: f0; 1g æ!f0;1g æ,deæne F èx; rè =èfèxè;rè were jxj = jrj. Tis is also a one-way function. Now te claim is tat x; ri is a ard-core predicate for 1

2 Bellare tis function. Tis means tat if tere was an eæcient algoritm to predict x; ri given fèxè;r, tere is also an eæcient algoritm to compute a pre-image of f èxè given f èxè. Probabilities ere are taken over te random coice of x and r. Te tecnical part of te reduction amounts to te above problem. Te given algoritm for predicting x; ri is B x, and te oracle tat can verify a coice of x is implicit because we avefèxè and can compute f. Te proof in Section 4 is due to Rackoæ, using ideas of ë1ë. It is a simpliæcation of te original proof of ë5ë. It is along te same lines as te proof in ë7ë. Two oter excellent sources are Goldreic's survey ë3ë and book ë4ë, wic present a proof using te same ideas and also present security improvements. A recent paper of Levin ë6ë migt ave furter security improvements. It would be nice to read ë3, 4, 6ë and ægure out te improvements. 3 Te ig advantage case Te oracle B x partitions te set of n-bit strings into two parts. Te ëgood" strings are tose inputs on wic te oracle is correct and te bad strings are tose inputs on wic te oracle is wrong. It useful to name tese sets: Gd = f s f0;1g n : B x èsè=x; sig Bd = f s f0;1g n : B x èsè6=x; sig: Our assumption can ten equivalently be stated as jgdj = 1+æ æ n and jbdj = 1, æ æ n : Tis will elp us tink about te problem. Recall our problem is to ænd x given oracle access to B x and EQ x. To get some intuition, ærst assume tat B x is always correct, meaning as advantage æ = 1. In oter words Gd = f0; 1g n, meaning we simply ave an oracle wic given any n-bit string r returns x; ri. How can we ænd x? For i = 1;:::;n let e i denote te string aving a one in position i and zeros elsewere. Observe tat x èiè = x; e i i. So it suæces to make te queries e1;:::;e n to B x to compute x. We did not even need te EQ x oracle. Now suppose te advantage of B x is less tan 1, but still very close to 1. Let æ =1,æ. Tis by assumption is small, close to 0. A ærst tougt is to proceed as above; we make queries e1;:::;e n to B x. But te probability of success ere could be zero. Even toug B x is correct on most inputs, tese particular inputs may not be among tem. Meaning, even toug Gd occupies a 1,æ fraction of f0; 1g n, it could still be true tat some or all of te points e1;:::;e n are in Bd. If we want any cance of success, we must only invoke B x on random points, so tat we ave a cance of falling in Gd. Tis leads to te idea of using self-correction ècf. ëëè. Te algoritm of Figure 1 takes as input any n-bit string z and attempts to compute x; zi by invoking B x only on random points, eac individually unrelated to z. Remember tat aritmetic operations are modulo two. To analyze te algoritm, observe tat te linearity of te inner product function tells us tat x; zi = x; z + ri,x; ri for any n-bit string r. If r is random, so is z + r. Te two are not

3 Goldreic-Levin Teorem 3 Algoritm SC Bx èzè r R èf0;1g n b1èb x èz+rè; bèb x èrè Return b1, b Figure 1: Te SC algoritm tat attempts to compute x; zi given z. independent, but it is still true tat bot, individually, are uniformly distributed, and tat's wat we will use. Te probability below is over te random coice of r made by te algoritm of Figure 1. Pr ë b1, b 6= x; zi ë Pr ë B x èz + rè 6= x; z + ri or B x èrè 6= x; ri ë = Pr ë z + r Bd or r Bd ë Pr ë z + r Bd ë + Pr ë r Bd ë 1 = æ, æ = 1, æ = æ: In oter words, our algoritm is correct except wit probability æ. Tis is quite nice since its input z is not necessarily random. In particular z migt be in Bd. To ænd x we use te same observation as above, namely tat it suæces to ænd te n bits x; e i i for i =1;:::;n. Do tis by calling SC Bx èe i è for i =1;:::;n. ènote tat eac call results in a new random coice of r.è Te probability tat all tese n calls return te rigt answer is at least 1,næ. So as long as æ 1=ènè, te success probability of our procedure is at least 1=. Te requirement æ 1=ènè translates to æ 1, 1=ènè, meaning æ is tending to 1asntends to inænity. We would like to do better and ænd x even wen æ is not only a constant, but peraps even an inverse polynomial in n. Here's a tougt. Above, we were sloppy in upper bounding te failure probability of te algoritm SC Bx èzè. Te way we did it is to say tat we wanted bot b1 and b to be correct; all oter cases we took to be failure. But actually, te output of te algoritm is also correct wen bot b1 and b are wrong, because we are working mod two. In oter words, te bad case is not tat at least one of te two is wrong, but exactly one of te two is wrong, and tis migt ave a smaller probability of appening. Tus Pr ë b1, b 6= x; zi ë = Pr ë z + r Bd and r Gd ë+prëz+rgd and r Bd ë : However r and z + r are not independently distributed, so te value of te terms above is unclear. It turns out tat tere can be a value of z suc tat bot probabilities above equal è1, æè=, in wic case te sum is 1, æ = æ just as before. èyou can try to build tis example as an exerciseè. So tis idea doesn't elp after all. We need a diæerent algoritm.

4 4 Bellare Algoritm Strong-SC Bx èz; r1;:::;r m ;b1;:::;b m è sum è 0 For i =1;:::; m do bës i ë è P js i b j c i è B x èz + RëS i ëè, bës i ë sum è sum + c i End For If sum m = ten b è 1 else b è 0 Return b Figure : Te Strong-SC algoritm tat attempts to compute x; zi given a random sequence of n-bit strings R =èr 1 ;:::;rmè and auxiliary bits b 1 ;:::;bm. 4 Te general case If k is any integer we let ëkë =f1;:::;kg. We introduce a parameter m wic will eventually be set to c lgènè for some constant P c to be speciæed. If R =èr1;:::;r m è is a sequence of n-bit strings and S ëmë ten we let RëSë = js r j. Te sum ere is performed componentwise modulo two, so te result is an n-bit string. Let S1;:::;Sm be a listing of all subsets of ëmë in some canonical order. Te goal of te Strong-SC Bx algoritm of Figure is te same as tat of SC Bx, namely to compute x; zi for a given input z f0;1g n. However our new algoritm as additional inputs. It takes a sequence R =èr1;:::;r m è of n-bit strings wic will be selected at random. It also takes a sequence b1;:::;b m of bits. For te moment assume tat b j = x; r j i for j =1;:::;m. How we can ænd tese bits is a question we will address later; for now, just assume we managed to guess te ërigt" values of te m inner products x; r1i;:::;x; r m i. In te algoritm, sum is an integer counter and te ë+" in ësum + c i "isinteger addition; all oter operations are te usual mod two ones. Te idea beind te algoritm is te following. Te linearity of te inner-product function tells us tat for any i =1;:::; m weave x; z + RëS i ëi = x; zi + X js i x; r j i : If b j = x; r j i ten te rigt-and side is x; zi + P js i b j. Denoting te sum ere by bës i ëwe can solve as follows: x; zi = x; z + RëS i ëi,bës i ë: We want to use tis equation to determine x; zi. We will attempt to compute x; z + RëS i ëi by calling B x on input z + RëS i ë. We will argue tat wit ig enoug probability over te coice of te sequence R we ave x; zi = B x èz + RëS i ëè, bës i ë

5 Goldreic-Levin Teorem 5 Algoritm Recover Bx;EQ x è1 n è For j =1;:::;m do r R j èf0;1g n End For For i =1;:::; m do Let b1 :::b m be te binary representation of i, 1 For k =1;:::;n do y èkè è Strong-SC Bx èe k ; r1;:::;r m ;b1;:::;b m è End For y è y è1è :::y ènè If EQ x èyè = 1 ten x 0 è y End For Return x 0 Figure 3: Te Recover algoritm tat attempts to compute x. for a majority of te values of i ë m ë. Tus, taking a majority vote over te values of B x èz + RëS i ëè, bës i ëasi=1;:::; m will yield a bit tat wit ig probability equals x; zi. Once we ave an algoritm tat wit ig enoug probability determines x; zi for a given z, we can compute x as before. Namely we would call tis algoritm on e1;:::;e n and tus retrieve x bit by bit. Tere are several issues to be dealt wit in taking tis ig-level picture into an actual algoritm to recover x. First, we must pin down wat we mean by ëig enoug" probabilities in te above, and analyze te Strong-SC algoritm to see tat it accomplises its task wit suc probabilities. Second we ave te issue of te bits b1;:::;b m tat above we assumed magically to be te ërigt" ones. Let's deal wit te second issue ærst. It is in solving tis tat we make use of te second oracle EQ x wic, recall, tells us weter a given input is te idden x or not. So far we ave not used tis. Te full recovery algoritm is depicted in Figure 3. We begin by picking r1;:::;r m at random. Te key point is tat m = Oèlg nè. So tere are only polynomially many vectors b1;:::;b m to consider. We simply try tem all. For eac coice of te vector b1;:::;b m we run te Strong-SC algoritm n times, on te inputs e1;:::;e n, to generate candidates for te bits of x. Eac candidate x is tested using EQ x. Some coice of b1;:::;b m is correct meaning b j = x; r j i for j =1;:::;m so in tat iteration of te loop we ænd x. Notice te crucial role of te testing oracle EQ x. Had tat not been present, we would ave m candidates for x but no way to telling wic of tese is te rigt one. Te main claim for te analysis tus reduces to a claim about te Strong-SC algoritm wen it gets te rigt coice of te auxiliary bits. In tat case we can upper bound te probability tat it fails to compute x; zi as sown in te next lemma. Note te algoritm itself is deterministic; te only random coice below isr=èr1;:::;r m è.

6 6 Bellare Lemma 1 Let M = m. Ten for any z f0;1g n weave Pr Strong-SC Bx èz; r1;:::;r m ;x; r1i;:::;x; r m iè 6= x; zi : r1;:::;r m R èf0;1g ni 1 Mæ : We will prove tis lemma later. Given tis we can easily estimate te failure probability of te Recover algoritm. Te coin tosses ere are tose of te algoritm itself. Lemma Let M = m. Ten Pr Recover Bx;EQx è1 n è 6= x i n Mæ : Proof of Lemma : Due to te loop considering all possible values of b1;:::;b m we need only consider te case were b j = x; r j i for j =1;:::;m. In tat case te Recover algoritm invokes Strong-SC a total of n times, using n diæerent values of z but always te same values of r1;:::;r m and b1;:::;b m. Te probability tat any of tese calls returns te wrong answer is at most te sum over k =1;:::;n of te probability tat tat te k-t call returns te wrong answer. But te probability of a wrong answer on any call is bounded as per Lemma 1. Evaluating te complexity of te above procedure yields te following conclusion. Teorem 3 Let m be a parameter and M = m. Ten tere is an algoritm A wic makes at most q B = nm calls to its B x oracle, at most q E = M calls to its EQ x oracle, as time-complexity èexecution time plus size of codeè at most t = OènM è and success probability at least 1, æ were æ = næ, =M. To get success probability of 1= we would set M = næ,. In tat case m = lgèmè = lgènè + logèæ,1 è+1. Te running time of A is Oèn 3 æ,4 è and q B = Oèn æ, è and q E = Oènæ, è. Wat remains is to prove Lemma 1. Tat's te bulk of te work. We will ærst sketc te main ideas. Ten we will stop and recall some probability teory, and use tat to conclude te proof. We will deæne a random variable X i for i ëmë tat takes te value 1 wen te value of B x èz + RëS i ëè, bës i ë is correct, meaning equals x; zi. èunder te assumption tat b1;:::;b m are correct.è Te random variables X1;:::;X M are not independent. However, tey satisfy a certain limited type of independence: tey are pairwise independent. Tis means tat aving te value of one of tem doesn't elp predict te value of anoter, even toug aving te value of two of tem migt elp to predict oters. Tis pairwise independent property is enoug to prove Lemma 1 using Cebysev's inequality. To do all tis we need to step back and recall some probability teory. Deænition 4 Let X1;:::;X M : S! R be real-valued functions on some sample space S. Te latter is equipped wit a probability distribution under wic X1;:::;X M are viewed as random variables. We say tat X1;:::;X M are pairwise independent if for every i; j ëmë wit i 6= j and every a; b R we ave Pr ë X i = a and X j = b ë = Pr ë X i = a ë æ Pr ë X j = b ë :

7 Goldreic-Levin Teorem 7 To bring tis into context, ere's ow we set up te random variables for te proof of Lemma 1. Let S be te set of all m-element sequences wit entries from f0; 1g n. Put a uniform distribution on S. ètat corresponds to picking r1;:::;r m at random.è Now for i =1;:::;M deæne X i : S!f0;1g as follows, on any input R =èr1;:::;r m è Sí è P 1 if Bx èz + RëS i ëè, js X i èrè= i x; r j i = x; zi 0 oterwise. Tis can be simpliæed by noting tat te equality is true exactly wen B x èz+rës i ëè = x; z+rës i ëi, wic in turn appens exactly wen z + RëS i ë falls in te good set of inputs. Tus X i èrè = è 1 if z + RëSi ë Gd 0 oterwise èè Our claim is tat te random variables X1;:::;X M are pairwise independent. Wy? If S i 6= S j ten tere is some string r k tat belongs to one but not te oter. Now given tat operations are modulo two, a sum involving r k is unpredictable from a sum not involving r k. So if we know tat z + RëS i ë is in Gd, we still do not know weter z + RëS j ë is in Gdí given z + RëS i ë, te value of z + RëS j ë is still uniformly distributed. You sould probably play around a bit to convince yourself of tis claim tat X1;:::;X M are pairwise independent, but tis is te main idea. Now let's go back to te general probability teory. Recall tat if Y is a random variable ten its variance is Var ëy ë=e æ èy,è æ =E æ Y æ, were = E ëy ë is te expectation of Y. Lemma 5 Let X1;:::;X M : S!R be pairwise independent random variables. Ten Var ëx1 + æææ+x M ë =Var ëx1ë+æææ+var ëx M ë : Proof of Lemma 5: Var ëx1 + æææ+x M ë = E Use te formula for te variance and te linearity of expectation to get èx1+æææ+x M è i,eëx1+æææ+x M ë = EëèX1 + æææ+x M èèx1 + æææ+x m èë, èe ëx1ë+æææ+eëx M ëè = E P i;j X ix j i, X i;j E ëx i ë æ E ëx j ë = X i;j = X i = X i E ëx i X j ë, X i;j E ëx i ë æ E ëx j ë E X i X X i + E ëx i X j ë, i6=j i E X i i, E ëx i ë X + èe ëx i X j ë, E ëx i ë æ E ëx j ëè i6=j E ëx i ë, X i6=j E ëx i ë æ E ëx j ë = X i Var ëx i ë+ X i6=j èeëx i X j ë,eëx i ëæeëx j ëè : Te pairwise independence means tat E ëx i X j ë=eëx i ëæeëx j ë wenever i 6= j. Tus te second sum above is zero, and we are done.

8 8 Bellare Lemma 6 Let X1;:::;X M : S!Rbe pairwise independent random variables, let X = X1 +æææ+ X M, let Aé0 be a real number, and let = E ëx1ë+æææ+eëx M ë. Ten Pr ë jx, j éaë Var ëx 1ë+æææ+Var ëx M ë A : Proof of Lemma 6: Cebysev's inequality tells us tat Now apply Lemma 5. Pr ë jx, j éaë Var ëxë A : Tat's it. Now we use Lemma 6. Recall tat in Equation èè above we deæned te random variables X1;:::;X M : S!f0;1gtat we need for te proof of Lemma 1, and said tat tey were pairwise independent. Now observe tat E ëx i ë = 1 æ Pr ë X i =1ë+0æPr ë X i =0ë = Pr ë X i =1ë = Pr ë z + RëS i ë Gd ë = 1+æ Tis is true because RëS i ë is uniformly distributed in f0; 1g n. Now Var ëx i ë = E X i i, E ëx i ë : = E ëx i ë, E ëx i ë = E ëx i ë æ è1, E ëx i ëè = 1+æ = 1,æ 4 æ 1,æ Let X = X1 + æææ+x M and = E ëxë. Linearity of expectation tells us tat = Mè1 + æè=. Ten observe tat te probability tat we want to bound in Lemma 1 is exactly Pr ë XéM=ë Pr : jx, j é Mæ Var ëx 1ë+æææ+Var ëx M ë èmæ=è = Mè1, æ è=4 M æ =4 1 Mæ as desired. Tat concludes te proof of Lemma 1.

9 Goldreic-Levin Teorem 9 Acknowledgments Tanks to Ramaratnam Venkatesan for pointers and comments. References ë1ë W. Alexi, B. Cor, O. Goldreic and C. Scnorr, ërsa and Rabin Functions: Certain Parts Are as Hard as te Wole," SIAM J. on Computing, Vol. 17, No., 1988, pp. 194í09. ëë M. Blum, M. Luby and R. Rubinfeld, ëself-testingècorrecting wit applications to numerical problems," Journal of Computer and System Sciences, Vol. 47, 1993, pp. 549í595. ë3ë O. Goldreic, ëtree XOR lemmas: An exposition," Manuscript available at ttp:èèwww. wisdom.weizmann.ac.ilèusersèodedèpapers.tml. See Capter 3. ë4ë O. Goldreic, Modern cryptograpy, probabilistic proofs and pseudorandomness, Springer, See Appendix C.. ë5ë O. Goldreic and L. Levin, ëa ard predicate for all one-way functions," Proceedings of te 1st Annual Symposium on te Teory of Computing, ACM, ë6ë L. Levin, ërandomness and non-determinism," Manuscript available at ttp:èèwww.cs.bu. eduèfacèlndèresearcèpubl.tml. ë7ë M. Luby, Pseudorandomness and cryptograpic applications, Princeton Computer Science Notes, 1996.

The EOQ Inventory Formula

Te EOQ Inventory Formula James M. Cargal Matematics Department Troy University Montgomery Campus A basic problem for businesses and manufacturers is, wen ordering supplies, to determine wat quantity of

Tangent Lines and Rates of Change

Tangent Lines and Rates of Cange 9-2-2005 Given a function y = f(x), ow do you find te slope of te tangent line to te grap at te point P(a, f(a))? (I m tinking of te tangent line as a line tat just skims

Derivatives Math 120 Calculus I D Joyce, Fall 2013

Derivatives Mat 20 Calculus I D Joyce, Fall 203 Since we ave a good understanding of its, we can develop derivatives very quickly. Recall tat we defined te derivative f x of a function f at x to be te

Verifying Numerical Convergence Rates

1 Order of accuracy Verifying Numerical Convergence Rates We consider a numerical approximation of an exact value u. Te approximation depends on a small parameter, suc as te grid size or time step, and

Can a Lump-Sum Transfer Make Everyone Enjoy the Gains. from Free Trade?

Can a Lump-Sum Transfer Make Everyone Enjoy te Gains from Free Trade? Yasukazu Icino Department of Economics, Konan University June 30, 2010 Abstract I examine lump-sum transfer rules to redistribute te

7.6 Complex Fractions

Section 7.6 Comple Fractions 695 7.6 Comple Fractions In tis section we learn ow to simplify wat are called comple fractions, an eample of wic follows. 2 + 3 Note tat bot te numerator and denominator are

ACT Math Facts & Formulas

Numbers, Sequences, Factors Integers:..., -3, -2, -1, 0, 1, 2, 3,... Rationals: fractions, tat is, anyting expressable as a ratio of integers Reals: integers plus rationals plus special numbers suc as

CHAPTER 7. Di erentiation

CHAPTER 7 Di erentiation 1. Te Derivative at a Point Definition 7.1. Let f be a function defined on a neigborood of x 0. f is di erentiable at x 0, if te following it exists: f 0 fx 0 + ) fx 0 ) x 0 )=.

Distances in random graphs with infinite mean degrees

Distances in random graps wit infinite mean degrees Henri van den Esker, Remco van der Hofstad, Gerard Hoogiemstra and Dmitri Znamenski April 26, 2005 Abstract We study random graps wit an i.i.d. degree

2 Limits and Derivatives

2 Limits and Derivatives 2.7 Tangent Lines, Velocity, and Derivatives A tangent line to a circle is a line tat intersects te circle at exactly one point. We would like to take tis idea of tangent line

SAT Subject Math Level 1 Facts & Formulas

Numbers, Sequences, Factors Integers:..., -3, -2, -1, 0, 1, 2, 3,... Reals: integers plus fractions, decimals, and irrationals ( 2, 3, π, etc.) Order Of Operations: Aritmetic Sequences: PEMDAS (Parenteses

Geometric Stratification of Accounting Data

Stratification of Accounting Data Patricia Gunning * Jane Mary Horgan ** William Yancey *** Abstract: We suggest a new procedure for defining te boundaries of te strata in igly skewed populations, usual

Lecture 11: The Goldreich-Levin Theorem

COM S 687 Introduction to Cryptography September 28, 2006 Lecture 11: The Goldreich-Levin Theorem Instructor: Rafael Pass Scribe: Krishnaprasad Vikram Hard-Core Bits Definition: A predicate b : {0, 1}

SAT Math Must-Know Facts & Formulas

SAT Mat Must-Know Facts & Formuas Numbers, Sequences, Factors Integers:..., -3, -2, -1, 0, 1, 2, 3,... Rationas: fractions, tat is, anyting expressabe as a ratio of integers Reas: integers pus rationas

Lecture 10: What is a Function, definition, piecewise defined functions, difference quotient, domain of a function

Lecture 10: Wat is a Function, definition, piecewise defined functions, difference quotient, domain of a function A function arises wen one quantity depends on anoter. Many everyday relationsips between

- 1 - Handout #22 May 23, 2012 Huffman Encoding and Data Compression. CS106B Spring 2012. Handout by Julie Zelenski with minor edits by Keith Schwarz

CS106B Spring 01 Handout # May 3, 01 Huffman Encoding and Data Compression Handout by Julie Zelenski wit minor edits by Keit Scwarz In te early 1980s, personal computers ad ard disks tat were no larger

Improved dynamic programs for some batcing problems involving te maximum lateness criterion A P M Wagelmans Econometric Institute Erasmus University Rotterdam PO Box 1738, 3000 DR Rotterdam Te Neterlands

Instantaneous Rate of Change:

Instantaneous Rate of Cange: Last section we discovered tat te average rate of cange in F(x) can also be interpreted as te slope of a scant line. Te average rate of cange involves te cange in F(x) over

1 Density functions, cummulative density functions, measures of central tendency, and measures of dispersion

Density functions, cummulative density functions, measures of central tendency, and measures of dispersion densityfunctions-intro.tex October, 9 Note tat tis section of notes is limitied to te consideration

An inquiry into the multiplier process in IS-LM model

An inquiry into te multiplier process in IS-LM model Autor: Li ziran Address: Li ziran, Room 409, Building 38#, Peing University, Beijing 00.87,PRC. Pone: (86) 00-62763074 Internet Address: jefferson@water.pu.edu.cn

Schedulability Analysis under Graph Routing in WirelessHART Networks

Scedulability Analysis under Grap Routing in WirelessHART Networks Abusayeed Saifulla, Dolvara Gunatilaka, Paras Tiwari, Mo Sa, Cenyang Lu, Bo Li Cengjie Wu, and Yixin Cen Department of Computer Science,

College Planning Using Cash Value Life Insurance

College Planning Using Cas Value Life Insurance CAUTION: Te advisor is urged to be extremely cautious of anoter college funding veicle wic provides a guaranteed return of premium immediately if funded

Optimized Data Indexing Algorithms for OLAP Systems

Database Systems Journal vol. I, no. 2/200 7 Optimized Data Indexing Algoritms for OLAP Systems Lucian BORNAZ Faculty of Cybernetics, Statistics and Economic Informatics Academy of Economic Studies, Bucarest

Breaking Generalized Diffie-Hellman Modulo a Composite is no Easier than Factoring

Breaking Generalized Diffie-Hellman Modulo a Composite is no Easier than Factoring Eli Biham Dan Boneh Omer Reingold Abstract The Diffie-Hellman key-exchange protocol may naturally be extended to k > 2

1.6. Analyse Optimum Volume and Surface Area. Maximum Volume for a Given Surface Area. Example 1. Solution

1.6 Analyse Optimum Volume and Surface Area Estimation and oter informal metods of optimizing measures suc as surface area and volume often lead to reasonable solutions suc as te design of te tent in tis

1 Derivatives of Piecewise Defined Functions

MATH 1010E University Matematics Lecture Notes (week 4) Martin Li 1 Derivatives of Piecewise Define Functions For piecewise efine functions, we often ave to be very careful in computing te erivatives.

Lecture 10. Limits (cont d) One-sided limits. (Relevant section from Stewart, Seventh Edition: Section 2.4, pp. 113.)

Lecture 10 Limits (cont d) One-sided its (Relevant section from Stewart, Sevent Edition: Section 2.4, pp. 113.) As you may recall from your earlier course in Calculus, we may define one-sided its, were

Strategic trading in a dynamic noisy market. Dimitri Vayanos

LSE Researc Online Article (refereed) Strategic trading in a dynamic noisy market Dimitri Vayanos LSE as developed LSE Researc Online so tat users may access researc output of te Scool. Copyrigt and Moral

2.1 Complexity Classes

15-859(M): Randomized Algorithms Lecturer: Shuchi Chawla Topic: Complexity classes, Identity checking Date: September 15, 2004 Scribe: Andrew Gilpin 2.1 Complexity Classes In this lecture we will look

What is Advanced Corporate Finance? What is finance? What is Corporate Finance? Deciding how to optimally manage a firm s assets and liabilities.

Wat is? Spring 2008 Note: Slides are on te web Wat is finance? Deciding ow to optimally manage a firm s assets and liabilities. Managing te costs and benefits associated wit te timing of cas in- and outflows

A system to monitor the quality of automated coding of textual answers to open questions

Researc in Official Statistics Number 2/2001 A system to monitor te quality of automated coding of textual answers to open questions Stefania Maccia * and Marcello D Orazio ** Italian National Statistical

Math 113 HW #5 Solutions

Mat 3 HW #5 Solutions. Exercise.5.6. Suppose f is continuous on [, 5] and te only solutions of te equation f(x) = 6 are x = and x =. If f() = 8, explain wy f(3) > 6. Answer: Suppose we ad tat f(3) 6. Ten

Comparison between two approaches to overload control in a Real Server: local or hybrid solutions?

Comparison between two approaces to overload control in a Real Server: local or ybrid solutions? S. Montagna and M. Pignolo Researc and Development Italtel S.p.A. Settimo Milanese, ITALY Abstract Tis wor

2.28 EDGE Program. Introduction

Introduction Te Economic Diversification and Growt Enterprises Act became effective on 1 January 1995. Te creation of tis Act was to encourage new businesses to start or expand in Newfoundland and Labrador.

M(0) = 1 M(1) = 2 M(h) = M(h 1) + M(h 2) + 1 (h > 1)

Insertion and Deletion in VL Trees Submitted in Partial Fulfillment of te Requirements for Dr. Eric Kaltofen s 66621: nalysis of lgoritms by Robert McCloskey December 14, 1984 1 ackground ccording to Knut

ON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE

ON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE Byeong U. Park 1 and Young Kyung Lee 2 Department of Statistics, Seoul National University, Seoul, Korea Tae Yoon Kim 3 and Ceolyong Park

Area of Trapezoids. Find the area of the trapezoid. 7 m. 11 m. 2 Use the Area of a Trapezoid. Find the value of b 2

Page 1 of. Area of Trapezoids Goal Find te area of trapezoids. Recall tat te parallel sides of a trapezoid are called te bases of te trapezoid, wit lengts denoted by and. base, eigt Key Words trapezoid

Chapter 7 Numerical Differentiation and Integration

45 We ave a abit in writing articles publised in scientiþc journals to make te work as Þnised as possible, to cover up all te tracks, to not worry about te blind alleys or describe ow you ad te wrong idea

Concrete Security of the Blum-Blum-Shub Pseudorandom Generator

Appears in Cryptography and Coding: 10th IMA International Conference, Lecture Notes in Computer Science 3796 (2005) 355 375. Springer-Verlag. Concrete Security of the Blum-Blum-Shub Pseudorandom Generator

The modelling of business rules for dashboard reporting using mutual information

8 t World IMACS / MODSIM Congress, Cairns, Australia 3-7 July 2009 ttp://mssanz.org.au/modsim09 Te modelling of business rules for dasboard reporting using mutual information Gregory Calbert Command, Control,

Equilibria in sequential bargaining games as solutions to systems of equations

Economics Letters 84 (2004) 407 411 www.elsevier.com/locate/econbase Equilibria in sequential bargaining games as solutions to systems of equations Tasos Kalandrakis* Department of Political Science, Yale

FINITE DIFFERENCE METHODS

FINITE DIFFERENCE METHODS LONG CHEN Te best known metods, finite difference, consists of replacing eac derivative by a difference quotient in te classic formulation. It is simple to code and economic to

New Vocabulary volume

-. Plan Objectives To find te volume of a prism To find te volume of a cylinder Examples Finding Volume of a Rectangular Prism Finding Volume of a Triangular Prism 3 Finding Volume of a Cylinder Finding

1 Formulating The Low Degree Testing Problem

6.895 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Linearity Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz In the last lecture, we proved a weak PCP Theorem,

Writing Mathematics Papers

Writing Matematics Papers Tis essay is intended to elp your senior conference paper. It is a somewat astily produced amalgam of advice I ave given to students in my PDCs (Mat 4 and Mat 9), so it s not

Pre-trial Settlement with Imperfect Private Monitoring

Pre-trial Settlement wit Imperfect Private Monitoring Mostafa Beskar University of New Hampsire Jee-Hyeong Park y Seoul National University July 2011 Incomplete, Do Not Circulate Abstract We model pretrial

Victor Shoup Avi Rubin. fshoup,rubing@bellcore.com. Abstract

Session Key Distribution Using Smart Cards Victor Shoup Avi Rubin Bellcore, 445 South St., Morristown, NJ 07960 fshoup,rubing@bellcore.com Abstract In this paper, we investigate a method by which smart

A strong credit score can help you score a lower rate on a mortgage

NET GAIN Scoring points for your financial future AS SEEN IN USA TODAY S MONEY SECTION, JULY 3, 2007 A strong credit score can elp you score a lower rate on a mortgage By Sandra Block Sales of existing

Surface Areas of Prisms and Cylinders

12.2 TEXAS ESSENTIAL KNOWLEDGE AND SKILLS G.10.B G.11.C Surface Areas of Prisms and Cylinders Essential Question How can you find te surface area of a prism or a cylinder? Recall tat te surface area of

Area-Specific Recreation Use Estimation Using the National Visitor Use Monitoring Program Data

United States Department of Agriculture Forest Service Pacific Nortwest Researc Station Researc Note PNW-RN-557 July 2007 Area-Specific Recreation Use Estimation Using te National Visitor Use Monitoring

SAMPLE DESIGN FOR THE TERRORISM RISK INSURANCE PROGRAM SURVEY

ASA Section on Survey Researc Metods SAMPLE DESIG FOR TE TERRORISM RISK ISURACE PROGRAM SURVEY G. ussain Coudry, Westat; Mats yfjäll, Statisticon; and Marianne Winglee, Westat G. ussain Coudry, Westat,

Math Test Sections. The College Board: Expanding College Opportunity

Taking te SAT I: Reasoning Test Mat Test Sections Te materials in tese files are intended for individual use by students getting ready to take an SAT Program test; permission for any oter use must be sougt

In other words the graph of the polynomial should pass through the points

Capter 3 Interpolation Interpolation is te problem of fitting a smoot curve troug a given set of points, generally as te grap of a function. It is useful at least in data analysis (interpolation is a form

To motivate the notion of a variogram for a covariance stationary process, { Ys ( ): s R}

4. Variograms Te covariogram and its normalized form, te correlogram, are by far te most intuitive metods for summarizing te structure of spatial dependencies in a covariance stationary process. However,

Section 3.3. Differentiation of Polynomials and Rational Functions. Difference Equations to Differential Equations

Difference Equations to Differential Equations Section 3.3 Differentiation of Polynomials an Rational Functions In tis section we begin te task of iscovering rules for ifferentiating various classes of

Catalogue no. 12-001-XIE. Survey Methodology. December 2004

Catalogue no. 1-001-XIE Survey Metodology December 004 How to obtain more information Specific inquiries about tis product and related statistics or services sould be directed to: Business Survey Metods

Multivariate time series analysis: Some essential notions

Capter 2 Multivariate time series analysis: Some essential notions An overview of a modeling and learning framework for multivariate time series was presented in Capter 1. In tis capter, some notions on

OPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS

OPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS ERIC T. CHUNG AND BJÖRN ENGQUIST Abstract. In tis paper, we developed and analyzed a new class of discontinuous

Research on the Anti-perspective Correction Algorithm of QR Barcode

Researc on te Anti-perspective Correction Algoritm of QR Barcode Jianua Li, Yi-Wen Wang, YiJun Wang,Yi Cen, Guoceng Wang Key Laboratory of Electronic Tin Films and Integrated Devices University of Electronic

Recall from last time: Events are recorded by local observers with synchronized clocks. Event 1 (firecracker explodes) occurs at x=x =0 and t=t =0

1/27 Day 5: Questions? Time Dilation engt Contraction PH3 Modern Pysics P11 I sometimes ask myself ow it came about tat I was te one to deelop te teory of relatiity. Te reason, I tink, is tat a normal

SYMMETRIC ENCRYPTION. Mihir Bellare UCSD 1

SYMMETRIC ENCRYPTION Mihir Bellare UCSD 1 Syntax A symmetric encryption scheme SE = (K,E,D) consists of three algorithms: K and E may be randomized, but D must be deterministic. Mihir Bellare UCSD 2 Correct

Verification of Security Protocols with Lists: from Length One to Unbounded Length

Verification of Security Protocols wit Lists: from Lengt One to Unbounded Lengt INRIA, Miriam Paiola and Bruno Blancet École Normale Supérieure, CNRS, Paris {paiola,blancet}@di.ens.fr Abstract. We present

Referendum-led Immigration Policy in the Welfare State

Referendum-led Immigration Policy in te Welfare State YUJI TAMURA Department of Economics, University of Warwick, UK First version: 12 December 2003 Updated: 16 Marc 2004 Abstract Preferences of eterogeneous

Training Robust Support Vector Regression via D. C. Program

Journal of Information & Computational Science 7: 12 (2010) 2385 2394 Available at ttp://www.joics.com Training Robust Support Vector Regression via D. C. Program Kuaini Wang, Ping Zong, Yaoong Zao College

On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Sharing Schemes Based on General Access Structure

On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Saring Scemes Based on General Access Structure (Corrected Version) Ventzislav Nikov 1, Svetla Nikova 2, Bart

Area of a Parallelogram

Area of a Parallelogram Focus on After tis lesson, you will be able to... φ develop te φ formula for te area of a parallelogram calculate te area of a parallelogram One of te sapes a marcing band can make

2.23 Gambling Rehabilitation Services. Introduction

2.23 Gambling Reabilitation Services Introduction Figure 1 Since 1995 provincial revenues from gambling activities ave increased over 56% from \$69.2 million in 1995 to \$108 million in 2004. Te majority

For Sale By Owner Program. We can help with our for sale by owner kit that includes:

Dawn Coen Broker/Owner For Sale By Owner Program If you want to sell your ome By Owner wy not:: For Sale Dawn Coen Broker/Owner YOUR NAME YOUR PHONE # Look as professional as possible Be totally prepared

An Orientation to the Public Health System for Participants and Spectators

An Orientation to te Public Healt System for Participants and Spectators Presented by TEAM ORANGE CRUSH Pallisa Curtis, Illinois Department of Public Healt Lynn Galloway, Vermillion County Healt Department

Unemployment insurance/severance payments and informality in developing countries

Unemployment insurance/severance payments and informality in developing countries David Bardey y and Fernando Jaramillo z First version: September 2011. Tis version: November 2011. Abstract We analyze

SWITCH T F T F SELECT. (b) local schedule of two branches. (a) if-then-else construct A & B MUX. one iteration cycle

768 IEEE RANSACIONS ON COMPUERS, VOL. 46, NO. 7, JULY 997 Compile-ime Sceduling of Dynamic Constructs in Dataæow Program Graps Soonoi Ha, Member, IEEE and Edward A. Lee, Fellow, IEEE Abstract Sceduling

Welfare, financial innovation and self insurance in dynamic incomplete markets models

Welfare, financial innovation and self insurance in dynamic incomplete markets models Paul Willen Department of Economics Princeton University First version: April 998 Tis version: July 999 Abstract We

TRADING AWAY WIDE BRANDS FOR CHEAP BRANDS. Swati Dhingra London School of Economics and CEP. Online Appendix

TRADING AWAY WIDE BRANDS FOR CHEAP BRANDS Swati Dingra London Scool of Economics and CEP Online Appendix APPENDIX A. THEORETICAL & EMPIRICAL RESULTS A.1. CES and Logit Preferences: Invariance of Innovation

f(a + h) f(a) f (a) = lim

Lecture 7 : Derivative AS a Function In te previous section we defined te derivative of a function f at a number a (wen te function f is defined in an open interval containing a) to be f (a) 0 f(a + )

Note nine: Linear programming CSE 101. 1 Linear constraints and objective functions. 1.1 Introductory example. Copyright c Sanjoy Dasgupta 1

Copyrigt c Sanjoy Dasgupta Figure. (a) Te feasible region for a linear program wit two variables (see tet for details). (b) Contour lines of te objective function: for different values of (profit). Te

Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

SAT Math Facts & Formulas

Numbers, Sequences, Factors SAT Mat Facts & Formuas Integers:..., -3, -2, -1, 0, 1, 2, 3,... Reas: integers pus fractions, decimas, and irrationas ( 2, 3, π, etc.) Order Of Operations: Aritmetic Sequences:

A Multigrid Tutorial part two

A Multigrid Tutorial part two William L. Briggs Department of Matematics University of Colorado at Denver Van Emden Henson Center for Applied Scientific Computing Lawrence Livermore National Laboratory

Cyber Epidemic Models with Dependences

Cyber Epidemic Models wit Dependences Maocao Xu 1, Gaofeng Da 2 and Souuai Xu 3 1 Department of Matematics, Illinois State University mxu2@ilstu.edu 2 Institute for Cyber Security, University of Texas

Guide to Cover Letters & Thank You Letters

Guide to Cover Letters & Tank You Letters 206 Strebel Student Center (315) 792-3087 Fax (315) 792-3370 TIPS FOR WRITING A PERFECT COVER LETTER Te resume never travels alone. Eac time you submit your resume

Free Shipping and Repeat Buying on the Internet: Theory and Evidence

Free Sipping and Repeat Buying on te Internet: eory and Evidence Yingui Yang, Skander Essegaier and David R. Bell 1 June 13, 2005 1 Graduate Scool of Management, University of California at Davis (yiyang@ucdavis.edu)

Determine the perimeter of a triangle using algebra Find the area of a triangle using the formula

Student Name: Date: Contact Person Name: Pone Number: Lesson 0 Perimeter, Area, and Similarity of Triangles Objectives Determine te perimeter of a triangle using algebra Find te area of a triangle using

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

Average and Instantaneous Rates of Change: The Derivative

9.3 verage and Instantaneous Rates of Cange: Te Derivative 609 OBJECTIVES 9.3 To define and find average rates of cange To define te derivative as a rate of cange To use te definition of derivative to

The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

Binary Search Trees. Adnan Aziz. Heaps can perform extract-max, insert efficiently O(log n) worst case

Binary Searc Trees Adnan Aziz 1 BST basics Based on CLRS, C 12. Motivation: Heaps can perform extract-max, insert efficiently O(log n) worst case Has tables can perform insert, delete, lookup efficiently

A Secure Protocol for the Oblivious Transfer (Extended Abstract) M. J. Fischer. Yale University. S. Micali Massachusetts Institute of Technology

J, Cryptoiogy (1996) 9:191-195 Joumol of CRYPTOLOGY O 1996 International Association for Cryptologic Research A Secure Protocol for the Oblivious Transfer (Extended Abstract) M. J. Fischer Yale University

1 The Collocation Method

CS410 Assignment 7 Due: 1/5/14 (Fri) at 6pm You must wor eiter on your own or wit one partner. You may discuss bacground issues and general solution strategies wit oters, but te solutions you submit must

NAFN NEWS SPRING2011 ISSUE 7. Welcome to the Spring edition of the NAFN Newsletter! INDEX. Service Updates Follow That Car! Turn Back The Clock

NAFN NEWS ISSUE 7 SPRING2011 Welcome to te Spring edition of te NAFN Newsletter! Spring is in te air at NAFN as we see several new services cropping up. Driving and transport emerged as a natural teme

FINANCIAL SECTOR INEFFICIENCIES AND THE DEBT LAFFER CURVE

INTERNATIONAL JOURNAL OF FINANCE AND ECONOMICS Int. J. Fin. Econ. 10: 1 13 (2005) Publised online in Wiley InterScience (www.interscience.wiley.com). DOI: 10.1002/ijfe.251 FINANCIAL SECTOR INEFFICIENCIES

Chapter 11. Limits and an Introduction to Calculus. Selected Applications

Capter Limits and an Introduction to Calculus. Introduction to Limits. Tecniques for Evaluating Limits. Te Tangent Line Problem. Limits at Infinit and Limits of Sequences.5 Te Area Problem Selected Applications

Strategic trading and welfare in a dynamic market. Dimitri Vayanos

LSE Researc Online Article (refereed) Strategic trading and welfare in a dynamic market Dimitri Vayanos LSE as developed LSE Researc Online so tat users may access researc output of te Scool. Copyrigt

Multigrid computational methods are

M ULTIGRID C OMPUTING Wy Multigrid Metods Are So Efficient Originally introduced as a way to numerically solve elliptic boundary-value problems, multigrid metods, and teir various multiscale descendants,

RISK ASSESSMENT MATRIX

U.S.C.G. AUXILIARY STANDARD AV-04-4 Draft Standard Doc. AV- 04-4 18 August 2004 RISK ASSESSMENT MATRIX STANDARD FOR AUXILIARY AVIATION UNITED STATES COAST GUARD AUXILIARY NATIONAL OPERATIONS DEPARTMENT

Chapter 4 Complementary Sets Of Systems Of Congruences Proceedings NCUR VII. è1993è, Vol. II, pp. 793í796. Jeærey F. Gold Department of Mathematics, Department of Physics University of Utah Don H. Tucker

Exercises for numerical integration. Øyvind Ryan

Exercises for numerical integration Øyvind Ryan February 25, 21 1. Vi ar r(t) = (t cos t, t sin t, t) Solution: Koden blir % Oppgave.1.11 b) quad(@(x)sqrt(2+t.^2),,2*pi) a. Finn astigeten, farten og akselerasjonen.