Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations

Size: px
Start display at page:

Download "Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations"

Transcription

1 Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu raditioal Chiese Medicie Uiversity, Lazhou , Chia 2 College of Mathematics ad Statistics, Northwest Normal Uiversity, Lazhou , Chia *Correspodig author [16] ivestigated the dual fuzzy matrix equatios form AX B C X D based o fuzzy umbers Abstract he paper deals with the dual fully fuzzy matrix equatio A X B C X D he dual fuzzy matrix equatio is coverted to a crisp system of matrix equatios accordig to arithmetic operatios of fuzzy umbers he fuzzy approximate solutio of fuzzy matrix equatio is obtaied by solvig the model which is made of three liear matrix equatios he existece coditio of the oegative fuzzy solutio is also discussed A example is give to illustrate the proposed method IIPRELIMINARIES A Fuzzy Numbers Let E1 be the set of all fuzzy umbers o R Keywords-fuzzy umbers; matrix aalysis; dual fuzzy matrix equatios; fuzzy approximate solutios Defiitio 21 A fuzzy umber M is said to be a fuzzy umber if I INRODUCION System of simultaeous liear matrix equatios is a essetial mathematical tool i sciece ad techology I practice some or all parameters may be represeted by fuzzy umbers rather tha crisp oes herefore it is ecessary to develop mathematical theory ad umerical schemes to hadle fuzzy matrix systems he cocept of fuzzy umbers ad arithmetic operatios with these umbers were first itroduced ad ivestigated by Zadeh [1], Dubois et al[2] ad Nahmias [3] um (1) L x L x, (2) L 0 1 ad L 1 0, (3) L x is oicreasig o 0, However, for a fuzzy liear matrix equatio which always has a wide use i cotrol theory ad cotrol egieerig, few work has bee doe i the past decades I 2009, Allahviraloo et al [12] discussed the fuzzy liear matrix he defiitio of a right shape fuctio R is usually similar to that of L A equatios(flme) of the form AX B C where fuzzy umber symbolically show as M m,, A ad B are m m ad real matrices respectively, C is a give m fuzzy umbers matrix I 2011, Gog ad Guo [13] B ad ivestigated a class of fuzzy matrix equatios Ax Clearly, M m,, L R Defiitio arbitrary M is L R is positive(egative) if ad oly if m 0 m 0 studied its fuzzy least squares solutios by usig geeralized iverses of the matrix Later, Guo ad Shag [14-15] proposed a computig method of fuzzy symmetric solutios to fuzzy matrix 22 For M m,, ad B ad discussed the fuzzy Sylvester matrix fuzzy umbers Recetly, Guo ad Gog 2016 he authors - Published by Atlatis Press, x m, 0,, x m, 0, where m is the mea value of M, ad ad are left ad right spreads, respectively he fuctio L ; which is called left shape fuctio satisfyig: Sice Friedma et al [4] proposed a geeral model for solvig a fuzzy liear systems Ax=b by a embeddig approach i 1998, lots of works have bee doe about some advaced fuzzy liear systems such as dual fuzzy liear systems (DFLS), geeral fuzzy liear systems (GFLS), fully fuzzy liear systems (FFLS)ad geeral dual fuzzy liear systems (GDFLS) see [5-8] Ad some ew theories ad methods for fuzzy liear systems still appeared recetly [9-11] equatios AX equatios with m x L x R x m (1) Additio 373 fuzzy umbers N,,, we have

