Method to solve the limitations in drawing external rays of the Mandelbrot set

Size: px
Start display at page:

Download "Method to solve the limitations in drawing external rays of the Mandelbrot set"

Transcription

1 Method to solve the limitations in drawing external rays of the Mandelbrot set M Romera 1, G Pastor 1, A B Orue 1, A Martin 1, M F Dana,3,* and F Montoya 1 1 Information Seurity Institute, CSIC, Serrano 144, 8006 Madrid, Spain, Dept. of Mathematis and Computer Siene "Avram Ianu" University, Ilie Măelaru 1A, Cluj-Napoa, România, 3 Romanian Institute of Siene and Tehnology, Cireşilor 9, Cluj-Napoa, România, Abstrat The external rays of the Mandelbrot set are a valuable graphi tool in order to study this set. They are drawn using omputer programs starting from the Bötther oordinate. However, the drawing of an external ray annot be ompleted beause it reahes a point from whih the drawing tool annot ontinue drawing. This point is influened by the resolution of the standard for floating-point omputation used by the drawing program. The IEEE 754 Standard for Floating-Point Arithmeti is the most widely-used standard for floating-point omputation, and we analyze the possibilities of the quadruple 18 bits format of the urrent IEEE Standard in order to draw external rays. When the drawing is not possible, due to a lak of resolution of this Standard, we introdue a method to draw external rays based on the esape lines and Bézier urves. Mathematis Subjet Classifiation: 37F45, 68M15 1. Introdution As is well known, the Mandelbrot set an be defined by : f k (0) as k, k where f (0) is the k-iteration of the parameter-dependent quadrati funtion (z and omplex) from the initial value z0 0 (the ritial point). f z z ( ) In the 1980's, Douady and Hubbard published the external arguments theory of the Mandelbrot set [1,]. Douady popularized this theory [3] by onsidering a apaitor made of a *Corresponding author: dana@rist.ro

2 hollow metalli ylinder with great diameter, whose axis was an aluminum bar shaped in suh a way that its ross-setion was. If the apaitor is onneted to a battery appears an eletri field between the ylinder and, with equipotential lines and field lines. The field lines are the external rays of Douady and Hubbard, and the numbers assoiated with the external rays (between 0 and 1) are the external arguments of Douady and Hubbard. This eletri field is extremely ompliated beause is generated in a apaitor where one of their plates is a fratal. For this reason, mathematiians and engineers may be interested in that study. The external rays and its external arguments identify graphially and numerially all the periodi omponents and Misiurewiz points (preperiodi points) of and, therefore, the drawing of the external rays is important to study the ordering of. The omputer programs to draw external rays of the Mandelbrot set use the Bötther oordinate ( ) given by [4]: 1 n 1 (1) n1 n1 f ( ) where is the omplex oordinate of a point outside and f ( )... are the iterates of f z z ( ) 0, f f, 1 from the initial value z 0 0. The potential of is log ( ) and the external argument of is arg ( ) []. All the points of an external ray have the same external argument. All the points with the same potential define an equipotential line. The external rays are perpendiular to the equipotential lines. The IEEE 754 Standard for Floating-Point Arithmeti [5] is the most widely-used standard for floating-point omputation, and it is followed by many hardware and software implementations. Many omputer languages allow or require that some or all arithmeti be arried out using IEEE 754 formats and operations. The urrent version is IEEE that inludes the original IEEE The resolutions of the three basi formats of this Standard are: ressingle 3, resdouble 5 and resquadruple 11, aording to the number of bits of the mantissas (see table 1). As we will see, the drawing of an external ray inside a detail of is strongly restrited by the number of bits of the floating-point arithmeti used by the omputer program. For this reason, the external rays annot be drawn in ertain details of with omputer programs [6-8] using the double 64 bits format of the old IEEE Standard. This is not due to a failure of programming but a lak of auray of the double 64 bits format.

3 3 Table 1. Basi formats in the IEEE Standard. Sign Mantissa Exponent Single (3 bits) Double (64 bits) Quadruple (18 bits) We are interested in the drawing of external rays of [9-18] and in this paper we will analyze the possibilities of the new quadruple 18 bits format of the IEEE Standard. Unfortunately, as we will see in Setion 5, the resolution of the quadruple format is not suffiient in some of the ases, and the same ours with a hypothetial otuple 56 bits format (not defined yet). To avoid this problem, we will introdue in Setion 4 a graphial proedure based on the esape lines [19,0,1] and Bézier urves [], whih allows us the drawing of the external rays of a detail of when it is not possible to do it using a omputer program based in the Bötther oordinate and running with the IEEE 754 Standard.. Tools to alulate external arguments.1. Binary expansions As is known, there are several hyperboli omponents of the same period p in [3]. The binary expansion of the external argument p of an external ray landing at the root point of a period-p hyperboli omponent is period-p periodi and the external argument is rational with odd denominator [,4] a p 0. aa 1 ap. () p 1 In this equation aa 1 a p are base digits suh that aa 1 a p a. For instane, the binary 4 expansion of the external argument , with a 3 and p 4, is , and the orresponding external ray lands at a period-4 hyperboli omponent (see figure 1, where the external rays are drawn with a omputer program using the double format of IEEE 754 [6]).

