TESSELLATIONS. This is a sample (draft) chapter from: MATHEMATICAL OUTPOURINGS. Newsletters and Musings from the St. Mark s Institute of Mathematics

Size: px
Start display at page:

Download "TESSELLATIONS. This is a sample (draft) chapter from: MATHEMATICAL OUTPOURINGS. Newsletters and Musings from the St. Mark s Institute of Mathematics"

Transcription

1 TESSELLATIONS This is a sample (daft) chapte fom: MATHEMATICAL OUTPOURINGS Newslettes and Musings fom the St. Mak s Institute of Mathematics James Tanton This mateial was and can still be used as the basis of a successful MATH CIRCLE activity.

2 TESSELLATIONS: Newslette Septembe 010 SEPTEMBER 010 THIS MONTH S PUZZLER: TESSELLATIONS AND TILINGS A polygon is said to tessellate the plane if it is possible to cove the entie plane with conguent copies of the figue without ovelap (except along the edges of the figues). The tessellation is called a tiling if each edge of one polygon matches an entie edge of an adjacent polygon. 1. The tiling with tiangles shown is peiodic, meaning that it possesses tanslational symmeties in (at least) two non-paallel diections. That is, it is possible to shift the entie tiling along some diection of tanslation and etun to pecisely the same coveing of the plane, and again along some second, non-paallel diection. Is it possible to use a tiangula tile to ceate a non-peiodic tiling of the plane? [Comment: The definition of peiodic equies a tiling to possess at least two independent tanslational symmeties. Is it possible fo a tiling to possess tanslational symmety in just one diection? If so, constuct an example of such a tiling.]. Squaes, ectangles, and paallelogams all cetainly tile the plane. Does evey quadilateal tile the plane? (Even concave quadilateals?) Paallelogams tile the plane. As two copies of the same tiangle can be placed side-byside to fom a paallelogam we see that: Evey tiangle tiles the plane. 3. Is thee a five-sided polygon that tessellates the plane? How about one that tiles the plane? Think about these puzzles befoe eading on. DOES IT TILE? Regula hexagons tile the plane:

3 In fact, any hexagon with opposite sides paallel will tile the plane: TESSELLATIONS: Newslette Septembe 010 In summay, we have: Evey tiangle tiles the plane. Evey quadilateal tiles the plane. Thee exist pentagons that tile the plane. Thee exist hexagons that tile the plane. QUESTION: Why doesn t a egula pentagon tile the plane? (Which egula polygons do?) Daw an example of a hexagon that does not tile the plane. Notice that two copies of any quadilateal (convex o concave) placed side-by-side poduces a hexagon with paallel opposite sides. Fo each n 7 it is easy to ceate a concave n -gon that tiles the plane. This shows that all quadilateals do in fact tile the plane: Thee is a pentagon that tessellates the plane: Do thee exist convex n -gons, with n 7, that tile the plane? Mathematicians know the answe. It s to the negative. Theoem: No convex n -gon with n 7 tiles the plane. Even wose, no convex n - gon with n 7 tessellates the plane. A NON-PERIODIC TILING: An isosceles tiangle of the appopiate dimensions can be used to make a non-peiodic tiling of the plane. The otational symmety does not tanslate. Thee is even one that tiles the plane! Excise an equilateal tiangle fom a squae to poduce a five-sided shape. It tiles! Split the design to make a spial! RESEARCH CORNER: It emains an unsolved poblem to this day as to which pentagons tessellate the plane. Cuently only 14 diffeent types of pentagons ae known to wok. Cae to finish solving this classification poblem? [High-schooles in New South Wales, Austalia, have contibuted to this poject!] 010 James Tanton St. Mak s Institute of Mathematics. mathinstitute@stmaksscnhool.og

4 TESSELLATIONS: Commentay TESSELLATIONS Septembe 010 COMMENTARY, SOLUTIONS and THOUGHTS In the newslette we pesented a esult due to Ivan Niven: Theoem: No convex n -gon with n 7 tessellates the plane. Hee is an oveview of the poof. The full details can be found in [NIVEN1] (and also [NIVEN] fo the case of a tiling). Poof: Suppose we have a tessellation of the plane with a convex n -gon, n 7. Suppose the plane is equipped with a set of coodinate axes scaled so that the peimete of each tile is one unit in length. (Each tile consequently has width no moe than half a unit.) Let A be the aea of each tile. Fo each eal numbe let S be the set of tiles in the tessellation that each cove some point in the disc of adius centeed about the oigin, and let S denote the numbe of tiles in this sub-tessellation. As no tile has width geate than 1, the tiles of S cove the disc of adius but do not extend beyond a disc of adius + 1. Consequently we have: π S A ( ) < π + 1 Let v be the numbe of vetices that appea in the sub-tessellation given by S. Of the π adians of tuning that suounds each vetex, some potion of this coesponds to the measue of inteio angles of tiles. (In a tiling, all inteio vetices of the sub-tiling ae fully suounded by inteio angles of tiles, and bounday vetices only patially so. Fo a tessellation, some inteio vetices lie on the side of anothe tile and ae not fully suounded by tile inteio angles.) The quantity π v is an ove-estimate of the sum of the inteio angles of the tiles of S. As the sum of inteio angles of one tile is ( n ) π we have: ( ) π v n π S On the othe hand, since each tile is convex, at least thee tiles suound each vetex in the full tessellation. As all the vetices that appea in S ae inteio vetices of the subtessellation S + 1, and as each tile of S + 1 has n vetices we have: n S 3v James Tanton

5 TESSELLATIONS: Commentay 5 Now we just play with these thee sets of inequalities to find a contadiction. The latte two inequalities give: n n S+ 1 S 3 Multiplying by A and invoking the fist inequality gives: n n n n π ( ) + > S A S A π Consequently: n 3n 6 + A quick execise in algeba shows that fo n 7 we have 14 < + 15 n 14, and so: 3n 6 15 fo all values of. This is a contadiction as the left hand side appoaches the value 1 as inceases.

