CONJUGATE SU(r)-CONNECTIONS AND HOLONOMY GROUPS

Size: px
Start display at page:

Download "CONJUGATE SU(r)-CONNECTIONS AND HOLONOMY GROUPS"

Transcription

1 PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 18, Numbe 3, Pages S (99)05457-X Aticle electonically published on Septembe 9, 1999 CONJUGATE SU()-CONNECTIONS AND HOLONOMY GROUPS JIN-HONG KIM (Communicated by Chistophe Coke) Abstact. In this aticle we show that when the stuctue goup of the educible pincipal bundle P is SU() andq P is an SO()-subbundle of P, the ank of the holonomy goup of a connection which is gauge equivalent to its conjugate connection is less than o equal to [ ], and use the estimate to show that fo all odd pime, if the holonomy goup of the ieducible connection as above is simple and is not isomophic to E 8, F 4,oG,thenitis isomophic to SO(). 1. Intoduction In thei pape [7], S. Kobayashi and E. Shinozaki intoduced the concept of conjugate connection in a educible pincipal G-bundle P. By looking at pincipal bundles they had a bette undestanding of conjugate connections whose notion in affine diffeential geomety had been known fo a long time. Moeove, they showed that the goup consisting of automophisms of a Lie goup G fixing a Lie subgoup H, the automophism goup, induces a compatible action on the quotient space of connections modulo gauge goup on a pincipal G-bundle P that is educible to a pincipal H-subbundle Q. It was also obseved in [4] that the action does not depend on the eduction of a pincipal G-bundle to a subbundle. When we fix a Riemannian metic on the base manifold and G is compact, the automophism goup also acts on the moduli space of Yang-Mills connections and on the moduli space of anti-self-dual (ASD) connections, when the base manifold is 4-dimensional. Howeve, it tuns out that the inne automophism goup which consists of inne automophisms in the automophism goup tivially acts on the quotient space of connections. Thus, it is natual to conside the action on the quotient space of connections fo the oute automophism goup. It is well known that fo compact simple Lie goups only Lie goups of type A (>1), D ( 4), and E 6 have a nontivial oute automophism goup (see [10]). In case of G = SU(3), we showed a localization theoem of the moduli space of ieducible ASD connections in a educible pincipal SU(3)-bundle P along the moduli spaces of ieducible ASD connections in the SO(3)-subbundles Q of P (see [3]). One of the key ingedients of the poof was to know what is the holonomy goup of an ieducible connection which is gauge equivalent to its conjugate connection. This is elatively easy since the ank of the stuctue goup is just. But as the ank of the stuctue goup Received by the editos Apil, Mathematics Subject Classification. Pimay 53C c 1999 Ameican Mathematical Society

2 866 JIN-HONG KIM becomes highe, it does not seem to be a tivial poblem to know what ae the holonomy goups at all. In this pape, as a continuation of the pape [3] we give a shap ank estimate of the holonomy goup of an ieducible connection which is gauge equivalent to its conjugate connection, and as an easy consequence we pove that when the ank of the stuctue goup plus one is odd pime, if the holonomy goup is simple and not isomophic to E 8,F 4,oG, then it is isomophic to SO(). We oganize this pape as follows. In Section, we biefly ecall the definition of conjugate connection and an impotant theoem of Kobayashi and Shinozaki. We will show a shap ank estimate of the holonomy goup in Section 3.. Peliminaies In this section, we will set up some notations and ecall biefly the definition of conjugate connection in educible pincipal bundles (see [7] fo moe details) and a theoem fom [8], due to Kobayashi and Shinozaki, which motivates this pape. Let G be a Lie goup with Lie algeba g, and let H be a closed subgoup with Lie algeba h. Let P be a pincipal G-bundle ove a manifold M with pojection π, andqa pincipal H-subbundle of P. In geneal, such a subbundle does not necessaily exist. We cove M by open sets U i with local sections ξ i : U i Q. Then, the tansition functions a ij : U i U j H ae defined by ξ j (x) =ξ i (x)a ij (x). A connection fom {A i } on P is defined as a family of g-valued 1-foms A i on U i which satisfies the following tansfomation ule fom A i to A j : (.1) A j = a 1 ij A ia ij + a 1 ij da ij on U i U j. Since A i is not defined on all of M, we define a g-valued 1-fom on P fom A i as follows: A = g 1 A i g + g 1 dg, g G, on π 1 (U i )=U i G. Then it is easy to see that A is a g-valued 1-fom on P,and it follows that ξi (A) =A i. Given σ Aut(G, H), we set A σ i = σ(a i ) and apply σ to (.1). Since we took local sections s i : U i Q and thus the tansition functions a ij s ae H-valued, we have A σ j = a 1 ij Aσ i a ij + a 1 ij da ij. Thus, {A σ i } defines a connection on P.Wecallittheσ-conjugate connection of A elative to Q, denoted A σ.notethata σ is not σ(a). In fact, σ(a) maynotbe a connection 1-fom. Now, let us set up some notations which will used late in this pape. Let Aut(G, H) be the goup of automophisms of G leaving all elements of H fixed, Inn(G, H) be the goup of all inne automophisms in Aut(G, H), and let Out(G, H) =Aut(G, H)/ Inn(G, H). Out(G, H) is called the oute automophism goup. Given σ Aut(G, H), the induced automophism of g is denoted also σ. Fo G = SU(), we fix an automophism σ given by a ā. Note that the automophism σ of SU() ( 3) is oute and a geneato of the oute automophism goup (see [10]).

