Fundamental Limits on Data Acquisition: Trade-offs between Sample Complexity and Query Difficulty
|
|
- Myles Poole
- 5 years ago
- Views:
Transcription
1 Funamntal Limit on Data Acquiition: Tra-off btwn Sampl Complxity an Qury Difficulty Hy Won Chung, Ji Oon L, an Alfr O. Hro arxiv: v2 [c.it] 2 Jan 208 Abtract W conir qury-ba ata acquiition an th corrponing information rcovry problm, whr th goal i to rcovr binary variabl (information bit from parity maurmnt of tho variabl. Th quri an th corrponing parity maurmnt ar ign uing th ncoing rul of Fountain co. By uing Fountain co, w can ign potntially limitl numbr of quri, an corrponing parity maurmnt, an guarant that th original information bit can b rcovr with high probability from any ufficintly larg t of maurmnt of iz n. In th qury ign, th avrag numbr of information bit that i aociat with on parity maurmnt i call qury ifficulty ( an th minimum numbr of maurmnt rquir to rcovr th information bit for a fix i call ampl complxity (n. W analyz th funamntal tra-off btwn th qury ifficulty an th ampl complxity, an how that th ampl complxity of n = c max{, ( log / } for om contant c > 0 i ncary an ufficint to rcovr information bit with high probability a. Inx Trm Sampl complxity, qury ifficulty, Fountain co, Soliton itribution, crowourcing. I. INTRODUCTION Qury-ba ata acquiition ari in ivr application incluing: crowourcing [], [2]; activ larning [3], [4]; xprimntal ign [5], [6]; an community rcovry or clutring in graph [7], [8]. In th application, qury-ba ata acquiition can b mol a a 20 qution problm [9] btwn an oracl (or oracl an a playr whr th oracl now th valu of information bit that th playr aim to rcovr, whil th playr ign quri to th oracl an rciv anwr from th oracl. In thi papr, w conir qury-ba ata acquiition with th goal of rcovring th valu of variabl (x,..., x (information bit. Whn w aum that th variabl an th anwr (maurmnt ar binary, w can conir a parity chc um a a typ of maurmnt, which corrpon to xcluiv or (XOR or moulo 2 um of om ubt of th information bit. Qurying parity ymbol of th information bit gnraliz th 20 qution mol of [9], [0]. Thi gnralization i th focu of thi papr an ha a wi rang of application, in particular to crowourcing ytm []. Conir a crowourcing ytm coniting of a numbr of worr an a particular ta that thy ar xpct to wor on. Aum that th ta i to claify a collction of imag into two xcluiv group,.g., whthr or not an imag i uitabl for chilrn. A worr (oracl in th ytm i givn a qury about om ubt of th imag an a to provi a binary anwr rgaring tho imag. Aum that th worr can ip th qury if th worr i unur of th anwr. Th probability that on worr ip a qury i unnown at th tag of qury ign an it can b iffrnt for ach of th worr in th ytm, pning on thir abiliti or ffort. Thrfor, from th qury ignr point of viw, it i natural to aum that only a ranom ubt of th ign quri will b anwr by th worr in th crowourcing ytm. Th qury ignr objctiv i to ign quri uch that whn th rciv numbr of anwr xc om thrhol, rgarl of which ubt of th anwr wa collct, th original binary bit can b rcovr with high probability. In thi papr w how that Fountain co [] ar naturally uit to thi crowourcing qury ign problm. Fountain co ar a typ of forwar rror corrcting co uitabl for binary raur channl (BEC with unnown raur probabiliti. Thi typ of co ha bn th ubjct of much rarch for rliabl intrnt pact tranmiion whn th pact tranmitt from th ourc ar ranomly lot bfor thy arriv at th tination. Hy Won Chung (hwchung@ait.ac.r i with th School of Elctrical Enginring at KAIST in South Kora. Ji Oon L (jioon.l@ait.u i with th Dpartmnt of Mathmatical Scinc at KAIST in South Kora. Alfr O. Hro (hro@c.umich.u i with th Dpartmnt of EECS at th Univrity of Michigan. Thi wor wa partially upport by National Rarch Founation of Kora unr grant numbr 207REAA , an by Unit Stat Army Rarch Offic unr grant W9NF
2 2 For input ymbol (x, x 2,..., x, Fountain co prouc a potntially limitl numbr of parity maurmnt, which ar alo call output ymbol. By uing wll-ign Fountain co, on can guarant that, givn any t of output ymbol of iz ( + δ with mall ovrha δ > 0, th input ymbol can b rcovr with high probability. Exampl of Fountain co ar LT-co [2] an Raptor co [3]. By uing th Fountain co, w can ign potntially limitl numbr of quri (an corrponing parity maurmnt with th ir proprti uitabl for th crowourcing xampl. Howvr, th Fountain co framwor mut b xtn in orr to account for th worr limit capacity to anwr ifficult quri. Th qury ifficulty i fin a th avrag numbr of input ymbol rquir to comput a ingl parity maurmnt. Th qury ifficulty i rlat to th ncoing complxity for on-tag ncoing, but it i iffrnt from th ncoing complxity whn th ncoing i on in multipl tag. Th qury ifficulty rprnt th numbr of input ymbol on avrag th worr mut now to calculat on parity maurmnt. Dpning on th qury ifficulty, th numbr of anwr (parity maurmnt rquir to rcovr input ymbol may vary gratly. W call th minimum numbr of maurmnt rquir to rcovr input ymbol th ampl complxity. Th ampl complxity i a function of th qury ifficulty a wll a th numbr of input ymbol to b rcovr. Lt u conir two xtrm ca. Firt, conir th ca whn th qury ifficulty i qual to. Mor pcifically, w aum that ach qury a th valu of only on variabl in (x, x 2,..., x at a tim. Sinc it i not nown which of th quri woul b anwr by th worr at th tag of qury ign, a t of quri i ign by uniformly an ranomly picing on variabl in (x, x 2,..., x at a tim. For uch qurying cnario, with ranomly lct n maurmnt, in orr to rcovr th information bit with rror probability l than / u for om contant u > 0, th rquir numbr n of quri cal a log. On th othr han, whn ach qury i ign to gnrat a parity maurmnt of ranomly lct /2 bit at a tim, th rquir numbr n of maurmnt i only + c log for om contant c > 0 [3]. Thrfor, in th two xtrm ca, w can obrv that whn th qury ifficulty i qual to, th ampl complxity cal a log, whra for th qury ifficulty of orr th ampl complxity cal a. Thn th qution i how th ampl complxity cal a th qury ifficulty incra from to Θ(. In thi papr, w aim to analyz th funamntal tra-off btwn th ampl complxity an th qury ifficulty in rcovring information bit. Thr hav bn papr that hav analyz uch tra-off whn it i aum that th parity maurmnt involv only a fix numbr of input ymbol. In [4], th ca of pairwi maurmnt ( = 2 wa conir an in [5], a gnral intgr wa conir. Not that thr ar a total of ( poibl parity maurmnt for a fix. In both papr, it wa aum that ach maurmnt i inpnntly obrv with probability p ob. It wa hown that th numbr n of maurmnt to rcovr input ymbol with high probability cal a n = p ob ( = c max{, ( log /} for om contant c > 0. In thi papr, w gnraliz th wor in [5] by not fixing th numbr but inta allowing that th numbr follow a itribution (Ω 0, Ω,..., Ω whr Ω not th probability that th valu i chon, whr =0 Ω =. W conir th avrag qury ifficulty = =0 Ω an analyz th ampl complxity n a a function of th qury ifficulty an th numbr of input ymbol. By auming that follow th prcrib itribution, w can gnrat potntially limitl parity maurmnt by uing th ncoing rul mploy by Fountain co; guaranting that for any t of fix numbr of maurmnt it i poibl to rcovr th input ymbol with high probability. Thi framwor i thu mor uitabl for th ituation whr th parity maurmnt ar ra with arbitrary (unnown probabiliti an thu it i rquir to hav th ability to gnrat potntially limitl numbr of quri an corrponing parity maurmnt. For th prviou framwor in [4], [5], th maximum numbr of parity maurmnt i rtrict to ( for a fix. Our main contribution in thi papr i to pcify th funamntal tra-off btwn th ampl complxity (n an th qury ifficulty ( in thi gnraliz maurmnt mol. W how that th ampl complxity n ncary an ufficint to rcovr input ymbol with high probability cal a n = c max {, ( log / } ( for om contant c > 0. Not that for = O(log, th ampl complxity n i invrly proportional to th qury ifficulty. In particular, whn qury ifficulty = Θ(, th ampl complxity cal a log, whra whn = Θ(log, th ampl complxity cal a.
3 3 Th rt of thi papr i organiz a follow. In Sction II, w xplain th ncoing rul of Fountain co (how to gnrat potntially limitl numbr of parity maurmnt an tat th main problm of thi papr. In Sction III, w provi th main rult, howing th funamntal tra-off btwn th ampl complxity an th qury ifficulty. In Sction IV, w prov th main thorm. Mor tchnical tail for th proof ar prnt in Appnic. In Sction V, om imulation rult ar provi, which furthr upport our thortical rult. In Sction VI, w provi concluion an icu poibl futur rarch irction. A. Notation W u th notation for XOR of binary variabl, i.., for a, b {0, }, a b = 0 iff a = b an a b = iff a b. W not by j th -imnional unit vctor with it j-th lmnt qual to. For a vctor x, x not th numbr of in th vctor x. For vctor x an y, th innr prouct btwn x an y i not by x y. For two intgr α an β, w u th notation α β to inicat that mo(α, 2 = mo(β, 2. For two vctor x = (x, x 2,..., x an y = (y, y 2,..., y, whn w writ x y, it man that mo(x i, 2 = mo(y i, 2 for all i {, 2,..., }. W u th O( an Θ( notation to crib th aymptotic of ral qunc {a } an {b }: a = O(b impli that a Mb for om poitiv ral numbr M for all 0 ; a = Θ(b impli that a Mb an a M b for om poitiv ral numbr M an M for all 0. Th logarithmic function log i with ba. II. MODEL AND PROBLEM STATEMENT Conir a -imnional binary ranom vctor x = (X, X 2,..., X T, which i uniformly an ranomly itribut ovr {0, }. W call X, X 2,..., X th input ymbol. W aim to larn th valu of (X, X 2,..., X by obrving a total of n parity maurmnt of iffrnt ubt of tho bit. Conir -imnional binary vctor v i = (v i, v i2,..., v i, i =,..., n. Th parity maurmnt aociat with th vctor v i i fin by Y i = mo v ij X j, 2 = v i X v i X, (2 j= for i =,..., n. W call uch parity maurmnt (Y, Y 2,..., Y n th output ymbol. Each v i {0, } trmin which ubt of (X, X 2,..., X i to b pic in calculating th i-th parity maurmnt. Th proc of igning {v i } i call qury ign or ncoing. W u Fountain co, alo nown a raur ratl co, for th ncoing. Lt (Ω 0, Ω,..., Ω b a itribution on {0,,..., } whr Ω not th probability that th valu i chon an =0 Ω =. In th ncoing of Fountain co, ach vctor v i i gnrat inpnntly an ranomly by firt ampling a wight {0,,..., } from th itribution (Ω 0,..., Ω an thn lcting a -imnion vctor of wight uniformly at ranom from all th vctor of {0, } with wight. Conir an arbitrary t of n output ymbol (Y,..., Y n gnrat by th abov ncoing rul. Th rlationhip btwn th input ymbol an th n output ymbol can b pict by a bipartit graph with input no on on i an n output no on th othr i a hown in Fig. Dnot by th avrag gr of th output no, = Ω. (3 Thi numbr inicat th avrag numbr of input ymbol involv in on parity maurmnt (output ymbol an i rlat to th ifficulty in calculating on parity maurmnt. W call thi numbr qury ifficulty. Th proc of rcovring th input ymbol from th n output ymbol i call information rcovry or coing. Dnot by ˆx(Y th timat of x givn Y n P ( an fin th probability of rror a = min ˆx( Pr(ˆx(Y x. (4 With th propr choic of th itribution (Ω 0,..., Ω, th Fountain co guarant that P ( 0 a with n largr than om thrhol. Th minimum numbr of n rquir to guarant P ( 0 a, minimiz ovr all (Ω 0,..., Ω for a fix an, i call ampl complxity. W aim to fin th funamntal limit on n to guarant rliabl information rcovry of input ymbol for a fix qury ifficulty.
4 4 Input no x x 2 x 3 x 4 x 5 x 6 x. Output no. y y 2 y 3 y 4 y 5 y 6 y 7 y n Fig.. Bipartit graph btwn input no an output no. III. MAIN RESULTS: FUNDAMENTAL TRADE-OFFS BETWEEN SAMPLE COMPLEXITY AND QUERY DIFFICULTY In thi ction, w tat our main rult that th ampl complxity n that i ncary an ufficint to ma P ( 0 a cal in trm of an a n = c max{, ( log / } for om contant c > 0 inpnnt of an, whn th parity maurmnt ar gnrat by th ncoing rul of Fountain co a xplain in Sction II. W firt tat th wll-nown lowr boun on th ampl complxity n of Fountain co prnt in [3]. Propoition : To rliably rcovr input ymbol with P ( / u for om contant u > 0 from parity maurmnt gnrat by Fountain co, it i ncary that n c l max {, log } for om contant c l > 0. ( Proof: Showing th firt conition n c l i traightforwar. Each output ymbol Y i = mo j= v ijx j, 2 rprnt a linar quation of unnown input ymbol (X, X 2,..., X. Sinc thr ar unnown, it i ncary to hav at lat n = linar quation to olv thi linar ytm rliably. Th con conition n (c l log / i from a proprty of ranom graph. In th bipartit graph btwn input no an output no, w ay that an input no i iolat if it i not connct to any of th output no. W analyz th probability that an input no i iolat whn th g ar ign by th ncoing rul of Fountain co. Th rror probability P ( i boun blow by th probability that an input no i iolat, inc whn an input no i iolat th coing rror happn. Conir an output no with gr. Th probability that an input no i not connct to thi output no of gr qual /. Sinc an output no ha gr with probability Ω, th probability that an input no i not connct to an output no qual Ω ( / = /. (6 =0 Sinc thr ar n output no an th output no ar ampl inpnntly, th probability that an input no i iolat (not connct to any of tho output no qual ( n. (7 By th man valu thorm, w can how that ( / n α/( α/n whr α = n /. Sinc th coing rror probability P ( i lowr boun by th probability that an input no i iolat, to atify P ( / u (5
5 5 for om contant u > 0, it i ncary that α/( α/n / u, which i quivalnt to u α log + (u log /n u log + (u log / u log + (u log 3/3 c l log for om contant c l > 0. By plugging in α = n /, w gt n c l log. (9 (8 Th main contribution of thi papr i howing that th boun in (5 i in achivabl (up to contant caling by proprly ign Fountain co for any from Θ( to Θ(log. W provi a particular output gr itribution (Ω 0, Ω,..., Ω for which w can control th qury ifficulty from Θ( to Θ(log an how that it i poibl to rliably rcovr information bit with ampl complxity obying { n = c u max, log } (0 for om contant c u > 0. Thrfor, by combining (0 with (5, w conclu that n = c max{, ( log / } i ncary an ufficint for rliabl rcovry of information bit whn i th avrag qury ifficulty. Suppo that th law of Ω i givn by an ial Soliton itribution D if = Ω = ( if 2 D ( 0 if > D or = 0, for om D {2, 3,..., }. Hr, for implicity, w aum that 3. Not that th qury ifficulty cal a log D inc log(d + < = D D + D = < log D +. =2 Thrfor, a D incra from 2 to, th qury ifficulty cal from log 3 to log. Thorm : For th Soliton itribution ( with D {2, 3,..., }, th input ymbol can b rliably rcovr, i.., P ( 0 a, with ampl complxity { n = c u max, log } (2 for om contant c u > 0. Th proof of Thorm will b prnt in Sction IV. Thorm tat that for qury ifficulty = O(log, th ampl complxity n to rliably rcovr input ymbol i invrly proportional to th qury ifficulty. Whn th qury ifficulty o not incra in, i.., = Θ(, it i ncary an ufficint to hav n = Θ( log to rliably rcovr th information bit. In thi rgim, th ratio btwn an n convrg to 0 a. On th othr han, whn w incra th qury ifficulty to = Θ(log, it i nough to hav n = Θ( ampl, which rult in a poitiv limit of /n a. Whn log, incraing th qury ifficulty no longr hlp in rucing th ampl complxity. By uing th Soliton itribution ( an th ncoing rul of Fountain co, w can ign potntially limitl numbr of quri about (x, x 2,..., x an th corrponing parity maurmnt. Thorm how that with any t of maurmnt of iz n no largr than (2, w can rliably rcovr th information bit a. Morovr, thi ampl iz i optimal up to contant a hown by Propoition. Thu, our rult provi th optimal qury ign tratgy for rliabl information rcovry from an arbitrary t of parity maurmnt, optimal in trm of th ampl complxity (up to contant for a fix qury ifficulty.
6 6 IV. PROOF OF THEOREM In thi ction, w prov Thorm by proviing an uppr boun on P ( an howing that th ampl complxity n ufficint to ma thi uppr boun convrg to 0 a i qual to c u max{, ( log / } for om contant c u > 0. Conir P ( fin in (4. Th optimal coing rul ˆx( that minimiz th probability of rror i th maximum lilihoo (ML coing for th uniformly itribut ( input ymbol. Aum that w collct n parity n maurmnt (Y,..., Y n ach of which qual Y i = mo j= v ijx j, 2. Conir a matrix A who i-th row i v i = (v i, v i2,..., v i, i.., A := [v ; v 2 ;... ; v n ]. (3 W call A a ampling matrix. Givn (Y,..., Y n an th ampling matrix A, th ML coing rul fin x = (X, X 2,..., X T {0, } uch that Ax (Y, Y 2,..., Y n T. (4 If thr i a uniqu olution x {0, } for thi linar ytm, thn it i claim that ˆx(Y = x. If thr i mor than on x atifying thi linar ytm, thn an rror i clar. Th probability of rror i thu qual to P ( = x {0,} 2 Pr( x x uch that Ax Ax. (5 Du to ymmtry, th probabiliti Pr( x x uch that Ax Ax ar qual for vry x {0, }. Thu, w focu on th ca whr x i th vctor of all zro an conir By uing th union boun, it can b hown that P ( = Pr( x 0 uch that Ax 0. (6 P ( x 0 Pr(Ax 0 = = = ( ( Pr A = x = Pr(Ax 0 ( (7 i 0 whr i i th i-th tanar unit vctor. Th lat quality follow from th ymmtry of th ampling matrix A. Sinc all th output ampl ar gnrat inpnntly by th intically itribut v i, ach of which ha wight with probability Ω, ( ( ( ( n Pr W nxt analyz P ( = i= v i 0 = i= (( ( ( ( n Ω Pr v i 0 v =. = i= (8 ( ( Pr v i 0 v =. (9 i= Not that v ( i= i 0 if an only if thr ar vn numbr of in th firt ntri of v. Thi probability qual ( ( ( i i( i Pr v i 0 vt i i vn = = (. (20 i=
7 7 W nxt provi an uppr boun on (20. Dfin I = i i i vn ( i ( i. (2 In th following lmma, w provi an uppr boun on I a a multipl of (. Th proof of thi lmma i ba on that of th imilar lmma provi in [5], whr th uppr boun on I i tat pning on th rgim of for a fix. W provi an altrnativ vrion whr th uppr boun on I pn on th rgim of for a fix. Lmma : Conir th ca that 2 (i..,. Dfin κ( = (22 For 2 + (or,, whn w fin α =, {( ( 2 I 5α, whn < κ(, (23, whn κ(. 4 5( 2 For > 2 (or, <, whn w fin α = +, {( ( 2 I 5α, whn > κ(, (24, whn κ(. 4 5( In th ca > 2, w can obtain th boun for I imply by changing to. Proof: Appnix A. By uing Lmma an (20, th uppr boun on P ( in (8 can b furthr boun by whr w lt P ( 2 2 = 2 2 Σ = ( κ( = κ( κ( κ( + ( 2 κ( Ω + 5α = κ( + ( ( Σ n 2 2 Ω + Ω + + ( 2 5α = κ( ( nσ, = κ( + Ω ( Ω + Suppo that th law of Ω i givn by a Soliton itribution provi in (. Hr, for implicity, w aum that D {2, 3,..., } an 3. For thi Soliton itribution, w provi an uppr boun on ( nσ in (25 for 2 pning on th rgim of κ( with conition on th ampl complxity n. Lmma 2: With th ampl complxity { n c u max, log } (27 for om contant c u > 0, th trm ( nσ i boun abov a follow. 4 5 Ω n. (25 (26
8 8 Fig. 2. Mont Carlo imulation (5000 run of th probability of rror P ( with = 300 for thr iffrnt (th qury ifficulti. Th ampl complxity i normaliz by ( log /. W can obrv th pha tranition for P ( aroun th normaliz ampl complxity qual to for all th thr qury ifficulti conir. If κ( > D, ( nσ <. (28 2 If 4 κ( D ( { if, nσ 2 2 if < /2. 3 If κ( 3, ( nσ 2. (30 Proof: Appnix B. W rmar that th ca 2 o not happn whn D {2, 3}. From Lmma 2, whn th ampl complxity n atifi (27 w can furthr boun P ( P ( 2 2 ( in (25 by (29 c ( (3 for om contant c > 0. Not that thi uppr boun convrg to 0 a. V. SIMULATIONS In thi ction, w provi mpirical prformanc analyi for th probability of rror in th rcovry of information bit, a a function of th ampl complxity an qury ifficulty. In Fig. 2, w provi Mont Carlo imulation rult for th probability of rror P (, fin in (4, whr th numbr of information bit to rcovr i fix a = 300. W plot P ( in trm of th normaliz ampl complxity, normaliz by ( log / whr i th qury ifficulty. W run th imulation for thr iffrnt qury ifficulti, =4, 4.7, 5.6. Th parity maurmnt (output ymbol ar ign by firt ampling (th numbr of input ymbol rquir to comput a ingl parity maurmnt from th Soliton itribution ( an thn gnrating th maurmnt by th ncoing rul of Fountain co.
9 9 Fig. 3. Sam imulation conition a in Fig 2 xcpt that th horizontal axi i th un-normaliz ampl complxity. A th qury ifficulty incra, th ampl complxity to ma P ( clo to 0 cra. Thi illutrat th tra-off btwn th qury ifficulty an th ampl complxity. Obrv th pha tranition of P ( aroun th normaliz ampl complxity qual to. In Thorm, w tat that with ampl complxity of c u max{, ( log / } for om contant c u > 0, w can guarant P ( 0 a. Th imulation rult how that c u i ufficint to prouc a ramatic cra of P (. Sinc th pha tranition occur in th vicinity of normaliz ampl complxity qual to, th figur montrat th tra-off btwn th qury ifficulty an th ampl complxity. Spcifically, th rquir numbr of parity maurmnt to rliably rcovr information bit i invrly proportional to th qury ifficulty whn = O(log. Not that for th Soliton itribution (, th qury ifficulty i O(log, an thu max{, ( log / } = Θ(( log /. In Fig 3, w how th am imulation with un-normaliz ampl complxity inxing th horizontal axi. From thi plot, w can obrv that a th qury ifficulty incra, th rquir numbr of ampl to ma P ( clo to 0 cra. VI. CONCLUSIONS In thi papr, w analyz th funamntal tra-off btwn qury ifficulty an ampl complxity n in a qury-ba ata acquiition ytm aociat with a crowourcing ta with worr who may b non-rponiv to crtain quri (channl raur. W conir th information rcovry of binary variabl (x, x 2,..., x from parity maurmnt of ubt of th variabl. W u a qury ign ba on th ncoing rul of Fountain co, with which w can ign potntially limitl numbr of quri. W how that th propo qury ign policy guarant that th original information bit can b rcovr with high probability from any t of maurmnt of iz n largr than om thrhol. W obtain ncary an ufficint conition on ampl complxity n c max{, ( log / }. Thr ar vral intrting futur rarch irction rlat to thi wor. On of uch irction inclu analyzing tra-off btwn qury ifficulty an ampl complxity for partial information rcovry problm. In thi papr, w conir xact information rcovry, maning w aim to rcovr all th information bit with high probability. But pning on cnario, it coul b nough to rcovr only α of information bit for α (0,. Thn, th qution i how much thi rlax rcovry conition woul hlp in rucing th ampl complxity for a givn qury ifficulty. Epcially, on intrting qution might b whthr it i poibl to rcovr α information bit with only n = Θ( maurmnt vn with th vry low qury ifficulty = Θ(, which o not incra in. In th xact rcovry problm, it wa impoibl to rliably rcovr input ymbol with th ampl complxity n = Θ( whn th qury ifficulty i = Θ(. With = Θ(, it wa ncary to hav at lat n = Θ( log ampl complxity for th xact rcovry, which ma th ratio /n go to 0 a. Thrfor, it woul b intrting to whthr th ampl complxity of n = Θ( i ufficint for th partial rcovry problm vn with th qury ifficulty of = Θ(.
10 0 Anothr intrting irction i to apply th propo qury ign to ral crowourcing ytm an to analyz th xprimntal tra-off btwn th qury ifficulty an th ampl complxity. Epcially, whn th collct maurmnt contain inaccurat anwr an th probability that th maurmnt inclu inaccurat anwr chang pning on th qury ifficulty, th corrponing ampl complxity might b a iffrnt function of an. Thrfor, it woul b intrting to fin th qury ifficulty that minimiz th ampl complxity in crowourcing ytm with ranom raur an inaccurat anwr, an thi irction of rarch woul hlp guiing th ign of ampl-fficint crowourcing ytm. APPENDIX A PROOF OF LEMMA To prov thi lmma, w { rfr to th imilar } boun provi { in [5]. } Lmma 3: Lt β = max + 2+, + 2( + an α = max +, +. Thn w hav 2 ( ( 5α(, whn < β, i i 5(, whn β β, (32, whn β <. Not that i i i o ( = i i i o ( i 2( 5α ( i ( + i i i vn Thrfor, by uing Lmma 3, w can fin an uppr boun on i W fin ( i i i vn ( i I = ( ( i i i i i vn ( ( 2 5α, whn < β, 4 ( 5(, whn β β, 2( 5α, whn β <. (. (33 ( i( i a a caling of ( uch that (34 κ( = (35 W firt conir th ca 2 (i..,. Sinc β attain it maximum 3 at = or =, w fin that β < 2. Hnc, β > an th lat ca in (34 cannot happn. For 2 (or,, + β =, α = Not that κ(+ 2κ(+ + =. Sinc 2+ i an incraing function of, if < κ( thn β >. Thu, {( ( 2 I 5α, whn < κ(, (36, whn κ(. 4 5( 2 For > 2 (or, <, + β =, α = + 2( +.
11 Procing a abov, w gt {( ( 2 I 5α, whn > κ(, (37, whn κ(. 4 5( In th ca > 2, w can obtain th boun for I imply by changing to. APPENDIX B PROOF OF LEMMA 2 In thi lmma, w prov an uppr boun on ( nσ whr For th Soliton itribution w hav th qury ifficulty Σ = κ( = κ( κ( Ω + Ω + + = κ( + D if = Ω = ( if 2 D 0 if > D or = 0, log(d + < = D + D For implicity, hr w aum that D 2. Rcall that =2 which i a craing function of, an κ( > 0 for 2. If κ( > D, Thu, if n 5 log, Σ If 4 κ( D, w firt notic that κ( ( Ω +. D = < log D +. (38 κ( = + 2 +, (39 Ω + > 2 5 D Ω = 2 5. ( ( nσ < 2n xp 2 =. 5 < 2 κ( > 3 κ( 4. (40 7 Thu 2 7 an κ( = ( In thi ca, Σ 2 5 κ( > 2 κ( 5 =2 > log Ω + log( κ( ( 4. 2
12 2 Morovr, inc 7, if n C for om ufficintly larg C, (C 68 uffic nσ 2C ( 4 5 log 2 ( ( 2C 4 log log 7 + 2C ( 4 5 log 2 ( 4 log. From Stirling formula, w alo hav that 2πn n+ 2 n n! n n+ 2 n, hnc Thu, if n 68, Not that ( + 2 2π( + 2 ( ( ( ( ( ( ( 2 = xp ( log xp ( 2 log (. ( ( nσ xp 2 log ( = + 2 ( 2. ( { 2 if, 2 2 if < /2. 3 If κ( = 3, w fin from (40 that 2 7. Thn, by coniring th ca = 2, Σ 2 5 κ( 2 5( 2( 2 35( 35 Ω + for 3. Thu, if n 35, 4 If κ( =, 2, Thu, if n 0, Σ 5 ( nσ 2. κ( = κ( Ω Ω 2 5 = 0. ( nσ 2.
13 3 REFERENCES [] D. R. Kargr, S. Oh, an D. Shah, Bugt-optimal ta allocation for rliabl crowourcing ytm, Opration Rarch, vol. 62, no., pp. 24, 204. [2] M. S. Brntin, J. Brant, R. C. Millr, an D. R. Kargr, Crow in two con: Enabling raltim crow-powr intrfac, in Procing of th 24th annual ACM ympoium on Ur intrfac oftwar an tchnology. ACM, 20, pp [3] D. J. MacKay, Information-ba objctiv function for activ ata lction, Nural computation, vol. 4, no. 4, pp , 992. [4] B. Sttl, Activ larning litratur urvy, Univrity of Wiconin, Maion, vol. 52, no , p., 200. [5] D. V. Linly, On a maur of th information provi by an xprimnt, Th Annal of Mathmatical Statitic, pp , 956. [6] V. V. Forov, Thory of optimal xprimnt. Elvir, 972. [7] E. Abb an C. Sanon, Community tction in gnral tochatic bloc mol: Funamntal limit an fficint algorithm for rcovry, in Founation of Computr Scinc (FOCS, 205 IEEE 56th Annual Sympoium on. IEEE, 205, pp [8] B. Haj, Y. Wu, an J. Xu, Information limit for rcovring a hin community, IEEE Tranaction on Information Thory, 207. [9] H. W. Chung, B. M. Salr, L. Zhng, an A. O. Hro, Unqual rror protction qurying polici for th noiy 20 qution problm, IEEE Tranaction on Information Thory, DOI: 0.09/TIT , 207. [0] T. Tiligarii, B. M. Salr, an A. O. Hro, Collaborativ 20 qution for targt localization, IEEE Tranaction on Information Thory, vol. 60, no. 4, pp , 204. [] D. J. MacKay, Fountain co, IEE Procing-Communication, vol. 52, no. 6, pp , [2] M. Luby, LT co, in Procing. Th 43r Annual IEEE Sympoium on Founation of Computr Scinc, IEEE, 2002, pp [3] A. Shorollahi, Raptor co, IEEE Tranaction on Information Thory, vol. 52, no. 6, pp , [4] Y. Chn, C. Suh, an A. J. Golmith, Information rcovry from pairwi maurmnt, IEEE Tranaction on Information Thory, vol. 62, no. 0, pp , 206. [5] K. Ahn, K. L, an C. Suh, Community rcovry in hyprgraph, in th Annual Allrton Confrnc on Communication, Control, an Computing (Allrton. IEEE, 206, pp
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[ ] 1+ lim G( s) 1+ s + s G s s G s Kacc SYSTEM PERFORMANCE. Since. Lecture 10: Steady-state Errors. Steady-state Errors. Then
SYSTEM PERFORMANCE Lctur 0: Stady-tat Error Stady-tat Error Lctur 0: Stady-tat Error Dr.alyana Vluvolu Stady-tat rror can b found by applying th final valu thorm and i givn by lim ( t) lim E ( ) t 0 providd
More informationThe 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 informationThe 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 informationFirst 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(1) Then we could wave our hands over this and it would become:
MAT* K285 Spring 28 Anthony Bnoit 4/17/28 Wk 12: Laplac Tranform Rading: Kohlr & Johnon, Chaptr 5 to p. 35 HW: 5.1: 3, 7, 1*, 19 5.2: 1, 5*, 13*, 19, 45* 5.3: 1, 11*, 19 * Pla writ-up th problm natly and
More informationThe 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 informationLecture 4: Parsing. Administrivia
Adminitrivia Lctur 4: Paring If you do not hav a group, pla pot a rqut on Piazzza ( th Form projct tam... itm. B ur to updat your pot if you find on. W will aign orphan to group randomly in a fw day. Programming
More informationThe Exponential, Gaussian and Uniform Truncated Discrete Density Functions for Discrete Time Systems Analysis
tvan Brbr Th Exponntial, Gauian an Uniform Truncat Dicrt Dnity Function for Dicrt Tim ytm nalyi TEVN BERBER Elctrical an Computr Enginring Dpartmnt Th Univrity of ucklan Princ trt, 00 ucklan Cntral NEW
More informationINTRODUCTION TO AUTOMATIC CONTROLS INDEX LAPLACE TRANSFORMS
adjoint...6 block diagram...4 clod loop ytm... 5, 0 E()...6 (t)...6 rror tady tat tracking...6 tracking...6...6 gloary... 0 impul function...3 input...5 invr Laplac tranform, INTRODUCTION TO AUTOMATIC
More informationSource code. where each α ij is a terminal or nonterminal symbol. We say that. α 1 α m 1 Bα m+1 α n α 1 α m 1 β 1 β p α m+1 α n
Adminitrivia Lctur : Paring If you do not hav a group, pla pot a rqut on Piazzza ( th Form projct tam... itm. B ur to updat your pot if you find on. W will aign orphan to group randomly in a fw day. Programming
More informationHigher 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 informationCalculation of electromotive force induced by the slot harmonics and parameters of the linear generator
Calculation of lctromotiv forc inducd by th lot harmonic and paramtr of th linar gnrator (*)Hui-juan IU (**)Yi-huang ZHANG (*)School of Elctrical Enginring, Bijing Jiaotong Univrity, Bijing,China 8++58483,
More information22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches.
Subjct Chmistry Papr No and Titl Modul No and Titl Modul Tag 8/ Physical Spctroscopy / Brakdown of th Born-Oppnhimr approximation. Slction ruls for rotational-vibrational transitions. P, R branchs. CHE_P8_M
More informationThat is, we start with a general matrix: And end with a simpler matrix:
DIAGON ALIZATION OF THE STR ESS TEN SOR INTRO DUCTIO N By th us of Cauchy s thorm w ar abl to rduc th numbr of strss componnts in th strss tnsor to only nin valus. An additional simplification of th strss
More informationcycle 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 informationProblem 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 informationBasic 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 informationAddition 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 informationComputing and Communications -- Network Coding
89 90 98 00 Computing and Communications -- Ntwork Coding Dr. Zhiyong Chn Institut of Wirlss Communications Tchnology Shanghai Jiao Tong Univrsity China Lctur 5- Nov. 05 0 Classical Information Thory Sourc
More informationENGR 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 informationEngineering Differential Equations Practice Final Exam Solutions Fall 2011
9.6 Enginring Diffrntial Equation Practic Final Exam Solution Fall 0 Problm. (0 pt.) Solv th following initial valu problm: x y = xy, y() = 4. Thi i a linar d.. bcau y and y appar only to th firt powr.
More informationConstruction 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 informationMath 34A. Final Review
Math A Final Rviw 1) Us th graph of y10 to find approimat valus: a) 50 0. b) y (0.65) solution for part a) first writ an quation: 50 0. now tak th logarithm of both sids: log() log(50 0. ) pand th right
More informationFunction 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 informationExiting from QE. Fumio Hayashi and Junko Koeda. for presentation at SF Fed Conference. March 28, 2014
Fumio Hayashi an Junko Koa Exiting from QE March 28, 214, 1 / 29 Exiting from QE Fumio Hayashi an Junko Koa for prsntation at SF F Confrnc March 28, 214 To gt start... h^ : Fumio Hayashi an Junko Koa Exiting
More informationAddition 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 informationCase Study 4 PHA 5127 Aminoglycosides Answers provided by Jeffrey Stark Graduate Student
Cas Stuy 4 PHA 527 Aminoglycosis Answrs provi by Jffry Stark Grauat Stunt Backgroun Gntamicin is us to trat a wi varity of infctions. Howvr, u to its toxicity, its us must b rstrict to th thrapy of lif-thratning
More informationOn 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 informationMA1506 Tutorial 2 Solutions. Question 1. (1a) 1 ) y x. e x. 1 exp (in general, Integrating factor is. ye dx. So ) (1b) e e. e c.
MA56 utorial Solutions Qustion a Intgrating fator is ln p p in gnral, multipl b p So b ln p p sin his kin is all a Brnoulli quation -- st Sin w fin Y, Y Y, Y Y p Qustion Dfin v / hn our quation is v μ
More informationSupplementary Materials
6 Supplmntary Matrials APPENDIX A PHYSICAL INTERPRETATION OF FUEL-RATE-SPEED FUNCTION A truck running on a road with grad/slop θ positiv if moving up and ngativ if moving down facs thr rsistancs: arodynamic
More informationu 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 information1 Isoparametric Concept
UNIVERSITY OF CALIFORNIA BERKELEY Dpartmnt of Civil Enginring Spring 06 Structural Enginring, Mchanics and Matrials Profssor: S. Govindj Nots on D isoparamtric lmnts Isoparamtric Concpt Th isoparamtric
More informationRecall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1
Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1
More informationSECTION 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 information1 Minimum Cut Problem
CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms
More informationFirst 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 informationHomework #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 informationThomas 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 informationAvailable online at ScienceDirect. Procedia Technology 24 (2016 )
Availabl onlin at www.cincirct.com ScincDirct Procia Tchnology 4 (016 ) 896 903 Intrnational Confrnc on Emrging Trn in Enginring, Scinc an Tchnology (ICETEST - 015) Analyi of Phyical layr Scurity via Co-oprativ
More informationPropositional 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 informationCPSC 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 informationHydrogen 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 informationMathematics 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 informationThomas 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 information10. 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 informationSection 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 informationA Sub-Optimal Log-Domain Decoding Algorithm for Non-Binary LDPC Codes
Procdings of th 9th WSEAS Intrnational Confrnc on APPLICATIONS of COMPUTER ENGINEERING A Sub-Optimal Log-Domain Dcoding Algorithm for Non-Binary LDPC Cods CHIRAG DADLANI and RANJAN BOSE Dpartmnt of Elctrical
More informationAbstract 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 informationDerangements 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 information3) 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 informationBrief Introduction to Statistical Mechanics
Brif Introduction to Statistical Mchanics. Purpos: Ths nots ar intndd to provid a vry quick introduction to Statistical Mchanics. Th fild is of cours far mor vast than could b containd in ths fw pags.
More informationChapter 10. The singular integral Introducing S(n) and J(n)
Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don
More information1973 AP Calculus AB: Section I
97 AP Calculus AB: Sction I 9 Minuts No Calculator Not: In this amination, ln dnots th natural logarithm of (that is, logarithm to th bas ).. ( ) d= + C 6 + C + C + C + C. If f ( ) = + + + and ( ), g=
More informationThe van der Waals interaction 1 D. E. Soper 2 University of Oregon 20 April 2012
Th van dr Waals intraction D. E. Sopr 2 Univrsity of Orgon 20 pril 202 Th van dr Waals intraction is discussd in Chaptr 5 of J. J. Sakurai, Modrn Quantum Mchanics. Hr I tak a look at it in a littl mor
More informationEquilibrium Scour Depth at Tidal Inlets
Coatal Enginring Tchnical Not IV-18 Equilibrium Scour Dpth at Tial Inlt by Stvn A. Hugh PURPOSE: Th Coatal Enginring Tchnical Not (CETN) hrin introuc a impl xprion rlating maximum icharg pr unit with at
More informationwith Dirichlet boundary conditions on the rectangle Ω = [0, 1] [0, 2]. Here,
Numrical Eampl In thi final chaptr, w tart b illutrating om known rult in th thor and thn procd to giv a fw novl ampl. All ampl conidr th quation F(u) = u f(u) = g, (-) with Dirichlt boundar condition
More informationSPH4U 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 informationLINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM
Elctronic Journal of Diffrntial Equations, Vol. 2003(2003), No. 92, pp. 1 6. ISSN: 1072-6691. URL: http://jd.math.swt.du or http://jd.math.unt.du ftp jd.math.swt.du (login: ftp) LINEAR DELAY DIFFERENTIAL
More informationWeek 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 informationChapter 10 Time-Domain Analysis and Design of Control Systems
ME 43 Sytm Dynamic & Control Sction 0-5: Stady Stat Error and Sytm Typ Chaptr 0 Tim-Domain Analyi and Dign of Control Sytm 0.5 STEADY STATE ERRORS AND SYSTEM TYPES A. Bazoun Stady-tat rror contitut an
More informationMSLC Math 151 WI09 Exam 2 Review Solutions
Eam Rviw Solutions. Comput th following rivativs using th iffrntiation ruls: a.) cot cot cot csc cot cos 5 cos 5 cos 5 cos 5 sin 5 5 b.) c.) sin( ) sin( ) y sin( ) ln( y) ln( ) ln( y) sin( ) ln( ) y y
More informationSelf-interaction mass formula that relates all leptons and quarks to the electron
Slf-intraction mass formula that rlats all lptons and quarks to th lctron GERALD ROSEN (a) Dpartmnt of Physics, Drxl Univrsity Philadlphia, PA 19104, USA PACS. 12.15. Ff Quark and lpton modls spcific thoris
More informationCombinatorial Networks Week 1, March 11-12
1 Nots on March 11 Combinatorial Ntwors W 1, March 11-1 11 Th Pigonhol Principl Th Pigonhol Principl If n objcts ar placd in hols, whr n >, thr xists a box with mor than on objcts 11 Thorm Givn a simpl
More informationOpen Access Simulation and Application of Power System Stabilizer on Power System Transient Stability
Sn Orr for Rprint to rprint@bnthamcinc.a 8 Th Opn Elctrical & Elctronic Enginring Journal, 04, 8, 8- Opn Acc Simulation an Application of Powr Sytm Stabilizr on Powr Sytm Tranint Stability Ang Li * School
More informationExact reconstruction for cone-beam scanning along nonstandard spirals and other curves
Exact rcontruction or con-bam canning along nontanar piral an othr curv Yangbo Y a,b, Shiying Zhao b, Hngyong Yu, an G Wang a,b,c a Dpartmnt o Mathmatic, b Dpartmnt o aiology, c Biochmical Enginring, Univrity
More informationSelf-Adjointness and Its Relationship to Quantum Mechanics. Ronald I. Frank 2016
Ronald I. Frank 06 Adjoint https://n.wikipdia.org/wiki/adjoint In gnral thr is an oprator and a procss that dfin its adjoint *. It is thn slf-adjoint if *. Innr product spac https://n.wikipdia.org/wiki/innr_product_spac
More informationFourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.
Lur 7 Fourir Transforms and th Wav Euation Ovrviw and Motivation: W first discuss a fw faturs of th Fourir transform (FT), and thn w solv th initial-valu problm for th wav uation using th Fourir transform
More informationChapter 13 GMM for Linear Factor Models in Discount Factor form. GMM on the pricing errors gives a crosssectional
Chaptr 13 GMM for Linar Factor Modls in Discount Factor form GMM on th pricing rrors givs a crosssctional rgrssion h cas of xcss rturns Hors rac sting for charactristic sting for pricd factors: lambdas
More informationChapter 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 informationKernels. 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 informationCase Study Vancomycin Answers Provided by Jeffrey Stark, Graduate Student
Cas Stuy Vancomycin Answrs Provi by Jffry Stark, Grauat Stunt h antibiotic Vancomycin is liminat almost ntirly by glomrular filtration. For a patint with normal rnal function, th half-lif is about 6 hours.
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim and n a positiv intgr, lt ν p (n dnot th xponnt of p in n, and u p (n n/p νp(n th unit part of n. If α
More informationY 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 informationCOUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM
COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM Jim Brown Dpartmnt of Mathmatical Scincs, Clmson Univrsity, Clmson, SC 9634, USA jimlb@g.clmson.du Robrt Cass Dpartmnt of Mathmatics,
More informationCOHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.
MTH rviw part b Lucian Mitroiu Th LOG and EXP functions Th ponntial function p : R, dfind as Proprtis: lim > lim p Eponntial function Y 8 6 - -8-6 - - X Th natural logarithm function ln in US- log: function
More informationCh. 24 Molecular Reaction Dynamics 1. Collision Theory
Ch. 4 Molcular Raction Dynamics 1. Collision Thory Lctur 16. Diffusion-Controlld Raction 3. Th Matrial Balanc Equation 4. Transition Stat Thory: Th Eyring Equation 5. Transition Stat Thory: Thrmodynamic
More informationPROBLEM 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 informationPHYS ,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 informationFinding low cost TSP and 2-matching solutions using certain half integer subtour vertices
Finding low cost TSP and 2-matching solutions using crtain half intgr subtour vrtics Sylvia Boyd and Robrt Carr Novmbr 996 Introduction Givn th complt graph K n = (V, E) on n nods with dg costs c R E,
More informationIntroduction 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 informationAdditional 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 informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit
More informationL 1 = L G 1 F-matrix: too many F ij s even at quadratic-only level
5.76 Lctur #6 //94 Pag of 8 pag Lctur #6: Polyatomic Vibration III: -Vctor and H O Lat tim: I got tuck on L G L mut b L L L G F-matrix: too many F ij vn at quadratic-only lvl It obviou! Intrnal coordinat:
More informationSequence Mirroring Properties of Orthogonal Transforms Having Even and Odd Symmetric Vectors
ECT TANSACTONS ON COMPUTE AND NFOMATON TECNOLOGY VOL., NO. 2 NOVEMBE 2 Squnc Mirroring Proprti of Orthogonal Tranform aving Evn and Odd Symmtric Vctor Do Nyon Kim and K.. ao Dpartmnt of Elctrical Enginring,
More informationFinite Element Analysis
Finit Elmnt Analysis L4 D Shap Functions, an Gauss Quaratur FEA Formulation Dr. Wiong Wu EGR 54 Finit Elmnt Analysis Roamap for Dvlopmnt of FE Strong form: govrning DE an BCs EGR 54 Finit Elmnt Analysis
More informationOn spanning trees and cycles of multicolored point sets with few intersections
On spanning trs and cycls of multicolord point sts with fw intrsctions M. Kano, C. Mrino, and J. Urrutia April, 00 Abstract Lt P 1,..., P k b a collction of disjoint point sts in R in gnral position. W
More informationA 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 informationElements of Statistical Thermodynamics
24 Elmnts of Statistical Thrmodynamics Statistical thrmodynamics is a branch of knowldg that has its own postulats and tchniqus. W do not attmpt to giv hr vn an introduction to th fild. In this chaptr,
More informationCalculus concepts derivatives
All rasonabl fforts hav bn mad to mak sur th nots ar accurat. Th author cannot b hld rsponsibl for any damags arising from th us of ths nots in any fashion. Calculus concpts drivativs Concpts involving
More informationRandom Process Part 1
Random Procss Part A random procss t (, ζ is a signal or wavform in tim. t : tim ζ : outcom in th sampl spac Each tim w rapat th xprimnt, a nw wavform is gnratd. ( W will adopt t for short. Tim sampls
More informationCalculus II (MAC )
Calculus II (MAC232-2) Tst 2 (25/6/25) Nam (PRINT): Plas show your work. An answr with no work rcivs no crdit. You may us th back of a pag if you nd mor spac for a problm. You may not us any calculators.
More informationEinstein Equations for Tetrad Fields
Apiron, Vol 13, No, Octobr 006 6 Einstin Equations for Ttrad Filds Ali Rıza ŞAHİN, R T L Istanbul (Turky) Evry mtric tnsor can b xprssd by th innr product of ttrad filds W prov that Einstin quations for
More informationLecture 37 (Schrödinger Equation) Physics Spring 2018 Douglas Fields
Lctur 37 (Schrödingr Equation) Physics 6-01 Spring 018 Douglas Filds Rducd Mass OK, so th Bohr modl of th atom givs nrgy lvls: E n 1 k m n 4 But, this has on problm it was dvlopd assuming th acclration
More informationEEO 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 informationON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park
Kangwon-Kyungki Math. Jour. 11 (2003), No. 2, pp. 147 153 ON RIGHT(LEFT) DUO PO-SEMIGROUPS S. K. L and K. Y. Park Abstract. W invstigat som proprtis on right(rsp. lft) duo po-smigroups. 1. Introduction
More informationy = 2xe x + x 2 e x at (0, 3). solution: Since y is implicitly related to x we have to use implicit differentiation: 3 6y = 0 y = 1 2 x ln(b) ln(b)
4. y = y = + 5. Find th quation of th tangnt lin for th function y = ( + ) 3 whn = 0. solution: First not that whn = 0, y = (1 + 1) 3 = 8, so th lin gos through (0, 8) and thrfor its y-intrcpt is 8. y
More informationOutline. Thanks to Ian Blockland and Randy Sobie for these slides Lifetimes of Decaying Particles Scattering Cross Sections Fermi s Golden Rule
Outlin Thanks to Ian Blockland and andy obi for ths slids Liftims of Dcaying Particls cattring Cross ctions Frmi s Goldn ul Physics 424 Lctur 12 Pag 1 Obsrvabls want to rlat xprimntal masurmnts to thortical
More informationEstimation of apparent fraction defective: A mathematical approach
Availabl onlin at www.plagiarsarchlibrary.com Plagia Rsarch Library Advancs in Applid Scinc Rsarch, 011, (): 84-89 ISSN: 0976-8610 CODEN (USA): AASRFC Estimation of apparnt fraction dfctiv: A mathmatical
More informationThe 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