4 4 The binary expansion of the external argument nm, of an external ray landing at a Misiurewiz point of, i.e. a preperiodi point by iteration, is preperiodi of preperiod-n and period-m. Besides, the external argument is rational with even denominator b nm, 1 n 1 m n m m a 1 0. bb b aa a. (3) 1 Here aa 1 am and bb 1 b n are base digits suh that aa 1 a m a and bb 1 b n b. For instane, the binary expansion of the external argument n 1 and m ) is (see figure 1). (with a 1, b 0, Figure 1. Examples of external arguments of external rays landing at a hyperboli omponent and a Misiurewiz point. The figure is drawn using a omputer program working with the double format of IEEE 754 Standard [6].. Rotation number Devaney [5] assoiates a rational number p q to eah primary dis of the Mandelbrot set (a primary dis is diretly attahed to the main ardioid of the set). The denominator q is the period of the dis. The value of p is fixed by seeing the regions of the Julia set of when we superimpose the attrating yle of f ( z ) on the Julia set. The point 0 of the attrating yle lies in the largest of these regions and the smallest is loated exatly p q revolutions about in the ounterlokwise diretion. For instane, in figure we an see that p and q 5 in the dis i. We would like to note that in our papers (see for example [14]) normally we write the rotation number as q p instead of p q in order to denominate the period with a p.

5 5 Figure. Julia set of i showing the jumps in the iterative proess f z z ( )..3. Tuning algorithm This algorithm is due to Douady []. Let W be a hyperboli omponent of period p 1 with entre 0, and W 0 the main ardioid of with period 1 and entre 0. There is a ontinuous injetion W : suh that 0 W 0 and W W W 0. Let us suppose the binary expansions of the external arguments of the external rays landing at the root point of W are p, 1 p 0. uu 1 1 up, 0. vv 1 1 vp. Let x be a landing point on W 1 0 of period p and x x W the landing point on W, of period 1 p p that Douady alled " 0 tuned by x". If the binary expansions of the external arguments of the external rays landing at x are p, p 0. s 1s... sp, 0. t 1t... tp, the orresponding external rays landing at x have external arguments whose binary expansions an be obtained by substituting eah bit of p, p by uu... 1 u p 1 if the bit is 0 or by vv... 1 v p 1 if the bit is 1. For instane, let us onsider the period-4 hyperboli omponent with root point loated at i. The binary expansions of the external arguments of the external rays landing at this point are 4, , Let x i be the root point of a period-5 dis on the main ardioid and 5, , the binary expansions of the external arguments of the external rays landing at this point. The orresponding binary expansions of the external arguments of the rays landing at x i are 0, ,

6 6.4. Narrow hyperboli omponent A period-p hyperboli omponent of the Mandelbrot set is narrow if it ontains no omponent of equal or lesser period in its wake [6]. Then, the external arguments a p p ( 1), a ( 1) of the external rays landing at the root point of a period-p narrow hyperboli omponent differ by 1 ( p 1), beause a a 1. For instane, the binary expansions 4, , , see figure 1, orrespond to a narrow period-4 hyperboli omponent. It is obvious that we need a omputer program with preision pre res better than p p 1( 1) to be able to draw separately the two external rays of a period-p narrow hyperboli omponent near to its landing point. Taking into aount the resolutions of the formats of the IEEE Standard (see table 1), the drawing of the two external rays of a narrow hyperboli omponent is impossible when its period is greater than 3, 5 or 11 and we use a single, double or quadruple format respetively..5. Shleiher's algorithm The Shleiher's algorithm allows us to find the binary expansions of the external arguments of the two external rays landing at the largest dis between two given with rotation numbers p1 q 1 and p q, when the binary expansions of the external rays landing at these diss are known (a detailed desription of the algorithm an be seen in [7]). First, we determine the rotation number of the largest dis by Farey addition [8], i.e. p q p q p p q q. Seond, we assume that the binary expansions of the two external rays losest to the ( p1 p) ( q1 q) dis are known and they are 0. uu 1 uq 1 and q vv v suh that 0. uu u 0. vv v. Third, the binary expansions of the 1 q1 1 q external rays landing at the ( p1 p) ( q1 q) dis are 0. uu 1... uqvv v q, 0. vv... v uu... u. 1 q 1 q1 For instane, the higher external argument of the dis with rotation number 1 3 is and the smaller external argument of the dis with rotation number 5 is The biggest dis 1 3 between the two former ones has rotation number and external arguments ,

7 7.6. Binary expansions in multiple-spiral medallions As is known, ontains small opies of itself (babies Mandelbrot sets, BMSs) whih in turn ontain smaller opies of, and so on ad infinitum. But the set is not self-similar. Atually, every BMS has its own pattern of external deorations. Some of these deorations are alled auliflowers [9], embedded Julia sets [30], or multiple-spiral medallions [11]. Using the symboli binary expansion, it has been onjetured [11] that the pair of binary expansions of the external arguments of the external rays landing at the usp of the ardioid of the entral BMS in a multiple-spiral medallion 0. b1, 0. b an be written starting from the binary expansions of its parent 0. p1, 0. p and its gene 0. g1, 0. g in the form 0. b. pp pg (where b * is b 1 or b, p * is p 1 or p and g * is g 1 or g ). The binary expansions 0. 1, 0. of a non-entral BMS has the form b p p p (where * is 1 or and j is the level of the BMS [15]). In figure 3 we an see examples of multiple-spiral medallions, where the BMSs until the third level are shown. j Figure 3. Examples of multiple-spiral medallions [13] in the Mandelbrot set showing the first, seond and third levels of BMSs. (a) Single-spiral medallion i. (b) Double-spiral medallion i. () Triple-spiral medallion i. 3. The end point of the drawing of an external ray When we draw an external ray by means of a omputer program using the Bötther oordinate, we observe that the drawing of the ray is interrupted when it omes lose to the landing point, i.e., the drawing of an external ray has an end point. This limitation is due to a lak of resolution

8 8 of the drawing program that usually works with the floating-point arithmeti of the IEEE 754 Standard. Figure 4. End point of the drawing of the external ray obtained with three different programs working with the double format of IEEE 754 Standard. (a) Chéritat s program [6]. (b) Kawahira s program [7]. () Jung s program [8]. As an example, in figure 4 we an see the drawing of the external ray near the tangent point of the dis of rotation number 1 3 with the main ardioid, starting from the programs of Chéritat [6], Kawahira [7] and Jung [8]. As far as we know, these programs use the double format of the IEEE 754 Standard with resdouble 5. The end point of the drawing of the external ray is approximately at i, beneath of the period-51 dis. Therefore, we an assume that the end point of the drawing of an external ray ours when the diss of its viinity have periods about the number of bits of the mantissa of the format of the IEEE 754.

9 9 Figure 5. The drawing of two external rays x and y when the differene is very small. (a) Ideal ase res. (b) Pratial ase when x y res x y. () Pratial ase when res x y. Let us onsider the drawing of two lose external rays x and y landing at points x and y (see figure 5). If the program has res as in (a), away from points x and y the two external rays go together in the same pixels until the graphial bifuration point g.b.p. where they begin to separate. Finally, the landing points x and y would be reahed. However, when we use a program with an IEEE 754 format, with finite resolution, the landing points annot be reahed, and there are two ases. When res x y, see (b), the end points appear after reahing the g.b.p. When res x y, see (), the end points appear before reahing the g.b.p. 4. Drawing external rays when the resolution of the IEEE 754 is not suffiient When the number of bits of the period (or the sum of the number of bits of the preperiod and period) of the binary expansion of the external argument of an external ray is greater than the number of bits of the quadruple format of the IEEE 754 Standard, obviously is impossible the drawing of the external ray near the landing point by means of a omputer program running with this Standard. In this ase we operate as follows (see figure 6, where we obtain the same external rays that in figure 1). Figure 6. Reprodution of figure 1 aording to Setion 4. First, we draw the detail of the Mandelbrot set with esape lines (blue olour in figure 6) n [19-1]. The equation of an esape line is mod f ( ) re, where re is the esape radius and 0 f, f, 1 f ( ). For n 0,1, we have the different esape lines. The esape lines are losed urves that have a lear physial meaning: a point out of the esape line n but inside the esape line n 1 need n iterations to leave the irle of radius r e

10 10 (i.e., to esape to infinity). Hene, the esape line is the boundary of the Mandelbrot set. As is well known, if the esape radius is large ompared to the size of the set (for instane 5 re 10 ) the esape lines an be onsidered as equipotential lines. The esape lines are obtained as a onsequene of the iteration proess in the drawing of the detail of the Mandelbrot set and they do not need to be obtained with the Bötther oordinate. Seond, we draw manually the external rays by means of Bézier urves (red olour in figure 6) [] starting from the landing points of the external rays in suh a way that they are perpendiular to the esape lines. 5. The drawing of the external rays requires great omputer resolution The figure 7 shows a region of the Mandelbrot set near the tangent point of the dis of rotation number 1 3 with the main ardioid. Between the absises and there are 1163 pixels and therefore the distane between two onseutive pixels is d The figure has been drawn by means of a program using resdouble 5 16 the IEEE 754 double format where.10 d, with esape lines (in blue olour) and Bézier urves (in red olour) aording to Setion 4. As we an see next, it is not possible to draw the external rays in this figure by means of a omputer program using the Böther oordinate, due to a lak of resolution of the quadruple format of the IEEE 754 Standard. Figure 7. Detail of the Mandelbrot set near the tangent point of the dis with rotation number 1 3.

11 11 In the upper part of the figure 7, there are diss with periods 3 84, 3 85,, 3 91, attahed to the dis 1 3. For example, the external arguments of the external rays landing at the tangent point of the dis with period an be obtained by tuning and they are 88 67, , Note that the first 6 digits of 67 and 67 are the same. Therefore, to be able to draw these external rays separately near the landing point, the resolution of the omputer program must be greater than 6. Obviously, this resolution exeeds the possibilities of the quadruple format (18 bits) of the IEEE 754 Standard. In the lower part of the figure 7 there are diss with periods 383 4, 384 4,, attahed to the main ardioid. The external arguments of the external rays landing at the tangent point of the dis with period an be obtained by the Shleiher's algorithm and they are 68, , Note that this dis is narrow. The first 66 digits of 68 and 68 are the same and, again, the external rays 68 and 68 of figure 7 annot be drawn separately with a omputer program using the quadruple format (neither with the otuple format that it is not defined yet). Taking into aount that , the external ray 3 is between rays that annot be drawn. We onlude that the external ray 3 of figure 7 an not be drawn by a omputer program using the quadruple format of IEEE 754. In this ase, we propose the drawing of the external rays aording to Setion 4. We have shown an example where the double format of IEEE 754 Standard an draw a detail of the Mandelbrot set but the quadruple format (more préis) annot draw the external rays in the detail. Hene, the drawing of the external rays in a region of the Mandelbrot set needs greater omputer resolution than the drawing of the detail itself Example. Let us onsider the double-spiral medallion [13,15] loated at i. The figure 8 shows the loation of the medallion and in figure 8(a) we an see his parent p1 p , and his gene 0. g1, 0. g 0., , [9,11]. The figure 9 shows the medallion in detail with esape lines (in blue olour) and external rays (in red olour) aording to Setion 4. As is known [15], the binary expansions of the external arguments of the external rays landing at the usp of the entral BMS of a double-spiral

12 1 medallion have symboli binary expansions 0. b1, 0. b i 0. p1p p1p1g, i 1,, 3. In the medallion of figure 9 we have i 3 and 0. p p i1 1 g1 with 3 0. b1, 0. b , Therefore the period of the entral BMS is 67, as we easily an verify by diret iteration of i. Note that the first 61 bits of the pair 0. b1, 0. b are the same. Figure 8. Suessive magnifiations to loating the double-spiral medallion entred at i (the medallion is marked by the arrow). (a) The parent 0. p, 0. 1 p , in the wake of the gene 0. 1, , g g. (b) The period-4 parent. () The valley between the period-( 4) dis of the parent and the ardioid of the parent. (d) The medallion. The medallion has two prinipal tips. One of them an be obtained as the limit of the BMSs bp 1 bp 1, 0. bp 1 p, 0. bpp 1 1, 0. 1, , 0. bppp bppp and it is , , bp bp. Analogously, the other prinipal tip is

13 , , bp bp. The two tips have preperiods 67 and periods 4. Also note that the first 61 bits of the pairs bp 1 bp 1 and , 0. 0., 0. bp bp are the same. It is evident that eah one of the binary expansions of the external arguments of the BMSs and Misiurewiz points in this medallion must be in the interval 0. bp 1 1, 0. bp where the first 61 bits of the binary expansions are the same. We dedue that it is not possible to draw none of the external rays inside of this medallion using a omputer program working with the quadruple format (18 bits) of IEEE 754 Standard, nor with the otuple format (56 bits, not yet defined). However it is possible to draw the external rays of the medallion aording to Setion 4. In figure 9 we an see the external rays landing at the entral BMS 0. b1, 0. b, the tips bp 1 bp 1 and , 0. 0., 0. bp bp, the two BMSs of the first level, the four BMSs of the seond level and the eight BMSs of the third level.

14 14 Figure 9. Double-spiral medallion loated at i showing esape lines (blue olour) and Bézier urves (red olour) aording to Setion 4.

15 15 6. Conlusions It has been shown that the drawing of the external rays in a detail of the Mandelbrot set, using a omputer program starting from the Bötther oordinate and running with the urrent IEEE 754 Standard for Floating-Point Arithmeti, requires more resolution than the drawing of the detail itself. For this ause, in ertain details of the Mandelbrot set obtained with the quadruple format of this Standard (the more préis), it is not possible to draw the external rays due to a lak of resolution. In these ases we have introdued a method based on esape lines and Bézier urves, whih allows the drawing of the external rays. Aknowledgements This work has been partially supported by Ministerio de Cienia e Innovaión (Spain) under the Grant TIN Referenes [1] Douady A, Hubbard J H 198 Itération des polynômes quadratiques omplexes. C. R. Aad. Si. Paris Sér. I Math [] Douady A 1986 Algorithms for omputing angles in the Mandelbrot set. Chaoti Dynamis and Fratals Barnsley M, Demko S G (Eds.), Aademi Press, New York [3] Douady A 1986 Julia set and the Mandelbrot set. The Beauty of Fratals Peitgen H O, Rihter P H (Eds.), Springer, Berlin [4] Carleson L and Gamelin T W 1993 Complex Dynamis, Springer, Berlin [5] IEEE Standard for Floating-Point Arithmeti [6] Chéritat A 1999 Dynamique Holomorphe [7] Kawahira T 008 Mandel [8] Jung W 01 Mandel: software for real and omplex dynamis [9] Romera M, Pastor G, Álvarez G and Montoya F 004 External arguments of Douady auliflowers in the Mandelbrot set. Comput. Graph [10] Pastor G, Romera M, Álvarez G and Montoya F 00 Operating with external arguments in the Mandelbrot set antenna. Physia D

16 16 [11] Romera M, Pastor G, Álvarez G and Montoya F 006 External arguments in the multiplespiral medallions of the Mandelbrot set. Comput. Graph [1] Pastor G, Romera M, Álvarez G and Montoya F 005, External arguments for the haoti bands alulation in the Mandelbrot set. Physia A [13] Romera M, Álvarez G, Arroyo D, Orue A B, Fernandez V and Pastor G 008 Drawing and omputing external rays in the multiple-spiral medallions of the Mandelbrot set. Comput. Graph [14] Pastor G, Romera M, Álvarez G, Arroyo D and Montoya F 006 Equivalene between subshrubs and haoti bands in the Mandelbrot Set. Disrete Dyn. Nat. So. Artile ID 70471, 5 pages [15] Romera M, Pastor G, Orue A B, Arroyo D and Montoya F 009 Coupling patterns of external arguments in the multiple-spiral medallions of the Mandelbrot set. Disrete Dyn. Nat. So. Artile ID , 14 pages [16] Pastor G, Romera M, Álvarez G, Nunez J, Arroyo D and Montoya F 007 Operating with external arguments of Douady and Hubbard. Disrete Dyn. Nat. So. Artile ID 4590, 17 pages [17] Pastor G, Romera M, Álvarez G, Arroyo D, Orue A B, Fernandez V and Montoya F 008 Algorithm for external arguments alulation of the nodes of a shrub in the Mandelbrot set. Fratals [18] Pastor G, Romera M, Álvarez G, Arroyo D, Orue A B, Fernández V and Montoya F 009 A general view of pseudoharmonis and pseudoantiharmonis to alulate external arguments of Douady and Hubbard. Appl. Math. Comput [19] Peitgen H.-O. and Rihter P. H The Beauty of Fratals Springer-Verlag, New York 163 [0] Philip K. W. 199 Field lines in the Mandelbrot set, Comput. Graph [1] Romera M, Pastor G and Montoya F 1996 Graphi tools to analyse one-dimensional quadrati maps. Comput. Graph [] Bézier P 1968 Proédé de définition numérique des ourbes et surfaes non mathématiques: système Unisurf. Automatisme [3] Lutzky M 1988 Counting stable yles in unimodal iterations. Phys. Lett. A [4] Branner B 1989 The Mandelbrot set. Chaos and Fratals: the Mathematis Behind the Computer Graphis, Pro. Symp. Appl. Math. 39 AMS [5] Devaney R L 1995 The fratal geometry of the Mandelbrot set : How to ount and how to add. Fratals

17 17 [6] Shleiher D 01 Internal addresses of the Mandelbrot set and Galois groups of polynomials. arxiv:math/941138v3 [7] Devaney R L 1994 The omplex dynamis of quadrati polynomials, Complex Dynamial Systems Devaney R L (Ed.), AMS, Cininnati 1-9 [8] Farey J 1816 On a urious property of vulgar frations, Philos. Mag [9] Douady A, Buff X, Devaney R L and Sentena P 000 Baby Mandelbrot sets are born in auliflowers. The Mandelbrot set, theme and variations Lei T (Ed.), University Press Cambridge [30] Munafo R P 008 Embedded Julia set.

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0; Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;

More information

arxiv: v1 [cs.gr] 10 Apr 2015

arxiv: v1 [cs.gr] 10 Apr 2015 REAL-TIME TOOL FOR AFFINE TRANSFORMATIONS OF TWO DIMENSIONAL IFS FRACTALS ELENA HADZIEVA AND MARIJA SHUMINOSKA arxiv:1504.02744v1 s.gr 10 Apr 2015 Abstrat. This work introdues a novel tool for interative,

More information

Introduction to Seismology Spring 2008

Introduction to Seismology Spring 2008 MIT OpenCourseWare http://ow.mit.edu 1.510 Introdution to Seismology Spring 008 For information about iting these materials or our Terms of Use, visit: http://ow.mit.edu/terms. 1.510 Leture Notes 3.3.007

More information

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of

More information

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

Orientation of the coordinate system

Orientation of the coordinate system Orientation of the oordinate system Right-handed oordinate system: -axis by a positive, around the -axis. The -axis is mapped to the i.e., antilokwise, rotation of The -axis is mapped to the -axis by a

More information

CleanUp: Improving Quadrilateral Finite Element Meshes

CleanUp: Improving Quadrilateral Finite Element Meshes CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)