3 CONJUGATE SU()-CONNECTIONS AND HOLONOMY GROUPS 867 We fix a point u 0 Q.WedenotebyH u0 (A) the holonomy goup of a connection A with efeence to u 0. We call a connection in P geneic if its holonomy goup coincides with G, and call a connection ieducible if its isotopy goup, consideed as a closed Lie subgoup of G, coincides with the cente of G (see [1] fo moe details). Finally, we state an impotant theoem of Kobayashi and Shinozaki [8] in this pape. Theoem.1. Let σ Aut (G, H) and A be a connection in P. Assume that A σ is gauge equivalent to A unde a gauge tansfomation ϕ. If we define an element a G by ϕ(u 0 )=u 0 a,then σ(g)=a 1 ga fo g H u0 (A). In paticula, if the holonomy goup is G, thenσis the inne automophism defined by a 1 above. As a consequence, Out (G, H) acts feely on the geneic pat of the quotient space of connections, and Aut (G, H) acts feely on the geneic pat of the famed quotient space of connections. 3. Main esults In this section we pove ou main esults in this pape. Fist, we begin with the following Theoem 3.1. Let P be a pincipal SU()-bundle ove a simply connected manifold M that is educible to an SO()-subbundle Q. LetAbe an ieducible connection in P. Assume that the σ-conjugate connection A σ of A is gauge equivalent to A unde a gauge tansfomation ϕ. Then, the holonomy goup H u0 (A) is a compact, connected, semisimple Lie subgoup of SU() of ank less than o equal to [. Remak 3.. The uppe bound in the theoem is shap because thee is an ieducible connection A which defines one in the pincipal SO()-subbundle Q and whose holonomy goup is SO(), and SO() has ank [. Notethatweneedthe ieducibility of the connection only to say that the holonomy goup is semisimple. To pove the theoem, we fist pove the following Lemma 3.3. Let P be a pincipal SU()-bundle whose base manifold is simply connected and paacompact. Then, evey holonomy goup of an ieducible connection is a compact, connected, semisimple Lie subgoup of SU(). Remak 3.4. Since it is well known that the holonomy goup is a connected Lie goup ([6], Theoem 4.), it emains to pove that the holonomy goup is closed and semisimple. In geneal, the statement in the lemma may not be tue. Thus, we would like to point out that the statement by S.K. Donaldson and P.B. Konheime, line 4 fom the top on page 13 in [1], that it can be shown that the holonomy goup is a closed Lie subgoup of G is false, in geneal. In fact, S. Kobayashi [5] gave a vey simple counteexample to thei claim: Let H be an open Lie subgoup of a Lie goup G, and let Q be a pincipal H-bundle. Let P be the pincipal G-bundle extending Q. Since H G,we have Q P.That is,qis a pincipal H-subbundle of P. Now, taking a connection in P which defines in the pincipal H-subbundle Q and whose holonomy is H completes the counteexample. So, the point of this

4 868 JIN-HONG KIM lemma is that if the stuctue goup is SU(), then the holonomy goup is always a closed Lie subgoup of SU(). Poof. To pove the lemma, we fist note that evey non-semisimple subalgeba of type A is educible by E. Catan and E. B. Dynkin (e.g., see [), when we use the odinay (o standad) epesentation. So, if the Lie algeba of the holonomy goup H u0 (A), in shot holonomy algeba, is not semisimple, then its centalize would be lage than the cente of SU(), Z. Thus, the holonomy goup is semisimple. Now, the poof follows immediately fom the esult of K. Yosida [11] (see also [6]) that evey connected semisimple Lie subgoup of GL(; C) is closed and the fact that SU() is closed in GL(; C). Poof (Theoem 3.1). We denote by [x 1,...,x ] the matices of the fom 1x1... (x i eal), 1x fo the sake of simplicity. We next define polynomial functions g 1,g,... on the Lie algeba u() by λ λ k t(exp( X)) = t( 1 k!( 1) X k ) k = = k=0 k=0 k=0 λ k k!( 1) k t(x k ) λ k k! g k(x). Then, it can be shown (see Theoem XII..5 in [6]) that g 1,...,g ae algebaically independent and geneate the algeba of polynomial functions on u() invaiant by ad(u()). Let T be the subgoup of U() consisting of diagonal elements. Then, its Lie algeba t consists of the matices of the fom [x 1,...,x ] (x i eal). Note that when esticted to t, the polynomial functions have the following special fom: g k ([x 1,...,x ]) = fo all k. By Lemma 3.3, the holonomy goup H u0 (A) is a compact, connected, semisimple Lie subgoup of SU(). Thus, it emains to pove that the ank of the holonomy goup H u0 (A) islessthanoequalto [. To do this, let l be the Lie algeba of the holonomy goup H u0 (A). Then, if we define an element a in SU()byϕ(u 0 )=u 0 a as in Theoem.1, we have (3.1) j=1 x k j σ(x) =a 1 Xa, X l.

5 CONJUGATE SU()-CONNECTIONS AND HOLONOMY GROUPS 869 Thus, when k is an odd intege (1 k ) it follows fom (3.1) g k (X) =g k (a 1 Xa)=g k (σ(x)) = g k ( X) =g k ( X T )=g k ( X) =( 1) k g k (X) = g k (X), X l. Hence, we obtain (3.) g k (X) =0 fo all X l and all odd integes k (1 k ). Set Z k = {[x 1,...,x ] g k ([x 1,...,x ]) = 0} fo all integes k (1 k ). We will fist estimate the dimension of the complete intesection Z = k=odd 1 k of the algebaic vaieties Z k. To do this, assuming that + 1 is even, it suffices to compute geneically the maximal ank of the following ( ) +1 -matix g 1 g x x g 3 g x x = 3x x g g x 1... x x 1... x It is easy to see fom the Vandemonde fomula that the deteminant of the ( ) +1 ( +1 ) -submatix (3.4) 3x x x 1... x +1 of the matix (3.3) is 3 5 ( 1) ( 1)(+1) 8 (x i x j ), Z k i<j 1 i,j +1 which is not zeo geneically, i.e., the matix (3.4) has ank ( ) +1 geneically. Thus, the dimension of Z is less than o equal to ( ) +1 = 1 [ =. Thecasethatis odd can be shown similaly. On the othe hand, since Z always contains a vecto space of the fom {[x 1, x 1,...,x [, x [ ] x i eal} ( even), o {[x 1, x 1,...,x [, x [,0] x i eal} ( odd), whose dimension is [, we see that the dimension of Z is actually equal to [.

6 870 JIN-HONG KIM Now, let t be a maximal tous of the Lie algeba l. Since the maximal tous t of l can be assumed to be contained in a maximal tous of su() of the fom {[x 1,...,x ] x 1 +x +...+x =0}, the above agument togethe with (3.) shows immediately that t is contained as a vecto space in the complete intesection Z, which implies that the ank of the Lie algeba l is less than o equal to [. This completes the poof. Using Theoem 3.1 and the classification of compact, connected, simple Lie goups of E. Catan, we get the following Theoem 3.5. Let P be a pincipal SU()-bundle ove a simply connected manifold M that is educible to an SO()-subbundle Q. LetA be an ieducible connection in P. Assume that the σ-conjugate connection A σ of A is gauge equivalent to A and that is a positive odd pime intege. If the holonomy goup H u0 (A) is simple and is not isomophic to E 8, F 4,oG,thenH u0 (A)is isomophic to SO(). Remak 3.6. The theoem extends the esult fo = 3 in [3] to all positive odd pime integes. It is not clea to the autho whethe o not thee is an ieducible connection which is gauge equivalent to its conjugate connection and whose holonomy goup is isomophic to E 8, F 4,oG. Poof. Since is odd pime, the cente of the holonomy goup is isomophic eithe to the cente of SU(), Z o to {0}. Fom the classification of compact, simple Lie goups by E. Catan, we have only Lie goups of type A l,b l,c l,d l,e 6,E 7,E 8,F 4 and G. It is also well known (see Theoem II.4.10 and V.6.38 in [9]) that the cente of Lie goups A l,b l,c l,d l,e 6,E 7,E 8,F 4,andG is isomophic to Z l, 0, Z, Z, Z 3, Z, 0, 0, and 0, espectively. Since thee is no compact simple Lie goup whose cente is Z and whose ank is less than o equal to 1, the holonomy goup must be isomophic to B k fo k (1 k ), unless H u0 (A) is isomophic to E 8,F 4,o G. Howeve, if H u0 (A) is isomophic to B k fo 1 k 1, it is easy to see that the centalize of H u0 (A) is stictly lage than Z. Thus, the holonomy goup H u0 (A) mustbe isomophic to B [, unless H u 0 (A) is isomophic to E 8,F 4,oG. This completes the poof. Now, a few concluding emaks ae in ode. Ou ultimate goal of this pogam is to use the above esults to deduce infomation about the geomety of 4-manifolds o the set of stable holomophic stuctues, and so on, as we did in [3]. To do this we fist need to extend above esults to the semisimple case, and we hope that we can deal with these poblems in the futue. Refeences [1] S.K. Donaldson and P.B. Konheime, The Geomety of fou-manifolds, Oxfod Univesity Pess (1994). MR 9a:57036 [ E. B. Dynkin, Semisimple subalgebas of semisimple Lie algebas, Math. Sbonik N. S. 30 (195), ; Ame. Math. Soc. Tans., Se., 6 (1957), MR 13:904c [3] J.H. Kim, Conjugate SU(3)-connections and a mod vanishing theoem, pepint (1998). [4], Conjugate Non-abelian monopoles and Localization of moduli spaces of non-abelian monopoles, pepint (1997). [5] S. Kobayashi, pivate communication.

7 CONJUGATE SU()-CONNECTIONS AND HOLONOMY GROUPS 871 [6] S.Kobayashi and K.Nomizu, Foundations of Diffeential Geomety, Vol I and II, Wiley, New Yok, MR 97c:53001a [7] S. Kobayashi and E. Shinozaki, Conjugate Connections in Pincipal Bundles, Geomety and Topology of Submanifolds VII, Wold Scientific Publ.(1995), MR 98c:53035 [8], Conjugate Connections and Moduli Spaces of Connections, Tokyo J. Math. 0 (1997), MR 98c:53036 [9] M. Mimua and H. Toda, Topology of Lie Goups, I and II, Tans. of Math. Mono. Vol. 91, AMS, MR 9h:55001 [10] J. A. Wolf, Spaces of constant cuvatue, Publish o Peish Inc., [11] K. Yosida, A theoem concening the semi-simple Lie goups, Tohoku Math. J., 43 (1937), Depatment of Mathematics, Univesity of Califonia, Bekeley, Califonia addess: jinkim@math.bekeley.edu Cuent addess: Depatment of Mathematics, 51 Mathematical Sciences, Oklahoma State Univesity, Stillwate, Oklahoma addess: jinkim@math.okstate.edu

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

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

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

Controlled Information Maximization for SOM Knowledge Induced Learning

Controlled Information Maximization for SOM Knowledge Induced Learning 3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity

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

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

Point-Biserial Correlation Analysis of Fuzzy Attributes

Point-Biserial Correlation Analysis of Fuzzy Attributes Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh

More information

Generalized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences

Generalized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences Ameican Jounal of ata ining and Knowledge iscovey 27; 2(4): 2-8 http://www.sciencepublishinggoup.com//admkd doi:.648/.admkd.2724.2 Genealized Gey Taget ecision ethod Based on ecision akes Indiffeence Attibute

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

An Extension to the Local Binary Patterns for Image Retrieval

An Extension to the Local Binary Patterns for Image Retrieval , pp.81-85 http://x.oi.og/10.14257/astl.2014.45.16 An Extension to the Local Binay Pattens fo Image Retieval Zhize Wu, Yu Xia, Shouhong Wan School of Compute Science an Technology, Univesity of Science

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

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

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

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

Intuitionistic Fuzzy Soft N-ideals

Intuitionistic Fuzzy Soft N-ideals Intenational Jounal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 3, Numbe 4 (2013), pp. 259-267 Reseach India Publications http://www.ipublication.com Intuitionistic Fuzzy Soft N-ideals A. Solaiaju

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

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth

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

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

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

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

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

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

(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

Vector calculus in Cartesian and spherical coordinates

Vector calculus in Cartesian and spherical coordinates SageManifolds.0 Vecto calculus in Catesian and spheical coodinates This woksheet illustates some featues of SageManifolds (vesion.0, as included in SageMath 7.5) egading vecto calculus in the Euclidean

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

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

Reader & ReaderT Monad (11A) Young Won Lim 8/20/18

Reader & ReaderT Monad (11A) Young Won Lim 8/20/18 Copyight (c) 2016-2018 Young W. Lim. Pemission is ganted to copy, distibute and/o modify this document unde the tems of the GNU Fee Documentation License, Vesion 1.2 o any late vesion published by the

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

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

A VECTOR PERTURBATION APPROACH TO THE GENERALIZED AIRCRAFT SPARE PARTS GROUPING PROBLEM

A VECTOR PERTURBATION APPROACH TO THE GENERALIZED AIRCRAFT SPARE PARTS GROUPING PROBLEM Accepted fo publication Intenational Jounal of Flexible Automation and Integated Manufactuing. A VECTOR PERTURBATION APPROACH TO THE GENERALIZED AIRCRAFT SPARE PARTS GROUPING PROBLEM Nagiza F. Samatova,

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

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

Assessment of Track Sequence Optimization based on Recorded Field Operations

Assessment of Track Sequence Optimization based on Recorded Field Operations Assessment of Tack Sequence Optimization based on Recoded Field Opeations Matin A. F. Jensen 1,2,*, Claus G. Søensen 1, Dionysis Bochtis 1 1 Aahus Univesity, Faculty of Science and Technology, Depatment

More information

Concomitants of Upper Record Statistics for Bivariate Pseudo Weibull Distribution

Concomitants of Upper Record Statistics for Bivariate Pseudo Weibull Distribution Available at http://pvamuedu/aam Appl Appl Math ISSN: 93-9466 Vol 5, Issue (Decembe ), pp 8 9 (Peviously, Vol 5, Issue, pp 379 388) Applications and Applied Mathematics: An Intenational Jounal (AAM) Concomitants

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

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

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

EYE DIRECTION BY STEREO IMAGE PROCESSING USING CORNEAL REFLECTION ON AN IRIS

EYE DIRECTION BY STEREO IMAGE PROCESSING USING CORNEAL REFLECTION ON AN IRIS EYE DIRECTION BY STEREO IMAGE PROCESSING USING CORNEAL REFLECTION ON AN IRIS Kumiko Tsuji Fukuoka Medical technology Teikyo Univesity 4-3-14 Shin-Katsutachi-Machi Ohmuta Fukuoka 836 Japan email: c746g@wisdomcckyushu-uacjp

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

A Shape-preserving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonuniform Fuzzification Transform

A Shape-preserving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonuniform Fuzzification Transform A Shape-peseving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonunifom Fuzzification Tansfom Felipe Fenández, Julio Gutiéez, Juan Calos Cespo and Gacián Tiviño Dep. Tecnología Fotónica, Facultad

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

IP Multicast Simulation in OPNET

IP Multicast Simulation in OPNET IP Multicast Simulation in OPNET Xin Wang, Chien-Ming Yu, Henning Schulzinne Paul A. Stipe Columbia Univesity Reutes Depatment of Compute Science 88 Pakway Dive South New Yok, New Yok Hauppuage, New Yok

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

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

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

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

Coordinate Systems. Ioannis Rekleitis

Coordinate Systems. Ioannis Rekleitis Coodinate Systems Ioannis ekleitis Position epesentation Position epesentation is: P p p p x y z P CS-417 Intoduction to obotics and Intelligent Systems Oientation epesentations Descibes the otation of

More information

Modelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set

Modelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set Modelling, simulation, and pefomance analysis of a CAN FD system with SAE benchmak based message set Mahmut Tenuh, Panagiotis Oikonomidis, Peiklis Chachalakis, Elias Stipidis Mugla S. K. Univesity, TR;

More information

Parallel processing model for XML parsing

Parallel processing model for XML parsing Recent Reseaches in Communications, Signals and nfomation Technology Paallel pocessing model fo XML pasing ADRANA GEORGEVA Fac. Applied Mathematics and nfomatics Technical Univesity of Sofia, TU-Sofia

More information

Spiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks

Spiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks Spial Recognition Methodology and Its Application fo Recognition of Chinese Bank Checks Hanshen Tang 1, Emmanuel Augustin 2, Ching Y. Suen 1, Olivie Baet 2, Mohamed Cheiet 3 1 Cente fo Patten Recognition

More information

Automatically Testing Interacting Software Components

Automatically Testing Interacting Software Components Automatically Testing Inteacting Softwae Components Leonad Gallaghe Infomation Technology Laboatoy National Institute of Standads and Technology Gaithesbug, MD 20899, USA lgallaghe@nist.gov Jeff Offutt

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

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

On Error Estimation in Runge-Kutta Methods

On Error Estimation in Runge-Kutta Methods Leonado Jounal of Sciences ISSN 1583-0233 Issue 18, Januay-June 2011 p. 1-10 On Eo Estimation in Runge-Kutta Methods Ochoche ABRAHAM 1,*, Gbolahan BOLARIN 2 1 Depatment of Infomation Technology, 2 Depatment

More information

arxiv: v2 [physics.soc-ph] 30 Nov 2016

arxiv: v2 [physics.soc-ph] 30 Nov 2016 Tanspotation dynamics on coupled netwoks with limited bandwidth Ming Li 1,*, Mao-Bin Hu 1, and Bing-Hong Wang 2, axiv:1607.05382v2 [physics.soc-ph] 30 Nov 2016 1 School of Engineeing Science, Univesity

More information

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples Multi-azimuth Pestack Time Migation fo Geneal Anisotopic, Weakly Heteogeneous Media - Field Data Examples S. Beaumont* (EOST/PGS) & W. Söllne (PGS) SUMMARY Multi-azimuth data acquisition has shown benefits

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

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

A Family of Distributed Deadlock Avoidance Protocols and their Reachable State Spaces

A Family of Distributed Deadlock Avoidance Protocols and their Reachable State Spaces A Family of Distibuted Deadlock Avoidance Potocols and thei Reachable State Spaces Césa Sánchez, Henny B. Sipma, and Zoha Manna Compute Science Depatment Stanfod Univesity, Stanfod, CA 94305-9025 {cesa,sipma,manna}@cs.stanfod.edu

More information

User Group testing report

User Group testing report Use Goup testing epot Deliveable No: D6.10 Contact No: Integated Poject No. 506723: SafetyNet Aconym: SafetyNet Title: Building the Euopean Road Safety Obsevatoy Integated Poject, Thematic Pioity 6.2 Sustainable

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

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

Strictly as per the compliance and regulations of:

Strictly as per the compliance and regulations of: Global Jounal of HUMAN SOCIAL SCIENCE Economics Volume 13 Issue Vesion 1.0 Yea 013 Type: Double Blind Pee Reviewed Intenational Reseach Jounal Publishe: Global Jounals Inc. (USA) Online ISSN: 49-460x &

More information

Improvement of First-order Takagi-Sugeno Models Using Local Uniform B-splines 1

Improvement of First-order Takagi-Sugeno Models Using Local Uniform B-splines 1 Impovement of Fist-ode Takagi-Sugeno Models Using Local Unifom B-splines Felipe Fenández, Julio Gutiéez, Gacián Tiviño and Juan Calos Cespo Dep. Tecnología Fotónica, Facultad de Infomática Univesidad Politécnica

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

Information Retrieval. CS630 Representing and Accessing Digital Information. IR Basics. User Task. Basic IR Processes

Information Retrieval. CS630 Representing and Accessing Digital Information. IR Basics. User Task. Basic IR Processes CS630 Repesenting and Accessing Digital Infomation Infomation Retieval: Basics Thosten Joachims Conell Univesity Infomation Retieval Basics Retieval Models Indexing and Pepocessing Data Stuctues ~ 4 lectues

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

SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH

SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH I J C A 7(), 202 pp. 49-53 SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH Sushil Goel and 2 Rajesh Vema Associate Pofesso, Depatment of Compute Science, Dyal Singh College,

More information

A Full-mode FME VLSI Architecture Based on 8x8/4x4 Adaptive Hadamard Transform For QFHD H.264/AVC Encoder

A Full-mode FME VLSI Architecture Based on 8x8/4x4 Adaptive Hadamard Transform For QFHD H.264/AVC Encoder 20 IEEE/IFIP 9th Intenational Confeence on VLSI and System-on-Chip A Full-mode FME VLSI Achitectue Based on 8x8/ Adaptive Hadamad Tansfom Fo QFHD H264/AVC Encode Jialiang Liu, Xinhua Chen College of Infomation

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

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

The EigenRumor Algorithm for Ranking Blogs

The EigenRumor Algorithm for Ranking Blogs he EigenRumo Algoithm fo Ranking Blogs Ko Fujimua N Cybe Solutions Laboatoies N Copoation akafumi Inoue N Cybe Solutions Laboatoies N Copoation Masayuki Sugisaki N Resonant Inc. ABSRAC he advent of easy

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

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

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

TESSELLATIONS. This is a sample (draft) chapter from: MATHEMATICAL OUTPOURINGS. Newsletters and Musings from the St. Mark s Institute of Mathematics TESSELLATIONS This is a sample (daft) chapte fom: MATHEMATICAL OUTPOURINGS Newslettes and Musings fom the St. Mak s Institute of Mathematics James Tanton www.jamestanton.com This mateial was and can still

More information

Query Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented

Query Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented Quey Language #1/3: Relational Algeba Pue, Pocedual, and Set-oiented To expess a quey, we use a set of opeations. Each opeation takes one o moe elations as input paamete (set-oiented). Since each opeation

More information

Pledge: Signature:

Pledge: Signature: S/PM 0 Final Exam 7 May 005 Name: KEY E-mail ID: @viginia.edu Pledge: Signatue: Thee ae 80 minutes 3 hous fo this exam and 80 oints on the test; don t send too long on any one uestion! Thee is an exam

More information

Desired Attitude Angles Design Based on Optimization for Side Window Detection of Kinetic Interceptor *

Desired Attitude Angles Design Based on Optimization for Side Window Detection of Kinetic Interceptor * Poceedings of the 7 th Chinese Contol Confeence July 6-8, 008, Kunming,Yunnan, China Desied Attitude Angles Design Based on Optimization fo Side Window Detection of Kinetic Intecepto * Zhu Bo, Quan Quan,

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

Signal integrity analysis and physically based circuit extraction of a mounted

Signal integrity analysis and physically based circuit extraction of a mounted emc design & softwae Signal integity analysis and physically based cicuit extaction of a mounted SMA connecto A poposed geneal appoach is given fo the definition of an equivalent cicuit with SMAs mounted

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

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

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

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

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

Extract Object Boundaries in Noisy Images using Level Set. Final Report

Extract Object Boundaries in Noisy Images using Level Set. Final Report Extact Object Boundaies in Noisy Images using Level Set by: Quming Zhou Final Repot Submitted to Pofesso Bian Evans EE381K Multidimensional Digital Signal Pocessing May 10, 003 Abstact Finding object contous

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

A Novel Automatic White Balance Method For Digital Still Cameras

A Novel Automatic White Balance Method For Digital Still Cameras A Novel Automatic White Balance Method Fo Digital Still Cameas Ching-Chih Weng 1, Home Chen 1,2, and Chiou-Shann Fuh 3 Depatment of Electical Engineeing, 2 3 Gaduate Institute of Communication Engineeing

More information

User Specified non-bonded potentials in gromacs

User Specified non-bonded potentials in gromacs Use Specified non-bonded potentials in gomacs Apil 8, 2010 1 Intoduction On fist appeaances gomacs, unlike MD codes like LAMMPS o DL POLY, appeas to have vey little flexibility with egads to the fom of

More information

Cardiac C-Arm CT. SNR Enhancement by Combining Multiple Retrospectively Motion Corrected FDK-Like Reconstructions

Cardiac C-Arm CT. SNR Enhancement by Combining Multiple Retrospectively Motion Corrected FDK-Like Reconstructions Cadiac C-Am CT SNR Enhancement by Combining Multiple Retospectively Motion Coected FDK-Like Reconstuctions M. Pümme 1, L. Wigstöm 2,3, R. Fahig 2, G. Lauitsch 4, J. Honegge 1 1 Institute of Patten Recognition,

More information

Fifth Wheel Modelling and Testing

Fifth Wheel Modelling and Testing Fifth heel Modelling and Testing en Masoy Mechanical Engineeing Depatment Floida Atlantic Univesity Boca aton, FL 4 Lois Malaptias IFMA Institut Fancais De Mechanique Advancee ampus De lemont Feand Les

More information

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters Optics and Photonics Jounal, 016, 6, 94-100 Published Online August 016 in SciRes. http://www.scip.og/jounal/opj http://dx.doi.og/10.436/opj.016.68b016 Fequency Domain Appoach fo Face Recognition Using

More information

A Recommender System for Online Personalization in the WUM Applications

A Recommender System for Online Personalization in the WUM Applications A Recommende System fo Online Pesonalization in the WUM Applications Mehdad Jalali 1, Nowati Mustapha 2, Ali Mamat 2, Md. Nasi B Sulaiman 2 Abstact foeseeing of use futue movements and intentions based

More information

A NOVEL VOLUME CT WITH X-RAY ON A TROUGH-LIKE SURFACE AND POINT DETECTORS ON CIRCLE-PLUS-ARC CURVE

A NOVEL VOLUME CT WITH X-RAY ON A TROUGH-LIKE SURFACE AND POINT DETECTORS ON CIRCLE-PLUS-ARC CURVE A NOVEL VOLUME CT WITH X-RAY ON A TROUGH-LIKE SURFACE AND POINT DETECTORS ON CIRCLE-PLUS-ARC CURVE H Xu, and TG Zhuang Depatment of Biomedical Engineeing, Shanghai Jiaotong Univesity, Shanghai, P R China

More information

Computational and Theoretical Analysis of Null Space and Orthogonal Linear Discriminant Analysis

Computational and Theoretical Analysis of Null Space and Orthogonal Linear Discriminant Analysis Jounal of Machine Leaning Reseach 7 2006) 1183 1204 Submitted 12/05; Revised 3/06; Published 7/06 Computational and Theoetical Analysis of Null Space and Othogonal Linea Disciminant Analysis Jieping Ye

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

Effective Data Co-Reduction for Multimedia Similarity Search

Effective Data Co-Reduction for Multimedia Similarity Search Effective Data Co-Reduction fo Multimedia Similaity Seach Zi Huang Heng Tao Shen Jiajun Liu Xiaofang Zhou School of Infomation Technology and Electical Engineeing The Univesity of Queensland, QLD 472,

More information

Switching and Fault Transients of Unit Transformers of a Combined-Cycle Gas Turbine Generator

Switching and Fault Transients of Unit Transformers of a Combined-Cycle Gas Turbine Generator Switching and Fault Tansients of Unit Tansfomes of a Combined-Cycle Gas Tubine Geneato M. Kizilcay, S. Demmig Abstact A new combined-cycle powe plant is to be connected to a 110-kV gid though a powe cable

More information

A Neural Network Model for Storing and Retrieving 2D Images of Rotated 3D Object Using Principal Components

A Neural Network Model for Storing and Retrieving 2D Images of Rotated 3D Object Using Principal Components A Neual Netwok Model fo Stong and Reteving 2D Images of Rotated 3D Object Using Pncipal Components Tsukasa AMANO, Shuichi KUROGI, Ayako EGUCHI, Takeshi NISHIDA, Yasuhio FUCHIKAWA Depatment of Contol Engineeng,

More information