BASIC DIFFERENTIABLE MANIFOLDS AND APPLICATIONS MAPS WITH TRANSLATORS TANGENT AND COTANGENT SPACES

Size: px
Start display at page:

Download "BASIC DIFFERENTIABLE MANIFOLDS AND APPLICATIONS MAPS WITH TRANSLATORS TANGENT AND COTANGENT SPACES"

Transcription

1 IJMMS, Vol., No. -2, (January-December 205): Serals Publcatons ISSN: BASIC DIFFERENTIABLE MANIFOLDS AND APPLICATIONS MAPS WITH TRANSLATORS TANGENT AND COTANGENT SPACES Mohamed M. Osman* Abstract In ths paper of Remannan geometry to pervous of dfferentable manfolds ( M) p whch are used n an essental way n basc concepts of Remannan geometry we study the defectons, examples of the problem of dfferentally proecton mappng parameterzaton (U ) - system by struttng rank k on surfaces n k dmensonal s sub manfolds space of R n, we prove that tree depends only on the doublng charts mappng manfolds, sub manfolds ts quanttatve extrnsc dmenson... INTRODUCTION A manfolds s a generalzaton of curves and surfaces to hgher dmenson, t s Eucldean n {E R } n that every pont has a neghbored, called a chart homeomorphc to an open subset of R n, the coordnates on a chart allow one to carry out computatons as though n a Eucldean space, so that many concepts from R n, such as dfferentablty, pont dervatons, tangents, cotangents spaces, and dfferental forms carry over to a manfold. In ths paper we gven the basc defntons and propertes of a smooth manfold and smooth maps between manfolds, ntally the only way we have to verfy that a space, we descrbe a set of suffcent condtons under whch a quotent topologcal space becomes a manfold s exhbt a collecton of C compatble charts coverng the space becomes a manfold, gvng us a second way to construct manfolds, a topologcal manfolds C analytc manfolds, statng wth topologcal manfolds, whch are Hausdorff second countable s locally Eucldean space, we ntroduce the concept of maxmal C atlas, whch makes a topologcal manfold nto a smooth manfold, a topologcal manfold s a Hausdorff, second countable s local Eucldean of dmenson n, f every pont p n M has a neghborhood * Department of mathematcs faculty of scence Unversty of Al-Baha K.S.A, E-mal: mm.eltngary@hotmal.com

