treated this question with techniques permitting proofs. A synthesis of their
|
|
- Rudolf Armstrong
- 5 years ago
- Views:
Transcription
1 588 MATHEMATICS: G. DEBREU PROC. N. A. S. 1 A. Borel, "Sur la cohomologe des espaces fbres prncpaux et des espaces homogbnes des groupes de Le compacts," Ann. Math., 57, No. 1, 115, 1953; "Homology and Cohomology of Compact Connected Le Groups," these PROCEEDINGS, 39, No. 11, , M. Morse, "The Calculus of Varatons n the Large," Math. Colloq. Pub., 18, E. Cartan, "La G6ometre des groupes smples," (Euvres, 2, Part I, 793; also papers referred to theren. See also E. Stefel, "tyber ene Bezehung..." Comm. Math. Helv., 14, , C. Chevalley, Theory of Le Groups I (Prnceton, N.J.: Prnceton Unversty Press, 1946). 6 R. Bott, "Non-degenerate Crtcal Manfolds" (to appear n Ann. Math.). VALUATION EQUILIBRIUM AND PARETO OPTIMUM* By GERARD DEBREU COWLES COMMISSION FOR RESEARCH IN ECONOMICS Communcated by John von Neumann, May 6, 1954 For an economc system wth gven technologcal and resource lmtatons, ndvdual needs and tastes, a valuaton equlbrum wth respect to a set of prces s a state where no consumer can make hmself better off wthout spendng more, and no producer can make a larger proft; a Pareto optmum s a state where no consumer can be made better off wthout makng another consumer worse off. Theorem 1 gves condtons under whch a valuaton equlbrum s a Pareto optmum. Theorem 2, n conuncton wth the Remark, gves condtons under whch a Pareto optmum s a valuaton equlbrum. The contents of both theorems (n partcular that of the frst one) are old belefs n economcs. Arrow' and Debreu2 have recently treated ths queston wth technques permttng proofs. A synthess of ther papers s made here. Ther assumptons are weakened n several respects; n partcular, ther results are extended from fnte dmensonal to general lnear spaces. Ths extenson yelds as a possble mmedate applcaton a soluton of the problem of nfnte tme horzon (see sec. 6). Its man nterest, however, may be that by forcng one to a greater generalty t brngs out wth greater clarty and smplcty the basc concepts of the analyss and ts logcal structure. Not a sngle smplfcaton of the proofs would ndeed be brought about by restrcton to the fnte dmensonal case. As far as possble the mathematcal structure of the theory has been dssocated from the economc nterpretaton, to be found n brackets. 1. The Economc System.-Let L be a lnear space (on the reals R).3 The economc system can be descrbed as follows: The th consumer ( = 1,..., m) chooses a pont x [hs consumpton] n a gven subset X [hs consumpton-set] of L. [x completely descrbes the quanttes of commodtes he actually consumes, to be thought of as postve, and the quanttes of the varous types of labor he produces, to be thought of as negatve. X s determned by constrants of the followng types: quanttes of commodtes consumed (labor produced) must be nonnegatve (nonpostve), and, moreover, they must enable the ndvdual to survve. ] There s on X a complete orderng, denoted by < [correspondng to the preferences of that consumer].4 x 0 s a saturaton pont of X, f, for all x E X, one has x < x,0.
2 VOL. 40, 1954 MATHEMATICS: G. DEBREU 589 The th producer ( = 1,., n) chooses a pont y [hs producton] n a gven subset Y [hs producton-set] of L. [y s a complete descrpton of all hs outputs, to be thought of as postve, and hs nputs, to be thought of as negatve. YJ s determned by technologcal lmtatons. ] Denote x = x, y = y; they are constraned to satsfy the equalty x - y =, where v s a gven pont of L. [t corresponds to the exogenous resources avalable (ncludng all captal exstng at the ntal date). x - y s the net consumpton of all consumers and all producers together. It must clearly equal I. ]5 A (m + n)-tuple [(x), (y)], one x for each, one y for each, s called a state of the economy. [It s a complete descrpton of the actvty of every consumer and every producer.] A state [(x), (y)] s called attanable f x E X for all, y e Y for all, x-y = P 2. Valuaton Equlbrum.-v(z) wll denote a (real-valued) lnear form on L.6 [It gves the value of the commodty-pont z. When L s sutably specalzed, ths value can be represented by the nner product p z, where p s the prce system.] A state [(x ), (y 0)J s a valuaton equlbrum wth respect to v(z) f: (2. 1) [(x20), (y0) ] s attanable. (2.2) For every " x e X, v(x). v(x ) ' mples ' x < x0o. [Best satsfacton of preferences subect to a budget constrant.] (2.3) For every ' y e Y, mples < v(y) < V(yv P ). [Maxmzaton of proft subect to technologcal constrants.] 3. Pareto Optmum.-The set X1 X... X X. of m-tuples (x), one x for each, s (partally) ordered as follows: (x') > (x) f and only f x' > x for all. A state [(x ), (y0) ] s a Pareto optmum f: (3.1) [(x), (y0) ] s attanable. (3.2) There s no attanable state [(x), (y)] for whch (x) > (x0). [It s mpossble to make one consumer better off wthout makng another one worse off.] 4. A Valuaton Equlbrum Is a Pareto Optmum.-The followng assumptons wll be made: I. For every, X s convex. II. For every, x' e X, x' e X, x' < x * mples * x' < (1 - t) x' + S tx' for all t, 0 <t< 1 a. These two axoms on the convexty of the consumpton-sets and the convexty of preferences have been used by Arrow and Debreu7 n a dfferent context. THEOREM 1. Under assumptons I and II, every valuaton equlbrum [(x0), (y0) ], where no x s a saturaton pont, s a Pareto optmum. Proof: (4.1) 4 x e X and x > x0 mples t v(x) > v(x0). Ths s a trval consequence of defnton (2.2). (4.2). x e X and x x0 ' mples av(x) > v(x0).> Snce x0 s not a saturaton pont, there s x' e X, such that x' > x, hence x' > x. Consder x(t) = (1 - t) x + tx'. By assumpton II, for all t, 0 < t < 1, t x(t) > x, hence x1(t) > x0, so (by [4.1]) v(x0) < v(x1(t)) = (1-t) v(x) + tv(x'). Let t tend to zero; n the lmt v(x ). v(x).
3 Soo MATHEMATICS:. DEBRUP. PROC. M. A. S. To complete the proof we consder a state [(x), (y) ], where xf e X for all, ye Y - for all, and show that f (x) > (x0), the state s not attanable,.e.,x-yy. (x) > (xa) means that for all, x > x, and for some ', xz, > x4,; so by (4.1) and (4.2) Ev(x) > Ev(xO),.e., v(x) > v(xo). On the other hand, (2.3) mples v(y). v(yo), so v(x) -v(y) > v(xo) - v(yo). Snce x0 - y -, v(x - y) > v(r), whch rules out x-y y = 5. A Pareto Optmum Is a Valuaton Equlbrum.-In ths secton L s a topologcal lnear space.8 Let x', x' be ponts of X; we defne I(x', x') = { ti t)x1' + txg] [(1 e x}. When X s convex, I(x', x') s a real nterval wth possbly one or two end-ponts excluded. In addton to assumptons I and II, three further assumptons are needed here. III. For every, x, x', x" n X the sets {t e I(x', x) I (1 - t)x' + tx' > x} and { t e I(x', x") (1 -t)x' + txst < x are closed n I(x', x'). Ths weak axom of contnuty for preferences has been ntroduced by Hersten and Mlnor9 n another context. We defne Y = Y (the set of all y = Ey, where y, e Y1 for all ). IV. Y s convex. [The assumpton that the aggregate producton-set s convex s strctly weaker than the assumpton that the ndvdual producton-sets Y are all convex. ] V. L s fnte dmensonal and/or Y has an nteror pont. [The assumpton that Y has an nteror pont wll be shown n secton 6 to be mpled by free dsposal of commodtes. ] THEOREM 2. Under assumptons I-V, wth every Pareto op-mum [(x0), (y0)], where some x0 s not a saturaton pont, s assocated a (nontrval) contnuous lnear form v(z) on L such that: (5.1) For every xf X, x > x ' mples " v(x) > v(x0).> (5.2) For every ' y E Y ' mples z v(y). v(yo). Proof: From assumptons I, II, and III follows: a) 4 x', x' n X, x' < x' mples ' for all t, 0. t < 1, x' < [(1 - t)x' + txoi] e x.> By assumpton III, the set {t e I (xe', x')i (1 - t) x' + tx' < x'} s open n I(x', x"). Its ntersecton wth the nterval ]0, 1 [ (end-ponts excluded) s open. We wsh to show that ths ntersecton s empty. If t were not, t would contan two numbers t1 < t2. Take the correspondng ponts xl, x2. Then x' < x' < x/. By assumpton II, x' < x" gves x' <x I x X1 X2 x" Smlarly, X2 < x' gves X12 < x', a contradcton. As an mmedate consequence of (a), for all, the sets X() = X e X X > 4} and X() {X E X1IX > xo} are convex. x} and -$(X)7{OFeXF XtX{ } C~ ar
4 VOL. 40, 1954 MATHEMATICS: G. DEBREU 591 Let ' be a value of for whch x', s not a saturaton pont, and consder the set Z = X'(X!,) + Ex(xZ ) - Y f Z, ths s the defnton of a Pareto optmum [(x0), (y/') ]. Z s convex as t s the sum of convex sets. If Y = E Y has an nteror pont, Z also has one. The Hahn-Banach theorem10 can therefore be appled to Z and I. There s a (nontrval) contnuous lnear form v(z) on L such that v(z). v(r) for all z e Z,.e., snce x -Evo v (x-xo) (Y-Y10) > for all x, E X (x?), x e X(xo?) (for $ '), y e Y (for all ). In ths statement kx(xo?) can be replaced by X,(xo,), for every x, e X rx,, x,, can be exhbted, as n the proof of (4.2), as a lmt of ponts belongng to X,'(x,). Therefore, b) v(x - x) + Z v(yo - y) > 0 for all x e X(x0), y e Yp.. By makng all but one of the x, y equal to the correspondng x, yf,, one proves that for the remanng term n (b) v(x - x) > 0 for all x e X(x 0) (or v(yo - y). > o for all y e Y) whch s precsely the statement of Theorem 2. (5.2) s dentcal to (2.3), but (5.1) does not necessarly mply (2.2), and Theorem 2 does not qute correspond to the ttle of ths secton. The followng Remark, due to Arrow1' n ts essence, tres to fll ths gap: REMARK. Under assumptons I and III, f there s, for every, an x' e X such thatv(x') < v(x?), then (5.1) mples (2.2). Consder an x e X, v(x) < v(x0). Let x(t) = (1 - t) x + txt'. For all t, O <t < 1, v(x(t)) <v(x,0) and thus, by (5.1), x(t) <x. The set {t ei (xf, x')i (1 -t) x + tx/' < x } contans the nterval ]0, 1 [; snce t s closed n I(x, x') (by assumpton III), t contans 0,.e., x x0. [The condton that there s x' e X such that v(x') < v(x) means that the consumer does not have such a low v(x 0) that wth any lower value he could not survve. ] 6. The Free Dsposal Assumpton.-An example wll show the economc ustfcaton of assumpton V when L s not fnte dmensonal. Suppose that there s an nfnte sequence of commodtes [because, for example, economc actvty takes place at an nfnte sequence of dates, a case studed by Malnvaud'2 wth dfferent technques]. The space L wll be the set of nfnte sequences of real numbers (Zt) such that Sup I Zh! < + Xo. L s normed byzik = Sup I ZhI. The assumpton of free dsposal for the technology means that f y e Y and yh' < y, for all h, then y' e Y [f an nput-output combnaton s possble, so s one where some outputs are smaller or some nputs larger; t s mpled that a surplus can be freely dsposed of ]. Wth ths assumpton, f Y s not empty, t clearly has an nteror pont: select a number p > 0 and a pont y e Y; consder y' defned by yh' = yā p for all h. The sphere of center y', radus p, s contaned n Y. Other examples of lnear spaces n economcs are provded by the case where there
5 592 MATHEMATICS: G. DEBREU PROC. N. A. S. s a fnte number 1 of commodtes, and tme and/or locaton s a contnuous varable. The actvty of an economc agent s then descrbed by the 1 rates of flow of the commodtes as functons of tme and/or locaton. The space L s the set of 1- tuples of functons of the contnuous varable. In any case, f L s properly chosen, the exstence of an nteror pont for Y wll follow from the free dsposal assumpton. Then applcaton of Theorem 2 wll gve a contnuous lnear form v(z). * Based on Cowles Commsson Dscusson Paper, Economcs, No (January, 1953). Ths artcle has been prepared under contract Nonr-358(01), NR between the Offce of Naval Research and the Cowles Commsson for Research n Economcs. I am grateful to E. Malnvaud, staff members and guests of the Cowles Commsson, n partcular I. N. Hersten, L. Hurwcz, T. C. Koopmans, and R. Radner for ther comments. I K. J. Arrow, "An Extenson of the Basc Theorems of Classcal Welfare Economcs," Proceedngs of the Second Berkeley Symposum (Berkeley: Unversty of Calforna Press, 1951), pp G. Debreu, "The Coeffcent of Resource Utlzaton," Econometrca, 19, , A real lnear space L s a set where the addton of two elements (x + y) and the multplcaton of a real number by an element (tx) are defned and satsfy the eght axoms: 1. Forallx,y,znL,(x +y) +z = x +(y +z). 2. There s an element 0 e L such that for every x e L, x + 0 = x. 3. For every x el, there s an x' e L such that x + x' = Forallx,ynL,x+y=y+x. Forallx,ynL,t,t'nR, 5. t (x + y) = tx + ty, 6. (t + t')x = tx +t'x, 7. t(t'x) = (tt')x, 8. lx = x. 4An order s a reflexve and transtve bnary relaton (generally denoted by _). x x' means x _ x' and x' < x, whle x < x' means x _ x' and not x' < x. The order s complete (as opposed to partal) f for any x, x' one has x < x' and/or x' < x. One may obect to completeness of the preference orderng as well as to ts transtvty. The reader must therefore note that, wth slght modfcatons of the defntons and the assumptons, Theorems 1 and 2 can easly be proved for arbtrary bnary relatons on the X. 6 Usually the net consumpton s only constraned to be at most equal to the avalable resources. But ths mples that any surplus can be freely dsposed of. Such an assumpton on the technology should be made explct (see sec. 6) whle requrng at the same tme x - y = P. 6 For all x, y, v(x + y) = v(x) + v(y). For all t, x, v(tx) = tv(x). v(z) s sad to be trval f t vanshes everywhere. 7K. J. Arrow, and G. Debreu, "Exstence of an Equlbrum for a Compettve Economy," Econometrca, A topologcal lnear space s a lnear space wth a topology such that the functons (x, y) x + y from L X L to L and (t, x) - tx from R X L to L are contnuous. For defnton of a topology, of the topology on a product, of a contnuous functon see N. Bourbak, Elements de mathematque (Pars: Hermann, et Ce, 1940), Part I, Book 3, chap.. For the representaton of contnuous lnear forms on L see S. Banach, Theore des operatons lndares (Warsaw, 1932), n partcular, chap. v, sec I. N. Hersten and J. Mlnor, "An Axomatc Approach to Measurable Utlty," Econometrca, 21, , In a real topologcal lnear space, f Z s a convex set wth nteror ponts, r a pont whch does not belong to Z, there s a closed hyperplane through, boundng for Z. (See for example, N. Bourbak, Elements de mathematque [Pars: Hermann et Ce, 1953', Part I, Book 5, chap., n partcular, sec. 3.) '1 Arrow, op. ct., Lemma E. Malnvaud, "Captal Accumulaton and Effcent Allocaton of Resources," Econometrca 21, , 1953.
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 informationUNIT 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 informationGSLM 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 informationb * -Open Sets in Bispaces
Internatonal Journal of Mathematcs and Statstcs Inventon (IJMSI) E-ISSN: 2321 4767 P-ISSN: 2321-4759 wwwjmsorg Volume 4 Issue 6 August 2016 PP- 39-43 b * -Open Sets n Bspaces Amar Kumar Banerjee 1 and
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationCHAPTER 2 DECOMPOSITION OF GRAPHS
CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationMath Homotopy Theory Additional notes
Math 527 - Homotopy Theory Addtonal notes Martn Frankland February 4, 2013 The category Top s not Cartesan closed. problem. In these notes, we explan how to remedy that 1 Compactly generated spaces Ths
More informationSemi - - Connectedness in Bitopological Spaces
Journal of AL-Qadsyah for computer scence an mathematcs A specal Issue Researches of the fourth Internatonal scentfc Conference/Second صفحة 45-53 Sem - - Connectedness n Btopologcal Spaces By Qays Hatem
More informationA 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 informationSolving 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 informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationSENSITIVITY 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 informationNUMERICAL 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 informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationSome kinds of fuzzy connected and fuzzy continuous functions
Journal of Babylon Unversty/Pure and Appled Scences/ No(9)/ Vol(): 4 Some knds of fuzzy connected and fuzzy contnuous functons Hanan Al Hussen Deptof Math College of Educaton for Grls Kufa Unversty Hananahussen@uokafaq
More informationProblem 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 informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
More informationLecture 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 informationIntra-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 informationALEKSANDROV 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 informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationCordial and 3-Equitable Labeling for Some Star Related Graphs
Internatonal Mathematcal Forum, 4, 009, no. 31, 1543-1553 Cordal and 3-Equtable Labelng for Some Star Related Graphs S. K. Vadya Department of Mathematcs, Saurashtra Unversty Rajkot - 360005, Gujarat,
More informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationA 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 informationAssignment # 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 informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
More informationMinimization of the Expected Total Net Loss in a Stationary Multistate Flow Network System
Appled Mathematcs, 6, 7, 793-87 Publshed Onlne May 6 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/.436/am.6.787 Mnmzaton of the Expected Total Net Loss n a Statonary Multstate Flow Networ System
More informationLine 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 information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationA 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 informationElectrical analysis of light-weight, triangular weave reflector antennas
Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna
More informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationLecture 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 informationPolyhedral 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 informationA 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 informationMathematics 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 informationA Variable Elimination Approach for Optimal Scheduling with Linear Preferences
A Varable Elmnaton Approach for Optmal Schedulng wth Lnear Preferences Ncolas Meuleau and Robert A. Morrs NASA Ames Research Center Moffet Feld, Calforna 9435-1, USA {Ncolas.F.Meuleau,Robert.A.Morrs}@nasa.gov
More informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
More informationChapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward
More informationReport on On-line Graph Coloring
2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm
More informationLecture 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 informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationLOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit
LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE
More informationEXTENDED FORMAL SPECIFICATIONS OF 3D SPATIAL DATA TYPES
- 1 - EXTENDED FORMAL SPECIFICATIONS OF D SPATIAL DATA TYPES - TECHNICAL REPORT - André Borrann Coputaton Cvl Engneerng Technsche Unverstät München INTRODUCTION Startng pont for the developent of a spatal
More informationToday Using Fourier-Motzkin elimination for code generation Using Fourier-Motzkin elimination for determining schedule constraints
Fourer Motzkn Elmnaton Logstcs HW10 due Frday Aprl 27 th Today Usng Fourer-Motzkn elmnaton for code generaton Usng Fourer-Motzkn elmnaton for determnng schedule constrants Unversty Fourer-Motzkn Elmnaton
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationCE 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 informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationParameter estimation for incomplete bivariate longitudinal data in clinical trials
Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationBITRATE ALLOCATION FOR MULTIPLE VIDEO STREAMS AT COMPETITIVE EQUILIBRIA
BITRATE ALLCATIN FR MULTIPLE VIDE STREAMS AT CMPETITIVE EQUILIBRIA Mayank Twar, Theodore Groves, and Pamela Cosman Department of Electrcal and Computer Engneerng, Department of Economcs, Unversty of Calforna,
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationHarmonic 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 informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationNETWORKS 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 informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationKinematics 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 informationA CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN. Department of Statistics, Islamia College, Peshawar, Pakistan 2
Pa. J. Statst. 5 Vol. 3(4), 353-36 A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN Sajjad Ahmad Khan, Hameed Al, Sadaf Manzoor and Alamgr Department of Statstcs, Islama College,
More informationCan Congestion Control and Traffic Engineering Be at Odds?
Can Congeston Control and Traffc Engneerng Be at Odds? Jayue He Dept. of EE, Prnceton Unversty Emal: jhe@prnceton.edu Mung Chang Dept. of EE, Prnceton Unversty Emal: changm@prnceton.edu Jennfer Rexford
More informationAnnouncements. Supervised Learning
Announcements See Chapter 5 of Duda, Hart, and Stork. Tutoral by Burge lnked to on web page. Supervsed Learnng Classfcaton wth labeled eamples. Images vectors n hgh-d space. Supervsed Learnng Labeled eamples
More informationy 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 informationMulticriteria Decision Making
Multcrtera Decson Makng Andrés Ramos (Andres.Ramos@comllas.edu) Pedro Sánchez (Pedro.Sanchez@comllas.edu) Sonja Wogrn (Sonja.Wogrn@comllas.edu) Contents 1. Basc concepts 2. Contnuous methods 3. Dscrete
More informationInternational Journal of Scientific & Engineering Research, Volume 7, Issue 5, May ISSN Some Polygonal Sum Labeling of Bistar
Internatonal Journal of Scentfc & Engneerng Research Volume 7 Issue 5 May-6 34 Some Polygonal Sum Labelng of Bstar DrKAmuthavall SDneshkumar ABSTRACT- A (p q) graph G s sad to admt a polygonal sum labelng
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationBridges and cut-vertices of Intuitionistic Fuzzy Graph Structure
Internatonal Journal of Engneerng, Scence and Mathematcs (UGC Approved) Journal Homepage: http://www.jesm.co.n, Emal: jesmj@gmal.com Double-Blnd Peer Revewed Refereed Open Access Internatonal Journal -
More informationA METHOD FOR RANKING OF FUZZY NUMBERS USING NEW WEIGHTED DISTANCE
Mathematcal and omputatonal pplcatons, Vol 6, No, pp 359-369, ssocaton for Scentfc Research METHOD FOR RNKING OF FUZZY NUMERS USING NEW WEIGHTED DISTNE T llahvranloo, S bbasbandy, R Sanefard Department
More informationDistance based similarity measures of fuzzy sets
Johanyák, Z. C., Kovács S.: Dstance based smlarty measures of fuzzy sets, SAMI 2005, 3 rd Slovakan-Hungaran Jont Symposum on Appled Machne Intellgence, Herl'any, Slovaka, January 2-22 2005, ISBN 963 75
More informationClustering 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 informationIntroduction. 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 informationINTEGER PROGRAMMING MODELING FOR THE CHINESE POSTMAN PROBLEMS
INTEGER PROGRAMMING MODELING FOR THE CHINESE POSTMAN PROBLEMS ABSTRACT Feng Junwen School of Economcs and Management, Nanng Unversty of Scence and Technology, Nanng, 2009, Chna As far as the tradtonal
More informationModule 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 informationHarvard 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 information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
More informationInjective 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 informationthe nber of vertces n the graph. spannng tree T beng part of a par of maxmally dstant trees s called extremal. Extremal trees are useful n the mxed an
On Central Spannng Trees of a Graph S. Bezrukov Unverstat-GH Paderborn FB Mathematk/Informatk Furstenallee 11 D{33102 Paderborn F. Kaderal, W. Poguntke FernUnverstat Hagen LG Kommunkatonssysteme Bergscher
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationLECTURE 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 informationUC Berkeley Working Papers
UC Berkeley Workng Papers Ttle Dscretzaton and Valdaton of the Contnuum Approxmaton Scheme for Termnal System Desgn Permalnk https://escholarshp.org/uc/tem/9dm7v0cn Authors Ouyang, Yanfeng Daganzo, Carlos
More informationOutline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:
Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A
More information