On k-colored Lambda Terms and their Skeletons
|
|
- Bonnie Wilkinson
- 5 years ago
- Views:
Transcription
1 On k-coored Lmbd Terms nd their Skeetons Pu Tru Uniersity of North Texs PADL 2018 Reserch supported by NSF grnt Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
2 Oeriew this tk is bout n ppiction of ogic progrmming to the modeing of combintori properties of mbd terms mbd terms in de Bruijn nottion re Motzkin trees (so ced binry-unry trees) with indices t their ees counting up on the pth to the root the steps to their mbd binder s generiztion of ffine mbd terms, we introduce k-coored mbd terms obtined by being their mbd nodes with counts of the ribes they bind we study properties of the skeetons of k-coored mbd terms, the Motzkin trees obtined by ersing the de Bruijn indices being their ees we focus on the (difficut) cse of simpy-typed cosed k-coored mbd terms for which new combintori genertion gorithm is gien nd some interesting retions between mxim cooring, size of type expressions nd typbiity re expored Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
3 Outine 1 Lmbd terms nd their tree skeetons 2 Function equtions, dt types, nd -term genertors : in one, with DCGs 3 Mking mbd terms (somewht) more coorfu 4 Motzkin skeetons for cosed, ffine nd iner terms 5 K-coored cosed mbd terms 6 K-coored mbd terms nd type inference 7 A two-stge genertion gorithm for typbe nd untypbe skeetons 8 Questions? the pper is orgnized s iterte Proog progrm - our code is ibe t: Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
4 Lmbd terms nd their tree skeetons Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
5 Cosed mbd terms nd their Motzkin-trees skeetons Motzkin tree (so ced binry-unry tree) is rooted ordered tree buit from binry nodes, unry nodes nd ef nodes the set of Motzkin trees cn be seen s the free gebr generted by the constructors /0, /1 nd /2 mbd terms in de Bruijn form: the free gebr generted by the constructors /1, nd /2 nd ees beed with ntur numbers wrpped with the constructor /1 mbd term in de Bruijn form is cosed if for ech of its de Bruijn indices it exists mbd binder to which it points, on the pth to the root of the tree representing the term they re counted by sequence A in OEIS skeeton of mbd term: the Motzkin tree obtined by ersing the bes t its ees we c Motzkin tree cosbe if it is the skeeton of t est one cosed mbd term Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
6 Some Cosbe nd Uncosbe Motzkin Skeetons ) 3 cosbe skeetons b) 3 uncosbe skeetons Figure: Cosbe s. uncosbe skeetons of size 7 Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
7 Function equtions, dt types, nd -term genertors : in one, with DCGs Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
8 Function equtions, dt types, nd -term genertors : in one, with DCGs the retionship between gebric function equtions nd unmbiguous CF-grmmrs is we known (see e.g., Fjoet s book) Proog preprocesses CF-grmmr nottion from Definite Cuse Grmmrs nottion to ctu code we cn design direct trnstion to them from gebric function equtions BTW, unmbiguous CF-grmmrs so describe dt dt types (e.g., Hske s dt decrtions)! The set of Motzkin trees M(z) foows the gebric function eqution M(z) = z + zm(z) + zm 2 (z). Trnsting to Proog s Definite Cuse Grmmr nottion (with, stnding for conjunction nd ; for disjunction) we obtin: m --> z ; z,m ; z,m,m. % we cn think here tht z consumes 1 size unit Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
9 A size definition: ech constructor costs s much s its rity Proposition The set of terms of size n for the size definition {ppiction=2, mbd=1, ribe=0} is equ to the set of terms of size n + 1 for the size definition {ppiction=1, mbd=1, ribe=1}. true, gien tht the number of ees in Motzkin tree is the number of binry nodes + 1 the term (((0),(0))) wi he size 3 = with our definition, which corresponds to size 4 = using the size definition for sequence A our size definition is impemented s (SX,X):-succ(X,SX). % for /1 constructors -->,. % for /2 constructors with Proog s DCG nottion controing the consumption of size units from N to 0 Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
10 Cosbe nd uncosbe Motzkin skeetons cosbe skeeton: Motzkin tree tht is the skeeton of t est one cosed mbd term cn such skeeton predetermine if it cn be decorted to cosed mbd term? YES, nd there re sighty more uncosbe Motzkin trees thn cosbe ones s size grows: cosbe: 0,1,1,2,5,11,26,65,163,417,1086,2858,7599,20391,55127,150028,410719,... uncosbe: 1,0,1,2,4,10,25,62,160,418,1102,2940,7912,21444,58507,160544,442748,... Wht hppens to them symptoticy? pper with Oiier Bodini) 1 5 re cosbe (see LOPSTR 17 how we do it: we need is DCG grmmr describing them! Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
11 A CF grmmr for cosbe skeetons Proposition A Motzkin tree is skeeton of cosed mbd term if nd ony if it exists t est one mbd binder on ech pth from the ef to the root. t est one mbd (/1 constructor) on ech pth Motzkin trees beow the /1 constructor contin ony /2 brnches nd ees ssuming motske/3 genertes Motzkin trees i.e., by decorting m/2 cosbe(n,x):-cosbe(x,n,0). cosbe((z))-->,motske(z). % /2 nd ees ony cosbe((x,y))-->,cosbe(x),cosbe(y). Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
12 Mking mbd terms (somewht) more coorfu Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
13 Mking mbd terms (somewht) more coorfu our mbd terms in de Bruijn form: s the free gebr generted by the constructors /1, r/1 nd /2 with ees beed with ntur numbers (nd seen s wrpped with the constructor /1 when conenient) we spit mbd constructors into 2 csses: binding mbds, /1 tht re reched by t est one de Bruijn index free mbds, r/1, tht re not reched by ny de Bruijn index ex: λ x.λ y.λ z.(y (x x)) is written s ((r(((0),((1),(1))))) free mbd terms wi he no sy on terms being cosed, but they wi impct on which cosed terms re simpy typed 2-coored Motzkin trees: the free gebr generted by the constructors /0, /1, r/1 nd /2 2-coored Motzkin skeeton of mbd term: the tree obtined by ersing the de Bruijn indices being their ees Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
14 A bijection between 2-coored Motzkin skeetons nd non-empty binry trees binry trees: the free gebr generted by e/0 nd c/2 bijections between the Ctn fmiy of combintori objects nd 2-coored Motzkin trees : they exist but they inoe rtifici constructs (e.g., depth first serch on rose-trees, indirect definition of the mpping) reson to find new one! In Proog we need one retion for f nd f 1 : ct_mot(c(e,e),). ct_mot(c(x,e),(a)):-x=c(_,_),ct_mot(x,a). ct_mot(c(e,y),r(b)):-y=c(_,_),ct_mot(y,b). ct_mot(c(x,y),(a,b)):-x=c(_,_),y=c(_,_), ct_mot(x,a), ct_mot(y,b). one cn incude the empty tree e by n rithmetiztion mechnism tht defines successor nd predecessor (e.g., our PPDP 15 pper) Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
15 The 2-Motzkin to non-empty binry trees bijection t work two twinned trees of size 4 c c c e e e c e c e e r two twinned trees size 10 c c c c c e c e e e c c c e e e c c e e e e e r r r r r Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
16 Motzkin skeetons for cosed, ffine nd iner terms Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
17 Generting 2-coored Motzkin skeetons Motzkin skeetons of mbd terms: we erse the de Bruijn indices t ees size of constructors is their rity =2, =1, r=1, =0 in fct, this size definition mtches the size of their hep representtion generte the spits of the size N into 2*A+L+R where A=size of /2 etc. define predictes to consume size units s needed: Dec(c(SL,R,A),c(L,R,A)):-succ(L,SL). rdec(c(l,sr,a),c(l,r,a)):-succ(r,sr). Dec(c(L,R,SA),c(L,R,A)):-succ(A,SA). Proposition If Motzkin tree is skeeton of cosed mbd term then it exists t est one mbd binder on ech pth from the ef to the root. Thus L A + 1. The number of ees is A + 1 gien A ppiction nodes. Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
18 Generting cosed ffine terms flm(n,t):-sum_to(n,hi,lo),hs_enough_mbds(hi),flinlm(t,[],hi,lo) hs_enough_mbds(c(l,_,a)):-succ(a,l). % L=A+1 flinlm((x),[x])-->[]. flinlm((x,a),vs)-->dec,flinlm(a,[x Vs]). flinlm(r(a),vs)-->rdec,flinlm(a,vs). flinlm((a,b),vs)-->dec,{subset_nd_compement_of(vs,as,bs)}, flinlm(a,as), % mbd cnnot go flinlm(b,bs). % to both brnches!!! subset_nd_compement_of([],[],[]). subset_nd_compement_of([x Xs],NewYs,NewZs):- subset_nd_compement_of(xs,ys,zs), pce_eement(x,ys,zs,newys,newzs). pce_eement(x,ys,zs,[x Ys],Zs). pce_eement(x,ys,zs,ys,[x Zs]). Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
19 Liner terms, skeetons of ffine nd iner terms inlm(n,t):-n mod 3=:=1, sum_to(n,hi,lo),hs_no_unused(hi), flinlm(t,[],hi,lo). hs_no_unused(c(l,0,a)):-succ(a,l). % 0 r/1 constructors! Proposition If Motzkin tree with n binry nodes is skeeton of iner mbd term, then it hs excty n + 1 unry nodes, with one on ech pth from the root to its n + 1 ees. ffine: 0,1,2,3,9,30,81,242,838,2799,9365,33616,122937, iner: 0,1,0,0,5,0,0,60,0,0,1105,0,0,27120,0,0, Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
20 K-coored cosed mbd terms Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
21 K-coored cosed mbd terms: ffine terms ++ ntur generiztion of ffine terms: ech mbd cn bind t most k ribe occurrences k-coored mbd terms: sme s BCK(p) terms - with k = p + 1 we, for p>1 they re shoud ctuy be ced BCKW(p)) s the W combintor is needed when mbd binds t est two ribe occurrences... Bodini nd Gittenberger: cosed formu with bout 100+ mth symbos for BCK(2) Proposition Gener mbd terms re computtiony equient to 3-coored mbd terms (i.e., BCK(2) terms). Proof. Conert mbd term to S,K combintors. S nd K use t most two ribes for ech mbd: S = λ f.λ g.λ x.(f x)(g x), K = λ x.λ y.x. Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
22 Generting k-coored cosed mbd terms kcooredcosed(n,x):-kcooredcosed(x,[],n,0). kcooredcosed((i),vs)-->{nth0(i,vs,v),inc_r(v)}. kcooredcosed((k,a),vs)-->, % <= the K-coored mbd binder kcooredcosed(a,[v Vs]), {cose_r(v,k)}. kcooredcosed((a,b),vs)-->, kcooredcosed(a,vs), kcooredcosed(b,vs). inc_r(x):-r(x),!,x=s(_). % count new ribe under the binder inc_r(s(x)):-inc_r(x). cose_r(x,k):-r(x),!,k=0. % cose nd conert to ints cose_r(s(x),sk):-cose_r(x,k),succ(k,sk). Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
23 Exmpes of k-coored cosed mbd terms 3-coored mbd terms of size 3, exhibiting coors 0,1,2.?- kcooredcosed(3,x). X = (0, (0, (1, (0)))) ; X = (0, (1, (0, (1)))) ; X = (1, (0, (0, (2)))) ; X = (2, ((0), (0))). in cosed term with n ppiction nodes, the counts of k-coored mbds must sum up to n + 1 we cn generte binry tree nd then decorte it with mbds stisfying this constrint the constrint hods for cosed subterms, recursiey cn this mechnism reduce the mount of bcktrcking nd cceerte term genertion? Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
24 K-coored mbd terms nd type inference Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
25 Simpy-typed mbd terms: the chenges I The study of the combintori properties of simpy-typed mbd terms is notoriousy hrd. The two most striking fcts tht one might notice when inferring types re: non-monotonicity, s crossing mbd increses the size of the type, whie crossing n ppiction node trims it down greement i unifiction (with occurs check) between the types of ech ribe under mbd Interestingy, to our best knowedge, no SAT or ASP gorithms exist in the iterture tht ttck the combined type inference nd combintori genertion probem for mbd terms, most ikey becuse of the compexity of emuting unifiction-with-occurs-check steps in proposition ogic. Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
26 Simpy-typed mbd terms: the chenges II the symptoticy nishing density of simpy-typed mbd terms in the set of cosed terms een more drmtic in the cse of their norm forms this mkes their -term nd rndom-term genertion incresingy difficut with size s for simpy typed terms, no nytic method is known for estimting the probbiities describing Botzmnn smping, one needs to fiter through the set of cosed mbd terms or norm forms unti typbe term is found it is incresingy computtiony expensie s their density decreses with size bsic combintori properties ike counts for terms of gien size he been obtined so fr ony by generting terms Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
27 Type inference for k-coored terms simpytypedcoored(n,x,t):-simpytypedcoored(x,t,[],n,0). simpytypedcoored((x),t,vss)-->{ member(vs:t0,vss), unify_with_occurs_check(t,t0), ddtobinder(vs,x) }. simpytypedcoored((vs,a),s->t,vss)-->, simpytypedcoored(a,t,[vs:s Vss]), {cosebinder(vs)}. simpytypedcoored((a,b),t,vss)-->, simpytypedcoored(a,(s->t),vss), simpytypedcoored(b,s,vss). ddtobinder(ps,p):-r(ps),!,ps=[p _]. ddtobinder([_ Ps],P):-ddToBinder(Ps,P). cosebinder(xs):-ppend(xs,[],_),!. Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
28 How mny simpy typed terms re 2-coored (i.e., ffine)? simpy typed cosed terms s. ffine cosed terms (og. sce) simpy typed cosed terms ffine cosed terms size Figure: Simpy typed cosed terms nd ffine cosed terms by incresing sizes Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
29 Are coors growing proportion to the og of their type-sizes? 8 g. coors nd type sizes 6 4 g. coors g. type sizes term size Figure: Growth of coors nd type sizes Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
30 most coorfu term: reches the mximum number of coors mx coors mx type size term size Figure: Coors of most coorfu term s. its mximum type size Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
31 Does most coorfu term rech mx type size? type size 40 mx coorfu type mx type term size Figure: Lrgest type size of most coorfu term s. rgest type size Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
32 A two-stge genertion gorithm for typbe nd untypbe skeetons Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
33 Typbe nd untypbe Motzkin skeetons typbe Motzkin tree is one for which it exists simpy-typed cosed term hing it s its skeeton untypbe Motzkin tree is one for which no simpy-typed cosed term exists hing it s its skeeton to efficienty generte these skeetons we wi spit the genertion of mbd terms in two stges the first stge wi generte the unifiction equtions tht need to be soed for type inference s we s the redy to be fied out mbd trees it is conenient to ctuy generte on the fy the code to be executed in the second stge the second stge wi just use Proog s metc to ctite this code Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
34 Generting the executbe eqution set we generte redy to run conjunction of unifiction constrints geneqs(n,x,t,eqs):-geneqs(x,t,[],eqs,true,n,0). geneqs((i),v,[v0 Vs],Es1,Es2)-->{dd_eq(Vs,V0,V,I,Es1,Es2)}. geneqs((a),(s->t),vs,es1,es2)-->,geneqs(a,t,[s Vs],Es1,Es2). geneqs((a,b),t,vs,es1,es3)-->, geneqs(a,(s->t),vs,es1,es2), geneqs(b,s,vs,es2,es3). % soe this eqution s it cn either succeed once, or fi dd_eq([],v0,v,0,es,es):-unify_with_occurs_check(v0,v). % <== dd_eq([v1 Vs],V0,V,I,(e([V0,V1 Vs],V,0,I),Es),Es). e(i,vs,v):-e(vs,v,0,i). e([v0 _],V,N,N):-unify_with_occurs_check(V0,V). e([_ Vs],V,N1,N3):-succ(N1,N2),e(Vs,V,N2,N3). Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
35 Efficient genertion of typbe nd untypbe skeetons we soe the equtions for 2-coored terms to oid bcktrcking Motzkin trees: 1,1,2,4,9,21,51,127,323,835,2188 Type eqution trees: 0,1,1,1,5, 9,17, 55,122,289, 828 we cn generte efficienty typebe nd untypbe skeetons untypbe: Eqs he no soution (their negtion succeeds) typbe: Eqs he t est one soution (no need to compute ) untypbeske(n,ske):-geneqs(n,x,_,eqs),not(eqs),tomotske(x,ske). typbeske(n,ske):-geneqs(n,x,_,eqs),once(eqs),tomotske(x,ske). Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
36 3 typbe nd 3 untypbe Motzkin trees Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
37 Growth of the number of skeetons is simir on og-sce 10 6 skeeton counts (og. sce) typbe skeetons untypbe skeetons skeeton size Figure: typbe s. untypbe skeetons up to size 20 Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
38 Counts of typbe nd untypbe Motzkin skeetons term size typbe skeetons untypbe skeetons Figure: Number of typbe nd untypbe skeetons Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
39 Growth rtes of typbe nd untypbe skeetons 5 4 skeeton growth rtes 3 2 typbe skeetons untypbe skeetons skeeton size Figure: The simir growth rtes of typbe nd untypbe skeetons Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
40 Motzkin trees s. their subset of typbe skeetons 10 6 Motzkin trees nd typbe skeetons (og. sce) Motzkin trees typbe skeetons size Figure: Counts for Motzkin trees nd typbe skeetons for incresing term sizes Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
41 Counts of simpy typed cosed terms s. their skeetons simpy typed cosed terms nd their skeetons (og. sce) simpy typed cosed terms typbe skeetons size Figure: Counts of simpy typed cosed terms nd their skeetons by incresing sizes Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
42 Some reserch questions for future work I As coors bstrct numbers of occurrences of gien binder, whie the ength of the mbd chins in de Bruijn nottion bstrcts wy the number of prmeters of gien function, how do the distributions of these two compementry spects of mbd terms interct? Wht interesting empiric retions exists between coors of mbd terms nd typbiity? Wht retions exist between coors nd the compexity of type expressions? Wht re the best theoretic modes tht rete properties of k-coored simpy-typed terms nd their skeetons to properties of their type expressions? Cn n empiric study of retions between trees representing simpy typed mbd terms, their skeetons nd their types ree interesting properties of the mutipe underying formisms rnging from computtions to proofs in the impiction frgment of intuitionistic ogic? Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
43 Some reserch questions for future work II Wht re the typic properties (size, coors, etc.) of the mbd expressions generted during compition of ctu function progrms? Cn we, by controing the retie weight of the coors fine-tune -term nd rndom term genertors to refect the distributions obsered for mbd terms used s intermedite code in compiers for function nguges? Do bijections between simper fmiies of combintori objects, mbd terms in de Bruijn nottion, their norm forms nd their skeetons proide mens for generting ery rge rndom mbd terms whie owing to seectiey fine-tune the distribution of their constructors? Cn such bijections hep pushing further the size of rndom simpy typed terms nd norm forms generted i new sequenti nd pre gorithms? Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
44 Concusions we he deised bstrction mechnisms tht forget properties of the difficut css of simpy-typed cosed mbd terms to ree equience csses tht re ikey to be esier to grsp with nytic toos some of our findings: bijection between 2-coored terms nd binry trees simpe gorithm for generting ffine nd iner terms efficient genertion of typbe nd untypbe skeetons, with potenti uses s emms in dynmic progrmming gorithms k-coored terms re ikey to be usbe to fine-tune rndom genertors to more cosey mtch coor-distributions of mbd terms representing re progrms the toos used: nguge s simpe s (mosty) Horn Cuse Proog cn hnde eegnty combintori genertion probems when the synergy between sound unifiction, bcktrcking nd DCGs is put t work! Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
45 Questions? Pu Tru ( Uniersity of North Texs ) On k-coored Lmbd Terms nd their Skeetons PADL / 45
On Type-holding and type-repelling lambda-term skeletons, with applications to all-term and random-term generation of simply-typed closed lambda terms
On Type-hoding and type-repeing ambda-term skeetons, with appications to a-term and random-term generation of simpy-typed cosed ambda terms Pau Tarau Department of Computer Science and Engineering Uniersity
More informationQuestion 1 TELE4353. Question 1, cnt d. What is CDMA? Direct Sequence Spread Spectrum System Model. What is direct sequence CDMA?
TELE45 Mobie nd Steite Couniction Systes Tutori 5 week - S 4 Question A ceur obie couniction syste is using direct sequence code diision utipe ccess CDMA technique with coherent binry phse shift keying
More informationstanchion paper roll mandrel base FIGURE P3-12 ramp
1 MCHINE DESIGN - n Integrted pproch stnchion pper ro mndre se FIGURE -1 roem -7 rmp FIGURE -1 roem -8 1-ft grid -0 Run the computer mode CSE for Cse Study (on the CD-ROM in sever nguges) nd move the point
More information(CATALYST GROUP) B"sic Electric"l Engineering
(CATALYST GROUP) B"sic Electric"l Engineering 1. Kirchhoff s current l"w st"tes th"t (") net current flow "t the junction is positive (b) Hebr"ic sum of the currents meeting "t the junction is zero (c)
More informationCHAPTER 2 LITERATURE STUDY
CHAPTER LITERATURE STUDY. Introduction Multipliction involves two bsic opertions: the genertion of the prtil products nd their ccumultion. Therefore, there re two possible wys to speed up the multipliction:
More informationAlgorithms for Memory Hierarchies Lecture 14
Algorithms for emory Hierrchies Lecture 4 Lecturer: Nodri Sitchinv Scribe: ichel Hmnn Prllelism nd Cche Obliviousness The combintion of prllelism nd cche obliviousness is n ongoing topic of reserch, in
More informationFFH and MCFH Spread-Spectrum Wireless Sensor Network Systems Based on the Generalized Approach to Signal Processing
FFH nd MCFH Spred-Spectrum Wireess Sensor Network Systems Bsed on the Generized Approch to Sign Processing JONGHO KIM, JAE HYUN KIM, VYACHESAV UZUKOV, WON SIK YOON, YONG DEAK KIM Digitsis, Inc., 344-,
More informationKirchhoff s Rules. Kirchhoff s Laws. Kirchhoff s Rules. Kirchhoff s Laws. Practice. Understanding SPH4UW. Kirchhoff s Voltage Rule (KVR):
SPH4UW Kirchhoff s ules Kirchhoff s oltge ule (K): Sum of voltge drops round loop is zero. Kirchhoff s Lws Kirchhoff s Current ule (KC): Current going in equls current coming out. Kirchhoff s ules etween
More informationThroughput Performance of Quantized Proportional Fair Scheduling with Adaptive Modulation and Coding
Throughput Performnce of Quntized Proportion Fir Scheduing with Adptive Modution nd Coding Fumio Ishizki nd Gng Uk Hwng Deprtment of Systems Design nd Engineering, Nnzn University, Seto, Jpn Deprtment
More informationMATH 118 PROBLEM SET 6
MATH 118 PROBLEM SET 6 WASEEM LUTFI, GABRIEL MATSON, AND AMY PIRCHER Section 1 #16: Show tht if is qudrtic residue modulo m, nd b 1 (mod m, then b is lso qudrtic residue Then rove tht the roduct of the
More informationFirst Round Solutions Grades 4, 5, and 6
First Round Solutions Grdes 4, 5, nd 1) There re four bsic rectngles not mde up of smller ones There re three more rectngles mde up of two smller ones ech, two rectngles mde up of three smller ones ech,
More informationPolar Coordinates. July 30, 2014
Polr Coordintes July 3, 4 Sometimes it is more helpful to look t point in the xy-plne not in terms of how fr it is horizontlly nd verticlly (this would men looking t the Crtesin, or rectngulr, coordintes
More informationUniversity of North Carolina-Charlotte Department of Electrical and Computer Engineering ECGR 4143/5195 Electrical Machinery Fall 2009
Problem 1: Using DC Mchine University o North Crolin-Chrlotte Deprtment o Electricl nd Computer Engineering ECGR 4143/5195 Electricl Mchinery Fll 2009 Problem Set 4 Due: Thursdy October 8 Suggested Reding:
More informationTopic 20: Huffman Coding
Topic 0: Huffmn Coding The uthor should gze t Noh, nd... lern, s they did in the Ark, to crowd gret del of mtter into very smll compss. Sydney Smith, dinburgh Review Agend ncoding Compression Huffmn Coding
More informationMAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES
MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES Romn V. Tyshchuk Informtion Systems Deprtment, AMI corportion, Donetsk, Ukrine E-mil: rt_science@hotmil.com 1 INTRODUCTION During the considertion
More informationAbacaba-Dabacaba! by Michael Naylor Western Washington University
Abcb-Dbcb! by Michel Nylor Western Wshington University The Abcb structure shows up in n mzing vriety of plces. This rticle explores 10 surprising ides which ll shre this pttern, pth tht will tke us through
More informationMEASURE THE CHARACTERISTIC CURVES RELEVANT TO AN NPN TRANSISTOR
Electricity Electronics Bipolr Trnsistors MEASURE THE HARATERISTI URVES RELEVANT TO AN NPN TRANSISTOR Mesure the input chrcteristic, i.e. the bse current IB s function of the bse emitter voltge UBE. Mesure
More informationMath 116 Calculus II
Mth 6 Clculus II Contents 7 Additionl topics in Integrtion 7. Integrtion by prts..................................... 7.4 Numericl Integrtion.................................... 7 7.5 Improper Integrl......................................
More informationSynchronous Machine Parameter Measurement
Synchronous Mchine Prmeter Mesurement 1 Synchronous Mchine Prmeter Mesurement Introduction Wound field synchronous mchines re mostly used for power genertion but lso re well suited for motor pplictions
More informationLecture 20. Intro to line integrals. Dan Nichols MATH 233, Spring 2018 University of Massachusetts.
Lecture 2 Intro to line integrls Dn Nichols nichols@mth.umss.edu MATH 233, Spring 218 University of Msschusetts April 12, 218 (2) onservtive vector fields We wnt to determine if F P (x, y), Q(x, y) is
More informationEE Controls Lab #2: Implementing State-Transition Logic on a PLC
Objective: EE 44 - Controls Lb #2: Implementing Stte-rnsition Logic on PLC ssuming tht speed is not of essence, PLC's cn be used to implement stte trnsition logic. he dvntge of using PLC over using hrdwre
More informationExample. Check that the Jacobian of the transformation to spherical coordinates is
lss, given on Feb 3, 2, for Mth 3, Winter 2 Recll tht the fctor which ppers in chnge of vrible formul when integrting is the Jcobin, which is the determinnt of mtrix of first order prtil derivtives. Exmple.
More informationDomination and Independence on Square Chessboard
Engineering nd Technology Journl Vol. 5, Prt, No. 1, 017 A.A. Omrn Deprtment of Mthemtics, College of Eduction for Pure Science, University of bylon, bylon, Irq pure.hmed.omrn@uobby lon.edu.iq Domintion
More informationBenders Decomposition for Capacity Expansion Planning with Network Constraints and Uncertain Demand: the Spanish Case
Benders Decomposition for Cpcity Expnsion Pnning with Network Constrints nd Uncertin Demnd: the Spnish Cse Fco. Aberto Cmpos #1 José Vir # # Institute for Reserch in Technoogy Technic Schoo of Engineering
More informationModule 9. DC Machines. Version 2 EE IIT, Kharagpur
Module 9 DC Mchines Version EE IIT, Khrgpur esson 40 osses, Efficiency nd Testing of D.C. Mchines Version EE IIT, Khrgpur Contents 40 osses, efficiency nd testing of D.C. mchines (esson-40) 4 40.1 Gols
More information9.4. ; 65. A family of curves has polar equations. ; 66. The astronomer Giovanni Cassini ( ) studied the family of curves with polar equations
54 CHAPTER 9 PARAMETRIC EQUATINS AND PLAR CRDINATES 49. r, 5. r sin 3, 5 54 Find the points on the given curve where the tngent line is horizontl or verticl. 5. r 3 cos 5. r e 53. r cos 54. r sin 55. Show
More informationLECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY
LECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY 1. Bsic roerties of qudrtic residues We now investigte residues with secil roerties of lgebric tye. Definition 1.1. (i) When (, m) 1 nd
More informationi INDEX PANEL DOOR TECHNICAL DATA
i INDEX January, 2008 DESCRIPTION PGE(S) E6...1 E62T...2 E62FNVS...3 E6HGS...4 Half Glass 9-ite Conversion Kits...5 E6 8'0" High...6 E8...7 E6 wide...8 2P, 2P, 2PP High Definition panel...9 ii Notes pril
More informationExercise 1-1. The Sine Wave EXERCISE OBJECTIVE DISCUSSION OUTLINE. Relationship between a rotating phasor and a sine wave DISCUSSION
Exercise 1-1 The Sine Wve EXERCISE OBJECTIVE When you hve completed this exercise, you will be fmilir with the notion of sine wve nd how it cn be expressed s phsor rotting round the center of circle. You
More informationDataflow Language Model. DataFlow Models. Applications of Dataflow. Dataflow Languages. Kahn process networks. A Kahn Process (1)
The slides contin revisited mterils from: Peter Mrwedel, TU Dortmund Lothr Thiele, ETH Zurich Frnk Vhid, University of liforni, Riverside Dtflow Lnguge Model Drsticlly different wy of looking t computtion:
More informationApplication Note. Differential Amplifier
Appliction Note AN367 Differentil Amplifier Author: Dve n Ess Associted Project: Yes Associted Prt Fmily: CY8C9x66, CY8C7x43, CY8C4x3A PSoC Designer ersion: 4. SP3 Abstrct For mny sensing pplictions, desirble
More informationOn the Description of Communications Between Software Components with UML
On the Description of Communictions Between Softwre Components with UML Zhiwei An Dennis Peters Fculty of Engineering nd Applied Science Memoril University of Newfoundlnd St. John s NL A1B 3X5 zhiwei@engr.mun.c
More informationECE 274 Digital Logic. Digital Design. Datapath Components Shifters, Comparators, Counters, Multipliers Digital Design
ECE 27 Digitl Logic Shifters, Comprtors, Counters, Multipliers Digitl Design..7 Digitl Design Chpter : Slides to ccompny the textbook Digitl Design, First Edition, by Frnk Vhid, John Wiley nd Sons Publishers,
More informationSequential Logic (2) Synchronous vs Asynchronous Sequential Circuit. Clock Signal. Synchronous Sequential Circuits. FSM Overview 9/10/12
9//2 Sequentil (2) ENGG5 st Semester, 22 Dr. Hden So Deprtment of Electricl nd Electronic Engineering http://www.eee.hku.hk/~engg5 Snchronous vs Asnchronous Sequentil Circuit This Course snchronous Sequentil
More informationSynchronous Machine Parameter Measurement
Synchronous Mchine Prmeter Mesurement 1 Synchronous Mchine Prmeter Mesurement Introduction Wound field synchronous mchines re mostly used for power genertion but lso re well suited for motor pplictions
More informationSynchronous Generator Line Synchronization
Synchronous Genertor Line Synchroniztion 1 Synchronous Genertor Line Synchroniztion Introduction One issue in power genertion is synchronous genertor strting. Typiclly, synchronous genertor is connected
More informationExperiment 3: Non-Ideal Operational Amplifiers
Experiment 3: Non-Idel Opertionl Amplifiers Fll 2009 Equivlent Circuits The bsic ssumptions for n idel opertionl mplifier re n infinite differentil gin ( d ), n infinite input resistnce (R i ), zero output
More informationExperiment 8 Series DC Motor (II)
Ojectives To control the speed of loded series dc motor y chnging rmture voltge. To control the speed of loded series dc motor y dding resistnce in prllel with the rmture circuit. To control the speed
More informationHomework #1 due Monday at 6pm. White drop box in Student Lounge on the second floor of Cory. Tuesday labs cancelled next week
Announcements Homework #1 due Mondy t 6pm White drop ox in Student Lounge on the second floor of Cory Tuesdy ls cncelled next week Attend your other l slot Books on reserve in Bechtel Hmley, 2 nd nd 3
More informationCS 135: Computer Architecture I. Boolean Algebra. Basic Logic Gates
Bsic Logic Gtes : Computer Architecture I Boolen Algebr Instructor: Prof. Bhgi Nrhri Dept. of Computer Science Course URL: www.ses.gwu.edu/~bhgiweb/cs35/ Digitl Logic Circuits We sw how we cn build the
More informationLab 8. Speed Control of a D.C. motor. The Motor Drive
Lb 8. Speed Control of D.C. motor The Motor Drive Motor Speed Control Project 1. Generte PWM wveform 2. Amplify the wveform to drive the motor 3. Mesure motor speed 4. Mesure motor prmeters 5. Control
More informationElectronic Circuits I - Tutorial 03 Diode Applications I
Electronic Circuits I - Tutoril 03 Diode Applictions I -1 / 9 - T & F # Question 1 A diode cn conduct current in two directions with equl ese. F 2 When reverse-bised, diode idelly ppers s short. F 3 A
More informationEnergy Harvesting Two-Way Channels With Decoding and Processing Costs
IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING, VOL., NO., MARCH 07 3 Energy Hrvesting Two-Wy Chnnels With Decoding nd Processing Costs Ahmed Arf, Student Member, IEEE, Abdulrhmn Bknin, Student
More informationOn lambda-term skeletons, with applications to all-term and random-term generation of simply-typed closed lambda terms
On mbd-trm sktons, with ppitions to -trm nd rndom-trm gnrtion of simpy-typd osd mbd trms Pu Tru Dprtmnt of Computr Sin nd Enginring Unirsity of North Txs pu.tru@unt.du ABSTRACT Lmbd trms in d Bruijn nottion
More information10.4 AREAS AND LENGTHS IN POLAR COORDINATES
65 CHAPTER PARAMETRIC EQUATINS AND PLAR CRDINATES.4 AREAS AND LENGTHS IN PLAR CRDINATES In this section we develop the formul for the re of region whose oundry is given y polr eqution. We need to use the
More informationUnderstanding Basic Analog Ideal Op Amps
Appliction Report SLAA068A - April 2000 Understnding Bsic Anlog Idel Op Amps Ron Mncini Mixed Signl Products ABSTRACT This ppliction report develops the equtions for the idel opertionl mplifier (op mp).
More informationMath Circles Finite Automata Question Sheet 3 (Solutions)
Mth Circles Finite Automt Question Sheet 3 (Solutions) Nickols Rollick nrollick@uwterloo.c Novemer 2, 28 Note: These solutions my give you the nswers to ll the prolems, ut they usully won t tell you how
More informationHawk 3 H335 and H345 3½ Digit and 4½ Digit Advanced Digital Controller OPERATOR S MANUAL
Hwk 3 H335 nd H345 3½ Digit nd 4½ Digit Advnced Digit Controer OPERATOR S MANUAL SIMPSON ELECTRIC COMPANY 520 Simpson Avenue Lc du Fmbeu, WI 54538-0099 (715) 588-3311 FAX (715) 588-3326 Printed in U.S.A.
More informationRealizing Site Permutations
CCCG 2011, Toronto ON, August 10 12, 2011 Relizing Site Permuttions Stephne Durocher Seed Mehrbi Debjyoti Mondl Mtthew Skl Abstrct Gien n fixed sites on the plne, there re seerl wys to determine permuttion
More informationStudent Book SERIES. Patterns and Algebra. Name
E Student Book 3 + 7 5 + 5 Nme Contents Series E Topic Ptterns nd functions (pp. ) identifying nd creting ptterns skip counting completing nd descriing ptterns predicting repeting ptterns predicting growing
More informationRIGHT-ANGLED TRIANGULAR PATCH RESONATOR AND FILTER WITH FRACTAL HOLE
Progress In Eectromgnetics Reserch B, Vo. 4, 141 158, 212 RIGHT-ANGED TRIANGUAR PATCH RESONATOR AND FITER WITH FRACTA HOE J.-K. Xio 1, 2, *, X.-P. Zu 3, X. i 3, nd. Tin 3 1 Schoo of Eectronic & mechnic
More informationPB-735 HD DP. Industrial Line. Automatic punch and bind machine for books and calendars
PB-735 HD DP Automtic punch nd bind mchine for books nd clendrs A further step for the utomtion of double loop binding. A clever nd flexible mchine ble to punch nd bind in line up to 9/16. Using the best
More informationVector Calculus. 1 Line Integrals
Vector lculus 1 Line Integrls Mss problem. Find the mss M of very thin wire whose liner density function (the mss per unit length) is known. We model the wire by smooth curve between two points P nd Q
More informationThe Math Learning Center PO Box 12929, Salem, Oregon Math Learning Center
Resource Overview Quntile Mesure: Skill or Concept: 300Q Model the concept of ddition for sums to 10. (QT N 36) Model the concept of sutrction using numers less thn or equl to 10. (QT N 37) Write ddition
More informationStudent Book SERIES. Fractions. Name
D Student Book Nme Series D Contents Topic Introducing frctions (pp. ) modelling frctions frctions of collection compring nd ordering frctions frction ingo pply Dte completed / / / / / / / / Topic Types
More informationISSCC 2006 / SESSION 21 / ADVANCED CLOCKING, LOGIC AND SIGNALING TECHNIQUES / 21.5
21.5 A 1.1GHz Chrge-Recovery Logic Visvesh Sthe, Jung-Ying Chueh, Mrios Ppefthymiou University of Michign, Ann Aror, MI Boost Logic is chrge-recovery circuit fmily cple of operting t GHz-clss frequencies
More informationDiffraction and Interference. 6.1 Diffraction. Diffraction grating. Diffraction grating. Question. Use of a diffraction grating in a spectrometer
irction nd Intererence 6.1 irction irction grting Circulr dirction irction nd intererence re similr phenomen. Intererence is the eect o superposition o 2 coherent wves. irction is the superposition o mny
More informationCongruences for Stirling Numbers of the Second Kind Modulo 5
Southest Asin Bulletin of Mthemtics (2013 37: 795 800 Southest Asin Bulletin of Mthemtics c SEAMS. 2013 Congruences for Stirling Numbers of the Second Kind Modulo 5 Jinrong Zho School of Economic Mthemtics,
More informationExperiment 3: Non-Ideal Operational Amplifiers
Experiment 3: Non-Idel Opertionl Amplifiers 9/11/06 Equivlent Circuits The bsic ssumptions for n idel opertionl mplifier re n infinite differentil gin ( d ), n infinite input resistnce (R i ), zero output
More informationSeven Sisters. Visit for video tutorials
Seven Sisters This imge is from www.quiltstudy.org. Plese visit this website for more informtion on Seven Sisters quilt ptterns. Visit www.blocloc.com for video tutorils 1 The Seven Sisters design cn be
More informationRegular languages can be expressed as regular expressions.
Regulr lnguges cn e expressed s regulr expressions. A generl nondeterministic finite utomton (GNFA) is kind of NFA such tht: There is unique strt stte nd is unique ccept stte. Every pir of nodes re connected
More informationSecret Key Generation and Agreement in UWB Communication Channels
Secret Key Genertion nd greement in UW Communiction Chnnels Msoud Ghoreishi Mdiseh, Michel L. McGuire, Stephen S. Neville, Lin Ci, Michel Horie Deprtment of Electricl nd Computer Engineering University
More informationNONCLASSICAL CONSTRUCTIONS II
NONLSSIL ONSTRUTIONS II hristopher Ohrt UL Mthcircle - Nov. 22, 2015 Now we will try ourselves on oncelet-steiner constructions. You cn only use n (unmrked) stright-edge but you cn ssume tht somewhere
More informationGeometric quantities for polar curves
Roerto s Notes on Integrl Clculus Chpter 5: Bsic pplictions of integrtion Section 10 Geometric quntities for polr curves Wht you need to know lredy: How to use integrls to compute res nd lengths of regions
More information(1) Primary Trigonometric Ratios (SOH CAH TOA): Given a right triangle OPQ with acute angle, we have the following trig ratios: ADJ
Tringles nd Trigonometry Prepred y: S diyy Hendrikson Nme: Dte: Suppose we were sked to solve the following tringles: Notie tht eh tringle hs missing informtion, whih inludes side lengths nd ngles. When
More informationThe Discussion of this exercise covers the following points:
Exercise 4 Bttery Chrging Methods EXERCISE OBJECTIVE When you hve completed this exercise, you will be fmilir with the different chrging methods nd chrge-control techniques commonly used when chrging Ni-MI
More informationSpiral Tilings with C-curves
Spirl Tilings with -curves Using ombintorics to Augment Trdition hris K. Plmer 19 North Albny Avenue hicgo, Illinois, 0 chris@shdowfolds.com www.shdowfolds.com Abstrct Spirl tilings used by rtisns through
More informationBUBBLE BOBBLE 1 o C r t n o s l 2 t e G t g n i a t S r d e t 3 a B s c i Pl y a 4 a G m S e r c e n e 5 in r Sco g 6 ms e It 7 a P s s o w d r
BUBBLE BOBBLE 1 Control s 2 Gettin g Strted 3 Bsc i Ply 4 Gm e Sce r en 5 Scoring 6 Items 7 Psswor d 1 Control s Bsic Controls Move left pssword Jump Blow s Confirm/Puse/Resume Menu nd right/enter nvigtion
More informationCompared to generators DC MOTORS. Back e.m.f. Back e.m.f. Example. Example. The construction of a d.c. motor is the same as a d.c. generator.
Compred to genertors DC MOTORS Prepred by Engr. JP Timol Reference: Electricl nd Electronic Principles nd Technology The construction of d.c. motor is the sme s d.c. genertor. the generted e.m.f. is less
More informationImproving the Active Power Filter Performance with a Prediction Based Reference Generation
Improving the Active Power Fiter Performance with a Prediction Based Reference Generation M. Routimo, M. Sao and H. Tuusa Abstract In this paper a current reference generation method for a votage source
More informationb = and their properties: b 1 b 2 b 3 a b is perpendicular to both a and 1 b = x = x 0 + at y = y 0 + bt z = z 0 + ct ; y = y 0 )
***************** Disclimer ***************** This represents very brief outline of most of the topics covered MA261 *************************************************** I. Vectors, Lines nd Plnes 1. Vector
More informationUnderstanding The HA2500 Horizontal Output Load Test
Understanding The HA2500 Horizonta Output Load Test Horizonta output stages are part of every CRT video dispay incuding cosed circuit monitors, computer monitors, video games, medica monitors, TVs. HDTVs,
More informationDESIGN OF CONTINUOUS LAG COMPENSATORS
DESIGN OF CONTINUOUS LAG COMPENSATORS J. Pulusová, L. Körösi, M. Dúbrvská Institute of Robotics nd Cybernetics, Slovk University of Technology, Fculty of Electricl Engineering nd Informtion Technology
More informationMake Your Math Super Powered
Mke Your Mth Super Powered: Use Gmes, Chllenges, nd Puzzles Where s the fun? Lern Mth Workshop model by prticipting in one nd explore fun nocost/low-cost gmes nd puzzles tht you cn esily bring into your
More informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
Hll Ticket No Question Pper Code: AEC009 INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigl, Hyderd - 500 043 MODEL QUESTION PAPER Four Yer B.Tech V Semester End Exmintions, Novemer - 2018 Regultions:
More informationStudy on SLT calibration method of 2-port waveguide DUT
Interntionl Conference on Advnced Electronic cience nd Technology (AET 206) tudy on LT clibrtion method of 2-port wveguide DUT Wenqing Luo, Anyong Hu, Ki Liu nd Xi Chen chool of Electronics nd Informtion
More informationSection 2.2 PWM converter driven DC motor drives
Section 2.2 PWM converter driven DC motor drives 2.2.1 Introduction Controlled power supply for electric drives re obtined mostly by converting the mins AC supply. Power electronic converter circuits employing
More informationInformation-Coupled Turbo Codes for LTE Systems
Informtion-Coupled Turbo Codes for LTE Systems Lei Yng, Yixun Xie, Xiowei Wu, Jinhong Yun, Xingqing Cheng nd Lei Wn rxiv:709.06774v [cs.it] 20 Sep 207 Abstrct We propose new clss of informtion-coupled
More informationSeries. Teacher. Numbers
Series B Techer Copyright 2009 3P Lerning. All rights reserved. First edition printed 2009 in Austrli. A ctlogue record for this book is vilble from 3P Lerning Ltd. ISBN 978-1-921860-17-1 Ownership of
More informationChapter 2 Literature Review
Chpter 2 Literture Review 2.1 ADDER TOPOLOGIES Mny different dder rchitectures hve een proposed for inry ddition since 1950 s to improve vrious spects of speed, re nd power. Ripple Crry Adder hve the simplest
More informationExperiment 3: The research of Thevenin theorem
Experiment 3: The reserch of Thevenin theorem 1. Purpose ) Vlidte Thevenin theorem; ) Mster the methods to mesure the equivlent prmeters of liner twoterminl ctive. c) Study the conditions of the mximum
More informationDirect Current Circuits. Chapter Outline Electromotive Force 28.2 Resistors in Series and in Parallel 28.3 Kirchhoff s Rules 28.
P U Z Z L E R If ll these pplinces were operting t one time, circuit reker would proly e tripped, preventing potentilly dngerous sitution. Wht cuses circuit reker to trip when too mny electricl devices
More informationEfficient and Resilient Key Discovery based on Pseudo-Random Key Pre-Deployment
Efficient nd Resilient Key Discovery sed on Pseudo-Rndom Key Pre-Deployment p. 1 Efficient nd Resilient Key Discovery sed on Pseudo-Rndom Key Pre-Deployment Roerto Di Pietro, Luigi V. Mncini, nd Alessndro
More informationHow to Build Wealth Like Warren Buffett.
Your FREE gift for ordering How to Build Welth Like Wrren Buffett The video ABC-TV clled lively, informtive, nd lot of fun. You cn t help but get swept up by the enthusism of this rewrding film. Don t
More informationExponential-Hyperbolic Model for Actual Operating Conditions of Three Phase Arc Furnaces
Americn Journl of Applied Sciences 6 (8): 1539-1547, 2009 ISSN 1546-9239 2009 Science Publictions Exponentil-Hyperbolic Model for Actul Operting Conditions of Three Phse Arc Furnces 1 Mhdi Bnejd, 2 Rhmt-Allh
More informationSection 16.3 Double Integrals over General Regions
Section 6.3 Double Integrls over Generl egions Not ever region is rectngle In the lst two sections we considered the problem of integrting function of two vribles over rectngle. This sitution however is
More informationHYDAC KineSys Controls for Hydraulic Presses
HYDC KineSys Contros for Hydruic resses E 0.46.3.0 / 0.6 Sfe Contro Strtegies: From Contro Mnifods to Entire Systems Your rofession rtner for Expertise in Sfe Hydruic ress Contros With over 8,000 empoyees
More informationSamantha s Strategies page 1 of 2
Unit 1 Module 2 Session 3 Smnth s Strtegies pge 1 of 2 Smnth hs been working with vriety of multiplition strtegies. 1 Write n expression to desribe eh of the sttements Smnth mde. To solve 18 20, I find
More informationDirect AC Generation from Solar Cell Arrays
Missouri University of Science nd Technology Scholrs' Mine UMR-MEC Conference 1975 Direct AC Genertion from Solr Cell Arrys Fernndo L. Alvrdo Follow this nd dditionl works t: http://scholrsmine.mst.edu/umr-mec
More informationA Development of Earthing-Resistance-Estimation Instrument
A Development of Erthing-Resistnce-Estimtion Instrument HITOSHI KIJIMA Abstrct: - Whenever erth construction work is done, the implnted number nd depth of electrodes hve to be estimted in order to obtin
More informationConvolutional Networks. Lecture slides for Chapter 9 of Deep Learning Ian Goodfellow
Convolutionl Networks Lecture slides for Chpter 9 of Deep Lerning In Goodfellow 2016-09-12 Convolutionl Networks Scle up neurl networks to process very lrge imges / video sequences Sprse connections Prmeter
More informationDigital Design. Chapter 1: Introduction
Digitl Design Chpter : Introduction Slides to ccompny the textbook Digitl Design, with RTL Design, VHDL, nd Verilog, 2nd Edition, by, John Wiley nd Sons Publishers, 2. http://www.ddvhid.com Copyright 2
More informationAlgebra Practice. Dr. Barbara Sandall, Ed.D., and Travis Olson, M.S.
By Dr. Brr Sndll, Ed.D., Dr. Melfried Olson, Ed.D., nd Trvis Olson, M.S. COPYRIGHT 2006 Mrk Twin Medi, Inc. ISBN 978-1-58037-754-6 Printing No. 404042-EB Mrk Twin Medi, Inc., Pulishers Distriuted y Crson-Dellos
More informationLecture 16: Four Quadrant operation of DC Drive (or) TYPE E Four Quadrant chopper Fed Drive: Operation
Lecture 16: Four Qudrnt opertion of DC Drive (or) TYPE E Four Qudrnt chopper Fed Drive: Opertion The rmture current I is either positive or negtive (flow in to or wy from rmture) the rmture voltge is lso
More informationThree-Phase Synchronous Machines The synchronous machine can be used to operate as: 1. Synchronous motors 2. Synchronous generators (Alternator)
Three-Phse Synchronous Mchines The synchronous mchine cn be used to operte s: 1. Synchronous motors 2. Synchronous genertors (Alterntor) Synchronous genertor is lso referred to s lterntor since it genertes
More informationA COMPARISON OF CIRCUIT IMPLEMENTATIONS FROM A SECURITY PERSPECTIVE
A COMPARISON OF CIRCUIT IMPLEMENTATIONS FROM A SECURITY PERSPECTIVE Mster Thesis Division of Electronic Devices Deprtment of Electricl Engineering Linköping University y Timmy Sundström LITH-ISY-EX--05/3698--SE
More informationRedundancy Data Elimination Scheme Based on Stitching Technique in Image Senor Networks
Sensors & Trnsducers 204 by IFSA Publishing, S. L. http://www.sensorsportl.com Redundncy Dt Elimintion Scheme Bsed on Stitching Technique in Imge Senor Networks hunling Tng hongqing Technology nd Business
More informationTHE TRADEOFF BETWEEN DIVERSITY GAIN AND INTERFERENCE SUPPRESSION VIA BEAMFORMING IN
THE TRADEOFF BETWEEN DIVERSITY GAIN AND INTERFERENCE SUPPRESSION VIA BEAMFORMING IN A CDMA SYSTEM Yan Zhang, Laurence B. Mistein, and Pau H. Siege Department of ECE, University of Caifornia, San Diego
More informationA Stochastic Geometry Approach to the Modeling of DSRC for Vehicular Safety Communication
A Stochstic Geometry Approch to the Modeling of DSRC for Vehiculr Sfety Communiction Zhen Tong, Student Member, IEEE, Hongsheng Lu 2, Mrtin Henggi, Fellow, IEEE, nd Christin Poellbuer 2, Senior Member,
More informationY9.ET1.3 Implementation of Secure Energy Management against Cyber/physical Attacks for FREEDM System
Y9.ET1.3 Implementtion of Secure Energy ngement ginst Cyber/physicl Attcks for FREED System Project Leder: Fculty: Students: Dr. Bruce cillin Dr. o-yuen Chow Jie Dun 1. Project Gols Develop resilient cyber-physicl
More information