2 ,,,,,, M N m m (2) Multiplicatio If M 0 ad N 0 ; the,,,,,, MN m m m m B he Dual Fully Fuzzy Matrix Equatios Defiitio 23 A matrix A a,1 i m,1 is called a fuzzy matrix, if each elemet of A is a fuzzy umber A fuzzy matrix A is said to be positive(egative) ad deoted by A 0A 0 if each elemet a,1 im,1 of A be positive (egative) We ca represet m fuzzy matrix A a, that a a,, with ew otatio A A, M, N, where A a, M ad N are three m crisp matrices Defiitio 24 he liear system a11 a12 a x 1 11 x12 x 1 p a21 a22 a x 2 21 x22 x 2 p a 1 2 x1 x2 x m am a m p b11 b12 b b21 b22 b2 p bm1 bm2 b mp c11 c12 c x 1 11 x12 x c21 c22 c x 2 21 x22 x 2 p c m cm c x x m x p, (21) d11 d12 d d21 d22 d2 p 21 dm 1 dm2 d mp where a, c,1 im,1 ad b, d,1 im,1 p are fuzzy umbers, is called a dual fully fuzzy matrix equatios(dffmes) Usig matrix otatio, we have A X BCX D A fuzzy umbers matrix X x x, y, z,1 i,1 p is said to the solutio of dual fuzzy matrix equatio 21 if X satisfies Eq22, ie, AX B CX D, 1,, p X x1 x2 x B b1 b2 bm where D d1, d2,, dm, 1,, p,,,,,,,, are th colum of fuzzy matrices X, B ad D respectively Up to rest of this paper we wat to fid the positive solutio X, Y, Z 0 22, where X of oegative A A M N B B E F C C G H ad D D, P, Q 0,, 0,,, 0,,, 0 III SOLVING DUAL FULLY FUZZY MARIX EQUAION heorem 31 he dual fully fuzzy matrix system 22 ca be exteded ito the followig model system which is made of three liear matrix equatios 374

3 AX B CX D, AY MX E CY GX P, AZ NX F CZ HX Q Proof We deote A AM,, N, B BEF,,, C CGH,,, D DPQ,, ad assume X X, Y, Z 0, the is the miimal solutio of Eqs(31) such that X 0, Y 0, Z 0, the we say X X, Y, Z is a AX BCX D fuzzy miimal solutio of Eqs(22) If X X, Y, Z also satisfies X Y 0, we say it is a ie, oegative fuzzy miimal solutio of Eqs(22) AMN,, XYZ,, BEF,, CGH,, XYZ,, DPQ,, Accordig to multiplicatio of oegative fuzzy heorem 33 Let A A, M, N, B B, E, F umbers of Defiitio 23, we have ad C C, G, H be three oegative fuzzy AXAY, MX, AZ NX B, E, F CX, CYGX, CZHX D, P, Q matrices, respectively, ad A C be oegative hus we obtai a model for solvig DFFMEs (22) as matrix Let D B0, PEGMAC 1 D B ad 1 Q F H N A C D B he the dual AX B CX D, AY MX E CY GX P, AZ NX F CZ HX Q I order to solve the dual fuzzy system (22), we eed to cosider the crisp system of liear matrix equatio (31) For example, whe A C is a osigular crisp matrix, we obtai its solutio as Y A C P E G M A C B D Z AC QF HN AC BD 1 XAC DB, ,(32) m heorem 32([17]) Let A belog to R ad B m p belog to R he the miimal solutio X of the matrix equatio AX B is expressed by X AB Whe A C is a sigular matrix, by the heorem 32, we solve model 31 ad obtai its miimal solutio as Y A C P E G M A C B D Z AC QF HN AC BD X AC DB,,33 Defiitio 32 Let X X, Y, Z If X X, Y, Z fuzzy systems A XBCX D has a fuzzy miimal solutio If the 1 coditio D BI GMAC P E holds, the the dual fuzzy systems (21) has a oegative fuzzy miimal solutio Proof Sice A C ad D B are oegative matrices hus the fact X A C D B 0 is apparet O the other had, because P E G M A C D B ad Q F H N A C D B, so with Y AC PEGMAC B D ad Z AC QF H N AC DB, we have Y 0 ad 0 X XYZ,, is a fuzzy solutio of the dual fuzzy systems AX BCX D Sice Z hus 375

4 XY AC DB PE GM AC D B the oegative property of the solutio X to dual fuzzy systems (21) ca be obtaied from the coditio I GMAC DB P E IV NUMERICAL EXAMPLE Example 41 Cosider the dual fully fuzzy matrix system x11 x 12 x x 2,1,1 3,1, 2 1, 0, 0 3,1,1 2, 0,1 2,1, x31 x32 2, 2,1 1,1, 2 2,1,1 3,1,1 2,1,1 1, 0, 0 1,1,1 1, 0,1 2,1,1 3, 0,1 4, 2, 2 3, 2, 2 5, 4,3 3, 2, 0, x11 x 12 x x x31 x32 By heorem 31, the model to above fuzzy liear matrix system is made of followig three crisp systems of liear matrix equatios x x x x x21 x22 x21 x22, x31 x 32 x31 x 32 y y x x y y x x y21 y22 x21 x y11 y12 x11 x y21 y22 x21 x y y x x ad z11 z12 x11 x z21 z22 x21 x z z x x z11 z12 x11 x z z x x z31 z 32 x31 x 32 Accordig to formula (33), the miimal solutios of above three systems of liear matrix equatios are as X AC DB , Y AC PE GM X X Z AC QF H N X X