More information

represent = as a finite deimal" either in base 0 or in base. We an imagine that the omputer first omputes the mathematial = then rounds the result to

represent = as a finite deimal either in base 0 or in base. We an imagine that the omputer first omputes the mathematial = then rounds the result to Sientifi Computing Chapter I Computer Arithmeti Jonathan Goodman Courant Institute of Mathemaial Sienes Last revised January, 00 Introdution One of the many soures of error in sientifi omputing is inexat

More information

Colouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G.

Colouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G. Colouring ontat graphs of squares and retilinear polygons de Berg, M.T.; Markovi, A.; Woeginger, G. Published in: nd European Workshop on Computational Geometry (EuroCG 06), 0 Marh - April, Lugano, Switzerland

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Exploring the Commonality in Feature Modeling Notations

Exploring the Commonality in Feature Modeling Notations Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om

More information

Lecture Notes of Möbuis Transformation in Hyperbolic Plane

Lecture Notes of Möbuis Transformation in Hyperbolic Plane Applied Mathematis, 04, 5, 6-5 Published Online August 04 in SiRes http://wwwsirporg/journal/am http://dxdoiorg/0436/am04555 Leture Notes of Möbuis Transformation in Hyperboli Plane Rania B M Amer Department

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

Modeling of Wire Electrochemical Machining

