Seidel s Trapezoidal Partitioning Algorithm
|
|
- Alban Melton
- 6 years ago
- Views:
Transcription
1 CS68: Geometic Agoithms Handout #6 Design and Anaysis Oigina Handout #6 Stanfod Univesity Tuesday, 5 Febuay 99 Oigina Lectue #7: 30 Januay 99 Topics: Seide s Tapezoida Patitioning Agoithm Scibe: Michae Godwasse Seide s Tapezoida Patitioning Agoithm Oveview A Randomized Incementa Agoithm. Idea: incementa agoithms ae usuay simpe. We buid a stuctue by adding objects one at a time. The pobem is that they often ead to poo pefomance. As a somewhat simpified exampe, suppose we buid a seach tee fo a set of keys by inseting the keys one at a time, without ebaancing. If the keys ae inseted in ode, the tee wi be unbaanced and the constuction wi take Θ(n ) time. Randomization can hep with this pobem: if we inset keys in andom ode, we expect to get a baanced seach tee in O(n og n) time. By andomizing the ode in which we add objects, we speed up the agoithm. The andomization in andomized incementa agoithms has two key popeties. Fist, the andomization is intena to the agoithm; we make no assumptions about the input. Instead, the agoithm does its own coin fips. Second, the andomization is of the Las Vegas type: the agoithm is guaanteed to give a coect answe (whateve that means in the context of the pobem), but the unning time is not guaanteed in any paticua instance. Instead, we tak about the expected unning time, based on the agoithm s intena andomization. Content of Lectue. Basic agoithm and data stuctues. Anaysis 3. Randomized Anaysis O(n og n) 4. Tacing and anaysis of it 5. Extensions
2 CS68: 6 Data stuctues Figue : The mappings in T(S). Let S be a set of ine segments (with the usua non-degeneacy conditions, such as no two endpoints diecty above and beow one anothe, and no vetica ine segments). Let T(S) be a tapezoida patitioning (aso caed a tapezoidation ). It shoud et us map any tapezoid τ to its bounding segments; and its hoizontay neighboing tapezoids (thee ae at most fou). These mappings ae iustated in fig.. This epesentation ets us tace a poygona cuve C though T(S) in time O( C + k), whee k is the numbe of tapezoids C intesects, povided C S =. Let Q(S) be a point ocation stuctue fo T(S). That is, given a quey point q = (q x, q y ), it aows us to detemine what tapezoid that point is in. Q(S) is a diected acycic gaph with one souce, and with one sink pe tapezoid of T(S). The intena nodes ae of two types:. X-nodes. (See fig..) When we get to these nodes, we ask, is point q to the eft o ight of a paticua X-vaue? We then banch accodingy.. Y-nodes. (See fig. 3.) Hee we ask, is point q above o beow a paticua ine? So to answe a quey (i.e. identify the tapezoid containing point q), we foow a diected path in Q(S), banching to one of the two descendants at each intena node,
3 CS68: 6 3 X-vaue Figue : An X-node. ine equation Figue 3: A Y-node. and stopping at a sink (i.e. a tapezoid). (See fig. 4.) Now, et e S be a segment ab (a x < b x ) such that e cosses no segment of S. Define S = S {s}. Question: How do we poduce T(S ) fom T(S), and Q(S ) fom Q(S)? See fig. 5. (Note: in this figue, we have S = {e } and the new segment is e.) The basic steps ae: inset eft endpoint, inset ight endpoint, and inset the segment between them. The fist thing to ask is, does the new segment shae an endpoint with any of the existing segments? If not, we add new vetica theads coesponding to the new endpoints. This spits tapezoid 3 into new tapezoids 5 and 6, and spits 4 into 7 and 8 (see fig. 6). But, of couse, e itsef futhe spits 6 into 9 and 0. It aso spits 7, but 7 s bottom haf is then meged with 0 (see fig. 7). We pefom simia opeations on Q(S), as shown in the figues. (Indeed, since we need Q(S) to hep us ocate tapezoids in T(S), we shoud do these opeations in paae.) Anaysis of unning time The unning time has two pats:
4 4 CS68: 6 T(S) Q(S) e 4 e (x-coodinate vaues) Figue 4: An exampe of a tapezoida patitioning T(S), and the coesponding point ocation stuctue Q(S). e 4 e 3 Figue 5: Adding a new segment. quey time, i.e. point ocation in Q(S); and tacing time though the tapezoids in T(S), incuding the time to pefom spitting and meging opeations. Now, the tacing time is O() pus a tem popotiona to the numbe of theads in the new patitioning that abut upon e. Note that this does not incude the theads unning though the endpoints; fo instance, the segment in fig. 8 has ony one thead abutting on it.
5 CS68: 6 5 e 7 8 e 5 6 e Figue 6: Intemediate stage in adding a segment e 9 8 e 5 0 e e 8 5 e 9 0 Figue 7: Adding a segment. T(S) and Q(S) have now been fuy updated. In the wost case, this coud make fo a ot of tacing time. Fo instance, in the poygon shown in fig., if we inset the segments in countecockwise poygon ode stating at the uppe ight, the tace time is Θ( S ). The point ocation cost may aso be excessive. If the segments shown on the eft side of fig. 9 ae inseted bottom to top, the quey data stuctue is vey unbaanced, as shown on the ight side of fig. 9, and the tota quey time is Θ( S ). But what if we ook at the agoithm s aveage o expected pefomance, athe than its wost-case pefomance?
6 6 CS68: 6 Figue 8: A segment with just one thead abutting on it. Figue 9: (Left) A set of segments in T which, if inseted bottom to top, eads to a wost-case quey time. (Right) The esuting quey stuctue. Randomized anaysis of unning time Let e, e,..., e n be a andom odeing of the segments of S, and et S i = {e, e,..., e i } (a pefix of S), fo 0 i n. Lemma. The expected cost of tacing e i though T(S i ) is 4. Poof: Define the degee of a segment in a patitioning, deg(e, T(S)), as the numbe of vetica theads that abut upon e (e S). Then deg(e, T(S i )) 4i () e S i This is because each thead (thee ae i of them) hits segments. andom e i, the expected degee E(deg(e i, T(S i ))) is at most 4. Now, eca that H n = n i= i = Θ(og n). So fo a
7 CS68: 6 7 e i q Figue 0: Hee, the addition of e i ceates two new decision eves (instead of one) in the seach path fo q. Lemma. Fo any quey point q, the expected numbe of key compaisons (ove a odeings of S) to ocate q in Q(S n ) is 5H n = O(og n). In othe wods, the numbe of decision nodes in Q(S) that we coss to get to q is O(og n). Poof: We use backwad anaysis. We wi fist find how many exta decision nodes we have to coss, on aveage, as a esut of adding a singe edge. Then we add up a those incementa costs to get the tota cost (effectivey, buiding up Q(S) fom scatch). Suppose, then, that q ies in tapezoid τ i, whee τ i T(S i ), and q aso ies in τ i T(S i ). If we know τ i (and its coesponding sink in Q(S i )), what is the expected cost E i of finding τ i? We, unde what cicumstances wi we have to go though an exta decision eve because of the new edge e i? That is, when is τ i = τ i? This occus if τ i s uppe bounding edge is e i (an event with pobabiity i ); if τ i s owe bounding edge is e i (an event with pobabiity i ); if τ i s eft bounding thead was geneated by e i (an event with pobabiity i ); o if τ i s ight bounding thead was geneated by e i (an event with pobabiity i ). One moe decision eve is possibe. Fo the situation shown in fig. 0, the addition of e i caused two new compaisons to be made, not one. This situation aso has pobabiity i Ṫheefoe, the expected incementa cost E i is 5 i, and the expected tota cost of ocating q is i= n E i = 5H n.
8 8 CS68: 6 Figue : A poygon whose bounday we woud not want to tace. With these emmas, we can now state the foowing theoem, which appies to abitay sets of disjoint ine segments. Theoem 3. Let S be a set of n segments, disjoint except fo thei endpoints. Then. We can buid T(S) and Q(S) in expected O(n og n) time.. Expected Q(S) = O(n). the expected numbe of tapezoids spit is O(n) 3. Expected quey time fo any point q in Q(S) is O(og n). The second pat of this theoem foows fom Lemma. The thid pat is a estatement of Lemma. The fist pat is a consequence of Lemmas and. Whee does a that time go? It goes to point ocation. How, then, can we avoid point ocation, in the specia case in which the segments fom a poygon? We, we coud stat fom the endpoints of eaie segments, i.e. inset the segments in poygon ode. But then we woud ose the benefits of andomization. Fo exampe, with the poygon in fig., the cost of tacing aound it goes up as Ω(n ). So et us use a compomise soution. We wi inset the segments in andom ode, but peiodicay tace the poygona bounday to speed up point ocation fo ate insetions. (Detais beow.) Lemma 4. Fo any q, if we know that q τ j (whee τ j T(S j )), then the expected cost of ocating q in T(S k ), k j, is 5(H k H j ) = O(og k j ). Poof: The poof is amost exacty the same as that of Lemma, above. Lemma 5. Let R be a andom subset of S, with size R =. Let Z be the numbe of intesections between T(R) and S\R. [Reca that S\R denotes the segments of S that ae not in R.] Then the expected vaue of Z is 4(n ).
9 CS68: 6 9 Poof: Fo any e (S\R), the numbe of intesections between e and T(R) is deg(e, T(R {e})). So E(Z) = ( n ) R S R = fom (), = ( n ) R S R =+ ( n ) 4 R R S R =+ = 4( + ) ( n + ) ( n ) = 4(n ) deg(e, T(R {e})) e (S\R) e R deg(e, T(R )) i Now, define og (i) {}}{ n = og og og n, and og n = max(h og (h) ). n Aso et N(h) =. og (h) n With these definitions, we now pesent the fina vesion of Seide s agoithm. Seide s Tapezoida Patitioning Agoithm. Geneate a andom ode s, s,..., s n of the segments of P.. Geneate T(S ) and Q(S ) [initiaization]. 3. fo h = to og n do a. fo i = N(h ) + to N(h) do Inset segment e i, poducing T(S i ) and Q(S i ) fom T(S i ) and Q(S i ). b. Tace P though T(S N(h) ) to ocate the endpoints of a e j, fo j > N(h). 4. fo i = N(og n) + to n do Inset e i, poducing T(S i ) and Q(S i ) fom T(S i ) and Q(S i ). Anaysis Let us examine the expected unning times of each step:. O(n). O() 3a. ( N(h) N(h) O() fom Lemma + O(og( N(h ) ) )) fom Lemma
10 0 CS68: 6 Now, N(h) og( N(h ) ) og( n N(h ) ) og(og (h ) n) = og (h) n. Theefoe, step (3a) takes N(h) O(og (h) n) = O(n) time. 3b. O(n), by Lemma 5. n 4. O(n) og( N(og n) ) = og n) og(og n og = O() }{{} (as in 3a) The tota unning time is O(n) pe phase. Thee ae O(og n) phases, so the fina unning time of the agoithm is O(n og n). This competes the poof of the foowing impoved vesion of Theoem 3. Theoem 6. Let S be a set of n segments that fom a simpe poygon. Then. We can buid T(S) and Q(S) in expected O(n og n) time.. Expected Q(S) = O(n). 3. Expected quey time fo any point q in Q(S) is O(og n). Impementation The agoithm was un on a compute as a demonstation at the end of cass, which seved to emphasize the basic steps invoved in this agoithm: () add a segment at andom; () ocate its endpoints; (3) inset tapezoids. Evey now and then, though, the agoithm woud seach aound the bounday of the poygon. As it did so, it ocated the vetices that had not yet been paced, in tems of the existing tapezoids. Then ate, when it needed to ocate those endpoints, it was abe to use that infomation to stat its seaches of Q(S) fom futhe down the DAG (theeby educing its seach time). This is the compomise discussed eaie on page 8. Extensions Seide s agoithm aso appies to moe genea objects than simpe poygons. Theoem 6 appies to any coection of ine segments, disjoint except fo thei endpoints, that fom a staight-ine embedding of a connected pana gaph we epace the poygon tacing step by a gaph tavesa, but a othe steps emain unchanged. Combining this obsevation with Theoem 3, we get the foowing theoem.
11 CS68: 6 Theoem 7. Let S be a set of n segments that fom a staight-ine embedding of a pana gaph with k connected components. Then. We can buid T(S) and Q(S) in expected O(k og n + n og n) time.. Expected Q(S) = O(n). 3. Expected quey time fo any point q in Q(S) is O(og n).
Merging to ordered sequences. Efficient (Parallel) Sorting. Merging (cont.)
Efficient (Paae) Soting One of the most fequent opeations pefomed by computes is oganising (soting) data The access to soted data is moe convenient/faste Thee is a constant need fo good soting agoithms
More informationHomework 1 Solutions CSE 101 Summer 2017
Homewok 1 Soutions CSE 101 Summe 2017 1 Waming Up 1.1 Pobem and Pobem Instance Find the smaest numbe in an aay of n integes a 1, a 2,..., a n. What is the input? What is the output? Is this a pobem o a
More informationStraight-line Drawings of Outerplanar Graphs in O(dn log n) Area
CCCG 2007, Ottaa, Ontaio, August 20 22, 2007 Staight-ine Daings of Outepana Gaphs in O(dn og n) Aea Fabizio Fati Abstact We sho an agoithm fo constucting O(dn og n) aea outepana staight-ine daings of n-etex
More information= ρ. Since this equation is applied to an arbitrary point in space, we can use it to determine the charge density once we know the field.
Gauss s Law In diffeentia fom D = ρ. ince this equation is appied to an abita point in space, we can use it to detemine the chage densit once we know the fied. (We can use this equation to ve fo the fied
More informationJackson 3.3 Homework Problem Solution Dr. Christopher S. Baird University of Massachusetts Lowell
Jackson 3.3 Homewok Pobem Soution D. Chistophe S. Baid Univesity of Massachusetts Lowe POBLEM: A thin, fat, conducting, cicua disc of adius is ocated in the x-y pane with its cente at the oigin, and is
More informationThe Substring Search Problem
The Substing Seach Poblem One algoithm which is used in a vaiety of applications is the family of substing seach algoithms. These algoithms allow a use to detemine if, given two chaacte stings, one is
More informationMath 301: The Erdős-Stone-Simonovitz Theorem and Extremal Numbers for Bipartite Graphs
Math 30: The Edős-Stone-Simonovitz Theoem and Extemal Numbes fo Bipatite Gaphs May Radcliffe The Edős-Stone-Simonovitz Theoem Recall, in class we poved Tuán s Gaph Theoem, namely Theoem Tuán s Theoem Let
More informationA Bijective Approach to the Permutational Power of a Priority Queue
A Bijective Appoach to the Pemutational Powe of a Pioity Queue Ia M. Gessel Kuang-Yeh Wang Depatment of Mathematics Bandeis Univesity Waltham, MA 02254-9110 Abstact A pioity queue tansfoms an input pemutation
More informationOn the ratio of maximum and minimum degree in maximal intersecting families
On the atio of maximum and minimum degee in maximal intesecting families Zoltán Lóánt Nagy Lale Özkahya Balázs Patkós Máté Vize Septembe 5, 011 Abstact To study how balanced o unbalanced a maximal intesecting
More informationStanford University CS259Q: Quantum Computing Handout 8 Luca Trevisan October 18, 2012
Stanfod Univesity CS59Q: Quantum Computing Handout 8 Luca Tevisan Octobe 8, 0 Lectue 8 In which we use the quantum Fouie tansfom to solve the peiod-finding poblem. The Peiod Finding Poblem Let f : {0,...,
More informationCapacity of Data Collection in Arbitrary Wireless Sensor Networks
This fu text pape was pee eviewed at the diection of IEEE Communications Society subject matte expets fo pubication in the IEEE INFOCOM 2010 poceedings This pape was pesented as pat of the Mini-Confeence
More informationTopic 4a Introduction to Root Finding & Bracketing Methods
/8/18 Couse Instucto D. Raymond C. Rumpf Office: A 337 Phone: (915) 747 6958 E Mail: cumpf@utep.edu Topic 4a Intoduction to Root Finding & Backeting Methods EE 4386/531 Computational Methods in EE Outline
More informationFI 2201 Electromagnetism
F Eectomagnetism exane. skana, Ph.D. Physics of Magnetism an Photonics Reseach Goup Magnetostatics MGNET VETOR POTENTL, MULTPOLE EXPNSON Vecto Potentia Just as E pemitte us to intouce a scaa potentia V
More informationLecture 1. time, say t=0, to find the wavefunction at any subsequent time t. This can be carried out by
Lectue The Schödinge equation In quantum mechanics, the fundamenta quantity that descibes both the patice-ike and waveike chaacteistics of patices is wavefunction, Ψ(. The pobabiity of finding a patice
More informationRelating Scattering Amplitudes to Bound States
Reating Scatteing Ampitudes to Bound States Michae Fowe UVa. 1/17/8 Low Enegy Appoximations fo the S Matix In this section we examine the popeties of the patia-wave scatteing matix ( ) = 1+ ( ) S k ikf
More informationConducting fuzzy division by using linear programming
WSES TRNSCTIONS on INFORMTION SCIENCE & PPLICTIONS Muat pe Basaan, Cagdas Hakan adag, Cem Kadia Conducting fuzzy division by using inea pogamming MURT LPER BSRN Depatment of Mathematics Nigde Univesity
More informationOn intersecting a set of parallel line segments with a convex polygon of minimum area
On intesecting a set of aae ine segments with a convex oygon of minimum aea Asish Mukhoadhyay Schoo of Comute Science Univesity of Windso, Canada Eugene Geene Schoo of Comute Science Univesity of Windso,
More informationOn the ratio of maximum and minimum degree in maximal intersecting families
On the atio of maximum and minimum degee in maximal intesecting families Zoltán Lóánt Nagy Lale Özkahya Balázs Patkós Máté Vize Mach 6, 013 Abstact To study how balanced o unbalanced a maximal intesecting
More informationA Sardinas-Patterson Characterization Theorem for SE-codes
A Sadinas-Patteson Chaacteization Theoem fo SE-codes Ionuţ Popa,Bogdan Paşaniuc Facuty of Compute Science, A.I.Cuza Univesity of Iaşi, 6600 Iaşi, Romania May 0, 2004 Abstact The aim of this pape is to
More informationObjectives. We will also get to know about the wavefunction and its use in developing the concept of the structure of atoms.
Modue "Atomic physics and atomic stuctue" Lectue 7 Quantum Mechanica teatment of One-eecton atoms Page 1 Objectives In this ectue, we wi appy the Schodinge Equation to the simpe system Hydogen and compae
More informationMath 2263 Solutions for Spring 2003 Final Exam
Math 6 Solutions fo Sping Final Exam ) A staightfowad appoach to finding the tangent plane to a suface at a point ( x, y, z ) would be to expess the cuve as an explicit function z = f ( x, y ), calculate
More informationFractional Zero Forcing via Three-color Forcing Games
Factional Zeo Focing via Thee-colo Focing Games Leslie Hogben Kevin F. Palmowski David E. Robeson Michael Young May 13, 2015 Abstact An -fold analogue of the positive semidefinite zeo focing pocess that
More information1 Explicit Explore or Exploit (E 3 ) Algorithm
2.997 Decision-Making in Lage-Scale Systems Mach 3 MIT, Sping 2004 Handout #2 Lectue Note 9 Explicit Exploe o Exploit (E 3 ) Algoithm Last lectue, we studied the Q-leaning algoithm: [ ] Q t+ (x t, a t
More informationClassical Worm algorithms (WA)
Classical Wom algoithms (WA) WA was oiginally intoduced fo quantum statistical models by Pokof ev, Svistunov and Tupitsyn (997), and late genealized to classical models by Pokof ev and Svistunov (200).
More informationPositivity results for cluster algebras from surfaces
Positivity esuts fo custe agebas fom sufaces Gegg Musike (MSRI/MIT) (Joint wok with Raf Schiffe (Univesity of Connecticut) and Lauen Wiiams (Univesity of Caifonia, Bekeey)) AMS 009 Easten Sectiona Octobe,
More informationSplay Trees Handout. Last time we discussed amortized analysis of data structures
Spla Tees Handout Amotied Analsis Last time we discussed amotied analsis of data stuctues A wa of epessing that even though the wost-case pefomance of an opeation can be bad, the total pefomance of a sequence
More informationCourse Updates. Reminders: 1) Assignment #10 due next Wednesday. 2) Midterm #2 take-home Friday. 3) Quiz # 5 next week. 4) Inductance, Inductors, RLC
Couse Updates http://www.phys.hawaii.edu/~vane/phys7-sp10/physics7.htm Remindes: 1) Assignment #10 due next Wednesday ) Midtem # take-home Fiday 3) Quiz # 5 next week 4) Inductance, Inductos, RLC Mutua
More informationAST 121S: The origin and evolution of the Universe. Introduction to Mathematical Handout 1
Please ead this fist... AST S: The oigin and evolution of the Univese Intoduction to Mathematical Handout This is an unusually long hand-out and one which uses in places mathematics that you may not be
More informationExploration of the three-person duel
Exploation of the thee-peson duel Andy Paish 15 August 2006 1 The duel Pictue a duel: two shootes facing one anothe, taking tuns fiing at one anothe, each with a fixed pobability of hitting his opponent.
More informationMutual Inductance. If current i 1 is time varying, then the Φ B2 flux is varying and this induces an emf ε 2 in coil 2, the emf is
Mutua Inductance If we have a constant cuent i in coi, a constant magnetic fied is ceated and this poduces a constant magnetic fux in coi. Since the Φ B is constant, thee O induced cuent in coi. If cuent
More informationTheorem on the differentiation of a composite function with a vector argument
Poceedings of the Estonian Academy of Sciences 59 3 95 doi:.376/poc..3. Avaiae onine at www.eap.ee/poceedings Theoem on the diffeentiation of a composite function with a vecto agument Vadim Kapain and
More informationHandout: IS/LM Model
Econ 32 - IS/L odel Notes Handout: IS/L odel IS Cuve Deivation Figue 4-4 in the textbook explains one deivation of the IS cuve. This deivation uses the Induced Savings Function fom Chapte 3. Hee, I descibe
More informationand Slater Sum Rule Method * M L = 0, M S = 0 block: L L+ L 2
5.7 Lectue #4 e / ij and Sate Sum Rue Method 4 - LAST TIME:. L,S method fo setting up NLM L SM S many-eecton basis states in tems of inea combination of Sate deteminants * M L = 0, M S = 0 boc: L L+ L
More informationPROBLEM SET #1 SOLUTIONS by Robert A. DiStasio Jr.
POBLM S # SOLUIONS by obet A. DiStasio J. Q. he Bon-Oppenheime appoximation is the standad way of appoximating the gound state of a molecula system. Wite down the conditions that detemine the tonic and
More informationOther quantum algorithms
Chapte 3 Othe uatum agoithms 3. Quick emide of Gove s agoithm We peset hee a uick emide of Gove s agoithm. Iput: a fuctio f : {0,}! {0,}. Goa: fid x such that f (x) =. Seach pobem We have a uatum access
More informationLectures on Multivariable Feedback Control
Lectues on Mutivaiabe Feedback onto i Kaimpou epatment of Eectica Engineeing, Facuty of Engineeing, Fedowsi Univesity of Mashhad (Septembe 9 hapte 4: Stabiity of Mutivaiabe Feedback onto Systems 4- We-Posedness
More informationSection 8.2 Polar Coordinates
Section 8. Pola Coodinates 467 Section 8. Pola Coodinates The coodinate system we ae most familia with is called the Catesian coodinate system, a ectangula plane divided into fou quadants by the hoizontal
More informationCALCULUS II Vectors. Paul Dawkins
CALCULUS II Vectos Paul Dawkins Table of Contents Peface... ii Vectos... 3 Intoduction... 3 Vectos The Basics... 4 Vecto Aithmetic... 8 Dot Poduct... 13 Coss Poduct... 21 2007 Paul Dawkins i http://tutoial.math.lama.edu/tems.aspx
More informationWeb-based Supplementary Materials for. Controlling False Discoveries in Multidimensional Directional Decisions, with
Web-based Supplementay Mateials fo Contolling False Discoveies in Multidimensional Diectional Decisions, with Applications to Gene Expession Data on Odeed Categoies Wenge Guo Biostatistics Banch, National
More informationCoordinate Geometry. = k2 e 2. 1 e + x. 1 e. ke ) 2. We now write = a, and shift the origin to the point (a, 0). Referred to
Coodinate Geomet Conic sections These ae pane cuves which can be descibed as the intesection of a cone with panes oiented in vaious diections. It can be demonstated that the ocus of a point which moves
More informationPHYS 705: Classical Mechanics. Central Force Problems I
1 PHYS 705: Cassica Mechanics Centa Foce Pobems I Two-Body Centa Foce Pobem Histoica Backgound: Kepe s Laws on ceestia bodies (~1605) - Based his 3 aws on obsevationa data fom Tycho Bahe - Fomuate his
More informationMath 1105: Calculus I (Math/Sci majors) MWF 11am / 12pm, Campion 235 Written homework 3
Math : alculus I Math/Sci majos MWF am / pm, ampion Witten homewok Review: p 94, p 977,8,9,6, 6: p 46, 6: p 4964b,c,69, 6: p 47,6 p 94, Evaluate the following it by identifying the integal that it epesents:
More informationJackson 4.7 Homework Problem Solution Dr. Christopher S. Baird University of Massachusetts Lowell
Jackson 4.7 Homewok obem Soution D. Chistophe S. Baid Univesity of Massachusetts Lowe ROBLEM: A ocaized distibution of chage has a chage density ρ()= 6 e sin θ (a) Make a mutipoe expansion of the potentia
More informationEncapsulation theory: radial encapsulation. Edmund Kirwan *
Encapsulation theoy: adial encapsulation. Edmund Kiwan * www.edmundkiwan.com Abstact This pape intoduces the concept of adial encapsulation, wheeby dependencies ae constained to act fom subsets towads
More informationANA BERRIZBEITIA, LUIS A. MEDINA, ALEXANDER C. MOLL, VICTOR H. MOLL, AND LAINE NOBLE
THE p-adic VALUATION OF STIRLING NUMBERS ANA BERRIZBEITIA, LUIS A. MEDINA, ALEXANDER C. MOLL, VICTOR H. MOLL, AND LAINE NOBLE Abstact. Let p > 2 be a pime. The p-adic valuation of Stiling numbes of the
More informationPHYS 705: Classical Mechanics. Central Force Problems II
PHYS 75: Cassica Mechanics Centa Foce Pobems II Obits in Centa Foce Pobem Sppose we e inteested moe in the shape of the obit, (not necessay the time evotion) Then, a sotion fo = () o = () wod be moe sef!
More information10/04/18. P [P(x)] 1 negl(n).
Mastemath, Sping 208 Into to Lattice lgs & Cypto Lectue 0 0/04/8 Lectues: D. Dadush, L. Ducas Scibe: K. de Boe Intoduction In this lectue, we will teat two main pats. Duing the fist pat we continue the
More informationPhysics 2A Chapter 10 - Moment of Inertia Fall 2018
Physics Chapte 0 - oment of netia Fall 08 The moment of inetia of a otating object is a measue of its otational inetia in the same way that the mass of an object is a measue of its inetia fo linea motion.
More informationMechanics Physics 151
Mechanics Physics 5 Lectue 5 Centa Foce Pobem (Chapte 3) What We Did Last Time Intoduced Hamiton s Pincipe Action intega is stationay fo the actua path Deived Lagange s Equations Used cacuus of vaiation
More information6 Matrix Concentration Bounds
6 Matix Concentation Bounds Concentation bounds ae inequalities that bound pobabilities of deviations by a andom vaiable fom some value, often its mean. Infomally, they show the pobability that a andom
More informationMechanics Physics 151
Mechanics Physics 5 Lectue 5 Centa Foce Pobem (Chapte 3) What We Did Last Time Intoduced Hamiton s Pincipe Action intega is stationay fo the actua path Deived Lagange s Equations Used cacuus of vaiation
More informationNew problems in universal algebraic geometry illustrated by boolean equations
New poblems in univesal algebaic geomety illustated by boolean equations axiv:1611.00152v2 [math.ra] 25 Nov 2016 Atem N. Shevlyakov Novembe 28, 2016 Abstact We discuss new poblems in univesal algebaic
More information4/18/2005. Statistical Learning Theory
Statistical Leaning Theoy Statistical Leaning Theoy A model of supevised leaning consists of: a Envionment - Supplying a vecto x with a fixed but unknown pdf F x (x b Teache. It povides a desied esponse
More informationPositivity for cluster algebras from surfaces
Positivity fo custe agebas fom sufaces Gegg Musike (MIT) (Joint wok with Raf Schiffe (Univesity of Connecticut) and Lauen Wiiams (Univesity of Caifonia, Bekeey)) Bown Univesity Discete Mathematics Semina
More informationPushdown Automata (PDAs)
CHAPTER 2 Context-Fee Languages Contents Context-Fee Gammas definitions, examples, designing, ambiguity, Chomsky nomal fom Pushdown Automata definitions, examples, euivalence with context-fee gammas Non-Context-Fee
More informationProblem set 6. Solution. The problem of firm 3 is. The FOC is: 2 =0. The reaction function of firm 3 is: = 2
Pobem set 6 ) Thee oigopoists opeate in a maket with invese demand function given by = whee = + + and is the quantity poduced by fim i. Each fim has constant magina cost of poduction, c, and no fixed cost.
More informationThe Solutions of the Classical Relativistic Two-Body Equation
T. J. of Physics (998), 07 4. c TÜBİTAK The Soutions of the Cassica Reativistic Two-Body Equation Coşkun ÖNEM Eciyes Univesity, Physics Depatment, 38039, Kaysei - TURKEY Received 3.08.996 Abstact With
More informationThe geometric construction of Ewald sphere and Bragg condition:
The geometic constuction of Ewald sphee and Bagg condition: The constuction of Ewald sphee must be done such that the Bagg condition is satisfied. This can be done as follows: i) Daw a wave vecto k in
More informationON THE INVERSE SIGNED TOTAL DOMINATION NUMBER IN GRAPHS. D.A. Mojdeh and B. Samadi
Opuscula Math. 37, no. 3 (017), 447 456 http://dx.doi.og/10.7494/opmath.017.37.3.447 Opuscula Mathematica ON THE INVERSE SIGNED TOTAL DOMINATION NUMBER IN GRAPHS D.A. Mojdeh and B. Samadi Communicated
More informationForest-Like Abstract Voronoi Diagrams in Linear Time
Foest-Like Abstact Voonoi Diagams in Linea Time Cecilia Bohle, Rolf Klein, and Chih-Hung Liu Abstact Voonoi diagams ae a well-studied data stuctue of poximity infomation, and although most cases equie
More informationAnalysis of simple branching trees with TI-92
Analysis of simple banching tees with TI-9 Dušan Pagon, Univesity of Maibo, Slovenia Abstact. In the complex plane we stat at the cente of the coodinate system with a vetical segment of the length one
More informationInternet Appendix for A Bayesian Approach to Real Options: The Case of Distinguishing Between Temporary and Permanent Shocks
Intenet Appendix fo A Bayesian Appoach to Real Options: The Case of Distinguishing Between Tempoay and Pemanent Shocks Steven R. Genadie Gaduate School of Business, Stanfod Univesity Andey Malenko Gaduate
More informationSurveillance Points in High Dimensional Spaces
Société de Calcul Mathématique SA Tools fo decision help since 995 Suveillance Points in High Dimensional Spaces by Benad Beauzamy Januay 06 Abstact Let us conside any compute softwae, elying upon a lage
More informationInformation Retrieval Advanced IR models. Luca Bondi
Advanced IR models Luca Bondi Advanced IR models 2 (LSI) Pobabilistic Latent Semantic Analysis (plsa) Vecto Space Model 3 Stating point: Vecto Space Model Documents and queies epesented as vectos in the
More informationGeneralized net model of the process of ordering of university subjects
eventh Int. okshop on Gs, ofia, 4- Juy 006, -9 Geneaized net mode of the pocess of odeing of univesity subjects A. hannon, E. otiova, K. Atanassov 3, M. Kawczak 4, P. Meo-Pinto,. otiov, T. Kim 6 KvB Institute
More informationDetermining solar characteristics using planetary data
Detemining sola chaacteistics using planetay data Intoduction The Sun is a G-type main sequence sta at the cente of the Sola System aound which the planets, including ou Eath, obit. In this investigation
More informationgr0 GRAPHS Hanan Samet
g0 GRPHS Hanan Samet ompute Science epatment and ente fo utomation Reseach and Institute fo dvanced ompute Studies Univesity of Mayland ollege Pak, Mayland 074 e-mail: hjs@umiacs.umd.edu opyight 1997 Hanan
More informationProbability Estimation with Maximum Entropy Principle
Pape 0,CCG Annua Repot, 00 ( c 00) Pobabiity Estimation with Maximum Entopy Pincipe Yupeng Li and Cayton V. Deutsch The pincipe of Maximum Entopy is a powefu and vesatie too fo infeing a pobabiity distibution
More informationOnline-routing on the butterfly network: probabilistic analysis
Online-outing on the buttefly netwok: obabilistic analysis Andey Gubichev 19.09.008 Contents 1 Intoduction: definitions 1 Aveage case behavio of the geedy algoithm 3.1 Bounds on congestion................................
More informationThree-dimensional systems with spherical symmetry
Thee-dimensiona systems with spheica symmety Thee-dimensiona systems with spheica symmety 006 Quantum Mechanics Pof. Y. F. Chen Thee-dimensiona systems with spheica symmety We conside a patice moving in
More informationMULTILAYER PERCEPTRONS
Last updated: Nov 26, 2012 MULTILAYER PERCEPTRONS Outline 2 Combining Linea Classifies Leaning Paametes Outline 3 Combining Linea Classifies Leaning Paametes Implementing Logical Relations 4 AND and OR
More informationChem 453/544 Fall /08/03. Exam #1 Solutions
Chem 453/544 Fall 3 /8/3 Exam # Solutions. ( points) Use the genealized compessibility diagam povided on the last page to estimate ove what ange of pessues A at oom tempeatue confoms to the ideal gas law
More informationTHE CONE THEOREM JOEL A. TROPP. Abstract. We prove a fixed point theorem for functions which are positive with respect to a cone in a Banach space.
THE ONE THEOEM JOEL A. TOPP Abstact. We pove a fixed point theoem fo functions which ae positive with espect to a cone in a Banach space. 1. Definitions Definition 1. Let X be a eal Banach space. A subset
More informationLecture 18: Graph Isomorphisms
INFR11102: Computational Complexity 22/11/2018 Lectue: Heng Guo Lectue 18: Gaph Isomophisms 1 An Athu-Melin potocol fo GNI Last time we gave a simple inteactive potocol fo GNI with pivate coins. We will
More informationON INDEPENDENT SETS IN PURELY ATOMIC PROBABILITY SPACES WITH GEOMETRIC DISTRIBUTION. 1. Introduction. 1 r r. r k for every set E A, E \ {0},
ON INDEPENDENT SETS IN PURELY ATOMIC PROBABILITY SPACES WITH GEOMETRIC DISTRIBUTION E. J. IONASCU and A. A. STANCU Abstact. We ae inteested in constucting concete independent events in puely atomic pobability
More informationQuasi-Randomness and the Distribution of Copies of a Fixed Graph
Quasi-Randomness and the Distibution of Copies of a Fixed Gaph Asaf Shapia Abstact We show that if a gaph G has the popety that all subsets of vetices of size n/4 contain the coect numbe of tiangles one
More informationNon-Linear Dynamics Homework Solutions Week 2
Non-Linea Dynamics Homewok Solutions Week Chis Small Mach, 7 Please email me at smach9@evegeen.edu with any questions o concens eguading these solutions. Fo the ececises fom section., we sketch all qualitatively
More informationA Simultaneous Routing Tree Construction and Fanout Optimization Algorithm *
A Simutaneous Routing Tee Constuction and Fanout Optimization Agoithm * Ami H. Saek, Jinan Lou, Massoud Pedam Depatment of Eectica Engineeing - Systems Univesity of Southen Caifonia Los Angees, CA 90089
More informationarxiv: v1 [math.co] 4 May 2017
On The Numbe Of Unlabeled Bipatite Gaphs Abdullah Atmaca and A Yavuz Ouç axiv:7050800v [mathco] 4 May 207 Abstact This pape solves a poblem that was stated by M A Haison in 973 [] This poblem, that has
More informationEQUI-PARTITIONING OF HIGHER-DIMENSIONAL HYPER-RECTANGULAR GRID GRAPHS
EQUI-PARTITIONING OF HIGHER-DIMENSIONAL HYPER-RECTANGULAR GRID GRAPHS ATHULA GUNAWARDENA AND ROBERT R MEYER Abstact A d-dimensional gid gaph G is the gaph on a finite subset in the intege lattice Z d in
More informationLifting Private Information Retrieval from Two to any Number of Messages
Lifting Pivate Infomation Retieval fom Two to any umbe of Messages Rafael G.L. D Oliveia, Salim El Rouayheb ECE, Rutges Univesity, Piscataway, J Emails: d746@scaletmail.utges.edu, salim.elouayheb@utges.edu
More informationCompactly Supported Radial Basis Functions
Chapte 4 Compactly Suppoted Radial Basis Functions As we saw ealie, compactly suppoted functions Φ that ae tuly stictly conditionally positive definite of ode m > do not exist The compact suppot automatically
More informationMATH 415, WEEK 3: Parameter-Dependence and Bifurcations
MATH 415, WEEK 3: Paamete-Dependence and Bifucations 1 A Note on Paamete Dependence We should pause to make a bief note about the ole played in the study of dynamical systems by the system s paametes.
More informationHardness of Approximating the Minimum Distance of a Linear Code
Hadness of Appoximating the Minimum Distance of a Linea Code Iya Dume Daniee Micciancio Madhu Sudan Abstact We show that the minimum distance d of a inea code is not appoximabe to within any constant facto
More informationBounds on the performance of back-to-front airplane boarding policies
Bounds on the pefomance of bac-to-font aiplane boading policies Eitan Bachmat Michael Elin Abstact We povide bounds on the pefomance of bac-to-font aiplane boading policies. In paticula, we show that no
More informationPhysics 4A Chapter 8: Dynamics II Motion in a Plane
Physics 4A Chapte 8: Dynamics II Motion in a Plane Conceptual Questions and Example Poblems fom Chapte 8 Conceptual Question 8.5 The figue below shows two balls of equal mass moving in vetical cicles.
More informationMechanics Physics 151
Mechanics Physics 151 Lectue 6 Kepe Pobem (Chapte 3) What We Did Last Time Discussed enegy consevation Defined enegy function h Conseved if Conditions fo h = E Stated discussing Centa Foce Pobems Reduced
More informationFUSE Fusion Utility Sequence Estimator
FUSE Fusion Utility Sequence Estimato Belu V. Dasaathy Dynetics, Inc. P. O. Box 5500 Huntsville, AL 3584-5500 belu.d@dynetics.com Sean D. Townsend Dynetics, Inc. P. O. Box 5500 Huntsville, AL 3584-5500
More information7.2. Coulomb s Law. The Electric Force
Coulomb s aw Recall that chaged objects attact some objects and epel othes at a distance, without making any contact with those objects Electic foce,, o the foce acting between two chaged objects, is somewhat
More informationChapter 3: Theory of Modular Arithmetic 38
Chapte 3: Theoy of Modula Aithmetic 38 Section D Chinese Remainde Theoem By the end of this section you will be able to pove the Chinese Remainde Theoem apply this theoem to solve simultaneous linea conguences
More information3.1 Random variables
3 Chapte III Random Vaiables 3 Random vaiables A sample space S may be difficult to descibe if the elements of S ae not numbes discuss how we can use a ule by which an element s of S may be associated
More informationThe Chromatic Villainy of Complete Multipartite Graphs
Rocheste Institute of Technology RIT Schola Wos Theses Thesis/Dissetation Collections 8--08 The Chomatic Villainy of Complete Multipatite Gaphs Anna Raleigh an9@it.edu Follow this and additional wos at:
More informationPhysics 2020, Spring 2005 Lab 5 page 1 of 8. Lab 5. Magnetism
Physics 2020, Sping 2005 Lab 5 page 1 of 8 Lab 5. Magnetism PART I: INTRODUCTION TO MAGNETS This week we will begin wok with magnets and the foces that they poduce. By now you ae an expet on setting up
More informationDiscretizing the 3-D Schrödinger equation for a Central Potential
Discetizing the 3-D Schödinge equation fo a Centa Potentia By now, you ae faiia with the Discete Schodinge Equation fo one Catesian diension. We wi now conside odifying it to hande poa diensions fo a centa
More informationGaia s Place in Space
Gaia s Place in Space The impotance of obital positions fo satellites Obits and Lagange Points Satellites can be launched into a numbe of diffeent obits depending on thei objectives and what they ae obseving.
More informationElectrostatics (Electric Charges and Field) #2 2010
Electic Field: The concept of electic field explains the action at a distance foce between two chaged paticles. Evey chage poduces a field aound it so that any othe chaged paticle expeiences a foce when
More informationSupplementary information Efficient Enumeration of Monocyclic Chemical Graphs with Given Path Frequencies
Supplementay infomation Efficient Enumeation of Monocyclic Chemical Gaphs with Given Path Fequencies Masaki Suzuki, Hioshi Nagamochi Gaduate School of Infomatics, Kyoto Univesity {m suzuki,nag}@amp.i.kyoto-u.ac.jp
More information( ) [ ] [ ] [ ] δf φ = F φ+δφ F. xdx.
9. LAGRANGIAN OF THE ELECTROMAGNETIC FIELD In the pevious section the Lagangian and Hamiltonian of an ensemble of point paticles was developed. This appoach is based on a qt. This discete fomulation can
More informationChapter 5 Linear Equations: Basic Theory and Practice
Chapte 5 inea Equations: Basic Theoy and actice In this chapte and the next, we ae inteested in the linea algebaic equation AX = b, (5-1) whee A is an m n matix, X is an n 1 vecto to be solved fo, and
More informationRelating Branching Program Size and. Formula Size over the Full Binary Basis. FB Informatik, LS II, Univ. Dortmund, Dortmund, Germany
Relating Banching Pogam Size and omula Size ove the ull Binay Basis Matin Saueho y Ingo Wegene y Ralph Wechne z y B Infomatik, LS II, Univ. Dotmund, 44 Dotmund, Gemany z ankfut, Gemany sauehof/wegene@ls.cs.uni-dotmund.de
More information