5 By Defiitio 32, we kow the origial fuzzy liear matrix equatios has a oegative fuzzy solutio x11 x 12 X x x 13143,01258, ,09896,00333, 20571,1,0333, ,01236, ,1327,11250, ,13333, x31 x 32 Sice X 0, Y 0, Z 0 ad X Y 0 [15] XB Guo, DQ Shag, Approximate solutios of fuzzy Sylvester matrix equatios, Joural of Applied Mathematics, Volume 2013, Article ID , 10 pages [16] Z Gog, XB Guo, K Liu, Approximate solutio of dual fuzzy matrix equatios, Iformatio Scieces 266 (2014) [17] A Berma, RJ Plemmos, Noegative matrices i the Mathematical Scieces, Academic press, New York, 1979 V CONCLUSION I this work, we proposed a simple model for solvig the geeral dual fully fuzzy matrix equatio We coverted the dual fuzzy matrix equatio to a crisp system of liear matrix equatios accordig to the arithmetic operatios of fuzzy umbers he existece coditio of oegative fuzzy solutio was also studied Numerical examples showed that our method is effective to solve the dual fully fuzzy matrix equatio ACKNOWLEDGEMENS his research was supported by the Natioal Natural Sciece Foudatio of Chia (o ) REFERENCES [1] LA Zadeh, he cocept of a liguistic variable ad its applicatio to approximate reasoig, Iformatio Sciece 8 (1975) [2] D Dubois, H Prade, Operatios o fuzzy umbers, Joural of Systems Sciece 9 (1978) [3] S Nahmias, Fuzzy variables, Fuzzy Sets ad Systems, 1(2)(1978) [4] M Friedma, M Ma, A Kadel, Fuzzy liear systems, Fuzzy Sets ad Systems 96 (1998) [5] M Ma, M Friedma, A Kadel, Duality i Fuzzy liear systems, Fuzzy Sets ad Systems 109 (2000) [6] S Abbasbady, M Otadi, M Mosleh, Miimal solutio of geeral dual fuzzy liear systems, Chaos, Solitios ad Fractals 37 (2008) [7] B Zheg, K Wag, Geeral fuzzy liear systems, Applied Mathematics ad Computatio, 181 (2006) [8] M Dehgha, B Hashemi, M Ghatee, Solutio of the full fuzzy liear systems usig iterative techiques, Chaos, Solitos ad Fractals, 34 (2007) [9] Allahviraloo, M Ghabari, A ew approach to obtai algebraic solutio of iterval liear systems, Soft Computig 16 (2013) [10] R Ghabari, N Mahdavi-Amiri, New solutios of fuzzy liear systems usig rakig fuctios ad ABS algorithms, Applied Mathematical Modellig, 34 (2012) [11] R Ghabari, Solutios of fuzzy algebraic liear systems usig liear programs, Applied Mathematical Modellig, 39 (2015) [12] Allahviraloo, N Mikaeilvad, M Barkhordary, Fuzzy liear matrix equatios, Fuzzy Optimizatio ad Decisio Makig 8 (2009) [13] Z Gog, XB Guo, Icosistet fuzzy matrix equatios ad its fuzzy least squares solutios, Applied Mathematical Modellig 35 (2011) [14] XB Guo, DQ Shag, Fuzzy symmetric solutios of fuzzy matrix equatios, Advaces i Fuzzy Systems, Volume 2012, Article ID , 9 pages 377

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

Solving Fuzzy Assignment Problem Using Fourier Elimination Method Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio

More information

Assignment Problems with fuzzy costs using Ones Assignment Method

Assignment Problems with fuzzy costs using Ones Assignment Method IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha

More information

On Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets

On Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets Iteratioal Joural of Sciece, Egieerig ad echology Research (IJSER), Volume 5, Issue, February 016 O Spectral heory Of -- Arithmetic Mea Idempotet Matrices O Posets 1 Dr N Elumalai, ProfRMaikada, 3 Sythiya

More information

LU Decomposition Method

LU Decomposition Method SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio

More information

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,

More information

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION 397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

Counting the Number of Minimum Roman Dominating Functions of a Graph

Counting the Number of Minimum Roman Dominating Functions of a Graph Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph

More information

Perhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where

Perhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex

More information

An Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach

An Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics

More information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal

More information

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute

More information

An Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem

An Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem Iteratioal Joural of Systems Sciece ad Applied Mathematics 206; (4): 58-62 http://www.sciecepublishiggroup.com/j/ssam doi: 0.648/j.ssam.206004.4 A Algorithm to Solve Fuzzy Trapezoidal Trasshipmet Problem

More information

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences Miig from Quatitative Data with Liguistic Miimum Supports ad Cofideces Tzug-Pei Hog, Mig-Jer Chiag ad Shyue-Liag Wag Departmet of Electrical Egieerig Natioal Uiversity of Kaohsiug Kaohsiug, 8, Taiwa, R.O.C.

More information

Assignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters

Assignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters Iteratioal Joural of Applied Sciece ad Egieerig., 3: 557 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters Amit Kumar ad Aila Gupta * School of Mathematics ad Computer Applicatios,

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

A Method for Solving Balanced Intuitionistic Fuzzy Assignment Problem

A Method for Solving Balanced Intuitionistic Fuzzy Assignment Problem P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : 2248-9622, Vol. 4, ssue 3( Versio 1), March 2014, pp.897-903 RESEARCH ARTCLE OPEN ACCESS A Method for Solvig Balaced tuitioistic

More information

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk

More information

Civil Engineering Computation

Civil Engineering Computation Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso

More information

Method for Solving Unbalanced Transportation Problems Using Trapezoidal Fuzzy Numbers

Method for Solving Unbalanced Transportation Problems Using Trapezoidal Fuzzy Numbers Kadhirvel. K, Balauruga. K / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.ijera.co Vol., Issue 4, Jul-Aug 0, pp.59-596 Method for Solvig Ubalaced Trasportatio Probles Usig

More information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui 2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal

More information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

More information

International Journal of Mathematics Trends and Technology (IJMTT) Volume 52 Number 9 December 2017

International Journal of Mathematics Trends and Technology (IJMTT) Volume 52 Number 9 December 2017 Iteratioal Joural of Mathematics Treds ad Techology (IJMTT) Volume 5 Number 9 December 7 Optimal Solutio of a Degeerate Trasportatio Problem Reea.G.patel, Dr.P.H.Bhathawala Assistat professor, Departmet

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe

More information

A study on Interior Domination in Graphs

A study on Interior Domination in Graphs IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

More information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

Higher-order iterative methods free from second derivative for solving nonlinear equations

Higher-order iterative methods free from second derivative for solving nonlinear equations Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order

More information

Evaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps

Evaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps Joural of pplied Sciece ad griculture, 8(3): 94-99, 23 ISSN 86-92 Evaluatio of Fuzzy Quatities by Distace Method ad its pplicatio i Evirometal Maps Saeifard ad L Talebi Departmet of pplied Mathematics,

More information

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information

Neutrosophic Linear Programming Problems

Neutrosophic Linear Programming Problems Neutrosophic Operatioal Research I Neutrosophic Liear Programmig Problems Abdel-Nasser Hussia Mai Mohamed Mohamed Abdel-Baset 3 Floreti Smaradache 4 Departmet of Iformatio System, Faculty of Computers

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

Fuzzy Transportation Problem Using Triangular Membership Function-A New approach

Fuzzy Transportation Problem Using Triangular Membership Function-A New approach Vol3 No.. PP 8- March 03 ISSN: 3 006X Trasportatio Proble Usig Triagular Mebership Fuctio-A New approach a S. Solaiappaa* K. Jeyaraab Departet of Matheatics Aa UiversityUiversity College of Egieerig Raaathapura

More information

Section 7.2: Direction Fields and Euler s Methods

Section 7.2: Direction Fields and Euler s Methods Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi

More information

Relationship between augmented eccentric connectivity index and some other graph invariants

