A Survey on Optical Orthogonal Codes
|
|
- Madison Walsh
- 5 years ago
- Views:
Transcription
1 A urvey on Optil Orthogonl Codes Mohd M. Ale-Krldni Optil orthogonl odes (OOC) defined by lehi [1] nd Chung, lehi, nd Wei [] re fily of (0,1) seuenes with desired utoorreltion nd ross-orreltion properties providing synhronous ulti-ess ounitions with esy synhroniztion nd good perforne in OCDMA ounition networks [1,3]. In this setion we review few of the ost iportnt lgoriths in generting OOCs. I. Mthetil Forultion An optil orthogonl ode n, w, λ, λ ) is fily C of (0,1) seuenes of length n with ( onstnt Hing weight w stisfying the following two properties: 1. Autoorreltion property. For ny odeword x = ( x 0, x1,..., x n 1) C, the ineulity n 1 xx i i τ λ holds for ny integer τ / 0(od n) i = 0 1, nd. Cross-orreltion property. For ny two distint odewords xy, C n 1 x iy i τ λ holds for ny integer τ, i = 0, the ineulity where the nottion denotes the odulo- n ddition []. When λ = λ = λ, we denote the OOC by ( nw,, λ ) for sipliity. The nuber of odewords is lled the size of the optil orthogonl ode. Fro prtil point of view, ode with lrge size is reuired [3]. To find the best possible odes, we need to deterine n upper bound on the size of n OOC with the given preters. Let Φ n, w, λ, λ ) be the lrgest possible size of n n, w, λ, λ ) OOC. An ( ( OOC hieving this xiu size is sid to be optil. It is esily shown tht if ww ( 1) > λ ( n 1) then Φ ( nwλ,,, λ ) = 0 nd if w > λ n then Φ( nwλ,,, λ ) 1 [4]. Bsed on the Johnson bound for onstnt-weight error orreting odes [7], we hve the following bound []:
2 where the nottion 1 n 1 n n λ + 1 n λ Φ ( n, w, λ) w w 1 w w λ + 1 w λ denotes the integer floor funtion. Also, it is ler fro definition tht Φ( nw,, λ, λ ) Φ ( nw,, λ) where λ = x { λ, λ }. As n exple, the following two seuenes re the odewords of (13,3,1) OOC []. (1) C = { , } () This ode is optil sine Φ(13, 3,1) 3 =. Another useful depition ethod for OOCs is the set-theoretil representtion { ; 1} X = k Z x = for eh odeword = ( x0, x1,..., xn 1) n k x, where Z = { 0,1,..., n 1} denotes the odulo- n integers []. For exple, the (40,4,1) OOC n be represented s: {{ } { } { }} (40,4,1) OOC = 0,1,8,37, 0,,18,5, 0,5,11,19 (od 40) Then the orreltion properties for every odeword X nd Y n be reforulted s follows: Autoorreltion property: ( X) ( b X) λ b (od n) / Cross-orreltion property: ( ) ( ) X b Y λ where X is eul to { x : x X } nd X denotes the rdinlity of the set X. n (3) II. Constrution Methods There re severl ethods for onstruting OOCs tht n be tegorized into two ses [], one is diret ethods whih use the thetil strutures suh s projetive geoetry [,16], finite field theory [4,1] nd design theory [4,8,9,17], nother is serh ethods whih use the oputer lgoriths suh s greedy nd elerted greedy lgoriths [] nd outer-produt trix lgorith [18].
3 The first thetil design ethod of OOCs, presented in the originl pper on OOC [], is bsed on finite projetive geoetry. There is n ( nw,,1) OOC orresponding to projetive d 1 1 geoetry PG( d, ) where d is positive integer nd is prie power suh tht + n = 1 nd w= + 1. Eh odeword orresponds to line in PG( d, ) where eh line is obtined fro plne rossing the origin in ( d + 1) -diensionl vetor spe on Glois field GF( ). It ws shown tht, [], the nuber of odewords obtined fro this ethod is eul to d 1 1 for even d nd d 1 when d is odd whih hieve the Johnson bound in eh two ses. Therefore, this ethod gives n optil ( nw,,1) optil orthogonl ode. For exple, the settheoretil representtion of optil (341,5,1) OOC obtined fro PG (4, ) with 17 odewords is given in Tble I []. Tble I- Codewords of (341,5,1) OOC
4 Due to the Johnson bound, OOCs with λ = 1 hve fewer nuber of odewords nd therefore few nuber of users n be oodted in the orresponding OCDMA networks. Hene, OOCs with λ, λ > 1 whih hve ore odewords nd re soeties lled generlized OOC hve been exined in OCDMA systes. urprisingly, it ws shown in [5], s n exple, tht for 50 users, the (1000,1,) OOC hs better perforne thn (1000, 5,1) OOC. This point hs been deeply nlyzed nd verified in [6] nd it ws shown tht OOCs with λ =,3 ould hve better perforne thn odes with λ = 1. Conseuently, the onstrution ethods of generlized OOCs hve found speil iportne. The first onstrution ethod of optil orthogonl odes with λ = is due to Chung nd Kur [4] whih uses finite field theory to design n optil ( p 1, p 1,) + OOC with p odewords where p is prie nuber nd is positive integer. Let α be priitive eleent of set-theoretil representtion of odewords is s follows, GF p ( ) nd p 1 =, then the β α { α β } p i = log ( x) ; ( x 1) =, i = 1,,..., p i Tble II ontins the odewords of (63,9,) OOC obtined for p = nd = 3 [4]. (4) Tble II- Codewords of (63,9,) OOC 1 { 1,5,8,18, 8,31,35, 40,59 } {,7,10,16,17,36,55,56,6 } 3 { 3,11,4,5,7,9,30,43,51 } 4 { 4,9,14, 0,3,34, 47, 49,61 } 5 { 6,,3,39,48,50,54,58,60 } 6 { 1,15,33,37,44,45,46,53,57 } There is strong reltionship between OOCs nd onstnt-weight Cylilly Perutble Codes or CPCs. In the other words, n ( nwλ,, ) OOC is euivlent to the ( n,w λ, w) CPC whih indites n error-orreting ode of length n, weight w, nd iniu Hing distne w λ. Every yli shift of CPC odeword is lso odeword [10]. o, using 4
5 onstrution ethods of CPCs we n design new OOCs. In [10] severl suh ethods espeilly for λ = 1 hve been exined. OOCs with uneul uto- nd ross-orreltion onstrints hve been investigted in detil by Yng nd Fuj [8]. A new upper bound useful for se λ > λ presented in [8] is s follows: ( λ + )( n 1)( n )...( n λ) Φ ( nw,, λ+, λ) (5) ww ( 1)( w )...( w λ) For exple, fro the Johnson bound for (41, 4,,1) OOC we hve Φ(41, 4,,1) Φ(41, 4, ) 63 while fro the bove bound we hve Φ(41,4,,1) 6, whih indites tht it is ipossible to hve ore thn 6 odewords for (41, 4,,1) OOC; so, for λ > λ it is tighter thn Johnson Bound. Another useful ethod for OOC design is presented in [1], whih uses two thetil strutures, nely, Perfet Differene et (PD) nd finite Mobios Geoetry (MG). A k-subset = { d d } of Z { 0,1,..., n 1} D 1,,..., d k n = is lled n ( n, k, λ ) PD whenever for every / 0 (od n ) there re extly λ ordered pirs ( d, d ), i j suh tht d d (od n). A finite i Mobios geoetry MG (, r) with prie power nd positive integer r is n extended Glois field GF( r ) { } 5 j with ll irles on it. Bsed on one-to-one orrespondene between r r r ( + + 1, + 1,1) -PD nd MG (, r), n optil orthogonl ode with preters ( r r + + 1, + 1,1,) nd size r 1 r 1 1 i n be obtined. As n exple, if = nd r =, we hve ( 1, 3,1, ) OOC with 0 odewords [1]. The dvntge of this ethod is in its bility to generte lrge nuber of odewords, but the low weight reuireent is jor drwbk for this struture. There re soe reursive onstrutions for OOCs [,11]. One of the best reursive ethods for ( nwλ,, ) OOC design ws obtined by Chu nd Golob [13]. This ethod uses r -siple tries over yli group for reursive onstrution of OOCs whih indites tht if there exists n ( nwλ,, ) OOC with T odewords, then there exists n ( n, w, λ ) OOC with T λ odewords whenever the prie ftors of re not less thn w. As n exple, for = 11 nd j
6 (63,9,) OOC with 6 odewords, this ethod onstruts (693,9,) OOC with 6 11 = 76 odewords [13]. One of the dvntges of this ethod is tht if the ( nwλ,, ) OOC is optil then the onstruted ( n, w, λ ) OOC is t lest syptotilly optil [13]. Cylotoi lsses nd nubers with respet to the finite field GF( ) re the thetil strutures tht n be used to onstrut OOCs. Using this ethod, Ding nd Xing presented severl lsses of ( 1, w,) OOCs [14]. Also, five lsses of ( 1, w,) OOCs where is power of odd prie hve been derived using ylotoy [15]. By using finite projetive geoetry, we n lso design OOCs with λ > 1. In [16] bsed on onis on finite projetive plnes in the projetive geoetry PG(3, ) n syptotilly optil 3 ( 1, 1,) OOC with 3 + odewords hve been obtined. For exple, if = 3, the (40,4,) OOC with 1 odewords is obtined [16]. Blned Inoplete Blok Design (BIBD) is one of the ost beutiful strutures in disrete thetis tht hve lose reltion with OOCs. In other words, every ( nwλ,, ) OOC is euivlent to ( λ + 1) ( nw,,1) stritly yli prtil design [11,17]. ine there re severl ethods for onstruting BIBD suh s Wilson nd Hnni, we n use the to design OOCs. Wilson s ethod is pplied for designing of (, nw,1) OOC [4] nd ( nw,,,1) OOC [8]. Both ses re tegorized to even w nd odd w. In this ethod n is prie nuber obtined fro weight w nd the size of the ode. For exple, the following optil (37,5,,1) OOC with 3 odewords hve been obtined fro Wilson s ethod for odd w. {{ } { } { } } (37,5,,1) OOC = 0,1,6,31,36, 0,8,11,6,9, 0,10,14,3,7 ( od 37) Hnni s ethod lso like Wilson s is for designing of (, nw,1) OOC [9] nd ( nw,,,1) OOC [8]. This ethod for onstruting (, nw,1) OOC is tegorized into two ses, nely, w (od4) nd w 3(od4). But for the onstrution of ( nw,,,1) OOC it is divided in two ses w 0(od4) nd w 1(od4). In ll these ses the ode length n is prie nuber obtined fro ode weight nd the nuber of odewords. The (41, 4,,1) OOC with following 5 odewords re obtined fro Hnni s ethod [8]. (6) 6
7 { } { } { } { 3,4,37,38 },{ 7,18,3,34 } 1,11,30, 40, 1,16, 5, 9, 10,13, 8,31, (41, 4,,1) OOC = (od 41) Although it sees tht Hnni s ethod is speil se of Wilson s onstrution, there re soe ode lengths tht Hnni s onstrution yields odes while Wilson s ethod does not [9]. One of the best-known ses of BIBD is teiner Qudruple yste (Q). Bsed on Q, Chu nd Colbourn [17] suggested n lgorith for optil (,4,) n OOC with n 44. As n exple, optil (10,4,) OOC with 3 odewords obtined fro this ethod is s follows [17], (7) (10,4,) OOC= {{ 0,,4,7 },{ 0,1,3,4 },{ 0,1,,6 } } (od10) (8) III. Referenes [1]. J.A. lehi, Code division ultiple-ess tehniues in optil fiber networks-prt I: Fundentl priniples, IEEE Trnstions on Counitions, vol. 37, no. 8, pp , August []. F.R.K. Chung, J.A. lehi, nd V.K. Wei, Optil orthogonl odes: Design, nlysis, nd pplitions, IEEE Trnstions on Infortion Theory, vol.35, no. 3, pp , My [3]. J.A. lehi nd C.A. Brkett, Code division ultiple-ess tehniues in optil fiber networks-prt II: ystes perforne nlysis, IEEE Trnstions on Counitions, vol. 37, no.8, pp , August [4]. H. Chung nd P. Vijy Kur, Optil orthogonl odes-new bounds nd n optil onstrution, IEEE Trnstions on Infortion Theory, vol.36, no. 4, pp , July [5]. M. Azizoglo, J.A. lehi, nd Y. Li, Optil CDMA vi teporl odes, IEEE Trnstions on Counitions, vol. 40, no.7, pp , July 199. [6].. Mshhdi nd J.A. lehi, Code division ultiple-ess tehniues in optil fiber networks-prt III: Optil AND gte reeiver struture with generlized optil orthogonl odes, IEEE Trnstions on Counitions, vol. 45, no. 5, pp , August 006. [7]..M. Johnson, A new upper bound for error-orreting odes, IRE Trnstions on Infortion Theory, vol. IT-8, pp , 196. [8]. G.C. Yng nd T.E. Fuj, Optil orthogonl odes with uneul uto- nd rossorreltion onstrints, IEEE Trnstions on Infortion Theory, vol. 41, no. 1, pp , Deeber
8 [9]. G. C. Yng, oe new filies of optil orthogonl odes for ode-division ultipleess fiber-opti networks, IEE Proeeding on Counitions, vol. 14, no. 6, Deeber [10].. Bitn nd T. Etzion, Construtions for optil onstnt weight ylilly perutble odes nd differene filies, IEEE Trnstions on Infortion Theory, vol. 41, no. 1, pp , My [11]. R. Fuji-Hr nd Y. Mio, Optil orthogonl odes: Their bounds nd new optil onstrutions, IEEE Trnstions on Infortion Theory, vol. 46, no. 7, pp , Noveber 000. [1]. C.. Weng nd J. Wu, Optil orthogonl odes with nonidel ross-orreltion, Journl of Lightwve Tehnology, vol. 19, no. 1, pp , Deeber 001. [13]. W. Chu,. W. Golob, A new reursive onstrution for optil orthogonl odes, IEEE Trnstions on Infortion Theory, vol. 49, no. 11, pp , Noveber 003. [14]. C. Ding nd C. Xing, everl lsses of ( 1, w,) optil orthogonl odes, Disrete Applied Mthetis 18 (003) [15]. C. Ding nd C. Xing, Cylotoi optil orthogonl odes of oposite lengths, IEEE Trnstions on Infortion Theory, vol.5, no., pp , Februry 004. [16]. N. Miyoto, H. Mizuno, nd. hinohr, Optil orthogonl odes obtined fro onis on finite projetive plnes, Finite Fields nd Their Applitions 10 (004) [17]. W. Chu nd C.J. Colbourn, Optil (, 4, ) Mthetis 79 (004) n OOC of sll orders, Disrete [18]. H. Chrhi nd J.A. lehi, Outer-produt trix representtion of optil orthogonl odes, IEEE Trnstions on Counitions, vol. 54, no. 6, pp , June
Discrete Structures Lecture 11
Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.
More informationON AN INEQUALITY FOR THE MEDIANS OF A TRIANGLE
Journl of Siene nd Arts Yer, No. (9), pp. 7-6, OIGINAL PAPE ON AN INEQUALITY FO THE MEDIANS OF A TIANGLE JIAN LIU Mnusript reeived:.5.; Aepted pper:.5.; Pulished online: 5.6.. Astrt. In this pper, we give
More informationSolutions to Assignment 1
MTHE 237 Fll 2015 Solutions to Assignment 1 Problem 1 Find the order of the differentil eqution: t d3 y dt 3 +t2 y = os(t. Is the differentil eqution liner? Is the eqution homogeneous? b Repet the bove
More informationHyers-Ulam stability of Pielou logistic difference equation
vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo
More informationTutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.
Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix
More informationQUADRATIC EQUATION. Contents
QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,
More information8 THREE PHASE A.C. CIRCUITS
8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),
More informationGlobal alignment. Genome Rearrangements Finding preserved genes. Lecture 18
Computt onl Biology Leture 18 Genome Rerrngements Finding preserved genes We hve seen before how to rerrnge genome to obtin nother one bsed on: Reversls Knowledge of preserved bloks (or genes) Now we re
More informationLecture 1 - Introduction and Basic Facts about PDEs
* 18.15 - Introdution to PDEs, Fll 004 Prof. Gigliol Stffilni Leture 1 - Introdution nd Bsi Fts bout PDEs The Content of the Course Definition of Prtil Differentil Eqution (PDE) Liner PDEs VVVVVVVVVVVVVVVVVVVV
More informationIntermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths
Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t
More informationA Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version
A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment
More informationApril 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.
pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm
More informationMatrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix
tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri
More informationarxiv: v1 [math.ca] 21 Aug 2018
rxiv:1808.07159v1 [mth.ca] 1 Aug 018 Clulus on Dul Rel Numbers Keqin Liu Deprtment of Mthemtis The University of British Columbi Vnouver, BC Cnd, V6T 1Z Augest, 018 Abstrt We present the bsi theory of
More informationVECTOR ALGEBRA. Syllabus :
MV VECTOR ALGEBRA Syllus : Vetors nd Slrs, ddition of vetors, omponent of vetor, omponents of vetor in two dimensions nd three dimensionl spe, slr nd vetor produts, slr nd vetor triple produt. Einstein
More informationCS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6
CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized
More information, exceeding the Varshamov-Gilbert bound. . To each code C of C q. , we can associate its three parameters [n, k, d] q
1 Filies of codes exceeding the Vrshov-Gilbert bound Mrc PERRET - Euipe CNRS "Arithétiue et Théorie de l'infortion" - - CIRM - Luiny - Cse 916-13288 Mrseille Cedex 9 Résué : Le nobre A() est l liite supérieure
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 informationLecture Notes No. 10
2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite
More informationTechnische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution
Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:
More informationwhere the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b
CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}
More informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most
More informationOXFORD H i g h e r E d u c a t i o n Oxford University Press, All rights reserved.
Renshw: Mths for Econoics nswers to dditionl exercises Exercise.. Given: nd B 5 Find: () + B + B 7 8 (b) (c) (d) (e) B B B + B T B (where 8 B 6 B 6 8 B + B T denotes the trnspose of ) T 8 B 5 (f) (g) B
More informationDiscrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α
Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw
More information16z z q. q( B) Max{2 z z z z B} r z r z r z r z B. John Riley 19 October Econ 401A: Microeconomic Theory. Homework 2 Answers
John Riley 9 Otober 6 Eon 4A: Miroeonomi Theory Homework Answers Constnt returns to sle prodution funtion () If (,, q) S then 6 q () 4 We need to show tht (,, q) S 6( ) ( ) ( q) q [ q ] 4 4 4 4 4 4 Appeling
More informationIntroduction to Olympiad Inequalities
Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................
More informationCHENG Chun Chor Litwin The Hong Kong Institute of Education
PE-hing Mi terntionl onferene IV: novtion of Mthemtis Tehing nd Lerning through Lesson Study- onnetion etween ssessment nd Sujet Mtter HENG hun hor Litwin The Hong Kong stitute of Edution Report on using
More informationMore Properties of the Riemann Integral
More Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologil Sienes nd Deprtment of Mthemtil Sienes Clemson University Februry 15, 2018 Outline More Riemnn Integrl Properties The Fundmentl
More informationSOME NEW HERMITE-HADAMARD TYPE INEQUALITIES FOR FUNCTIONS WHOSE HIGHER ORDER PARTIAL DERIVATIVES ARE CO-ORDINATED CONVEX
FACTA UNIVERSITATIS (NIŠ) Ser. Mth. Inor. Vol. 7 No 3 (), 3 336 SOME NEW HERMITE-HADAMARD TYPE INEQUALITIES FOR FUNCTIONS WHOSE HIGHER ORDER PARTIAL DERIVATIVES ARE CO-ORDINATED CONVEX Muhd Aer Lti nd
More informationSOME NEW HERMITE-HADAMARD TYPE INEQUALITIES FOR FUNCTIONS WHOSE HIGHER ORDER PARTIAL DERIVATIVES ARE CO-ORDINATED s-convex
Krgujev Journl of Mthetis Volue 38 4, Pges 5 46 SOME NEW HERMITE-HADAMARD TYPE INEQUALITIES FOR FUNCTIONS WHOSE HIGHER ORDER PARTIAL DERIVATIVES ARE CO-ORDINATED s-convex MUHAMMAD AMER LATIF Abstrt In
More informationRelations between a dual unit vector and Frenet vectors of a dual curve
Kuwit J. Si. 4 () pp. 59-69, 6 Burk Şhiner *, Mehmet Önder Dept. of Mthemtis, Mnis Cell Byr University, Murdiye, Mnis, 454, Turkey * Corresponding uthor: burk.shiner@bu.edu.tr Abstrt In this pper, we generlize
More informationCS 573 Automata Theory and Formal Languages
Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple
More informationNON-DETERMINISTIC FSA
Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is
More informationOn the Co-Ordinated Convex Functions
Appl. Mth. In. Si. 8, No. 3, 085-0 0 085 Applied Mthemtis & Inormtion Sienes An Interntionl Journl http://.doi.org/0.785/mis/08038 On the Co-Ordinted Convex Funtions M. Emin Özdemir, Çetin Yıldız, nd Ahmet
More informationElectromagnetic-Power-based Modal Classification, Modal Expansion, and Modal Decomposition for Perfect Electric Conductors
LIAN: EM-BASED MODAL CLASSIFICATION EXANSION AND DECOMOSITION FOR EC 1 Eletromgneti-ower-bsed Modl Clssifition Modl Expnsion nd Modl Deomposition for erfet Eletri Condutors Renzun Lin Abstrt Trditionlly
More informationNecessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )
Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us
More informationCongruences and Modular Arithmetic
Congruenes and Modular Aritheti 6-17-2016 a is ongruent to b od n eans that n a b. Notation: a = b (od n). Congruene od n is an equivalene relation. Hene, ongruenes have any of the sae properties as ordinary
More information, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1.
Exerise Genertor polynomils of onvolutionl ode, given in binry form, re g, g j g. ) Sketh the enoding iruit. b) Sketh the stte digrm. ) Find the trnsfer funtion T. d) Wht is the minimum free distne of
More informationCo-ordinated s-convex Function in the First Sense with Some Hadamard-Type Inequalities
Int. J. Contemp. Mth. Sienes, Vol. 3, 008, no. 3, 557-567 Co-ordinted s-convex Funtion in the First Sense with Some Hdmrd-Type Inequlities Mohmmd Alomri nd Mslin Drus Shool o Mthemtil Sienes Fulty o Siene
More information( ) { } [ ] { } [ ) { } ( ] { }
Mth 65 Prelulus Review Properties of Inequlities 1. > nd > >. > + > +. > nd > 0 > 4. > nd < 0 < Asolute Vlue, if 0, if < 0 Properties of Asolute Vlue > 0 1. < < > or
More informationUNIQUENESS THEOREMS FOR ORDINARY DIFFERENTIAL EQUATIONS WITH HÖLDER CONTINUITY
UNIQUENESS THEOREMS FOR ORDINARY DIFFERENTIAL EQUATIONS WITH HÖLDER CONTINUITY YIFEI PAN, MEI WANG, AND YU YAN ABSTRACT We estblish soe uniqueness results ner 0 for ordinry differentil equtions of the
More informationChapter 4 State-Space Planning
Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different
More informationExercise 3 Logic Control
Exerise 3 Logi Control OBJECTIVE The ojetive of this exerise is giving n introdution to pplition of Logi Control System (LCS). Tody, LCS is implemented through Progrmmle Logi Controller (PLC) whih is lled
More informationTable of Content. c 1 / 5
Tehnil Informtion - t nd t Temperture for Controlger 03-2018 en Tble of Content Introdution....................................................................... 2 Definitions for t nd t..............................................................
More informationECE 330 POWER CIRCUITS AND ELECTROMECHANICS LECTURE 17 FORCES OF ELECTRIC ORIGIN ENERGY APPROACH(1)
ECE 330 POWER CIRCUITS AND ELECTROMECHANICS LECTURE 17 FORCES OF ELECTRIC ORIGIN ENERGY APPROACH(1) Aknowledgent-These hndouts nd leture notes given in lss re bsed on teril fro Prof. Peter Suer s ECE 330
More informationAP Calculus AB Unit 4 Assessment
Clss: Dte: 0-04 AP Clulus AB Unit 4 Assessment Multiple Choie Identify the hoie tht best ompletes the sttement or nswers the question. A lultor my NOT be used on this prt of the exm. (6 minutes). The slope
More informationFigure 1. The left-handed and right-handed trefoils
The Knot Group A knot is n emedding of the irle into R 3 (or S 3 ), k : S 1 R 3. We shll ssume our knots re tme, mening the emedding n e extended to solid torus, K : S 1 D 2 R 3. The imge is lled tuulr
More informationSection 1.3 Triangles
Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior
More informationA Mathematical Model for Unemployment-Taking an Action without Delay
Advnes in Dynmil Systems nd Applitions. ISSN 973-53 Volume Number (7) pp. -8 Reserh Indi Publitions http://www.ripublition.om A Mthemtil Model for Unemployment-Tking n Ation without Dely Gulbnu Pthn Diretorte
More informationMATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1. 1 [(y ) 2 + yy + y 2 ] dx,
MATH3403: Green s Funtions, Integrl Equtions nd the Clulus of Vritions 1 Exmples 5 Qu.1 Show tht the extreml funtion of the funtionl I[y] = 1 0 [(y ) + yy + y ] dx, where y(0) = 0 nd y(1) = 1, is y(x)
More informationSection 3.6. Definite Integrals
The Clulus of Funtions of Severl Vribles Setion.6 efinite Integrls We will first define the definite integrl for funtion f : R R nd lter indite how the definition my be extended to funtions of three or
More informationModified Farey Trees and Pythagorean Triples
Modified Frey Trees d Pythgore Triples By Shi-ihi Kty Deprtet of Mthetil Siees, Fulty of Itegrted Arts d Siees, The Uiversity of Tokushi, Tokushi 0-0, JAPAN e-il ddress : kty@istokushi-ujp Abstrt I 6,
More informationThe Relationship between the Nine-Point Circle, the Circumscribed Circle and the Inscribed Circle of Archimedes Triangle Yuporn Rimcholakarn
Nresun Universit Journl: Siene nd Tehnolog 08; 63 The Reltionship between the Nine-Point irle, the irusribed irle nd the Insribed irle of rhiedes Tringle Yuporn Riholkrn Fult of Siene nd Tehnolog, Pibulsongkr
More informationThe Legacy of Pythagoras Theorem
Prol Volue 39, Issue 1(2003) The Legy of Pythgors Theore Peter G.rown 1 When sked wht thetil result they reeer fro High Shool, the verge person would proly reply with Pythgors Theore. In ny right tringle,
More informationy z A left-handed system can be rotated to look like the following. z
Chpter 2 Crtesin Coördintes The djetive Crtesin bove refers to René Desrtes (1596 1650), who ws the first to oördintise the plne s ordered pirs of rel numbers, whih provided the first sstemti link between
More informationT b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions.
Rel Vribles, Fll 2014 Problem set 5 Solution suggestions Exerise 1. Let f be bsolutely ontinuous on [, b] Show tht nd T b (f) P b (f) f (x) dx [f ] +. Conlude tht if f is in AC then it is the differene
More informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 22 Reding: Logi Synthesis in Nutshell Setion 2 most
More informationHermite-Hadamard inequality for geometrically quasiconvex functions on co-ordinates
Int. J. Nonliner Anl. Appl. 8 27 No. 47-6 ISSN: 28-6822 eletroni http://dx.doi.org/.2275/ijn.26.483 Hermite-Hdmrd ineulity for geometrilly usionvex funtions on o-ordintes Ali Brni Ftemeh Mlmir Deprtment
More information2. Topic: Summation of Series (Mathematical Induction) When n = 1, L.H.S. = S 1 = u 1 = 3 R.H.S. = 1 (1)(1+1)(4+5) = 3
GCE A Level Otober/November 008 Suggested Solutions Mthemtis H (970/0) version. MATHEMATICS (H) Pper Suggested Solutions. Topi: Definite Integrls From the digrm: Are A = y dx = x Are B = x dy = y dy dx
More informationProperties of Different Types of Lorentz Transformations
merin Journl of Mthemtis nd ttistis 03 3(3: 05-3 DOI: 0593/jjms03030303 roperties of Different Types of Lorentz Trnsformtions tikur Rhmn izid * Md hh lm Deprtment of usiness dministrtion Leding niversity
More informationMath 1051 Diagnostic Pretest Key and Homework
Mth 1051 Dignostic Pretest Ke nd Hoework HW1 The dignostic test is designed to give us n ide of our level of skill in doing high school lgebr s ou begin Mth 1051. You should be ble to do these probles
More information(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.
Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time
More informationThe Double Integral. The Riemann sum of a function f (x; y) over this partition of [a; b] [c; d] is. f (r j ; t k ) x j y k
The Double Integrl De nition of the Integrl Iterted integrls re used primrily s tool for omputing double integrls, where double integrl is n integrl of f (; y) over region : In this setion, we de ne double
More informationCore 2 Logarithms and exponentials. Section 1: Introduction to logarithms
Core Logrithms nd eponentils Setion : Introdution to logrithms Notes nd Emples These notes ontin subsetions on Indies nd logrithms The lws of logrithms Eponentil funtions This is n emple resoure from MEI
More informationMid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours
Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into
More informationPart 4. Integration (with Proofs)
Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1
More informationThe Riemann-Stieltjes Integral
Chpter 6 The Riemnn-Stieltjes Integrl 6.1. Definition nd Eistene of the Integrl Definition 6.1. Let, b R nd < b. ( A prtition P of intervl [, b] is finite set of points P = { 0, 1,..., n } suh tht = 0
More informationLogic, Set Theory and Computability [M. Coppenbarger]
14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer
More informationApplications of Definite Integral
Chpter 5 Applitions of Definite Integrl 5.1 Are Between Two Curves In this setion we use integrls to find res of regions tht lie between the grphs of two funtions. Consider the region tht lies between
More informationLine Integrals and Entire Functions
Line Integrls nd Entire Funtions Defining n Integrl for omplex Vlued Funtions In the following setions, our min gol is to show tht every entire funtion n be represented s n everywhere onvergent power series
More informationANALYSIS AND MODELLING OF RAINFALL EVENTS
Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.
More informationAn Introduction to Trigonometry
n Introduction to Trigonoetry First of ll, let s check out the right ngled tringle below. The LETTERS, B & C indicte the ngles nd the letters, b & c indicte the sides. c b It is iportnt to note tht side
More informationAlgorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:
Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer
More informationUniversity of Sioux Falls. MAT204/205 Calculus I/II
University of Sioux Flls MAT204/205 Clulus I/II Conepts ddressed: Clulus Textook: Thoms Clulus, 11 th ed., Weir, Hss, Giordno 1. Use stndrd differentition nd integrtion tehniques. Differentition tehniques
More informationThe study of dual integral equations with generalized Legendre functions
J. Mth. Anl. Appl. 34 (5) 75 733 www.elsevier.om/lote/jm The study of dul integrl equtions with generlized Legendre funtions B.M. Singh, J. Rokne,R.S.Dhliwl Deprtment of Mthemtis, The University of Clgry,
More informationApplications of Definite Integral
Chpter 5 Applitions of Definite Integrl 5.1 Are Between Two Curves In this setion we use integrls to find res of regions tht lie between the grphs of two funtions. Consider the region tht lies between
More informationComputing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt
Computing dt with spredsheets Exmple: Computing tringulr numers nd their squre roots. Rell, we showed 1 ` 2 ` `n npn ` 1q{2. Enter the following into the orresponding ells: A1: n B1: tringle C1: sqrt A2:
More informationPre-Lie algebras, rooted trees and related algebraic structures
Pre-Lie lgers, rooted trees nd relted lgeri strutures Mrh 23, 2004 Definition 1 A pre-lie lger is vetor spe W with mp : W W W suh tht (x y) z x (y z) = (x z) y x (z y). (1) Exmple 2 All ssoitive lgers
More informationLinear Algebra Introduction
Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +
More informationInstructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting.
ID: B CSE 2021 Computer Orgniztion Midterm Test (Fll 2009) Instrutions This is losed ook, 80 minutes exm. The MIPS referene sheet my e used s n id for this test. An 8.5 x 11 Chet Sheet my lso e used s
More information#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS
#A42 INTEGERS 11 (2011 ON THE CONDITIONED BINOMIAL COEFFICIENTS Liqun To Shool of Mthemtil Sienes, Luoyng Norml University, Luoyng, Chin lqto@lynuedun Reeived: 12/24/10, Revised: 5/11/11, Aepted: 5/16/11,
More informationFunctions. mjarrar Watch this lecture and download the slides
9/6/7 Mustf Jrrr: Leture Notes in Disrete Mthemtis. Birzeit University Plestine 05 Funtions 7.. Introdution to Funtions 7. One-to-One Onto Inverse funtions mjrrr 05 Wth this leture nd downlod the slides
More informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
More information2. There are an infinite number of possible triangles, all similar, with three given angles whose sum is 180.
SECTION 8-1 11 CHAPTER 8 Setion 8 1. There re n infinite numer of possile tringles, ll similr, with three given ngles whose sum is 180. 4. If two ngles α nd β of tringle re known, the third ngle n e found
More informationDIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS
Krgujev Journl of Mthemtis Volume 38() (204), Pges 35 49. DIFFERENCE BETWEEN TWO RIEMANN-STIELTJES INTEGRAL MEANS MOHAMMAD W. ALOMARI Abstrt. In this pper, severl bouns for the ifferene between two Riemn-
More informationChapter17. Congruence and transformations. Contents: A Transformations B Congruent figures C Congruent triangles D Proof using congruence
hpter17 ongruene nd trnsfortions ontents: Trnsfortions ongruent figures ongruent tringles Proof using ongruene 352 ONGRUENE N TRNSFORMTIONS (hpter 17) Opening prole Jne ut two tringulr slies of heeseke,
More informationForces on curved surfaces Buoyant force Stability of floating and submerged bodies
Stti Surfe ores Stti Surfe ores 8m wter hinge? 4 m ores on plne res ores on urved surfes Buont fore Stbilit of floting nd submerged bodies ores on Plne res Two tpes of problems Horizontl surfes (pressure
More informationInequalities of Olympiad Caliber. RSME Olympiad Committee BARCELONA TECH
Ineulities of Olymid Clier José Luis Díz-Brrero RSME Olymid Committee BARCELONA TECH José Luis Díz-Brrero RSME Olymi Committee UPC BARCELONA TECH jose.luis.diz@u.edu Bsi fts to rove ineulities Herefter,
More informationGraph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}
Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)
More informationReflection Property of a Hyperbola
Refletion Propert of Hperol Prefe The purpose of this pper is to prove nltill nd to illustrte geometrill the propert of hperol wherein r whih emntes outside the onvit of the hperol, tht is, etween the
More informationGreen s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e
Green s Theorem. Let be the boundry of the unit squre, y, oriented ounterlokwise, nd let F be the vetor field F, y e y +, 2 y. Find F d r. Solution. Let s write P, y e y + nd Q, y 2 y, so tht F P, Q. Let
More informationCan one hear the shape of a drum?
Cn one her the shpe of drum? After M. K, C. Gordon, D. We, nd S. Wolpert Corentin Lén Università Degli Studi di Torino Diprtimento di Mtemti Giuseppe Peno UNITO Mthemtis Ph.D Seminrs Mondy 23 My 2016 Motivtion:
More informationLinear choosability of graphs
Liner hoosility of grphs Louis Esperet, Mikel Montssier, André Rspud To ite this version: Louis Esperet, Mikel Montssier, André Rspud. Liner hoosility of grphs. Stefn Felsner. 2005 Europen Conferene on
More informationSection 4.4. Green s Theorem
The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls
More informationSymmetrical Components 1
Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent
More information1.3 SCALARS AND VECTORS
Bridge Course Phy I PUC 24 1.3 SCLRS ND VECTORS Introdution: Physis is the study of nturl phenomen. The study of ny nturl phenomenon involves mesurements. For exmple, the distne etween the plnet erth nd
More informationInfinite Geometric Series
Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to
More informationf (x)dx = f(b) f(a). a b f (x)dx is the limit of sums
Green s Theorem If f is funtion of one vrible x with derivtive f x) or df dx to the Fundmentl Theorem of lulus, nd [, b] is given intervl then, ording This is not trivil result, onsidering tht b b f x)dx
More informationTOPIC: LINEAR ALGEBRA MATRICES
Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED
More informationProject 6: Minigoals Towards Simplifying and Rewriting Expressions
MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy
More information