The (, D) and (, N) problems in double-step digraphs with unilateral distance
|
|
- Alexia Morrison
- 6 years ago
- Views:
Transcription
1 Electronic Journal of Grap Teory and Applications () (), Te (, D) and (, N) problems in double-step digraps wit unilateral distance C Dalfó, MA Fiol Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya Barcelona, Catalonia {cdalfo,fiol}@maupcedu Abstract We study te (, D) and (, N) problems for double-step digraps considering te unilateral distance, wic is te minimum between te distance in te digrap and te distance in its converse digrap, te latter obtained by canging te directions of all te arcs Te first problem consists of maximizing te number of vertices N of a digrap, given te maximum degree and te unilateral diameter D, wereas te second one (someow dual of te first) consists of minimizing te unilateral diameter given te maximum degree and te number of vertices We solve te first problem for every value of te unilateral diameter and te second one for infinitely many values of te number of vertices Moreover, we compute te mean unilateral distance of te digraps in te families considered Keywords: (, D) problem, (, N) problem, unilateral distance, double-step digraps Matematics Subject Classification: C, C Introduction Te (, D) and (, N) problems ave been extensively studied for graps and digraps Miller and Sirán [9] wrote a compreensive survey about tese problems In particular, for te so-called double-step graps considering te standard diameter, te first problem was solved by Yebra, Fiol, Morillo and Alegre [], wereas Bermond, Iliades and Peyrat [], and also Beivide, Herrada, Received: September, Revised: January, Accepted: January
2 i+b i+b i+a+b i i+a i+a Figure Steps of G(N; a, b) (left), and te double-step digrap G(;, ) (rigt) Balcázar and Arruabarrena [] solved te (, N) problem In te case of te double-step digraps also wit te standard diameter, Morillo, Fiol and Fàbrega [] solved te (, D) problem and provided some infinite families of digraps wic solve te (, N) problem for teir corresponding numbers of vertices Esqué, Aguiló and Fiol [], and Aguiló and Fiol [] contributed to te second problem wit more general results Double-step digraps were proposed and studied as models for te so-called local area networks, in wic several computers placed at sort distances excange data at very ig speed, as explained in Fiol, Yebra, Alegre and Valero [] In particular, te delay in te transmission of a message between two nodes is closely related to te minimum number of necessary steps to get teir target, tat is, te distance between nodes Wat allows us to go from te combinatorial formulation (te network structure) to te algebraic one is te representation of eac digrap as an L-saped or X-saped tile (a planar region), wic periodically tessellates te plane by translations (-dimensional integer lattice) Wit tese geometric forms we can study more easily te properties related to te distance in a digrap, suc as its diameter and its mean distance In tis paper we study te (, D ) and te (, N) problems for double-step digraps, were te asterisks indicate tat we consider te unilateral distance instead of te standard distance Te former is te minimum between te distance in te digrap and te distance in its converse digrap, obtained by canging te directions of all te arcs Te plan of te paper is as follows In te next section we recall te definitions of double-step digrap, unilateral distance, and unilateral diameter Moreover, we sow tat if we take te vertices at minimum distance from a given vertex, we obtain an L-saped or X-saped tile, depending on weter we consider te standard or te unilateral diameter, respectively In Section, we give te unilateral diameter of double-step digraps wen one step is equal to In Section, we solve te (, D ) problem for every value of te unilateral diameter and also te (, N) problem for infinitely many values of te number of vertices Finally, in te last section, we derive formulas for computing te mean unilateral distance of te double-step digraps considered Preliminaries We recall te basic definitions and concepts concerning double-step digraps and unilateral distance, togeter wit teir geometric representations
3 y w G(;,) Figure A generic L-saped tile (left), and te L-saped tile of G(;, ) (rigt) Double-step digraps A double-step digrap G(N; a, b) as set of vertices Z N = Z/NZ and arcs from every vertex i to vertices i+a mod N and i+b mod N, for i N, were a, b are some integers called steps suc tat a < b N Because of te automorpisms i i + α for α N, te double-step digraps are vertex-transitive Moreover, tey are strongly connected if and only if gcd(n, a, b) = In Fig we sow te steps of a double-step digrap G(N; a, b) and, as an example, G(;, ) It is known tat te maximum order N of a double-step digrap wit diameter k is upper bounded by te Moore-like bound N M DSD (, k) = ( ) k+, were te equality would old if all te numbers ma + nb were different modulo N, wit m, n and m + n k In fact, tis bound cannot be attained for k > For more details, see Esqué, Aguiló and Fiol [], Aguiló and Fiol [], and Fiol, Yebra, Alegre and Valero [] Given a double-step digrap G(N; a, b) tat is assumed to be strongly connected, consider te plane divided into unitary squares, centered in te integral coordinate points forming a lattice From a square or lattice point labeled wit zero, we add a mod N wen we move orizontally to te rigt to te next square, and b mod N wen we move vertically upwards Ten, te plane is covered by integers modulo N, tat is, te elements of te cyclic group Z N, as sown in Fig (rigt) wit te example of te digrap G(;, ) Note tat, in tis way, eac vertex of a digrap G(N; a, b) is related to a lattice point Moreover, tose at minimum distance from form a - dimensional lattice wic univocally caracterizes te digrap In turn, suc a lattice is determined by a basis of two (integer) vectors u = (l, y) and v = ( w, +y), satisfying N = l(+y) wy and gcd(l,, w, y) = (see Figure ) Now, if we coose any N vertices (squares) wit different labels modulo N, we get a tile wic periodically tessellates te plane and, in te cases we consider, te dimensions of suc a tile are closely related to te entries of te vectors u, v Let us see some useful cases: If all te vertices different modulo N are cosen to be at minimum (standard) distance from vertex (tis is done by following a simple algoritm tat considers te successive diagonals, as is sown again in Fig (rigt)), Brawer and Sokley [] proved tat te tiles are always L-saped tiles caracterized by its dimensions (l, + y, w, y), wit l, + y, w l, y, see again Fig (left), and te corresponding L-basis is u = (l, y), v =
4 s y= +y v -w u -y Figure Te vectors of an L-basis (left), and te dimensions of an L-saped form wit area N = l + s (rigt) ( w, + y), as sown in Fig If one of te steps, say a, equals, we can coose again an L-saped tile wit dimensions: l = b, being te quotient obtained dividing N by l, w = l s wit s being te remainder of suc a division, and y = Ten, N = l + s wit s < l (see Fig ) If all te vertices wic are distinct modulo N are cosen at minimum unilateral distance (see its definition in Subsection ) from vertex (following again a simple algoritm) we get a kind of X-saped tile, as sown in Fig Moreover, in te above case (a = ), we can rebuild te obtained tile as an L-saped tile placing te inferior alf (witout te ) onto te superior one (In oter words, te vertices at minimum unilateral distance from and to vertex are taken from two different points of te plane representing it) See again Fig Conversely, from a basis u = (l, y) and v = ( w, + y) (or distribution of zeros ) of te lattice wit gcd(l,, w, y) =, te steps a and b of te corresponding digrap of N = l(+y) wy vertices (or a tile wit te same area) can be obtained as te solutions of te following system of equations: la yb = αn ( mod N), wa + ( + y)b = βn ( mod N), wic gives a = α( + y) + βy, b = αw + βl, () were α and β must be cosen so tat te condition gcd(n, a, b) = is satisfied (See Fiol, Yebra, Alegre, and Valero [] for more details) For instance, if we apply tis metod to te example
5 r r (a) r r (b) Figure From X-saped forms to L-saped forms (for te case s = l ): (a) l + even, and (b) l + odd Te squares wit an asterisk represent te fartest vertices from of G(;, ) (see again Figs and ), te dimensions of te L-saped tile are l =, =, w = y = Ten, a = α+β and b = α+β A good coice is α = and β =, wic gives te steps a = and b = More generally, for an L-saped tile wit dimensions l, + y, w = l s and y = (see Fig ), we get a = and b = l, as expected Observe tat te values of te steps a and b are not unique Indeed, given a feasible pair a, b we obtain an isomorpic digrap wit te steps γa, γb for any integer γ relatively prime to N Unilateral distance Given a digrap G = (V, A), te unilateral distance between two vertices u, v V is defined as dist G(u, v) = min{dist G (u, v), dist G (v, u)} = min{dist G (u, v), dist G (u, v)}, were dist G is te standard distance in digrap G and dist G is te distance in its converse digrap G, tat is, te digrap obtained by canging te directions of all te arcs of G From tis concept, we can define te unilateral eccentricity ecc from vertex u, te unilateral radius r of G, and te unilateral diameter D of G as follows: ecc (u) = max v V {dist G(u, v)}, r = min u V {ecc (u)}, and D = max u V {ecc (u)} As an example, if we ave G = C N, te directed cycle on N vertices, ten r = D = N/ Note tat, obviously, tese parameters ave as lower bounds te ones corresponding to te underlying grap, obtained from digrap G by canging te arcs for edges witout direction Some constructions of general digraps wit large number of vertices given te maximum degree and unilateral diameter (tat is, te (, D ) problem for digraps) were proposed by Gómez, Canale and Muñoz [, ] Te unilateral diameter of double-step digraps wit steps a = and b = l In tis section we study te unilateral diameter of te double-step digraps wit a = aving small b Altoug we ave not been able to prove tat te optimal results can be obtained always
6 s +-s- +s+ s+ s+ +s+ s s+ s+ +-s- s+ s+ Figure Tessellations for s + < l and s + l by taking suc values of te steps, computational experiments seem to support tis claim In fact, as we see in te next section, tis approac allows us to solve te (, D ) problem for every value of D, and also to solve te (, N) problem for infinitely many values of N As we ave already seen, a double-step digrap G(N;, b) wit N = l + s and s < l, can be described by an L-saped form wit dimensions l = b, = N/l, y =, and w = l s See again Fig (rigt) In tis context we ave te following result for te unilateral diameter D Proposition For N = l+s, were < l N and s l, a double-step digrap G(N; a, b) wit a = and b = l as unilateral diameter l + + s if s l, D = () l + if s = l Proof To determine te vertices at minimum unilateral distance from, it is useful to divide te L-saped form into two parts: Te left one is an L-tile wit left bottom corner (, ) and rigt top (missing) corner (s, ) (bot points correspond to vertex ) Te rigt part is a rectangle R wit left bottom corner i = (s +, ) and rigt top corner j = (l, ) (wit basis l s and eigt ) See Fig for te cases s + < l and s + l and compare te two pats to go to equivalent vertices In bot cases, notice tat, if + s + (a condition tat is always fulfilled since s < l N ), te unilateral distances from to i and to j are bot s+ As a consequence, te fartest vertices from are in (one or two) NW-SE diagonals of R or, equivalently, te same diagonals of te rectangle R wit basis l and eigt sown in Fig, in grey dased lines, wit
7 s= s= s= s=- = = = =+ =+ =+ = Figure Some cases of Proposition values l = = { l + s + if s l, l if s = l { if s l, + if s = l Consequently, te unilateral diameter D turns out to be l D + =, wence we obtain te claimed result As an example, in Fig, we sow some of te possible L-saped forms for N =, were te minimum unilateral diameter is, corresponding to te L-saped form wit l =, = and s =, tat is, te double-step digrap G(;, ); or l =, = and s = giving G(;, ) In Table, tere are te unilateral diameters corresponding to all te possible values of l for N = and N = 9 (te values in grey do not satisfy < l N ) All tese values are represented in Fig If tere is not restriction for te value of l, ten te minimum value in Eq () give us an upper bound for te unilateral diameter D Te first case in wic suc a bound is not attained corresponds to N =, were te unilateral diameter D is and te upper bound given by Eq () is Te (, D ) and (, N) problems for double-step digraps wit unilateral diameter In tis section we completely solve te (, D ) problem for double-step digraps wit unilateral diameter and give infinite families of suc digraps wic solve te (, N) problem Let us begin wit te former
8 Te (, D ) and (, N) problems in double-step digraps C Dalfó, MA Fiol 9 9 = = = = = Figure Some of te possible L-saped forms for N = Te numbers indicate te distance from to eac vertex Eac vertex and its fartest vertices are in bold D l D D l D N= N=9 Figure Te minimum unilateral diameter D wit respect to l for N = and N = 9 Te (, D ) problem In our context, te (, D ) problem consists of finding te double-step digrap G(N; a, b) wit maximum number of vertices given a unilateral diameter D, tat is, to find te steps tat maximize te number of vertices for suc a unilateral diameter To get a Moore-like bound (see Miller and Sirán [9]), notice tat at distance k =,,, D from vertex tere are at most (k + ) vertices (k + of tem going forward and te oter k + going backwards) Ten, tis gives N M(, D ) = ( D + ) = (D ) + D + () Moreover, if te maximum is attained, we get an optimal X-saped tile wic tessellates te plane, as sown in Fig 9 (rigt) for te case N = In te following result we sow tat tis Moore-like bound can be always attained Proposition For eac integer value k, te double-step digrap G(N;, b), wit N = M(, k) = k + k + and b = k + as unilateral diameter D = k
9 Table Te unilateral diameter D wit respect to l for N = and N = 9 (in bold tere are te values tat satisfy < l N ) N= N=9 N= N=9 N= N=9 N= N=9 l D D l D D l D D l D D Proof Tis corresponds to one of te cases of Proposition Indeed, it suffices to take l = = k + and s = k In Table tere are te computer data of te minimum unilateral diameter for eac number of vertices ( N ) wit steps a = and b = l In bold, tere are te cases corresponding to te (, D ) problem Te (, N) problem In our context, te (, N) problem consists of finding te minimum unilateral diameter D in double-step digraps given a number of vertices N, tat is, to find te steps tat minimize te unilateral diameter for suc a number of vertices We begin wit te following general upper bound for te unilateral diameter Proposition Given any number of vertices N, tere exists a double-step digrap wit unilateral diameter D satisfying D (N + ) Proof To prove te upper bound, we use again te constructions of Proposition Ten, suppose tat, in te worst case, te division of N by l, were l, gives a remainder s = l Tus, N = l + s wit = N s = N+ and tis gives a unilateral diameter l l l + + s N + D = = + l l 9
10 Figure 9 Te digrap G(;, ) (left), and its corresponding X-saped tile (rigt) Now, since we can coose te value of l, we want to minimize te function φ(l) = N+ + l, wic l is attained at l = (N + )/ Ten, te claimed upper bound is obtained by considering tat l must be an integer To solve te (, N) problem for double-step digraps wit minimum unilateral diameter we consider te case s = l of Proposition Moreover, in tis case, to keep track of te excluded vertices from te maximum M(, k) (tose corresponding to te wite squares in Fig ), we define r as te subindex of te triangular number T r = r = ( ) r+ Proposition (a) If r < ( k + 9 ), te double-step digrap G(N; a, b), wit number of vertices N = k + k + r(r + ) and steps a = and b = l = k r +, as minimum unilateral diameter D = k (b) If r < k +, te double-step digrap G(N; a, b), wit number of vertices N = k + k r and steps a = and b = l = k r +, as minimum unilateral diameter D = k Proof (a) In Proposition, take l = k + r, = k + + r, and s = l Tis corresponds to a double-step digrap wit number of vertices N = l + s = (k + r)(k + + r) + k r = k +k+ r(r+) and unilateral diameter D = (l+ )/ = k Tus, if te number r(r+) of excluded vertices from te maximum M(, k) is at most k +, te digrap as minimum unilateral diameter for tis N Tis comes from te fact tat M(, k) M(, k ) = k + Using te triangular numbers, te condition is T r k + As T r is an even number, we get T r k T r k T r = r(r + ) < k + So, r + r (k + ) < and, ence, r < ( + k + 9) (b) Using te same proposition, take l = k + r, = k + r, and s = l, wic corresponds
11 D N Figure Te minimum unilateral diameter D wit respect to te number of vertices N, for N (Te largest points correspond to te (, D ) problem, and te tick lines to te upper bound given in Proposition ) to a double-step digrap wit order N = l + s = (k + r)(k + r) + k r = k + k r and, as before, unilateral diameter D = (l + )/ = k Now, for te digrap to ave minimum unilateral diameter, te number of excluded squares from M(, k) must satisfy T r + T r + k + = (r + )r + r(r ) + k + = r + k + k + Ten, r k and, ence, r k or r < k + As said before, in Table tere are te computer data of te minimum unilateral diameter for eac number of vertices ( N ) wit steps a = and b = l Te (, D ) problem, wic are in bold, correspond to r = in case (a) In grey, tere are te cases corresponding to te (, N) problem solved wit Proposition As sown in Fig, te unilateral diameter D does not increase monotonically wit te number of vertices N Note tat if we fix r for any k large enoug, we get an infinite family of digraps wit minimum unilateral diameter for eac number of vertices See some examples of te cases of Proposition in Table
12 Table Some results of te (, D ) and (, N) problems solved wit Proposition Problem l + r l N = l + l D (, D ) even k + k + k + k + k (, N) even k k + k + k k (, N) even k k + k + k k (, N) even k k + k + k k (, N) odd k + k + k + k k (, N) odd k k + k + k k (, N) odd k k + k + k k (, N) odd k k + k + k 9 k Te mean unilateral distance for double-step digraps In te next result, we give te mean unilateral distance for te double-step digraps of Proposition Tere is an example of eac kind of L-saped form in Fig Proposition For N = l+s, were < l N and s l, a double-step digrap G(N; a, b) wit a = and b = l as mean unilateral distance d, were: (a) For s = : (a) If l, are [ even: ( d = l (a) If l is even, [ and is odd: d = l + (a) If l is odd, [ and is even: ( d = l (a) If l, are odd: d = l (b) For s = l : ) ( + (l ) l( l) + ( l+ ) l+ ( + (l ) l( l) + l+ ) ( + (l ) l( l) + l+ [ + ( + + (l ) l( l) + ( ) l+ (b) If l + is even: ( d = l (l )( l) + l+ l+l l+ ) (b) If l + is odd: ( d = l (l )( l) + ) l+ l+l
13 Table Minimum unilateral diameter D for eac number of vertices N, N, wit steps a = and b = l (te cases of te (, D ) problem are in bold, te cases wit s = are in wite, wit s l are in ligt grey, and wit s = l are in dark grey) N D l s N D l s N D l s
14 (c) For s l : (c) If l,, s are [ even: ( d = (s + ) s( s) + ( ) ) s+ l+s + (l s )(l s)(l + s ) + (l s ) ( ( l++s (c) If l, are[ even, and s is odd: d = (s + ) l+s + ( s( s) + s+ (l s )(l s)(l + s ) + (l s ) ( l++s (c) If l, s are[ even, and is odd: d = (s + ) l+s + ) l++s (l s + )(l s + ) + s+ ) (l s)(l s + ) ( s( s) + s+ (l s )(l s)(l + s ) + (l s ) ( l++s + s+ ) + (l s + )(l s + ) (c) If l is odd, [ and, s( are even: d = (s + ) s( s) + ( ) s+ )) l+s + (l s )(l s)(l + s ) + (l s ) ( l++s (l s + )(l s + ) (c) If l is even, [ and, ( s are odd: d = (s + ) s( s) + ( ) ) s+ l+s + (l s )(l s)(l + s ) ( ( + (l s ) l++s ) ( l++s ) (l s)(l s + ) (c) If l, s are[ odd, and is even: d = (s + ) l+s + ( s( s) + s+ (l s )(l s)(l + s ) + (l s ) ( ( l++s ) ( l++s (c) If l, are[ odd, and s is even: d = (s + ) l+s + ( s( s) + s+ (l s )(l s)(l + s ) + (l s ) ( ( l++s (c) If l,, s are [ odd: ( d = (s + ) s( s) + ( ) s+ ) l+s + s+ ) ) (l s)(l s + ) + s+ ) ) ( l++s ) (l s + )(l s + )
15 s= (a) s= (a) s= (a),(a) s s=- s (b) s=- s s=- s (b) s s+ s s+ (c),(c) s+ (c) s+ s s+ s+ (c),(c),(c) s s+ s+ (c),(c) Figure Te cases of Proposition (te vertices wit an asterisk are te fartest from ) + (l s )(l s)(l + s ) + (l s ) ( l++s (l s)(l s + ) Proof We only prove case (c) because te oter proofs are very similar (c) If l, and s even: We divide te L-saped form into two parts, te left one and te rigt one In te left part, we ave an L-saped form wit widt s + and eigt (wit s ) In te rigt part, tere is an L-saped form wit widt l s and eigt (wit s = ) See case (c)
16 in Figure Ten, in te left part, te sum of te number of vertices times teir distance is ( ) (s + )s ( ( )) s + + (s + )(s + ) + (s + )(s + ) + + (s + ) + (s + ) s + (( ) ( ) ( )) s + = [( +(s + ) s + ) ] ( s) + (s + ) s + ( ) [( ) ] s + s + s + = + (s + ) s(s + ) + (s + ) s + ( ( ) ) s + = (s + ) s( s) + For te rigt part, we ave [(s + ) + (s + ) + + (l )(l s [ ( l + + s +(l s ) (l s + ) + + = [(s ) + (s ) + + (s )(l s +[ (l s)(l s [ ( l + + s +(l s ) (l s ) ( l s ) [( ) ( ) ( l s = (s )(l s )(l s) ( ) l + + s l + + s +(l s ) (l s )(l s + )(l s + ) ( ) l s + = (s )(l s )(l s) + ( ) l + + s l + + s +(l s ) (l s )(l s + )(l s + ) = (l s )(l s)(l + s ) ( (l ) ) + + s +(l s ) l + + s (l s + )(l s + ) Finally, considering bot parts, we obtain te mean unilateral distance dividing by te number of vertices N = l + s
17 Acknowledgement Tis researc was supported by te Ministry of Science and Innovation (Spain) and te European Regional Development Fund under project MTM--C-- and by te Catalan Researc Council under project 9SGR References [] F Aguiló and MA Fiol, An efficient algoritm to find optimal double loop networks, Discrete Mat (99), 9 [] R Beivide, E Herrada, JL Balcázar, and A Arruabarrena, Optimal distance networks of low degree for parallel computers, IEEE Trans Comput (99), 9 [] JC Bermond, G Iliades, and C Peyrat, An optimization problem in distributed loop computer networks, in Combinatorial Matematics: Proceedings of te Tird International Conference (New York, 9), Ann New York Acad Sci (99), [] A Brawer, and J Sokley, On a problem of Frobenius, J Reine Angew Mat (9), [] P Esqué, F Aguiló, and MA Fiol, Double commutative-step digraps wit minimum diameters, Discrete Mat (99), [] MA Fiol, JLA Yebra, I Alegre, and M Valero, A discrete optimization problem in local networks and data alignment, IEEE Trans Comput C- (9), [] J Gómez, EA Canale, and X Muñoz, On te unilateral (, D )-problem, Networks () (), [] J Gómez, EA Canale, and X Muñoz, Unilaterally connected large digraps and generalized cycles, Networks () (), [9] M Miller and J Sirán, Moore graps and beyond: A survey of te degree/diameter problem, Electron J Combin () (), DSv [] P Morillo, MA Fiol, J Fàbrega, Te diameter of directed graps associated to plane tesselations, Ars Combin A() (9), [] JLA Yebra, MA Fiol, P Morillo, and I Alegre, Te diameter of undirected graps associated to plane tesselations, Ars Combin B() (9), 9
Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number
Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number Sofia Burille Mentor: Micael Natanson September 15, 2014 Abstract Given a grap, G, wit a set of vertices, v, and edges, various
More information4.1 Tangent Lines. y 2 y 1 = y 2 y 1
41 Tangent Lines Introduction Recall tat te slope of a line tells us ow fast te line rises or falls Given distinct points (x 1, y 1 ) and (x 2, y 2 ), te slope of te line troug tese two points is cange
More information2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically
2 Te Derivative Te two previous capters ave laid te foundation for te study of calculus. Tey provided a review of some material you will need and started to empasize te various ways we will view and use
More information4.2 The Derivative. f(x + h) f(x) lim
4.2 Te Derivative Introduction In te previous section, it was sown tat if a function f as a nonvertical tangent line at a point (x, f(x)), ten its slope is given by te it f(x + ) f(x). (*) Tis is potentially
More informationNumerical Derivatives
Lab 15 Numerical Derivatives Lab Objective: Understand and implement finite difference approximations of te derivative in single and multiple dimensions. Evaluate te accuracy of tese approximations. Ten
More informationSection 2.3: Calculating Limits using the Limit Laws
Section 2.3: Calculating Limits using te Limit Laws In previous sections, we used graps and numerics to approimate te value of a it if it eists. Te problem wit tis owever is tat it does not always give
More information2.8 The derivative as a function
CHAPTER 2. LIMITS 56 2.8 Te derivative as a function Definition. Te derivative of f(x) istefunction f (x) defined as follows f f(x + ) f(x) (x). 0 Note: tis differs from te definition in section 2.7 in
More informationClassify solids. Find volumes of prisms and cylinders.
11.4 Volumes of Prisms and Cylinders Essential Question How can you find te volume of a prism or cylinder tat is not a rigt prism or rigt cylinder? Recall tat te volume V of a rigt prism or a rigt cylinder
More informationMulti-Stack Boundary Labeling Problems
Multi-Stack Boundary Labeling Problems Micael A. Bekos 1, Micael Kaufmann 2, Katerina Potika 1 Antonios Symvonis 1 1 National Tecnical University of Atens, Scool of Applied Matematical & Pysical Sciences,
More information19.2 Surface Area of Prisms and Cylinders
Name Class Date 19 Surface Area of Prisms and Cylinders Essential Question: How can you find te surface area of a prism or cylinder? Resource Locker Explore Developing a Surface Area Formula Surface area
More informationCHAPTER 7: TRANSCENDENTAL FUNCTIONS
7.0 Introduction and One to one Functions Contemporary Calculus 1 CHAPTER 7: TRANSCENDENTAL FUNCTIONS Introduction In te previous capters we saw ow to calculate and use te derivatives and integrals of
More informationMore on Functions and Their Graphs
More on Functions and Teir Graps Difference Quotient ( + ) ( ) f a f a is known as te difference quotient and is used exclusively wit functions. Te objective to keep in mind is to factor te appearing in
More informationChapter K. Geometric Optics. Blinn College - Physics Terry Honan
Capter K Geometric Optics Blinn College - Pysics 2426 - Terry Honan K. - Properties of Ligt Te Speed of Ligt Te speed of ligt in a vacuum is approximately c > 3.0µ0 8 mês. Because of its most fundamental
More information1.4 RATIONAL EXPRESSIONS
6 CHAPTER Fundamentals.4 RATIONAL EXPRESSIONS Te Domain of an Algebraic Epression Simplifying Rational Epressions Multiplying and Dividing Rational Epressions Adding and Subtracting Rational Epressions
More informationFast Calculation of Thermodynamic Properties of Water and Steam in Process Modelling using Spline Interpolation
P R E P R N T CPWS XV Berlin, September 8, 008 Fast Calculation of Termodynamic Properties of Water and Steam in Process Modelling using Spline nterpolation Mattias Kunick a, Hans-Joacim Kretzscmar a,
More informationVector Processing Contours
Vector Processing Contours Andrey Kirsanov Department of Automation and Control Processes MAMI Moscow State Tecnical University Moscow, Russia AndKirsanov@yandex.ru A.Vavilin and K-H. Jo Department of
More information3.6 Directional Derivatives and the Gradient Vector
288 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.6 Directional Derivatives and te Gradient Vector 3.6.1 Functions of two Variables Directional Derivatives Let us first quickly review, one more time, te
More informationMATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2
MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2 Note: Tere will be a very sort online reading quiz (WebWork) on eac reading assignment due one our before class on its due date. Due dates can be found
More informationPiecewise Polynomial Interpolation, cont d
Jim Lambers MAT 460/560 Fall Semester 2009-0 Lecture 2 Notes Tese notes correspond to Section 4 in te text Piecewise Polynomial Interpolation, cont d Constructing Cubic Splines, cont d Having determined
More informationThe Euler and trapezoidal stencils to solve d d x y x = f x, y x
restart; Te Euler and trapezoidal stencils to solve d d x y x = y x Te purpose of tis workseet is to derive te tree simplest numerical stencils to solve te first order d equation y x d x = y x, and study
More informationMAC-CPTM Situations Project
raft o not use witout permission -P ituations Project ituation 20: rea of Plane Figures Prompt teacer in a geometry class introduces formulas for te areas of parallelograms, trapezoids, and romi. e removes
More informationAll truths are easy to understand once they are discovered; the point is to discover them. Galileo
Section 7. olume All truts are easy to understand once tey are discovered; te point is to discover tem. Galileo Te main topic of tis section is volume. You will specifically look at ow to find te volume
More information12.2 Investigate Surface Area
Investigating g Geometry ACTIVITY Use before Lesson 12.2 12.2 Investigate Surface Area MATERIALS grap paper scissors tape Q U E S T I O N How can you find te surface area of a polyedron? A net is a pattern
More informationTilings of rectangles with T-tetrominoes
Tilings of rectangles wit T-tetrominoes Micael Korn and Igor Pak Department of Matematics Massacusetts Institute of Tecnology Cambridge, MA, 2139 mikekorn@mit.edu, pak@mat.mit.edu August 26, 23 Abstract
More informationHaar Transform CS 430 Denbigh Starkey
Haar Transform CS Denbig Starkey. Background. Computing te transform. Restoring te original image from te transform 7. Producing te transform matrix 8 5. Using Haar for lossless compression 6. Using Haar
More informationNOTES: A quick overview of 2-D geometry
NOTES: A quick overview of 2-D geometry Wat is 2-D geometry? Also called plane geometry, it s te geometry tat deals wit two dimensional sapes flat tings tat ave lengt and widt, suc as a piece of paper.
More informationInvestigating an automated method for the sensitivity analysis of functions
Investigating an automated metod for te sensitivity analysis of functions Sibel EKER s.eker@student.tudelft.nl Jill SLINGER j..slinger@tudelft.nl Delft University of Tecnology 2628 BX, Delft, te Neterlands
More informationMeasuring Length 11and Area
Measuring Lengt 11and Area 11.1 Areas of Triangles and Parallelograms 11.2 Areas of Trapezoids, Romuses, and Kites 11.3 Perimeter and Area of Similar Figures 11.4 Circumference and Arc Lengt 11.5 Areas
More informationCE 221 Data Structures and Algorithms
CE Data Structures and Algoritms Capter 4: Trees (AVL Trees) Text: Read Weiss, 4.4 Izmir University of Economics AVL Trees An AVL (Adelson-Velskii and Landis) tree is a binary searc tree wit a balance
More information, 1 1, A complex fraction is a quotient of rational expressions (including their sums) that result
RT. Complex Fractions Wen working wit algebraic expressions, sometimes we come across needing to simplify expressions like tese: xx 9 xx +, xx + xx + xx, yy xx + xx + +, aa Simplifying Complex Fractions
More informationCospectral digraphs from locally line digraphs
Cospectral digraphs from locally line digraphs C. Dalfó a, M. A. Fiol b arxiv:1604.04448v1 [math.co] 15 Apr 2016 a,b Departament de Matemàtiques, Universitat Politècnica de Catalunya b Barcelona Graduate
More informationTHANK YOU FOR YOUR PURCHASE!
THANK YOU FOR YOUR PURCHASE! Te resources included in tis purcase were designed and created by me. I ope tat you find tis resource elpful in your classroom. Please feel free to contact me wit any questions
More informationRead pages in the book, up to the investigation. Pay close attention to Example A and how to identify the height.
C 8 Noteseet L Key In General ON LL PROBLEMS!!. State te relationsip (or te formula).. Sustitute in known values. 3. Simplify or Solve te equation. Use te order of operations in te correct order. Order
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More informationVOLUMES. The volume of a cylinder is determined by multiplying the cross sectional area by the height. r h V. a) 10 mm 25 mm.
OLUME OF A CYLINDER OLUMES Te volume of a cylinder is determined by multiplying te cross sectional area by te eigt. r Were: = volume r = radius = eigt Exercise 1 Complete te table ( =.14) r a) 10 mm 5
More informationCESILA: Communication Circle External Square Intersection-Based WSN Localization Algorithm
Sensors & Transducers 2013 by IFSA ttp://www.sensorsportal.com CESILA: Communication Circle External Square Intersection-Based WSN Localization Algoritm Sun Hongyu, Fang Ziyi, Qu Guannan College of Computer
More informationA new general family of deterministic hierarchical networks
A new general family of deterministic hierarchical networks arxiv:1608.02197v1 [math.co] 7 Aug 2016 C. Dalfó a, M.A. Fiol a,b a Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya
More informationOn Cyclic Kautz Digraphs
On Cyclic Kautz Digraphs K. Böhmová a, C. Dalfó b, C. Huemer b a Dept. of Computer Science, ETH Zürich, Switzerland katerina.boehmova@inf.ethz.ch b Dept. de Matemàtica, Universitat Politècnica de Catalunya,
More informationAreas of Parallelograms and Triangles. To find the area of parallelograms and triangles
10-1 reas of Parallelograms and Triangles ommon ore State Standards G-MG..1 Use geometric sapes, teir measures, and teir properties to descrie ojects. G-GPE..7 Use coordinates to compute perimeters of
More informationComputing geodesic paths on manifolds
Proc. Natl. Acad. Sci. USA Vol. 95, pp. 8431 8435, July 1998 Applied Matematics Computing geodesic pats on manifolds R. Kimmel* and J. A. Setian Department of Matematics and Lawrence Berkeley National
More information12.2 Techniques for Evaluating Limits
335_qd /4/5 :5 PM Page 863 Section Tecniques for Evaluating Limits 863 Tecniques for Evaluating Limits Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing
More informationAnnouncements. Lilian s office hours rescheduled: Fri 2-4pm HW2 out tomorrow, due Thursday, 7/7. CSE373: Data Structures & Algorithms
Announcements Lilian s office ours resceduled: Fri 2-4pm HW2 out tomorrow, due Tursday, 7/7 CSE373: Data Structures & Algoritms Deletion in BST 2 5 5 2 9 20 7 0 7 30 Wy migt deletion be arder tan insertion?
More informationSection 1.2 The Slope of a Tangent
Section 1.2 Te Slope of a Tangent You are familiar wit te concept of a tangent to a curve. Wat geometric interpretation can be given to a tangent to te grap of a function at a point? A tangent is te straigt
More informationPYRAMID FILTERS BASED ON BILINEAR INTERPOLATION
PYRAMID FILTERS BASED ON BILINEAR INTERPOLATION Martin Kraus Computer Grapics and Visualization Group, Tecnisce Universität Müncen, Germany krausma@in.tum.de Magnus Strengert Visualization and Interactive
More information2.3 Additional Relations
3 2.3 Additional Relations Figure 2.3 identiies additional relations, indicating te locations o te object and image, and te ratio o teir eigts (magniication) and orientations. Ray enters te lens parallel
More informationA geometric analysis of heuristic search
A geometric analysis of euristic searc by GORDON J. VANDERBRUG University of Maryland College Park, Maryland ABSTRACT Searc spaces for various types of problem representations can be represented in one
More informationMTH-112 Quiz 1 - Solutions
MTH- Quiz - Solutions Words in italics are for eplanation purposes onl (not necessar to write in te tests or. Determine weter te given relation is a function. Give te domain and range of te relation. {(,
More informationProceedings of the 8th WSEAS International Conference on Neural Networks, Vancouver, British Columbia, Canada, June 19-21,
Proceedings of te 8t WSEAS International Conference on Neural Networks, Vancouver, Britis Columbia, Canada, June 9-2, 2007 3 Neural Network Structures wit Constant Weigts to Implement Dis-Jointly Removed
More informationCS 234. Module 6. October 16, CS 234 Module 6 ADT Dictionary 1 / 33
CS 234 Module 6 October 16, 2018 CS 234 Module 6 ADT Dictionary 1 / 33 Idea for an ADT Te ADT Dictionary stores pairs (key, element), were keys are distinct and elements can be any data. Notes: Tis is
More informationθ R = θ 0 (1) -The refraction law says that: the direction of refracted ray (angle θ 1 from vertical) is (2)
LIGHT (Basic information) - Considering te ligt of a projector in a smoky room, one gets to geometrical optics model of ligt as a set of tiny particles tat travel along straigt lines called "optical rays.
More informationInterference and Diffraction of Light
Interference and Diffraction of Ligt References: [1] A.P. Frenc: Vibrations and Waves, Norton Publ. 1971, Capter 8, p. 280-297 [2] PASCO Interference and Diffraction EX-9918 guide (written by Ann Hanks)
More informationIntra- and Inter-Session Network Coding in Wireless Networks
Intra- and Inter-Session Network Coding in Wireless Networks Hulya Seferoglu, Member, IEEE, Atina Markopoulou, Member, IEEE, K K Ramakrisnan, Fellow, IEEE arxiv:857v [csni] 3 Feb Abstract In tis paper,
More informationAreas of Triangles and Parallelograms. Bases of a parallelogram. Height of a parallelogram THEOREM 11.3: AREA OF A TRIANGLE. a and its corresponding.
11.1 Areas of Triangles and Parallelograms Goal p Find areas of triangles and parallelograms. Your Notes VOCABULARY Bases of a parallelogram Heigt of a parallelogram POSTULATE 4: AREA OF A SQUARE POSTULATE
More information( ) ( ) Mat 241 Homework Set 5 Due Professor David Schultz. x y. 9 4 The domain is the interior of the hyperbola.
Mat 4 Homework Set 5 Due Professor David Scultz Directions: Sow all algebraic steps neatly and concisely using proper matematical symbolism. Wen graps and tecnology are to be implemented, do so appropriately.
More informationTraffic Sign Classification Using Ring Partitioned Method
Traffic Sign Classification Using Ring Partitioned Metod Aryuanto Soetedjo and Koici Yamada Laboratory for Management and Information Systems Science, Nagaoa University of Tecnology 603- Kamitomioamaci,
More informationA Novel QC-LDPC Code with Flexible Construction and Low Error Floor
A Novel QC-LDPC Code wit Flexile Construction and Low Error Floor Hanxin WANG,2, Saoping CHEN,2,CuitaoZHU,2 and Kaiyou SU Department of Electronics and Information Engineering, Sout-Central University
More informationCubic smoothing spline
Cubic smooting spline Menu: QCExpert Regression Cubic spline e module Cubic Spline is used to fit any functional regression curve troug data wit one independent variable x and one dependent random variable
More information13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR
13.5 Directional Derivatives and te Gradient Vector Contemporary Calculus 1 13.5 DIRECTIONAL DERIVATIVES and te GRADIENT VECTOR Directional Derivatives In Section 13.3 te partial derivatives f x and f
More informationTHE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM
THE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM SAMUEL OLU OLAGUNJU Adeyemi College of Education NIGERIA Email: lagsam04@aceondo.edu.ng ABSTRACT
More information12.2 TECHNIQUES FOR EVALUATING LIMITS
Section Tecniques for Evaluating Limits 86 TECHNIQUES FOR EVALUATING LIMITS Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing tecnique to evaluate its of
More information1 Finding Trigonometric Derivatives
MTH 121 Fall 2008 Essex County College Division of Matematics Hanout Version 8 1 October 2, 2008 1 Fining Trigonometric Derivatives 1.1 Te Derivative as a Function Te efinition of te erivative as a function
More informationExcel based finite difference modeling of ground water flow
Journal of Himalaan Eart Sciences 39(006) 49-53 Ecel based finite difference modeling of ground water flow M. Gulraiz Akter 1, Zulfiqar Amad 1 and Kalid Amin Kan 1 Department of Eart Sciences, Quaid-i-Azam
More informationMAPI Computer Vision
MAPI Computer Vision Multiple View Geometry In tis module we intend to present several tecniques in te domain of te 3D vision Manuel Joao University of Mino Dep Industrial Electronics - Applications -
More information2D transformations Homogeneous coordinates. Uses of Transformations
2D transformations omogeneous coordinates Uses of Transformations Modeling: position and resize parts of a complex model; Viewing: define and position te virtual camera Animation: define ow objects move/cange
More informationCoarticulation: An Approach for Generating Concurrent Plans in Markov Decision Processes
Coarticulation: An Approac for Generating Concurrent Plans in Markov Decision Processes Kasayar Roanimanes kas@cs.umass.edu Sridar Maadevan maadeva@cs.umass.edu Department of Computer Science, University
More informationYou should be able to visually approximate the slope of a graph. The slope m of the graph of f at the point x, f x is given by
Section. Te Tangent Line Problem 89 87. r 5 sin, e, 88. r sin sin Parabola 9 9 Hperbola e 9 9 9 89. 7,,,, 5 7 8 5 ortogonal 9. 5, 5,, 5, 5. Not multiples of eac oter; neiter parallel nor ortogonal 9.,,,
More informationUUV DEPTH MEASUREMENT USING CAMERA IMAGES
ABCM Symposium Series in Mecatronics - Vol. 3 - pp.292-299 Copyrigt c 2008 by ABCM UUV DEPTH MEASUREMENT USING CAMERA IMAGES Rogerio Yugo Takimoto Graduate Scool of Engineering Yokoama National University
More informationSome Handwritten Signature Parameters in Biometric Recognition Process
Some Handwritten Signature Parameters in Biometric Recognition Process Piotr Porwik Institute of Informatics, Silesian Uniersity, Bdziska 39, 41- Sosnowiec, Poland porwik@us.edu.pl Tomasz Para Institute
More informationANTENNA SPHERICAL COORDINATE SYSTEMS AND THEIR APPLICATION IN COMBINING RESULTS FROM DIFFERENT ANTENNA ORIENTATIONS
NTNN SPHRICL COORDINT SSTMS ND THIR PPLICTION IN COMBINING RSULTS FROM DIFFRNT NTNN ORINTTIONS llen C. Newell, Greg Hindman Nearfield Systems Incorporated 133. 223 rd St. Bldg. 524 Carson, C 9745 US BSTRCT
More informationCSE 332: Data Structures & Parallelism Lecture 8: AVL Trees. Ruth Anderson Winter 2019
CSE 2: Data Structures & Parallelism Lecture 8: AVL Trees Rut Anderson Winter 29 Today Dictionaries AVL Trees /25/29 2 Te AVL Balance Condition: Left and rigt subtrees of every node ave eigts differing
More informationNon-Interferometric Testing
NonInterferometric Testing.nb Optics 513 - James C. Wyant 1 Non-Interferometric Testing Introduction In tese notes four non-interferometric tests are described: (1) te Sack-Hartmann test, (2) te Foucault
More information8/6/2010 Assignment Previewer
Week 4 Friday Homework (1321979) Question 1234567891011121314151617181920 1. Question DetailsSCalcET6 2.7.003. [1287988] Consider te parabola y 7x - x 2. (a) Find te slope of te tangent line to te parabola
More informationImplementation of Integral based Digital Curvature Estimators in DGtal
Implementation of Integral based Digital Curvature Estimators in DGtal David Coeurjolly 1, Jacques-Olivier Lacaud 2, Jérémy Levallois 1,2 1 Université de Lyon, CNRS INSA-Lyon, LIRIS, UMR5205, F-69621,
More informationWhen the dimensions of a solid increase by a factor of k, how does the surface area change? How does the volume change?
8.4 Surface Areas and Volumes of Similar Solids Wen te dimensions of a solid increase by a factor of k, ow does te surface area cange? How does te volume cange? 1 ACTIVITY: Comparing Surface Areas and
More information6 Computing Derivatives the Quick and Easy Way
Jay Daigle Occiental College Mat 4: Calculus Experience 6 Computing Derivatives te Quick an Easy Way In te previous section we talke about wat te erivative is, an we compute several examples, an ten we
More informationA UPnP-based Decentralized Service Discovery Improved Algorithm
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol.1, No.1, Marc 2013, pp. 21~26 ISSN: 2089-3272 21 A UPnP-based Decentralized Service Discovery Improved Algoritm Yu Si-cai*, Wu Yan-zi,
More informationLecture 4: Geometry II
Lecture 4: Geometry II LPSS MATHCOUNTS 19 May 2004 Some Well-Known Pytagorean Triples A Pytagorean triple is a set of tree relatively prime 1 natural numers a,, and c satisfying a 2 + 2 = c 2 : 3 2 + 4
More informationSymmetric Tree Replication Protocol for Efficient Distributed Storage System*
ymmetric Tree Replication Protocol for Efficient Distributed torage ystem* ung Cune Coi 1, Hee Yong Youn 1, and Joong up Coi 2 1 cool of Information and Communications Engineering ungkyunkwan University
More informationMaterials: Whiteboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector.
Adam Clinc Lesson: Deriving te Derivative Grade Level: 12 t grade, Calculus I class Materials: Witeboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector. Goals/Objectives:
More informationAlgebra Area of Triangles
LESSON 0.3 Algera Area of Triangles FOCUS COHERENCE RIGOR LESSON AT A GLANCE F C R Focus: Common Core State Standards Learning Ojective 6.G.A. Find te area of rigt triangles, oter triangles, special quadrilaterals,
More informationEXERCISES 6.1. Cross-Sectional Areas. 6.1 Volumes by Slicing and Rotation About an Axis 405
6. Volumes b Slicing and Rotation About an Ais 5 EXERCISES 6. Cross-Sectional Areas In Eercises and, find a formula for te area A() of te crosssections of te solid perpendicular to te -ais.. Te solid lies
More informationSection 3. Imaging With A Thin Lens
Section 3 Imaging Wit A Tin Lens 3- at Ininity An object at ininity produces a set o collimated set o rays entering te optical system. Consider te rays rom a inite object located on te axis. Wen te object
More informationBlades: A New Class of Geometric Primitives for Feeding 3D Parts on Vibratory Tracks
Blades: A New lass of Geometric Primitives for Feeding 3D Parts on Vibratory Tracks Onno. Goemans, Ken Goldberg and A. Frank van der Stappen Institute of Information and omputing Sciences, Utrect University,
More informationSoftware Fault Prediction using Machine Learning Algorithm Pooja Garg 1 Mr. Bhushan Dua 2
IJSRD - International Journal for Scientific Researc & Development Vol. 3, Issue 04, 2015 ISSN (online): 2321-0613 Software Fault Prediction using Macine Learning Algoritm Pooja Garg 1 Mr. Busan Dua 2
More informationThe navigability variable is binary either a cell is navigable or not. Thus, we can invert the entire reasoning by substituting x i for x i : (4)
A Multi-Resolution Pyramid for Outdoor Robot Terrain Perception Micael Montemerlo and Sebastian Trun AI Lab, Stanford University 353 Serra Mall Stanford, CA 94305-9010 {mmde,trun}@stanford.edu Abstract
More informationOur Calibrated Model has No Predictive Value: An Example from the Petroleum Industry
Our Calibrated Model as No Predictive Value: An Example from te Petroleum Industry J.N. Carter a, P.J. Ballester a, Z. Tavassoli a and P.R. King a a Department of Eart Sciences and Engineering, Imperial
More informationComparison of the Efficiency of the Various Algorithms in Stratified Sampling when the Initial Solutions are Determined with Geometric Method
International Journal of Statistics and Applications 0, (): -0 DOI: 0.9/j.statistics.000.0 Comparison of te Efficiency of te Various Algoritms in Stratified Sampling wen te Initial Solutions are Determined
More informationThe degree/diameter problem in maximal planar bipartite graphs
The degree/diameter problem in maximal planar bipartite graphs C. Dalfó a, C. Huemer a, J. Salas b a Universitat Politècnica de Cataluna, BarcelonaTech Dept. de Matemàtica Aplicada IV, Barcelona, Catalonia
More informationThe degree/diameter problem in maximal planar bipartite graphs
The degree/diameter problem in maximal planar bipartite graphs Cristina Dalfó Clemens Huemer Departament de Matemàtiques Universitat Politècnica de Catalunya, BarcelonaTech Barcelona, Catalonia {cristina.dalfo,
More informationWrap up Amortized Analysis; AVL Trees. Riley Porter Winter CSE373: Data Structures & Algorithms
CSE 373: Data Structures & Wrap up Amortized Analysis; AVL Trees Riley Porter Course Logistics Symposium offered by CSE department today HW2 released, Big- O, Heaps (lecture slides ave pseudocode tat will
More informationAlternating Direction Implicit Methods for FDTD Using the Dey-Mittra Embedded Boundary Method
Te Open Plasma Pysics Journal, 2010, 3, 29-35 29 Open Access Alternating Direction Implicit Metods for FDTD Using te Dey-Mittra Embedded Boundary Metod T.M. Austin *, J.R. Cary, D.N. Smite C. Nieter Tec-X
More informationData Structures and Programming Spring 2014, Midterm Exam.
Data Structures and Programming Spring 2014, Midterm Exam. 1. (10 pts) Order te following functions 2.2 n, log(n 10 ), 2 2012, 25n log(n), 1.1 n, 2n 5.5, 4 log(n), 2 10, n 1.02, 5n 5, 76n, 8n 5 + 5n 2
More informationYou Try: A. Dilate the following figure using a scale factor of 2 with center of dilation at the origin.
1 G.SRT.1-Some Tings To Know Dilations affect te size of te pre-image. Te pre-image will enlarge or reduce by te ratio given by te scale factor. A dilation wit a scale factor of 1> x >1enlarges it. A dilation
More informationA Bidirectional Subsethood Based Similarity Measure for Fuzzy Sets
A Bidirectional Subsetood Based Similarity Measure for Fuzzy Sets Saily Kabir Cristian Wagner Timoty C. Havens and Derek T. Anderson Intelligent Modelling and Analysis (IMA) Group and Lab for Uncertainty
More informationTwo Modifications of Weight Calculation of the Non-Local Means Denoising Method
Engineering, 2013, 5, 522-526 ttp://dx.doi.org/10.4236/eng.2013.510b107 Publised Online October 2013 (ttp://www.scirp.org/journal/eng) Two Modifications of Weigt Calculation of te Non-Local Means Denoising
More informationParallel Simulation of Equation-Based Models on CUDA-Enabled GPUs
Parallel Simulation of Equation-Based Models on CUDA-Enabled GPUs Per Ostlund Department of Computer and Information Science Linkoping University SE-58183 Linkoping, Sweden per.ostlund@liu.se Kristian
More informationeach node in the tree, the difference in height of its two subtrees is at the most p. AVL tree is a BST that is height-balanced-1-tree.
Data Structures CSC212 1 AVL Trees A binary tree is a eigt-balanced-p-tree if for eac node in te tree, te difference in eigt of its two subtrees is at te most p. AVL tree is a BST tat is eigt-balanced-tree.
More informationAVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic
1 AVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic AVL Trees 2 Binary Searc Trees better tan linear dictionaries; owever, te worst case performance
More informationNonprehensile Manipulation for Orienting Parts in the Plane
Nonpreensile Manipulation for Orienting Parts in te Plane Nina B. Zumel Robotics Institute Carnegie Mellon University zumel@ri.cmu.edu Micael A. Erdmann Robotics Institute and Scool of Computer Science
More informationFault Localization Using Tarantula
Class 20 Fault localization (cont d) Test-data generation Exam review: Nov 3, after class to :30 Responsible for all material up troug Nov 3 (troug test-data generation) Send questions beforeand so all
More information