6 NON-PERIODIC TESSELLATIONS AND TILINGS TESSELLATIONS: Commentay 6 Tile the plane with squaes and divide each tile along its diagonal to obtain a tiling with isosceles ight tiangles. If we do this in a haphazad manne we can ensue that no tanslational symmety holds and theeby poduce a non-peiodic tiling of the plane. COMMENT: In some eal sense this set of diections is unsatisfactoy: How can we, as humans, specify the diection of each diagonal fo an infinite aay of cells and also be sue that no tanslational symmety holds? The bette thing to do would be to specify some cleve algoithm fo assigning choices, pehaps based on the distibution of pime numbes, fo instance one that we can pove is sue to disupt peiodicity. Cae to ty? We can cetainly use this appoach to poduce a tiling of the plane with isosceles ight tiangles possessing only one diection of tanslational symmety: declae one column of squaes to be column 1 and assign one type of squae diagonal just to the pimenumbeed columns to its ight. CHALLENGE: Pove that if p is pime, thee is no numbe k such that p, p+ k, p+ k, p+ 3k, ae all pime.

7 TESSELLATIONS: Commentay 7 A tile is said to self-eplicate if a finite numbe of conguent copies of itself fit togethe to make a lage scaled copy of the tile. Self-eplicating tiles povide an inteesting souce of tessellations fo the plane. Fo example, fou copies of a squae stack togethe to make a lage squae. Repeating this pocess ad infinitum poduces the egula squae tiling of the plane: All tiangles self-eplicate, as does the L-shape and an isosceles tapezoid (each in moe than one way!) CHALLENGE: Find a figue with the popety that just two copies of itself fit togethe to poduce a scaled vesion of that figue. CHALLENGE: The L-shape shown above is subdivided, if you like, into fou and into 5 copies of itself. Show that one can also subdivide the L-shape into 9 and into 16 copies of itself. Can it be subdivided into a non-squae numbe of copies?

8 TESSELLATIONS: Commentay 8 I am pesonally enamoed with the 1 5 ight tiangle: five copies of this figue stack togethe to fom anothe 1 5 ight tiangle. And if we iteate this self-eplication an infinite numbe of times we obtain a tessellation of the entie plane. (It is called the pinwheel tessellation. See [RADIN].) And the esulting tessellation is non-peiodic! COMMENT: Students at St. Mak s School have coveed a coido wall with six iteations of this self-eplication stating with 1-inch wide constuction-pape tiangles. The esultant, and enomous, poduct is beautifully mesmeizing! This tiling was also used to decoate the Fedeation Squae Buildings in Melboune, Austalia. (See, fo example, [WEISSTEIN].) The non-peiodicity of the tessellation follows swiftly fom the following lemma. (Unfotunately, poving the lemma takes some wok! We ll leave this to the end of ou discussion.) Lemma: The smallest angle in a 1 5 ight tiangle, namel,y iational multiple of π. 1 x= actan, is an

9 TESSELLATIONS: Commentay 9 Notice that the hypotenuse of the initial ight tiangle makes an angle x with the hoizontal. We depict this as follows: The fist iteation of self eplication poduces a line segment of angle x with the hoizontal (its hypotenuse) and a cental line segment of angle x to the hoizontal (the hypotenuse of the cental copy of the oiginal): And the second iteation poduces line segments of angles x, x and 3x to the hoizontal: And so on. As x is an iational multiple of π, the infinite list of multiples of x contains no epeat angles (even modulo π ). Thus the final infinite tessellation of the plane contains line segments at infinitely many diffeent angles to the hoizontal. If the tessellation is peiodic, thee must be two diections of tanslation symmety. That is, thee is a distance a in one diection one can tanslate the tessellation to poduce an identical copy of itself, and a distance b in a second diection one can do the same. Thus thee is a paallelogam defined by these two isometies which offes the template fo the epeating design of the tessellation. But being a bounded egion, this template can only contain a finite numbe of line segment angles, focing the same fo the entie tessellation. As we have seen, this is not the case. Thus the tessellation cannot be peiodic.

10 TESSELLATIONS: Commentay 10 HARD CHALLENGE: Is the tessellation esulting fom the self-eplication of the L- shape peiodic? 1 PROOF OF LEMMA: We need to establish that actan is an iational multiple of π. The poof hee is based on the wok of J.M.H. Olmsted ([OLMSTED]). We begin by collating some facts about the tangent function. Recall that the angle addition fomula states: tan + = tan a+ tan b 1 tan a tan b ( a b) fom which it follows that if tan x t tan x= 1 t 3 t 3t tan 3x= tan 4x 3t 1 3 = 4t 4t 4 t + t 6 1 = t, then and so on. An induction agument establishes that tan nx= ( ) ( ) p t q t with p( t ) and q( t ) polynomials in t beginning with highest ode tems of the fom: 1 ( ) = nt n n + and q( t) t n 1 ( ) = t + and q( t) nt n p t p t = + if n is even = + if n is odd This shows:

11 OBSERVATION 1: If tan x TESSELLATIONS: Commentay 11 = t is ational, then tan nx is also ational (if it is finite). p OBSERVATION : If tan x= fo integes p and q, and tan nx= 0, then p q q is a ational oot of a polynomial with leading coefficient n o 1. We thus have q n. We ae inteested in the case whee tan x equals 1. By obsevation 1, each value of tan nx is also ational (when it is finite). Wite: tan x= p q n n as a faction in educed fom (when the quantity is finite). OBSERVATION 3: The denominatos qn can be abitaily lage. p To see this, suppose that tanα = is a faction witten in educed fom with one of p o q pq q even, and set so that q is positive. Then it is not difficult to see that tan α = q p is also in educed fom. Moeove, if q> p, then ( )( ) q p q p q p q p q = + > + >, and if p > q, then p q p q q > + >. pq Eithe way, when is witten as a faction with positive denominato that q p denominato is lage than q. 1 Now we have tan x=, which is a faction in educed fom with even denominato. It follows that the denominatos of tan x, tan 4x, tan 8x, thus gow without bound. We ae now set to complete the poof.

