Deflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007
|
|
- Stella Elliott
- 5 years ago
- Views:
Transcription
1 Deflation of the I-O Series Soe Technical Aspects Giorgio Rapa University of Genoa April Introduction The nuber of sectors is 42 for the period and 38 for the initial period: see the Read e file in the ain page of the website for details. The base year for deflation was chosen to be 1978: this is because 1978 is situated id-way between the two oil shocks (and not ainly because it is idway between 1959 and 2!), thus avoiding the suation of the effects of the two shocks in any of the two tie directions. In addition, 1978 is a year in which the econoic cycle in Italy is not at an extree point, and the growth of the ain acroeconoic variables is in line with the average of the post-war period. The version of I-O tables to be deflated is that expressed in producer prices ( depart usine / depart douane ): this should reduce possible biases iplicit in the deflation of the alternative version ( purchaser prices ), due to the fact that in the latter flows are gross of trade argins and transport costs, and thus the product ix of cells is ore heterogeneous. In particular, this choice should reduce the differences in the deflators as regards interediate and consuption goods (as regards trade argins in consuption goods, se point 2.2.h below). In addition, the deflated tables are those with IBS allocated to interediate costs of sectors (see the Read e file quoted above): in fact this version has a ore natural interpretation in ters of I-O analysis. 2. First estiates of flows: price and quantity indexes, and chaining 2.1 The flows to be deflated were the following for each year: d - interediate flows: a (42 by 42) atrix X of doestically produced goods, and a second (42 by 42) atrix X of iported goods. On the whole, 3528 ites; - final expenditure: private consuption; non-arket services of Governent, and of Social d Institutions; fixed investent; change in stocks; exports. Forally a (42 by 6) atrix Y of produced goods, and a siilar one Y of iported goods, that is 54 ites; - sectors value added (gross of indirect taxes on products), va : 42 ites; - product transfers between sectors (due to siilar products sold by different sectors, according to the ESA1979 standard), t: 42 ites; - sectors doestic output, x: 42 ites; - iports of goods and services (gross of taxes on iports), : 42 ites. In order to exploit soe additional inforation fro National accounts, we inserted also the ten ites coing fro the aggregate equilibriu account of resources and uses: GDP (net of taxes on iports), iports of goods (Mg), iports of services (Ms), household consuption (C), Collective consuption of General Governent (Cg), Collective consuption of social institutions (Cs), Gross fixed capital foration (If), Change in stocks ( s), Exports of goods (Xg), Exports of services (Xs). All these ites are single nubers. The total nuber of ites to be deflated and balanced is then 421 (any of which are equal to zero). However, the Z atrix (as defined by expression 5 of paper #1 of the website: we oit here the left-superscript ) has forally ( )=88 rows and 48 coluns, and thus we have 1
2 4224 cells. Thus atrix Z was arranged as follows, with the above sybol definitions (pries denote transposed vectors): d X X va' Z = t x d Y Y e 1, where e1 GDP 2 = C 3 4 Mg The final square bracket contains 4x6 scalars. The output vector x ust be interpreted as distributed output, that is sectors output plus transfers t. 2.2 The initial estiates of the deflated cells were obtained as follows: a. doestic uses of doestic goods (i.e. excluding exports): deflation by eans of rowunifor price indexes of doestic output; b. exports: deflation by eans of price indexes of exports; c. iports (total, interediate and total): deflation by eans of row-unifor price indexes of iports; d. product transfers: price index of the sector where the transfer appears; e. value added: obtained through quantity indexes of constant-price value added (derived for National accounts) applied to the current-price value added of the base-year table; f. sectors output: a siple ean of (a) deflation with output price indexes and (b) coputation through quantity indexes applied to the base-year table; g. ites of the aggregate resources/uses account: quantity indexes for national accounts; h. trade and transportation argins: since they appear explicitly on proper rows of the table (Trade, Inland transport, Maritie and air transport), they were row-uniforly deflated with the price indexes of the corresponding selling sectors. A distinction was however ade as regards trade argin on interediate and on consuption goods, since it is reasonable to think that the price dynaics of the latter ay diverge fro that of wholesale trade. This was ade possible by coparison between the price index of goods as expressed in producer prices, and that of goods as derived fro household consuption statistics. When the indexes, derived fro various sources of National accounts, were ore aggregated than 42 sectors, the sae index was utilised for sectors belonging to the sae acro-sector. 2.3 Deflation was ipleented through a sort of chained quantity index ethod. That is, we did not deflate flows directly to 1978 prices, using 1978-based indexes. We followed instead the following procedure. Start fro 1978 and ove towards 2 (when oving in the other direction, towards 1959, siply change t 1 into t+1 in what follows). Consider the table of year t > 1978, and assue you already deflated (and balanced) the table of year t 1 in 1978 prices: of course, when dealing with t=1979, the current-price 1978 table is already deflated as such! Copute price and quantity indexes of year t based on year t 1, and deflate all ites of the table of year t, thus obtaining a provisional table of year t in (t 1) prices. Then divide each cell of this table by the corresponding cell of the current-price table of year t 1: you get quantity indexes of year t based on year t 1. Finally, ultiply these quantity indexes by the correspond cells of the 1978-price table of year t 1, which is already balanced by assuption. This is the first estiate of the 1978-price table of year t. 2 Cg Ms Cs If s Xg Xs (1)
3 3. Constraints and final balancing The constraints to be fulfilled are basically the following (a suffix to vectors indicates their diension; k is a null k-vector; u is a vector of ones): C.1. the su of each row (interediate plus final uses) of the doestic block ust be equal to d d distributed output, in sybols X u42 + Y u6 x = 42 : 42 constraints; C.2. the su of interediate costs plus value added plus product transfers ust be equal to output, in sybols u 42 X d + u 42 X + va + t x = 42 : 42 constraints; C.3. the su of each row (interediate plus final uses) of the iport block ust be equal to iported resources, in sybols X u42 + Y u6 = 42 : 42 constraints; C.4. the su of product transfers ust be equal to zero, in sybols u t : 1 constraint Up to now nuber of constraints is 127. However, as we said, we added ten aggregated variables fro the resources/uses account, in order to take ore inforation into account. This adds ten ore constraints to be satisfied: su of sectors value added = GDP, su if iported goods = Mg, su of iported services = Ms, and so on (see definitions at the end of page 1). Thus we have a total of 137 constraints. 42 = Define, as in section 3 of paper #1 of the website, the vector z vec( Z) = : it has 4224 eleents. The constraints can be written as Gz = 137, where G is a (137 by 4224) atrix whose cells are equal to, 1 or 1 in due positions. Appendix 1 contains the precise definition of G. It was built by eans of a MATLAB progra, whose script is contained in Appendix 2; translation into different languages should not be difficult. The first estiates contained in vector z do not fulfil the constraints. The SWLS balancing algorith, as discussed in paper #1, is thus the following: 1 [ GVG' ] [ Gz] z* = z VG' (2) where V is the subjective variances/co-variances atrix of the ites in vector z, that is it contains subjective evaluations of the reliability of first estiates. The atrix V was assued to be diagonal, i.e. co-variances were assued null. Variances were coputed dividing the size of each cell (taken in absolute value) by an index of its reliability: the reliability indexes were set in a very siple-inded anner. A unifor reliability was assigned to interediate flows; this index is lower than that of final uses (excluding inventory changes, which were assigned a reliability index even lower than that of interediate uses). Aong final uses, the higher reliability was that of exports, since they and their prices are presented in uch ore detail in published statistics. The sae arguent was applied to iported resource (not for their disaggregated uses). The figures coputed by eans to quantity indexes (output, value added and aggregate resources/uses account, excluding aggregate change in stocks) are deeed to be ore reliable than the previous ones, since they are the core of national accounts. Of course, all cells which are equal to zero after the initial estiate should reain such also after balancing: then their reliability should be infinite. However, in order to avoid singularities in 5 the atrix inversion appearing in (2), their variance was not set equal to zero, but equal to 1. The balancing algorith was ipleented by eans of the MATLAB package for Windows (progra available on request). 3
4 Appendix 1 Definition of atrix G Matrix G can be thought of as ade up of 14 row-blocks, one for each set of constraints described in section 3: C.1 C.4, plus the ten additional constraints coing fro the aggregate account of uses/resources equilibriu. In sybols: G = G G G Now, recall the definition (1) of Z (in particular: the ordering of the last 6 coluns of the ites of final deand, and of the last four rows), and the eaning of the operation z = vec( Z). One ust reeber the sequence of the eleents in vector z: is contains sequentially all coluns of atrix Z. I now define the 14 blocks of G. They ust be defined in such a way that they operate on vector z (not on atrix Z); then the use of the Kronecker product is convenient. Given any two atrices A and B, where A is (n by ) and B is (k by l), one has: a11b a12b a1b = a21b a22b a2b A B, a (nk by l) atrix. an1b an2b anb Define in addition the following ites: I l is the identity atrix of size l; n, is the (n by ) null atrix (in particular it could be a vector); u k is the vector containing k ones Block G 1 Constraints C.1. For each of the first 42 rows of Z, su all the 48 eleents on that row and then subtract fro this the corresponding eleent of x (distributed output, lying on row 87 of Z, coluns 1-42): the result ust be zero. Now translate this into constraints on vector z. Define the (42 by 88) atrix H x = [ I 42 42,46 ], and the 88-vector f x = [ 1,86 1 ]. Soe G = u H + I f is the atrix required reflection will convince you that {[ ] [ ]} 1 48 x 42 x 42,528 for representing constraints C.1: G 1z = 42, 1. It is a (42 by 4424) atrix. Block G 2 Constraints C.2. For each of the first 42 coluns of Z, su all the first 86 eleents on that colun (interediate costs plus value added plus transfers) and then subtract fro this the corresponding eleent of x (distributed output, lying on row 87 of Z, coluns 1-42): the result ust be zero. To translate this into constraints on vector z, define the 88-vector s = [ u 86 1 ] and the (x by y) atrix K I s G = K is the atrix required for representing = 42. Then [ ] 2 42,528 constraints C.2: G 2z = 42, 1. It is again a (42 by 4424) atrix. 4
5 Block G 3 Constraints C.3. For each of the 42 rows of the second block (rows 43 to 84) of Z, su all the 48 eleents on that row and then subtract fro this the corresponding eleent of (iports, lying on row 88 of Z): the result ust be zero. In order to translate this into constraints on vector z, define the (42 by 88) atrix I = 1. Then the (42 by 4224) atrix H = [ 42, ,4 ] and the 88-vector f [ 1,87 ] G u H + {[ I f ] [ ]} = is the one required for representing constraints C.3: ,528 G z =. 3 42,1 Block G 4 Constraint C.4. The su of all transfers (row 86 of Z, coluns 1-42) ust be equal to zero. w = 1. Then To translate this into constraints on vector z, define the 88-vector [ 1,85 ] the 4224-vector G {[ u w ] [ ]} G 4 z = (scalar). = is the one required for representing constraint C.4: ,528 Block G 5 Constraint C.5. The su of all sectors value added (row 85 of Z, coluns 1-42) inus GDP (cell [85,43] of Z) ust be equal to zero. b = 1 ; then To translate this into constraints on vector z, define the 88-vector [ 1,84 ] the 4224-vector G [ u b b ] G 5 z = (scalar). = is the one required to represent constraint C.5: , 44 Block G 6 Constraint C.6. The su of all iports of goods (lying on row 88 of Z) inus Mg (cell [88,43] of Z) ust be equal to zero: given our product classification (see the Read e file in the ain page of the website), it turns out that goods are the products fro 1 to 28 (while services are the reaining 14 ones). To translate this into constraints on vector z, define the 2464-vector c = 1, 28 ( f ), where f was defined under block G 3. Then the 4224-vector G 6 = [ c 1,1232 f 1,44 ] is the one required to represent constraint C.6: G z (scalar). 6 = Block G 7 Constraint C.7. The su of all iports of services (lying on row 88 of Z) inus Mg (cell [88,44] of Z) ust be equal to zero: given our product classification (see the Read e file in the ain page of the website), it turns out that services are the 14 products fro 29 to 42. To translate this into constraints on vector z, define the 1232-vector h = 1, 14 ( f ). Then G = h f is the one required to represent constraint the 4224-vector [ ] C.7: G z (scalar). 7 = 7 1,2464 1,88 1,352 5
6 Block G 8 Constraint C.8. The su of all ites of household consuption (lying on colun 43 of Z) inus C (cell [86,43] of Z) ust be equal to zero. To translate this into constraints on vector z, define the 88-vector d = [ u 84 1 ]. G = d is the one required to represent constraint C.8: Then the 4224-vector [ ] G 8 z = (scalar). 8 1,3696 1,44 Block G 9 Constraint C.9. The su of all ites of Collective consuption of General Governent (lying on colun 44 of Z) inus Cg (cell [86,44] of Z) ust be equal to zero. To translate this into constraints on vector z, recall the definition of the 88-vector d fro block G 8. Then the 4224-vector G = [ d ] is the one required to represent constraint C.9: G z (scalar). 9 = 9 1,3784 1,352 Block G 1 Constraint C.1. The su of all ites of Collective consuption of social Institutions (lying on colun 45 of Z) inus Cs (cell [86,45] of Z) ust be equal to zero. To translate this into constraints on vector z, recall the definition of the 88-vector d fro block G 8. Then the 4224-vector G 1 = [ 1,3872 d 1,264 ] is the one required to represent constraint C.1: G z (scalar). 1 = Block G 11 Constraint C.11. The su of all ites of Fixed investent (lying on colun 46 of Z) inus Is (cell [86,46] of Z) ust be equal to zero. To translate this into constraints on vector z, recall the definition of the 88-vector d fro block G 8. Then the 4224-vector G 11 = [ 1,396 d 1,176 ] is the one required to represent constraint C.11: G z (scalar). 11 = Block G 12 Constraint C.12. The su of all ites of Changes in stocks (lying on colun 47 of Z) inus s (cell [86,47] of Z) ust be equal to zero. To translate this into constraints on vector z, recall the definition of the 88-vector d fro block G 8. Then the 4224-vector G = [ d ] is the one required to represent constraint C.12: G z (scalar). 12 = 12 1,448 1,88 6
7 Block G 13 Constraint C.13. The su of all Exports of goods (lying on colun 48 of Z, rows 1 to 28 [doestic products] and rows 43 to 7 [re-exports of iports]) inus Xg (cell [86,48] of Z) ust be equal to zero. G = u u 1 is the One can check that 4224-vector [ ] one required to represent constraint C.13: 13 1, , ,14 G 13 z = (scalar). Block G 14 Constraint C.14. The su of all Exports of services (lying on colun 48 of Z, rows 29 to 42 [doestic products] and rows 71 to 84 [re-exports of iports]) inus Xs (cell [87,48] of Z) ust be equal to zero. G = u u 1 is the One can check that 4224-vector [ ] one required to represent constraint C.14: 13 1,4136 1, ,28 14 G 14 z = (scalar). Putting all together, one obtains: as said in section 3 above. G1z 42,1 G 2z 42,1 G3z 42,1 G 4z G5z G 6z G 7z Gz = = = 137,1 = G8z G9z G1z G11z G12z G13z G14z 137 7
8 Appendix 2 A progra for building atrix G The progra is written in MATLAB language, but it should not be difficult to translate it into other languages. It is highly recoended that sparse atrices are used (if this is allowed by your package) in building and using atrix G in progras, e.g. when ipleenting the balancing algorith (2). This is in fact uch ore efficient than using the full version, given the large diensions involved. Hence, the use of the sparse instruction is everywhere present in the following script. Other details: sparse(x) defines atrix X as sparse speye(n) = sparse identity atrix of size n ones(n,) = (n,) atrix all eleents of which are one zeros(n,) = (n,) atrix all eleents of which are zero [a b] = horizontal concatenation of eleents a and b: a and b ight be scalars, vectors, or atrices: but the nuber of their rows ust be the sae [a;b] = vertical concatenation of eleents a and b: a and b ight be scalars, vectors, or atrices: but the nuber of their coluns ust be the sae kron(a,b) = Kronecker product = a b % construction of sparse 42-identity atrix I42=speye(42); % construction of various sparse vectors of ones (subsequently I will oit sparse ) u14=sparse(ones(1,14)); u28=sparse(ones(1,28)); u42=sparse(ones(1,42)); u48=sparse(ones(1,48)); u84=sparse(ones(1,84)); u86=sparse(ones(1,86)); % construction of various atrices and vectors of zeros O424=sparse(zeros(42,4)); O4242=sparse(zeros(42,42)); O4246=sparse(zeros(42,46)); O42528=sparse(zeros(42,528)); z1232=sparse(zeros(1,1232)); z14=sparse(zeros(1,14)); z176=sparse(zeros(1,176)); z2464=sparse(zeros(1,2464)); z264=sparse(zeros(1,264)); z28=sparse(zeros(1,28)); z352=sparse(zeros(1,352)); z3696=sparse(zeros(1,3696)); z3784=sparse(zeros(1,3784)); z3872=sparse(zeros(1,3872)); z396=sparse(zeros(1,396)); z448=sparse(zeros(1,448)); z4136=sparse(zeros(1,4136)); z44=sparse(zeros(1,44)); z528=sparse(zeros(1,528)); z85=sparse(zeros(1,85)); z86=sparse(zeros(1,86)); z87=sparse(zeros(1,87)); z84=sparse(zeros(1,84)); z88=sparse(zeros(1,88)); % construction of soe vectors of ixed ones, inus ones and zeros x=[z86-1 ]; y=[u86-1 ]; z=[z87-1]; w=[z85 1 ]; b=[z84 1 ]; c=[z87 1]; d=[u84-1 ]; 8
9 % construction of G1 H=[I42 O4246]; G11=kron(u48,H); G121=kron(I42,x); G12=[G121 O42528]; G1=G11+G12; clear G11 G121 G12 H; % construction of G2 G21=kron(I42,y); G2=[G21 O42528]; clear G21; % construction of G3 H=[O4242 I42 O424]; G31=kron(u48,H); G321=kron(I42,z); G32=[G321 O42528]; G3=G31+G32; clear H G31 G321 G32; % construction of G4 G41=kron(u42,w); G4=[G41 z528]; clear G41; % construction of G5 H=kron(u42,b); G5=[H -b z44]; clear H; % construction of G6 H=kron(u28,c); G6=[H z1232 -c z44]; clear H; % construction of G7 H=kron(u14,c); G7=[z2464 H z88 -c z352]; clear H; % construction of G8 G14 G8=[z3696 d z44]; G9=[z3784 d z352]; G1=[z3872 d z264]; G11=[z396 d z176]; G12=[z448 d z88]; G13=[z4136 u28 z14 u28 z14-1 ]; G14=[z4136 z28 u14 z28 u14-1 ]; % final construction of G G=[G1;G2;G3;G4;G5;G6;G7;G8;G9;G1;G11;G12;G13;G14]; % reove soe large atrices fro eory clear G1 G2 G3 G4 G5 G6 G7 G8 G9 G1 G11 G12 G13 G14 I42 O4246 O42528; After this, store atrix G in soe file, so that it can be recovered when needed (MATLAB would use save and load respectively). 9
COS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationAnalyzing Simulation Results
Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More information26 Impulse and Momentum
6 Ipulse and Moentu First, a Few More Words on Work and Energy, for Coparison Purposes Iagine a gigantic air hockey table with a whole bunch of pucks of various asses, none of which experiences any friction
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationOptimal Pigouvian Taxation when Externalities Affect Demand
Optial Pigouvian Taxation when Externalities Affect Deand Enda Patrick Hargaden Departent of Econoics University of Michigan enda@uich.edu Version of August 2, 2015 Abstract Purchasing a network good such
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationChapter 6: Economic Inequality
Chapter 6: Econoic Inequality We are interested in inequality ainly for two reasons: First, there are philosophical and ethical grounds for aversion to inequality per se. Second, even if we are not interested
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informationIs Walras s Theory So Different From Marshall s?
Is Walras s Theory So Different Fro Marshall s? Ezra Davar (Independent Researcher) Anon VeTaar 4/1, Netanya 40, Israel E-ail: ezra.davar@gail.co Received: July 17, 014 Accepted: August 5, 014 Published:
More informationModeling the Structural Shifts in Real Exchange Rate with Cubic Spline Regression (CSR). Turkey
International Journal of Business and Social Science Vol. 2 No. 17 www.ijbssnet.co Modeling the Structural Shifts in Real Exchange Rate with Cubic Spline Regression (CSR). Turkey 1987-2008 Dr. Bahar BERBEROĞLU
More informationExample A1: Preparation of a Calibration Standard
Suary Goal A calibration standard is prepared fro a high purity etal (cadiu) with a concentration of ca.1000 g l -1. Measureent procedure The surface of the high purity etal is cleaned to reove any etal-oxide
More informationU V. r In Uniform Field the Potential Difference is V Ed
SPHI/W nit 7.8 Electric Potential Page of 5 Notes Physics Tool box Electric Potential Energy the electric potential energy stored in a syste k of two charges and is E r k Coulobs Constant is N C 9 9. E
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationPh 20.3 Numerical Solution of Ordinary Differential Equations
Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing
More informationChaotic Coupled Map Lattices
Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each
More informationE0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis
E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds
More informationIntroduction to Robotics (CS223A) (Winter 2006/2007) Homework #5 solutions
Introduction to Robotics (CS3A) Handout (Winter 6/7) Hoework #5 solutions. (a) Derive a forula that transfors an inertia tensor given in soe frae {C} into a new frae {A}. The frae {A} can differ fro frae
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationSlanted coupling of one-dimensional arrays of small tunnel junctions
JOURNAL OF APPLIED PHYSICS VOLUME 84, NUMBER 1 15 DECEMBER 1998 Slanted coupling of one-diensional arrays of sall tunnel junctions G. Y. Hu Departent of Physics and Astronoy, Louisiana State University,
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationTHE KALMAN FILTER: A LOOK BEHIND THE SCENE
HE KALMA FILER: A LOOK BEHID HE SCEE R.E. Deain School of Matheatical and Geospatial Sciences, RMI University eail: rod.deain@rit.edu.au Presented at the Victorian Regional Survey Conference, Mildura,
More informationALGEBRA REVIEW. MULTINOMIAL An algebraic expression consisting of more than one term.
Page 1 of 6 ALGEBRAIC EXPRESSION A cobination of ordinary nubers, letter sybols, variables, grouping sybols and operation sybols. Nubers reain fixed in value and are referred to as constants. Letter sybols
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationIntroduction to Optimization Techniques. Nonlinear Programming
Introduction to Optiization echniques Nonlinear Prograing Optial Solutions Consider the optiization proble in f ( x) where F R n xf Definition : x F is optial (global iniu) for this proble, if f( x ) f(
More informationMonetary Policy E ectiveness in a Dynamic AS/AD Model with Sticky Wages
Monetary Policy E ectiveness in a Dynaic AS/AD Model with Sticky Wages Henrik Jensen Departent of Econoics University of Copenhagen y Version.0, April 2, 202 Teaching note for M.Sc. course on "Monetary
More informationMonetary Policy Effectiveness in a Dynamic AS/AD Model with Sticky Wages
Monetary Policy Effectiveness in a Dynaic AS/AD Model with Sticky Wages H J Departent of Econoics University of Copenhagen Version 1.0, April 12, 2012 Teaching note for M.Sc. course on "Monetary Econoics:
More informationKernel Methods and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic
More informationOptical Properties of Plasmas of High-Z Elements
Forschungszentru Karlsruhe Techni und Uwelt Wissenschaftlishe Berichte FZK Optical Properties of Plasas of High-Z Eleents V.Tolach 1, G.Miloshevsy 1, H.Würz Project Kernfusion 1 Heat and Mass Transfer
More informationA Generalized Permanent Estimator and its Application in Computing Multi- Homogeneous Bézout Number
Research Journal of Applied Sciences, Engineering and Technology 4(23): 5206-52, 202 ISSN: 2040-7467 Maxwell Scientific Organization, 202 Subitted: April 25, 202 Accepted: May 3, 202 Published: Deceber
More informationN-Point. DFTs of Two Length-N Real Sequences
Coputation of the DFT of In ost practical applications, sequences of interest are real In such cases, the syetry properties of the DFT given in Table 5. can be exploited to ake the DFT coputations ore
More information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
More informationA Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)
1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu
More informationVulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links
Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Tie-Varying Jaing Links Jun Kurihara KDDI R&D Laboratories, Inc 2 5 Ohara, Fujiino, Saitaa, 356 8502 Japan Eail: kurihara@kddilabsjp
More informationBootstrapping Dependent Data
Bootstrapping Dependent Data One of the key issues confronting bootstrap resapling approxiations is how to deal with dependent data. Consider a sequence fx t g n t= of dependent rando variables. Clearly
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationFinite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields
Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for
More informationReed-Muller Codes. m r inductive definition. Later, we shall explain how to construct Reed-Muller codes using the Kronecker product.
Coding Theory Massoud Malek Reed-Muller Codes An iportant class of linear block codes rich in algebraic and geoetric structure is the class of Reed-Muller codes, which includes the Extended Haing code.
More informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationINNER CONSTRAINTS FOR A 3-D SURVEY NETWORK
eospatial Science INNER CONSRAINS FOR A 3-D SURVEY NEWORK hese notes follow closely the developent of inner constraint equations by Dr Willie an, Departent of Building, School of Design and Environent,
More informationForce and dynamics with a spring, analytic approach
Force and dynaics with a spring, analytic approach It ay strie you as strange that the first force we will discuss will be that of a spring. It is not one of the four Universal forces and we don t use
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationOcean 420 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers
Ocean 40 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers 1. Hydrostatic Balance a) Set all of the levels on one of the coluns to the lowest possible density.
More informationConstrained Consensus and Optimization in Multi-Agent Networks arxiv: v2 [math.oc] 17 Dec 2008
LIDS Report 2779 1 Constrained Consensus and Optiization in Multi-Agent Networks arxiv:0802.3922v2 [ath.oc] 17 Dec 2008 Angelia Nedić, Asuan Ozdaglar, and Pablo A. Parrilo February 15, 2013 Abstract We
More informationKinetic Theory of Gases: Elementary Ideas
Kinetic Theory of Gases: Eleentary Ideas 17th February 2010 1 Kinetic Theory: A Discussion Based on a Siplified iew of the Motion of Gases 1.1 Pressure: Consul Engel and Reid Ch. 33.1) for a discussion
More informationEstimation of Korean Monthly GDP with Mixed-Frequency Data using an Unobserved Component Error Correction Model
100Econoic Papers Vol.11 No.1 Estiation of Korean Monthly GDP with Mixed-Frequency Data using an Unobserved Coponent Error Correction Model Ki-Ho Ki* Abstract Since GDP is announced on a quarterly basis,
More informationTopic 5a Introduction to Curve Fitting & Linear Regression
/7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline
More informationA method to determine relative stroke detection efficiencies from multiplicity distributions
A ethod to deterine relative stroke detection eiciencies ro ultiplicity distributions Schulz W. and Cuins K. 2. Austrian Lightning Detection and Inoration Syste (ALDIS), Kahlenberger Str.2A, 90 Vienna,
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationLecture #8-3 Oscillations, Simple Harmonic Motion
Lecture #8-3 Oscillations Siple Haronic Motion So far we have considered two basic types of otion: translation and rotation. But these are not the only two types of otion we can observe in every day life.
More informationLecture 9 November 23, 2015
CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)
More informationKinetic Theory of Gases: Elementary Ideas
Kinetic Theory of Gases: Eleentary Ideas 9th February 011 1 Kinetic Theory: A Discussion Based on a Siplified iew of the Motion of Gases 1.1 Pressure: Consul Engel and Reid Ch. 33.1) for a discussion of
More informationEFFECTIVE MODAL MASS & MODAL PARTICIPATION FACTORS Revision I
EFFECTIVE MODA MASS & MODA PARTICIPATION FACTORS Revision I B To Irvine Eail: to@vibrationdata.co Deceber, 5 Introduction The effective odal ass provides a ethod for judging the significance of a vibration
More information3.3 Variational Characterization of Singular Values
3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and
More informationSymbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm
Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat
More informationIterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel
1 Iterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel Rai Cohen, Graduate Student eber, IEEE, and Yuval Cassuto, Senior eber, IEEE arxiv:1510.05311v2 [cs.it] 24 ay 2016 Abstract In
More informationA PROBABILISTIC AND RIPLESS THEORY OF COMPRESSED SENSING. Emmanuel J. Candès Yaniv Plan. Technical Report No November 2010
A PROBABILISTIC AND RIPLESS THEORY OF COMPRESSED SENSING By Eanuel J Candès Yaniv Plan Technical Report No 200-0 Noveber 200 Departent of Statistics STANFORD UNIVERSITY Stanford, California 94305-4065
More informationarxiv: v1 [cs.ds] 17 Mar 2016
Tight Bounds for Single-Pass Streaing Coplexity of the Set Cover Proble Sepehr Assadi Sanjeev Khanna Yang Li Abstract arxiv:1603.05715v1 [cs.ds] 17 Mar 2016 We resolve the space coplexity of single-pass
More informationTesting the lag length of vector autoregressive models: A power comparison between portmanteau and Lagrange multiplier tests
Working Papers 2017-03 Testing the lag length of vector autoregressive odels: A power coparison between portanteau and Lagrange ultiplier tests Raja Ben Hajria National Engineering School, University of
More informationDistributed Subgradient Methods for Multi-agent Optimization
1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions
More informationComparing coordination models and architectures using embeddings
Science of Coputer Prograing 46 (2003) 31 69 www.elsevier.co/locate/scico Coparing coordination odels and architectures using ebeddings Marcello M. Bonsangue a, Joost N. Kok b, Gianluigi Zavattaro c; a
More informationUse of PSO in Parameter Estimation of Robot Dynamics; Part One: No Need for Parameterization
Use of PSO in Paraeter Estiation of Robot Dynaics; Part One: No Need for Paraeterization Hossein Jahandideh, Mehrzad Navar Abstract Offline procedures for estiating paraeters of robot dynaics are practically
More informationA Model for the Selection of Internet Service Providers
ISSN 0146-4116, Autoatic Control and Coputer Sciences, 2008, Vol. 42, No. 5, pp. 249 254. Allerton Press, Inc., 2008. Original Russian Text I.M. Aliev, 2008, published in Avtoatika i Vychislitel naya Tekhnika,
More informationINTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN
INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN V.A. Koarov 1, S.A. Piyavskiy 2 1 Saara National Research University, Saara, Russia 2 Saara State Architectural University, Saara, Russia Abstract. This article
More informationMoment of Inertia. Terminology. Definitions Moment of inertia of a body with mass, m, about the x axis: Transfer Theorem - 1. ( )dm. = y 2 + z 2.
Terinology Moent of Inertia ME 202 Moent of inertia (MOI) = second ass oent Instead of ultiplying ass by distance to the first power (which gives the first ass oent), we ultiply it by distance to the second
More informationMulti-Dimensional Hegselmann-Krause Dynamics
Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory
More informationProc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES
Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co
More informationUSEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS. By: Ian Blokland, Augustana Campus, University of Alberta
1 USEFUL HINTS FOR SOLVING PHYSICS OLYMPIAD PROBLEMS By: Ian Bloland, Augustana Capus, University of Alberta For: Physics Olypiad Weeend, April 6, 008, UofA Introduction: Physicists often attept to solve
More informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More informationBoosting with log-loss
Boosting with log-loss Marco Cusuano-Towner Septeber 2, 202 The proble Suppose we have data exaples {x i, y i ) i =... } for a two-class proble with y i {, }. Let F x) be the predictor function with the
More informationEnergy and Momentum: The Ballistic Pendulum
Physics Departent Handout -10 Energy and Moentu: The Ballistic Pendulu The ballistic pendulu, first described in the id-eighteenth century, applies principles of echanics to the proble of easuring the
More informationSpine Fin Efficiency A Three Sided Pyramidal Fin of Equilateral Triangular Cross-Sectional Area
Proceedings of the 006 WSEAS/IASME International Conference on Heat and Mass Transfer, Miai, Florida, USA, January 18-0, 006 (pp13-18) Spine Fin Efficiency A Three Sided Pyraidal Fin of Equilateral Triangular
More informationESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics
ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents
More informationLinear Algebra (I) Yijia Chen. linear transformations and their algebraic properties. 1. A Starting Point. y := 3x.
Linear Algebra I) Yijia Chen Linear algebra studies Exaple.. Consider the function This is a linear function f : R R. linear transforations and their algebraic properties.. A Starting Point y := 3x. Geoetrically
More informationData-Driven Imaging in Anisotropic Media
18 th World Conference on Non destructive Testing, 16- April 1, Durban, South Africa Data-Driven Iaging in Anisotropic Media Arno VOLKER 1 and Alan HUNTER 1 TNO Stieltjesweg 1, 6 AD, Delft, The Netherlands
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationKinematics and dynamics, a computational approach
Kineatics and dynaics, a coputational approach We begin the discussion of nuerical approaches to echanics with the definition for the velocity r r ( t t) r ( t) v( t) li li or r( t t) r( t) v( t) t for
More informationLecture 21. Interior Point Methods Setup and Algorithm
Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and
More informationGeneralized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.
Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,
More informationComputational and Statistical Learning Theory
Coputational and Statistical Learning Theory Proble sets 5 and 6 Due: Noveber th Please send your solutions to learning-subissions@ttic.edu Notations/Definitions Recall the definition of saple based Radeacher
More informationWhen Short Runs Beat Long Runs
When Short Runs Beat Long Runs Sean Luke George Mason University http://www.cs.gu.edu/ sean/ Abstract What will yield the best results: doing one run n generations long or doing runs n/ generations long
More informationEconomic Resource Balancing in Plant Design, Plant Expansion, or Improvement Projects
Econoic Resource Balancing in lant Design, lant Expansion, or Iproveent rojects Dan Trietsch MSIS Departent University of Auckland New Zealand --------------------------------------------------------------------------------------------------------
More information}, (n 0) be a finite irreducible, discrete time MC. Let S = {1, 2,, m} be its state space. Let P = [p ij. ] be the transition matrix of the MC.
Abstract Questions are posed regarding the influence that the colun sus of the transition probabilities of a stochastic atrix (with row sus all one) have on the stationary distribution, the ean first passage
More informationAbout the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry
About the definition of paraeters and regies of active two-port networks with variable loads on the basis of projective geoetry PENN ALEXANDR nstitute of Electronic Engineering and Nanotechnologies "D
More informationA1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3
A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)
More informationProjectile Motion with Air Resistance (Numerical Modeling, Euler s Method)
Projectile Motion with Air Resistance (Nuerical Modeling, Euler s Method) Theory Euler s ethod is a siple way to approxiate the solution of ordinary differential equations (ode s) nuerically. Specifically,
More informationarxiv:math/ v1 [math.co] 22 Jul 2005
Distances between the winning nubers in Lottery Konstantinos Drakakis arxiv:ath/0507469v1 [ath.co] 22 Jul 2005 16 March 2005 Abstract We prove an interesting fact about Lottery: the winning 6 nubers (out
More informationSoft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis
Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES
More informationMonochromatic images
CHAPTER 8 Monochroatic iages 1 The Central Sets Theore Lea 11 Let S,+) be a seigroup, e be an idepotent of βs and A e There is a set B A in e such that, for each v B, there is a set C A in e with v+c A
More informationNow multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get:
Equal Area Criterion.0 Developent of equal area criterion As in previous notes, all powers are in per-unit. I want to show you the equal area criterion a little differently than the book does it. Let s
More informationOptimal Jamming Over Additive Noise: Vector Source-Channel Case
Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper
More informationA Simple Model of Reliability, Warranties, and Price-Capping
International Journal of Business and Econoics, 2006, Vol. 5, No. 1, 1-16 A Siple Model of Reliability, Warranties, and Price-Capping Donald A. R. George Manageent School & Econoics, University of Edinburgh,
More informationUNCERTAINTIES IN THE APPLICATION OF ATMOSPHERIC AND ALTITUDE CORRECTIONS AS RECOMMENDED IN IEC STANDARDS
Paper Published on the16th International Syposiu on High Voltage Engineering, Cape Town, South Africa, 2009 UNCERTAINTIES IN THE APPLICATION OF ATMOSPHERIC AND ALTITUDE CORRECTIONS AS RECOMMENDED IN IEC
More informationInternational Scientific and Technological Conference EXTREME ROBOTICS October 8-9, 2015, Saint-Petersburg, Russia
International Scientific and Technological Conference EXTREME ROBOTICS October 8-9, 215, Saint-Petersburg, Russia LEARNING MOBILE ROBOT BASED ON ADAPTIVE CONTROLLED MARKOV CHAINS V.Ya. Vilisov University
More informationNational 5 Summary Notes
North Berwick High School Departent of Physics National 5 Suary Notes Unit 3 Energy National 5 Physics: Electricity and Energy 1 Throughout the Course, appropriate attention should be given to units, prefixes
More informationOnline Publication Date: 19 April 2012 Publisher: Asian Economic and Social Society
Online Publication Date: April Publisher: Asian Econoic and Social Society Using Entropy Working Correlation Matrix in Generalized Estiating Equation for Stock Price Change Model Serpilılıç (Faculty of
More information