A New Grey-rough Set Model Based on Interval-Valued Grey Sets
|
|
- Leon Harris
- 5 years ago
- Views:
Transcription
1 Proceedings of the 009 IEEE Interntionl Conference on Systems Mn nd Cybernetics Sn ntonio TX US - October 009 New Grey-rough Set Model sed on Intervl-Vlued Grey Sets Wu Shunxing Deprtment of utomtion Ximen University Ximen P R Chin E-mil: sxwu@xmu edu cn Lin LihuGo Qinqun Deprtment of utomtion Ximen University Ximen P R Chin E-mil: 00@qq com bstrct In this pper novel grey rough set model for intervl-vlued grey sets informtion systems nmed intervlvlued grey-rough set model is proposed nd the bsic theory nd propositions of the intervl-vlued grey-rough sets is studied sed on the proposed intervl-vlued rough grey model rough similrity degree is defined nd the clustering of the intervl-vlued grey informtion systems is lso exmined in the menwhile some exmples re presented respectively Keywords intervl-vlued grey sets grey-rough set grey cluster I INTRODUCTION Rough set theory primrily proposed by Pwlk [] is useful mthemticl frmework to del with imprecision vgueness nd uncertinty in informtion systems This theory hs been mply demonstrted to hve usefulness nd verstility by successful ppliction in vriety of problems such s in pttern recognition mchine lerning dt mining clssifiction clustering concurrent systems decision nlysis [] imge processing informtion retrievl knsei engineering signl processing system modeling nd voice recognition Pwlk proposed miniml decision rule induction from n indiscernibility reltion nd lso proposed two rough pproximtions n upper pproximtion tht dels with possibility nd lower pproximtion tht dels with certinty of informtion tbles In prticulr rough pproximtion is bsic mthemticl model for hndling informtion tbles However Clssicl rough sets minly del with nominl dt or multi-vlued discrete dt such s smll lrge short long true or flse nd the clssicl rough set theory hs difficulty in hndling intervl-vlued of ttributes which exist in the rel world Informtion tbles in the rel world however re quite complicted Mny mesured vlues given s grey dt which hve rnge for exmple ID mss No temperture nd so on Such vlue rnges cn be described by intervl sets in this pper Grey system theory proposed by Deng [] covers grey clssifiction grey control grey decision-mking grey prediction grey structurl modeling grey reltionl nlysis [] etc It dels with the uncertinty over how systems with incomplete or lck of informtion should be controlled One of the importnt concepts is grey number It is number whose exct vlue is unknown but rnge is known Thus grey system theory dels with uncertinty unlike those of fuzzy set theory or rough set theory The grey opertion is one of the opertions for grey numbers tht modifies rnge of given intervls of grey sets It is more suitble to hndling informtion tbles contining intervl set Theories of rough sets nd grey sets re generliztions of clssicl set theories for modeling vgueness nd fuzziness respectively [] It is generlly ccepted tht these two theories re relted but distinct nd complementry to ech other [90] s generliztion of grey sets the notion of intervl-vlued grey sets ws suggested by which we describe the incomplete informtion system in this pper [] In this pper we first proposed novel grey rough set model for intervl-vlued grey sets dt nmed intervl-vlued grey-rough set nd its upper pproximtion nd lower pproximtion is defined then we investigte its propositions bsed on it rough similrity degree is defined which is pointed out resonble in the menwhile some exmples re presented respectively II PRELIMINRIES Intervl-vlued grey sets Let U denote the universl set x denote n element of U Definition : n intervl-vlued grey sets is set whose exct elements is uncertin but rnge is known Let G be n intervl-vlued grey mpping set of U defined by two crisp sets of the upper bound nd the lower bound s follows: P Q where PQ re two crisp sets stisfying P Q In other words denote the set of vlue rnge tht my hold Q Throughout this pper we mrk it s = P Especilly when P = Q the intervl-vlued grey sets G becomes crisp set which mens tht intervl-vlued grey system theory dels with flexibly sets sitution Tolernce reltion bsed on intervl-vlued grey sets R Definition : Let U be non-empty finite universe be the tolernce reltion on the U with respect to ll ttributes /09/$ IEEE 0
2 in [ ] R denotes the tolernt clss which including the then ( U R is the Pwlk pproximtion spce For ny intervl-vlued grey set the tolernce reltion defined s follows: R cn be R = {( ( x ( y U U f ( ( x f ( ( y φ The tolernt clss induced by the tolernce reltion R is the set of objects ( x i e [ ( x] = { ( y U ( ( x ( y R = { ( y U f ( ( x f ( ( y φ Where [ ( x] describes the set of objects tht my tolernt with ( x in terms of in n intervl-vlued grey informtion system From the definition of [ ( x] the following properties cn be esily obtined Property : Let ( U G be n intervl-vlued grey informtion system nd then R is reflexive symmetric If then R R R [ ( x] [ ( x] [ ( x] For ny then R = R { From the definition we know P = {[ ( x] ( x U constitute covering of U Definition Given two intervl-vlued grey sets ( ( x + x x y+ = x nd ( y ( y = y where objects x y U The intervl-vlued grey sets opertion is defined s follows: ( x + ( y + ( x + x y z y + x y = x y ( x + ( y + ( x + x y z y + x y = x y ( x ( y x y x y ndx y Exmple : n intervl-vlued grey informtion system is presented in Tble Compute the clssifiction induced by the tolernce reltion R in Tble I TLE I INTERVL-VLUED GREY INFORMTION SYSTEM U ( x ( x ( x ( x ( x ( x ( x ( x { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { { From tble I we cn get: [ ( x ] { ( ( ( ( = x [ ( x ] { ( ( ( ( ( = [ ( x ] { ( ( ( ( = x [ ( x ] { ( ( ( ( = [ ( x ] = { ( ( ( ( ( x [ ( x ] { ( ( ( ( ( = So [ ( x ] { ( ( ( ( = [ ( x ] { ( ( ( ( = nlogously we cn get tolernt clss of ll the objects in the universe III THE INTERVL-VLUED GREY-ROUGH SET MODELS Definition : For ny intervl-vlued grey set ( x we define: 0
3 R( ( x = { ( s U f ( ( s f ( ( x ndf ( ( s f ( ( x R( ( x = { ( s U f ( ( s f ( ( x φ ( s ( x f ( ( s f ( ( x ndf ( ( s f ( ( x Where ( s ( x denote grey objects f ( ( s f ( ( x denote the vlue of grey objects ( s ( x in terms of ttribute R( ( x R( ( x is clled the lower pproximtion nd the upper pproximtion of the intervl-vlued grey set ( x bout the pproximtion spce ( U R with respect to the ttribute respectively Property : Let ( U F be n intervl-vlued grey informtion system from the definition bove we hve tht: R( ( x = R( ( x R ( ( x = R( ( x nd if R( ( x = φ then R( ( x = φ especilly Lemm: Given two intervl-vlued grey sets x+ R( ( x y+ x nd R( ( y then: y If x = y nd x y then R( ( x R( ( y x y R( ( x R( ( y x = y If x y nd x = y then R( ( x R( ( y x y R( ( x R( ( y x y If x y nd x y then R( ( x R( ( y x y R( ( x R( ( y x y If x y nd x y then R( ( x R( ( y x y Proof: It is esy to prove this conclusion by the definition Property : Let ( U G be n intervl-vlued grey informtion system we hve tht: R( ( x R( ( x If (x = Ω then R( ( x = R( ( x = U if (x = φ then R( ( x = R( ( x = φ If ( x ( y then R( ( x R( ( y R( ( x R( ( y If then R( ( x R( ( x If ( x ( y ( z then R( ( x R( ( y R( ( z If y R( ( x then R( ( y R( ( x R( ( y R( ( x Proof: They re strightforwrd Property : Let ( U R be Pwlk pproximtion spce then the following properties hold for ny intervlvlued grey sets ( x nd ( y of the universeu : R(( ( x ( ( y R(( ( x R(( ( y R(( ( x ( ( y R(( ( x R(( ( y R(( ( x ( ( y = R(( ( x R(( ( y R(( ( x ( ( y = R(( ( x R(( ( y Where R( ( x R( ( x denote the lower pproximtion nd the upper pproximtion of the intervlvlued grey set ( x with respect to the ttribute nd f + ( ( x f ( ( x denote the upper bound nd the lower bound of the intervl-vlued grey set ( x in terms of the ttribute respectively Proof: R(( ( x ( ( y = { ( s f + ( ( s f + ( ( x f + ( ( y nd f ( ( s f ( ( x f ( ( y 0
4 Note tht { ( s f + ( ( s f + ( ( y f + ( ( x nd f ( ( s f ( ( y f ( ( x { ( s f ( ( s f ( ( x nd f ( ( s f ( ( x { ( s f ( ( s f ( ( y nd f ( ( s f ( ( y = R(( ( x R(( ( y Tht is R(( ( x ( ( y R(( ( x R(( ( y R( f ( ( x f ( ( y = { ( s f + ( ( s f + ( ( y f + ( ( x nd f ( ( s f ( ( y f ( ( x Note tht { ( s f + ( ( s f + ( ( y f + ( ( x nd f ( ( s f ( ( y f ( ( x { { ( s f ( ( s f ( ( y nd f ( ( s f ( ( y { { ( s f ( ( s f ( ( x nd f ( ( s f ( ( x = R( f ( ( x R( f ( ( y Tht is R(( ( x ( ( y R(( ( x R(( ( y R(( ( x ( ( y = { ( s f ( ( s [ f ( ( x f ( ( y ] φ + = { ( s f ( ( s f ( ( x f ( ( y φ = { ( s f ( s f ( ( x φ nd f + ( ( s f + ( ( y φ = { { ( s f + ( ( s f + ( ( x φ { { ( s f + ( ( s f + ( ( y φ = R(( ( x R(( ( y R(( ( x ( ( y = { ( s f ( ( s [ f ( ( x f ( ( y ] φ + = { ( s f ( ( s [ f ( ( x f ( ( y] φ = { ( s f ( ( s f ( ( x φ f + ( ( s f + ( ( y φ = { { ( s f + ( ( s f + ( ( x φ { { ( s f + ( ( s f + ( ( y φ = R(( ( x R(( ( y The proof is complete Exmple :( continue exmple Compute the lower pproximtion nd the upper pproximtion of the intervlvlued grey objects : R( ( x = { ( x ( x R( ( x { ( = R( ( x { ( ( ( = R ( ( x { ( ( ( ( = R ( ( x { ( ( ( ( = x R( ( x { ( ( ( = R ( ( x { ( ( ( = R( ( x { ( ( ( = R( ( x { ( ( ( = R( ( x { ( ( ( ( ( = R( ( x { ( ( ( ( = R( ( x { ( ( ( ( ( = 0
5 Then R( ( x { ( = R( ( x { ( ( ( = R( ( x { ( ( = R( ( x { ( ( ( ( = Similrly we cn get ll the objects s follows: R( ( x { ( = R( ( x { ( ( ( ( = R( ( x { ( = R( ( x { ( ( ( ( = R( ( x { ( = R( ( x = { U R( ( x { ( ( = R( ( x { ( ( ( ( = R( ( x { ( = R( ( x { ( ( = R( ( x { ( ( ( ( = IV SIMILRITY DEGREE ND PROPERTIES IN THE INTERVL-VLUED GREY SET INFORMTION SYSTEM Inspired by the wy of fuzzy clustering in fuzzy set we introduce novel similrity degree to mesure the similrity of two objects Further more we point out tht the new similrity degree we propose in this pper is meeting with the xiomtic definition of similrity degree We first give the xiomtic definition of similrity degree s follows Definition : Let γ : ( x y γ ( x y be the binry function on the U nd it stisfy tht: γ ( xx = γ( x φ = 0 Definition Given intervl-vlued grey objects ( x ( x of the U nd ( R( ( x R( ( x ( R( ( y R( ( y then we define similrity degree s follows: R( ( x R( ( y S( ( x ( y = α + R( ( x R( ( y R( ( x R( ( y β R( ( x R( ( y Where α + β = nd * denotes the crdinlity of set R( ( x R( ( y Especilly S = is clled the R( ( x R( ( y similrity degree of lower pproximtion nd R( ( x R( ( y S = is clled the similrity degree of R( ( x R( ( y upper pproximtion From the definition bove we hve tht: S( ( x ( x = S( ( x φ = 0 S( ( x ( y = S( ( y ( x I f ( x ( y ( z then S( ( x (z min{ S( ( x ( y S( (y (z Proof: is strightforwrd If ( x ( y ( z then R( ( x R( ( y R( ( z nd R( ( x R( ( y R( ( z R( ( x R( ( y R( ( z Further more R( ( x R( ( y S( ( x ( y = α R( ( x R( ( y R( ( x R( ( y + β R( ( x R( ( y R( ( x R( ( x R( ( y R( ( y γ( x y = γ( y x x y z γ( x z min{ γ( x y γ( y z Then we cll it similrity degree S( ( y ( z = α R( ( y R( ( z R( ( y R( ( z 0
6 S ( ( x ( z = α R( ( y R( ( z + β R( ( y R( ( z R( ( y R( ( y R( ( z R( ( z R ( ( x R( ( z R ( ( x R( ( z R( ( x R( ( z + β R( ( x R( ( z R( ( x R( ( x R( ( z R( ( z So we hve S( ( x (z S( ( x ( y nd S( ( x (z S( ( y ( z Tht is S( ( x (z min{ S( ( x ( y S( (y (z From bove we cn conclude sfely tht the definition of similrity degree is resonble Property :If R( ( x = R( ( y nd R( ( x = R( ( y then S( ( x ( y = Especilly when y R( ( x R ( ( y R( ( y S( ( x ( y R ( ( x R( ( x Exmple : (continue exmple Let α = 0 then similrity degree of ech object cn be clculted ccording to the definition s follows: S ( ( x ( = R( ( x ( ( R R( ( x ( ( R R( ( x ( ( R R( ( x ( ( R { ( x ( x ( x ( x { ( x ( x ( x ( x = 0 { ( x ( x ( x ( x { ( x ( x ( x ( x = / In similr wy we cn lso get ll the objects nd construct similrity degree mtrix (see tble II TLE II SIMILRITY DEGREE MTRIX S ( x ( x ( x ( x ( x ( x ( x ( x ( x / / / / / /0 / ( x / / / /0 / ( x / / / /0 / ( x / / /0 / ( x / / / ( x /0 / ( x /0 ( x From the tble bove if let λ = 0 then the universe cn V CONCLUSION be clustered into four clsses: Rough sets nd grey sets theory re two mthemticl tools { ( x ( ( { ( x ( ( to del with uncertinty Combining them together is of both theoreticl nd prcticl importnce This pper combines the { ( x { ( x intervl-vlued grey sets with the rough sets proposes novel grey rough set model for intervl-vlued grey sets dt nmed intervl-vlued grey-rough set nd studies the bsic theory of the intervl-vlued rough grey sets sed on the generlized intervl-vlued rough grey sets the clustering of the intervlvlued grey informtion systems is lso studied Our future 0
7 work will concentrte on the intervl-vlued grey rough set model in the intervl-vlued grey informtion systems n ppliction of the model which is presented in this pper will lso be reserched in the future CKNOWLEDGMENT The uthors of this pper would like to pprecite the nonymous reviewers of this pper for their crefully reding of the mnuscript s well s their mny helpfully suggestions nd corrections REFERENCES [] Z Pwlk Rough sets: Theoreticl spects of Resoning bout Dt oston: Kluwer cdemic Publishers 99 [] W X Zhng Y Ling W Z Wu Informtion system nd knowledge discovery eijing Publish House of Science 00 [] W X Zhng G F Qiu Uncertin Decision Mking sed on Rough Sets Science Press eijing Chin 00 [] S X Wu Grey Rough Set Model nd Its ppliction eijing Publish House of Science 009 [] J L Deng Foundtion of grey theory Wuhn Publish House of Huzhong University of Science nd Technology 00 [] Q Y Wng Foundtion of grey mthemtics Wuhn Huzhong University of Science nd Technology 99 [] D Ymguchi G D Li M Ngi grey-bsed rough pproximtion model for intervl dt processing Informtion Sciences vol 00 pp [] S F Liu Y Lin n Introduction to Grey Systems Methodology nd pplictions Slippery Rock: IIGSS cdemic Publisher 99 [9] S X Wu S F Liu M Q Li Study of integrte models of rough sets nd grey systems Fuzzy Systems nd Knowledge Discovery Proceedings Lecture Notes in rtificil Intelligence no ug 00 pp - [0] D Luo S F Liu S X Wu: Reserch on the Grey Rough Combined Decision-mking Model Journl of Ximen University Vol (00-0 [] Turken Intervl vlued fuzzy sets bsed on norml forms Fuzzy Sets nd Systemsvol0 9 pp9 0 [] DDubois nd HPrde Rough fuzzy sets nd fuzzy rough sets Int J Gen Syst vol no 990pp 9 09 [] ZT Gong Z Sun DG Chen Rough set theory for the intervlvlued fuzzy informtion systems Informtion Sciences vol00 pp9 9 [] S Greco Mtrzzo R Slowinski Rough sets theory for multicriteri decision nlysis Europen Journl of Opertionl Reserch
2 PRELIMINARY. 2.1 Variable Precision Rough Set Theory
ough Fuzzy Set sed on Logicl Disjunct Opertion of Vrible Precision nd Grde in Ordered Informtion System Ynting Guo 1 Weihu u 12 1 School of mthemtics nd sttistics Chongqing University of Technology Chongqing
More informationNew Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University
More informationIntuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras
Intuitionistic Fuzzy Lttices nd Intuitionistic Fuzzy oolen Algebrs.K. Tripthy #1, M.K. Stpthy *2 nd P.K.Choudhury ##3 # School of Computing Science nd Engineering VIT University Vellore-632014, TN, Indi
More informationRough Lattice: A Combination with the Lattice Theory and the Rough Set Theory
06 Interntionl Conference on Mechtronics, Control nd Automtion Engineering (MCAE 06) ough Lttice: A Combintion with the Lttice Theory nd the ough Set Theory Yingcho Sho,*, Li Fu, Fei Ho 3 nd Keyun Qin
More informationTravelling Profile Solutions For Nonlinear Degenerate Parabolic Equation And Contour Enhancement In Image Processing
Applied Mthemtics E-Notes 8(8) - c IN 67-5 Avilble free t mirror sites of http://www.mth.nthu.edu.tw/ men/ Trvelling Profile olutions For Nonliner Degenerte Prbolic Eqution And Contour Enhncement In Imge
More informationExtensions of Chebyshev inequality for fuzzy integral and applications
Extensions of Chebyshev inequlity for fuzzy integrl nd pplictions H. Román-Flores, Y. Chlco-Cno, nd. Flores-Frnulič Instituto de lt Investigción, Universidd de Trpcá {hromn,ychlco,flores}@ut.cl bstrct.
More informationMultiplication and Division of Triangular Fuzzy Numbers
Dffodil Interntionl University Institutionl Repository DIU Journl of Science nd Technology Volume Issue July 6 6-7 Multipliction nd Division of Tringulr Fuzzy Numbers Rhmn Md. Mosfiqur Dffodil Interntionl
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationCS667 Lecture 6: Monte Carlo Integration 02/10/05
CS667 Lecture 6: Monte Crlo Integrtion 02/10/05 Venkt Krishnrj Lecturer: Steve Mrschner 1 Ide The min ide of Monte Crlo Integrtion is tht we cn estimte the vlue of n integrl by looking t lrge number of
More informationCredibility Hypothesis Testing of Fuzzy Triangular Distributions
666663 Journl of Uncertin Systems Vol.9, No., pp.6-74, 5 Online t: www.jus.org.uk Credibility Hypothesis Testing of Fuzzy Tringulr Distributions S. Smpth, B. Rmy Received April 3; Revised 4 April 4 Abstrct
More informationNew data structures to reduce data size and search time
New dt structures to reduce dt size nd serch time Tsuneo Kuwbr Deprtment of Informtion Sciences, Fculty of Science, Kngw University, Hirtsuk-shi, Jpn FIT2018 1D-1, No2, pp1-4 Copyright (c)2018 by The Institute
More informationAcceptance Sampling by Attributes
Introduction Acceptnce Smpling by Attributes Acceptnce smpling is concerned with inspection nd decision mking regrding products. Three spects of smpling re importnt: o Involves rndom smpling of n entire
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationHermite-Hadamard type inequalities for harmonically convex functions
Hcettepe Journl o Mthemtics nd Sttistics Volume 43 6 4 935 94 Hermite-Hdmrd type ineulities or hrmoniclly convex unctions İmdt İşcn Abstrct The uthor introduces the concept o hrmoniclly convex unctions
More informationNEW INEQUALITIES OF SIMPSON S TYPE FOR s CONVEX FUNCTIONS WITH APPLICATIONS. := f (4) (x) <. The following inequality. 2 b a
NEW INEQUALITIES OF SIMPSON S TYPE FOR s CONVEX FUNCTIONS WITH APPLICATIONS MOHAMMAD ALOMARI A MASLINA DARUS A AND SEVER S DRAGOMIR B Abstrct In terms of the first derivtive some ineulities of Simpson
More information8 Laplace s Method and Local Limit Theorems
8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved
More informationQUADRATURE is an old-fashioned word that refers to
World Acdemy of Science Engineering nd Technology Interntionl Journl of Mthemticl nd Computtionl Sciences Vol:5 No:7 011 A New Qudrture Rule Derived from Spline Interpoltion with Error Anlysis Hdi Tghvfrd
More informationSome estimates on the Hermite-Hadamard inequality through quasi-convex functions
Annls of University of Criov, Mth. Comp. Sci. Ser. Volume 3, 7, Pges 8 87 ISSN: 13-693 Some estimtes on the Hermite-Hdmrd inequlity through qusi-convex functions Dniel Alexndru Ion Abstrct. In this pper
More informationContinuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht
More informationThe First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).
The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples
More informationLecture 20: Numerical Integration III
cs4: introduction to numericl nlysis /8/0 Lecture 0: Numericl Integrtion III Instructor: Professor Amos Ron Scribes: Mrk Cowlishw, Yunpeng Li, Nthnel Fillmore For the lst few lectures we hve discussed
More informationRealistic Method for Solving Fully Intuitionistic Fuzzy. Transportation Problems
Applied Mthemticl Sciences, Vol 8, 201, no 11, 6-69 HKAR Ltd, wwwm-hikricom http://dxdoiorg/10988/ms20176 Relistic Method for Solving Fully ntuitionistic Fuzzy Trnsporttion Problems P Pndin Deprtment of
More informationParametrized inequality of Hermite Hadamard type for functions whose third derivative absolute values are quasi convex
Wu et l. SpringerPlus (5) 4:83 DOI.8/s44-5-33-z RESEARCH Prmetrized inequlity of Hermite Hdmrd type for functions whose third derivtive bsolute vlues re qusi convex Shn He Wu, Bnyt Sroysng, Jin Shn Xie
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationLecture 1: Introduction to integration theory and bounded variation
Lecture 1: Introduction to integrtion theory nd bounded vrition Wht is this course bout? Integrtion theory. The first question you might hve is why there is nything you need to lern bout integrtion. You
More informationBest Approximation in the 2-norm
Jim Lmbers MAT 77 Fll Semester 1-11 Lecture 1 Notes These notes correspond to Sections 9. nd 9.3 in the text. Best Approximtion in the -norm Suppose tht we wish to obtin function f n (x) tht is liner combintion
More informationPath product and inverse M-matrices
Electronic Journl of Liner Algebr Volume 22 Volume 22 (2011) Article 42 2011 Pth product nd inverse M-mtrices Yn Zhu Cheng-Yi Zhng Jun Liu Follow this nd dditionl works t: http://repository.uwyo.edu/el
More informationKeywords : Generalized Ostrowski s inequality, generalized midpoint inequality, Taylor s formula.
Generliztions of the Ostrowski s inequlity K. S. Anstsiou Aristides I. Kechriniotis B. A. Kotsos Technologicl Eductionl Institute T.E.I.) of Lmi 3rd Km. O.N.R. Lmi-Athens Lmi 3500 Greece Abstrct Using
More informationAn optimal 3-point quadrature formula of closed type and error bounds
Revist Colombin de Mtemátics Volumen 8), págins 9- An optiml 3-point qudrture formul of closed type nd error bounds Un fórmul de cudrtur óptim de 3 puntos de tipo cerrdo y error de fronter Nend Ujević,
More informationINEQUALITIES FOR GENERALIZED WEIGHTED MEAN VALUES OF CONVEX FUNCTION
INEQUALITIES FOR GENERALIZED WEIGHTED MEAN VALUES OF CONVEX FUNCTION BAI-NI GUO AND FENG QI Abstrct. In the rticle, using the Tchebycheff s integrl inequlity, the suitble properties of double integrl nd
More informationRELATIONS ON BI-PERIODIC JACOBSTHAL SEQUENCE
TJMM 10 018, No., 141-151 RELATIONS ON BI-PERIODIC JACOBSTHAL SEQUENCE S. UYGUN, H. KARATAS, E. AKINCI Abstrct. Following the new generliztion of the Jcobsthl sequence defined by Uygun nd Owusu 10 s ĵ
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationA General Dynamic Inequality of Opial Type
Appl Mth Inf Sci No 3-5 (26) Applied Mthemtics & Informtion Sciences An Interntionl Journl http://dxdoiorg/2785/mis/bos7-mis A Generl Dynmic Inequlity of Opil Type Rvi Agrwl Mrtin Bohner 2 Donl O Regn
More informationExpected Value of Function of Uncertain Variables
Journl of Uncertin Systems Vol.4, No.3, pp.8-86, 2 Online t: www.jus.org.uk Expected Vlue of Function of Uncertin Vribles Yuhn Liu, Minghu H College of Mthemtics nd Computer Sciences, Hebei University,
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationPurpose of the experiment
Newton s Lws II PES 6 Advnced Physics Lb I Purpose of the experiment Exmine two cses using Newton s Lws. Sttic ( = 0) Dynmic ( 0) fyi fyi Did you know tht the longest recorded flight of chicken is thirteen
More informationGENERALIZED ABSTRACTED MEAN VALUES
GENERALIZED ABSTRACTED MEAN VALUES FENG QI Abstrct. In this rticle, the uthor introduces the generlized bstrcted men vlues which etend the concepts of most mens with two vribles, nd reserches their bsic
More informationChapter 5 : Continuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 216 Néhémy Lim Chpter 5 : Continuous Rndom Vribles Nottions. N {, 1, 2,...}, set of nturl numbers (i.e. ll nonnegtive integers); N {1, 2,...}, set of ll
More informationMAC-solutions of the nonexistent solutions of mathematical physics
Proceedings of the 4th WSEAS Interntionl Conference on Finite Differences - Finite Elements - Finite Volumes - Boundry Elements MAC-solutions of the nonexistent solutions of mthemticl physics IGO NEYGEBAUE
More informationAN INEQUALITY OF OSTROWSKI TYPE AND ITS APPLICATIONS FOR SIMPSON S RULE AND SPECIAL MEANS. I. Fedotov and S. S. Dragomir
RGMIA Reserch Report Collection, Vol., No., 999 http://sci.vu.edu.u/ rgmi AN INEQUALITY OF OSTROWSKI TYPE AND ITS APPLICATIONS FOR SIMPSON S RULE AND SPECIAL MEANS I. Fedotov nd S. S. Drgomir Astrct. An
More informationSolution to Fredholm Fuzzy Integral Equations with Degenerate Kernel
Int. J. Contemp. Mth. Sciences, Vol. 6, 2011, no. 11, 535-543 Solution to Fredholm Fuzzy Integrl Equtions with Degenerte Kernel M. M. Shmivnd, A. Shhsvrn nd S. M. Tri Fculty of Science, Islmic Azd University
More informationGeneration of Lyapunov Functions by Neural Networks
WCE 28, July 2-4, 28, London, U.K. Genertion of Lypunov Functions by Neurl Networks Nvid Noroozi, Pknoosh Krimghee, Ftemeh Sfei, nd Hmed Jvdi Abstrct Lypunov function is generlly obtined bsed on tril nd
More informationWENJUN LIU AND QUÔ C ANH NGÔ
AN OSTROWSKI-GRÜSS TYPE INEQUALITY ON TIME SCALES WENJUN LIU AND QUÔ C ANH NGÔ Astrct. In this pper we derive new inequlity of Ostrowski-Grüss type on time scles nd thus unify corresponding continuous
More informationApplication of Exp-Function Method to. a Huxley Equation with Variable Coefficient *
Interntionl Mthemticl Forum, 4, 9, no., 7-3 Appliction of Exp-Function Method to Huxley Eqution with Vrible Coefficient * Li Yo, Lin Wng nd Xin-Wei Zhou. Deprtment of Mthemtics, Kunming College Kunming,Yunnn,
More informationJim Lambers MAT 169 Fall Semester Lecture 4 Notes
Jim Lmbers MAT 169 Fll Semester 2009-10 Lecture 4 Notes These notes correspond to Section 8.2 in the text. Series Wht is Series? An infinte series, usully referred to simply s series, is n sum of ll of
More informationNew Integral Inequalities for n-time Differentiable Functions with Applications for pdfs
Applied Mthemticl Sciences, Vol. 2, 2008, no. 8, 353-362 New Integrl Inequlities for n-time Differentible Functions with Applictions for pdfs Aristides I. Kechriniotis Technologicl Eductionl Institute
More informationFUNCTIONS OF α-slow INCREASE
Bulletin of Mthemticl Anlysis nd Applictions ISSN: 1821-1291, URL: http://www.bmth.org Volume 4 Issue 1 (2012), Pges 226-230. FUNCTIONS OF α-slow INCREASE (COMMUNICATED BY HÜSEYIN BOR) YILUN SHANG Abstrct.
More informationDecomposition of terms in Lucas sequences
Journl of Logic & Anlysis 1:4 009 1 3 ISSN 1759-9008 1 Decomposition of terms in Lucs sequences ABDELMADJID BOUDAOUD Let P, Q be non-zero integers such tht D = P 4Q is different from zero. The sequences
More informationSection 14.3 Arc Length and Curvature
Section 4.3 Arc Length nd Curvture Clculus on Curves in Spce In this section, we ly the foundtions for describing the movement of n object in spce.. Vector Function Bsics In Clc, formul for rc length in
More informationMA 124 January 18, Derivatives are. Integrals are.
MA 124 Jnury 18, 2018 Prof PB s one-minute introduction to clculus Derivtives re. Integrls re. In Clculus 1, we lern limits, derivtives, some pplictions of derivtives, indefinite integrls, definite integrls,
More informationODE: Existence and Uniqueness of a Solution
Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =
More informationOn the interval Legendre polynomials
Journl of Computtionl nd Applied Mthemtics 154 (003 15 7 www.elsevier.com/locte/cm On the intervl Legendre polynomils F.Ptrcio, J.A.Ferreir, F.Oliveir Deprtment of Mthemtics, University of Coimbr, Aprtdo
More informationarxiv: v1 [math.ra] 1 Nov 2014
CLASSIFICATION OF COMPLEX CYCLIC LEIBNIZ ALGEBRAS DANIEL SCOFIELD AND S MCKAY SULLIVAN rxiv:14110170v1 [mthra] 1 Nov 2014 Abstrct Since Leibniz lgebrs were introduced by Lody s generliztion of Lie lgebrs,
More informationThe Riemann-Lebesgue Lemma
Physics 215 Winter 218 The Riemnn-Lebesgue Lemm The Riemnn Lebesgue Lemm is one of the most importnt results of Fourier nlysis nd symptotic nlysis. It hs mny physics pplictions, especilly in studies of
More informationBinding Numbers for all Fractional (a, b, k)-critical Graphs
Filomt 28:4 (2014), 709 713 DOI 10.2298/FIL1404709Z Published by Fculty of Sciences nd Mthemtics, University of Niš, Serbi Avilble t: http://www.pmf.ni.c.rs/filomt Binding Numbers for ll Frctionl (, b,
More information11 An introduction to Riemann Integration
11 An introduction to Riemnn Integrtion The PROOFS of the stndrd lemms nd theorems concerning the Riemnn Integrl re NEB, nd you will not be sked to reproduce proofs of these in full in the exmintion in
More informationThe practical version
Roerto s Notes on Integrl Clculus Chpter 4: Definite integrls nd the FTC Section 7 The Fundmentl Theorem of Clculus: The prcticl version Wht you need to know lredy: The theoreticl version of the FTC. Wht
More informationMath 8 Winter 2015 Applications of Integration
Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl
More information1.9 C 2 inner variations
46 CHAPTER 1. INDIRECT METHODS 1.9 C 2 inner vritions So fr, we hve restricted ttention to liner vritions. These re vritions of the form vx; ǫ = ux + ǫφx where φ is in some liner perturbtion clss P, for
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More information1 Online Learning and Regret Minimization
2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in
More informationSongklanakarin Journal of Science and Technology SJST R1 Akram. N-Fuzzy BiΓ -Ternary Semigroups
ongklnkrin Journl of cience nd Technology JT-0-0.R Akrm N-Fuzzy Bi -Ternry emigroups Journl: ongklnkrin Journl of cience nd Technology Mnuscript ID JT-0-0.R Mnuscript Type: Originl Article Dte ubmitted
More informationAN INTEGRAL INEQUALITY FOR CONVEX FUNCTIONS AND APPLICATIONS IN NUMERICAL INTEGRATION
Applied Mthemtics E-Notes, 5(005), 53-60 c ISSN 1607-510 Avilble free t mirror sites of http://www.mth.nthu.edu.tw/ men/ AN INTEGRAL INEQUALITY FOR CONVEX FUNCTIONS AND APPLICATIONS IN NUMERICAL INTEGRATION
More informationKRASNOSEL SKII TYPE FIXED POINT THEOREM FOR NONLINEAR EXPANSION
Fixed Point Theory, 13(2012), No. 1, 285-291 http://www.mth.ubbcluj.ro/ nodecj/sfptcj.html KRASNOSEL SKII TYPE FIXED POINT THEOREM FOR NONLINEAR EXPANSION FULI WANG AND FENG WANG School of Mthemtics nd
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More informationThe final exam will take place on Friday May 11th from 8am 11am in Evans room 60.
Mth 104: finl informtion The finl exm will tke plce on Fridy My 11th from 8m 11m in Evns room 60. The exm will cover ll prts of the course with equl weighting. It will cover Chpters 1 5, 7 15, 17 21, 23
More informationOn the Generalized Weighted Quasi-Arithmetic Integral Mean 1
Int. Journl of Mth. Anlysis, Vol. 7, 2013, no. 41, 2039-2048 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/10.12988/ijm.2013.3499 On the Generlized Weighted Qusi-Arithmetic Integrl Men 1 Hui Sun School
More informationA unified generalization of perturbed mid-point and trapezoid inequalities and asymptotic expressions for its error term
An. Ştiinţ. Univ. Al. I. Cuz Işi. Mt. (N.S. Tomul LXIII, 07, f. A unified generliztion of perturbed mid-point nd trpezoid inequlities nd symptotic expressions for its error term Wenjun Liu Received: 7.XI.0
More informationSection 11.5 Estimation of difference of two proportions
ection.5 Estimtion of difference of two proportions As seen in estimtion of difference of two mens for nonnorml popultion bsed on lrge smple sizes, one cn use CLT in the pproximtion of the distribution
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationarxiv:math/ v2 [math.ho] 16 Dec 2003
rxiv:mth/0312293v2 [mth.ho] 16 Dec 2003 Clssicl Lebesgue Integrtion Theorems for the Riemnn Integrl Josh Isrlowitz 244 Ridge Rd. Rutherford, NJ 07070 jbi2@njit.edu Februry 1, 2008 Abstrct In this pper,
More informationLearning Moore Machines from Input-Output Traces
Lerning Moore Mchines from Input-Output Trces Georgios Gintmidis 1 nd Stvros Tripkis 1,2 1 Alto University, Finlnd 2 UC Berkeley, USA Motivtion: lerning models from blck boxes Inputs? Lerner Forml Model
More informationHermite-Hadamard Type Inequalities for the Functions whose Second Derivatives in Absolute Value are Convex and Concave
Applied Mthemticl Sciences Vol. 9 05 no. 5-36 HIKARI Ltd www.m-hikri.com http://d.doi.org/0.988/ms.05.9 Hermite-Hdmrd Type Ineulities for the Functions whose Second Derivtives in Absolute Vlue re Conve
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationAUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton
25. Finite Automt AUTOMATA AND LANGUAGES A system of computtion tht only hs finite numer of possile sttes cn e modeled using finite utomton A finite utomton is often illustrted s stte digrm d d d. d q
More informationThe Shortest Confidence Interval for the Mean of a Normal Distribution
Interntionl Journl of Sttistics nd Proility; Vol. 7, No. 2; Mrch 208 ISSN 927-7032 E-ISSN 927-7040 Pulished y Cndin Center of Science nd Eduction The Shortest Confidence Intervl for the Men of Norml Distriution
More information10 D. Chakraborty, D. Guha / IJIM Vol. 2, No. 1 (2010) 9-20
Aville online t http://ijim.sriu.c.ir Int. J. Industril Mthemtics Vol., No. (00) 9-0 Addition of Two Generlized Fuzzy Numers D. Chkrorty, D. Guh Deprtment of Mthemtics, IIT-Khrgpur Khrgpur-730, Indi Received
More informationZero-Sum Magic Graphs and Their Null Sets
Zero-Sum Mgic Grphs nd Their Null Sets Ebrhim Slehi Deprtment of Mthemticl Sciences University of Nevd Ls Vegs Ls Vegs, NV 89154-4020. ebrhim.slehi@unlv.edu Abstrct For ny h N, grph G = (V, E) is sid to
More informationSelf-similarity and symmetries of Pascal s triangles and simplices mod p
Sn Jose Stte University SJSU ScholrWorks Fculty Publictions Mthemtics nd Sttistics Februry 2004 Self-similrity nd symmetries of Pscl s tringles nd simplices mod p Richrd P. Kubelk Sn Jose Stte University,
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationPhysics 116C Solution of inhomogeneous ordinary differential equations using Green s functions
Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner
More informationThe use of a so called graphing calculator or programmable calculator is not permitted. Simple scientific calculators are allowed.
ERASMUS UNIVERSITY ROTTERDAM Informtion concerning the Entrnce exmintion Mthemtics level 1 for Interntionl Bchelor in Communiction nd Medi Generl informtion Avilble time: 2 hours 30 minutes. The exmintion
More informationTaylor Polynomial Inequalities
Tylor Polynomil Inequlities Ben Glin September 17, 24 Abstrct There re instnces where we my wish to pproximte the vlue of complicted function round given point by constructing simpler function such s polynomil
More informationOverview of Calculus I
Overview of Clculus I Prof. Jim Swift Northern Arizon University There re three key concepts in clculus: The limit, the derivtive, nd the integrl. You need to understnd the definitions of these three things,
More informationMain topics for the First Midterm
Min topics for the First Midterm The Midterm will cover Section 1.8, Chpters 2-3, Sections 4.1-4.8, nd Sections 5.1-5.3 (essentilly ll of the mteril covered in clss). Be sure to know the results of the
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More informationResearch Article Fejér and Hermite-Hadamard Type Inequalities for Harmonically Convex Functions
Hindwi Pulishing Corportion Journl of Applied Mthemtics Volume 4, Article ID 38686, 6 pges http://dx.doi.org/.55/4/38686 Reserch Article Fejér nd Hermite-Hdmrd Type Inequlities for Hrmoniclly Convex Functions
More informationTHE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem
More informationPositive Solutions of Operator Equations on Half-Line
Int. Journl of Mth. Anlysis, Vol. 3, 29, no. 5, 211-22 Positive Solutions of Opertor Equtions on Hlf-Line Bohe Wng 1 School of Mthemtics Shndong Administrtion Institute Jinn, 2514, P.R. Chin sdusuh@163.com
More informationResearch Article On Hermite-Hadamard Type Inequalities for Functions Whose Second Derivatives Absolute Values Are s-convex
ISRN Applied Mthemtics, Article ID 8958, 4 pges http://dx.doi.org/.55/4/8958 Reserch Article On Hermite-Hdmrd Type Inequlities for Functions Whose Second Derivtives Absolute Vlues Are s-convex Feixing
More informationArithmetic Mean Derivative Based Midpoint Rule
Applied Mthemticl Sciences, Vol. 1, 018, no. 13, 65-633 HIKARI Ltd www.m-hikri.com https://doi.org/10.1988/ms.018.858 Arithmetic Men Derivtive Bsed Midpoint Rule Rike Mrjulis 1, M. Imrn, Symsudhuh Numericl
More informationA recursive construction of efficiently decodable list-disjunct matrices
CSE 709: Compressed Sensing nd Group Testing. Prt I Lecturers: Hung Q. Ngo nd Atri Rudr SUNY t Bufflo, Fll 2011 Lst updte: October 13, 2011 A recursive construction of efficiently decodble list-disjunct
More informationWeek 10: Line Integrals
Week 10: Line Integrls Introduction In this finl week we return to prmetrised curves nd consider integrtion long such curves. We lredy sw this in Week 2 when we integrted long curve to find its length.
More informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
More informationResearch Article Moment Inequalities and Complete Moment Convergence
Hindwi Publishing Corportion Journl of Inequlities nd Applictions Volume 2009, Article ID 271265, 14 pges doi:10.1155/2009/271265 Reserch Article Moment Inequlities nd Complete Moment Convergence Soo Hk
More informationLine and Surface Integrals: An Intuitive Understanding
Line nd Surfce Integrls: An Intuitive Understnding Joseph Breen Introduction Multivrible clculus is ll bout bstrcting the ides of differentition nd integrtion from the fmilir single vrible cse to tht of
More informationON A CONVEXITY PROPERTY. 1. Introduction Most general class of convex functions is defined by the inequality
Krgujevc Journl of Mthemtics Volume 40( (016, Pges 166 171. ON A CONVEXITY PROPERTY SLAVKO SIMIĆ Abstrct. In this rticle we proved n interesting property of the clss of continuous convex functions. This
More informationCzechoslovak Mathematical Journal, 55 (130) (2005), , Abbotsford. 1. Introduction
Czechoslovk Mthemticl Journl, 55 (130) (2005), 933 940 ESTIMATES OF THE REMAINDER IN TAYLOR S THEOREM USING THE HENSTOCK-KURZWEIL INTEGRAL, Abbotsford (Received Jnury 22, 2003) Abstrct. When rel-vlued
More informationDefinite integral. Mathematics FRDIS MENDELU
Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová Brno 1 Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function defined on [, b]. Wht is the re of the
More information