Modeling of Wire Electrochemical Machining A publiation of 91 CHEMICAL ENGINEERING TRANSACTIONS VOL. 41, 214 Guest Editors: Simonetta Palmas, Mihele Masia, Annalisa Vaa Copyright 214, AIDIC Servizi S.r.l., ISBN 978-88-9568-32-7; ISSN 2283-9216

More information

And, the (low-pass) Butterworth filter of order m is given in the frequency domain by

And, the (low-pass) Butterworth filter of order m is given in the frequency domain by Problem Set no.3.a) The ideal low-pass filter is given in the frequeny domain by B ideal ( f ), f f; =, f > f. () And, the (low-pass) Butterworth filter of order m is given in the frequeny domain by B

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

Simultaneous image orientation in GRASS

Simultaneous image orientation in GRASS Simultaneous image orientation in GRASS Alessandro BERGAMINI, Alfonso VITTI, Paolo ATELLI Dipartimento di Ingegneria Civile e Ambientale, Università degli Studi di Trento, via Mesiano 77, 38 Trento, tel.

More information

We P9 16 Eigenray Tracing in 3D Heterogeneous Media

We P9 16 Eigenray Tracing in 3D Heterogeneous Media We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting

More information

Measurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method

Measurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method Measurement of the stereosopi rangefinder beam angular veloity using the digital image proessing method ROMAN VÍTEK Department of weapons and ammunition University of defense Kouniova 65, 62 Brno CZECH

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