2 26 Mohamed M. Osman U such that there s a homeomorphsm from U onto a open subset of R n, we call the par a coordnate map or coordnate system on U, we sad chart (U, ) s centered at p U, (p) = 0 and we defne the smooth maps f : M N where M, N are dfferental manfolds we wll say that f s smooth f there are atlases (U, h ) on M and (V, g ) on N. 2. TOPOLOGICAL MANIFOLDS In ths secton, the bascally an m-dmensonal topologcal manfold s a topologcal space M whch s locally homeomorphc to R m, defnton s a topologcal space M s called an m-dmensonal (topologcal manfold) f the followng condtons hold () M s a hausdorff space () for any p M there exsts a neghborhood U of P whch s homeomorphc to an open subset V R m () M has a countable bass of open sets, Fgurer () coordnate charts (U, ) Axom () s equvalent to sayng that p M has a open neghborhood U P homeomorphc to open dsc D m n R m, axom () says that M can covered by countable many of such neghborhoods, the coordnate chart (U, ) where U are coordnate neghborhoods or charts and are coordnate homeomorphsms, transtons between dfferent choces of coordnates are called transtons maps =, whch are agan homeomorphsms by defnton, we usually wrte p = (x), : U V R n as coordnates for U, see Fgure (2), and p = (x), : V U M as coordnates for U, the coordnate charts (U, ) are coordnate neghborhoods, or charts, and are coordnate homeomorphsms, transtons between dfferent choces of coordnates are called transtons maps = whch are agan homeomorphsms by defnton, we usually x = (p), : U V R n as a parameterzaton U. A collecton A = {(, U } I of coordnate chart wth M = U s called atlas for M. The transton maps Fgurer (2) a topologcal space M s called ( hausdorff) f for any par p, q M, there exst open neghborhoods p U and q U such that Fgurer : The coordnate charts (U, ) Fgurer 2: : the transton maps

3 Basc Dfferentable Manfolds and Applcatons maps wth U U# for a topologcal space M wth topology U can be wrtten as unon of sets n, a bass s called a countable bass s a countable set. Fgurer 3: Coordnate maps for boundary ponts A topologcal M space s called an m-dmensonal topologcal manfold wth boundary M M f the followng condtons () M s hausdorff space () for any pont p M there exsts a neghborhood U of p whch s homeomorphc to an open subset V H m () M has a countable bass of open sets, Fgure (3) can be rephrased as follows any pont p U s contaned n neghborhood U to D m H m the set M s a locally homeomorphc to R m or H m the boundary M M s subset of M whch conssts of ponts p. Defnton 2. Let X be a set a topology U for X s collecton of X satsfyng () and X are n U () the ntersecton of two members of U s n U () the unon of any number of members U s n U. The set X wth U s called a topologcal space the members U u are called the open sets. let X be a topologcal space a subset N X wth x N s called a neghborhood of x f there s an open set U wth x U N, for example f X a metrc space then the closed ball D (x) and the open ball D (x) are neghborhoods of x a subset C s sad to closed f X / C s open Defnton 2.3 A functon f : X Y between two topologcal spaces s sad to be contnuous f for every open set U of Y the pre-mage f (U) s open n X. Defnton 2.4 Let X and Y be topologcal spaces we say that X and Y are homeomorphc f there exst contnuous functon f : X Y, g : Y X such that f g = d y and g f = d x we wrte X Y and say that f and g are homeomorphsms between X and Y, by the defnton a functon f : X Y s a homeomorphsms f and only f () f s a bectve () f s contnuous () f s also contnuous. 3. DIFFERENTIABLE MANIFOLDS A dfferentable manfolds s necessary for extendng the methods of dfferental calculus to spaces more general R n a subset S R 3 s regular surface f for every

4 28 Mohamed M. Osman pont p S the a neghborhood V of P s R 3 and mappng x : u R 2 V S open set U R 2 such that () x s dfferentable homomorphsm () the dfferentable (dx) q : R 2 R 3, the mappng x s called a parametnzaton of S at P the mportant consequence of dfferentable of regular surface s the fact that the transton also example below f x : U S and x : U S are x (U ) x (U ) = w #, the mappngs x x : x (w) R 2 and Are dfferentable Fgure (4) x x : x (w) R (3.) Fgure 4: a dfferentable structure on M A dfferentable structure on a set M nduces a natural topology on M t suffces to A M to be an open M set n f and only f x (A x (U )) s an open set n R n for all t s easy to verfy that M and the empty set are open sets that a unon of open sets s agan set and that the fnte ntersecton of open sets remans an open set. Manfold s necessary for the methods of dfferental calculus to spaces more general than de R n, a dfferental structure on a manfolds M nduces a dfferental structure on every open subset of M, n partcular wrtng the entres of an n k matrx n successon dentfes the set of all matrces wth R n,k, an n k matrx of rank k can be vewed as a k-frame that s set of k lnearly ndependent vectors n R n, V n,k K n s called the steels manfold,the general lnear group GL (n) by the foregong V n,k s dfferental structure on the group n of orthogonal matrces, we defne the smooth maps functon f : M N where M, N are dfferental manfolds we wll say that f s smooth f there are atlases (U, h ) on M, (V B, g B ) on N, such that the maps g B f h are smooth wherever they are defned f s a homeomorphsm f s smooth and a smooth nverse. A dfferentable structures s topologcal s a manfold t an open coverng U where each set U s homeoomorphc, va some homeomorphsm h to an open subset of Eucldean space R n, let M be a topologcal

5 Basc Dfferentable Manfolds and Applcatons maps wth space, a chart n M conssts of an open subset U M and a homeomorphsm h of U onto an open subset of R m, a C r atlas on M s a collecton (U, h )of charts such that theu cover M and h B, h the dfferentable vector felds on a dfferentable manfold M, let X and Y be a dfferentable vector feld on a dfferentable manfolds M then there exsts a unque vector feld Z such that such that, for all f D, Zf = (XY YX) f f that p M and let x : U M be a parameterzaton at p and X a, y a x y f f XYf X b, YXf Y a x x Therefore Z s gven n the parameterzaton x by z. (3.2) Z f = (X Y f Y X F), b a a b, x x Are dfferentable ths a regular surface s ntersect from one to other can be made n a dfferentable manner the defect of the defnton of regular surface s ts dependence on R 3. A dfferentable manfold s locally homeomorphc to R n the fundamental theorem on exstence, unqueness and dependence on ntal condtons of ordnary dfferental equatons whch s a local theorem extends naturally to dfferentable manfolds. For famlar wth dfferental equatons can assume the statement below whch s all that we need for example X be a dfferentable on a dfferentable manfold M and p M then there exst a neghborhood p M and U p M an nter (, ), 0, and a dfferentable mappng : (, ) U M such that curve t (t, q) and (0, q) = q a curve :(, ) M whch satsfes the condtons (t) = X ((t)) and (0) = q s called a traectory of the feld X that passes through q for t = 0. A dfferentable manfold of dmenson N s a set M and a famly of nectve mappng x R n M of open sets u R n nto M such that () u x (u ) = M () for any, wth x (u ) x (u ) () the famly (u, x ) s maxmal relatve to condtons (), () the par (u, x ) or the mappng x wth p x (u ) s called a parameterzaton, or system of coordnates of M, u x (u ) = M the coordnate charts (U, ) where U are coordnate neghborhoods or charts, and are coordnate homeomorphsms transtons are between dfferent choces of coordnates are called transtons maps, : (3.3)

6 30 Mohamed M. Osman Whch are anse homeomorphsms by defnton, we usually wrte x = (p), : U V R n collecton U and p = (x), : V U M for coordnate charts wth s M = U called an atlas for M of topologcal manfolds. A topologcal manfold M for whch the transton maps, = ( )for all pars, n the atlas are homeomorphsms s called a dfferentable, or smooth manfold, the transton maps are mappng between open subset of R m, homeomorphsms between open subsets of R m are C maps whose nverses are also C maps, for two charts U and U the transtons mappng, = : (U U ) (U U ) (3.4) And as such are homeomophsms between these open of R m, for example the dfferentablty ( ) s acheved the mappng ( ) and ( ) whch are homeomorphsms snce (A A) by assumpton ths establshes the equvalence (A A), for example let N and M be smooth manfolds n and m respecpectvely, and let f : N M be smooth mappng n local coordnates f = ( f ): (U) (V) Fgurer (5), wth respects charts (U, ) and (V, ), the rank of f at p N s defned as the rank of fat (p)(.e) rk(f) p = rk (J f) (p) s the Jacobean of f at p ths defnton s ndependent of the chosen chart, the commutatve dagram n that f ( ) f ( ) (3.5) Fgurer 5: coordnate maps the cone C Snce ( ) and ( ) are homeomorphsms t easly follows that whch show that our noton of rank s well defned (J f) x = J( ) y J f( ), f a map has constant rank for all p N we smply wrte rk (f), these are called constant rank mappng. The product two manfolds M and be two C k -manfolds of dmenson n and n 2 respectvely the topologcal space M are arbtral unons of sets of the form U V where U s open n M and V s open n, can be gven the structure C k manfolds of dmenson n, n 2 by defnng charts as follows for any charts M on (V, )on we declare that (U V, ) (s chart on M where :

7 Basc Dfferentable Manfolds and Applcatons maps wth... 3 U V R (n +n 2 ) s defned so that (p, q) = ( (p), (q)) for all (p, q) U V. A gven a C k n-atlas, A on M for any other chart (U, ) we say that (U, ) s compatble wth the atlas A f every map ( ) and ( ) s C k whenever U U # 0 the two atlases A and A s compatble f every chart of one s compatble wth other atlas see Fgure (6) Fgurer 6: coordnate dfeomorphsms = and = A sub manfolds of others of R n for nstance S 2 s sub manfolds of R 3 t can be obtaned as the mage of map nto R 3 or as the level set of functon wth doman R 3 we shall examne both methods below frst to develop the basc concepts of the theory of Remannan sub manfolds and then to use these concepts to derve a equanttve nterpretaton of curvature tensor, some basc defntons and termnology concernng sub manfolds, we defne a tensor feld called the second fundamental form whch measures the way a sub manfold curves wth the ambent manfold, for example X be a sub manfold of Y of : E X and g : E Y be two vector brndled and assume that E s compressble, let f : E Y and g : E Y be two tubular neghborhoods of X n Y then there exsts a C p. 4. DIFFERENTIABLE MANIFOLDS TANGENT SPACE In ths secton s defned tangent space to level surface be a curve s n R n, :t ( (t), 2 (t),..., n (t)) a curve can be descrbed as vector valued functon converse a vector valued functon gven cur ve, the tangent lne at the pont dt dt dt n d d d ( t) t0..., t0 we many k bout smooth curves that s curves wth all contnuous hgher dervatves cons the level surface f(x, x 2,..., x n ) = c of a dfferentable functon f where x to th coordnate the gradent vector of f at

8 32 Mohamed M. Osman f pont P = x (P) x 2 (P),..., x n (P) s,..., f f n x x s gven a vector u = (u,..., f f u n ) the drecton dervatve Du f f u u u x x surface f(x, x 2,..., x n ) the tangent s gven by equaton. f x f x n..., n n n ( P)( x x )( P)... ( P)( x x )( P) 0 n the pont P on level (4.) For the geometrc vews the tangent space shout consst of all tangent to smooth curves the pont P, assume that s curve through t = t 0 s the level surface f(x, x 2,..., x n ) = c, f( (t), 2 (t),..., n (t) = c by takng dervatves on both f f n ( P)( ( t 0 )... ( P) ( t)) 0 n and so the tangent lne of s really normal x x orthogonal to f, where runs over all possble curves on the level surface through the pont P. The surface M be a C manfold of dmenson n wth k the most ntutve to defne tangent vectors s to use curves, p M be any pont on M and let : ]-, [ M be a C curve passng through p that s wth (M) = p unfortunately f M s not embedded n any R N the dervatve (M) does not make sense, however for any chart (U, ) at p the map ( ) at a C curve n R n and tangent vector v = ( v) / (M) s wll defned the trouble s that dfferent curves the same v gven a smooth mappng f : N M we can defne how tangent vectors n T p N are mapped to tangent vectors n T q M wth (U, ) choose charts q = f(p) for p N and (V, ) for q M we defne the tangent map or flash-forward of f as a gven tangent vector X p = []T p N and d f * : T p M, f * ([]=[f ]). A tangent vector at a pont p n a manfold M s a dervaton at p, ust as for R n the tangent at pont p form a vector space T p (M) called the tangent space of M at p, we also wrte T p (M) a dfferental of map f : N M be a C map between two manfolds at each pont p N the map F nduce a lnear map of tangent space called ts dfferental at p, F * : T p N T F(p) N as follows t X p T p N then F * (X p ) s the tangent vector n T F(p) M defned see Fgurer (7) (F * (X p )) f = X p (f F) R, f C (M)` (4.2) The tangent vectors gven any C -manfold M of dmenson n wth k for any p M, tangent vector to M at p s any equvalence class of C -curves through p on M modulo the equvalence relaton defned n the set of all tangent vectors at p s denoted by T p M we wll show that T p M s a vector space of dmenson n of m. The tangent space T p M s defned as the vector space spanned by the tangents at p to

9 Basc Dfferentable Manfolds and Applcatons maps wth Fgurer 7: coordnate representaton for f wth f(u) V all curves passng through pont p n the manfold M, and the cotangent T * p M of a manfold at p M s defned as the dual vector space to the tangent space T p M, we take the bass vectors E x for T M and we wrte the bass vectors p T* M as p the dfferental lne elements e = dx thus the nner product s gven by / x, dx. Defnton 4. Let M and be dfferentable manfolds a mappng : M s a dfferentable f t s dfferentable, obectve and ts nverse s dffeomorphsm f t s dfferentable s sad to be a local dffeomorphsm at p M f there exst neghborhoods U of p and V of (p)such that : U V s a dffeomorphsm, the noton of dffeomorphsm s the natural dea of equvalence between dfferentable manfolds, ts an mmedate consequence of the chan rule that f : M s a dffeomorphsm then d : T p M T (p) (4.5) Is an somorphsm for all : M n partcular, the dmensons of M and are equal a local converse to ths fact s the followng d : T p M T (p) s an somorphsm then s a local dffeomorphsm at p from an mmedate applcaton of nverse functon n R n, for example be gven a manfold structure agan A mappng f : M N n ths case the manfolds N and M are sad to be homeomorphsm, usng charts (U, ) and (V, ) for N and M respectvely we can gve a coordnate expresson f : M N Defnton 4.2 Let M and M be dfferentable manfolds and let : M 2 be dfferentable mappng for every P M and for each v T p M choose a dfferentable curve : (, ) M wth (M) = p and (0) = v take = the

10 34 Mohamed M. Osman mappng d p : T (p) by gven by d (v) = (M) s lne of and M M 2 be a dfferentable mappng and at p M be such d : T p M T s an somorphsm then s a local homeomorphsm. n m Proposton 4.3 Let M and M be dfferentable manfolds and let : M be a dfferentable mappng, for every p M and for each v T p M choose a dfferentable curve : (, ) M wth (0) = p, (0) = v take = the mappng d : T p M T (p) gven by d p (v) = (0) s a lnear mappng that dose not depend on the choce of see Fgurer (8) Fgurer 8: y x Theorem 4.4 Let G be le group of matrces and suppose that log defnes a coordnate chart the near the dentty element of G, dentfy the tangent space g = T G at the dentty element wth a lnear subspace of matrces, va the log and then a le algebra wth [B, B 2 ] = B B 2 B, B the space g s called the le algebra of G 2 Proof: It suffces to show that for every two matrces B, B 2 g the [B, B 2 ] s also an element of g as [B, B 2 ] s clearly ant commutatve and the (Jacobs dentty) holds for A(t) = (B t) exp (B 2 t) exp ( B t) exp ( B 2 t) exp (4.6) Defne for [t] wth suffcently small a path A(T) n G such that A(O) = I usng for each factor the local formula (Bt) exp = I + Bt +/2 B 2 t 2 + O (t 2 ) A(t) = I + [B, B 2 ]t 2 + O(t), t 0 (4.7) hence B(t) = log A(t) = [B, B 2 ]t 2 + O (t 2 ) exp B(t) = A(t) hold for any suffcently that le bracket [B, B 2 ] g on algebra s an nfntesmal verson of the commutaton (g, g ) ( g, g ) n the correspondng (le group). 2 Theorem 4.5 The tangent bundle TM has a canoncal dfferentable structure makng t nto a smooth 2N-dmensonal manfold, where N = dm. The charts dentfy

11 Basc Dfferentable Manfolds and Applcatons maps wth any U p U(T p M) (TM) for an coordnate neghborhood U M, wth U R n that s hausdorff and second countable s called (The manfold of tangent vectors) Defnton 4.6 A smooth vectors felds on manfolds M s map X : M TM such that () X(P) T p M for every G () n every chart X s expressed as a (/ x ) wth coeffcents a (x) smooth functons of the local coordnates x. Theorem 4.7 Suppose that on a smooth manfold M of dmenson n there exst n vector felds (x (), x (2),..., x (n),) for a bass of T p M at every pont p of m, then T p M s somorphc to M R n m here somorphc means that TM and M R n are homeomorphsm as smooth manfolds and for every p M, the homeomorphsm restrcts to between the tangent space T p M and vector space {P } R n. Proof: defne : a T p M TM on other hand, for any M R n for some a R now defne : a TM [( s ) : (a,..., a n ) M R n ] s t clear from the constructon and the hypotheses of theorem that and are smooth usng an arbtrary chart : U M R n and correspondng chart 5 CONCLUSION (a) (b) T: (U) TM R n R m (4.8) The paper study a manfolds s a generalzaton of curves and surfaces, locally Eucldean {E n } n every pont has a neghbored s called a chart homeomorphc, so that many concepts from R n as dfferentablty manfolds. In ths paper we gve the basc defntons, theorems and propertes of smooth topologcal be comes a manfold s to exhbt a collecton of C s compatble charts (c) The tangent, cotangent vector space manfold of dmenson k wth k the most ntutve method to defne tangent vectors to use curves, tangent space T p M and tangent space at some pont p M the cotangent defnes as dual vector space of p M. References * Tp M s [] R.C.A.M van der vorst soluton manual Dr. G. J. Rdderbos,htt//creatveommons.org/ sprng 94305(202),secnd a letter to creatve commons, 559 Nathan a bbott, way, Stanford,Calforna. [2] J.Cao, M.C. shaw and L.wang estmates for the -Neumann problem and nonexstence of c 2 lev-flat hypersurfaces n p n, Math. Z.248 (2004), [3] T.W. Lorng An ntroducton to manfolds, second edton sprng 94303(202),secnd a letter to creatve commons, 559 Nathan Abbott,Way, Stanford Calforna.

12 36 Mohamed M. Osman [4] R. Arens, Topologes for homeomorphsm groups Amer, Jour. Math. 68(946), [5] Sergelang,dfferental manfolds, Addson wesley pubshng. In (972). [6] O. Abelkader, and S. Saber, soluton to -equaton wth exact support on pseudoconvex manfolds, Int. J. Geom. Meth. phys. 4(2007), [7] Yozo matsushma, dfferentable manfolds, Translated by E.T.Kobayash, Marcel Dekker Inc. Now York and Beesl (972). [8] J. Mlnor, constructon of unversal boundless II, Ann.Math. 63(956), [9] Bertschng E, Eeserved A.R.-Introducton to tensor calculus for general Relatvtysprng (999). [0] K.A. Anton-dfferental manfolds-department of mathematcs-new Brunswk, New ersey copyrght 993-Inc. bblographcal references ISBN (992). [] H.Ngel dfferentable C 3.Ib( 202). [2] K.V. Rchard, S.M. sdore Math. Theory and Applcatons, Boston, mass QA649C293 (992).

13

Math Homotopy Theory Additional notes

Math 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 information

ALEKSANDROV URYSOHN COMPACTNESS CRITERION ON INTUITIONISTIC FUZZY S * STRUCTURE SPACE

ALEKSANDROV URYSOHN COMPACTNESS CRITERION ON INTUITIONISTIC FUZZY S * STRUCTURE SPACE mercan Journal of Mathematcs and cences Vol. 5, No., (January-December, 206) Copyrght Mnd Reader Publcatons IN No: 2250-302 www.journalshub.com LEKNDROV URYOHN COMPCTNE CRITERION ON INTUITIONITIC FUZZY

More information

Semi - - Connectedness in Bitopological Spaces

Semi - - 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 information

b * -Open Sets in Bispaces

b * -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 information

A NOTE ON FUZZY CLOSURE OF A FUZZY SET

A NOTE ON FUZZY CLOSURE OF A FUZZY SET (JPMNT) Journal of Process Management New Technologes, Internatonal A NOTE ON FUZZY CLOSURE OF A FUZZY SET Bhmraj Basumatary Department of Mathematcal Scences, Bodoland Unversty, Kokrajhar, Assam, Inda,

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite 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 information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For 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 information

UNIT 2 : INEQUALITIES AND CONVEX SETS

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 information

Line geometry, according to the principles of Grassmann s theory of extensions. By E. Müller in Vienna.

Line geometry, according to the principles of Grassmann s theory of extensions. By E. Müller in Vienna. De Lnengeometre nach den Prnzpen der Grassmanschen Ausdehnungslehre, Monastshefte f. Mathematk u. Physk, II (89), 67-90. Lne geometry, accordng to the prncples of Grassmann s theory of extensons. By E.

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.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 information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting 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 information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler 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 information

Chapter 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 information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x 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 information

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An 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 information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R 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 information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Some kinds of fuzzy connected and fuzzy continuous functions

Some 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 information

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

Harmonic Coordinates for Character Articulation PIXAR

Harmonic Coordinates for Character Articulation PIXAR Harmonc Coordnates for Character Artculaton PIXAR Pushkar Josh Mark Meyer Tony DeRose Bran Green Tom Sanock We have a complex source mesh nsde of a smpler cage mesh We want vertex deformatons appled to

More information

A Note on Quasi-coincidence for Fuzzy Points of Fuzzy Topology on the Basis of Reference Function

A Note on Quasi-coincidence for Fuzzy Points of Fuzzy Topology on the Basis of Reference Function I.J. Mathematcal Scences and Computng, 2016, 3, 49-57 Publshed Onlne July 2016 n MECS (http://www.mecs-press.net) DOI: 10.5815/jmsc.2016.03.05 Avalable onlne at http://www.mecs-press.net/jmsc A Note on

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On 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 information

CHAPTER 2 DECOMPOSITION OF GRAPHS

CHAPTER 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 information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

Cordial and 3-Equitable Labeling for Some Star Related Graphs

Cordial 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 information

Support Vector Machines

Support 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 information

Convex Fuzzy Set, Balanced Fuzzy Set, and Absolute Convex Fuzzy Set in a Fuzzy Vector Space

Convex Fuzzy Set, Balanced Fuzzy Set, and Absolute Convex Fuzzy Set in a Fuzzy Vector Space IOSR Journal of Mathematcs (IOSR-JM) e-issn: 2278-5728, p-issn: 239-765X. Volume 2, Issue 2 Ver. VI (Mar. - pr. 206), PP 7-24 www.osrjournals.org Conve Fuzzy Set, alanced Fuzzy Set, and bsolute Conve Fuzzy

More information

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

An 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 information

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm

Non-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 information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Lecture 5: Probability Distributions. Random Variables

Lecture 5: Probability Distributions. Random Variables Lecture 5: Probablty Dstrbutons Random Varables Probablty Dstrbutons Dscrete Random Varables Contnuous Random Varables and ther Dstrbutons Dscrete Jont Dstrbutons Contnuous Jont Dstrbutons Independent

More information

S1 Note. Basis functions.

S1 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 information

Structure from Motion

Structure from Motion Structure from Moton Structure from Moton For now, statc scene and movng camera Equvalentl, rgdl movng scene and statc camera Lmtng case of stereo wth man cameras Lmtng case of multvew camera calbraton

More information

Introduction. Leslie Lamports Time, Clocks & the Ordering of Events in a Distributed System. Overview. Introduction Concepts: Time

Introduction. Leslie Lamports Time, Clocks & the Ordering of Events in a Distributed System. Overview. Introduction Concepts: Time Lesle Laports e, locks & the Orderng of Events n a Dstrbuted Syste Joseph Sprng Departent of oputer Scence Dstrbuted Systes and Securty Overvew Introducton he artal Orderng Logcal locks Orderng the Events

More information

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON 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 information

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Dynamic wetting property investigation of AFM tips in micro/nanoscale Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Computational Geometry: Theory and Applications

Computational Geometry: Theory and Applications JID:COMGEO AID:1238 /FLA [m3g; v 1.87; Prn:22/11/2012; 15:16] P.1 (1-25) Computatonal Geometry ( ) Contents lsts avalable at ScVerse ScenceDrect Computatonal Geometry: Theory and Applcatons www.elsever.com/locate/comgeo

More information

Ramsey numbers of cubes versus cliques

Ramsey 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 information

arxiv: v1 [math.ds] 3 Feb 2010

arxiv: 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 information

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Solitary 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 information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical 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 information

such that is accepted of states in , where Finite Automata Lecture 2-1: Regular Languages be an FA. A string is the transition function,

such that is accepted of states in , where Finite Automata Lecture 2-1: Regular Languages be an FA. A string is the transition function, * Lecture - Regular Languages S Lecture - Fnte Automata where A fnte automaton s a -tuple s a fnte set called the states s a fnte set called the alphabet s the transton functon s the ntal state s the set

More information

Introduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2

Introduction 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 information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

A new paradigm of fuzzy control point in space curve

A new paradigm of fuzzy control point in space curve MATEMATIKA, 2016, Volume 32, Number 2, 153 159 c Penerbt UTM Press All rghts reserved A new paradgm of fuzzy control pont n space curve 1 Abd Fatah Wahab, 2 Mohd Sallehuddn Husan and 3 Mohammad Izat Emr

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

i v v 6 i 2 i 3 v + (1) (2) (3) (4) (5) Substituting (4) and (5) into (3) (6) = 2 (7) (5) and (6) (8) (4) and (6) ˆ

i v v 6 i 2 i 3 v + (1) (2) (3) (4) (5) Substituting (4) and (5) into (3) (6) = 2 (7) (5) and (6) (8) (4) and (6) ˆ 5V 6 v 6 î v v Ω î Ω v v 8Ω V î v 5 6Ω 5 Mesh : 6ˆ ˆ = Mesh : ˆ 8ˆ = Mesh : ˆ ˆ ˆ 8 0 = 5 Solvng ˆ ˆ ˆ from () = Solvng ˆ ˆ ˆ from () = 7 7 Substtutng () and (5) nto () (5) and (6) 9 ˆ = A 8 ˆ = A 0 ()

More information

A SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES

A SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES A SYSOLIC APPROACH O LOOP PARIIONING AND MAPPING INO FIXED SIZE DISRIBUED MEMORY ARCHIECURES Ioanns Drosts, Nektaros Kozrs, George Papakonstantnou and Panayots sanakas Natonal echncal Unversty of Athens

More information

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law) Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes

More information

NETWORKS of dynamical systems appear in a variety of

NETWORKS of dynamical systems appear in a variety of Necessary and Suffcent Topologcal Condtons for Identfablty of Dynamcal Networks Henk J. van Waarde, Petro Tes, and M. Kanat Camlbel arxv:807.09v [math.oc] 2 Jul 208 Abstract Ths paper deals wth dynamcal

More information

PROPERTIES OF BIPOLAR FUZZY GRAPHS

PROPERTIES OF BIPOLAR FUZZY GRAPHS Internatonal ournal of Mechancal Engneerng and Technology (IMET) Volume 9, Issue 1, December 018, pp. 57 56, rtcle ID: IMET_09_1_056 valable onlne at http://www.a aeme.com/jmet/ssues.asp?typeimet&vtype

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A 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 information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 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 information

Analysis of Continuous Beams in General

Analysis 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 information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-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 information

DISTRIBUTED POSE AVERAGING IN CAMERA SENSOR NETWORKS USING CONSENSUS ON MANIFOLDS

DISTRIBUTED POSE AVERAGING IN CAMERA SENSOR NETWORKS USING CONSENSUS ON MANIFOLDS DISTRIBUTED POSE AVERAGING IN CAMERA SENSOR NETWORKS USING CONSENSUS ON MANIFOLDS Roberto Tron, René Vdal Johns Hopns Unversty Center for Imagng Scence 32B Clar Hall, 34 N. Charles St., Baltmore MD 21218,

More information

International Journal of Scientific & Engineering Research, Volume 7, Issue 5, May ISSN Some Polygonal Sum Labeling of Bistar

International 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 information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane 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

More information

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing 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 information

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF

APPLICATION 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 information

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell Module 6: FEM for Plates and Shells Lecture 6: Fnte Element Analyss of Shell 3 6.6. Introducton A shell s a curved surface, whch by vrtue of ther shape can wthstand both membrane and bendng forces. A shell

More information

Bridges and cut-vertices of Intuitionistic Fuzzy Graph Structure

Bridges 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 information

Optimal Quadrilateral Finite Elements on Polygonal Domains

Optimal Quadrilateral Finite Elements on Polygonal Domains J Sc Comput (2017) 70:60 84 DOI 10.1007/s10915-016-0242-5 Optmal Quadrlateral Fnte Elements on Polygonal Domans Hengguang L 1 Qnghu Zhang 2 Receved: 30 January 2015 / Revsed: 21 January 2016 / Accepted:

More information

Wavefront Reconstructor

Wavefront Reconstructor A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes

More information

the 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

the 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 information

Machine Learning 9. week

Machine Learning 9. week Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below

More information

Querying by sketch geographical databases. Yu Han 1, a *

Querying by sketch geographical databases. Yu Han 1, a * 4th Internatonal Conference on Sensors, Measurement and Intellgent Materals (ICSMIM 2015) Queryng by sketch geographcal databases Yu Han 1, a * 1 Department of Basc Courses, Shenyang Insttute of Artllery,

More information

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

More information

Cell Count Method on a Network with SANET

Cell 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 information

A Unified, Integral Construction For Coordinates Over Closed Curves

A Unified, Integral Construction For Coordinates Over Closed Curves A Unfed, Integral Constructon For Coordnates Over Closed Curves Schaefer S., Ju T. and Warren J. Abstract We propose a smple generalzaton of Shephard s nterpolaton to pecewse smooth, convex closed curves

More information

The Erdős Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces

The 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 information

An Optimal Algorithm for Prufer Codes *

An 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 information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content 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 information

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain

AMath 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 information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

Complex 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. 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 information

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

The 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 information

arxiv: v2 [math.ds] 3 May 2016

arxiv: 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 information

Classification / Regression Support Vector Machines

Classification / Regression Support Vector Machines Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM

More information

Research Article Quasi-Bézier Curves with Shape Parameters

Research Article Quasi-Bézier Curves with Shape Parameters Hndaw Publshng Corporaton Appled Mathematcs Volume 3, Artcle ID 739, 9 pages http://dxdoorg/55/3/739 Research Artcle Quas-Bézer Curves wth Shape Parameters Jun Chen Faculty of Scence, Nngbo Unversty of

More information

Clustering on antimatroids and convex geometries

Clustering on antimatroids and convex geometries Clusterng on antmatrods and convex geometres YULIA KEMPNER 1, ILYA MUCNIK 2 1 Department of Computer cence olon Academc Insttute of Technology 52 Golomb tr., P.O. Box 305, olon 58102 IRAEL 2 Department

More information

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Optimization 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 information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Rough Neutrosophic Multisets Relation with Application in Marketing Strategy

Rough Neutrosophic Multisets Relation with Application in Marketing Strategy Neutrosophc Sets and Systems, Vol. 21, 2018 Unversty of New Mexco 36 Rough Neutrosophc Multsets Relaton wth Applcaton n Marketng Strategy Surana Alas 1, Daud Mohamad 2, and Adbah Shub 3 1 Faculty of Computer

More information

Ontology Generator from Relational Database Based on Jena

Ontology Generator from Relational Database Based on Jena Computer and Informaton Scence Vol. 3, No. 2; May 2010 Ontology Generator from Relatonal Database Based on Jena Shufeng Zhou (Correspondng author) College of Mathematcs Scence, Laocheng Unversty No.34

More information

Adaptive Fairing of Surface Meshes by Geometric Diffusion

Adaptive Fairing of Surface Meshes by Geometric Diffusion Adaptve Farng of Surface Meshes by Geometrc Dffuson Chandrajt L. Bajaj Department of Computer Scences, Unversty of Texas, Austn, TX 78712 Emal: bajaj@cs.utexas.edu Guolang Xu State Key Lab. of Scentfc

More information

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

More information

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6) Harvard Unversty CS 101 Fall 2005, Shmon Schocken Assembler Elements of Computng Systems 1 Assembler (Ch. 6) Why care about assemblers? Because Assemblers employ some nfty trcks Assemblers are the frst

More information