12 TESSELLATIONS: Commentay 1 1 a Suppose tan x= with x= π fo some integes a and b. Let α = nx. Then b pn tanα = tan nx= and tan( bα) = tan( na π) = 0. By Obsevation, this means that q qn n b fo all n. Thus each value q n is bounded by b. This contadicts Obsevation 3. REFERENCES: [NIVEN 1] Niven, I., Convex polygons that cannot tile the plane, Ameican Mathematical Monthly, 54 (1978), [NIVEN ] Niven, I., Maxima and Minima without Calculus, Mathematical Association of Ameica, Washington D.C., [OLMSTED] Olmsted, J.M.H., Rational values of tigonometic functions, Ameican Mathematical Monthly, 5 (1945), [RADIN] Radin, C., The pinwheel tilings of the plane, Annals of Mathematics, 139 (1994), [WEISSTEIN] Weisstein, E. W., Apeiodic tiling fom MathWold-A Wolfam Web Resouce. URL:

Also available at ISSN (printed edn.), ISSN (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010)

Also available at  ISSN (printed edn.), ISSN (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010) Also available at http://amc.imfm.si ISSN 1855-3966 (pinted edn.), ISSN 1855-3974 (electonic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010) 109 120 Fulleene patches I Jack E. Gave Syacuse Univesity, Depatment

More information

Lecture 27: Voronoi Diagrams