Relationship between augmented eccentric connectivity index and some other graph invariants Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats

More information

Improved Random Graph Isomorphism

Improved Random Graph Isomorphism Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such

More information

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR

More information

ISSN (Print) Research Article. *Corresponding author Nengfa Hu

ISSN (Print) Research Article. *Corresponding author Nengfa Hu Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com

More information

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig

More information

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New Fuzzy Color Clustering Algorithm Based on hsl Similarity IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper

More information

Some non-existence results on Leech trees

Some non-existence results on Leech trees Some o-existece results o Leech trees László A.Székely Hua Wag Yog Zhag Uiversity of South Carolia This paper is dedicated to the memory of Domiique de Cae, who itroduced LAS to Leech trees.. Abstract

More information

Project 2.5 Improved Euler Implementation

Project 2.5 Improved Euler Implementation Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,

More information

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

IJESMR International Journal OF Engineering Sciences & Management Research

IJESMR International Journal OF Engineering Sciences & Management Research [Geetha, (10): October, 015] ISSN 39-6193 Impact Factor (PIF):.3 Iteratioal Joural OF Egieerig Scieces & Maagemet Research CONSTRUCTION OF DIOPHANTINE QUADRUPLES WITH PROPERTY D(A PERFECT SQUARE) V.Geetha

More information

Homework 1 Solutions MA 522 Fall 2017

Homework 1 Solutions MA 522 Fall 2017 Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

SOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION

SOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION Palestie Joural of Mathematics Vol. 607, 38 46 Palestie Polytechic Uiversity-PPU 07 SOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION Chirag Garg ad R. K. Sharma Commuicated by Ayma Badawi MSC

More information

Relational Interpretations of Neighborhood Operators and Rough Set Approximation Operators

Relational Interpretations of Neighborhood Operators and Rough Set Approximation Operators Relatioal Iterpretatios of Neighborhood Operators ad Rough Set Approximatio Operators Y.Y. Yao Departmet of Computer Sciece, Lakehead Uiversity, Thuder Bay, Otario, Caada P7B 5E1, E-mail: yyao@flash.lakeheadu.ca

More information

Recursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:

Recursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle: Recursio Recursio Jordi Cortadella Departmet of Computer Sciece Priciple: Reduce a complex problem ito a simpler istace of the same problem Recursio Itroductio to Programmig Dept. CS, UPC 2 Mathematical

More information

Prime Cordial Labeling on Graphs

Prime Cordial Labeling on Graphs World Academy of Sciece, Egieerig ad Techology Iteratioal Joural of Mathematical ad Computatioal Scieces Vol:7, No:5, 013 Prime Cordial Labelig o Graphs S. Babitha ad J. Baskar Babujee, Iteratioal Sciece

More information

BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM

BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

The Research Based on Fuzzy Sliding Mode Control for Linear Double. Inverted Pendulum

The Research Based on Fuzzy Sliding Mode Control for Linear Double. Inverted Pendulum Advaced Materials Research Olie: 04-05-3 ISSN: 66-8985, Vols. 96-930, pp 463-467 doi:0.408/www.scietific.et/amr.96-930.463 04 Tras Tech Publicatios, Switzerlad The Research Based o Fuzzy Slidig Mode Cotrol

More information

New Results on Energy of Graphs of Small Order

New Results on Energy of Graphs of Small Order Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order

More information

A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH

A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH J. Appl. Math. & Computig Vol. 21(2006), No. 1-2, pp. 233-238 Website: http://jamc.et A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH YEON SOO YOON AND JU KYUNG KIM Abstract.

More information

CLASSES OF INTERVAL-VALUED FUZZY RELATIONAL INFERENCE TEMPLATES

CLASSES OF INTERVAL-VALUED FUZZY RELATIONAL INFERENCE TEMPLATES Malaysia Joural of Computer Sciece, Vol. 9 No., Jue 996, pp. 42-48 CLASSES OF INTERVAL-VALUED FUZZY RELATIONAL INFERENCE TEMPLATES Yew Kok Meg Faculty of Computer Sciece & Iformatio Techology Uiversity

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Protected points in ordered trees

Protected points in ordered trees Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic

More information

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure

More information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The

More information

A Very Simple Approach for 3-D to 2-D Mapping

