An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane
|
|
- Christian Doyle
- 6 years ago
- Views:
Transcription
1 An Approach n Colorng Sem-Regular Tlngs on the Hyperbolc Plane Ma Louse Antonette N De Las Peñas, mlp@mathscmathadmueduph Glenn R Lago, glago@yahoocom Math Department, Ateneo de Manla Unversty, Loyola Heghts, Quezon Cty, Phlppnes René P Felx, rene@math0updeduph Math Department, Unversty of the Phlppnes, Dlman, Quezon Cty, Phlppnes Abstract A colorng of a sem-regular tlng s perfect f every symmetry of the tlng permutes the colors of the tlng In ths paper, an approach to the constructon of perfect colorngs of sem-regular tlngs on the hyperbolc plane s presented Introducton In [], a method for colorng symmetrcal patterns was presented where a fundamental doman of the pattern s assgned exactly one color In ths paper, we present a general framework for colorng planar patterns where a fundamental doman of the pattern may be assgned more than one color We apply the framework to construct perfect colorngs of sem-regular tlngs on the hyperbolc plane We wll use the subgroup structure of the symmetry group of the tlng to systematcally construct the colorngs An edge-to-edge tlng s a plane tlng where the corners and sdes of the polygonal tles form all the vertces and edges of the tlng and vce versa A vertex of an edge-to-edge tlng s sad to be of type p p p q f the polygons about ths vertex n cyclc order are a p -gon, a p -gon,, and a pq - gon An edge-to-edge tlng havng regular polygons as ts tles wth vertces all of the same type, and where the symmetres of the tlng act transtvely on the vertces s called sem-regular We denote the sem-regular tlng as p p pq dependng on ts vertex type p p pq If the polygons n the q tlng are of the same type, partcularly a p-gon meetng q at a vertex, we denote the tlng as p In ths paper, we wll present an approach to color perfectly the 8 8 and 0 8 hyperbolc sem-regular tlngs General Framework for Colorng Planar Patterns The followng general framework for colorng planar patterns shall be used to obtan colorngs of semregular tlngs Let X be the set of tles n the tlng to be assgned colors; G be the symmetry group of the uncolored tlng; H be the subgroup of elements of G permutng the colors; C be the set of colors
2 Let O ( I ) correspondng to ths set s the set { hj X h H} be the H-orbts of colors and c a color n O = hc : h H and :, where J s the stablzer n H of the color c and X conssts of representatves of each H-orbt of elements of X wth the representatves colored c The followng are true: O Then { } X The acton of H on hj : I by left multplcaton In O, the number of colors s [ H : J ] If x X then StabH ( x) J, where Stab H ( x) = { h H : hx = x} If x X then Hx = [ H : J ] [ J : StabH ( x) ] The number of H-orbts of colors s less than or equal to the number of H-orbts of elements of O s equvalent on ts acton on { } The followng steps, based on the general framework, shall be used to obtan the requred colorng of the tlng orbt Determne the fnte group S of sometres n G that stablzes a representatve tle t from an Determne all subgroups J of G such that S < J If tle t has color c, apply c to all tles n the set Jt Ths makes J the stablzer of the color c nsde G If [ J ] k G : =, then Jt s of the tles n the class where t belongs k : One element of ths set has color c, whch s Jt There should be k other elements or colors To complete the colorng, assgn a color to every element of the set { gjt g G} Hence, the ndex k of the subgroup J n G s the number of colors that can be used to perfectly color the orbt of tles contanng t Colorng the Hyperbolc Plane Tessellatng the Hyperbolc Plane In [], Azz created a computer program Colorng the Hyperbolc Plane (CHP) that tessellates the hyperbolc plane wth congruent trangles of nteror angles π π π π π π,, and, where + + < π Denote by e one of the trangles of the tessellaton and call t the p q r p q r fundamental trangle Let P be the reflecton on the sde of the trangle opposte the angle p π, Q as the reflecton on the sde of the trangle opposte the angle q π, and R the reflecton on the sde of the trangle opposte r π The symmetry group G of the tessellaton s generated by and R, denoted by pqr Gven the fundamental trangle e, the tessellaton may be recovered by gettng the mages of e under R, and ther products There s a one-to-one correspondence between the elements of G and the trangles n the tessellaton Each trangle n the tessellaton can then be labeled by the correspondng
3 element of G The acton of G on the trangles of the tessellaton, where g G acts on a trangle by sendng t to ts mage, s equvalent to the acton of G on tself by left multplcaton R Q P Fgure: () Labelng the trangles n the tessellaton Colorng Usng Rght Cosets If S s a subgroup of G of ndex n, a colorng usng rght (or left) cosets of S refers to a bjectve map from the set of rght (or left) cosets of S to a set of n colors Trangles labeled by elements of a rght (or left) coset are colored usng the color assgned to the coset In Fgure, we gve a colorng of the hyperbolc plane usng rght cosets of the subgroup S and n Fgure, we gve another colorng usng left cosets of the subgroup S, where S represents a subgroup of ndex of the hyperbolc trangle group 6 Fgures: () Rght coset colorng usng S; () Left coset colorng usng S The rght coset colorngs of a gven subgroup S of the symmetry group G of the tessellaton plays an mportant role n studyng the subgroup structure of G S turns out to be the symmetry group of the colored tessellaton and S fxes the colors of the tessellaton In ths paper, we wll use the rght coset colorngs generated by CHP to determne the subgroups of G that contan the stablzer of the tles n the gven sem-regular tlngs Perfect Colorngs of Sem-Regular 8 8 and 0 8 Tlngs In ths part of the paper, we llustrate how to obtan perfect colorngs of sem-regular 8 8 and 0 8 tlngs usng the gven framework Both tlngs have symmetry group G = ; G contans rotatons of order,, wth centers of the correspondng rotatons lyng on mrror lnes In colorng the sem-regular tlngs, we wll make use of the subgroups of G GAP [8] s used to generate a lstng of the subgroups of G shown n Table For the purposes of ths paper, and due to colorng constrants, we wll only consder subgroups up to ndex
4 Lst of Subgroups of * of Index <= : Number of Subgroups = 7 Group( [ R, P ] ) Group( [ R, PRP ] ) Group( [ R P ] ) Group( [ R PQ ] ) Group( [ R PRPQ ] ) Group( [ RQRPRQR ] ) Group( [ RPQR ] ) Table: () Subgroups of of ndex less than or equal to The generators R, P appearng n Table are mrror reflectons wth axes shown n Fgures and for the respectve tlngs 8 8 and 0 8 Q R P R P Q Fgures: (-) Generators R, and P Sem-Regular 8 8 Tlng The sem-regular 8 8 tlng has two orbts of tles: the orbt of 8- gons and the orbt of -gons To construct the perfect colorngs, we color each orbt of tles separately We frst color the orbt of 8-gons Frst, note that the fnte group that stablzes an 8-gon s of type D, the dhedral group of order 8 We need to select the subgroups J that contans D The condton that J contans the stablzer s always satsfed by G To fnd other subgroups contanng D, we wll use the rght coset colorngs of the subgroups of G To obtan the rght coset colorngs, we use the CHP program From the program, Fgure 6 shows the rght coset colorng usng the subgroup J = RQRPRQR Note that the subgroup D generated by the o 90 rotaton about the ndcated pont x and mrror about the horzontal lne through x fxes the color of the gven rght coset colorng Thus, the subgroup J = RQRPRQR contans the group of type D and can now be used to color the orbt of 8-gons for the 8 8 tlng Fgure shows the rght coset colorng usng the subgroup J RPQR Smlarly, the o subgroup D generated by the 90 rotaton about x and mrror about the horzontal lne through x fxes the colors of the colorng Thus, the subgroup J also contans D We are now ready to color the orbt of 8-gons We wll use the subgroups J, namely J, J, and J = G Usng J = G, we color all 8-gons usng one color to obtan the colorng n Fgure 8
5 Next, we color the orbt of 8-gons usng J RQRPRQR To obtan a perfect colorng usng J, we frst choose a representatve tle t from the 8-gons We then color J t wth black, as seen n Fgure 9 To color the rest of the orbt, we apply the -fold rotaton wth center A lyng on mrrors R and Q on J t to obtan a colorng of fve colors gven n Fgure 0 Lastly, we color the orbt of 8-gons usng J RPQR Colorng all tles n J t black, we obtan Fgure Then we assgn dfferent shades and textures of gray to the tles n the other orbts by applyng the -fold rotaton about A to obtan Fgure Next, we color the orbt of -gons The fnte group that stablzes a -gon s of type D, the dhedral group of order 0 We now select the subgroup J ' that contans the stablzer Asde from G, our choce for J ' s the subgroup Q, R, PRP Fgure shows the rght coset colorng usng Q, R, PRP The subgroup generated by through x fxes the colors of the colorng and s of type D o 7 about x and mrror reflecton about the horzontal lne To color the orbt of -gons, we let obtan Fgure J ' = G to obtan Fgure and let J = ' R, PRP to To color the entre sem-regular tlng, we combne all the colorngs of each orbt of tles above Thus, the resultng perfect colorngs of the 8 8 tlng are shown n Fgure 6 x x t A t A x Fgures: (6-7) Rght coset colorngs of J and J respectvely; (8) Perfect colorng of the orbt of 8-gons usng J = G ; (9) J t ; (0) Perfect colorng of the orbt of 8-gons usng J ; () J t ; () Perfect colorng of the orbt of 8-gons usng J ; () Rght coset colorngs of J ' ; (-) Perfect colorng of the orbt of -gons
6 Fgure: (6) Perfect colorngs of the 8 8 tlng Sem-Regular 0 8 Tlng The sem-regular 0 8 tlng has three orbts of tles: the orbt of -gons, 0-gons, and 8-gons We follow the steps gven n and color each orbt of tles separately where To color the -gons, we use J = G, J RQRPRQR, and J RPQR, D < J We have the three colorngs n Fgures 7, 8, and 9 Next, we use Fgures 0 and J ' = G and J = ' R, PRP, where D < J ', to color the 0-gons shown n Lastly, we use J " = G, J " RQRPRQR, and " RPQR, where D < J ", to color the 8-gons n Fgures,, and Next, we combne all these colorngs to obtan the perfect colorngs of the 0 8 sem-regular tlng as seen n Fgure Fgures: (7-9) Perfect colorng of the orbt of -gons; (0-) Perfect colorng of the orbt of 0-gons; (-) Perfect colorng of the orbt of 8-gons
7 Fgure: () Perfect colorngs of the 0 8 tlng where the orbts do not share colors Observe that f J s used to color one orbt of tles, t can also be used to color a second orbt of tles as long as J contans the stablzer of a tle n the second orbt of tles Moreover, f a color used to color tle t n the frst orbt of tles s to be used to color tles n the second orbt, then the tle t that wll be assgned the same color as tle t should have a stablzer contaned n J In colorng the 0 8 tlng, the orbt of -gons and the orbt of 8-gons can share the same color These colorngs appear n Fgure 6 The colorngs A and B are obtaned usng J = G to color both orbts of -gons and 8-gons The colorngs n C and D are obtaned usng J RQRPRQR whle the colorngs n E and F are obtaned usng J RPQR A B C D E Fgure: (6) Perfect colorngs of the 0 8 tlng where the orbts share colors F Concluson In ths note, we gve an approach to color sem-regular tlngs on the hyperbolc plane We use the general framework for colorng planar patterns where an orbt of tles n the gven tlng s colored usng a subgroup of the symmetry group G of the tlng contanng the stablzer of the tle We use the GAP program to generate the subgroups of G whle a helpful tool n studyng more closely the subgroup structure of G s the CHP program
8 We ntend that the approach provded here n obtanng perfect colorngs of sem-regular tlngs wll provde a sprngboard n the constructon of colorngs (both perfect and non-perfect) of tlngs n general on the hyperbolc plane References [] Azz, Shahd A Computer Algorthm for Colorng A Hyperbolc Tessellaton A Masteral Thess, The Unversty of the Phlppnes Dlman, 996 [] Coxeter, HSM, and WO Moser Generators and Relatons for Dscrete Groups nd ed New York: Sprnger-Verlag, 96 [] De Las Peñas, Ma Louse Antonette N, René P Felx, and M V P Qulngun A Framework for Colorng Symmetrcal Patterns n Algebras and Combnatorcs: An Internatonal Congress, ICAC 97 Hong Kong Sngapore: Sprnger-Verlag 999 [] Felx, René P A General Framework for Colorng Planar Patterns, a paper presented n Natonal Research Councl of the Phlppnes (NRCP) Conference Phlppnes February, 00 [] Grünbaum, B, and GC Shephard Tlngs and Patterns New York: WH Freeman and Company, 987 [6] Hernandez, Nestne Hope Sevlla On Colorngs Induced by Low Index Subgroups of Some Hyperbolc Trangle Groups A Masteral Thess, The Unversty of the Phlppnes Dlman 00 [7] Mtchell, Kevn J Constructng Sem-Regular Tlngs, a paper presented n The Sprng 99 Meetng of the Seaway Secton of the Mathematcal Assocaton of Amerca 99 [8] The GAP Group GAP Groups, Algorthms, and Programmng, Verson, 00,
UNIT 2 : INEQUALITIES AND CONVEX SETS
UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationCHAPTER 2 DECOMPOSITION OF GRAPHS
CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng
More informationChapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationCubic Crystals and Vertex-Colorings of the Cubic Honeycomb
Cubic Crystals and Vertex-Colorings of the Cubic Honeycomb Mark L. Loyola 1, Ma. Louise Antonette N. De Las Peñas 1, Antonio M. Basilio 2 1 Mathematics Department, 2 Chemistry Department Ateneo de Manila
More informationCordial and 3-Equitable Labeling for Some Star Related Graphs
Internatonal Mathematcal Forum, 4, 009, no. 31, 1543-1553 Cordal and 3-Equtable Labelng for Some Star Related Graphs S. K. Vadya Department of Mathematcs, Saurashtra Unversty Rajkot - 360005, Gujarat,
More informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
More informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
More informationHyperbolic Semi-Regular Tilings and their Symmetry Properties
Hyperbolic Semi-Regular Tilings and their Symmetry Properties Ma. Louise Antonette N. De Las Peñas, mlp@mathsci.math.admu.edu.ph Glenn R. Laigo, glaigo@yahoo.com Eden Delight B. Provido, edenprovido@yahoo.com
More informationRamsey numbers of cubes versus cliques
Ramsey numbers of cubes versus clques Davd Conlon Jacob Fox Choongbum Lee Benny Sudakov Abstract The cube graph Q n s the skeleton of the n-dmensonal cube. It s an n-regular graph on 2 n vertces. The Ramsey
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationElectrical analysis of light-weight, triangular weave reflector antennas
Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationTEST-05 TOPIC: OPTICS COMPLETE
Q. A boy s walkng under an nclned mrror at a constant velocty V m/s along the x-axs as shown n fgure. If the mrror s nclned at an angle wth the horzontal then what s the velocty of the mage? Y V sn + V
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationAP PHYSICS B 2008 SCORING GUIDELINES
AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for
More informationA PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION
1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationOn Embedding and NP-Complete Problems of Equitable Labelings
IOSR Journal o Mathematcs (IOSR-JM) e-issn: 78-578, p-issn: 39-765X Volume, Issue Ver III (Jan - Feb 5), PP 8-85 wwwosrjournalsorg Ombeddng and NP-Complete Problems o Equtable Labelngs S K Vadya, C M Barasara
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationSolving some Combinatorial Problems in grid n-ogons
Solvng some Combnatoral Problems n grd n-ogons Antono L. Bajuelos, Santago Canales, Gregoro Hernández, Ana Mafalda Martns Abstract In ths paper we study some problems related to grd n-ogons. A grd n-ogon
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationAn Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method
Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationREFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.
Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationThe Erdős Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces
Dscrete Mathematcs 307 (2007) 764 768 www.elsever.com/locate/dsc Note The Erdős Pósa property for vertex- and edge-dsjont odd cycles n graphs on orentable surfaces Ken-Ich Kawarabayash a, Atsuhro Nakamoto
More information1.4 Circuit Theorems
. Crcut Theorems. v,? (C)V, 5 6 (D) V, 6 5. A smple equvlent crcut of the termnl 6 v, network shown n fg. P.. s Fg. P... (A)V, (B)V, v (C)V,5 (D)V,5 Fg. P....,? 5 V, v (A) (B) Fg. P... (A)A, 0 (B) 0 A,
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationPHYS 219 Spring semester Lecture 20: Reflection of Electromagnetic Radiation: Mirrors and Images Formed by Mirrors
PHYS 219 Sprng semester 2014 Lecture 20: eflecton of Electromagnetc adaton: Mrrors and Images Formed by Mrrors on efenberger Brck Nanotechnology Center Purdue Unversty Lecture 20 1 evew: Snapshot of an
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationBridges and cut-vertices of Intuitionistic Fuzzy Graph Structure
Internatonal Journal of Engneerng, Scence and Mathematcs (UGC Approved) Journal Homepage: http://www.jesm.co.n, Emal: jesmj@gmal.com Double-Blnd Peer Revewed Refereed Open Access Internatonal Journal -
More informationScan Conversion & Shading
Scan Converson & Shadng Thomas Funkhouser Prnceton Unversty C0S 426, Fall 1999 3D Renderng Ppelne (for drect llumnaton) 3D Prmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng
More informationScan Conversion & Shading
1 3D Renderng Ppelne (for drect llumnaton) 2 Scan Converson & Shadng Adam Fnkelsten Prnceton Unversty C0S 426, Fall 2001 3DPrmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng
More informationPaper style and format for the Sixth International Symposium on Turbulence, Heat and Mass Transfer
K. Hanjalć, Y. Nagano and S. Jakrlć (Edtors) 2009 Begell House, Inc. Paper style and format for the Sxth Internatonal Symposum on Turbulence, Heat and Mass Transfer K. Hanjalć 1, Y. Nagano 2 and S. Jakrlć
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationAMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain
AMath 483/583 Lecture 21 May 13, 2011 Today: OpenMP and MPI versons of Jacob teraton Gauss-Sedel and SOR teratve methods Next week: More MPI Debuggng and totalvew GPU computng Read: Class notes and references
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationChapter 4. Non-Uniform Offsetting and Hollowing by Using Biarcs Fitting for Rapid Prototyping Processes
Chapter 4 Non-Unform Offsettng and Hollowng by Usng Barcs Fttng for Rapd Prototypng Processes Ths chapter presents a new method of Non-Unform offsettng and usng barc fttngs to hollow out sold objects or
More informationSemi - - Connectedness in Bitopological Spaces
Journal of AL-Qadsyah for computer scence an mathematcs A specal Issue Researches of the fourth Internatonal scentfc Conference/Second صفحة 45-53 Sem - - Connectedness n Btopologcal Spaces By Qays Hatem
More informationMath Homotopy Theory Additional notes
Math 527 - Homotopy Theory Addtonal notes Martn Frankland February 4, 2013 The category Top s not Cartesan closed. problem. In these notes, we explan how to remedy that 1 Compactly generated spaces Ths
More informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place
More informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationAny Pair of 2D Curves Is Consistent with a 3D Symmetric Interpretation
Symmetry 2011, 3, 365-388; do:10.3390/sym3020365 OPEN ACCESS symmetry ISSN 2073-8994 www.mdp.com/journal/symmetry Artcle Any Par of 2D Curves Is Consstent wth a 3D Symmetrc Interpretaton Tadamasa Sawada
More informationSolutions to Programming Assignment Five Interpolation and Numerical Differentiation
College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent
More informationCell Count Method on a Network with SANET
CSIS Dscusson Paper No.59 Cell Count Method on a Network wth SANET Atsuyuk Okabe* and Shno Shode** Center for Spatal Informaton Scence, Unversty of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan
More informationb * -Open Sets in Bispaces
Internatonal Journal of Mathematcs and Statstcs Inventon (IJMSI) E-ISSN: 2321 4767 P-ISSN: 2321-4759 wwwjmsorg Volume 4 Issue 6 August 2016 PP- 39-43 b * -Open Sets n Bspaces Amar Kumar Banerjee 1 and
More informationInternational Journal of Scientific & Engineering Research, Volume 7, Issue 5, May ISSN Some Polygonal Sum Labeling of Bistar
Internatonal Journal of Scentfc & Engneerng Research Volume 7 Issue 5 May-6 34 Some Polygonal Sum Labelng of Bstar DrKAmuthavall SDneshkumar ABSTRACT- A (p q) graph G s sad to admt a polygonal sum labelng
More informationMATHEMATICS FORM ONE SCHEME OF WORK 2004
MATHEMATICS FORM ONE SCHEME OF WORK 2004 WEEK TOPICS/SUBTOPICS LEARNING OBJECTIVES LEARNING OUTCOMES VALUES CREATIVE & CRITICAL THINKING 1 WHOLE NUMBER Students wll be able to: GENERICS 1 1.1 Concept of
More informationA Clustering Algorithm for Chinese Adjectives and Nouns 1
Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationReport on On-line Graph Coloring
2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm
More informationarxiv: v2 [math.ds] 3 May 2016
Cuttng sequences on Bouw-Möller surfaces: an S-adc characterzaton Dana Davs, Irene Pasqunell and Cornna Ulcgra arxv:509.03905v2 [math.ds] 3 May 206 Abstract. We consder a symbolc codng for geodescs on
More informationParallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)
Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)
More informationIntroduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2
Introducton to Geometrcal Optcs - a D ra tracng Ecel model for sphercal mrrors - Part b George ungu - Ths s a tutoral eplanng the creaton of an eact D ra tracng model for both sphercal concave and sphercal
More informationSketching of Mirror-symmetric Shapes
IEEE TRANSACTIONS ON TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS Sketchng of Mrror-symmetrc Shapes Frederc Corder Hyewon Seo Jnho Park and Junyong Noh Fg.. Sketchng of a symmetrc shape. Abstract
More informationCircuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)
Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,
More informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
More informationKey words. Graphics processing unit, GPU, digital geometry, computational geometry, parallel computation, CUDA, OpenCL
PROOF OF CORRECTNESS OF THE DIGITAL DELAUNAY TRIANGULATION ALGORITHM THANH-TUNG CAO, HERBERT EDELSBRUNNER, AND TIOW-SENG TAN Abstract. We prove that the dual of the dgtal Vorono dagram constructed by floodng
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationCHOICE OF THE CONTROL VARIABLES OF AN ISOLATED INTERSECTION BY GRAPH COLOURING
Yugoslav Journal of Operatons Research 25 (25), Number, 7-3 DOI:.2298/YJOR38345B CHOICE OF THE CONTROL VARIABLES OF AN ISOLATED INTERSECTION BY GRAPH COLOURING Vladan BATANOVIĆ Mhalo Pupn Insttute, Volgna
More informationUSING GRAPHING SKILLS
Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp
More informationA fault tree analysis strategy using binary decision diagrams
Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationthe nber of vertces n the graph. spannng tree T beng part of a par of maxmally dstant trees s called extremal. Extremal trees are useful n the mxed an
On Central Spannng Trees of a Graph S. Bezrukov Unverstat-GH Paderborn FB Mathematk/Informatk Furstenallee 11 D{33102 Paderborn F. Kaderal, W. Poguntke FernUnverstat Hagen LG Kommunkatonssysteme Bergscher
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationarxiv: v1 [math.ds] 3 Feb 2010
COMBINATORIAL TOPOLOGY OF THREE-DIMENSIONAL SELF-AFFINE TILES arxv:1002.0710v1 [math.ds] 3 Feb 2010 CHRISTOPH BANDT Abstract. We develop tools to study the topology and geometry of self-affne fractals
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More informationEsc101 Lecture 1 st April, 2008 Generating Permutation
Esc101 Lecture 1 Aprl, 2008 Generatng Permutaton In ths class we wll look at a problem to wrte a program that takes as nput 1,2,...,N and prnts out all possble permutatons of the numbers 1,2,...,N. For
More informationAPPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF
APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF Johannes Leebmann Insttute of Photogrammetry and Remote Sensng, Unversty of Karlsruhe (TH, Englerstrasse 7, 7618 Karlsruhe, Germany - leebmann@pf.un-karlsruhe.de
More informationLS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract
12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationTopology Design using LS-TaSC Version 2 and LS-DYNA
Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationSome kinds of fuzzy connected and fuzzy continuous functions
Journal of Babylon Unversty/Pure and Appled Scences/ No(9)/ Vol(): 4 Some knds of fuzzy connected and fuzzy contnuous functons Hanan Al Hussen Deptof Math College of Educaton for Grls Kufa Unversty Hananahussen@uokafaq
More informationCOMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL
COMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL Nader Safavan and Shohreh Kasae Department of Computer Engneerng Sharf Unversty of Technology Tehran, Iran skasae@sharf.edu
More information