Chapter 2: Introduction to Maple V

Chapter 2: Introduction to Maple V Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard

More information

MATH STUDENT BOOK. 12th Grade Unit 6

MATH STUDENT BOOK. 12th Grade Unit 6 MATH STUDENT BOOK 12th Grade Unit 6 Unit 6 TRIGONOMETRIC APPLICATIONS MATH 1206 TRIGONOMETRIC APPLICATIONS INTRODUCTION 3 1. TRIGONOMETRY OF OBLIQUE TRIANGLES 5 LAW OF SINES 5 AMBIGUITY AND AREA OF A TRIANGLE

More information

Chromaticity-matched Superimposition of Foreground Objects in Different Environments

Chromaticity-matched Superimposition of Foreground Objects in Different Environments FCV216, the 22nd Korea-Japan Joint Workshop on Frontiers of Computer Vision Chromatiity-mathed Superimposition of Foreground Objets in Different Environments Yohei Ogura Graduate Shool of Siene and Tehnology

More information

Graph-Based vs Depth-Based Data Representation for Multiview Images

Graph-Based vs Depth-Based Data Representation for Multiview Images Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:

More information

Abstract. We describe a parametric hybrid Bezier patch that, in addition. schemes are local in that changes to part of the data only aect portions of

Abstract. We describe a parametric hybrid Bezier patch that, in addition. schemes are local in that changes to part of the data only aect portions of A Parametri Hyrid Triangular Bezier Path Stephen Mann and Matthew Davidhuk Astrat. We desrie a parametri hyrid Bezier path that, in addition to lending interior ontrol points, lends oundary ontrol points.

More information

Triangles. Learning Objectives. Pre-Activity

Triangles. Learning Objectives. Pre-Activity Setion 3.2 Pre-tivity Preparation Triangles Geena needs to make sure that the dek she is building is perfetly square to the brae holding the dek in plae. How an she use geometry to ensure that the boards

More information

Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inconclusive Results

Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inconclusive Results CCCG 2018, Winnipeg, Canada, August 8 10, 2018 Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inonlusive Results Luis A. Garia Andres Gutierrrez Isaa Ruiz Andrew Winslow Abstrat We

More information

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

A Fast Sub-pixel Motion Estimation Algorithm for. H.264/AVC Video Coding

