n j c ij n i complement
|
|
- Bertram Hopkins
- 5 years ago
- Views:
Transcription
1 Computng Observablty Don't Cares Ecently through Polarzaton Harm rts, Mchel Berkelaar and Koen van Ejk bstract new method s presented to compute the exact observablty don't cares (ODCs) for multple-level combnatonal crcuts. new mathematcal concept, called polarzaton, s ntroduced. Polarzaton captures the essence of ODC calculaton on the otherwse dcult ponts of reconvergence. It makes t possble to derve the ODC of a node from the ODCs of ts fanouts wth a very smple formula. Expermental results for the 39 largest MCNC benchmark examples show that the method s able to compute the ODC set (expressed as a Boolean network) for all but one crcut n at most a few seconds. Keywords Logc Synthess, Don't Cares I. Introducton Observablty don't cares (ODCs) play a central role n the synthess of Boolean networks. Together wth the external don't cares (EDCs) and the satsablty don't cares (SDCs) they represent the freedom one has to optmze the network. Especally the computaton of the ODCs has been topc of research because of ts complexty. Several papers have been publshed on the subject of ODC calculaton. In [], Bartlett et al. propose to calculate the ODCs by attenng the network. Ths s, however, mpractcal for most crcuts, because of the sze needed for the representaton. In [7], Muroga et al. propose exhaustve smulatons, whch s very tme consumng. To reduce computatonal complexty t was proposed to calculate the ODC of a node from the ODCs of ts drect fanouts n [4] by Brayton et al. However, computng the ODC n ths way s not straght-forward n the presence of reconvergent fanouts. To solve ths problem, [4] proposes usng the chan rule, orgnally ntroduced by Chang et al. n [5]. s t turns out, the use of ths rule results n very complex calculatons very quckly, so [4] proposes usng approxmatons for large crcuts. In [6], Daman et al. present a method whch s computatonally less complex, but stll approxmatons are needed for the larger crcuts. In [8], Savoj et al. use an observablty relaton to calculate the ODCs. lthough the method does not need to calculate the ODC for each prmary output separately, the operatons per node are much more complex. The paper tself does not present any results, but the authors themselves comment [9]: \We mplemented the algorthm of the ICCD paper but the algorthm was not practcal for large crcuts. We concluded that ODCs could be usually [only] computed for crcuts that were collapsble n two levels". Harm rts (emal: harm@ambt.com) s wth mbt Desgn Systems Inc, 25 ugustne Drve, Ste. 2, Santa Clara, C Mchel Berkelaar (emal: m.r.c.m.berkelaar@ele.tue.nl) and Koen van Ejk (emal: c.a.j.v.ejk@ele.tue.nl) are wth the Endhoven Unversty of Technology, Dept. of EE, P.O. Box 53, 56 MB Endhoven, the Netherlands. In ths paper we present a method whch also derves the ODC of a node from the ODCs of ts drect fanouts and also does not need to calculate the ODC for each prmary output separately, but the operatons per node are very smple: only an and over the ODCs of the fanouts, and a cofactor operaton are needed. Ths s obtaned by ntroducng the concept of polarzaton. For each node the Polarzed Observablty Don't Care (PODC) s calculated. The polarzaton exactly models the reconvergence n a network such that cofactorng the PODC wll \expand" and/or \shrnk" the PODC such that the resultng ODC wll be correct. We feel the man contrbuton of ths paper s the smple mathematcal formulaton of the constructon of the ODC network wth the use of the PODCs wthout the explct use of xor or xnor operatons. nother contrbuton s the large results table. ll prevously publshed papers mentoned above are ether completely theoretcal or show very few results, whch leaves no room for comparson of derent methods. Our results secton shows that the complete ODC network can be derved wth our method even for large crcuts, and allows future papers to compare ther results to ours. nother advantage of the method presented n ths paper s that t makes the use of EDCs very smple. The PODCs calculated at the nput of a network can be handed over as EDCs to a feedng network drectly, representng the complete EDC. These PODCs also drectly mply the Boolean relatons for the equvalence classes [3][6], as s shown n secton IV. In ths paper we express the ODCs as a Boolean network. Ths network can be used drectly by the synthess system [2]. lternatvely, the ODCs could be expressed n other representatons sutable for Boolean reasonng, such as BDDs, but ths approach s not tested n ths paper. The method s mplemented and tested on the entre set of MCNC combnatonal multple-level benchmarks. II. Defntons and Notaton ODCs are commonly calculated usng a Boolean network [] to model a combnatonal crcut. In a Boolean network, each node s assocated wth a Boolean expresson (eg. a Sum Of Cubes (SOC) expresson) n terms of ts fann nodes (or fann edges). In ths paper, we wll use a network of factored forms. In such a network each node s assocated wth a smple and or or expresson, and nverters are modeled on the edges. Ths s no lmtaton snce any Boolean expresson tself s also a factored form. The advantage of usng a network of factored forms s that there s no mplct reconvergence, whch s clearly of great mportance when calculatng ODCs.
2 multple-output combnatonal crcut s modeled by a network of factored forms. The network can be speced by an acyclc graph G (N; C) (see gure ). Each node n 2 N represents ether a prmary nput or a basc Boolean operaton,.e. an and or an or operaton. There s a drected edge c j 2 C for each connecton from node n to node n j. Each connecton can have an nverter property. The prmary nput (output) nodes n N are dented by the set of ndces I (O). prmary nput (output) does not have any ncomng (outgong) edges. Denton 5: The transtve fanout s dened recursvely: T F O(p) F O(p) [ q2f O(p) T F O(q) We say that functon f p depends on every varable whch s n ts transtve fann. Denton 6: Cofactorng a functon to a varable or ts complement: c j n j fj vp f(v p ) fj vp f(v p ) n complement III. Observablty don't cares The ODC of varable v p at node n k s a Boolean functon whch gves the condtons for whch the actual value of varable v p can not be observed at node n k. Denton 7: The ODC of varable v p at node n k : Fg.. Nodes and connectons We dene two functons: Denton : OP : N n I! f; g returns the operaton represented by node n. INV : C! fflse; TRUEg returns TRUE f c has an nverter property. Varable v denotes the varable at the output of node n. Snce we want to be able to dstngush between the value at the output of a node and the value whch s at the nput of a connected node (see gure ), we also ntroduce varables for all connectons: v j denotes the varable at nput c j of node n j. The letters p and q wll be used to denote ether an ndex or an ndex par, so varable v p can denote ether a node or a connecton varable. Denton 2: The fann of a node: F I(j) fjjc j 2 Cg The fann of a connecton: F I(j) Denton 3: The fanout of a node: F O() fjjc j 2 Cg The fanout of a connecton: F O(j) j The Boolean functon f of a node or a connecton can be derved usng the followng rules: nd: f j P Q j2f I(j) v j f OP (j) j2f I(j) v j f OP (j) f j v f INV (j) FLSE v f INV (j) TRUE: Denton 4: The transtve fann s dened recursvely: T F I(p) F I(p) [ q2f I(p) T F I(q) ODC k p f k j vp f k j vp where s the xnor operator. The ODC of a varable at all prmary outputs s a Boolean functon whch gves the condtons for whch the actual value of the varable can not be observed at any prmary output. Denton 8: The ODC of varable v p at all prmary outputs: ODC p k2o ODC k p Creatng the ODC as a network of factored forms, usng these dentons, s relatvely smple, but the resultng network turns out to be very complex for many crcuts. s a result the calculaton of the ODC n ths way, by expressng t n SOC or BDDs, be t n terms of prmary nputs or local varables, s known to be computatonally very expensve []. Dervng the ODC of a node from the ODCs of ts drect fanouts, to reduce the computatonal complexty, has been topc of research before. The ODC of a varable v j can be derved easly from the ODC of varable v j and the local ODC at node n : ODC k j ODC k j ODC j j () However, dervng the ODC of a varable v from the ODCs of ts fanout varables v j s much more dcult f the number of fanouts s more than one. Use of the chan rule [5] has been proposed by [], but t becomes already very expensve for nodes wth only two fanouts. Suppose: F O() fj ; j g
3 then: ~f p (v ; : : : ; v n ) f p (~v ; : : : ; ~v n ) ODC k ODCj k ODCj k ODCj k j vj ODCj k j vj (2) In [6] a new method was presented whch needs substantally fewer xor operatons and no hgher order dervatves. Suppose: then: ODC k F O() fj ; j ; : : : ; j n g nk m ODC k j m j vj ;:::;v jm? ;v jm ;:::;v jn (3) Ths formula stll results n such a complex ODC that n practce (less complex) approxmatons of the ODC must be used. [8] ntroduced a method whch does not need the and operaton over all outputs (see denton 8). Let: ODC X j2onfg v j g j for all 2 O where g j represents the global functon of output n j n terms of the prmary nputs. Suppose: and: then: O F O() fj ; j ; : : : ; j n g O m (v jm O m? )ODC jm j vjm ;:::;v jn O m? ODC jm j vjm ;:::;v jn ODC O n j v O n j v (4) lthough [8] does not need the and operator over all prmary outputs, the operatons needed per fanout are more complex. The paper does not report expermental results. The method presented n ths paper makes t possble to calculate the ODC wthout the use of any (explct) x(n)or operatons and also wthout the and operaton over all outputs. The resultng network of factored forms s substantally less complex. IV. Polarzed observablty don't cares To calculate the ODC n a new and more ecent way we rst have to ntroduce a new operator: polarzaton. Denton 9: The polarzaton operator appled to varable v ntroduces a new varable ~v such that ~v v. Denton : The polarzed Boolean functon ~ f p s assocated wth lteral ~v p and s dened as: Polarzaton of a varable can be seen as the \twnnng" of a varable. Note that the twn of a twn of a varable s the varable tself. Consstently, a polarzed functon (network) can be seen as a twn copy of the orgnal functon (network), usng the twn copes of ts varables. The only derence we wll assume between the orgnal and ts twn s ther behavor under the cofactor operator. Cofactorng a polarzed varable wll evaluate to the opposte constant value as ts non-polarzed twn. So, we extend the denton of cofactorng to polarzed Boolean functons. Denton : fj vp f(v p ; ~v p ) fj vp f(v p ; ~v p ) Instead of explctly copyng a network to obtan ts twn, we can also model polarzaton as an edge property (see gure 2). So, f we want to calculate fj vp n a multple-level network, any varable v p whch s on a path from f to v wth an even number of polarzatons has to be substtuted wth constant. ny varable v p on such a path wth an odd number of polarzatons has to be substtuted wth constant. The followng property follows from these dentons: fj v ( fj g~ v ), whle fj v ( fj v ) Furthermore we need a way to remove all polarzatons from a network. Denton 2: Remove polarty: ]f f (~v p v p ) for all p 2 T F I(f ) Polarzaton s used to mark factors n a network, such that they wll cofactor to the opposte value as would be the case normally. For example, f we have f g h ~ (see gure 2) wth g and h not polarzed, then fj a gj a hj ~ a g(a ) h(a ~ ) and ](fj a ) ] g(a ) h(a ~ ) g(a ) h(a ) gj a hj a. Usng these dentons we can rewrte the denton of the ODC (dentons 7 and 8) as follows: ODC p ] k2o (f k ~ f k )j vp (5) Now we wll dene the Polarzed Observablty Don't Care (PODC). It s dened recursvely, so t can be constructed for all nodes by traversng the network from the outputs to the nputs n topologcal order. It wll be proved that f the PODC s cofactored and the polarzaton s removed, then t wll be equal to the ODC. Frst we dene the PODC of a prmary output (n the case that there are no external don't cares speced). Denton 3: P ODC for all 2 O
4 h g f h ~ g ~ Denton 5: P ODC j2f O() P ODC j If we cofactor the PODC and remove polarzaton we get the ODC. Theorem : ODC p ]? P ODC p j vp a b explct a ~ b ~ v f PODC f v 4 v 5 v 2 PODC 4 PODC 5 PODC 2 h g v 6 v 7 PODC 6 PODC 7 PODC 2,3 PODC PODC 2 PODC 3 v 2 a mplct b v v 3 Fg. 2. complement polarze Explct and mplct twnnng v 8 v 9 v PODC 8 complement polarze PODC 9 PODC The PODC of a connecton c j can be derved from the PODC of node n j usng the followng denton. Denton 4: P ODC j 8 >< >: P ODC j f j f OP (j) and INV (j) FLSE P ODC j f ~ j f OP (j) P ODC g j fj ~ and INV (j) FLSE f OP (j) g P ODC j f j and INV (j) TRUE f OP (j) and INV (j) TRUE The PODC of a node n can be derved from the PODC of all connectons c j usng the followng denton: Fg. 3. PODC network constructon So usng dentons 4 and 5 and theorem we can create the ODC of any node or connecton n the network. Fgure 3 shows how the PODC network s constructed for a sample logc network. Note that n the method descrbed n [6], see equaton (3), xnor operatons are needed at multple-fanout nodes, here we only need smple and operatons. Before provng theorem, we wll rst look what happens f we apply ths theorem to denton 4. For example, n the case? of an and gate, t s easy to prove that: ODC j ] P ODC j j vj ] P ODC j j vj f ~ j j vj ]? P ODC j j vj Pk6 v kj ODC j P k6 v kj (see equaton ).
5 However provng that theorem also holds for defnton 5 s not as easy: ODC ] (P ODC j v ) Q j2f P ODC O() j ::: (see equatons 2, 3 and 4). s a matter of fact,? t s mpossble to prove ths by just assumng that ] P ODC j j vj ODCj, wthout takng nto account the polarzed nformaton of P ODC j. In order to prove theorem we dene a property whch holds for every cut set through the network. Ths cut set can contan node varables as well as connecton varables. Denton 6: cut set C s dened as a set of ndces and ndex pars such that on every path from any prmary output to any prmary nput there s exactly one node or connecton whch appears n C. To reason about cutsets, we wll dene P EQV C, whch can be understood best as a \polarzed characterstc functon". Denton 7: h f q f ~ q P ODC ~fq q f q P EQV C q2c P ODCq g ny cut set dvdes the network nto two parts. We wll use the P EQV C to prove theorem. Frst we wll prove that P EQV C s nvarant for any cutset C. From ths property we wll prove theorem. Lemma : P EQV C 2O hf ~ f ~f f Proof By denton 3, f C O, the lemma holds. So P EQV O s just the xnor of the prmary outputs of the orgnal network and ts twn. Now we wll use nducton to prove that the P EQV C does not change f the cut set s moved towards the prmary nputs. C C v j Fg. 4. Movng cut set over a node Step Move cut set over a node (see gure 4). Suppose lemma holds for a gven cut set C. Now consder another cut set C F I(j) [ C n fjg. The cut set C does not yet cross any possble nverters on connecton c j. Step a ssume OP (j) ccordng to denton 4: P ODC j P ODC j f j. So: P EQV C hf j ~ f j P ODC j j2f I(j) ~fj f j P ODCj g apply denton 4 q2c nf I(j) hf j ~ f j P ODC j j2f I(j) ~fj f j P ODCj fj ~ as f j X j j2f I(j) j2f I(j) q2c nf I(j) ~f j P ODC j f j P ODCj g q2c nf I(j) f j and therefore f j j f j f ~ j P ODC ~fj j f j q2c nf I(j) P EQV C g f j P ODCj Step b ssume OP (j) ccordng to denton 4: P ODC j P ODC j ~ f j. So: P EQV C hf j ~ f j P ODC j j2f I(j) ~fj fj P ODCj g apply denton 4 q2c nf I(j) hf j ~ f j P ODC j j2f I(j) ~fj f j P j2f I(j) j2f I(j) as f j j q2c nf I(j) f j f ~ j P ODC j ~f j f j P ODCj g f j q2c nf I(j)
6 C C f j f ~ j P ODC ~fj j f j q2c nf I(j) P EQV C g P ~ f f j2f O() P ODC g j brng rst 2 terms nto product hf ~ f P ODC j j2f O() ~f f P ODCj g q2c nfg q2c nfg as we do not cross nverters, f f j hf j ~ f j P ODC j j2f O() ~fj fj P ODCj g q2c nfg Fg. 5. Movng cut set over an nverter Step 2 Move cut set over an nverter (see gure 5). Let j be n C, and j n C. ccordng to denton 4: P ODC j P ODCj g. Snce: f j f ~ j P ODC ~fj j f j g P ODCj g ~fj fj P ODCj f j f ~ j P ODC j P EQV C Usng these steps we can obtan any cut set C through the network. Proof of theorem : ccordng to lemma we know that the P EQV C remans constant for any cut set. For the ntal cut set (through all prmary outputs) we have: ]? P EQV C j vp ] 2O " # f f ~ ~f f 2O? f j vp f j vp v p agan we see that P EQV C P EQV C. ODC p For any cut set through varable v p we know that all other f q n the cut set do not depend on varable v p C C Fg. 6. v Movng cut set over a fanout connecton Step 3 Move cut set over a fanout connecton (see gure 6). Suppose lemma holds for a gven cut set C. Now consder another cut set: C fg[c nf O(). ccordng to denton 5: P ODC Q j2f O() P ODC j. The followng s now true: P EQV f f ~ j2f O() P ODC j? ] P EQV C j vp 2 ] 4 3 f q f ~ q P ODC ~fq q fq P ODCq g 5 q2c ] ] ( ) v p q2cnfpg h f p f ~ p P ODC ~fp p f p P ODCp g rst term does not depend on v p, brng n ] q2cnfpg ] ]??? fq fq P ODC q fq fq P ODC q h f p f ~ p P ODC ~fp p f p P ODCp g v h p f p f ~ p P ODC ~fp p f p P ODCp g take cofactor of second term ]? P ODC p j vp ( : : :) ]? P ODC p j vp So, ODC p ]? P ODC p j vp v p v p v p
7 From ths proof t can be derved that t s also possble to perform the cofactorng operatons (to varable v p ) already n dentons 4 and 5, and change theorem nto: ODC p ]P ODC p. Snce the PODCs on a cutset contan all the nformaton needed to derve the ODC of any node n the nput part of the cutset, t s obvous that the PODCs of all prmary nputs of a gven crcut can be handed over as (polarzed) EDC to a feedng network. Ths then represents the complete ODC of the external crcut, and from t the Boolean relaton for the equvalence classes [6] can be derved drectly: EQV v r p ;:::;v r q ]P EQV C(~v p v r p ; : : : ; ~v q v r q). V. Examples In the followng examples we wll show how the derent methods (Tradtonal, Daman and Polarzed) compute the ODC. Wth \tradtonal" we refer to the method based on the denton of the ODC (dentons 7 and 8). In all methods only constant propagaton s used to obtan the nal results. Example 3 also shows Savoj's method. B. Example 2 See gure 8. Tradtonal: v v v 2 v 3 v 6 v4 v 5 v 7 v 94 v 95 v 8 v 9 Fg. 8. Network for example 2. Example See gure 7. ODC 9 f (v 9 ) f (v 9 ) (v 3 v 6 v 8 ) (v 3 v 7 v 6 ) v v v 2 v 3 v 6 v4 v 5 v 7 v 8 v 94 v 95 v 9 Fg. 7. Network for example Daman: ODC 9 ODC 94 j v95 ODC 95 j v94 Polarzed: (v 2 v 3 v 7 )j v95 (v v 6 v 8 )j v94 (v 3 v 6 v 7 ) (v 3 v 6 v 8 ) ODC 9 ] (P ODC 94 P ODC 95 )j v9 ] ((v v ~v 4 )(v v 2 ~v 5 ))j v9 C. Example 3 (v 3 v 6 v 8 v 7 )(v 3 v 6 v 7 v 8 ) Example taken from [6], see gure 9. Tradtonal: Daman: ODC 9 f (v 9 ) f (v 9 ) (v 3 v 6 ) (v 3 v 7 v 8 v 6 ) ODC 9 ODC 94 j v95 ODC 95 j v94 Polarzed: (v 2 v 3 v 7 )j v95 (v v 6 v 8 )j v94 (v 6 v 8 v 3 v 7 ) (v 3 v 6 v 8 ) ODC 9 ] (P ODC 94 P ODC 95 )j v9 ] ((v v ~v 4 )(v v 2 ~v 5 ))j v9 (v 3 v 6 v 7 )(v 3 v 6 v 8 ) Tradtonal: ODC 6 v v 2 v 3 v 4 v 5 v 7 v 6 Fg. 9. Network for example 3 2 f j v6 f j v6 ((v 5 v 7 ) )((v 5 v 7 ) ) (v 5 v 7 )(v 5 v 7 )
8 Daman: Savoj: Polarzed: ODC 6 gven: 2 ODC 63 v64 ODC 64 v 63? (v 4 v 5 )j v64 (v 3 v 7 )j v63? (v4 v 5 )j v64 (v 3 v 7 )j v63 (v 5 (v 5 v 7 ))( (v 5 v 7 )) (v 5 (v 5 v 7 ))(v 5 v 7 ) ODC 3 v 4 g 2 v 4 g ODC 4 v 3 g 2 v 3 g then: O 6 v 3 ODC 3 j v4 v 3 g 2 O 2 6 (v 4 O 6)ODC 4 O 6 ODC 4 ODC 6 O 2 6 v6 O 2 6 v 6 ODC 6 ] (P ODC 63 P ODC 64 )j v6 ] ((~v v 2 v 3 )(~v v 2 v 4 ))j v6 v 5 v 7 VI. Results and Conclusons The descrbed method has been mplemented to generate the ODCs of all multple-fanout nodes n a network. The resultng ODCs are created as a network of factored forms, wth no optmzatons except for constant propagaton durng cofactorng. The algorthm was tested on the complete MCNC benchmark set for multple-level combnatonal networks. The results n table I are from the crcuts whch contan ntally more than 2 edges n the network of factored forms and are obtaned on a HP 9/755/99 (appr. 2 MIPS) wth 256 MB of memory. Table I also gves the result for creaton of the ODCs usng dentons 7 and 8. Note that we have only created the network for ODCs for multple-fanout ponts n the network, as all others can be obtaned trvally. The number of nodes n tables I and II refer to crcuts composed of ands and ors only. Inverters are not counted, as they are annotated as edge propertes. From table I we can see that the PODC method results n a ODC crcut wth fewer edges ( lterals) n 29 out of 39 examples. The tradtonal method wns 9 tmes, and both methods fal (run out of memory) for the multpler crcut of C6288. Run tmes are wthn seconds for all examples. The falure of C6288 s probably the result of the very hgh degree of reconvergence of the multpler structure. The reason that the PODC method n some examples results n a larger ODC crcut les n the fact that these examples contan nodes wth very large fanout and wth reconvergent paths whch contan almost all local nodes. We feel condent that the results of the PODC method could be further mproved wth the addton of some Boolean smplcaton durng the buldng phase of the network. Some ntal experments wth optmzaton after the buldng phase show a gan of at least a factor of 2. The tradtonal method cannot be mproved easly n ths way, as t expresses the ODC bascally n copes of the orgnal network, cofactored once, wth an xor at the prmary output. The orgnal network should be consdered optmzed already. We do not present comparsons wth other methods, because most papers do not present results on ODC sze at all, except for [6] whch presents an average number of lterals needed to represent the ODC sets, but t s not clear whch ODCs were computed (all nodes, only multplefanout nodes or nputs nodes). It should, however, be clear that the presented method s computatonally easer than [6] snce the algorthm traverses the network n the same way, but operatons at each step are smpler. Table II shows the sze of the PODC network tself of some of the largest results n table I. It can be shown that the sze of ths network s lnear n the sze of the orgnal network. Ths s a useful property snce the PODC network can be used to provde the don't care nformaton for a feedng network as ndvdual ODCs or as a sngle Boolean relaton. References [] K.. Bartlett, R.K. Brayton, G.D. Hachtel, R.M. Jacoby, R. Rudell,. Sangovann-Vncentell and. Wang, Mult-level logc mnmzaton usng mplct don't cares IEEE Transactons on CD/ICS, vol. CD-7, No. 6, June 988, pp [2] R.. Bergamasch, D. Brand, L. Stok, M. Berkelaar and S. Prakash, Ecent Use of Large Don't Cares n Hgh-Level and Logc Synthess, Proceedngs of the IEEE Internatonal Conference on Computer ded Desgn, 995, pp [3] Brayton, R.K., F. Somenz, n Exact Mnmzer for Boolean Relatons, Proceedngs of the IEEE Internatonal Conference on Computer ded Desgn, 989, pp [4] Brayton, R.K., G.D. Hachtel,.L. Sangovann-Vncentell, Multlevel Logc Synthess, Proceedngs of the IEEE, vol. 78, No. 2, February 99, pp [5] Chang,.C.L., I.S. Reed and.v. Banes, Path Senstzaton, Partal Derence, and utomated Fault Dagnoss, IEEE Transactons on Computers, February 972, pp [6] Daman M. and G. De Mchel, Observablty Don't Care Sets and Boolean Relatons, Proceedngs of the IEEE Internatonal Conference on Computer ded Desgn, 99, pp [7] Muroga, Saburo, ahko Kambayash, Hung Ch La and Jay Nel Cullney, The Transducton Method - Desgn of Logc Networks Based on Permssble Functons, IEEE Transactons on Computers, Vol. 38, No., October 989, pp [8] Savoj, Hamd and Robert K. Brayton, Observablty Relatons and Observablty Don't Cares, Proceedngs of the IEEE Internatonal Conference on Computer ded Desgn, 99, pp [9] Savoj, Hamd, Prvate communcaton, prl 996.
9 TBLE I CPU tme, number of nodes and number of edges for the ODC representaton of factored forms tradtonal PODC crcut #nodes #edges tme (s) #nodes #edges tme (s) #nodes #edges 9symml C C C C C C C C Out of memory Out of Memory C C alu alu apex apex b c cht comp count des example f5m frg frg k lal my adder par rot sct term too large ttt unreg vda x x x TBLE II Number of nodes and edges for the orgnal and the PODC network orgnal PODC crcut #nodes #edges #nodes #edges des C k
10 Harm M..M. rts was born on September 27, 963 n Venraj, the Netherlands. He receved hs M.S. degree n Electrcal Engneerng n 989 from the Endhoven Unversty of Technology. In 989 he joned the Desgn utomaton Secton of the department of Electrcal Engneerng of the Endhoven Unversty of Technology as a researcher. In 997 he joned mbt Desgn Systems, Santa Clara, C. Mchel R.C.M. Berkelaar was born on September 24, 959 n Noordwjkerhout, the Netherlands. He receved hs M.S. degree n Electrcal Engneerng `cum laude' n 987 from the Endhoven Unversty of Technology. In 987 he joned the Desgn utomaton Secton of the department of Electrcal Engneerng of the Endhoven Unversty of Technology as a researcher. In 992 he obtaned hs Ph.D. based on hs work on logc synthess. lso n 992 he joned the permanent sta of the Desgn utomaton Secton. In 994 and 995 he spent a year as a vstng scentst at the IBM T.J. Watson Research Center. Koen van Ejk was born on September 9, 97 n Hlvarenbeek, the Netherlands. He studed Informaton Engneerng at the Endhoven Unversty of Technology, from whch he graduated wth honors on ugust 27, 992. In 992 he joned the Desgn utomaton Secton of the department of Electrcal Engneerng of the Endhoven Unversty of Technology as a researcher. In 997 he obtaned hs Ph.D. based on hs work on formal vercaton. lso n 997 he joned the permanent sta of the Desgn utomaton Secton. Hs research nterests nclude formal vercaton and synthess of dgtal crcuts.
Decision Diagrams Derivatives
Decson Dagrams Dervatves Logc Crcuts Desgn Semnars WS2010/2011, Lecture 3 Ing. Petr Fšer, Ph.D. Department of Dgtal Desgn Faculty of Informaton Technology Czech Techncal Unversty n Prague Evropský socální
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationSuppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl
RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationThe Synchronous 8th-Order Differential Attack on 12 Rounds of the Block Cipher HyRAL
The Synchronous 8th-Order Dfferental Attack on 12 Rounds of the Block Cpher HyRAL Yasutaka Igarash, Sej Fukushma, and Tomohro Hachno Kagoshma Unversty, Kagoshma, Japan Emal: {garash, fukushma, hachno}@eee.kagoshma-u.ac.jp
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationSupplementary Notes for Chapter 9 Mixture Thermodynamics
Supplementary Notes for Chapter 9 Mxture Thermodynamcs Key ponts Nne major topcs of Chapter 9 are revewed below: 1. Notaton and operatonal equatons for mxtures 2. PVTN EOSs for mxtures 3. General effects
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationNote 10. Modeling and Simulation of Dynamic Systems
Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationTOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION
1 2 MULTIPLIERLESS FILTER DESIGN Realzaton of flters wthout full-fledged multplers Some sldes based on support materal by W. Wolf for hs book Modern VLSI Desgn, 3 rd edton. Partly based on followng papers:
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationMAE140 - Linear Circuits - Winter 16 Final, March 16, 2016
ME140 - Lnear rcuts - Wnter 16 Fnal, March 16, 2016 Instructons () The exam s open book. You may use your class notes and textbook. You may use a hand calculator wth no communcaton capabltes. () You have
More informationValuated Binary Tree: A New Approach in Study of Integers
Internatonal Journal of Scentfc Innovatve Mathematcal Research (IJSIMR) Volume 4, Issue 3, March 6, PP 63-67 ISS 347-37X (Prnt) & ISS 347-34 (Onlne) wwwarcournalsorg Valuated Bnary Tree: A ew Approach
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationCHARACTERISTICS OF COMPLEX SEPARATION SCHEMES AND AN ERROR OF SEPARATION PRODUCTS OUTPUT DETERMINATION
Górnctwo Geonżynera Rok 0 Zeszyt / 006 Igor Konstantnovch Mladetskj * Petr Ivanovch Plov * Ekaterna Nkolaevna Kobets * Tasya Igorevna Markova * CHARACTERISTICS OF COMPLEX SEPARATION SCHEMES AND AN ERROR
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationExplicit constructions of all separable two-qubits density matrices and related problems for three-qubits systems
Explct constructons of all separable two-qubts densty matrces and related problems for three-qubts systems Y. en-ryeh and. Mann Physcs Department, Technon-Israel Insttute of Technology, Hafa 2000, Israel
More informationAnalytical Gradient Evaluation of Cost Functions in. General Field Solvers: A Novel Approach for. Optimization of Microwave Structures
IMS 2 Workshop Analytcal Gradent Evaluaton of Cost Functons n General Feld Solvers: A Novel Approach for Optmzaton of Mcrowave Structures P. Harscher, S. Amar* and R. Vahldeck and J. Bornemann* Swss Federal
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationClock-Gating and Its Application to Low Power Design of Sequential Circuits
Clock-Gatng and Its Applcaton to Low Power Desgn of Sequental Crcuts ng WU Department of Electrcal Engneerng-Systems, Unversty of Southern Calforna Los Angeles, CA 989, USA, Phone: (23)74-448 Massoud PEDRAM
More informationChapter 3 Differentiation and Integration
MEE07 Computer Modelng Technques n Engneerng Chapter Derentaton and Integraton Reerence: An Introducton to Numercal Computatons, nd edton, S. yakowtz and F. zdarovsky, Mawell/Macmllan, 990. Derentaton
More informationThe Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method
Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationNON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS
IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More information1 Convex Optimization
Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationLINEAR TRANSFORMATION OF BINARY DECISION DIAGRAMS TROUGH SPECTRAL DOMAIN
LINEAR TRANSFORMATION OF BINARY DECISION DIAGRAMS TROUGH SPECTRAL DOMAIN Mlena Stankovc, Suzana Stokovc 2 Faculty of Electronc Engneerng, Unversty of Ns, A Medvedeva 4, 8 Ns, SERBIA, mstankovc@elfaknacyu,
More informationJournal of Universal Computer Science, vol. 1, no. 7 (1995), submitted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Springer Pub. Co.
Journal of Unversal Computer Scence, vol. 1, no. 7 (1995), 469-483 submtted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Sprnger Pub. Co. Round-o error propagaton n the soluton of the heat equaton by
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationFundamental loop-current method using virtual voltage sources technique for special cases
Fundamental loop-current method usng vrtual voltage sources technque for specal cases George E. Chatzaraks, 1 Marna D. Tortorel 1 and Anastasos D. Tzolas 1 Electrcal and Electroncs Engneerng Departments,
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationFinite Difference Method
7/0/07 Instructor r. Ramond Rump (9) 747 698 rcrump@utep.edu EE 337 Computatonal Electromagnetcs (CEM) Lecture #0 Fnte erence Method Lecture 0 These notes ma contan coprghted materal obtaned under ar use
More informationMath Review. CptS 223 Advanced Data Structures. Larry Holder School of Electrical Engineering and Computer Science Washington State University
Math Revew CptS 223 dvanced Data Structures Larry Holder School of Electrcal Engneerng and Computer Scence Washngton State Unversty 1 Why do we need math n a data structures course? nalyzng data structures
More informationChapter 6. Operational Amplifier. inputs can be defined as the average of the sum of the two signals.
6 Operatonal mpler Chapter 6 Operatonal mpler CC Symbol: nput nput Output EE () Non-nvertng termnal, () nvertng termnal nput mpedance : Few mega (ery hgh), Output mpedance : Less than (ery low) Derental
More informationTHERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS
Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationCS 331 DESIGN AND ANALYSIS OF ALGORITHMS DYNAMIC PROGRAMMING. Dr. Daisy Tang
CS DESIGN ND NLYSIS OF LGORITHMS DYNMIC PROGRMMING Dr. Dasy Tang Dynamc Programmng Idea: Problems can be dvded nto stages Soluton s a sequence o decsons and the decson at the current stage s based on the
More informationCryptanalysis of pairing-free certificateless authenticated key agreement protocol
Cryptanalyss of parng-free certfcateless authentcated key agreement protocol Zhan Zhu Chna Shp Development Desgn Center CSDDC Wuhan Chna Emal: zhuzhan0@gmal.com bstract: Recently He et al. [D. He J. Chen
More informationBasic Regular Expressions. Introduction. Introduction to Computability. Theory. Motivation. Lecture4: Regular Expressions
Introducton to Computablty Theory Lecture: egular Expressons Prof Amos Israel Motvaton If one wants to descrbe a regular language, La, she can use the a DFA, Dor an NFA N, such L ( D = La that that Ths
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More informationPhysics 2A Chapters 6 - Work & Energy Fall 2017
Physcs A Chapters 6 - Work & Energy Fall 017 These notes are eght pages. A quck summary: The work-energy theorem s a combnaton o Chap and Chap 4 equatons. Work s dened as the product o the orce actng on
More informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationThe Quadratic Trigonometric Bézier Curve with Single Shape Parameter
J. Basc. Appl. Sc. Res., (3541-546, 01 01, TextRoad Publcaton ISSN 090-4304 Journal of Basc and Appled Scentfc Research www.textroad.com The Quadratc Trgonometrc Bézer Curve wth Sngle Shape Parameter Uzma
More informationOdd/Even Scroll Generation with Inductorless Chua s and Wien Bridge Oscillator Circuits
Watcharn Jantanate, Peter A. Chayasena, Sarawut Sutorn Odd/Even Scroll Generaton wth Inductorless Chua s and Wen Brdge Oscllator Crcuts Watcharn Jantanate, Peter A. Chayasena, and Sarawut Sutorn * School
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationEnergy Storage Elements: Capacitors and Inductors
CHAPTER 6 Energy Storage Elements: Capactors and Inductors To ths pont n our study of electronc crcuts, tme has not been mportant. The analyss and desgns we hae performed so far hae been statc, and all
More informationAmusing Properties of Odd Numbers Derived From Valuated Binary Tree
IOSR Journal of Mathematcs (IOSR-JM) e-iss: 78-578, p-iss: 19-765X. Volume 1, Issue 6 Ver. V (ov. - Dec.016), PP 5-57 www.osrjournals.org Amusng Propertes of Odd umbers Derved From Valuated Bnary Tree
More informationMathematical Preparations
1 Introducton Mathematcal Preparatons The theory of relatvty was developed to explan experments whch studed the propagaton of electromagnetc radaton n movng coordnate systems. Wthn expermental error the
More informationScroll Generation with Inductorless Chua s Circuit and Wien Bridge Oscillator
Latest Trends on Crcuts, Systems and Sgnals Scroll Generaton wth Inductorless Chua s Crcut and Wen Brdge Oscllator Watcharn Jantanate, Peter A. Chayasena, and Sarawut Sutorn * Abstract An nductorless Chua
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationOPTIMISATION. Introduction Single Variable Unconstrained Optimisation Multivariable Unconstrained Optimisation Linear Programming
OPTIMIATION Introducton ngle Varable Unconstraned Optmsaton Multvarable Unconstraned Optmsaton Lnear Programmng Chapter Optmsaton /. Introducton In an engneerng analss, sometmes etremtes, ether mnmum or
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationUniversity of Washington Department of Chemistry Chemistry 452/456 Summer Quarter 2014
Lecture 16 8/4/14 Unversty o Washngton Department o Chemstry Chemstry 452/456 Summer Quarter 214. Real Vapors and Fugacty Henry s Law accounts or the propertes o extremely dlute soluton. s shown n Fgure
More informationCombining Constraint Programming and Integer Programming
Combnng Constrant Programmng and Integer Programmng GLOBAL CONSTRAINT OPTIMIZATION COMPONENT Specal Purpose Algorthm mn c T x +(x- 0 ) x( + ()) =1 x( - ()) =1 FILTERING ALGORITHM COST-BASED FILTERING ALGORITHM
More informationHiding data in images by simple LSB substitution
Pattern Recognton 37 (004) 469 474 www.elsever.com/locate/patcog Hdng data n mages by smple LSB substtuton Ch-Kwong Chan, L.M. Cheng Department of Computer Engneerng and Informaton Technology, Cty Unversty
More information