A Very Simple Approach for 3-D to 2-D Mapping A Very Simple Approach for -D to -D appig Sadipa Dey (1 Ajith Abraham ( Sugata Sayal ( Sadipa Dey (1 Ashi Software Private Limited INFINITY Tower II 10 th Floor Plot No. - 4. Block GP Salt Lake Electroics

More information

ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION

ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION I terat. J. Mh. & Math. Sci. Vol. (1978) 125-132 125 ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION A. W. GOODMAN ad E. B. SAFF* Mathematics Dept, Uiversity of South Florida Tampa, Florida 33620 Dedicated

More information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The

More information

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology

More information

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

More information

A Recursive Blocked Schur Algorithm for Computing the Matrix Square Root. Deadman, Edvin and Higham, Nicholas J. and Ralha, Rui. MIMS EPrint: 2012.

A Recursive Blocked Schur Algorithm for Computing the Matrix Square Root. Deadman, Edvin and Higham, Nicholas J. and Ralha, Rui. MIMS EPrint: 2012. A Recursive Blocked Schur Algorithm for Computig the Matrix Square Root Deadma, Edvi ad Higham, Nicholas J. ad Ralha, Rui 212 MIMS EPrit: 212.26 Machester Istitute for Mathematical Scieces School of Mathematics

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

A Note on Chromatic Transversal Weak Domination in Graphs

A Note on Chromatic Transversal Weak Domination in Graphs Iteratioal Joural of Mathematics Treds ad Techology Volume 17 Number 2 Ja 2015 A Note o Chromatic Trasversal Weak Domiatio i Graphs S Balamuruga 1, P Selvalakshmi 2 ad A Arivalaga 1 Assistat Professor,

More information

CSE 417: Algorithms and Computational Complexity

CSE 417: Algorithms and Computational Complexity Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm

More information

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015. Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative

More information

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

The number n of subintervals times the length h of subintervals gives length of interval (b-a). Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's

More information

BASED ON ITERATIVE ERROR-CORRECTION

BASED ON ITERATIVE ERROR-CORRECTION A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity

More information

Watermarking Integer Linear Programming Solutions

Watermarking Integer Linear Programming Solutions Watermarkig Iteger Liear Programmig Solutios Seapah Megeria Computer Sciece Departmet Uiversity of Califoria Los Ageles seapah@cs.ucla.edu Mileko Driić Computer Sciece Departmet Uiversity of Califoria

More information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules

More information

5.3 Recursive definitions and structural induction

5.3 Recursive definitions and structural induction /8/05 5.3 Recursive defiitios ad structural iductio CSE03 Discrete Computatioal Structures Lecture 6 A recursively defied picture Recursive defiitios e sequece of powers of is give by a = for =0,,, Ca

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

More information

The Extended Weibull Geometric Family

The Extended Weibull Geometric Family The Exteded Weibull Geometric Family Giovaa Oliveira Silva 1 Gauss M. Cordeiro 2 Edwi M. M. Ortega 3 1 Itroductio The literature o Weibull models is vast, disjoited, ad scattered across may differet jourals.

More information

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4 1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:

More information

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures Uiversity of Waterloo Departmet of Electrical ad Computer Egieerig ECE 250 Algorithms ad Data Structures Midterm Examiatio ( pages) Istructor: Douglas Harder February 7, 2004 7:30-9:00 Name (last, first)

More information

A Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions

A Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

Super Vertex Magic and E-Super Vertex Magic. Total Labelling

Super Vertex Magic and E-Super Vertex Magic. Total Labelling Proceedigs of the Iteratioal Coferece o Applied Mathematics ad Theoretical Computer Sciece - 03 6 Super Vertex Magic ad E-Super Vertex Magic Total Labellig C.J. Deei ad D. Atoy Xavier Abstract--- For a

More information

1.2 Binomial Coefficients and Subsets

1.2 Binomial Coefficients and Subsets 1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =

More information

On Computing the Fuzzy Weighted Average Using the KM Algorithms

On Computing the Fuzzy Weighted Average Using the KM Algorithms O Computig the Fuzzy Weighted Average Usig the KM Algorithms Feilog iu ad Jerry M Medel Sigal ad Image Processig Istitute, Departmet of Electrical Egieerig Uiversity of Souther Califoria, 3740 McClitock

More information