A Fast Sub-pixel Motion Estimation Algorithm for. H.264/AVC Video Coding A Fast Sub-pixel Motion Estimation Algorithm or H.64/AVC Video Coding Weiyao Lin Krit Panusopone David M. Baylon Ming-Ting Sun 3 Zhenzhong Chen 4 and Hongxiang Li 5 Institute o Image Communiation and Inormation

More information

Simulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects

Simulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects Raabe, Roters, Wang Simulation of Crystallographi Texture and Anisotropie of Polyrystals during Metal Forming with Respet to Saling Aspets D. Raabe, F. Roters, Y. Wang Max-Plank-Institut für Eisenforshung,

More information

1. Introduction. 2. The Probable Stope Algorithm

1. Introduction. 2. The Probable Stope Algorithm 1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground

More information

1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0.

1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0. C HPTER 1 SETS I. DEFINITION OF SET We begin our study of probability with the disussion of the basi onept of set. We assume that there is a ommon understanding of what is meant by the notion of a olletion

More information

Video Data and Sonar Data: Real World Data Fusion Example

Video Data and Sonar Data: Real World Data Fusion Example 14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu

More information

Cluster-Based Cumulative Ensembles

Cluster-Based Cumulative Ensembles Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,

More information

Solutions to Tutorial 2 (Week 9)

Solutions to Tutorial 2 (Week 9) The University of Syney Shool of Mathematis an Statistis Solutions to Tutorial (Week 9) MATH09/99: Disrete Mathematis an Graph Theory Semester, 0. Determine whether eah of the following sequenes is the

More information

An Efficient and Scalable Approach to CNN Queries in a Road Network

An Efficient and Scalable Approach to CNN Queries in a Road Network An Effiient and Salable Approah to CNN Queries in a Road Network Hyung-Ju Cho Chin-Wan Chung Dept. of Eletrial Engineering & Computer Siene Korea Advaned Institute of Siene and Tehnology 373- Kusong-dong,

More information

Cracked Hole Finite Element Modeling

Cracked Hole Finite Element Modeling Craked Hole Finite Element Modeling (E-20-F72) Researh Report Submitted to: Lokheed Martin, Program Manager: Dr. Stephen P. Engelstad Prinipal Investigator: Dr. Rami M. Haj-Ali Shool of Civil and Environmental

More information

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The

More information

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,

More information

Particle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating

Particle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

Incremental Mining of Partial Periodic Patterns in Time-series Databases

Incremental Mining of Partial Periodic Patterns in Time-series Databases CERIAS Teh Report 2000-03 Inremental Mining of Partial Periodi Patterns in Time-series Dataases Mohamed G. Elfeky Center for Eduation and Researh in Information Assurane and Seurity Purdue University,

More information

1. Inversions. A geometric construction relating points O, A and B looks as follows.

1. Inversions. A geometric construction relating points O, A and B looks as follows. 1. Inversions. 1.1. Definitions of inversion. Inversion is a kind of symmetry about a irle. It is defined as follows. he inversion of degree R 2 entered at a point maps a point to the point on the ray

More information

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali

More information

INTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS

INTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS Proeedings of the COST G-6 Conferene on Digital Audio Effets (DAFX-), Verona, Italy, Deember 7-9, INTERPOLATED AND WARPED -D DIGITAL WAVEGUIDE MESH ALGORITHMS Vesa Välimäki Lab. of Aoustis and Audio Signal

More information

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation

More information

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah

More information

A RAY TRACING SIMULATION OF SOUND DIFFRACTION BASED ON ANALYTIC SECONDARY SOURCE MODEL

A RAY TRACING SIMULATION OF SOUND DIFFRACTION BASED ON ANALYTIC SECONDARY SOURCE MODEL 19th European Signal Proessing Conferene (EUSIPCO 211) Barelona, Spain, August 29 - September 2, 211 A RAY TRACING SIMULATION OF SOUND DIFFRACTION BASED ON ANALYTIC SECONDARY SOURCE MODEL Masashi Okada,

More information

This fact makes it difficult to evaluate the cost function to be minimized

This fact makes it difficult to evaluate the cost function to be minimized RSOURC LLOCTION N SSINMNT In the resoure alloation step the amount of resoures required to exeute the different types of proesses is determined. We will refer to the time interval during whih a proess

More information

13.1 Numerical Evaluation of Integrals Over One Dimension

13.1 Numerical Evaluation of Integrals Over One Dimension 13.1 Numerial Evaluation of Integrals Over One Dimension A. Purpose This olletion of subprograms estimates the value of the integral b a f(x) dx where the integrand f(x) and the limits a and b are supplied

More information

CUTTING FORCES AND CONSECUTIVE DEFORMATIONS AT MILLING PARTS WITH THIN WALLS

CUTTING FORCES AND CONSECUTIVE DEFORMATIONS AT MILLING PARTS WITH THIN WALLS Proeedings of the International Conferene on Manufaturing Systems ICMaS Vol. 4, 2009, ISSN 1842-3183 University POLITEHNICA of Buharest, Mahine and Manufaturing Systems Department Buharest, Romania CUTTING

More information

Approximate logic synthesis for error tolerant applications

Approximate logic synthesis for error tolerant applications Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu

More information

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr

More information

Directed Rectangle-Visibility Graphs have. Abstract. Visibility representations of graphs map vertices to sets in Euclidean space and

Directed Rectangle-Visibility Graphs have. Abstract. Visibility representations of graphs map vertices to sets in Euclidean space and Direted Retangle-Visibility Graphs have Unbounded Dimension Kathleen Romanik DIMACS Center for Disrete Mathematis and Theoretial Computer Siene Rutgers, The State University of New Jersey P.O. Box 1179,

More information

An Event Display for ATLAS H8 Pixel Test Beam Data

An Event Display for ATLAS H8 Pixel Test Beam Data An Event Display for ATLAS H8 Pixel Test Beam Data George Gollin Centre de Physique des Partiules de Marseille and University of Illinois April 17, 1999 g-gollin@uiu.edu An event display program is now

