UNIT 2 : INEQUALITIES AND CONVEX SETS

Size: px
Start display at page:

Download "UNIT 2 : INEQUALITIES AND CONVEX SETS"

Transcription

1 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 2.4 Summary

2 , : Lnear Programmng 2. NTRODUCTON h n a lnear programmng problem, we have constrants expressed n the form of lnear nequaltes. Therefore, to study lnear programmng, you must know the system of lnear nequaltes partcularly ther graphcal solutons. n ths unt we shall confne our dscusson to the graphcal solutons of nqualtes.,closely lnked wth the system of lnear nequaltes s the theory of convex sets. Ths theory has very mportant applcatons not only n lnear programmng but also n Economcs, Game Theory etc. ~ uto e these applcatons, a great deal of work has been done to develop the theory of Convex Sets. Thus, n ths unt, we dsucss the nequaltes and Convex Sets. n addton, we need the noton of Extreme Ponts, Hyper-plane and Half- Spaces. These notons wll be defned and explaned wth the help of some smple examples. Objectves After studyng ths unt, you should be able to draw the graph of the nequaltes and fnd ther solutons l defne a convex set and gve ts geometrcal descrpton defne an extreme pont, a hyper plane and a half space along wth ~ er graphcal llustratons. 2.2 NEQUALTES AND THER GRAPHS You are already famlar wth the concepts of lnes and ntersecton of lnes n a plane. You know that a general equaton of a lne s ax +by = c, where a, by c are real constants. t s also called a lnear equaton n two varables x and y. f we put y = 0, we get x = c/a, provded a ;t 0. Ths s the ntercept of the lne on X-axs. Smlarly on takng x = 0, we get - --!/ as the ntercept on Y-axs. By jonng the ponts (f. 0 and 0,, a # 0, b + 0. ) we an trace the lne on the graph paper..- For example consder the lqe 3x + 2y = ,

3 Draw ths lne on a graph paper as shown n Fgure. nequaltes and Convex - Sets Ths lne dvdes the plane nl.,,me sets or regons as shown n the fgure. These regons may be descrbed as follows: () The set of ponts (x~y) such that,.e. those ponts whch le on the lne. (Ch you gve a pont whch les o~ ths lne?) () The set of ponts (x, y) such that. \ 3x + 2 ~ ~ 6..For example the pont (0, 0) s such that = 0 < 6 Agan the pont (, ) s such that,., =5<6 The set of ponts (x, y) for whch 3x+2y<6,

4 .J Basc Mathematcs and s called the half plane bounded by the lne Optmzaton r 3x+2y=6. () The set of ponts (x, y) such that 3x + 2y > 6. For example, consder the ponts You can see that (3,, (92. x = 0 and y = 0. 5(0) + 8(0) = Note that the nequalty represents the set of ponts (x, y) whch ether le on the lne 3x + 2y = 6 or ' belong to the half plane 3x+2y<6. Smlarly, the nequalty 3x+2y26 ' represents the set of ponts (x, y) whch ether le on the lne 3x + 2y = 6 or belong to the half plane 3x + 2y > 6. Most of the nequaltes that we study n ths unt wll be of the form,! n general we can say that a lne ax + by = c $ : *, dvdes the XY plane nto three regons namely () the set of ponts (x, y) such that, ax + by = c, that s the lne tself; 42. 4d

5 () the set of ponts (x, y) such that ' Lnear Programmng.e. one of the the half planes bounded by the lne; () the set of ponts (x, y) such that ax +by > c, the other half plane bounded by the lne. Y For example, let us try to draw the graph of the nequalty Frst consder the lne. f we take y = 0, then x = 4. f x = 0, they y = 5/2. Therefore, we can trace the lne by jonng the ponts (4,O) and (0, 5/2). Let us now determne the locaton of the half-plane. For ths, we put Ths shows that x=oandy=o. 5(0) + 90) = e s that half Fg. 2

6 Basc Mathc~atcs and Optmzaton plane n whch orgn does not le. Hence the shaded porton as shown n the fgure 2, represents' Let us consder now another example n whch we have more than one nequalty. At fst we wll be takng a smple case of three nequaltes. EXAMPLE : Graph the set of ponts (x, y) satsfyng the followng three nequaltes : and A = ((x, y) : 5x + 3y 2 5) B= ((x, y):x2o) SOLUTON : snce these nequaltes must be satsfed smultaneously, the desred set s the ntersecton of the three sets. The set A n B n C s the area whch s shaded and bounded by the lnet

7 You can note that the shaded regon conssts of the ponts lyng only n the ft quadrant due to the restrctons x2oandy20. nequaltes Convex ~ Qts ), ' EXAMPLE 2 : Graph the set of ponts whch satsfy the nequaltes x 2 and 3x + 4y 2 SOLUTON : You can draw the lne x =, whch s a vertcal lne tbugh the pont (,O). The lne s the lne jonng the ponts (4,O) and (0, 3). The set s shaded wth horzontal lnes and the set B= ((x,y)3x+4y<2) s the set wth vertcal shadng. Now the set of ponts whch satsfy both the nequaltes.e. the set A n B of ponts s the cross-hatched regon shown n the fgure 4.. \ Fg. 4...

8 nequaltes &Convex Sets The comer pont P s the ntersecton of lnes x = and 3x + 4y = 2.. Ths pont s Now we consder another example wth four nequaltes. EXAMPLE 3 : Graph the set of ponts whch satsfy the nequaltes SOLUTON : Draw the lnes 3x +2y = 8 andx.+2y = 0 \ by choosng two ponts on the lnes. Shade the correspondng regons Snce x20,y-20, therefore, the set of ponts wll be n the frst quadrant as shown n the fgure 5., Fg. 5 *

9 'The soluton set colssts of all the ponts of the quadrlateral regon OPQR, whch nclude the ponts of the boundry and the nteror regon. The vertces of the quadrlateral are nequaltes and Convex Sets where Q s the pont of ntersectol of the lnes 3x + 2y = 8 and x + 2y = 0. Let us now consder another example whch s slghtly dfferent. EXAMPLE 4 : Graph the followng nequaltes dentfy the polygon enclosed by these nequaltes. SOLUTON : You can verfy by drawng the lnes and shadng the conespondng regon, the polygo~l s gven by the Fgure 6. Fg. 6 C

10 Basc Mathematcs and The soluton set conssts of all the ponts of the polygon PQRS, whch Optmzato~~ nclude the ponts of the boundary as well as the nteror regon. The vertces of the polygon are Now tty the followng exercses. EXERCSE : Graph the set of ponts. whch satsfy the nequaltes EXERCSE 2 : Determne the set of ponts satsfed by each of the followng system of nequaltes. Graph that set and fnd ts corner ponts EXERCSE 3 : Graph the set of ponts whch satsfy the nequaltes Also fnd ts corner ponts. EXERCSE 4 : Graph the followng nequaltes dentfy the polygon enclosed by these nequaltes. Fnd the vertces of the ' polygon.

11 2.3 CONVEX SETS AND THER GEOMETRY nequaltes and Convex Sets n secton 2.2, we have dscussed how to fnd the set of ponts satsfyng the gven nequaltes. Ths set of ponts nay be a polyhedron or may not be a polyhedron. n ths sectol we shall study the behavour of these sets and a few other related notons, whch we need n Block 2, pa-tcularly n Unts 3 and Noton of Convex Sets Let x, and x, be any two ponts n the Eucldean space E n. Consder a lne passng through the ponts x,, x, (x,* x,) n E n defned as the set S = (x; x = hx, + (- h) x,, all real h ). B By gvng dfferent values to h we wll get the correspondng dfferent ponts on the lne. Suppose h s chosen such that 0 h. Then for h = 0, we get x = x, and for h =, we get x = 3. Thus, we get the v,uous ponts between x, and x,. The lne jonng these ponts correspondng to the values of h between 0 and, s often called a lne segment. n other words, the lne segment jonng the ponts x,, x, n E n correspondng to the values of h between 0 and s a set of ponts denoted by S, where S = (x:x=hxz+(-h)xl,05h<). Now we gve the defnton of a Convex Set.. DEFNTON : CONVEX SET A set S s sad to be Convex f for any two ponts x,, x, n the set, the lne segment jonng these ponts s also n the set. n other words, a set S s sad to be Convex f for any elements x,, x, E S, %+(~-?L)x,E SforO53t. For example, consder a trangle ABC and ts nteror as shown n Fgure 7,

12 Basc Mathematcs and Optmzaton Smlarly we can see that a square or a rectangle wth ts ncror s a Convex set as shaded n Fgure 8. Fg. 8 Agan, consder a set ((x, y) : x2 -t y7 ) whch s nfact, a crcle wlh ts nteror. Clearly t s a corlvex set. See Fgure 9, Fg. 9

13

14 Basc Mathematcs and A Opt~nzaton sets whch are convex and non-convex as shown n Fgure. Convex Convex Non Convex Fg. Non Convex Let us we state and prove the followng mportant theorem : THEOREM : f S, and S, are two Convex sets, then ther ntersecton ': s also a Convex set., PROOF : Suppose S, = S, n S, Let x,,'x, be any two ponts n S,. Then X,,X~E S,andx,,x,~ S,. Snce S, and S, are Convex, therefore, hx2+ ( -) x, ES, for 0 < h and hx, + ( - h) x, E S2 for 0 h &*, Hence 'hx2 + ( - h)x, E S, n S, for 0 5 h 5 J T Ths s hx, + ( - h)x, E S,O 5 h

15 Thus S, s a convex set. nequaltes and Wth the help of followng examples you should verfy whether the gven sets are convex or not. EXAMPLE 5 : Show that the set n convex. SOLUTON : Suppose (x,, y,) E S, (x,, y,) E S are any two ponts. Then S wll be convex f h (x,, y2> + ( -J- (x,, Y,) E S O < h < l That s [Xx, + ( -h) x, hy, + ( -) y,l E S O s h r l Consder S 6h2 + 6 ( - h)2 + 2h ( - h) (3x,x2+ 2y, W) (Why?) Therefore 3[hx2 + ( - h)x,2 +2[3Ly2+( - h )~,]~ 2 6h2 + 6(- + 2h(l- h) (3xx2 + 2y,y2)....,( 2)

16 L Basc Matlematcs and Optmzaton Thus 3x,x2 + 2y,y2 6 From (2) and (3), we get Hence Ths shows that Therefore, S s a convex set. EXAMPLE 6 : Show that the set S((x, y) : xy 5, x 2 0, y 2 0) s not Convex. SOLUTON : n order to show that S s not convex we wll take two ponts n S and show that ther convex combnaton does not belong to S. Clearly, ( 3,) ~ and (-, 2) belong to S. Consder the combnaton of these ponts,.e. 2 S wll be convex f

17 Ths nequalty should hold for all values of h such that 0 h. But, f you take h = -, then you get 2 nequaltes and Convex fj, Sets /t Thus the nequalty s not satsfed for A = -. 2 Ths contradcton shows that S s not convex. EXERCSE 5 : Whch of the followng sets are convex? (a) s={(x, y) x ~ + ~ ~ > ~ } (b) s={(x, y) x2+3yz56} (c) S = {(X, y) x 5.2, y 5 4) Verfy your result by drawng the graph Extreme Ponts of a Convex Set ' n secton '(2.2), you studed the examples of convex sets n the fonn of polygons.the vertces of these polygons are mportant for us. We call such vertces as extreme ponts whch we defne now. DEFNTON 2 : EXTREME PONTS Let S be a Convex set, A pont x ES s an extreme pont of the convex set S f and only f there do not exst ponts x,, x, (x, + x,) n the set S such that a Let us look closely at ths defnton. Observe that the pont x = ( -h) x, + h x,, 0 < h < s a pont n between x, and x, (x, + x,).! ~ccordng to the above defrnton an extreme pont fals to satsfy ths property. For nstance consder a convex set S formed by a trangle ABC and ts nteror (See Fg. 2). f x s a pont nsde the trangle ABC, then t s possble to fnd pont x, qd x, n S such that J r f x s a boundery pont n S dfferent from ponts A, B and C, even then we can fnd ponts x, and x, n S such that 4" / l $! 4 '" ( x = hx, + ( -h) x,, 0 < h <. j 2 5 5

18 Basc Mathematcs and Optmzaton But for the ponts A, B and C ths s not possble. That s why the pont A, B and C are called the extreme ponts of S..,, Fg. 2 f we consder the crcle, then every pont on the crcumference of the crcle : s extreme pont. Why? Can you explan? Try t. Also, see the followng fgure.

19 ,. ( Hyper-Plane and Half Spaces We have seen n secton 2.2 that a lne dvdes the plane nto three parts. Consder an n-dmensonal plane whch dvdes the Eucldean Space E n nto.. three parts. Such a plane s called a Hyper plane. You know that c, x, + c, x, = d (c,, c,, d constants) s the equaton of a straght Lne n E'. Smlarly c, x, + c, x, + c, x, = d s the equaton of a plane ' j n Generalzng ths concept we many speak of the equaton of a hyperplane n E n. We defne the Hyper plane n the followng way : DEFNTON 3 : HYPER PLANE. nequaltes and / A hyper plane n E n s defned to be a set S of ponts : S={x En: clxl+cz~+...+ cnxn=d) S ={x En: cx=d) t where C = [el, $,..*, c,] ( A hyper plane cx = d n E" dvdes E n nto three mutually exclusve and exhaustve regons. These are denoted by the'sets : S,= (x: cx cd). S,= (x;cx=d) S, = {x : ox > d).'! The sets S, and S, are called Open half spaces, The sets S, = {x cx < d} and S, = {x ( cx 2 d} are called Closed half spaces. ' Note that S, n S, = S, whch s the hyper-plane cx = d.!'! NO& we wll show that hyper-planes, open half spaces and closed half spaces hre all convex sets. j THEOREM 2 : A hyperplane s a convex set --.. FROOF : n other words, we have to prove that the collecton '. S= (x~e":cx=d)! s a convex set.,'

20 Basc Mathematcs and Optmzaton f x,, x, are any two ponts on the hyper plane cx = d, then cx, = d andcx,=d The hyperplane wll be convex f the pont x=hx,+(l-h)x, for OL,<. les on the hyperplane. ndeed, we have cx = c [hx, t ( -A). x,] = kx, + ( - h) cx, =hdt(l-h)d=d : Ths shows that the hyperplane s a convex set, whch proves the theorem. THEOREM 3 : A closed half space s a convex set PROOF : Consder the closed half space Suppose x,, X, E S,, then cx, d, cx, 5 d. Consder x=hx,+(l-h)x, O<h<l Now cx= hcx,+(l-h)cx, $hd-t(l-h)d= d Ths shows that x= hx2+(-h)x, ES for 0 5 h Hence S s a Convex set. EXERCSE 6 : Show that S,, S, and S, are Convex sets. Now we wll gve few more defntons and theorems wthout proof whch wll be useful n Block 2. You may refer to the Book "Lnear Programmng" by G. Hadley for more detals. DEFNTON 4 : CONVEX COMBNATON k: 58 Let x,, x2,..., x, convex combnaton of ponts x,, xz,..., x,,, s defned as a pont be a fnte number of ponts n a Euldean space E n. A m x=xp,x,,p,>o =l,2,..., m =

21 where cp = We state a theorem wthout proof : nequaltes and Convex, Sets l j THEOREM 4 : The set sf all convex combnatons of a fnte number of ponts x,, x,,..., xn, n E n s a convex set that s, the set ( s convex. DEFWPTON 5 : CONVEX HULL Suppose A s a set whch s not convex. Then the smallest convex set whch contans A s called the Convex Hull of A. That s, the Convex Hull of a set A s the ntersecton of all Convex sets whch contan A. / For example, the Convex Hull of the set A = {(x, y) : x2 + yz = ) s the set klere S s Colvex and t contals A. Observe that S s the smallest convex set contanng A. n ths way we call say that the.convex -ull of the pont, on the crcunfere~ce of a crcle s the crcumference plus the nteror of the crcle. Ths s the slnallest convex set contanng the crcumference. ' We state another theorem wthout proof : THEOREM 5 : The convex hull of a fnte number of ponts x,, x,,..., x, n E n s the set of all convex combnaton of x,, $,..., x, L. That s, the convex hull of x,, x,,..., x, s the set The ~onvext ~ull of the fnte number of'ponts s called Convex Polyhedron

22 Basc Mathematcs and Optmzaton spannea ~y tnese pomts. ln Fgure 4, We navt: a LvvGx rolyneaton spanned by fve ponts. Fg. 4 f we consder the convex hull of three ponts n a plane t s a trangle. EXERCSE 7 : Suppose that X = (0, O), X2 = (2, O), X3 = (, ). Express the followng as convex lnear combnaton of the ponts x,, x, andx,: ',! 2.4 SUMMARY Recall that. ax + by S c and ax + by 2 c are nequaltes d 2. The lne ax + by = c dvdes the XY-plane nto three regons gven by the sets of... () ponts (x, y) such that ax + by = c * 60 '.

23 () ponts (x, y) such that ax -t- by < c.e. one half of the plane bounded by the lne nequaltes & Convex Sets. () ponts(x,y)suchthatax-t-by>c,theotherhalfoftheplane., 3. A set S s convex f for any two ponts x,, x, n the set, the lne segment jonng these ponts s also n the set. 4. A pont x E S s an exkerne pont of the convex set S f there do not exst ponts x,, x, (x, # x,) n the set such that 5. The set [x E E n : cx = dl s a hyper plane n E n. The hyperplane cx = d dvdes E n nto three sets r' S,, S, are called Open half spaces. 6. Open half spaces, Closed half spaces and hyperplanes are Convex sets. 7. The Convex Hull of a set A s the smallest Convex set contanng A. The ( Convex Hull of a fnte number of ponts s the set of all Convex.combnaton of these ponts.

24 Basc Mathematcs and Optmzaton 2.5 ANSWERS/WNTS/SOLUT]ONS El) Comer ponts are (0'4)'(-, 3 -), 3 (- 3 '-, 3 (0, 3) E2) a) Corner ponts are (0, -2)' (2, 0) and (-2, 2) ' 2 b) Comer ponts are (- ), (T, T) E3) Comer ponts are and (2' 0) E4) Vertces are E5) a) Not convex b) Convex C) Convex

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

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

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

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

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

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

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

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

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

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

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

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

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

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 5 Luca Trevisan September 7, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 5 Luca Trevisan September 7, 2017 U.C. Bereley CS294: Beyond Worst-Case Analyss Handout 5 Luca Trevsan September 7, 207 Scrbed by Haars Khan Last modfed 0/3/207 Lecture 5 In whch we study the SDP relaxaton of Max Cut n random graphs. Quc

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

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water. Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent

More 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

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More 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

Lecture Note 08 EECS 4101/5101 Instructor: Andy Mirzaian. All Nearest Neighbors: The Lifting Method

Lecture Note 08 EECS 4101/5101 Instructor: Andy Mirzaian. All Nearest Neighbors: The Lifting Method Lecture Note 08 EECS 4101/5101 Instructor: Andy Mrzaan Introducton All Nearest Neghbors: The Lftng Method Suose we are gven aset P ={ 1, 2,..., n }of n onts n the lane. The gven coordnates of the -th ont

More information

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

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

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

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

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More 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

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

Fast Computation of Shortest Path for Visiting Segments in the Plane

Fast Computation of Shortest Path for Visiting Segments in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More 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

Face numbers of nestohedra

Face numbers of nestohedra Face numbers of nestohedra from Faces of generalzed permutohedra, math.co/0609184 jont wth A. Postnkov and L. Wllams. Mnsymposum Algebrasche und geometrsche Kombnatork Erlangen 16 September 2008 Vc Rener

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

LP Decoding. Martin J. Wainwright. Electrical Engineering and Computer Science UC Berkeley, CA,

LP Decoding. Martin J. Wainwright. Electrical Engineering and Computer Science UC Berkeley, CA, Jon Feldman LP Decodng Industral Engneerng and Operatons Research Columba Unversty, New York, NY, 10027 jonfeld@eor.columba.edu Martn J. Wanwrght Electrcal Engneerng and Computer Scence UC Berkeley, CA,

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

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

Notes on Organizing Java Code: Packages, Visibility, and Scope

Notes on Organizing Java Code: Packages, Visibility, and Scope Notes on Organzng Java Code: Packages, Vsblty, and Scope CS 112 Wayne Snyder Java programmng n large measure s a process of defnng enttes (.e., packages, classes, methods, or felds) by name and then usng

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

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

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

DESIGN OF VERTICAL ALIGNMET

DESIGN OF VERTICAL ALIGNMET DESIN OF VERTICAL ALINMET Longtudnal gradent : max 0,5% (max see the assgnment paper) Markng of longtudnal gradent n drecton of chanage: + [%].. ascent n the drecton of chanage [%].. descent n the drecton

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

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

Tree Spanners for Bipartite Graphs and Probe Interval Graphs 1

Tree Spanners for Bipartite Graphs and Probe Interval Graphs 1 Algorthmca (2007) 47: 27 51 DOI: 10.1007/s00453-006-1209-y Algorthmca 2006 Sprnger Scence+Busness Meda, Inc. Tree Spanners for Bpartte Graphs and Probe Interval Graphs 1 Andreas Brandstädt, 2 Feodor F.

More information

F Geometric Mean Graphs

F Geometric Mean Graphs Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.

More information

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)

More information

Drawing Straight Lines

Drawing Straight Lines Drawng Straght Lnes Jeremy J. Carroll Publshng Systems and Solutons Laboratory HP Laboratores Brstol HPL-2000-72 December 2 st, 200* lnes, pseudolnes, polar coordnates, trlnear coordnates, non-lnear programmng,

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

ECONOMICS 452* -- Stata 11 Tutorial 6. Stata 11 Tutorial 6. TOPIC: Representing Multi-Category Categorical Variables with Dummy Variable Regressors

ECONOMICS 452* -- Stata 11 Tutorial 6. Stata 11 Tutorial 6. TOPIC: Representing Multi-Category Categorical Variables with Dummy Variable Regressors ECONOMICS * -- Stata 11 Tutoral Stata 11 Tutoral TOPIC: Representng Mult-Category Categorcal Varables wth Dummy Varable Regressors DATA: wage1_econ.dta (a Stata-format dataset) TASKS: Stata 11 Tutoral

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

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

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

BASIC DIFFERENTIABLE MANIFOLDS AND APPLICATIONS MAPS WITH TRANSLATORS TANGENT AND COTANGENT SPACES IJMMS, Vol., No. -2, (January-December 205): 25-36 Serals Publcatons ISSN: 0973-3329 BASIC DIFFERENTIABLE MANIFOLDS AND APPLICATIONS MAPS WITH TRANSLATORS TANGENT AND COTANGENT SPACES Mohamed M. Osman*

More information

Sketching of Mirror-symmetric Shapes

Sketching of Mirror-symmetric Shapes IEEE TRANSACTIONS ON TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS Sketchng of Mrror-symmetrc Shapes Frederc Corder Hyewon Seo Jnho Park and Junyong Noh Fg.. Sketchng of a symmetrc shape. Abstract

More 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

Key words. Graphics processing unit, GPU, digital geometry, computational geometry, parallel computation, CUDA, OpenCL

Key words. Graphics processing unit, GPU, digital geometry, computational geometry, parallel computation, CUDA, OpenCL PROOF OF CORRECTNESS OF THE DIGITAL DELAUNAY TRIANGULATION ALGORITHM THANH-TUNG CAO, HERBERT EDELSBRUNNER, AND TIOW-SENG TAN Abstract. We prove that the dual of the dgtal Vorono dagram constructed by floodng

More information

Cable optimization of a long span cable stayed bridge in La Coruña (Spain)

Cable optimization of a long span cable stayed bridge in La Coruña (Spain) Computer Aded Optmum Desgn n Engneerng XI 107 Cable optmzaton of a long span cable stayed brdge n La Coruña (Span) A. Baldomr & S. Hernández School of Cvl Engneerng, Unversty of Coruña, La Coruña, Span

More information

Color in OpenGL Polygonal Shading Light Source in OpenGL Material Properties Normal Vectors Phong model

Color in OpenGL Polygonal Shading Light Source in OpenGL Material Properties Normal Vectors Phong model Color n OpenGL Polygonal Shadng Lght Source n OpenGL Materal Propertes Normal Vectors Phong model 2 We know how to rasterze - Gven a 3D trangle and a 3D vewpont, we know whch pxels represent the trangle

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

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

Solving Route Planning Using Euler Path Transform

Solving Route Planning Using Euler Path Transform Solvng Route Plannng Usng Euler Path ransform Y-Chong Zeng Insttute of Informaton Scence Academa Snca awan ychongzeng@s.snca.edu.tw Abstract hs paper presents a method to solve route plannng problem n

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

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

cos(a, b) = at b a b. To get a distance measure, subtract the cosine similarity from one. dist(a, b) =1 cos(a, b)

cos(a, b) = at b a b. To get a distance measure, subtract the cosine similarity from one. dist(a, b) =1 cos(a, b) 8 Clusterng 8.1 Some Clusterng Examples Clusterng comes up n many contexts. For example, one mght want to cluster journal artcles nto clusters of artcles on related topcs. In dong ths, one frst represents

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

CE 221 Data Structures and Algorithms

CE 221 Data Structures and Algorithms CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume

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

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

CHOICE OF THE CONTROL VARIABLES OF AN ISOLATED INTERSECTION BY GRAPH COLOURING

CHOICE OF THE CONTROL VARIABLES OF AN ISOLATED INTERSECTION BY GRAPH COLOURING Yugoslav Journal of Operatons Research 25 (25), Number, 7-3 DOI:.2298/YJOR38345B CHOICE OF THE CONTROL VARIABLES OF AN ISOLATED INTERSECTION BY GRAPH COLOURING Vladan BATANOVIĆ Mhalo Pupn Insttute, Volgna

More information

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu

More information

Barycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al.

Barycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al. Barycentrc Coordnates From: Mean Value Coordnates for Closed Trangular Meshes by Ju et al. Motvaton Data nterpolaton from the vertces of a boundary polygon to ts nteror Boundary value problems Shadng Space

More information

A Facet Generation Procedure. for solving 0/1 integer programs

A Facet Generation Procedure. for solving 0/1 integer programs A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,

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

MATHEMATICS FORM ONE SCHEME OF WORK 2004

MATHEMATICS FORM ONE SCHEME OF WORK 2004 MATHEMATICS FORM ONE SCHEME OF WORK 2004 WEEK TOPICS/SUBTOPICS LEARNING OBJECTIVES LEARNING OUTCOMES VALUES CREATIVE & CRITICAL THINKING 1 WHOLE NUMBER Students wll be able to: GENERICS 1 1.1 Concept of

More information

Kinematics of pantograph masts

Kinematics of pantograph masts Abstract Spacecraft Mechansms Group, ISRO Satellte Centre, Arport Road, Bangalore 560 07, Emal:bpn@sac.ernet.n Flght Dynamcs Dvson, ISRO Satellte Centre, Arport Road, Bangalore 560 07 Emal:pandyan@sac.ernet.n

More information

STRUCTURE and motion problems form a class of geometric

STRUCTURE and motion problems form a class of geometric IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 30, NO. 9, SEPTEMBER 008 1603 Multple-Vew Geometry under the L 1 -Norm Fredrk Kahl and Rchard Hartley, Senor Member, IEEE Abstract Ths

More information

THE THEORY OF REGIONALIZED VARIABLES

THE THEORY OF REGIONALIZED VARIABLES CHAPTER 4 THE THEORY OF REGIONALIZED VARIABLES 4.1 Introducton It s ponted out by Armstrong (1998 : 16) that Matheron (1963b), realzng the sgnfcance of the spatal aspect of geostatstcal data, coned the

More information

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

More 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

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

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

Polyhedral Compilation Foundations

Polyhedral Compilation Foundations Polyhedral Complaton Foundatons Lous-Noël Pouchet pouchet@cse.oho-state.edu Dept. of Computer Scence and Engneerng, the Oho State Unversty Feb 8, 200 888., Class # Introducton: Polyhedral Complaton Foundatons

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More 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

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

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

Any Pair of 2D Curves Is Consistent with a 3D Symmetric Interpretation

Any Pair of 2D Curves Is Consistent with a 3D Symmetric Interpretation Symmetry 2011, 3, 365-388; do:10.3390/sym3020365 OPEN ACCESS symmetry ISSN 2073-8994 www.mdp.com/journal/symmetry Artcle Any Par of 2D Curves Is Consstent wth a 3D Symmetrc Interpretaton Tadamasa Sawada

More 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

Report on On-line Graph Coloring

Report on On-line Graph Coloring 2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm

More information

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent

More 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

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

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

Injective Shape Deformations Using Cube-Like Cages

Injective Shape Deformations Using Cube-Like Cages 309 Injectve Shape Deformatons Usng Cube-Lke Cages Jr Kosnka 1 and Mchael Barton 2 1 Unversty of Oslo, jr.kosnka@cma.uo.no 2 Technon, barton@cs.technon.ac.l ABSTRACT The present paper nvestgates an applcaton

More information

ECONOMICS 452* -- Stata 12 Tutorial 6. Stata 12 Tutorial 6. TOPIC: Representing Multi-Category Categorical Variables with Dummy Variable Regressors

ECONOMICS 452* -- Stata 12 Tutorial 6. Stata 12 Tutorial 6. TOPIC: Representing Multi-Category Categorical Variables with Dummy Variable Regressors ECONOMICS 45* -- Stata 1 Tutoral 6 Stata 1 Tutoral 6 TOPIC: Representng Mult-Category Categorcal Varables wth Dummy Varable Regressors DATA: wage1_econ45.dta (a Stata-format dataset) TASKS: Stata 1 Tutoral

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More 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