Constraint-free Analog Placement with Topological Symmetry Structure
|
|
- Alexia Carson
- 5 years ago
- Views:
Transcription
1 Constraint-free Analog Plaement with Topologial Symmetry Struture Qing DONG Department of Information an Meia Sienes University of Kitakyushu Wakamatsu, Kitakyushu, Fukuoka, , Japan Shigetoshi NAKATAKE Department of Information an Meia Sienes University of Kitakyushu Wakamatsu, Kitakyushu, Fukuoka, , Japan Astrat In analog iruits, loks nee to e plae symmetrially to satisfy the evies mathing. Different from the existing onstraint-riven approahes, the propose topologial symmetry struture enales us to generate a symmetrial plaement without any onstraint. Simulate annealing is utilize as the framework of the optimization, an we propose new move operation to maintain the plaement s topologial symmetry. By inserting ummy loks, we present a physial skewe symmetry struture allowing non-symmetry partly, so that to enhane the plaement on area an wire length. Besies, we inorporate regularity into the evaluation of plaement. Experiments shows that our approah generate topologial omplete symmetry plaements without muh ompromise on hip area an wire length, ompare to the plaements with no symmetry. I. INTRODUCTION In analog iruits, mathing the partnere evies helps to avoi oth high offset voltage an egraation of power supply rejetion ratio [1], so partnere evies are often require to e plae symmetrially.constraint-riven approahes[3],[5], [7], [8] an yiel plaements satisfying the mathing requirement. Sine no effiient generation of onstraint has een estalishe yet, onstraint is generate manually, the onstraint-riven approahes still suffer from the time-onsuming onstraint generation proess. The struture plaement propose in [11] is a onstraintless approah to pursue the regularity of analog plaement. Following this onstraint-less onept, we introue another struture plaement fousing on topologial symmetry struture. Our ontriution is summarize as follows. Not speifying any lok s name, we an formulate the topologial omplete symmetry struture. Base on this struture, the plaement goes to symmetry naturally without any onstraint. Besies, this struture enales us to alulate the vertial oorinate in the linear time to the numer of eges of the onstraint graph. We introue the physial skewe symmetry struture for sarifiing the omplete symmetry against minimizing the area or wire length. In orer to improve the plaement, we utilize simulate annealing as a framework of the optimization proess an propose effiient moves to maintain the topologial symmetry at every step. Furthermore, we introue zero-size ummy loks to present Physial Skewe Symmetry Struture. As a result, we an release physially symmetry to get the plaement with less area or wire length. In experiments, we applie our struture plaement to inustrial instanes for analog lok esigns. In aition, we omine the evaluation of symmetry struture with the evaluation proeure introue in [11] for taking row an array strutures into onsieration. In the results, the plaements of the omplete symmetry struture oul e otaine y the ompromise of aout 5% on average with respet to the hip area an the wire length, ompare to the plaements with no symmetry. Furthermore, we teste the aility of physial skewe symmetry plaement. Those inserte ummy loks enue other loks more flexiility, an serve to reue the hip area an wire length as expete. The rest of this paper is organize as follows. Setion II esries preliminary onepts of our struture plaement. Setion III introues the topologial property of a topologial omplete symmetry. Setion IV esries the framework of the optimization of plaement with new move, an introues the physial skewe symmetry struture. Setion V emonstrates the experimental results. Setion VI onlues ontriution an future work. II. SEQUENCE-PAIR &SINGLE-SEQUENCE A sequene-pair [2] is an orere pair of Γ + an Γ to represent a plaement. Eah of Γ + an Γ is a permutation of names of given n loks. If lok x is the i-th in Γ +,weenote Γ + (i) =x, aswellasγ 1 + (x) =i. Similar notation is also use for Γ. For every lok pair (a, ), a is the left of (equivalently, is the right of a) ifγ 1 + (a) < Γ 1 + () an Γ 1 (a) < Γ 1 (). Analogously, a is elow (equivalently, is aove a)ifγ 1 + (a) > Γ 1 + () an Γ 1 (a) < Γ 1 (). The single-sequene [4], [6], [9], [10] an represent a plaement s topology without speifying lok s name. It is efine as S(k) =Γ 1 + (Γ (k)),thatis,s is the same as Γ when eah lok is rename as Γ + =(1, 2,...,n). III. TOPOLOGICAL SYMMETRY STRUCTURE Symmetry strutures are require in analog plaement to math evie pairs. Relate works in [3], [7] introue onstraint-riven approahes to realize a plaement satisfying the symmetry requirement.however, the speifiation of the /08/$ IEEE 186
2 axis vertial line horizontal line Fig. 2. An example of generation of symmetry struture. isshownintaleianfig. 2. Γ (k) an Δ + (k) (or Γ + (k) an Δ (k)) orrespon to a symmetry-pair. Note that if they orrespon to the same lok, it means a self-symmetry. 1. Make a hek-list of (1, 2,...,n). Set Γ + as (1, 2,...,n), Δ + as (n, n 1,...,1), Γ an Δ as empty, an k =1. Fig. 1. An example of sequene-pair with horizontal symmetry topology. onstraint is a tough task, an no effiient generation of appropriate onstraint has een estalishe yet. Therefore, we introue the generation of symmetry strutures without speifying any pair of evies or name of any lok. It is possile that a plaement naturally goes to a symmetry struture. Let a sequene-pair e SP =(Γ +, Γ ), an let the reverse sequenes of Γ + an Γ e Δ + an Δ, respetively. Originally, a sequene-pair is efine y the arrangement of loks from the left-sie to the right-sie over the hip. We all suh a sequene-pair LR-SP. On the other han, if a sequene-pair is efine from the right-sie to the left-sie, the sequene-pair is alle RL-SP. We notie that RL-SP is (Δ, Δ + ). Γ + (k) an Δ + (n k +1)orrespon to the same lok as well as Γ (k) an Δ (n k +1)o to the same one. If the LR-SP an RL-SP inue the same single-sequene, that is, Γ 1 + (Γ (k)) = Δ 1 (Δ +(k)), (1) then we say that the sequene-pair has a horizontal symmetry topology. Given an n n gri,assigning n loks into the gri aoring to (Γ +, Γ ) will result in the orresponing plaement. Denote k as j, enote Γ 1 + (Γ (k)) an Δ 1 (Δ + (k)) as i. The equation (1) means that if a lok was assigne to the joint of i-th horizontal line an the j-th vertial line, another lok(or itself, if it is on the axis) will appear on the symmetri position whih is the joint of reverse i-th vertial line an the reverse j-th horizontal line. The symmetry axis is the iagonal of the gri. Fig. 1 shows an example, the gri has een rotate 45 egree. The LR-SP(Γ +, Γ )=(ae, ae) an the RL-SP(Δ, Δ + )=(ea, ea) introue the same single-sequene whih is (13425), so the sequene-pair has a horizontal symmetry topology In the following, we introue the generation of a singlesequene with an aritrary horizontal symmetry topology. A horizontal symmetry topology has a single vertial axis. It an e also extene to a horizontal axis or plural axes, ut the extension is omitte here for the spae limitation. An example 2. Stop the proeure if all numers have een assigne to Γ, that is, the hek-list is empty. 3. Assign an aritrary numer x in the hek-list to Γ (k), an remove x from the hek-list. 4. Assign n k +1to oth Δ (x) an Γ (n x +1),an remove n k +1from the hek-list. 5. Inrement k until Γ (k) has not een assigne to, an return to step 2). Furthermore, in the tale, x = 2 an x = 1 are hosen aritrarily (see step 3) aove). If we take other hoies, the resultant Γ woul e ifferent. In other wors, we an ontrol the generation of a single-sequene with a horizontal symmetry topology y hoosing these numers. TABLE I AN EXAMPLE OF SINGLE-SEQUENCE GENERATION WITH A HORIZONTAL SYMMETRY TOPOLOGY. k xn k +1 n x +1 Γ an Δ hek-list initial (-, -, -, -, -) (1,2,3,4,5) (2, -, -, -, -) (1,3,4,5) (2, -, -, 5, -) (1, 3, 4) (2, 1, -, 5, -) (3, 4) (2, 1, -, 5, 4) (3) (2, 1, 3, 5, 4) (-) Consier the realization of a symmetry plaement from a sequene-pair with a horizontal symmetry topology. Prior works [3], [7] introue a speial alulation to plae a pair of loks impose a symmetry-onstraint on so that the y-axis eomes the enter etween them an their y-oorinates are the same [3], [7]. But, they suffer from the time-onsuming alulation of y-oorinates, eause it often nees several iterations to align y-oorinates of a horizontal symmetry-pair. However, we an give a single path alulation of y-oorinates of symmetry-pairs as long as the sequene-pair has a horizontal symmetry topology. Theorem III.1 (Vertial Feasiility) For eah symmetry-pair, if their y-oorinate is the same oorinate in the plaement, 187
3 the plaement is alle vertial feasile. A vertial onstraint graph inue y a sequene-pair with a horizontal symmetry topology is given. It has no irete yle. Y-oorinate of every lok of a vertial feasile plaement an e alulate in the time omplexity that is linear to the numer of eges of the onstraint graph. IV. SYMMETRY-ORIENTED OPTIMIZATION Simulate annealing is aopte as the optimization framework. In the following, we will esrie (i) generation of an initial plaement, (ii)evaluation of symmetry, (iii) ost funtion, (iv) move operation, (v) physial skewe symmetry struture. A. Generation of Initial Plaement As we esrie aove, we an generate a single-sequene satisfying a topologial omplete symmetry. Let the singlesequene e S symm. We assign loks to S symm, then generate the initial plaement. Note that this assignment orrespons to the onfiguration of a sequene-pair. If two numer onsist one symmetry-pair, one numer alls the other partner. Inthis assignment, loks are lassifie aoring to their size so that loks of the similar size elong to the same group. Hene, every lok is assigne to S symm suh that the partner is hosen from the same group. S symm onsists of a set of symmetry-pair numers an selfsymmetry numers. We set a limitation on the amount of selfsymmetry numers in orer to avoi too muh self-symmetry loks. Although our onept is onstraint-less, we are still ale to omine the onstraint-riven approah to our plaement. For a partiular pair of loks shoul e symmetrial, i.e. they nee to satisfy one symmetry onstraint, we assign them into a symmetry-pair numers, make them as the partner of eah other. B. Evaluation of Symmetry Topologial struture value V top an Physial imension ost C phy introue in [11] are use to evaluate the quality of a struture plaement. Multi-rows an arrays are extrate so the two values involving some fators suh as loal ompatness an e alulate. Sine we an ontrol the generation of the initial symmetry plaement, the symmetry strutures an e extrate uring the generation, then those fators of symmetry strutures an e also alulate. Given a symmetry x, x enotes the numer of loks an x self enotes the numer of self-symmetry loks. The with an the height of a lok are enote y w(), h() respetively. The topology of a symmetry x is value as: V top (x) = x x self ; (2) an the loal symmetriity of a symmetry x is value as: C sym (x) = w() w( ) h() h( ). (3) (, x) Although in this paper we fous on the symmetry of a plaement, multi-rows an arrays are still preferre in an analog layout, so we omine the fators of symmetries into V top an C phy. Let sets of arrays, multi-rows an symmetries e A, R an X, respetively. The Topologial struture value is efine as: V top = α σ(r)+β σ(a)+γ self ), r R a A x X( x x (4) where the first two items in formula(4) are the same in [11], σ figures out the aspets of arrays an multi-rows. α, β anγ are oeffiients to alane a trae-off among struture values. The Physial imension ost is efine as: C phy = α a A (C mp(a)+c uni (a)) +β r R (C mp(r)+c uni (r)) (5) +γ x X C sym(x), where the first two items in formula(5) are the same in [11], C mp an C uni esrie the loal ompatness an uniformity respetively, α, β an γ are oeffiients to alane a trae-off among osts. V top ontriutes to esrie the topologial shape of a plaement an C phy oes to esrie the loal ompatness an uniformity. C. Cost Funtion Our ost funtion E for a plaement P is esigne as follows. E(P )= Area(P ) WLen(P ) g(v top ) g(c phy ), where Area(P ) an WLen(P ) are the hip area an the wire length of P, respetively. g is a onversion that maps an input value to another value within [1.0, 1.1), an it is efine as: xm ln(0.5) g(x) = exp( x+ɛ ),wherex m is an average value of {x} an ɛ is a small value enough to ignore. The meaning of the funtion g is to e likely to egrae the hip area or the wire length y 10% to otain etter topologial struture value or less physial imension ost. D. Moves Keeping Symmetry We propose new moves to maintain the topologial symmetry uring an annealing proess. For every move, we hoose two loks a an. Our moves are explaine as a omination of FullExhange(a, ) an HalfExhange(a, ) introue in [2]. For the ompleteness, we riefly esrie these moves. FullExhange(a, ): Pair interhange of names of two lok a an in oth Γ + an Γ. HalfExhange(a, ): Pair interhange of two loks names in either Γ + or Γ. In the following, we esrie all the moves use in a simulate annealing. The simulate annealing ontrols the seletion of moves aoring to ranom values. 188
4 A: FullExhangeOfSymm on lok a an a a' A: omplete topologial symmetry a a' B: non-omplete topologial symmetry * * * * * * a a' C: Put ummy loks to get skewe symmetry Fig. 4. Physial Skewe Symmetry Struture. E. Physial Skewe Symmetry Struture B: HalfExhangeOfSymm on lok a an Fig. 3. Moves Keeping Symmetry. 1. RotateBlok(a): Rotate the lok a y 90 egree. 2. FlipBlok(a): Flip the lok a horizontally. 3. FullExhangeOfSymm(a, ): Let partners of a an e a an, respetively. If a is equal to, apply FullExhange(a, ) introue in [2]. Otherwise, apply oth FullExhange(a, ) an FullExhange(a, ). An example is shown in Fig. 3(A). 4. HalfExhangeOfSymm(a, ): Let partners of a an e a an, respetively. If a an are a symmetry-pair or two self-symmetry loks, apply HalfExhange(a, ) introue in [2]. Note that in this exhange, two selfsymmetry loks will e turne into a symmetry-pair, while a symmetry-pair will e separate into two selfsymmetry loks. Otherwise, apply HalfExhange(a, ) on Γ + (or Γ ) an HalfExhange(a, )onγ (or Γ + ). An example is shown in Fig. 3(B). Beause of the limitation of the lok s size or shape, a omplete symmetry plaement may lea to too muh ompromise on hip area an wire length. Fig. 4 shows an example with 5loks:a, a,,, an. a an a havethesamesizean shape. A omplete symmetry-oriente plaer trens to get a plaement like Fig. 4(A) whih is omplete topologial symmetry, ut might not so goo at the area. But there oul e another solution like Fig. 4(B), whih an not e otaine y a omplete symmetry plaement, ut the plaement still looks symmetry eause the area of it s left sie an right sie are almost same. In orer to make improvement on those topologial omplete symmetry plaement, we insert some ummy loks into the single-sequene, an the size of eah ummy lok is 0. In a symmetry struture, if a lok s symmetry partner is a ummy lok, we say that they formulate a Physial Skewe Symmetry Struture. During the generation of the initial plaement an the optimization, the single-sequene keeps eing topologial symmetry. The ummy loks are ignore in the symmetry oorinate alulation, so it is possile to generate a physial skewe symmetry plaement inluing non-symmetry parts. As a result we may get a more ompat plaement. In Fig. 4(C), ummy loks, an are inserte into the single-sequene, an form a topologial omplete symmetry plaement, finally help to lea to the result like Fig. 4(B). 189
5 BLK[35 ] BLK[34 ] BLK[24 ] BLK[19 ] BLK[11 ] BLK[122 ] BLK[63 ] BLK[33 ] BLK[32 ] BLK[25 ] BLK[27 ] BLK[106 ] BLK[1 ] BLK[23 ] BLK[111 ] BLK[6 ] BLK[113] BLK[144] BLK[114] BLK[133] BLK[37 ] BLK[124] BLK[152] BLK[106] BLK[114] BLK[127] BLK[126] BLK[125] BLK[160] BLK[165] BLK[31 ] BLK[124] BLK[136] BLK[133] BLK[137] BLK[47 ] BLK[141] BLK[139] BLK[17 ] BLK[32 ] BLK[48 ] BLK[44 ] BLK[49 ] BLK[132] BLK[53 ] BLK[162] BLK[105] BLK[40 ] BLK[41 ] BLK[135] BLK[36 ] BLK[39 ] BLK[138] BLK[121] BLK[113] BLK[145] BLK[142] BLK[125] BLK[148] BLK[149] BLK[46 ] BLK[35 ] BLK[34 ] BLK[109] BLK[107 ] BLK[108] BLK[19 ] BLK[131] BLK[130] BLK[140] BLK[45 ] BLK[55 ] BLK[154] BLK[49 ] BLK[82 ] BLK[33 ] BLK[31 ] BLK[12 ] BLK[13 ] BLK[37 ] BLK[44 ] BLK[29 ] BLK[30 ] BLK[51 ] BLK[26 ] BLK[27 ] BLK[25 ] BLK[11 ] BLK[24 ] BLK[19 ] BLK[20 ] BLK[128 ] BLK[158] BLK[76 ] BLK[118] BLK[139] BLK[117] BLK[122] BLK[143] BLK[147] BLK[146] BLK[119] BLK[134] BLK[123] BLK[120] BLK[142] BLK[145] BLK[138] BLK[149] BLK[164] BLK[130] BLK[129] BLK[137] BLK[128] BLK[116 ] BLK[162] BLK[107] BLK[109] BLK[148] BLK[108] BLK[111] BLK[144 ] BLK[79 ] BLK[94 ] BLK[93 ] BLK[126] BLK[115] BLK[104] BLK[103] BLK[141 ] BLK[117] BLK[134] BLK[143] BLK[127] BLK[73 ] BLK[118] BLK[155] BLK[14 ] BLK[152] BLK[132] BLK[151] BLK[165] BLK[161] BLK[154] BLK[163 ] BLK[157] BLK[135 ] BLK[153] BLK[112] BLK[101] BLK[102] BLK[150] BLK[121] BLK[158] BLK[140] BLK[164 ] BLK[150] BLK[156] BLK[101 ] BLK[110] BLK[163] BLK[161] BLK[129] BLK[155] BLK[136] BLK[131] BLK[157] BLK[159] BLK[115] BLK[159] BLK[160] BLK[116] BLK[120] BLK[103] BLK[18 ] BLK[23 ] BLK[22 ] BLK[156] BLK[22 ] BLK[110] BLK[102] BLK[112] BLK[119] BLK[151] BLK[146] BLK[147 ] BLK[104] BLK[105] BLK[153] BLK[123] 2C-2 ata A: symmetry ata C: normal ata D: normal ata A: normal ata C: omplete symmetry ata B: normal ata D: omplete symmetry ata C: physial skewe symmetry ata D: physial skewe symmetry ata B: symmetry Fig. 5. Resultant plaements of ata A, B, where the primary ojetive is the prout of the hip area an the wire length: normal an symmetry are normal plaement an our symmetry plaement respetively. V. EXPERIMENTS We implemente our symmetry-oriente struture plaement, an performe it on 14 instanes of analog lok sets from inustries. A normal lok plaement ase on sequenepair was also implemente. A. Comparison with normal plaement First, we ompare our struture plaement with normal one. Fig. 5 shows two pairs of resultant plaements. The results of normal plaement are well ompate, ut not well organize in loal area, an lak symmetry. Our symmetry struture plaement is well ompate either an istinguishes for the perfet symmetry generate without any onstraint. Sine we omine the evaluation of row an array strutures, our plaement also shows goo quality on loal ompatness an regularity. Our plaement is stritly limite to e symmetrial, ut the hip area an the wire length are not neessarily inreasing heavily ue to this limitation. The numerial results are shown in Tale II. The normal plaement an our plaement are enote y normal an symm respetively. The tale inlues the results aout the hip area an the wire length y oth plaements. The results show, as we expete, our plaement with a omplete symmetry struture oul e otaine y the ompro- Fig. 6. Resultant plaements of ata C an D, where normal, omplete symmetry an physial skewe symmetry are normal plaement, omplete symmetry plaement an physial skewe symmetry plaement respetively. mise of at most aout 5 % on average, ompare to the normal plaement. B. Physial Skewe Symmetry Seonly, we emonstrate the effetiveness of physial skewe symmetry struture. For the same instanes, we generate the ummy loks as the 10%, 20%, an 30% of the numer of input loks, an teste eah ase. The numerial test result is shown in Tale III. In this tale, values aout hip area an wire length are ratios to the hip area an wire length y symm in Tale II. The olumns of Best show the est result among the those of ummy 0%, ummy 10%, ummy 20% an ummy 30%. We attaine the 6% an 14% reution on average with respet to hip area an wire length. Fig. 6 shows the result y normal, omplete symmetry an physial skewe symmetry. We are onvine that the insertion of the ummy loks expans the solution spae of the symmetry-oriente plaement, an helps to reue the hip area an wire length. VI. CONCLUSION This paper presente a struture plaement fousing on topologial symmetry struture. Unlike the existing onstraintriven approah, it oes not nee any onstraint. We formu- 190
6 TABLE II THE NUMERICAL RESULT OF ANALOG BLOCK DESIGNS, WHERE WLEN IS THE WIRE LENGTH, NORMAL AND SYMMETRY REFER TO NORMAL PLACEMENT AND OUR SYMMETRY PLACEMENT RESPECTIVELY. ata #loks #nets normal symm (symm-normal)/symm area(μm 2 ) wlen(μm) time(se) area(μm 2 ) wlen(μm) time(se) area(%) wlen(%) A ,660 9,356 1, ,940 10, B ,784 5, ,082 7, C ,068 16,520 1, ,420 14, D ,090 2, ,844 3, E ,077 3, ,760 3, F ,105 9, ,968 9, G ,622 5, ,543 6, H ,631 4, ,953 3, I ,683 2, ,008 2, J ,507 15,576 7,926 80,565 12,645 1, K ,860 38, ,491 36, L ,452 3,392 1,868 45,456 4,692 1, M ,753 8, ,151 10, N ,799 3, ,681 3, average: TABLE III THE NUMERICAL RESULT OF ANALOG BLOCK DESIGNS USING Physial Skewe Symmetry Struture. ata ummy 0% ummy 10% ummy 20% ummy 30% Best(0 30%) area wlen #ummy area(%) wlen(%) #ummy area(%) wlen(%) #ummy area(%) wlen(%) area(%) wlen(%) A B C D E F G H I J K L M N average late the property of a topologial omplete symmetry in terms of single-sequene. Besies, we propose an effiient move use in a simulate annealing to maintain the topologial symmetry of every plaement. Furthermore, we introue physial skewe symmetry struture to ompromise symmetry for less hip area or wire length. In experiments, we showe that our approah generate topologial omplete plaements without muh ompromise on hip area an wire length, ompare to the plaements with no symmetry. In future works, we are going on stuying the struture plaement with hierarhial regular strutures suh as array, row, an symmetry. REFERENCES [1] J.Cohn, D. Garro, R.Rutenar an L.Carley, Analog Devie-level Automation, Kluwer Aa. Puli., [2] H. Murata, K. Fujiyoshi, S. Nakatake, an Y. Kajitani, Retanglepaking-ase moule plaement, Pro. ICCAD 1995, pp , [3] B. Balasa an K. Lampaert, Symmetry within the sequene-pair representation in the ontext of plaement for analog esign, IEEE Trans. on CAD, Vol.19, No.7, pp , [4] C. Koama an K. Fujiyoshi, Selete Sequene-Pair: An effiient eoale paking representation in linear time using Sequene-Pair, Pro. ASP-DAC 2003, pp , [5] T. Nojima, X. Zhu, Y. Takashima, S. Nakatake, an Y. Kajitani, Multilevel plaement with iruit shema ase lustering, Pro. ASP-DAC 2004, pp , [6] X. Zhang an Y. Kajitani, Spae-planning: Plaement an moules with ontrolle empty area y Single-Sequene, Pro. ASP-DAC 2004, pp.25-30, [7] F. Balasa, S. C. Maruvaa, an K. Krishnamoorthy, On the exploration of the solution spae in analog plaement with symmetry onstraints, IEEE Trans. on CAD, Vol.23, No.2, pp , [8] T. Nojima, Y. Takashima, S. Nakatake, an Y. Kajitani, A evie-level plaement with multi-iretional onvex lustering, Pro. GLSVLSI 2004, pp , [9] X. Zhu, X. Zhang, an Y. Kajitani, A general paking algorithm ase on Single-Sequene, Pro. ICCCAS 2004, pp , [10] X. Zhang an Y. Kajitani, Thoery of T-juntion floorplans in terms of single-sequene, Pro. ISCAS 2004, pp , [11] S. Nakatake, Struture Plaement with Topologial Regularity Evaluation, Pro. ASP-DAC 2007, pp
The numbers inside a matrix are called the elements or entries of the matrix.
Chapter Review of Matries. Definitions A matrix is a retangular array of numers of the form a a a 3 a n a a a 3 a n a 3 a 3 a 33 a 3n..... a m a m a m3 a mn We usually use apital letters (for example,
More informationSupplementary Materials for A universal data based method for reconstructing complex networks with binary-state dynamics
Supplementary Materials for A universal ata ase metho for reonstruting omplex networks with inary-state ynamis Jingwen Li, Zhesi Shen, Wen-Xu Wang, Celso Greogi, an Ying-Cheng Lai 1 Computation etails
More informationChapter 9. There are 7 out of 50 measurements that are greater than or equal to 5.1; therefore, the fraction of the
Pratie questions 6 1 a y i = 6 µ = = 1 i = 1 y i µ i = 1 ( ) = 95 = s n 95 555. x i f i 1 1+ + 5+ n + 5 5 + n µ = = = f 11+ n 11+ n i 7 + n = 5 + n = 6n n = a Time (minutes) 1.6.1.6.1.6.1.6 5.1 5.6 6.1
More informationReview Topic 4: Cubic polynomials
Review Topi : ui polynomials Short answer Fatorise Px ( ) = x + 5x + x- 9 into linear fators. The polynomial Px ( ) = x - ax + x- leaves a remainer of when it is ivie y ( x - ) an a remainer of - when
More information2. Properties of Functions
2. PROPERTIES OF FUNCTIONS 111 2. Properties of Funtions 2.1. Injetions, Surjetions, an Bijetions. Definition 2.1.1. Given f : A B 1. f is one-to-one (short han is 1 1) or injetive if preimages are unique.
More informationMath 225B: Differential Geometry, Homework 6
ath 225B: Differential Geometry, Homework 6 Ian Coley February 13, 214 Problem 8.7. Let ω be a 1-form on a manifol. Suppose that ω = for every lose urve in. Show that ω is exat. We laim that this onition
More informationMicroeconomic Theory I Assignment #7 - Answer key
Miroeonomi Theory I Assignment #7 - Answer key. [Menu priing in monopoly] Consider the example on seond-degree prie disrimination (see slides 9-93). To failitate your alulations, assume H = 5, L =, and
More informationCSE 5311 Notes 18: NP-Completeness
SE 53 Notes 8: NP-ompleteness (Last upate 7//3 8:3 PM) ELEMENTRY ONEPTS Satisfiability: ( p q) ( p q ) ( p q) ( p q ) Is there an assignment? (Deision Problem) Similar to ebugging a logi iruit - Is there
More informationMcCreight s Suffix Tree Construction Algorithm. Milko Izamski B.Sc. Informatics Instructor: Barbara König
1. Introution MCreight s Suffix Tree Constrution Algorithm Milko Izamski B.S. Informatis Instrutor: Barbara König The main goal of MCreight s algorithm is to buil a suffix tree in linear time. This is
More informationSampler-B. Secondary Mathematics Assessment. Sampler 521-B
Sampler-B Seonary Mathematis Assessment Sampler 51-B Instrutions for Stuents Desription This sample test inlues 15 Selete Response an 5 Construte Response questions. Eah Selete Response has a value of
More informationOrdering Generalized Trapezoidal Fuzzy Numbers. Using Orthocentre of Centroids
International Journal of lgera Vol. 6 no. 69-85 Ordering Generalized Trapezoidal Fuzzy Numers Using Orthoentre of Centroids Y. L. P. Thorani P. Phani Bushan ao and N. avi Shanar Dept. of pplied Mathematis
More informationOn the Reverse Problem of Fechnerian Scaling
On the Reverse Prolem of Fehnerian Saling Ehtiar N. Dzhafarov Astrat Fehnerian Saling imposes metris on two sets of stimuli relate to eah other y a isrimination funtion sujet to Regular Minimality. The
More informationSome Useful Results for Spherical and General Displacements
E 5 Fall 997 V. Kumar Some Useful Results for Spherial an General Displaements. Spherial Displaements.. Eulers heorem We have seen that a spherial isplaement or a pure rotation is esribe by a 3 3 rotation
More informationDetermination the Invert Level of a Stilling Basin to Control Hydraulic Jump
Global Avane Researh Journal of Agriultural Siene Vol. (4) pp. 074-079, June, 0 Available online http://garj.org/garjas/inex.htm Copyright 0 Global Avane Researh Journals Full Length Researh Paper Determination
More informationCS 491G Combinatorial Optimization Lecture Notes
CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,
More informationLesson 23: The Defining Equation of a Line
Student Outomes Students know that two equations in the form of ax + y = and a x + y = graph as the same line when a = = and at least one of a or is nonzero. a Students know that the graph of a linear
More informationEuler and Hamilton Paths
Euler an Hamilton Paths The town of Königserg, Prussia (now know as Kaliningra an part of the Russian repuli), was ivie into four setion y ranhes of the Pregel River. These four setions C A D B Figure:
More informationA population of 50 flies is expected to double every week, leading to a function of the x
4 Setion 4.3 Logarithmi Funtions population of 50 flies is epeted to doule every week, leading to a funtion of the form f ( ) 50(), where represents the numer of weeks that have passed. When will this
More informationExpressiveness of the Interval Logics of Allen s Relations on the Class of all Linear Orders: Complete Classification
Proeeings of the Twenty-Seon International Joint Conferene on Artifiial Intelligene Expressiveness of the Interval Logis of Allen s Relations on the Class of all Linear Orers: Complete Classifiation Dario
More informationIntercepts To find the y-intercept (b, fixed value or starting value), set x = 0 and solve for y. To find the x-intercept, set y = 0 and solve for x.
Units 4 an 5: Linear Relations partial variation iret variation Points on a Coorinate Gri (x-oorinate, y-oorinate) origin is (0, 0) "run, then jump" Interepts To fin the y-interept (, fixe value or starting
More informationSensitivity Analysis of Resonant Circuits
1 Sensitivity Analysis of Resonant Ciruits Olivier Buu Abstrat We use first-orer perturbation theory to provie a loal linear relation between the iruit parameters an the poles of an RLC network. The sensitivity
More informationChapter 2: One-dimensional Steady State Conduction
1 Chapter : One-imensional Steay State Conution.1 Eamples of One-imensional Conution Eample.1: Plate with Energy Generation an Variable Conutivity Sine k is variable it must remain insie the ifferentiation
More informationPerformance Evaluation of atall Building with Damped Outriggers Ping TAN
Performane Evaluation of atall Builing with Dampe Outriggers Ping TAN Earthquake Engineering Researh an Test Center Guangzhou University, Guangzhou, China OUTLINES RESEARCH BACKGROUND IMPROVED ANALYTICAL
More informationThe Complete Energy Translations in the Detailed. Decay Process of Baryonic Sub-Atomic Particles. P.G.Bass.
The Complete Energy Translations in the Detailed Deay Proess of Baryoni Su-Atomi Partiles. [4] P.G.Bass. PGBass P12 Version 1..3 www.relativitydomains.om August 218 Astrat. This is the final paper on the
More informationSufficient Conditions for a Flexible Manufacturing System to be Deadlocked
Paper 0, INT 0 Suffiient Conditions for a Flexile Manufaturing System to e Deadloked Paul E Deering, PhD Department of Engineering Tehnology and Management Ohio University deering@ohioedu Astrat In reent
More informationFast Evaluation of Canonical Oscillatory Integrals
Appl. Math. Inf. Si. 6, No., 45-51 (01) 45 Applie Mathematis & Information Sienes An International Journal 01 NSP Natural Sienes Publishing Cor. Fast Evaluation of Canonial Osillatory Integrals Ying Liu
More informationTo investigate the relationship between the work done to accelerate a trolley and the energy stored in the moving trolley.
SP2h.1 Aelerating trolleys Your teaher may wath to see if you an follow instrutions safely take areful measurements. Introdution The work done y a fore is a measure of the energy transferred when a fore
More informationExamining Applied Rational Functions
HiMAP Pull-Out Setion: Summer 1990 Eamining Applied Rational Funtions Flod Vest Referenes Environmental Protetion Agen. Gas Mileage Guide. (Copies an usuall e otained from a loal new ar dealer.) Information
More informationI F I G R e s e a r c h R e p o r t. Minimal and Hyper-Minimal Biautomata. IFIG Research Report 1401 March Institut für Informatik
I F I G R e s e a r h R e p o r t Institut für Informatik Minimal and Hyper-Minimal Biautomata Markus Holzer Seastian Jakoi IFIG Researh Report 1401 Marh 2014 Institut für Informatik JLU Gießen Arndtstraße
More informationarxiv: v1 [quant-ph] 30 Jan 2019
Universal logial gates with onstant overhea: instantaneous Dehn twists for hyperoli quantum oes Ali Lavasani, Guanyu Zhu, an Maissam Barkeshli Department of Physis, Conense Matter Theory Center, University
More informationMath 151 Introduction to Eigenvectors
Math 151 Introdution to Eigenvetors The motivating example we used to desrie matrixes was landsape hange and vegetation suession. We hose the simple example of Bare Soil (B), eing replaed y Grasses (G)
More informationAnnouncements. Office Hours Swap: OH schedule has been updated to reflect this.
SA Solving Announements Offie Hours Swap: Zavain has offie hours from 4-6PM toay in builing 460, room 040A. Rose has offie hours tonight from 7-9PM in Gates B26B. Keith has offie hours hursay from 2-4PM
More informationReliability Guaranteed Energy-Aware Frame-Based Task Set Execution Strategy for Hard Real-Time Systems
Reliability Guaranteed Energy-Aware Frame-Based ask Set Exeution Strategy for Hard Real-ime Systems Zheng Li a, Li Wang a, Shuhui Li a, Shangping Ren a, Gang Quan b a Illinois Institute of ehnology, Chiago,
More informationLatency Optimization for Resource Allocation in Mobile-Edge Computation Offloading
1 Lateny Optimization for Resoure Alloation in Mobile-Ege Computation Offloaing Jine Ren, Guaning Yu, Yunlong Cai, an Yinghui He arxiv:1704.00163v1 [s.it] 1 Apr 2017 College of Information Siene an Eletroni
More informationMaximum Entropy and Exponential Families
Maximum Entropy and Exponential Families April 9, 209 Abstrat The goal of this note is to derive the exponential form of probability distribution from more basi onsiderations, in partiular Entropy. It
More informationAn Efficient Sequential SAT Solver With Improved Search Strategies
An Effiient Sequential SAT Solver With Improved Searh Strategies F. Lu, M.K. Iyer, G. Parthasarathy, L.-C. Wang, and K.-T. Cheng K.C. Chen Department of ECE, Design Tehnology University of California at
More informationAppendix A Market-Power Model of Business Groups. Robert C. Feenstra Deng-Shing Huang Gary G. Hamilton Revised, November 2001
Appendix A Market-Power Model of Business Groups Roert C. Feenstra Deng-Shing Huang Gary G. Hamilton Revised, Novemer 200 Journal of Eonomi Behavior and Organization, 5, 2003, 459-485. To solve for the
More informationJournal of Mathematical Analysis and Applications
J. Math. Anal. Appl. 371 (010) 759 763 Contents lists available at SieneDiret Journal of Mathematial Analysis an Appliations www.elsevier.om/loate/jmaa Singular Sturm omparison theorems Dov Aharonov, Uri
More informationWavetech, LLC. Ultrafast Pulses and GVD. John O Hara Created: Dec. 6, 2013
Ultrafast Pulses and GVD John O Hara Created: De. 6, 3 Introdution This doument overs the basi onepts of group veloity dispersion (GVD) and ultrafast pulse propagation in an optial fiber. Neessarily, it
More informationBuckling loads of columns of regular polygon cross-section with constant volume and clamped ends
76 Bukling loads of olumns of regular polygon ross-setion with onstant volume and lamped ends Byoung Koo Lee Dept. of Civil Engineering, Wonkwang University, Iksan, Junuk, 7-79, Korea Email: kleest@wonkwang.a.kr
More informationEdexcel GCSE Maths Foundation Skills Book Ratio, proportion and rates of change 1
Guidane on the use of odes for this mark sheme ethod mark A C P ao oe ft Auray mark ark awarded independent of method Communiation mark Proof, proess or justifiation mark Corret answer only Or equivalent
More informationEigenvalues of tridiagonal matrix using Strum Sequence and Gerschgorin theorem
Eigenvalues o tridiagonal matrix using Strum Sequene and Gershgorin theorem T.D.Roopamala Department o Computer Siene and Engg., Sri Jayahamarajendra College o Engineering Mysore INDIA roopa_td@yahoo.o.in
More informationOptimal Distributed Estimation Fusion with Transformed Data
Optimal Distribute Estimation Fusion with Transforme Data Zhansheng Duan X. Rong Li Department of Eletrial Engineering University of New Orleans New Orleans LA 70148 U.S.A. Email: {zuanxli@uno.eu Abstrat
More informationCounting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs
Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
More informationComplete Shrimp Game Solution
Complete Shrimp Game Solution Florian Ederer Feruary 7, 207 The inverse demand urve is given y P (Q a ; Q ; Q ) = 00 0:5 (Q a + Q + Q ) The pro t funtion for rm i = fa; ; g is i (Q a ; Q ; Q ) = Q i [P
More informationBOOLEAN GRÖBNER BASIS REDUCTIONS ON FINITE FIELD DATAPATH CIRCUITS
BOOLEAN GRÖBNER BASIS REDUCTIONS ON FINITE FIELD DATAPATH CIRCUITS USING THE UNATE CUBE SET ALGEBRA Utkarsh Gupta, Priyank Kalla, Senior Member, IEEE, Vikas Rao Abstrat Reent evelopments in formal verifiation
More informationChapter 8 Hypothesis Testing
Leture 5 for BST 63: Statistial Theory II Kui Zhang, Spring Chapter 8 Hypothesis Testing Setion 8 Introdution Definition 8 A hypothesis is a statement about a population parameter Definition 8 The two
More informationLabeling Workflow Views with Fine-Grained Dependencies
Labeling Workflow Views with Fine-Graine Depenenies Zhuowei Bao Department of omputer an Information iene University of Pennsylvania Philaelphia, P 1914, U zhuowei@is.upenn.eu usan B. Davison Department
More informationQCLAS Sensor for Purity Monitoring in Medical Gas Supply Lines
DOI.56/sensoren6/P3. QLAS Sensor for Purity Monitoring in Medial Gas Supply Lines Henrik Zimmermann, Mathias Wiese, Alessandro Ragnoni neoplas ontrol GmbH, Walther-Rathenau-Str. 49a, 7489 Greifswald, Germany
More informationHe s Semi-Inverse Method and Ansatz Approach to look for Topological and Non-Topological Solutions Generalized Nonlinear Schrödinger Equation
Quant. Phys. Lett. 3, No. 2, 23-27 2014) 23 Quantum Physis Letters An International Journal http://x.oi.org/10.12785/qpl/030202 He s Semi-Inverse Metho an Ansatz Approah to look for Topologial an Non-Topologial
More informationReliability Optimization With Mixed Continuous-Discrete Random Variables and Parameters
Subroto Gunawan Researh Fellow Panos Y. Papalambros Professor e-mail: pyp@umih.eu Department of Mehanial Engineering, University of Mihigan, Ann Arbor, MI 4809 Reliability Optimization With Mixe Continuous-Disrete
More informationAn Integer Solution of Fractional Programming Problem
Gen. Math. Notes, Vol. 4, No., June 0, pp. -9 ISSN 9-784; Copyright ICSRS Publiation, 0 www.i-srs.org Available free online at http://www.geman.in An Integer Solution of Frational Programming Problem S.C.
More informationStochastic Analysis of a Compound Redundant System Involving Human Failure
Journal of Matheatis an Statistis (3): 47-43, 6 ISSN 549-3644 6 Siene Publiations Stohasti nalysis of a Copoun Reunant Syste Involving uan Failure Ritu Gupta, S.. Mittal an 3 C. M. Batra,3 Departent of
More informationHeat exchangers: Heat exchanger types:
Heat exhangers: he proess of heat exhange between two fluids that are at different temperatures and separated by a solid wall ours in many engineering appliations. he devie used to implement this exhange
More informationMODELS FOR VARIABLE RECRUITMENT (continued)
ODL FOR VARIABL RCRUITNT (ontinue) The other moel ommonly use to relate reruitment strength with the size of the parental spawning population is a moel evelope by Beverton an Holt (957, etion 6), whih
More informationc-perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories
-Perfet Hashing Shemes for Binary Trees, with Appliations to Parallel Memories (Extended Abstrat Gennaro Cordaso 1, Alberto Negro 1, Vittorio Sarano 1, and Arnold L.Rosenberg 2 1 Dipartimento di Informatia
More informationDesign of elementary switches for high power with minimal moving mass
Design of elementary swithes for high power with minimal moving mass alter Holaus ETH Zürih, High Voltage Laoratory Physistrasse 3, CH-89 Zurih Switzerlan ABSTRACT For the use in hyri systems an for synhronous
More informationLocal quality functions for graph clustering
Loal quality funtions for graph lustering Twan van Laarhoven Institute for Computing and Information Sienes Radoud University Nijmegen, The Netherlands Lorentz workshop on Clustering, Games and Axioms
More informationLecture 11 Buckling of Plates and Sections
Leture Bukling of lates and Setions rolem -: A simpl-supported retangular plate is sujeted to a uniaxial ompressive load N, as shown in the sketh elow. a 6 N N a) Calulate and ompare ukling oeffiients
More informationCoupled-cluster with active space selected higher amplitudes: Performance of seminatural orbitals for ground and excited state calculations
THE JOURNAL OF CHEMICAL PHYSICS 125, 174110 2006 Coupled-luster with ative spae seleted higher amplitudes: Performane of seminatural oritals for ground and exited state alulations Andreas Köhn a and Jeppe
More informationarxiv: v1 [cs.lg] 19 Jan 2018
Ative Learning of Strit Partial Orers: A Case Stuy on Conept Prerequisite Relations Chen Liang 1 Jianbo Ye 1 Han Zhao 2 Bart Pursel 1 C. Lee Giles 1 1 The Pennsylvania State University 2 Carnegie Mellon
More informationBidirectionalizing Graph Transformations
Biiretionalizing Graph Transformations Soihiro Hiaka Kazuhiro Inaa Zhenjiang Hu Hiroyuki Kato National Institute of Informatis, Japan {hiaka,hu,kinaa,kato}@nii.a.jp Kazutaka Matsua Tohoku University, Japan
More informationProblem set 6 for the course Theoretical Optics Sample Solutions
Karlsruher Institut für Tehnologie KIT) Institut für theoretishe Festkörperphysik SS01 Prof. Dr. G. Shön, Dr. R. Frank 15.06.01 http://www.tfp.kit.eu/stuium-lehre.php Tutorial: Group 1, Name: Group, Group
More informationSimultaneous and Sequential Auctions of Oligopoly Licenses
Simultaneous an Sequential Autions of Oligopoly Lienses Georgios Katsenos Institut für Mikroökonomik, Leibniz Universität Hannover September 1, 2007 Abstrat This paper ompares two proeures for alloating
More informationSensitivity Analysis in Markov Networks
Sensitivity Analysis in Markov Networks Hei Chan and Adnan Darwihe Computer Siene Department University of California, Los Angeles Los Angeles, CA 90095 {hei,darwihe}@s.ula.edu Abstrat This paper explores
More informationComplexity of Regularization RBF Networks
Complexity of Regularization RBF Networks Mark A Kon Department of Mathematis and Statistis Boston University Boston, MA 02215 mkon@buedu Leszek Plaskota Institute of Applied Mathematis University of Warsaw
More informationCMSC 451: Lecture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017
CMSC 451: Leture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017 Reading: Chapt 11 of KT and Set 54 of DPV Set Cover: An important lass of optimization problems involves overing a ertain domain,
More informationSubject: Introduction to Component Matching and Off-Design Operation % % ( (1) R T % (
16.50 Leture 0 Subjet: Introdution to Component Mathing and Off-Design Operation At this point it is well to reflet on whih of the many parameters we have introdued (like M, τ, τ t, ϑ t, f, et.) are free
More informationForce Reconstruction for Nonlinear Structures in Time Domain
Fore Reonstrution for Nonlinear Strutures in ime Domain Jie Liu 1, Bing Li 2, Meng Li 3, an Huihui Miao 4 1,2,3,4 State Key Laboratory for Manufaturing Systems Engineering, Xi an Jiaotong niversity, Xi
More informationPN Code Tracking Loops
Wireless Information Transmission System Lab. PN Coe Traking Loops Institute of Communiations Engineering National Sun Yat-sen University Introution Coe synhronization is generally arrie out in two steps
More informationConveyor trajectory discharge angles
University of Wollongong Researh Online Faulty of Engineering - Papers (Arhive) Faulty of Engineering and Information Sienes 007 Conveyor trajetory disharge angles David B. Hastie University of Wollongong,
More informationFINITE WORD LENGTH EFFECTS IN DSP
FINITE WORD LENGTH EFFECTS IN DSP PREPARED BY GUIDED BY Snehal Gor Dr. Srianth T. ABSTRACT We now that omputers store numbers not with infinite preision but rather in some approximation that an be paed
More informationRigorous prediction of quadratic hyperchaotic attractors of the plane
Rigorous predition of quadrati hyperhaoti attrators of the plane Zeraoulia Elhadj 1, J. C. Sprott 2 1 Department of Mathematis, University of Tébéssa, 12000), Algeria. E-mail: zeraoulia@mail.univ-tebessa.dz
More informationImplementing the Law of Sines to solve SAS triangles
Implementing the Law of Sines to solve SAS triangles June 8, 009 Konstantine Zelator Dept. of Math an Computer Siene Rhoe Islan College 600 Mount Pleasant Avenue Proviene, RI 0908 U.S.A. e-mail : kzelator@ri.eu
More informationLECTURE NOTES FOR , FALL 2004
LECTURE NOTES FOR 18.155, FALL 2004 83 12. Cone support and wavefront set In disussing the singular support of a tempered distibution above, notie that singsupp(u) = only implies that u C (R n ), not as
More informationSRC Research. Report. An Efficient Matching Algorithm for a High-Throughput, Low-Latency Data Switch. Thomas L. Rodeheffer and James B.
Novemer 5, 998 SRC Researh Report 6 An Effiient Mathing Algorithm for a High-Throughput, Low-Lateny Data Swith Thomas L Rodeheffer and James B Saxe Systems Researh Center 30 Lytton Avenue Palo Alto, CA
More informationThe Effectiveness of the Linear Hull Effect
The Effetiveness of the Linear Hull Effet S. Murphy Tehnial Report RHUL MA 009 9 6 Otober 009 Department of Mathematis Royal Holloway, University of London Egham, Surrey TW0 0EX, England http://www.rhul.a.uk/mathematis/tehreports
More informationRelativistic Dynamics
Chapter 7 Relativisti Dynamis 7.1 General Priniples of Dynamis 7.2 Relativisti Ation As stated in Setion A.2, all of dynamis is derived from the priniple of least ation. Thus it is our hore to find a suitable
More information1. A dependent variable is also known as a(n). a. explanatory variable b. control variable c. predictor variable d. response variable ANSWER:
1. A epenent variale is also known as a(n). a. explanatory variale. ontrol variale. preitor variale. response variale FEEDBACK: A epenent variale is known as a response variale. Definition of the Simple
More informationDisassembly matrix for disassembly processes of products
int j pro res, 00, vol 40, no, 55± Disassemly matrix for isassemly proesses of prouts YUAN MAO HUANGy* an CHUN-TING HUANGy The stuy proposes a feasile an e etive metho that improves existing methos for
More informationDesigning Against Size Effect on Shear Strength of Reinforced Concrete Beams Without Stirrups
Designing Against Size Effet on Shear Strength of Reinfore Conrete Beams Without Stirrups By Zeněk P. Bažant an Qiang Yu Abstrat: The shear failure of reinfore onrete beams is a very omplex frature phenomenon
More informationCompression Members Local Buckling and Section Classification
Compression Memers Loal Bukling and Setion Classifiation Summary: Strutural setions may e onsidered as an assemly of individual plate elements. Plate elements may e internal (e.g. the wes of open eams
More informationPhysics; Watching the Game From the Outside
Physis; Wathing the Game From the Outside Roald C. Maximo Feb It is a good thing to have two ways of looking at a subjet, and also admit that there are two ways of looking at it. James Clerk Maxwell, on
More informationAn Algorithm to Remove Asynchronous ROMs in Circuits with Cycles
211 eon nternational Conferene on Networking an Computing An Algorithm to emove Asynhronous Ms in Ciruits with Cyles M. Nazrul slam Monal, Koji Nakano, an Yasuaki to Department of nformation Engineering,
More informationLinear Capacity Scaling in Wireless Networks: Beyond Physical Limits?
Linear Capaity Saling in Wireless Networks: Beyon Physial Limits? Ayfer Özgür, Olivier Lévêque EPFL, Switzerlan {ayfer.ozgur, olivier.leveque}@epfl.h Davi Tse University of California at Berkeley tse@ees.berkeley.eu
More informationNon-Abelian quantum Hall states and their quasiparticles: From the pattern of zeros to vertex algebra
Non-Abelian quantum Hall states and their quasipartiles: From the pattern of zeros to vertex algebra Yuan-Ming Lu, 1 Xiao-Gang Wen,, Zhenghan Wang, 4 and Ziqiang Wang 1 1 Department of Physis, Boston College,
More informationSOA/CAS MAY 2003 COURSE 1 EXAM SOLUTIONS
SOA/CAS MAY 2003 COURSE 1 EXAM SOLUTIONS Prepared by S. Broverman e-mail 2brove@rogers.om website http://members.rogers.om/2brove 1. We identify the following events:. - wathed gymnastis, ) - wathed baseball,
More informationSensitivity analysis for linear optimization problem with fuzzy data in the objective function
Sensitivity analysis for linear optimization problem with fuzzy data in the objetive funtion Stephan Dempe, Tatiana Starostina May 5, 2004 Abstrat Linear programming problems with fuzzy oeffiients in the
More informationA Primer on the Statistics of Longest Increasing Subsequences and Quantum States
A Primer on the Statistis of Longest Inreasing Subsequenes an Quantum States Ryan O Donnell John Wright Abstrat We give an introution to the statistis of quantum states, with a fous on reent results giving
More informationProduct Policy in Markets with Word-of-Mouth Communication. Technical Appendix
rodut oliy in Markets with Word-of-Mouth Communiation Tehnial Appendix August 05 Miro-Model for Inreasing Awareness In the paper, we make the assumption that awareness is inreasing in ustomer type. I.e.,
More informationHankel Optimal Model Order Reduction 1
Massahusetts Institute of Tehnology Department of Eletrial Engineering and Computer Siene 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Hankel Optimal Model Order Redution 1 This leture overs both
More informationSequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson & J. Fischer) January 21,
Sequene Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson & J. Fisher) January 21, 201511 9 Suffix Trees and Suffix Arrays This leture is based on the following soures, whih are all reommended
More information1. INTRODUCTION. l t t r. h t h w. t f t w. h p h s. d b D F. b b d c. L D s
Rapid Assessment of Seismi Safety of Elevated ater Tanks with FRAME Staging 1. NTRODUCTON 1.1 ntrodution ater tanks are lifeline items in the aftermath of earthquakes. The urrent pratie of designing elevated
More information23.1 Tuning controllers, in the large view Quoting from Section 16.7:
Lesson 23. Tuning a real ontroller - modeling, proess identifiation, fine tuning 23.0 Context We have learned to view proesses as dynami systems, taking are to identify their input, intermediate, and output
More informationError Bounds for Context Reduction and Feature Omission
Error Bounds for Context Redution and Feature Omission Eugen Bek, Ralf Shlüter, Hermann Ney,2 Human Language Tehnology and Pattern Reognition, Computer Siene Department RWTH Aahen University, Ahornstr.
More informationOn the sustainability of collusion in Bertrand supergames with discrete pricing and nonlinear demand
PRA unih Personal RePE Arhive On the sustainability of ollusion in Bertran supergames with isrete priing an nonlinear eman Paul R. Zimmerman US Feeral Trae Commission 25. January 2010 Online at http://mpra.ub.uni-muenhen.e/20249/
More informationRobust Recovery of Signals From a Structured Union of Subspaces
Robust Reovery of Signals From a Strutured Union of Subspaes 1 Yonina C. Eldar, Senior Member, IEEE and Moshe Mishali, Student Member, IEEE arxiv:87.4581v2 [nlin.cg] 3 Mar 29 Abstrat Traditional sampling
More informationA NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM
NETWORK SIMPLEX LGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM Cen Çalışan, Utah Valley University, 800 W. University Parway, Orem, UT 84058, 801-863-6487, en.alisan@uvu.edu BSTRCT The minimum
More informationI 3 2 = I I 4 = 2A
ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents
More information3 Tidal systems modelling: ASMITA model
3 Tidal systems modelling: ASMITA model 3.1 Introdution For many pratial appliations, simulation and predition of oastal behaviour (morphologial development of shorefae, beahes and dunes) at a ertain level
More information