More information

3D Ideal Flow For Non-Lifting Bodies

3D Ideal Flow For Non-Lifting Bodies 3D Ideal Flow For Non-Lifting Bodies 3D Doublet Panel Method 1. Cover body with 3D onstant strength doublet panels of unknown strength (N panels) 2. Plae a ontrol point at the enter of eah panel (N ontrol

More information

p[4] p[3] p[2] p[1] p[0]

p[4] p[3] p[2] p[1] p[0] CMSC 425 : Sring 208 Dave Mount and Roger Eastman Homework Due: Wed, Marh 28, :00m. Submit through ELMS as a df file. It an either be distilled from a tyeset doument or handwritten, sanned, and enhaned

More information

Chemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment

Chemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment hemial, Biologial and Radiologial Haard Assessment: A New Model of a Plume in a omplex Urban Environment Skvortsov, A.T., P.D. Dawson, M.D. Roberts and R.M. Gailis HPP Division, Defene Siene and Tehnology

More information

Supplementary Material: Geometric Calibration of Micro-Lens-Based Light-Field Cameras using Line Features

Supplementary Material: Geometric Calibration of Micro-Lens-Based Light-Field Cameras using Line Features Supplementary Material: Geometri Calibration of Miro-Lens-Based Light-Field Cameras using Line Features Yunsu Bok, Hae-Gon Jeon and In So Kweon KAIST, Korea As the supplementary material, we provide detailed

More information

FUZZY WATERSHED FOR IMAGE SEGMENTATION

FUZZY WATERSHED FOR IMAGE SEGMENTATION FUZZY WATERSHED FOR IMAGE SEGMENTATION Ramón Moreno, Manuel Graña Computational Intelligene Group, Universidad del País Vaso, Spain http://www.ehu.es/winto; {ramon.moreno,manuel.grana}@ehu.es Abstrat The

More information

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University

More information

Sequential Incremental-Value Auctions

Sequential Incremental-Value Auctions Sequential Inremental-Value Autions Xiaoming Zheng and Sven Koenig Department of Computer Siene University of Southern California Los Angeles, CA 90089-0781 {xiaominz,skoenig}@us.edu Abstrat We study the

More information

ICCGLU. A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff.

ICCGLU. A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff. http://www.netlib.org/linalg/ig-do 1 of 8 12/7/2009 11:14 AM ICCGLU A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff July, 1982

More information

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper

More information

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of

More information

Image Steganography Scheme using Chaos and Fractals with the Wavelet Transform

Image Steganography Scheme using Chaos and Fractals with the Wavelet Transform International Journal of Innovation, Management and Tehnology, Vol. 3, o. 3, June Image Steganography Sheme using Chaos and Fratals with the Wavelet Transform Yue Wu and Joseph P. oonan bstrat This paper

More information

The Alpha Torque and Quantum Physics

The Alpha Torque and Quantum Physics The Alpha Torque and Quantum Physis Zhiliang Cao, Henry Cao williamao15000@yahoo.om, henry.gu.ao@gmail.om July 18, 010 Abstrat In the enter of the unierse, there isn t a super massie blak hole or any speifi

More information

Boundary Correct Real-Time Soft Shadows

Boundary Correct Real-Time Soft Shadows Boundary Corret Real-Time Soft Shadows Bjarke Jakobsen Niels J. Christensen Bent D. Larsen Kim S. Petersen Informatis and Mathematial Modelling Tehnial University of Denmark {bj, nj, bdl}@imm.dtu.dk, kim@deadline.dk

More information

Numerical simulation of hemolysis: a comparison of Lagrangian and Eulerian modelling

Numerical simulation of hemolysis: a comparison of Lagrangian and Eulerian modelling Modelling in Mediine and Biology VI 361 Numerial simulation of hemolysis: a omparison of Lagrangian and Eulerian modelling S. Pirker 1, H. Shima 2 & M. Stoiber 2 1 Johannes Kepler University, 4040 Linz,

More information

Fast Elliptic Curve Algorithm of Embedded Mobile Equipment

Fast Elliptic Curve Algorithm of Embedded Mobile Equipment Send Orders for Reprints to reprints@benthamsiene.net 8 The Open Eletrial & Eletroni Engineering Journal, 0, 7, 8-4 Fast Ellipti Curve Algorithm of Embedded Mobile Equipment Open Aess Lihong Zhang *, Shuqian

More information

DECT Module Installation Manual

DECT Module Installation Manual DECT Module Installation Manual Rev. 2.0 This manual desribes the DECT module registration method to the HUB and fan airflow settings. In order for the HUB to ommuniate with a ompatible fan, the DECT module

More information

Torpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control

Torpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control orpedo rajetory Visual Simulation Based on Nonlinear Bakstepping Control Peng Hai-jun 1, Li Hui-zhou Chen Ye 1, 1. Depart. of Weaponry Eng, Naval Univ. of Engineering, Wuhan 400, China. Depart. of Aeronautial

More information

BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS

BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS Proeedings of ASME 0 International Mehanial Engineering Congress & Exposition IMECE0 November 5-, 0, San Diego, CA IMECE0-6657 BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS

More information

End mills are widely used in industry for high-speed machining. End milling cutters are C H A P T E R 2

End mills are widely used in industry for high-speed machining. End milling cutters are C H A P T E R 2 C H A P T E R End Mill End mills are widely used in industry for high-speed mahining. End milling utters are multi-point milling utters with utting edges both on the fae end as well as on the periphery,

More information

CONTROL SYSTEMS ANALYSIS & DESIGN SERVER. F. Morilla*, A. Fernández +, S. Dormido Canto*

CONTROL SYSTEMS ANALYSIS & DESIGN SERVER. F. Morilla*, A. Fernández +, S. Dormido Canto* CONTROL SYSTEMS ANALYSS & ESGN SERVER F. Morilla*, A. Fernández +, S. ormido Canto* * pto de nformátia y Automátia, UNE, Avda. Senda del Rey 9, 28040 Madrid, Spain. Phone:34-91-3987156, Fax:34-91-3986697,

More information

PARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING. Yesheng Gao, Kaizhi Wang, Xingzhao Liu

PARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING. Yesheng Gao, Kaizhi Wang, Xingzhao Liu 20th European Signal Proessing Conferene EUSIPCO 2012) Buharest, Romania, August 27-31, 2012 PARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING Yesheng Gao, Kaizhi Wang,

