RECHERCHES Womcodes constructed with projective geometries «Womcodes» construits à partir de géométries projectives Frans MERKX (') École Nationale Su
|
|
- Jeffery Howard
- 5 years ago
- Views:
Transcription
1 Wmcdes cnstructed with prjective gemetries «Wmcdes» cnstruits à partir de gémétries prjectives Frans MERKX (') Écle Natinale Supérieure de Télécmmunicatins (ENST), 46, rue Barrault, PARIS Étudiant à l'université de Technlgie à Eindhven (Pays-Bas) dans le dmaine des mathématiques discrètes. SUMMARY We cnsider strage media which cnsist f a number f write-nce bit psitins (wits). A wit initially cntains a "0", that may be irreversibly verwritten with a "1". It was shwn by Rivest and Shamir [5] that, by cding techniques ne can reuse such a write-nce memry (wm) up t a very high rate. We present tw new cyclic wmcdes, based n PG (2,2) and PG (3,2) respectively, which attain the RS-bund. These cdes can be decded with a decding algrithm fr Hamming cdes. Sme ther high-rate wmcdes, derived frm thse abve, are discussed. Errr-crrecting cdes, finite gemetry, numerical strage media. KEY WORDS RÉSUMÉ Nus cnsidérns des mémires cnstituées de psitins permettant l'écriture irréversible d'un bit (wits). Un wit cntient initialement un zér, qui peut être définitivement transfrmé en un. Nus utilisns des techniques de cdage pur réutiliser ces mémires à écriture unique avec un rendement élevé. Cdes crrecteurs d'erreurs, gémétrie finie, mémires numériques. MOTS CLÉS (') During this research, the authr was with the Écle Natinale Supérieure de télécmmunicatin, Paris. 1227
2 WOMCODES CONSTRUCTED WITH PROJECTIVE GEOMETRIES CONTENTS 1. Intrductin 2. Ntatin 3. A < 7 > 4 /7 wmcde 4. Mre wmcdes frm prjective gemetries 5. Extensins Cnclusin Acknwledgements References 1. Intrductin We cnsider strage media which cnsist f a number f write-nce bit psitins (wits). A wit initially cntains a "0", that may be irreversibly verwritten with a "1". We call such a strage medium a "writence memry" r wm. Examples f wms are punched cards r digital ptical disks. In their pineering paper n this subject, Rivest and Shamir [5] shwed that it is pssible t use a wm several times, by using "wmcdes". They gave many examples f wmcdes, and shw that the "capacity" (defined later) f a wmcde is greater than the number f wits. They als derive asympttic results fr this capacity. The fllwing cding scheme was their prime "mtivating example". Example 1. 1 : We write tw times 2 bits in a memry f 3 wits, as fllws : Message x First writing r (x) Secnd writing r' (x) This scheme must be interpreted as fllws : The first time we receive a message x, we write r (x). Later, we will receive fr the secnd time a message, say y. If x =y we dn't change the memry, if x*y we change the memry state t r' (y), by nly changing 0's t 1's. Withut cding, we wuld have t use 4 wits. Remark that after the secnd writing we lst the infrmatin n the first message. 2. Ntatin We call a cding scheme that uses n wits t represent t times ne ut f v messages (i. e. write nce and change t - 1 times) a < v > t/n wmcde. Mre generai, with a < v l, v 2i..., vt >/n wmcde the message in the i'th generatin can lie ne f a set V, f vi messages. Such a wmcde must have the fllwing prperties : 1. Each memry cntent that ccurs must determine uniquely the last received message, and 2. fr each memry cntent x e { 0, 11" ccuring in the s'th generatin (s < t) it must be pssible t encde all sequences f messages K+1,.., m t ), mi e V i, such that x, :g x, 1 <... < x t (cmpnentwise). The wmcde is determined by giving fr all pssible memry states and new messages the new memry state (update functin [5]). w (< v t, v 2,..., vt >) dentes the least n fr which a ( v l, v 2,..., vt i/n wmcde exists, and, f curse, w(<v> t)=w (<v, v,..., v>). Rivest and Shamir [5] derive a lwer bund fr w (< v > 1 ). This can be easily extended t a lwer bund fr w (< v 1, v2,..., v t i), see [4], which we shall refer t as the RS-bund. The capacity C and the rate R f a < u t, v 2,..., vt >/n wmcde are defined as C :=1g (v 1.v 2 v t), R : =C/n. Fr example, the < 4 > 2/3 wmcde f example 1. 1 has C=4 and R= (= bit per wit). The fllwing tw examples f wmcdes are described in [5]. Example 2. 1 : A < 5 > 3 /5 cyclic wmcde (Rate= ), cnstructed by D. Klarner. Message 1 is represented by in the first generatin, either r in the secnd, and ne f 01111, r in the third generatin. Message i, 1 <= i <_ 5 is represented by a cyclic shift ver i-1 psitins f the wrds fr the first message (since 5 is prime they are all distinct). Example 2.2 : A < 7 >'/7 cyclic wmcde (rate = ), cnstructed by D. Leavitt, by extending the methd f example 2. 1 (t appear). We will present a new cyclic < 7 >'/7 wmcde. The first, secnd and furth generatins are equivalent t these f Leavitt's cde, but the thid generatin is different (private cmmunicatin). We will use a prjective gemetry PG (2, 2) r 2-(7, 3, 1) symmetric blck design (Steiner triple system) r Fan plane. 1228
3 L These are different names fr the same bject, described in Figure Fig The Fan plane. This picture shuld be interpreted as fllws : The plane cnsists f seven pints (numbered 1, 2,..., 7) and seven lins, each cntaining three pints (the six lines tgether with the circle in Figure 2. 3). Remark that any pair f pints is n exactly ne fine, and any tw lines intersect in exactly ne pint. With the enumeratin as in Figure 2. 3, the incidence vectrs f lines with the pints f the plane are the cyclic shifts f In what fllws, we shall identify the seven pints f the plane with the wits f a seven-wit memry. Figure 3. 1 shuld be interpreted as fllws : pssible memry states f the wmcde are described by their crrespnding cnfiguratins [The encircled pints in (3. 1)]. Since there are seven messages, they are identified with the seven pints in the Fan plane. Fr each cnfiguratin the message (pint) represented is indicated by an arrw. Using the prperties f the Fan plane given after (2. 3) it is easy t check that Figure 3. 1 describes indeed a < 7 >'/7 wmcde : 1. Each memry state determines uniquely a message pint, and 2. Fr each cnfiguratin in generatin i, and fr each message pint received, it is pssible, by adding ne r tw pints, t find a cnfiguratin in generatin i+1 representing the received message pint. (NB : if the same message is received twice, the memry state is nt changed.) Example 3. 2: Suppse we receive the message sequence 2, 5, 3, 7. Using the wmcde f (3. 1), we btain the fllwing sequence f cnfiguratins representing them: As a cnsequence, every memry cntent can be identified with a cnfiguratin f pints in the plane (i. e. the pints fr which the crrespnding wit cntains a 1). 3. A < 7 >'/7 wmcde The < 7 >'/7 wmcde which we prpse is described in terms f cnfiguratins f pints in the Fan plane in Figure 3. 1 belw. generatin Ouater cnfiguratins Crrespnding t the sequence f memry cntents , , , O (a pint) DECODING 3 4 (tw pints) (a line and a pint) C. r c (a plane with ne r tw pints missing) Fig A descriptin f a < 7) /7 wmcde. Fr the decding, we use the fact that the cdewrds f the [7, 4] binary perfect Hamming cde are all the linear cmbinatins mdul 2 f the lins f the Fan plane (see, fr instance [3]). S the cde wrds are 0', lines, symmetric differences f tw lins, and the whle plane. Cnfiguratins f the wmcde in (3. 1) are never Hamming cdewrd, s they are at Hamming distance 1 frm exactly ne Hamming cde wrd. Mrever, by inspectin f (3. 1) we sec that this Hamming cdewrd is btained by adding (md 2) the message pint t the cnfiguratin. S, if we dente the memry cntent as a Hamming cdewrd, the errr vectr yields exactly the message 229
4 WOMCODES CONSTRUCTED WITH PROJECTIVE GEOMETRIES (i. e. using syndrme decding, each message crrespnds with ne f the seven pssible nn-zer syndrmes). Fr sme f these cnstraints the exact value f t is determined. If turns ut that, using nly the minimal weight cnstraint, des nt always (and prbably nly fr n = 3 r n = 7) yield the maximal t. 4. Mre wmcdes frm prjective gemetries Example 4. 1 : Cnsider the prjective gemetry PG (3, 2). It cntains 15 pints, 35 lines f 3 pints and 15 Fan planes f 7 pints. The [15, 11] Hamming cde can be seen as the cllectin f all linear cmbinatins md 2 f lins in PG (3, 2). Nw the apprach f sectins 3 can be generalised : it is pssible t cnstruct a < 15 >'/15 wmcde which can be "decded" by the methd described in sectin 3, i. e. the message represented by each memry state in the wmcde is just ils Hamming cde errr, and is btained by cmputing the syndrme (see [4] fr details). Example 4. 2 : Fix a line in the Fan plane. The cnfiguratins f the first tw generatins in (3. 1), restricted t thse n this line, describe a < 3 > 2 /3 wmcde. Since a line is a PG (1, 2), this wmcde culd be cnsidered as the first cde f a class f wmcdes, based n PG (n, 2), all having the prperty that they can be dented with syndrme decding fr the Hamming cde. Of curse, the secnd cde f this class is the cde in sectin 3, the third is (4. 1). These three cdes are ptimal in the sense that w(<3>2)>_3, w(<3>3)>_4, w(< 7 > 4)>7, w(<7>5)>_8, w(<15> 7 )>_15, w(<15>')>_16, all by the RS-bund. The next cde in this class is a < 31 >731 wmcde. The RS-bund yields w (< 31 > 14) >_ 31, w (< 31 > 15) >_ 32. We have cnstructed a < 31 > 10 /31 wmcde, s that sme sequences f length 11 cannt be encded. Hwever, we think that by further selectin f the cnfiguratins it is pssible t cnstruct at least a < 31 > 12 /31 wmcde. An imprtant feature f the cdes described is that messages crrespnd t a cset f a linear errrcrrecting cde with (n-k) x n parity check matrix H. Encding a new message m in a memry with state x c { 0, 1 }n is equivalent t finding a y e { 0, 1 }" such that m =y. HT and y >_ x, cmpnentwise. This is als described in [2], tgether with a dynamic prgramming algrithm fr finding a y with minimal weight. Hwever, ther cnstraints fr y than having minimal weight, can be psed, such as "y must be ne f the cnfiguratins f (3. 1)". In [4] sme cnstraints are described t cnstruct < 2n -k _ l > t/2 n-k - l wmcdes based n the crrespnding Hamming cdes. 5. Extensins Fr mre details f these extensins, see [4]. Extensin 5. 1 : Cnsider again the cde f (4.2). If we allw a 4-th message, represented by the empty set and the whle line, in the first resp. secnd generatin, a < 4 > 2/3 wmcde is btained. This is the wmcde f example Extensin 5.2: Cnsider the cde f sectin 3. If, in the first, third and furth generatin, we allw an cighth message, represented by the empty set, a line r the whle plane respectively, we btain a < 8, 7, 8, 8 )/7 wmcde (rate is ). Extensin 5. 3 : Adding t the cnfiguratins in the third generatin all thse cnsisting f three nnclinear pints, it is pssible t represent three mre messages, giving an < 8, 7, 11, 8 >17 wmcde (rate is ). 11 is best pssible here. Extensin 5. 4 : By extending the memry f the cde f sectin 3, respectively example 4. 1 with ne wit, it is pssible t cnstruct an < 8, 14, 11, 8 >/8 (rate is ) and a < 16 >'/16 (rate is ) wmcde, respectively. Cnclusin We have cnsidered memries (wms) which cnsist f a number f Write-Once bit psitins (wits). Using prjective gemetries, we have cnstructed cdes, which make it pssible t use these wms several times. It turned ut that the message, represented by the memry-cntent, can be seen as the syndrme f the binary Hamming cde. Acknwledgements We wuld like t thank Henk Hllmann fr his great help
5 REFERENCES [1] A. FIAT and A. SHAMIR, Generalized Write-Once Memries, IEEE Transactins n Infrmatin Thery, IT-30, 1984, n 3, May 1984, pp [2] C. HEEGARD, An efficient encder fr ptical disk cdes, preprint. [3] J. H. VAN Lira, Intrductin t cding thery, Springer Verlag, New Yrk, [4] F. MERKX, Cdes fr Write-Once Memries, Rapprt Interne, Écle Natinale Supérieure des Télécmmunicatins, Paris, [5] R. L. RIVEST and A. SHAMIR, (1982), Hw t reuse a Write-Once Memry, Infrmatin and Cntrl, 55, 1982, pp
Physical Layer: Outline
18-: Intrductin t Telecmmunicatin Netwrks Lectures : Physical Layer Peter Steenkiste Spring 01 www.cs.cmu.edu/~prs/nets-ece Physical Layer: Outline Digital Representatin f Infrmatin Characterizatin f Cmmunicatin
More informationSOME CONSTRUCTIONS OF OPTIMAL BINARY LINEAR UNEQUAL ERROR PROTECTION CODES
Philips J. Res. 39, 293-304,1984 R 1097 SOME CONSTRUCTIONS OF OPTIMAL BINARY LINEAR UNEQUAL ERROR PROTECTION CODES by W. J. VAN OILS Philips Research Labratries, 5600 JA Eindhven, The Netherlands Abstract
More informationChapter 3 Digital Transmission Fundamentals
Chapter 3 Digital Transmissin Fundamentals Errr Detectin and Crrectin Errr Cntrl Digital transmissin systems intrduce errrs, BER ranges frm 10-3 fr wireless t 10-9 fr ptical fiber Applicatins require certain
More informationDepartment of Electrical Engineering, University of Waterloo. Introduction
Sectin 4: Sequential Circuits Majr Tpics Types f sequential circuits Flip-flps Analysis f clcked sequential circuits Mre and Mealy machines Design f clcked sequential circuits State transitin design methd
More informationCHAPTER 3 INEQUALITIES. Copyright -The Institute of Chartered Accountants of India
CHAPTER 3 INEQUALITIES Cpyright -The Institute f Chartered Accuntants f India INEQUALITIES LEARNING OBJECTIVES One f the widely used decisin making prblems, nwadays, is t decide n the ptimal mix f scarce
More informationCS 477/677 Analysis of Algorithms Fall 2007 Dr. George Bebis Course Project Due Date: 11/29/2007
CS 477/677 Analysis f Algrithms Fall 2007 Dr. Gerge Bebis Curse Prject Due Date: 11/29/2007 Part1: Cmparisn f Srting Algrithms (70% f the prject grade) The bjective f the first part f the assignment is
More informationPre-Calculus Individual Test 2017 February Regional
The abbreviatin NOTA means Nne f the Abve answers and shuld be chsen if chices A, B, C and D are nt crrect. N calculatr is allwed n this test. Arcfunctins (such as y = Arcsin( ) ) have traditinal restricted
More information1996 Engineering Systems Design and Analysis Conference, Montpellier, France, July 1-4, 1996, Vol. 7, pp
THE POWER AND LIMIT OF NEURAL NETWORKS T. Y. Lin Department f Mathematics and Cmputer Science San Jse State University San Jse, Califrnia 959-003 tylin@cs.ssu.edu and Bereley Initiative in Sft Cmputing*
More informationand the Doppler frequency rate f R , can be related to the coefficients of this polynomial. The relationships are:
Algrithm fr Estimating R and R - (David Sandwell, SIO, August 4, 2006) Azimith cmpressin invlves the alignment f successive eches t be fcused n a pint target Let s be the slw time alng the satellite track
More informationChapter Summary. Mathematical Induction Strong Induction Recursive Definitions Structural Induction Recursive Algorithms
Chapter 5 1 Chapter Summary Mathematical Inductin Strng Inductin Recursive Definitins Structural Inductin Recursive Algrithms Sectin 5.1 3 Sectin Summary Mathematical Inductin Examples f Prf by Mathematical
More informationPattern Recognition 2014 Support Vector Machines
Pattern Recgnitin 2014 Supprt Vectr Machines Ad Feelders Universiteit Utrecht Ad Feelders ( Universiteit Utrecht ) Pattern Recgnitin 1 / 55 Overview 1 Separable Case 2 Kernel Functins 3 Allwing Errrs (Sft
More informationDifferentiation Applications 1: Related Rates
Differentiatin Applicatins 1: Related Rates 151 Differentiatin Applicatins 1: Related Rates Mdel 1: Sliding Ladder 10 ladder y 10 ladder 10 ladder A 10 ft ladder is leaning against a wall when the bttm
More informationPhysics 2010 Motion with Constant Acceleration Experiment 1
. Physics 00 Mtin with Cnstant Acceleratin Experiment In this lab, we will study the mtin f a glider as it accelerates dwnhill n a tilted air track. The glider is supprted ver the air track by a cushin
More informationChapter 3: Cluster Analysis
Chapter 3: Cluster Analysis } 3.1 Basic Cncepts f Clustering 3.1.1 Cluster Analysis 3.1. Clustering Categries } 3. Partitining Methds 3..1 The principle 3.. K-Means Methd 3..3 K-Medids Methd 3..4 CLARA
More informationDetermining the Accuracy of Modal Parameter Estimation Methods
Determining the Accuracy f Mdal Parameter Estimatin Methds by Michael Lee Ph.D., P.E. & Mar Richardsn Ph.D. Structural Measurement Systems Milpitas, CA Abstract The mst cmmn type f mdal testing system
More information(2) Even if such a value of k was possible, the neutrons multiply
CHANGE OF REACTOR Nuclear Thery - Curse 227 POWER WTH REACTVTY CHANGE n this lessn, we will cnsider hw neutrn density, neutrn flux and reactr pwer change when the multiplicatin factr, k, r the reactivity,
More informationHomology groups of disks with holes
Hmlgy grups f disks with hles THEOREM. Let p 1,, p k } be a sequence f distinct pints in the interir unit disk D n where n 2, and suppse that fr all j the sets E j Int D n are clsed, pairwise disjint subdisks.
More informationNUROP CONGRESS PAPER CHINESE PINYIN TO CHINESE CHARACTER CONVERSION
NUROP Chinese Pinyin T Chinese Character Cnversin NUROP CONGRESS PAPER CHINESE PINYIN TO CHINESE CHARACTER CONVERSION CHIA LI SHI 1 AND LUA KIM TENG 2 Schl f Cmputing, Natinal University f Singapre 3 Science
More informationCHAPTER 4 DIAGNOSTICS FOR INFLUENTIAL OBSERVATIONS
CHAPTER 4 DIAGNOSTICS FOR INFLUENTIAL OBSERVATIONS 1 Influential bservatins are bservatins whse presence in the data can have a distrting effect n the parameter estimates and pssibly the entire analysis,
More informationLyapunov Stability Stability of Equilibrium Points
Lyapunv Stability Stability f Equilibrium Pints 1. Stability f Equilibrium Pints - Definitins In this sectin we cnsider n-th rder nnlinear time varying cntinuus time (C) systems f the frm x = f ( t, x),
More informationDepartment of Economics, University of California, Davis Ecn 200C Micro Theory Professor Giacomo Bonanno. Insurance Markets
Department f Ecnmics, University f alifrnia, Davis Ecn 200 Micr Thery Prfessr Giacm Bnann Insurance Markets nsider an individual wh has an initial wealth f. ith sme prbability p he faces a lss f x (0
More informationREADING STATECHART DIAGRAMS
READING STATECHART DIAGRAMS Figure 4.48 A Statechart diagram with events The diagram in Figure 4.48 shws all states that the bject plane can be in during the curse f its life. Furthermre, it shws the pssible
More informationinitially lcated away frm the data set never win the cmpetitin, resulting in a nnptimal nal cdebk, [2] [3] [4] and [5]. Khnen's Self Organizing Featur
Cdewrd Distributin fr Frequency Sensitive Cmpetitive Learning with One Dimensinal Input Data Aristides S. Galanpuls and Stanley C. Ahalt Department f Electrical Engineering The Ohi State University Abstract
More informationk-nearest Neighbor How to choose k Average of k points more reliable when: Large k: noise in attributes +o o noise in class labels
Mtivating Example Memry-Based Learning Instance-Based Learning K-earest eighbr Inductive Assumptin Similar inputs map t similar utputs If nt true => learning is impssible If true => learning reduces t
More informationTHE LIFE OF AN OBJECT IT SYSTEMS
THE LIFE OF AN OBJECT IT SYSTEMS Persns, bjects, r cncepts frm the real wrld, which we mdel as bjects in the IT system, have "lives". Actually, they have tw lives; the riginal in the real wrld has a life,
More informationSequential Allocation with Minimal Switching
In Cmputing Science and Statistics 28 (1996), pp. 567 572 Sequential Allcatin with Minimal Switching Quentin F. Stut 1 Janis Hardwick 1 EECS Dept., University f Michigan Statistics Dept., Purdue University
More informationENSC Discrete Time Systems. Project Outline. Semester
ENSC 49 - iscrete Time Systems Prject Outline Semester 006-1. Objectives The gal f the prject is t design a channel fading simulatr. Upn successful cmpletin f the prject, yu will reinfrce yur understanding
More informationCOMP 551 Applied Machine Learning Lecture 9: Support Vector Machines (cont d)
COMP 551 Applied Machine Learning Lecture 9: Supprt Vectr Machines (cnt d) Instructr: Herke van Hf (herke.vanhf@mail.mcgill.ca) Slides mstly by: Class web page: www.cs.mcgill.ca/~hvanh2/cmp551 Unless therwise
More information1 The limitations of Hartree Fock approximation
Chapter: Pst-Hartree Fck Methds - I The limitatins f Hartree Fck apprximatin The n electrn single determinant Hartree Fck wave functin is the variatinal best amng all pssible n electrn single determinants
More informationOn small defining sets for some SBIBD(4t - 1, 2t - 1, t - 1)
University f Wllngng Research Online Faculty f Infrmatics - Papers (Archive) Faculty f Engineering and Infrmatin Sciences 992 On small defining sets fr sme SBIBD(4t -, 2t -, t - ) Jennifer Seberry University
More informationKeysight Technologies Understanding the Kramers-Kronig Relation Using A Pictorial Proof
Keysight Technlgies Understanding the Kramers-Krnig Relatin Using A Pictrial Prf By Clin Warwick, Signal Integrity Prduct Manager, Keysight EEsf EDA White Paper Intrductin In principle, applicatin f the
More informationAdmissibility Conditions and Asymptotic Behavior of Strongly Regular Graphs
Admissibility Cnditins and Asympttic Behavir f Strngly Regular Graphs VASCO MOÇO MANO Department f Mathematics University f Prt Oprt PORTUGAL vascmcman@gmailcm LUÍS ANTÓNIO DE ALMEIDA VIEIRA Department
More informationBootstrap Method > # Purpose: understand how bootstrap method works > obs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(obs) >
Btstrap Methd > # Purpse: understand hw btstrap methd wrks > bs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(bs) > mean(bs) [1] 21.64625 > # estimate f lambda > lambda = 1/mean(bs);
More informationSupport-Vector Machines
Supprt-Vectr Machines Intrductin Supprt vectr machine is a linear machine with sme very nice prperties. Haykin chapter 6. See Alpaydin chapter 13 fr similar cntent. Nte: Part f this lecture drew material
More informationLab 1 The Scientific Method
INTRODUCTION The fllwing labratry exercise is designed t give yu, the student, an pprtunity t explre unknwn systems, r universes, and hypthesize pssible rules which may gvern the behavir within them. Scientific
More informationThe blessing of dimensionality for kernel methods
fr kernel methds Building classifiers in high dimensinal space Pierre Dupnt Pierre.Dupnt@ucluvain.be Classifiers define decisin surfaces in sme feature space where the data is either initially represented
More informationFloating Point Method for Solving Transportation. Problems with Additional Constraints
Internatinal Mathematical Frum, Vl. 6, 20, n. 40, 983-992 Flating Pint Methd fr Slving Transprtatin Prblems with Additinal Cnstraints P. Pandian and D. Anuradha Department f Mathematics, Schl f Advanced
More informationMODULE 1. e x + c. [You can t separate a demominator, but you can divide a single denominator into each numerator term] a + b a(a + b)+1 = a + b
. REVIEW OF SOME BASIC ALGEBRA MODULE () Slving Equatins Yu shuld be able t slve fr x: a + b = c a d + e x + c and get x = e(ba +) b(c a) d(ba +) c Cmmn mistakes and strategies:. a b + c a b + a c, but
More informationBASD HIGH SCHOOL FORMAL LAB REPORT
BASD HIGH SCHOOL FORMAL LAB REPORT *WARNING: After an explanatin f what t include in each sectin, there is an example f hw the sectin might lk using a sample experiment Keep in mind, the sample lab used
More informationChapter 3 Digital Transmission Fundamentals
Chapter 3 Digital Transmissin Fundamentals Errr Detectin and Crrectin CSE 3213, Winter 2010 Instructr: Frhar Frzan Mdul-2 Arithmetic Mdul 2 arithmetic is perfrmed digit y digit n inary numers. Each digit
More informationMedium Scale Integrated (MSI) devices [Sections 2.9 and 2.10]
EECS 270, Winter 2017, Lecture 3 Page 1 f 6 Medium Scale Integrated (MSI) devices [Sectins 2.9 and 2.10] As we ve seen, it s smetimes nt reasnable t d all the design wrk at the gate-level smetimes we just
More informationSUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical model for microarray data analysis
SUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical mdel fr micrarray data analysis David Rssell Department f Bistatistics M.D. Andersn Cancer Center, Hustn, TX 77030, USA rsselldavid@gmail.cm
More informationYou need to be able to define the following terms and answer basic questions about them:
CS440/ECE448 Sectin Q Fall 2017 Midterm Review Yu need t be able t define the fllwing terms and answer basic questins abut them: Intr t AI, agents and envirnments Pssible definitins f AI, prs and cns f
More information2.161 Signal Processing: Continuous and Discrete Fall 2008
MIT OpenCurseWare http://cw.mit.edu 2.161 Signal Prcessing: Cntinuus and Discrete Fall 2008 Fr infrmatin abut citing these materials r ur Terms f Use, visit: http://cw.mit.edu/terms. Massachusetts Institute
More informationDead-beat controller design
J. Hetthéssy, A. Barta, R. Bars: Dead beat cntrller design Nvember, 4 Dead-beat cntrller design In sampled data cntrl systems the cntrller is realised by an intelligent device, typically by a PLC (Prgrammable
More informationFrom Signals to Packets. Outline : Introduction to Telecommunication Networks Lectures 5: Datalink layer. Error Control.
8-45: Intrductin t Telecmmunicatin Netwrks Lectures 5: Datalink layer Peter Steenkiste Frm Signals t Packets Analg Signal Digital Signal Bit Stream 0 0 0 0 0 0 Spring 05 www.cs.cmu.edu/~prs/nets-ece Packets
More informationDataflow Analysis and Abstract Interpretation
Dataflw Analysis and Abstract Interpretatin Cmputer Science and Artificial Intelligence Labratry MIT Nvember 9, 2015 Recap Last time we develped frm first principles an algrithm t derive invariants. Key
More informationCONSTRUCTING STATECHART DIAGRAMS
CONSTRUCTING STATECHART DIAGRAMS The fllwing checklist shws the necessary steps fr cnstructing the statechart diagrams f a class. Subsequently, we will explain the individual steps further. Checklist 4.6
More informationA New Evaluation Measure. J. Joiner and L. Werner. The problems of evaluation and the needed criteria of evaluation
III-l III. A New Evaluatin Measure J. Jiner and L. Werner Abstract The prblems f evaluatin and the needed criteria f evaluatin measures in the SMART system f infrmatin retrieval are reviewed and discussed.
More informationSection 6-2: Simplex Method: Maximization with Problem Constraints of the Form ~
Sectin 6-2: Simplex Methd: Maximizatin with Prblem Cnstraints f the Frm ~ Nte: This methd was develped by Gerge B. Dantzig in 1947 while n assignment t the U.S. Department f the Air Frce. Definitin: Standard
More informationA Simple Set of Test Matrices for Eigenvalue Programs*
Simple Set f Test Matrices fr Eigenvalue Prgrams* By C. W. Gear** bstract. Sets f simple matrices f rder N are given, tgether with all f their eigenvalues and right eigenvectrs, and simple rules fr generating
More informationCESAR Science Case The differential rotation of the Sun and its Chromosphere. Introduction. Material that is necessary during the laboratory
Teacher s guide CESAR Science Case The differential rtatin f the Sun and its Chrmsphere Material that is necessary during the labratry CESAR Astrnmical wrd list CESAR Bklet CESAR Frmula sheet CESAR Student
More informationReview Problems 3. Four FIR Filter Types
Review Prblems 3 Fur FIR Filter Types Fur types f FIR linear phase digital filters have cefficients h(n fr 0 n M. They are defined as fllws: Type I: h(n = h(m-n and M even. Type II: h(n = h(m-n and M dd.
More informationPreparation work for A2 Mathematics [2017]
Preparatin wrk fr A2 Mathematics [2017] The wrk studied in Y12 after the return frm study leave is frm the Cre 3 mdule f the A2 Mathematics curse. This wrk will nly be reviewed during Year 13, it will
More informationo o IMPORTANT REMINDERS Reports will be graded largely on their ability to clearly communicate results and important conclusions.
BASD High Schl Frmal Lab Reprt GENERAL INFORMATION 12 pt Times New Rman fnt Duble-spaced, if required by yur teacher 1 inch margins n all sides (tp, bttm, left, and right) Always write in third persn (avid
More informationSource Coding Fundamentals
Surce Cding Fundamentals Surce Cding Fundamentals Thmas Wiegand Digital Image Cmmunicatin 1 / 54 Surce Cding Fundamentals Outline Intrductin Lssless Cding Huffman Cding Elias and Arithmetic Cding Rate-Distrtin
More informationMethods for Determination of Mean Speckle Size in Simulated Speckle Pattern
0.478/msr-04-004 MEASUREMENT SCENCE REVEW, Vlume 4, N. 3, 04 Methds fr Determinatin f Mean Speckle Size in Simulated Speckle Pattern. Hamarvá, P. Šmíd, P. Hrváth, M. Hrabvský nstitute f Physics f the Academy
More informationMath Foundations 20 Work Plan
Math Fundatins 20 Wrk Plan Units / Tpics 20.8 Demnstrate understanding f systems f linear inequalities in tw variables. Time Frame December 1-3 weeks 6-10 Majr Learning Indicatrs Identify situatins relevant
More informationComputational modeling techniques
Cmputatinal mdeling techniques Lecture 4: Mdel checing fr ODE mdels In Petre Department f IT, Åb Aademi http://www.users.ab.fi/ipetre/cmpmd/ Cntent Stichimetric matrix Calculating the mass cnservatin relatins
More informationOF SIMPLY SUPPORTED PLYWOOD PLATES UNDER COMBINED EDGEWISE BENDING AND COMPRESSION
U. S. FOREST SERVICE RESEARCH PAPER FPL 50 DECEMBER U. S. DEPARTMENT OF AGRICULTURE FOREST SERVICE FOREST PRODUCTS LABORATORY OF SIMPLY SUPPORTED PLYWOOD PLATES UNDER COMBINED EDGEWISE BENDING AND COMPRESSION
More informationInterference is when two (or more) sets of waves meet and combine to produce a new pattern.
Interference Interference is when tw (r mre) sets f waves meet and cmbine t prduce a new pattern. This pattern can vary depending n the riginal wave directin, wavelength, amplitude, etc. The tw mst extreme
More informationSubject description processes
Subject representatin 6.1.2. Subject descriptin prcesses Overview Fur majr prcesses r areas f practice fr representing subjects are classificatin, subject catalging, indexing, and abstracting. The prcesses
More informationChapter 8 Predicting Molecular Geometries
Chapter 8 Predicting Mlecular Gemetries 8-1 Mlecular shape The Lewis diagram we learned t make in the last chapter are a way t find bnds between atms and lne pais f electrns n atms, but are nt intended
More informationTRAINING GUIDE. Overview of Lucity Spatial
TRAINING GUIDE Overview f Lucity Spatial Overview f Lucity Spatial In this sessin, we ll cver the key cmpnents f Lucity Spatial. Table f Cntents Lucity Spatial... 2 Requirements... 2 Supprted Mdules...
More informationThis section is primarily focused on tools to aid us in finding roots/zeros/ -intercepts of polynomials. Essentially, our focus turns to solving.
Sectin 3.2: Many f yu WILL need t watch the crrespnding vides fr this sectin n MyOpenMath! This sectin is primarily fcused n tls t aid us in finding rts/zers/ -intercepts f plynmials. Essentially, ur fcus
More informationChapter 3 Kinematics in Two Dimensions; Vectors
Chapter 3 Kinematics in Tw Dimensins; Vectrs Vectrs and Scalars Additin f Vectrs Graphical Methds (One and Tw- Dimensin) Multiplicatin f a Vectr b a Scalar Subtractin f Vectrs Graphical Methds Adding Vectrs
More informationMODULE FOUR. This module addresses functions. SC Academic Elementary Algebra Standards:
MODULE FOUR This mdule addresses functins SC Academic Standards: EA-3.1 Classify a relatinship as being either a functin r nt a functin when given data as a table, set f rdered pairs, r graph. EA-3.2 Use
More informationAn Area Efficient (31, 16) BCH Decoder for Three Errors
An Area Efficient (31, 16) BCH Decder fr Three Errrs M. Prashanthi 1, P. Samundiswary 2 1 M. Tech, Department f Electrnics Engineering, Pndicherry University, Pndicherry, India 2 Assistant Prfessr, Department
More informationKinematic transformation of mechanical behavior Neville Hogan
inematic transfrmatin f mechanical behavir Neville Hgan Generalized crdinates are fundamental If we assume that a linkage may accurately be described as a cllectin f linked rigid bdies, their generalized
More informationSPH3U1 Lesson 06 Kinematics
PROJECTILE MOTION LEARNING GOALS Students will: Describe the mtin f an bject thrwn at arbitrary angles thrugh the air. Describe the hrizntal and vertical mtins f a prjectile. Slve prjectile mtin prblems.
More informationComputational modeling techniques
Cmputatinal mdeling techniques Lecture 2: Mdeling change. In Petre Department f IT, Åb Akademi http://users.ab.fi/ipetre/cmpmd/ Cntent f the lecture Basic paradigm f mdeling change Examples Linear dynamical
More informationTree Structured Classifier
Tree Structured Classifier Reference: Classificatin and Regressin Trees by L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stne, Chapman & Hall, 98. A Medical Eample (CART): Predict high risk patients
More informationThe standards are taught in the following sequence.
B L U E V A L L E Y D I S T R I C T C U R R I C U L U M MATHEMATICS Third Grade In grade 3, instructinal time shuld fcus n fur critical areas: (1) develping understanding f multiplicatin and divisin and
More informationRevision: August 19, E Main Suite D Pullman, WA (509) Voice and Fax
.7.4: Direct frequency dmain circuit analysis Revisin: August 9, 00 5 E Main Suite D Pullman, WA 9963 (509) 334 6306 ice and Fax Overview n chapter.7., we determined the steadystate respnse f electrical
More informationTrigonometric Ratios Unit 5 Tentative TEST date
1 U n i t 5 11U Date: Name: Trignmetric Ratis Unit 5 Tentative TEST date Big idea/learning Gals In this unit yu will extend yur knwledge f SOH CAH TOA t wrk with btuse and reflex angles. This extensin
More informationLead/Lag Compensator Frequency Domain Properties and Design Methods
Lectures 6 and 7 Lead/Lag Cmpensatr Frequency Dmain Prperties and Design Methds Definitin Cnsider the cmpensatr (ie cntrller Fr, it is called a lag cmpensatr s K Fr s, it is called a lead cmpensatr Ntatin
More informationFINITE BOOLEAN ALGEBRA. 1. Deconstructing Boolean algebras with atoms. Let B = <B,,,,,0,1> be a Boolean algebra and c B.
FINITE BOOLEAN ALGEBRA 1. Decnstructing Blean algebras with atms. Let B = be a Blean algebra and c B. The ideal generated by c, (c], is: (c] = {b B: b c} The filter generated by c, [c), is:
More information3.4 Shrinkage Methods Prostate Cancer Data Example (Continued) Ridge Regression
3.3.4 Prstate Cancer Data Example (Cntinued) 3.4 Shrinkage Methds 61 Table 3.3 shws the cefficients frm a number f different selectin and shrinkage methds. They are best-subset selectin using an all-subsets
More informationPublic Key Cryptography. Tim van der Horst & Kent Seamons
Public Key Cryptgraphy Tim van der Hrst & Kent Seamns Last Updated: Oct 5, 2017 Asymmetric Encryptin Why Public Key Crypt is Cl Has a linear slutin t the key distributin prblem Symmetric crypt has an expnential
More informationB. Definition of an exponential
Expnents and Lgarithms Chapter IV - Expnents and Lgarithms A. Intrductin Starting with additin and defining the ntatins fr subtractin, multiplicatin and divisin, we discvered negative numbers and fractins.
More informationLeast Squares Optimal Filtering with Multirate Observations
Prc. 36th Asilmar Cnf. n Signals, Systems, and Cmputers, Pacific Grve, CA, Nvember 2002 Least Squares Optimal Filtering with Multirate Observatins Charles W. herrien and Anthny H. Hawes Department f Electrical
More information^YawataR&D Laboratory, Nippon Steel Corporation, Tobata, Kitakyushu, Japan
Detectin f fatigue crack initiatin frm a ntch under a randm lad C. Makabe," S. Nishida^C. Urashima,' H. Kaneshir* "Department f Mechanical Systems Engineering, University f the Ryukyus, Nishihara, kinawa,
More informationCHAPTER 2 Algebraic Expressions and Fundamental Operations
CHAPTER Algebraic Expressins and Fundamental Operatins OBJECTIVES: 1. Algebraic Expressins. Terms. Degree. Gruping 5. Additin 6. Subtractin 7. Multiplicatin 8. Divisin Algebraic Expressin An algebraic
More informationPerfrmance f Sensitizing Rules n Shewhart Cntrl Charts with Autcrrelated Data Key Wrds: Autregressive, Mving Average, Runs Tests, Shewhart Cntrl Chart
Perfrmance f Sensitizing Rules n Shewhart Cntrl Charts with Autcrrelated Data Sandy D. Balkin Dennis K. J. Lin y Pennsylvania State University, University Park, PA 16802 Sandy Balkin is a graduate student
More informationPreparation work for A2 Mathematics [2018]
Preparatin wrk fr A Mathematics [018] The wrk studied in Y1 will frm the fundatins n which will build upn in Year 13. It will nly be reviewed during Year 13, it will nt be retaught. This is t allw time
More information, which yields. where z1. and z2
The Gaussian r Nrmal PDF, Page 1 The Gaussian r Nrmal Prbability Density Functin Authr: Jhn M Cimbala, Penn State University Latest revisin: 11 September 13 The Gaussian r Nrmal Prbability Density Functin
More informationFlipping Physics Lecture Notes: Simple Harmonic Motion Introduction via a Horizontal Mass-Spring System
Flipping Physics Lecture Ntes: Simple Harmnic Mtin Intrductin via a Hrizntal Mass-Spring System A Hrizntal Mass-Spring System is where a mass is attached t a spring, riented hrizntally, and then placed
More informationMAKING DOUGHNUTS OF COHEN REALS
MAKING DUGHNUTS F CHEN REALS Lrenz Halbeisen Department f Pure Mathematics Queen s University Belfast Belfast BT7 1NN, Nrthern Ireland Email: halbeis@qub.ac.uk Abstract Fr a b ω with b \ a infinite, the
More informationApplication Of Mealy Machine And Recurrence Relations In Cryptography
Applicatin Of Mealy Machine And Recurrence Relatins In Cryptgraphy P. A. Jytirmie 1, A. Chandra Sekhar 2, S. Uma Devi 3 1 Department f Engineering Mathematics, Andhra University, Visakhapatnam, IDIA 2
More informationTuring Machines. Human-aware Robotics. 2017/10/17 & 19 Chapter 3.2 & 3.3 in Sipser Ø Announcement:
Turing Machines Human-aware Rbtics 2017/10/17 & 19 Chapter 3.2 & 3.3 in Sipser Ø Annuncement: q q q q Slides fr this lecture are here: http://www.public.asu.edu/~yzhan442/teaching/cse355/lectures/tm-ii.pdf
More informationWhat is Statistical Learning?
What is Statistical Learning? Sales 5 10 15 20 25 Sales 5 10 15 20 25 Sales 5 10 15 20 25 0 50 100 200 300 TV 0 10 20 30 40 50 Radi 0 20 40 60 80 100 Newspaper Shwn are Sales vs TV, Radi and Newspaper,
More informationPLEASURE TEST SERIES (XI) - 07 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)
A Cmpilatin By : OP Gupta (WhatsApp @ +9-9650 50 80) Fr mre stuffs n Maths, please visit : wwwtheopguptacm Time Allwed : 80 Minutes Max Marks : 00 SECTION A Questin numbers 0 t 0 carry mark each x x 5
More informationWe can see from the graph above that the intersection is, i.e., [ ).
MTH 111 Cllege Algebra Lecture Ntes July 2, 2014 Functin Arithmetic: With nt t much difficulty, we ntice that inputs f functins are numbers, and utputs f functins are numbers. S whatever we can d with
More informationChemistry 20 Lesson 11 Electronegativity, Polarity and Shapes
Chemistry 20 Lessn 11 Electrnegativity, Plarity and Shapes In ur previus wrk we learned why atms frm cvalent bnds and hw t draw the resulting rganizatin f atms. In this lessn we will learn (a) hw the cmbinatin
More informationCambridge Assessment International Education Cambridge Ordinary Level. Published
Cambridge Assessment Internatinal Educatin Cambridge Ordinary Level ADDITIONAL MATHEMATICS 4037/1 Paper 1 Octber/Nvember 017 MARK SCHEME Maximum Mark: 80 Published This mark scheme is published as an aid
More informationHow do scientists measure trees? What is DBH?
Hw d scientists measure trees? What is DBH? Purpse Students develp an understanding f tree size and hw scientists measure trees. Students bserve and measure tree ckies and explre the relatinship between
More informationAristotle I PHIL301 Prof. Oakes Winthrop University updated: 3/14/14 8:48 AM
Aristtle I PHIL301 Prf. Oakes Winthrp University updated: 3/14/14 8:48 AM The Categries - The Categries is ne f several imprtant wrks by Aristtle n metaphysics. His tpic here is the classificatin f beings
More informationCOMP 551 Applied Machine Learning Lecture 11: Support Vector Machines
COMP 551 Applied Machine Learning Lecture 11: Supprt Vectr Machines Instructr: (jpineau@cs.mcgill.ca) Class web page: www.cs.mcgill.ca/~jpineau/cmp551 Unless therwise nted, all material psted fr this curse
More informationA New Approach to Increase Parallelism for Dependent Loops
A New Apprach t Increase Parallelism fr Dependent Lps Yeng-Sheng Chen, Department f Electrical Engineering, Natinal Taiwan University, Taipei 06, Taiwan, Tsang-Ming Jiang, Arctic Regin Supercmputing Center,
More information