Lecture 27: Voronoi Diagrams We say that two points u, v Y ae in the same connected component of Y if thee is a path in R N fom u to v such that all the points along the path ae in the set Y. (Thee ae two connected components in the

More information

ART GALLERIES WITH INTERIOR WALLS. March 1998

ART GALLERIES WITH INTERIOR WALLS. March 1998 ART GALLERIES WITH INTERIOR WALLS Andé Kündgen Mach 1998 Abstact. Conside an at galley fomed by a polygon on n vetices with m pais of vetices joined by inteio diagonals, the inteio walls. Each inteio wall

More information

(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number.

(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number. Illustative G-C Simila cicles Alignments to Content Standads: G-C.A. Task (a, b) x y Fo this poblem, is a point in the - coodinate plane and is a positive numbe. a. Using a tanslation and a dilation, show

More information

4.2. Co-terminal and Related Angles. Investigate

4.2. Co-terminal and Related Angles. Investigate .2 Co-teminal and Related Angles Tigonometic atios can be used to model quantities such as

More information

Properties of Tilings by Convex Pentagons

Properties of Tilings by Convex Pentagons eview Foma, 1, 113 18, 006 Popeties of Tilings by Convex Pentagons Teuhisa SUGIMOTO 1 * and Tohu OGAWA,3 1 The Institute of Statistical Mathematics, 4-6-7 Minami-Azabu, Minato-ku, Tokyo 106-8569, Japan

More information

Title. Author(s)NOMURA, K.; MOROOKA, S. Issue Date Doc URL. Type. Note. File Information

Title. Author(s)NOMURA, K.; MOROOKA, S. Issue Date Doc URL. Type. Note. File Information Title CALCULATION FORMULA FOR A MAXIMUM BENDING MOMENT AND THE TRIANGULAR SLAB WITH CONSIDERING EFFECT OF SUPPO UNIFORM LOAD Autho(s)NOMURA, K.; MOROOKA, S. Issue Date 2013-09-11 Doc URL http://hdl.handle.net/2115/54220

More information

Efficient Maximal Poisson-Disk Sampling

Efficient Maximal Poisson-Disk Sampling Efficient Maximal Poisson-Disk Sampling Mohamed S. Ebeida Sandia National Laboatoies Andew A. Davidson Univesity of Califonia, Davis Anjul Patney Univesity of Califonia, Davis Patick M. Knupp Sandia National

More information

Shortest Paths for a Two-Robot Rendez-Vous

Shortest Paths for a Two-Robot Rendez-Vous Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal

More information

= dv 3V (r + a 1) 3 r 3 f(r) = 1. = ( (r + r 2

= dv 3V (r + a 1) 3 r 3 f(r) = 1. = ( (r + r 2 Random Waypoint Model in n-dimensional Space Esa Hyytiä and Joma Vitamo Netwoking Laboatoy, Helsinki Univesity of Technology, Finland Abstact The andom waypoint model (RWP) is one of the most widely used

More information

A Memory Efficient Array Architecture for Real-Time Motion Estimation

A Memory Efficient Array Architecture for Real-Time Motion Estimation A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN

More information

FACE VECTORS OF FLAG COMPLEXES

FACE VECTORS OF FLAG COMPLEXES FACE VECTORS OF FLAG COMPLEXES ANDY FROHMADER Abstact. A conjectue of Kalai and Eckhoff that the face vecto of an abitay flag complex is also the face vecto of some paticula balanced complex is veified.

More information

9.5 Volume of Pyramids

9.5 Volume of Pyramids 9.5 Volume of Pyamids and Cones Goal Find the volumes of pyamids and cones. Key Wods pyamid p. 49 cone p. 49 volume p. 500 In the puzzle below, you can see that the squae pism can be made using thee conguent

More information

O x 40 O. O x. Determine whether a tangent line is shown in each diagram. Explain

O x 40 O. O x. Determine whether a tangent line is shown in each diagram. Explain -1 Pactice Fom G Tangent Lines lgeba ssume that lines that appea to be tangent ae tangent. is the cente of each cicle. What is the value of? 1. 140 2. 3 3. 20 40 70 51 The cicle at the ight epesents Eath.

More information

Tiling groups for Wang tiles

Tiling groups for Wang tiles Tiling goups fo Wang tiles Cistophe Mooe Ivan apapot Eic émila Abstact We apply tiling goups and height functions to tilings of egions in the plane by Wang tiles, which ae squaes with coloed boundaies

More information

zeo, i.e., each watchman emains stationay, and we have the at galley poblem. At the othe limit, if m = 1, we have the watchman oute poblem. Anothe con

zeo, i.e., each watchman emains stationay, and we have the at galley poblem. At the othe limit, if m = 1, we have the watchman oute poblem. Anothe con Optimum Guad Coves and m-watchmen Routes fo Resticted Polygons Svante Calsson y Bengt J. Nilsson yz Simeon Ntafos x Abstact A watchman, in the teminology of at galleies, is a mobile guad. We conside seveal

More information

2. PROPELLER GEOMETRY

2. PROPELLER GEOMETRY a) Fames of Refeence 2. PROPELLER GEOMETRY 10 th Intenational Towing Tank Committee (ITTC) initiated the pepaation of a dictionay and nomenclatue of ship hydodynamic tems and this wok was completed in

More information

On a piece of graph paper, draw a circle that has a radius of 5 and center at ( 0, 0 ).

On a piece of graph paper, draw a circle that has a radius of 5 and center at ( 0, 0 ). 10.1 Stat Thinking On a piece of gaph pape, daw a cicle that has a adius of 5 and cente at ( 0, 0 ). 1. aw the segment that connects the points ( 3, 4 ) and ( 4, 3) on the cicle. Is this segment a diamete?

More information

Prof. Feng Liu. Fall /17/2016

Prof. Feng Liu. Fall /17/2016 Pof. Feng Liu Fall 26 http://www.cs.pdx.edu/~fliu/couses/cs447/ /7/26 Last time Compositing NPR 3D Gaphics Toolkits Tansfomations 2 Today 3D Tansfomations The Viewing Pipeline Mid-tem: in class, Nov. 2

More information

A New and Efficient 2D Collision Detection Method Based on Contact Theory Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai MIAO, Jian XUE

A New and Efficient 2D Collision Detection Method Based on Contact Theory Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai MIAO, Jian XUE 5th Intenational Confeence on Advanced Mateials and Compute Science (ICAMCS 2016) A New and Efficient 2D Collision Detection Method Based on Contact Theoy Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai

More information

Toward Computing an Optimal Trajectory for an Environment-Oriented Unmanned Aerial Vehicle (UAV) under Uncertainty

Toward Computing an Optimal Trajectory for an Environment-Oriented Unmanned Aerial Vehicle (UAV) under Uncertainty Jounal of Uncetain Systems Vol9, No2, pp84-94, 2015 Online at: wwwjusoguk Towad Computing an Optimal Tajectoy fo an Envionment-Oiented Unmanned Aeial Vehicle (UAV) unde Uncetainty Jeald Bady, Octavio Lema,

More information

n If S is in convex position, then thee ae exactly k convex k-gons detemined by subsets of S. In geneal, howeve, S may detemine fa fewe convex k-gons.

n If S is in convex position, then thee ae exactly k convex k-gons detemined by subsets of S. In geneal, howeve, S may detemine fa fewe convex k-gons. Counting Convex Polygons in Plana Point Sets Joseph S. B. Mitchell a;1, Günte Rote b, Gopalakishnan Sundaam c, and Gehad Woeginge b a Applied Mathematics and Statistics, SUNY Stony Book, NY 11794-3600.

More information

An Optimised Density Based Clustering Algorithm

An Optimised Density Based Clustering Algorithm Intenational Jounal of Compute Applications (0975 8887) Volume 6 No.9, Septembe 010 An Optimised Density Based Clusteing Algoithm J. Hencil Pete Depatment of Compute Science St. Xavie s College, Palayamkottai,

More information

sf3 RESTRICTED QUADTREE (VON HERZEN/BARR)

sf3 RESTRICTED QUADTREE (VON HERZEN/BARR) SURFACE DATA HIERARCHICAL TRIANGULAR DECOMPOSITION Appoximate suface S y plana tiangula patches whose vetices ae a suset of data points defining S Fo each patch, compute an appoximation eo. maximum eo

More information

Gravitational Shift for Beginners

Gravitational Shift for Beginners Gavitational Shift fo Beginnes This pape, which I wote in 26, fomulates the equations fo gavitational shifts fom the elativistic famewok of special elativity. Fist I deive the fomulas fo the gavitational

More information

9.3 Volume of Spheres

9.3 Volume of Spheres ? LESSON 9. Volume of Sphees ESSENTIAL QUESTION How do you find the volume of a sphee? Expessions, equations, and elationships Solve poblems involving the volume of sphees. EXPLORE ACTIVITY Modeling the

More information

All lengths in meters. E = = 7800 kg/m 3

All lengths in meters. E = = 7800 kg/m 3 Poblem desciption In this poblem, we apply the component mode synthesis (CMS) technique to a simple beam model. 2 0.02 0.02 All lengths in metes. E = 2.07 10 11 N/m 2 = 7800 kg/m 3 The beam is a fee-fee

More information

What is a Radian? The side that remains fixed is called the initial side

What is a Radian? The side that remains fixed is called the initial side What is a Radian? Befoe we begin ou investigation of a adian let us fist establish a definition of an angle and eview some impotant concepts fom geomety. Definition of an Angle: A union of two ays with

More information

Module 6 STILL IMAGE COMPRESSION STANDARDS

Module 6 STILL IMAGE COMPRESSION STANDARDS Module 6 STILL IMAE COMPRESSION STANDARDS Lesson 17 JPE-2000 Achitectue and Featues Instuctional Objectives At the end of this lesson, the students should be able to: 1. State the shotcomings of JPE standad.

More information

RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES

RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class

More information

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012 2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo

More information

Parametric Query Optimization for Linear and Piecewise Linear Cost Functions

Parametric Query Optimization for Linear and Piecewise Linear Cost Functions Paametic Quey Oimization fo Linea and Piecewise Linea Cost Functions Avind Hulgei S. Sudashan Indian Institute of Technology, Bombay {au, sudasha}@cse.iitb.ac.in Abstact The of a quey an depends on many

More information

Elliptic Generation Systems

Elliptic Generation Systems 4 Elliptic Geneation Systems Stefan P. Spekeijse 4.1 Intoduction 4.1 Intoduction 4.2 Two-Dimensional Gid Geneation Hamonic Maps, Gid Contol Maps, and Poisson Systems Discetization and Solution Method Constuction

More information

National 5 Revision Booklet Expressions and Formula

National 5 Revision Booklet Expressions and Formula National 5 Revision Booklet Epessions and Fomula This evision coves the following topics.. Suds. Indices. Significant Figues. Suds This is a non calculato eecise.. Simplify: a. b. c. d. e. f. g. h. i..

More information

On the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes

On the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes On the Convesion between Binay Code and BinayReflected Gay Code on Boolean Cubes The Havad community has made this aticle openly available. Please shae how this access benefits you. You stoy mattes Citation

More information

17/5/2009. Introduction

17/5/2009. Introduction 7/5/9 Steeo Imaging Intoduction Eample of Human Vision Peception of Depth fom Left and ight eye images Diffeence in elative position of object in left and ight eyes. Depth infomation in the views?? 7/5/9

More information

Comparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters

Comparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters Compaisons of Tansient Analytical Methods fo Detemining Hydaulic Conductivity Using Disc Pemeametes 1,,3 Cook, F.J. 1 CSRO Land and Wate, ndoooopilly, Queensland The Univesity of Queensland, St Lucia,

More information

Tufts University Math 13 Department of Mathematics November 14, :00 noon to 1:20 pm

Tufts University Math 13 Department of Mathematics November 14, :00 noon to 1:20 pm Tufts Univesit Math 3 Depatment of Mathematics Novembe, Eam : noon to : pm Instuctions: No calculatos, notes o books ae allowed. Unless othewise stated, ou must show all wok to eceive full cedit. Simplif

More information

NODAL AND LOOP ANALYSIS TECHNIQUES

NODAL AND LOOP ANALYSIS TECHNIQUES NODAL AND LOOP ANALYSIS TECHNIQUES LEANING GOALS NODAL ANALYSIS LOOP ANALYSIS Deelop systematic techniques to determine all the oltages and currents in a circuit NODE ANALYSIS One of the systematic ways

More information

Separability and Topology Control of Quasi Unit Disk Graphs

Separability and Topology Control of Quasi Unit Disk Graphs Sepaability and Topology Contol of Quasi Unit Disk Gaphs Jiane Chen, Anxiao(Andew) Jiang, Iyad A. Kanj, Ge Xia, and Fenghui Zhang Dept. of Compute Science, Texas A&M Univ. College Station, TX 7784. {chen,

More information

Efficient protection of many-to-one. communications

Efficient protection of many-to-one. communications Efficient potection of many-to-one communications Miklós Molná, Alexande Guitton, Benad Cousin, and Raymond Maie Iisa, Campus de Beaulieu, 35 042 Rennes Cedex, Fance Abstact. The dependability of a netwok

More information

ANNOUNCEMENT. LECTURE 25 Spherical Refracting Surfaces

ANNOUNCEMENT. LECTURE 25 Spherical Refracting Surfaces ANNUNCEMENT Final: Thusday Dec 3, 208, 7 PM - 9 PM Location: Elliot Hall of Music Coves all eadings, lectues, homewok fom Chaptes 28 though 33 Multiple choice Pactice exams n the couse website and on CHIP

More information

Goal. Rendering Complex Scenes on Mobile Terminals or on the web. Rendering on Mobile Terminals. Rendering on Mobile Terminals. Walking through images

Goal. Rendering Complex Scenes on Mobile Terminals or on the web. Rendering on Mobile Terminals. Rendering on Mobile Terminals. Walking through images Goal Walking though s -------------------------------------------- Kadi Bouatouch IRISA Univesité de Rennes I, Fance Rendeing Comple Scenes on Mobile Teminals o on the web Rendeing on Mobile Teminals Rendeing

More information

Topic -3 Image Enhancement

Topic -3 Image Enhancement Topic -3 Image Enhancement (Pat 1) DIP: Details Digital Image Pocessing Digital Image Chaacteistics Spatial Spectal Gay-level Histogam DFT DCT Pe-Pocessing Enhancement Restoation Point Pocessing Masking

More information

Illumination methods for optical wear detection

Illumination methods for optical wear detection Illumination methods fo optical wea detection 1 J. Zhang, 2 P.P.L.Regtien 1 VIMEC Applied Vision Technology, Coy 43, 5653 LC Eindhoven, The Nethelands Email: jianbo.zhang@gmail.com 2 Faculty Electical

More information

Embeddings into Crossed Cubes

Embeddings into Crossed Cubes Embeddings into Cossed Cubes Emad Abuelub *, Membe, IAENG Abstact- The hypecube paallel achitectue is one of the most popula inteconnection netwoks due to many of its attactive popeties and its suitability

More information

CS 450: COMPUTER GRAPHICS RASTERIZING CONICS SPRING 2016 DR. MICHAEL J. REALE

CS 450: COMPUTER GRAPHICS RASTERIZING CONICS SPRING 2016 DR. MICHAEL J. REALE CS 45: COMPUTER GRAPHICS RASTERIZING CONICS SPRING 6 DR. MICHAEL J. REALE RASTERIZING CURVES OTHER THAN LINES When dealing with othe inds of cuves, we can daw it in one of the following was: Use elicit

More information

a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives

a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives SPARK: Soot Reseach Kit Ondřej Lhoták Objectives Spak is a modula toolkit fo flow-insensitive may points-to analyses fo Java, which enables expeimentation with: vaious paametes of pointe analyses which

More information

Illumination with Orthogonal Floodlights? (Extended Abstract) College Station, Texas MS 3112, US.

Illumination with Orthogonal Floodlights? (Extended Abstract) College Station, Texas MS 3112, US. Illumination with Othogonal Floodlights (Extended Abstact) James Abello 1, Vladimi Estivill-Casto 2, Thomas Sheme 3, Joge Uutia 1 Depatment of Compute Science, Texas A & M Univesity, College Station, Texas

More information

Finding point-pairs. Find Closest Point from Dense Cloud

Finding point-pairs. Find Closest Point from Dense Cloud Finding point-pais Given an a, find a coesponding b on the suface. Then one appoach would be to seach evey possible tiangle o suface point and then take the closest point. The key is to find a moe efficient

More information

Communication vs Distributed Computation: an alternative trade-off curve

Communication vs Distributed Computation: an alternative trade-off curve Communication vs Distibuted Computation: an altenative tade-off cuve Yahya H. Ezzeldin, Mohammed amoose, Chistina Fagouli Univesity of Califonia, Los Angeles, CA 90095, USA, Email: {yahya.ezzeldin, mkamoose,

More information

Lecture # 04. Image Enhancement in Spatial Domain

Lecture # 04. Image Enhancement in Spatial Domain Digital Image Pocessing CP-7008 Lectue # 04 Image Enhancement in Spatial Domain Fall 2011 2 domains Spatial Domain : (image plane) Techniques ae based on diect manipulation of pixels in an image Fequency

More information

Image Enhancement in the Spatial Domain. Spatial Domain

Image Enhancement in the Spatial Domain. Spatial Domain 8-- Spatial Domain Image Enhancement in the Spatial Domain What is spatial domain The space whee all pixels fom an image In spatial domain we can epesent an image by f( whee x and y ae coodinates along

More information

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson DEADLOCK AVOIDANCE IN BATCH PROCESSES M. Tittus K. Åkesson Univesity College Boås, Sweden, e-mail: Michael.Tittus@hb.se Chalmes Univesity of Technology, Gothenbug, Sweden, e-mail: ka@s2.chalmes.se Abstact:

More information

Detection and Recognition of Alert Traffic Signs

Detection and Recognition of Alert Traffic Signs Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives

More information

Conservation Law of Centrifugal Force and Mechanism of Energy Transfer Caused in Turbomachinery

Conservation Law of Centrifugal Force and Mechanism of Energy Transfer Caused in Turbomachinery Poceedings of the 4th WSEAS Intenational Confeence on luid Mechanics and Aeodynamics, Elounda, Geece, August 1-3, 006 (pp337-34) Consevation Law of Centifugal oce and Mechanism of Enegy Tansfe Caused in

More information

Towards Adaptive Information Merging Using Selected XML Fragments

Towards Adaptive Information Merging Using Selected XML Fragments Towads Adaptive Infomation Meging Using Selected XML Fagments Ho-Lam Lau and Wilfed Ng Depatment of Compute Science and Engineeing, The Hong Kong Univesity of Science and Technology, Hong Kong {lauhl,

More information

10/29/2010. Rendering techniques. Global Illumination. Local Illumination methods. Today : Global Illumination Modules and Methods

10/29/2010. Rendering techniques. Global Illumination. Local Illumination methods. Today : Global Illumination Modules and Methods Rendeing techniques Compute Gaphics Lectue 10 Can be classified as Local Illumination techniques Global Illumination techniques Global Illumination 1: Ray Tacing and Radiosity Taku Komua 1 Local Illumination

More information

arxiv: v4 [cs.ds] 7 Feb 2018

arxiv: v4 [cs.ds] 7 Feb 2018 Dynamic DFS in Undiected Gaphs: beaking the O(m) baie Suende Baswana Sheejit Ray Chaudhuy Keeti Choudhay Shahbaz Khan axiv:1502.02481v4 [cs.ds] 7 Feb 2018 Depth fist seach (DFS) tee is a fundamental data

More information

Introduction to Medical Imaging. Cone-Beam CT. Introduction. Available cone-beam reconstruction methods: Our discussion:

Introduction to Medical Imaging. Cone-Beam CT. Introduction. Available cone-beam reconstruction methods: Our discussion: Intoduction Intoduction to Medical Imaging Cone-Beam CT Klaus Muelle Available cone-beam econstuction methods: exact appoximate Ou discussion: exact (now) appoximate (next) The Radon tansfom and its invese

More information

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the

More information

Conversion Functions for Symmetric Key Ciphers

Conversion Functions for Symmetric Key Ciphers Jounal of Infomation Assuance and Secuity 2 (2006) 41 50 Convesion Functions fo Symmetic Key Ciphes Deba L. Cook and Angelos D. Keomytis Depatment of Compute Science Columbia Univesity, mail code 0401

More information

IP Network Design by Modified Branch Exchange Method

IP Network Design by Modified Branch Exchange Method Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management

More information

Layered Animation using Displacement Maps

Layered Animation using Displacement Maps Layeed Animation using Displacement Maps Raymond Smith, Wei Sun, Adian Hilton and John Illingwoth Cente fo Vision, Speech and Signal Pocessing Univesity of Suey, Guildfod GU25XH, UK a.hilton@suey.ac.uk

More information

3D Reconstruction from 360 x 360 Mosaics 1

3D Reconstruction from 360 x 360 Mosaics 1 CENTER FOR MACHINE PERCEPTION 3D Reconstuction fom 36 x 36 Mosaics CZECH TECHNICAL UNIVERSITY {bakstein, pajdla}@cmp.felk.cvut.cz REPRINT Hynek Bakstein and Tomáš Pajdla, 3D Reconstuction fom 36 x 36 Mosaics,

More information

ASSIGN 01: Due Monday Feb 04 PART 1 Get a Sketchbook: 8.5 x 11 (Minimum size 5 x7 ) fo keeping a design jounal and a place to keep poject eseach & ideas. Make sue you have you Dopbox account and/o Flash

More information

5 4 THE BERNOULLI EQUATION

5 4 THE BERNOULLI EQUATION 185 CHATER 5 the suounding ai). The fictional wok tem w fiction is often expessed as e loss to epesent the loss (convesion) of mechanical into themal. Fo the idealied case of fictionless motion, the last

More information

Derivation of the Nodal Forces Equivalent to Uniform Pressure for Quadratic Isoparametric Elements RAWB, Last Update: 30 September 2008

Derivation of the Nodal Forces Equivalent to Uniform Pressure for Quadratic Isoparametric Elements RAWB, Last Update: 30 September 2008 Deivation of the odal oces Equivalent to Unifom Pessue fo Quadatic sopaametic Elements RWB, Last Update: 0 Septembe 008 The displacement vecto u at an point within a single element, E, is lineal elated

More information

Dr. A.B.M. Toufique Hasan. Lecture-13

Dr. A.B.M. Toufique Hasan. Lecture-13 7/5/8 ME 45: Aeodynamics D. A.B.M. Toufique Hasan Pofesso Depatment of Mechanical Engineeing g Bangladesh Univesity of Engineeing & Technology BUET, Dhaka Lectue-3 7/5/8 Doublet & Flow Ove a stationey

More information

Color Interpolation for Single CCD Color Camera

Color Interpolation for Single CCD Color Camera Colo Intepolation fo Single CCD Colo Camea Yi-Ming Wu, Chiou-Shann Fuh, and Jui-Pin Hsu Depatment of Compute Science and Infomation Engineeing, National Taian Univesit, Taipei, Taian Email: 88036@csie.ntu.edu.t;

More information

t [ Background removed

t [ Background removed HANDS-ON > HOE1 Taining 1 Pictues You decide to ceate a memoies slide show fo you siste and he husband, who wee ecently maied. You include thei high school Sweetheat Ball image, engagement and wedding

More information

A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Personification by Boulic, Thalmann and Thalmann.

A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Personification by Boulic, Thalmann and Thalmann. A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Pesonification by Boulic, Thalmann and Thalmann. Mashall Badley National Cente fo Physical Acoustics Univesity of

More information

The Internet Ecosystem and Evolution

The Internet Ecosystem and Evolution The Intenet Ecosystem and Evolution Contents Netwok outing: basics distibuted/centalized, static/dynamic, linkstate/path-vecto inta-domain/inte-domain outing Mapping the sevice model to AS-AS paths valley-fee

More information

Scaling Location-based Services with Dynamically Composed Location Index

Scaling Location-based Services with Dynamically Composed Location Index Scaling Location-based Sevices with Dynamically Composed Location Index Bhuvan Bamba, Sangeetha Seshadi and Ling Liu Distibuted Data Intensive Systems Laboatoy (DiSL) College of Computing, Geogia Institute

More information

Optical Flow for Large Motion Using Gradient Technique

Optical Flow for Large Motion Using Gradient Technique SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 3, No. 1, June 2006, 103-113 Optical Flow fo Lage Motion Using Gadient Technique Md. Moshaof Hossain Sake 1, Kamal Bechkoum 2, K.K. Islam 1 Abstact: In this

More information

Annales UMCS Informatica AI 2 (2004) UMCS

Annales UMCS Informatica AI 2 (2004) UMCS Pobane z czasopisma Annales AI- Infomatica http://ai.annales.umcs.pl Annales Infomatica AI 2 (2004) 33-340 Annales Infomatica Lublin-Polonia Sectio AI http://www.annales.umcs.lublin.pl/ Embedding as a

More information

CALCULUS III Surface Integrals. Paul Dawkins

CALCULUS III Surface Integrals. Paul Dawkins CALCULU III uface Integals Paul awkins Table of Contents Peface... ii uface Integals... 3 Intoduction... 3 Paametic ufaces... 4 uface Integals... uface Integals of Vecto Fields... 9 tokes Theoem... 9 ivegence

More information

Extended Perspective Shadow Maps (XPSM) Vladislav Gusev, ,

Extended Perspective Shadow Maps (XPSM)   Vladislav Gusev, , Extended Pespective Shadow Maps (XPSM) http://xpsm.og Vladislav Gusev,.8.27, xmvlad@gmail.com Figue : XPSM esults (~4 objects in a scene, 536x536 shadow map). Intoduction Shadows ae one of the most impotant

More information

dc - Linux Command Dc may be invoked with the following command-line options: -V --version Print out the version of dc

dc - Linux Command Dc may be invoked with the following command-line options: -V --version Print out the version of dc - CentOS 5.2 - Linux Uses Guide - Linux Command SYNOPSIS [-V] [--vesion] [-h] [--help] [-e sciptexpession] [--expession=sciptexpession] [-f sciptfile] [--file=sciptfile] [file...] DESCRIPTION is a evese-polish

More information

Monte Carlo Techniques for Rendering

Monte Carlo Techniques for Rendering Monte Calo Techniques fo Rendeing CS 517 Fall 2002 Compute Science Conell Univesity Announcements No ectue on Thusday Instead, attend Steven Gotle, Havad Upson Hall B17, 4:15-5:15 (efeshments ealie) Geomety

More information

Output Primitives. Ellipse Drawing

Output Primitives. Ellipse Drawing Output Pimitives Ellipse Dawing Ellipses. An ellipses is an elongated cicle and can be dawn with modified cicle dawing algoithm.. An ellipse has set of fied points (foci) that will have a constant total

More information

Class 21. N -body Techniques, Part 4

Class 21. N -body Techniques, Part 4 Class. N -body Techniques, Pat Tee Codes Efficiency can be inceased by gouping paticles togethe: Neaest paticles exet geatest foces diect summation. Distant paticles exet smallest foces teat in goups.

More information

Positioning of a robot based on binocular vision for hand / foot fusion Long Han

Positioning of a robot based on binocular vision for hand / foot fusion Long Han 2nd Intenational Confeence on Advances in Mechanical Engineeing and Industial Infomatics (AMEII 26) Positioning of a obot based on binocula vision fo hand / foot fusion Long Han Compute Science and Technology,

More information

A Novel Image-Based Rendering System With A Longitudinally Aligned Camera Array

A Novel Image-Based Rendering System With A Longitudinally Aligned Camera Array EUOGAPHICS 2 / A. de Sousa, J.C. Toes Shot Pesentations A Novel Image-Based endeing System With A Longitudinally Aligned Camea Aay Jiang Li, Kun Zhou, Yong Wang and Heung-Yeung Shum Micosoft eseach, China

More information

DYNAMIC STORAGE ALLOCATION. Hanan Samet

DYNAMIC STORAGE ALLOCATION. Hanan Samet ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu

More information

Analysis of uniform illumination system with imperfect Lambertian LEDs

Analysis of uniform illumination system with imperfect Lambertian LEDs Optica Applicata, Vol. XLI, No. 3, 2011 Analysis of unifom illumination system with impefect Lambetian LEDs JIAJIE TAN 1, 2, KECHENG YANG 1*, MIN XIA 1, YING YANG 1 1 Wuhan National Laboatoy fo Optoelectonics,

More information

A Two-stage and Parameter-free Binarization Method for Degraded Document Images

A Two-stage and Parameter-free Binarization Method for Degraded Document Images A Two-stage and Paamete-fee Binaization Method fo Degaded Document Images Yung-Hsiang Chiu 1, Kuo-Liang Chung 1, Yong-Huai Huang 2, Wei-Ning Yang 3, Chi-Huang Liao 4 1 Depatment of Compute Science and

More information

An Unsupervised Segmentation Framework For Texture Image Queries

An Unsupervised Segmentation Framework For Texture Image Queries An Unsupevised Segmentation Famewok Fo Textue Image Queies Shu-Ching Chen Distibuted Multimedia Infomation System Laboatoy School of Compute Science Floida Intenational Univesity Miami, FL 33199, USA chens@cs.fiu.edu

More information

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension 17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach

More information

CSE 165: 3D User Interaction

CSE 165: 3D User Interaction CSE 165: 3D Use Inteaction Lectue #6: Selection Instucto: Jugen Schulze, Ph.D. 2 Announcements Homewok Assignment #2 Due Fiday, Januay 23 d at 1:00pm 3 4 Selection and Manipulation 5 Why ae Selection and

More information

Topic 7 Random Variables and Distribution Functions

Topic 7 Random Variables and Distribution Functions Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions Topic 7 Random Vaiables and Distibution Functions Distibution Functions 1 / 11 Definition of a Random Vaiable Distibution

More information

Complete Solution to Potential and E-Field of a sphere of radius R and a charge density ρ[r] = CC r 2 and r n

Complete Solution to Potential and E-Field of a sphere of radius R and a charge density ρ[r] = CC r 2 and r n Complete Solution to Potential and E-Field of a sphee of adius R and a chage density ρ[] = CC 2 and n Deive the electic field and electic potential both inside and outside of a sphee of adius R with a

More information

Color Correction Using 3D Multiview Geometry

Color Correction Using 3D Multiview Geometry Colo Coection Using 3D Multiview Geomety Dong-Won Shin and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 13 Cheomdan-gwagio, Buk-ku, Gwangju 500-71, Republic of Koea ABSTRACT Recently,

More information

Reachable State Spaces of Distributed Deadlock Avoidance Protocols

Reachable State Spaces of Distributed Deadlock Avoidance Protocols Reachable State Spaces of Distibuted Deadlock Avoidance Potocols CÉSAR SÁNCHEZ and HENNY B. SIPMA Stanfod Univesity We pesent a family of efficient distibuted deadlock avoidance algoithms with applications

More information

Efficient Execution Path Exploration for Detecting Races in Concurrent Programs

Efficient Execution Path Exploration for Detecting Races in Concurrent Programs IAENG Intenational Jounal of Compute Science, 403, IJCS_40_3_02 Efficient Execution Path Exploation fo Detecting Races in Concuent Pogams Theodous E. Setiadi, Akihiko Ohsuga, and Mamou Maekaa Abstact Concuent

More information

2D Transformations. Why Transformations. Translation 4/17/2009

2D Transformations. Why Transformations. Translation 4/17/2009 4/7/9 D Tansfomations Wh Tansfomations Coodinate sstem tansfomations Placing objects in the wold Move/animate the camea fo navigation Dawing hieachical chaactes Animation Tanslation + d 5,4 + d,3 d 4,

More information

POMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler

POMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler POMDP: Intoduction to Patially Obsevable Makov Decision Pocesses Hossein Kamalzadeh, Michael Hahsle 2019-01-02 The R package pomdp povides an inteface to pomdp-solve, a solve (witten in C) fo Patially

More information

Downloaded 09/15/14 to Redistribution subject to SIAM license or copyright; see

Downloaded 09/15/14 to Redistribution subject to SIAM license or copyright; see SIAM J. NUMER. ANAL. Vol. 4, No., pp. 235 257 c 23 Society fo Industial and Applied Mathematics Downloaded 9/5/4 to 29.237.46.. Redistibution subject to SIAM license o copyight; see http://www.siam.og/jounals/ojsa.php

More information

A modal estimation based multitype sensor placement method

A modal estimation based multitype sensor placement method A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;

More information

Ego-Motion Estimation on Range Images using High-Order Polynomial Expansion

Ego-Motion Estimation on Range Images using High-Order Polynomial Expansion Ego-Motion Estimation on Range Images using High-Ode Polynomial Expansion Bian Okon and Josh Haguess Space and Naval Wafae Systems Cente Pacific San Diego, CA, USA {bian.okon,joshua.haguess}@navy.mil Abstact

More information