More information

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using

More information

Fuzzy Pre-semi-closed Sets

Fuzzy Pre-semi-closed Sets BULLETIN of the Malaysian Mathematial Sienes Soiety http://mathusmmy/bulletin Bull Malays Math Si So () 1() (008), Fuzzy Pre-semi-losed Sets 1 S Murugesan and P Thangavelu 1 Department of Mathematis, Sri

More information

An Approach to Physics Based Surrogate Model Development for Application with IDPSA

An Approach to Physics Based Surrogate Model Development for Application with IDPSA An Approah to Physis Based Surrogate Model Development for Appliation with IDPSA Ignas Mikus a*, Kaspar Kööp a, Marti Jeltsov a, Yuri Vorobyev b, Walter Villanueva a, and Pavel Kudinov a a Royal Institute

More information

Real-time Container Transport Planning with Decision Trees based on Offline Obtained Optimal Solutions

Real-time Container Transport Planning with Decision Trees based on Offline Obtained Optimal Solutions Real-time Container Transport Planning with Deision Trees based on Offline Obtained Optimal Solutions Bart van Riessen vanriessen@ese.eur.nl Eonometri Institute Erasmus Shool of Eonomis Erasmus University

More information

FOREGROUND OBJECT EXTRACTION USING FUZZY C MEANS WITH BIT-PLANE SLICING AND OPTICAL FLOW

FOREGROUND OBJECT EXTRACTION USING FUZZY C MEANS WITH BIT-PLANE SLICING AND OPTICAL FLOW FOREGROUND OBJECT EXTRACTION USING FUZZY C EANS WITH BIT-PLANE SLICING AND OPTICAL FLOW SIVAGAI., REVATHI.T, JEGANATHAN.L 3 APSG, SCSE, VIT University, Chennai, India JRF, DST, Dehi, India. 3 Professor,

More information

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,

More information

INTEGRATING PHOTOGRAMMETRY AND INERTIAL SENSORS FOR ROBOTICS NAVIGATION AND MAPPING

INTEGRATING PHOTOGRAMMETRY AND INERTIAL SENSORS FOR ROBOTICS NAVIGATION AND MAPPING INTEGRATING PHOTOGRAMMETRY AND INERTIAL SENSORS FOR ROBOTICS NAVIGATION AND MAPPING Fadi Bayoud, Jan Skaloud, Bertrand Merminod Eole Polytehnique Fédérale de Lausanne (EPFL) Geodeti Engineering Laoratory

More information

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive

More information

Finding the Equation of a Straight Line

Finding the Equation of a Straight Line Finding the Equation of a Straight Line You should have, before now, ome aross the equation of a straight line, perhaps at shool. Engineers use this equation to help determine how one quantity is related

More information

A {k, n}-secret Sharing Scheme for Color Images

A {k, n}-secret Sharing Scheme for Color Images A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University

More information

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens

More information

A Numerical optimization technique for the design of airfoils in viscous flows

A Numerical optimization technique for the design of airfoils in viscous flows Rohester Institute of Tehnology RIT Sholar Works Theses Thesis/Dissertation Colletions 7-1-1995 A Numerial optimization tehnique for the design of airfoils in visous flows Robert MaNeill Follow this and

More information

Reading Object Code. A Visible/Z Lesson

Reading Object Code. A Visible/Z Lesson Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly

More information

Reading Object Code. A Visible/Z Lesson

Reading Object Code. A Visible/Z Lesson Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly

More information

HIGHER ORDER full-wave three-dimensional (3-D) large-domain techniques in

HIGHER ORDER full-wave three-dimensional (3-D) large-domain techniques in FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 21, no. 2, August 2008, 209-220 Comparison of Higher Order FEM and MoM/SIE Approahes in Analyses of Closed- and Open-Region Eletromagneti Problems Milan

More information

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department

More information

Plumber: a method for a multi-scale decomposition of 3D shapes into tubular primitives and bodies

Plumber: a method for a multi-scale decomposition of 3D shapes into tubular primitives and bodies ACM Symposium on Solid Modeling and Appliations (2004) P. Brunet, N. Patrikalakis (Editors) Plumber: a method for a multi-sale deomposition of 3D shapes into tubular primitives and bodies M. Mortara G.

More information

Wolf Jung, Gesamtschule Aachen-Brand, Aachen, Germany.

Wolf Jung, Gesamtschule Aachen-Brand, Aachen, Germany. Self-similarity of the Mandelbrot set Wolf Jung, Gesamtschule Aachen-Brand, Aachen, Germany. 1. Introduction 2. Asymptotic similarity 3. Homeomorphisms 4. Quasi-conformal surgery The images are made with

More information

A New RBFNDDA-KNN Network and Its Application to Medical Pattern Classification

A New RBFNDDA-KNN Network and Its Application to Medical Pattern Classification A New RBFNDDA-KNN Network and Its Appliation to Medial Pattern Classifiation Shing Chiang Tan 1*, Chee Peng Lim 2, Robert F. Harrison 3, R. Lee Kennedy 4 1 Faulty of Information Siene and Tehnology, Multimedia

More information

An Alternative Approach to the Fuzzifier in Fuzzy Clustering to Obtain Better Clustering Results

An Alternative Approach to the Fuzzifier in Fuzzy Clustering to Obtain Better Clustering Results An Alternative Approah to the Fuzziier in Fuzzy Clustering to Obtain Better Clustering Results Frank Klawonn Department o Computer Siene University o Applied Sienes BS/WF Salzdahlumer Str. 46/48 D-38302

More information