Linear diophantine equations for discrete tomography
|
|
- Stella Warren
- 5 years ago
- Views:
Transcription
1 Journal of X-Ray Science and Technology IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa, Iowa City, IA 54, USA b Deartment of Radiology, The University of Iowa, Iowa City, IA 54, USA Abstract. In this reort, we resent a number-theory-based aroach for discrete tomograhy DT,which is based on arallel rojections of rational sloes. Using a well-controlled geometry of X-ray beams, we obtain a system of linear euations with integer coefficients. Assuming that the range of ixel values is ai, j =0, 1,...,M 1, with M being a rime number, we reduce the euations modulo M. To invert the linear system, each algorithmic ste only needs log M bit oerations. In the case of a small M, we have a greatly reduced comutational comlexity, relative to the conventional DT algorithms, which reuire log N bit oerations for a real number solution with a recision of 1/N. We also reort comuter simulation results to suort our analytic conclusions. Keywords: Comuted tomograhy CT, discrete tomograhy DT, number theory, Diohantine euations, comutational comlexity 1. Introduction Comuted tomograhy CT refers to comuterized synthesis of an image from external measurements of a satially varying function. Line integrals are the most common external measures, which are also known as rojections. This underlying function is traditionally real-valued. However, the range of the underlying function is ractically often discrete in industrial imaging and other alications. The roblems of discrete tomograhy DT are to determine the underlying function from weighted sums over subsets of its domain. In the most essential sense, DT allows that given a discrete range of the underlying function we find its values that could not be found without the knowledge on the discrete range. Recently, DT attracts increasing interests, and becomes challenging and exciting. Current studies e.g. [3,6] of DT are focused on algorithms derived from horizontal and vertical rojections, lus sometimes diagonal rojections. If the number of unknowns is more than the number of euations, these rojections cannot determine a uniue solution in the general case. Furthermore, existing algorithms do not directly make use of the discreteness of ixel values to reduce the comutational comlexity see [1,7]. In this aer, we formulate a system of linear euations with integer coefficients, and develo a number-theory-based algorithm for DT. In the next section, we describe a re-secified geometry for the formation of aroriate rojections. In the third section, we roose a number-theorybased algorithm that can be alied to rojection data collected according to the re-secified geometry. Then, we resent reresentative results obtained via comuter simulation. In the last section, relevant issues are discussed for futher research, and conclusions are made /0/$ IOS Press. All rights reserved
2 60 Y. Ye et al. / Linear diohantine euations for discrete tomograhy. Projection formation Suose an image ax, y is divided into a suare of grid n n. The total number of cells is n. Assume each cell has size of 1 1 and in each cell ax, y takes a constant value. For 1 i, j n, let us denote by ai, j the constant function value in the i, jth cell, which is the cell enclosed by the lines: x = i 1, x = i, y = j 1 and y = j. It is easy to have horizontal and vertical rojections. They are rays of width 1. The horizontal rojections give n euations: b 0/1 j = n ai, j, j =1,...,n, 1 i=1 where b 0/1 j is the density detected by the ith ray. Here the subscrit 0/1 denotes the sloe of the rays. Similarly from the vertical rojections we get b 1/0 i = n ai, j, i =1,...,n, j=1 where 1/0 reresents the vertical sloe. There are two diagonal directions, one with sloe 1/1 and the other with sloe 1/1. We take the width of the rays eual to 1/ and divide neighboring rays by lines y = x k for sloe= 1/1, and by y = x k for sloe= 1/1, for k Z. Note that each ray asses through 1/ area of a cell. Therefore the diagonal rojections with sloe 1/1 are b 1/1 k = n 1 aj, j k1 aj 1,j k, n <k n, 3 j=0 where we set ai, j =0if i, j is outside the range 1 i, j n. Similarly from the other diagonal direction we get euations b 1/1 k = n 1 aj, n j k 11 aj 1,n j k 1, n <k n. 4 j=0 The key idea of our new algorithm is to have rojections in other directions, and to do so in such a way that the resulting euations have integral coefficients. In this sense, our rojections are different from those in [1,8]. Let / be a ositive rational number in its reduced form. Then the greatest common divisor, =1. Assume that >>0. We want to construct arallel rays of sloe /, by dividing our suare grid into stries using arallel lines y =/x j, n <j n. Then each strie and hence each ray have width / which is less than 1 but greater than 1/, because >>0. Such a ray asses through several cells. By comuting the area of each cell i, j it asses through, we can determine the coefficient of ai, j in the euation for this ray. The following theorem summarizes our results. Here we denote by [x] the integral art of a real number x, that is, the largest integer x. Denote by {x the fractional art of x, that is, {x = x [x].
3 {/=0 Y. Ye et al. / Linear diohantine euations for discrete tomograhy 61 Theorem 1. Let and be ositive integers with, =1and >. The euations from rojections of sloe / are b / j= aj /,l 1 aj / 1,l 0<{/</ 1 for n <j n. { { { aj [/],l {/ / { 1 { aj [/],l { aj [/]1,l { aj [/]1,l aj [/],l, We will rove this Theorem in the next section. Here we oint out that the coefficients are all rational numbers, and indeed, if multilied by, they become integers. This means that all our Es 1 through 5, together with Es 6 to 8 below, can be rewritten as linear euations of integral coefficients. If we seek integer solutions ai, j, we are dealing with a system of linear Diohantine euations. If the cells are suosed to take values ai, j =0, 1,..., M 1, we can further reduce these linear Diohantine euations modulo M. By simle reflections or change of coordinates, we can get euations for rojections of sloes /, /, and /. Corallary 1. Let and be ositive integers with, =1and >. The euations from rojections of sloe / are b / j= al, j / 1 al, j / 1 {/=0 0<{/</ 1 { { { al, j [/] { al, j [/]1 5
4 6 Y. Ye et al. / Linear diohantine euations for discrete tomograhy for n <j n. { al, j [/] {/ / { 1 { al, j [/]1 al, j [/], 6 Corallary. Let and be ositive integers with, =1and >. The euations from rojections of sloe / are b / j= an 1 j /,l 1 an j /,l for n <j n. {/=0 0<{/</ 1 { {/ / { { { an 1 j [/],l { { an j [/],l an j [/] 1,l 1 { an j [/],l an j [/] 1,l, Corallary 3. Let and be ositive integers with, =1and >. The euations from rojections of sloe / are b / j= al, n 1 j / 1 al, n j / {/=0 0<{/</ { { al, n 1 j [/] 7
5 for n <j n. Y. Ye et al. / Linear diohantine euations for discrete tomograhy 63 1 { { al, n j [/] 8 { al, n j [/] 1 1 { al, n j [/] {/ / { al, n j [/] 1, 3. Algorithm and simulation We select arallel rays whose sloes are rational numbers of the form ±/, and control the width and location of each ray in a secific way. The resulting linear euations then have all coefficients being integers. Because of these integral coefficients, we may reduce this system of linear Diohantine euations modulo M, if the cells are suosed to take values ai, j =0, 1,..., M 1. In other words, we seek solutions in the field Z/M Z, when M is a rime number. This linear system can be solved over Z/M Z in the same way as over R, using the standard Gaussian elimination method, for examle. The main advantage of our aroach is that, over Z/M Z, each oeration uses only log M bit oerations cf. Cohen []. On the other hand, for solution rocedures of a linear system over R, each oeration needs log N bit oerations for a real number solution of recision 1/N. For small M, the time log M reresents a big saving of comutation time over the usual log N time. As an examle, let us look at the case of M =, i.e., the case when every cell can only take value 0 or 1. Now Z/Z is the finite field of two elements 0 and 1. Oerations in Z/Z are fast: 0 0=0, 0 1=0, 1 1=1, 00=0, 01=1, 11=0, etc. Each oeration only need log =1bit oeration. On the other hand, the solution rocedure for the same linear system is much slower if we seek a real number solution to the recision of, let us say, 0.01 = 1/100. With N = 100, one oeration here need log bit oerations. In other words, our new algorithm uses only 1/44 of the comutation time of a standard CT algorithm. This huge saving of comutation time was observed in a comutation of a DT rocedure using Matlab. For our new modulo algorithm, the CPU time is significantly faster than using a standard algorithm seeking real number solutions. The linear euations are given in Section from Es 1 to 8. In these euations, Es 1 and are derived from horizontal and vertical rojections and are of integral coefficients. Euations 3 and 4 are from diagonal rojections; we need to multily them by a factor to get the euations of integral coefficients we want. Note that if the cells are suosed to take integral values ai, j =0, 1,...,M 1, b 1/1 k and b 1/1 k will be integers or half integers. Conseuently after multilying them by, Es 3 and 4 become linear euation of integral coefficients. Similarly, we can multily Es 5 to 8 by and change them to linear euations of integral coefficients.
6 64 Y. Ye et al. / Linear diohantine euations for discrete tomograhy In order to get enough euations from Es 5 through 8, we may fix a ositive integer L and select all and with 1 < L and, =1. These fractions /, together with 0 and 1, form a Ferry seuence of level L. There are about 3/π L such airs of and, which roduce about 1/π L directions: ±/ and ±/. In each of these directions we can get more than n but less than n rays. Since we need n linearly indeendent euations, we may set 1/π L n = n. This means that L may be set to eual to π/ 1 n. For examle, if n = 56, we may set L = Discussions and conclusion Much efforts are needed to otimize imaging rotocols and reconstruction algorithms. Clearly, image uality would deend on domain knowledge, imaging geometry, data comleteness, noise level, and algorithmic details. Extensive simulation and hysical exeriments must be erformed in selected cases to gain some insight into interlays among all the major factors. It is ackowledged that the most oular imaging geometry is fan-beam-oriented, instead of arallelbeam-oriented. However, our findings are still of significance, because we can always rebin fan-beam rojection data to arallel-beam rojection data in the format we refer. This rebinning rocess is always much faster than the reconstruction rocess. Furthermore, the rebinning is even a necessary intermediate ste in siral/helical CT, in which an X-ray source rotation and an object translation are erformed simultaneously. We believe that fan-beam DT should be a most ractical roblem to solve in near future. Although we have not addressed data inconsistence in this roof-of-concet reort, we oint out that noise in data can be suressed in the same sirit of the conventional linear system solution algorithms. On the other hand, given a secific knowledge on the discrete range of the underlying function, more efficient algorithms may be designed for various DT alications. We are articularly interested in ursuing research along a number-theory direction. Relevant results will reorted in future ublications. In conclusion, we have roosed a number-theory-based aroach for discrete tomograhy DT, and demonstrated that our method can greatly reduce the comutational comlexity. Further work is underway to generalize the findings, refine the algorithm and aly it to various alications. Aendix. Proof of Theorem 1. Suose the sloe of a ray is /, where, =1, >>0, and the ray is bounded by y =/x and y =/x 1. Then this ray asses through cells in three different cases. The first case is that there exists an integer m Z such that l 1/ < m < /. This condition is euivalent to 0 < {/ </. In this case, the ray runs through three cells on level l with unknowns a[/],l, a[/]1,l, and a[/],l. The areas assed by the ray for the three cells are w [/],l = 1 [ ] [ ] l 1 l 1 = { w [/]1,l =1 {, { 1 [ ] l l l [ ] l
7 =1 Y. Ye et al. / Linear diohantine euations for discrete tomograhy 65 { {, w [/],l = 1 1 = {. [ ] l 1 l [ ] Thus the rojection over these three cells roduces three terms for the linear euation { 1 { { a[/],l { a[/]1,l { a[/],l. A1 The second case is that / Z, i.e., {/ =0. In this case the ray asses through two cells on level l. The coefficients of the unknowns a/,l and a/ 1,l are w /,l = / and w /1,l =1 /, resectively. This case therefore contributes two terms to the linear euation a/,l 1 a/ 1,l. The third case is when {/ /. In this case, the ray runs through two cells on level l and the corresonding coefficients are: w l,[/]1 = 1 [ ] 1 = { 1 [ ] 1 l 1 A w l,[/] =1 1 { = {. Hence the rojection over these two cells has the following two terms 1 { a[/]1,l { a[/],l. A3 Collecting Es A1, A, and A3, we rove Theorem 1.
8 66 Y. Ye et al. / Linear diohantine euations for discrete tomograhy References [1] M.T. Chan, G.T. Herman and E. Levitan, Bayesian image reconstruction using image-modeling Gibbs riors, Int. J. Imaging Syst. Tech , [] H. Cohen, A course in comutational algebraic number theory, Sringer, Berlin, [3] A. Fazekas, G.T. Herman and S. Matej, On rocessing binary ictures via their rojections, Int. J. Imaging Syst. Tech , [4] G. Gritzmann, D. Prangenberg, S.S. de Vries and M. Wiegelmann, Success and failure of certain reconstruction and uniueness algorithms in discrete tomograhy, Int. J. Imaging Syst. Tech , [5] J.H.B. Kamerman and A. Kuba, Reconstruction of two-valued matrices from their two rojections, Int. J. Imaging Syst. Tech , [6] A. Del Lungo and M. Nivat, Reconstruction of connected sets from two rojections, in: Discrete Tomograhy Foundations, Algorithms, and Alications, G.T. Herman and A. Kuba, eds, Birkhäuser, Boston, 1999, [7] Y. Vardi and C.-H. Zhang, Reconstruction of binary images vie the EM algorithm, in: Discrete Tomograhy Foundations, Algorithms, and Alications, G.T. Herman and A. Kuba, Birkhäuser, Boston, 1999, [8] A.E. Yagle, An exlicit closed-form solution to the limited-angle discrete tomograhy roblem for finite-suort objects, Int. J. Imaging Syst. Tech ,
An Inverse Problem for Two Spectra of Complex Finite Jacobi Matrices
Coyright 202 Tech Science Press CMES, vol.86, no.4,.30-39, 202 An Inverse Problem for Two Sectra of Comlex Finite Jacobi Matrices Gusein Sh. Guseinov Abstract: This aer deals with the inverse sectral roblem
More informationPrinciples of Computed Tomography (CT)
Page 298 Princiles of Comuted Tomograhy (CT) The theoretical foundation of CT dates back to Johann Radon, a mathematician from Vienna who derived a method in 1907 for rojecting a 2-D object along arallel
More informationExcerpt from "Intermediate Algebra" 2014 AoPS Inc.
Ecert from "Intermediate Algebra" 04 AoPS Inc. www.artofroblemsolving.com for which our grah is below the -ais with the oints where the grah intersects the -ais (because the ineuality is nonstrict), we
More informationPositive decomposition of transfer functions with multiple poles
Positive decomosition of transfer functions with multile oles Béla Nagy 1, Máté Matolcsi 2, and Márta Szilvási 1 Deartment of Analysis, Technical University of Budaest (BME), H-1111, Budaest, Egry J. u.
More informationUnsupervised Hyperspectral Image Analysis Using Independent Component Analysis (ICA)
Unsuervised Hyersectral Image Analysis Using Indeendent Comonent Analysis (ICA) Shao-Shan Chiang Chein-I Chang Irving W. Ginsberg Remote Sensing Signal and Image Processing Laboratory Deartment of Comuter
More informationCombining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)
Combining Logistic Regression with Kriging for Maing the Risk of Occurrence of Unexloded Ordnance (UXO) H. Saito (), P. Goovaerts (), S. A. McKenna (2) Environmental and Water Resources Engineering, Deartment
More informationFAST AND EFFICIENT SIDE INFORMATION GENERATION IN DISTRIBUTED VIDEO CODING BY USING DENSE MOTION REPRESENTATIONS
18th Euroean Signal Processing Conference (EUSIPCO-2010) Aalborg, Denmark, August 23-27, 2010 FAST AND EFFICIENT SIDE INFORMATION GENERATION IN DISTRIBUTED VIDEO CODING BY USING DENSE MOTION REPRESENTATIONS
More informationEstimation of the large covariance matrix with two-step monotone missing data
Estimation of the large covariance matrix with two-ste monotone missing data Masashi Hyodo, Nobumichi Shutoh 2, Takashi Seo, and Tatjana Pavlenko 3 Deartment of Mathematical Information Science, Tokyo
More informationMultiplicative group law on the folium of Descartes
Multilicative grou law on the folium of Descartes Steluţa Pricoie and Constantin Udrişte Abstract. The folium of Descartes is still studied and understood today. Not only did it rovide for the roof of
More informationOn generalizing happy numbers to fractional base number systems
On generalizing hay numbers to fractional base number systems Enriue Treviño, Mikita Zhylinski October 17, 018 Abstract Let n be a ositive integer and S (n) be the sum of the suares of its digits. It is
More informationGOOD MODELS FOR CUBIC SURFACES. 1. Introduction
GOOD MODELS FOR CUBIC SURFACES ANDREAS-STEPHAN ELSENHANS Abstract. This article describes an algorithm for finding a model of a hyersurface with small coefficients. It is shown that the aroach works in
More informationLINEAR SYSTEMS WITH POLYNOMIAL UNCERTAINTY STRUCTURE: STABILITY MARGINS AND CONTROL
LINEAR SYSTEMS WITH POLYNOMIAL UNCERTAINTY STRUCTURE: STABILITY MARGINS AND CONTROL Mohammad Bozorg Deatment of Mechanical Engineering University of Yazd P. O. Box 89195-741 Yazd Iran Fax: +98-351-750110
More informationThe Value of Even Distribution for Temporal Resource Partitions
The Value of Even Distribution for Temoral Resource Partitions Yu Li, Albert M. K. Cheng Deartment of Comuter Science University of Houston Houston, TX, 7704, USA htt://www.cs.uh.edu Technical Reort Number
More informationThe Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001
The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse-Minkowski Theorem rovides a characterization of the rational quadratic forms. What follows is a roof of the Hasse-Minkowski
More informationApplicable Analysis and Discrete Mathematics available online at HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS
Alicable Analysis and Discrete Mathematics available online at htt://efmath.etf.rs Al. Anal. Discrete Math. 4 (010), 3 44. doi:10.98/aadm1000009m HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS Zerzaihi
More informationResearch Article An Iterative Algorithm for the Reflexive Solution of the General Coupled Matrix Equations
he Scientific World Journal Volume 013 Article ID 95974 15 ages htt://dxdoiorg/101155/013/95974 Research Article An Iterative Algorithm for the Reflexive Solution of the General Couled Matrix Euations
More informationFinding Shortest Hamiltonian Path is in P. Abstract
Finding Shortest Hamiltonian Path is in P Dhananay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune, India bstract The roblem of finding shortest Hamiltonian ath in a eighted comlete grah belongs
More informationUncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning
TNN-2009-P-1186.R2 1 Uncorrelated Multilinear Princial Comonent Analysis for Unsuervised Multilinear Subsace Learning Haiing Lu, K. N. Plataniotis and A. N. Venetsanooulos The Edward S. Rogers Sr. Deartment
More information4. Score normalization technical details We now discuss the technical details of the score normalization method.
SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules
More informationAN IMPROVED BABY-STEP-GIANT-STEP METHOD FOR CERTAIN ELLIPTIC CURVES. 1. Introduction
J. Al. Math. & Comuting Vol. 20(2006), No. 1-2,. 485-489 AN IMPROVED BABY-STEP-GIANT-STEP METHOD FOR CERTAIN ELLIPTIC CURVES BYEONG-KWEON OH, KIL-CHAN HA AND JANGHEON OH Abstract. In this aer, we slightly
More informationFor q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i
Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 9519-0103, USA khuri@juiter.sjsu.edu Fax: (40)94-500 Keywords:
More informationON POLYNOMIAL SELECTION FOR THE GENERAL NUMBER FIELD SIEVE
MATHEMATICS OF COMPUTATIO Volume 75, umber 256, October 26, Pages 237 247 S 25-5718(6)187-9 Article electronically ublished on June 28, 26 O POLYOMIAL SELECTIO FOR THE GEERAL UMBER FIELD SIEVE THORSTE
More informationThe Fekete Szegő theorem with splitting conditions: Part I
ACTA ARITHMETICA XCIII.2 (2000) The Fekete Szegő theorem with slitting conditions: Part I by Robert Rumely (Athens, GA) A classical theorem of Fekete and Szegő [4] says that if E is a comact set in the
More informationEvaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models
Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Ketan N. Patel, Igor L. Markov and John P. Hayes University of Michigan, Ann Arbor 48109-2122 {knatel,imarkov,jhayes}@eecs.umich.edu
More informationThe Binomial Approach for Probability of Detection
Vol. No. (Mar 5) - The e-journal of Nondestructive Testing - ISSN 45-494 www.ndt.net/?id=7498 The Binomial Aroach for of Detection Carlos Correia Gruo Endalloy C.A. - Caracas - Venezuela www.endalloy.net
More informationComputer arithmetic. Intensive Computation. Annalisa Massini 2017/2018
Comuter arithmetic Intensive Comutation Annalisa Massini 7/8 Intensive Comutation - 7/8 References Comuter Architecture - A Quantitative Aroach Hennessy Patterson Aendix J Intensive Comutation - 7/8 3
More informationSolvability and Number of Roots of Bi-Quadratic Equations over p adic Fields
Malaysian Journal of Mathematical Sciences 10(S February: 15-35 (016 Secial Issue: The 3 rd International Conference on Mathematical Alications in Engineering 014 (ICMAE 14 MALAYSIAN JOURNAL OF MATHEMATICAL
More informationMODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL
Technical Sciences and Alied Mathematics MODELING THE RELIABILITY OF CISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Cezar VASILESCU Regional Deartment of Defense Resources Management
More informationNetwork Configuration Control Via Connectivity Graph Processes
Network Configuration Control Via Connectivity Grah Processes Abubakr Muhammad Deartment of Electrical and Systems Engineering University of Pennsylvania Philadelhia, PA 90 abubakr@seas.uenn.edu Magnus
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationSystem Reliability Estimation and Confidence Regions from Subsystem and Full System Tests
009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 0-, 009 FrB4. System Reliability Estimation and Confidence Regions from Subsystem and Full System Tests James C. Sall Abstract
More informationMulti-Operation Multi-Machine Scheduling
Multi-Oeration Multi-Machine Scheduling Weizhen Mao he College of William and Mary, Williamsburg VA 3185, USA Abstract. In the multi-oeration scheduling that arises in industrial engineering, each job
More informationRECIPROCITY LAWS JEREMY BOOHER
RECIPROCITY LAWS JEREMY BOOHER 1 Introduction The law of uadratic recirocity gives a beautiful descrition of which rimes are suares modulo Secial cases of this law going back to Fermat, and Euler and Legendre
More informationNumerical Linear Algebra
Numerical Linear Algebra Numerous alications in statistics, articularly in the fitting of linear models. Notation and conventions: Elements of a matrix A are denoted by a ij, where i indexes the rows and
More informationISOSCELES TRIANGLES IN Q 3. Matt Noble Department of Mathematics, Middle Georgia State University, Macon, Georgia
#A9 INTEGERS 18 (2018) ISOSCELES TRIANGLES IN Q Matt Noble Deartment of Mathematics, Middle Georgia State University, Macon, Georgia matthew.noble@mga.edu Received: 7/2/17, Acceted: 2//18, Published: 2/19/18
More information#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS
#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS Ramy F. Taki ElDin Physics and Engineering Mathematics Deartment, Faculty of Engineering, Ain Shams University, Cairo, Egyt
More informationRadial Basis Function Networks: Algorithms
Radial Basis Function Networks: Algorithms Introduction to Neural Networks : Lecture 13 John A. Bullinaria, 2004 1. The RBF Maing 2. The RBF Network Architecture 3. Comutational Power of RBF Networks 4.
More informationEquivalence of Wilson actions
Prog. Theor. Ex. Phys. 05, 03B0 7 ages DOI: 0.093/te/tv30 Equivalence of Wilson actions Physics Deartment, Kobe University, Kobe 657-850, Jaan E-mail: hsonoda@kobe-u.ac.j Received June 6, 05; Revised August
More informationarxiv: v1 [physics.data-an] 26 Oct 2012
Constraints on Yield Parameters in Extended Maximum Likelihood Fits Till Moritz Karbach a, Maximilian Schlu b a TU Dortmund, Germany, moritz.karbach@cern.ch b TU Dortmund, Germany, maximilian.schlu@cern.ch
More informationPOINTS ON CONICS MODULO p
POINTS ON CONICS MODULO TEAM 2: JONGMIN BAEK, ANAND DEOPURKAR, AND KATHERINE REDFIELD Abstract. We comute the number of integer oints on conics modulo, where is an odd rime. We extend our results to conics
More informationintegral invariant relations is not limited to one or two such
The Astronomical Journal, 126:3138 3142, 2003 December # 2003. The American Astronomical Society. All rights reserved. Printed in U.S.A. EFFICIENT ORBIT INTEGRATION BY SCALING AND ROTATION FOR CONSISTENCY
More informationChapter 1 Fundamentals
Chater Fundamentals. Overview of Thermodynamics Industrial Revolution brought in large scale automation of many tedious tasks which were earlier being erformed through manual or animal labour. Inventors
More informationSUPER-GEOMETRIC CONVERGENCE OF A SPECTRAL ELEMENT METHOD FOR EIGENVALUE PROBLEMS WITH JUMP COEFFICIENTS *
Journal of Comutational Mathematics Vol.8, No.,, 48 48. htt://www.global-sci.org/jcm doi:.48/jcm.9.-m6 SUPER-GEOMETRIC CONVERGENCE OF A SPECTRAL ELEMENT METHOD FOR EIGENVALUE PROBLEMS WITH JUMP COEFFICIENTS
More informationMODULAR LINEAR TRANSVERSE FLUX RELUCTANCE MOTORS
MODULAR LINEAR TRANSVERSE FLUX RELUCTANCE MOTORS Dan-Cristian POPA, Vasile IANCU, Loránd SZABÓ, Deartment of Electrical Machines, Technical University of Cluj-Naoca RO-400020 Cluj-Naoca, Romania; e-mail:
More informationCryptanalysis of Pseudorandom Generators
CSE 206A: Lattice Algorithms and Alications Fall 2017 Crytanalysis of Pseudorandom Generators Instructor: Daniele Micciancio UCSD CSE As a motivating alication for the study of lattice in crytograhy we
More informationDUAL NUMBERS, WEIGHTED QUIVERS, AND EXTENDED SOMOS AND GALE-ROBINSON SEQUENCES. To Alexandre Alexandrovich Kirillov on his 3 4 th anniversary
DUAL NUMBERS, WEIGHTED QUIVERS, AND EXTENDED SOMOS AND GALE-ROBINSON SEQUENCES VALENTIN OVSIENKO AND SERGE TABACHNIKOV Abstract. We investigate a general method that allows one to construct new integer
More informationPlanar Vector Equations in Engineering*
Int. J. Engng Ed. Vol., No.,. 40±406, 006 0949-149X/91 $3.00+0.00 Printed in Great Britain. # 006 TEMPUS Pulications. Planar Vector Equations in Engineering* H. R. MOHAMMADI DANIALI Deartment of Mechanical
More informationARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER
#A43 INTEGERS 17 (2017) ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER Lenny Jones Deartment of Mathematics, Shiensburg University, Shiensburg, Pennsylvania lkjone@shi.edu
More informationYixi Shi. Jose Blanchet. IEOR Department Columbia University New York, NY 10027, USA. IEOR Department Columbia University New York, NY 10027, USA
Proceedings of the 2011 Winter Simulation Conference S. Jain, R. R. Creasey, J. Himmelsach, K. P. White, and M. Fu, eds. EFFICIENT RARE EVENT SIMULATION FOR HEAVY-TAILED SYSTEMS VIA CROSS ENTROPY Jose
More informationSolved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points.
Solved Problems Solved Problems P Solve the three simle classification roblems shown in Figure P by drawing a decision boundary Find weight and bias values that result in single-neuron ercetrons with the
More informationQUADRATIC RECIPROCITY
QUADRATIC RECIPROCIT POOJA PATEL Abstract. This aer is an self-contained exosition of the law of uadratic recirocity. We will give two roofs of the Chinese remainder theorem and a roof of uadratic recirocity.
More informationPaper C Exact Volume Balance Versus Exact Mass Balance in Compositional Reservoir Simulation
Paer C Exact Volume Balance Versus Exact Mass Balance in Comositional Reservoir Simulation Submitted to Comutational Geosciences, December 2005. Exact Volume Balance Versus Exact Mass Balance in Comositional
More informationAn Analysis of Reliable Classifiers through ROC Isometrics
An Analysis of Reliable Classifiers through ROC Isometrics Stijn Vanderlooy s.vanderlooy@cs.unimaas.nl Ida G. Srinkhuizen-Kuyer kuyer@cs.unimaas.nl Evgueni N. Smirnov smirnov@cs.unimaas.nl MICC-IKAT, Universiteit
More informationON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS
#A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,
More informationProbability Estimates for Multi-class Classification by Pairwise Coupling
Probability Estimates for Multi-class Classification by Pairwise Couling Ting-Fan Wu Chih-Jen Lin Deartment of Comuter Science National Taiwan University Taiei 06, Taiwan Ruby C. Weng Deartment of Statistics
More informationSupplementary Materials for Robust Estimation of the False Discovery Rate
Sulementary Materials for Robust Estimation of the False Discovery Rate Stan Pounds and Cheng Cheng This sulemental contains roofs regarding theoretical roerties of the roosed method (Section S1), rovides
More informationOn the Chvatál-Complexity of Knapsack Problems
R u t c o r Research R e o r t On the Chvatál-Comlexity of Knasack Problems Gergely Kovács a Béla Vizvári b RRR 5-08, October 008 RUTCOR Rutgers Center for Oerations Research Rutgers University 640 Bartholomew
More informationSome Unitary Space Time Codes From Sphere Packing Theory With Optimal Diversity Product of Code Size
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 5, NO., DECEMBER 4 336 Some Unitary Sace Time Codes From Shere Packing Theory With Otimal Diversity Product of Code Size Haiquan Wang, Genyuan Wang, and Xiang-Gen
More informationVIBRATION ANALYSIS OF BEAMS WITH MULTIPLE CONSTRAINED LAYER DAMPING PATCHES
Journal of Sound and Vibration (998) 22(5), 78 85 VIBRATION ANALYSIS OF BEAMS WITH MULTIPLE CONSTRAINED LAYER DAMPING PATCHES Acoustics and Dynamics Laboratory, Deartment of Mechanical Engineering, The
More informationLilian Markenzon 1, Nair Maria Maia de Abreu 2* and Luciana Lee 3
Pesquisa Oeracional (2013) 33(1): 123-132 2013 Brazilian Oerations Research Society Printed version ISSN 0101-7438 / Online version ISSN 1678-5142 www.scielo.br/oe SOME RESULTS ABOUT THE CONNECTIVITY OF
More informationApproximation of the Euclidean Distance by Chamfer Distances
Acta Cybernetica 0 (0 399 47. Aroximation of the Euclidean Distance by Chamfer Distances András Hajdu, Lajos Hajdu, and Robert Tijdeman Abstract Chamfer distances lay an imortant role in the theory of
More informationMath 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,
MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write
More informationAn Investigation on the Numerical Ill-conditioning of Hybrid State Estimators
An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators S. K. Mallik, Student Member, IEEE, S. Chakrabarti, Senior Member, IEEE, S. N. Singh, Senior Member, IEEE Deartment of Electrical
More informationMaxisets for μ-thresholding rules
Test 008 7: 33 349 DOI 0.007/s749-006-0035-5 ORIGINAL PAPER Maxisets for μ-thresholding rules Florent Autin Received: 3 January 005 / Acceted: 8 June 006 / Published online: March 007 Sociedad de Estadística
More informationResearch Article Controllability of Linear Discrete-Time Systems with Both Delayed States and Delayed Inputs
Abstract and Alied Analysis Volume 203 Article ID 97546 5 ages htt://dxdoiorg/055/203/97546 Research Article Controllability of Linear Discrete-Time Systems with Both Delayed States and Delayed Inuts Hong
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationRecent Developments in Multilayer Perceptron Neural Networks
Recent Develoments in Multilayer Percetron eural etworks Walter H. Delashmit Lockheed Martin Missiles and Fire Control Dallas, Texas 75265 walter.delashmit@lmco.com walter.delashmit@verizon.net Michael
More informationAdditive results for the generalized Drazin inverse in a Banach algebra
Additive results for the generalized Drazin inverse in a Banach algebra Dragana S. Cvetković-Ilić Dragan S. Djordjević and Yimin Wei* Abstract In this aer we investigate additive roerties of the generalized
More informationChurilova Maria Saint-Petersburg State Polytechnical University Department of Applied Mathematics
Churilova Maria Saint-Petersburg State Polytechnical University Deartment of Alied Mathematics Technology of EHIS (staming) alied to roduction of automotive arts The roblem described in this reort originated
More informationState Estimation with ARMarkov Models
Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,
More information216 S. Chandrasearan and I.C.F. Isen Our results dier from those of Sun [14] in two asects: we assume that comuted eigenvalues or singular values are
Numer. Math. 68: 215{223 (1994) Numerische Mathemati c Sringer-Verlag 1994 Electronic Edition Bacward errors for eigenvalue and singular value decomositions? S. Chandrasearan??, I.C.F. Isen??? Deartment
More informationLattice Attacks on the DGHV Homomorphic Encryption Scheme
Lattice Attacks on the DGHV Homomorhic Encrytion Scheme Abderrahmane Nitaj 1 and Tajjeeddine Rachidi 2 1 Laboratoire de Mathématiques Nicolas Oresme Université de Caen Basse Normandie, France abderrahmanenitaj@unicaenfr
More informationDimensional perturbation theory for Regge poles
Dimensional erturbation theory for Regge oles Timothy C. Germann Deartment of Chemistry, University of California, Berkeley, California 94720 Sabre Kais Deartment of Chemistry, Purdue University, West
More informationHENSEL S LEMMA KEITH CONRAD
HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar
More informationCorrespondence Between Fractal-Wavelet. Transforms and Iterated Function Systems. With Grey Level Maps. F. Mendivil and E.R.
1 Corresondence Between Fractal-Wavelet Transforms and Iterated Function Systems With Grey Level Mas F. Mendivil and E.R. Vrscay Deartment of Alied Mathematics Faculty of Mathematics University of Waterloo
More informationImplementation of a Column Generation Heuristic for Vehicle Scheduling in a Medium-Sized Bus Company
7e Conférence Internationale de MOdélisation et SIMulation - MOSIM 08 - du 31 mars au 2 avril 2008 Paris- France «Modélisation, Otimisation MOSIM 08 et Simulation du 31 mars des Systèmes au 2 avril : 2008
More informationUniformly best wavenumber approximations by spatial central difference operators: An initial investigation
Uniformly best wavenumber aroximations by satial central difference oerators: An initial investigation Vitor Linders and Jan Nordström Abstract A characterisation theorem for best uniform wavenumber aroximations
More informationDesign of NARMA L-2 Control of Nonlinear Inverted Pendulum
International Research Journal of Alied and Basic Sciences 016 Available online at www.irjabs.com ISSN 51-838X / Vol, 10 (6): 679-684 Science Exlorer Publications Design of NARMA L- Control of Nonlinear
More informationIDENTIFYING CONGRUENCE SUBGROUPS OF THE MODULAR GROUP
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 24, Number 5, May 996 IDENTIFYING CONGRUENCE SUBGROUPS OF THE MODULAR GROUP TIM HSU (Communicated by Ronald M. Solomon) Abstract. We exhibit a simle
More informationDialectical Theory for Multi-Agent Assumption-based Planning
Dialectical Theory for Multi-Agent Assumtion-based Planning Damien Pellier, Humbert Fiorino Laboratoire Leibniz, 46 avenue Félix Viallet F-38000 Grenboble, France {Damien.Pellier,Humbert.Fiorino}.imag.fr
More informationChater Matrix Norms and Singular Value Decomosition Introduction In this lecture, we introduce the notion of a norm for matrices The singular value de
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A Dahleh George Verghese Deartment of Electrical Engineering and Comuter Science Massachuasetts Institute of Technology c Chater Matrix Norms
More informationProximal methods for the latent group lasso penalty
Proximal methods for the latent grou lasso enalty The MIT Faculty has made this article oenly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Villa,
More informationFault Tolerant Quantum Computing Robert Rogers, Thomas Sylwester, Abe Pauls
CIS 410/510, Introduction to Quantum Information Theory Due: June 8th, 2016 Sring 2016, University of Oregon Date: June 7, 2016 Fault Tolerant Quantum Comuting Robert Rogers, Thomas Sylwester, Abe Pauls
More informationA Closed-Form Solution to the Minimum V 2
Celestial Mechanics and Dynamical Astronomy manuscrit No. (will be inserted by the editor) Martín Avendaño Daniele Mortari A Closed-Form Solution to the Minimum V tot Lambert s Problem Received: Month
More informationCS 6260 Some number theory. Groups
Let Z = {..., 2, 1, 0, 1, 2,...} denote the set of integers. Let Z+ = {1, 2,...} denote the set of ositive integers and = {0, 1, 2,...} the set of non-negative integers. If a, are integers with > 0 then
More informationCatalan s Equation Has No New Solution with Either Exponent Less Than 10651
Catalan s Euation Has No New Solution with Either Exonent Less Than 065 Maurice Mignotte and Yves Roy CONTENTS. Introduction and Overview. Bounding One Exonent as a Function of the Other 3. An Alication
More informationA Model for Randomly Correlated Deposition
A Model for Randomly Correlated Deosition B. Karadjov and A. Proykova Faculty of Physics, University of Sofia, 5 J. Bourchier Blvd. Sofia-116, Bulgaria ana@hys.uni-sofia.bg Abstract: A simle, discrete,
More information1. INTRODUCTION. Fn 2 = F j F j+1 (1.1)
CERTAIN CLASSES OF FINITE SUMS THAT INVOLVE GENERALIZED FIBONACCI AND LUCAS NUMBERS The beautiful identity R.S. Melham Deartment of Mathematical Sciences, University of Technology, Sydney PO Box 23, Broadway,
More informationc Copyright by Helen J. Elwood December, 2011
c Coyright by Helen J. Elwood December, 2011 CONSTRUCTING COMPLEX EQUIANGULAR PARSEVAL FRAMES A Dissertation Presented to the Faculty of the Deartment of Mathematics University of Houston In Partial Fulfillment
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013
18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013 In this lecture we lay the groundwork needed to rove the Hasse-Minkowski theorem for Q, which states that a quadratic form over
More informationDistribution of Matrices with Restricted Entries over Finite Fields
Distribution of Matrices with Restricted Entries over Finite Fields Omran Ahmadi Deartment of Electrical and Comuter Engineering University of Toronto, Toronto, ON M5S 3G4, Canada oahmadid@comm.utoronto.ca
More informationModel checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle]
Chater 5 Model checking, verification of CTL One must verify or exel... doubts, and convert them into the certainty of YES or NO. [Thomas Carlyle] 5. The verification setting Page 66 We introduce linear
More informationOptimal Design of Truss Structures Using a Neutrosophic Number Optimization Model under an Indeterminate Environment
Neutrosohic Sets and Systems Vol 14 016 93 University of New Mexico Otimal Design of Truss Structures Using a Neutrosohic Number Otimization Model under an Indeterminate Environment Wenzhong Jiang & Jun
More informationDetection Algorithm of Particle Contamination in Reticle Images with Continuous Wavelet Transform
Detection Algorithm of Particle Contamination in Reticle Images with Continuous Wavelet Transform Chaoquan Chen and Guoing Qiu School of Comuter Science and IT Jubilee Camus, University of Nottingham Nottingham
More informationREFINED STRAIN ENERGY OF THE SHELL
REFINED STRAIN ENERGY OF THE SHELL Ryszard A. Walentyński Deartment of Building Structures Theory, Silesian University of Technology, Gliwice, PL44-11, Poland ABSTRACT The aer rovides information on evaluation
More informationGaps in Semigroups. Université Pierre et Marie Curie, Paris 6, Equipe Combinatoire - Case 189, 4 Place Jussieu Paris Cedex 05, France.
Gas in Semigrous J.L. Ramírez Alfonsín Université Pierre et Marie Curie, Paris 6, Equie Combinatoire - Case 189, 4 Place Jussieu Paris 755 Cedex 05, France. Abstract In this aer we investigate the behaviour
More informationThe Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule
The Grah Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule STEFAN D. BRUDA Deartment of Comuter Science Bisho s University Lennoxville, Quebec J1M 1Z7 CANADA bruda@cs.ubishos.ca
More informationMobius Functions, Legendre Symbols, and Discriminants
Mobius Functions, Legendre Symbols, and Discriminants 1 Introduction Zev Chonoles, Erick Knight, Tim Kunisky Over the integers, there are two key number-theoretic functions that take on values of 1, 1,
More informationRobust Predictive Control of Input Constraints and Interference Suppression for Semi-Trailer System
Vol.7, No.7 (4),.37-38 htt://dx.doi.org/.457/ica.4.7.7.3 Robust Predictive Control of Inut Constraints and Interference Suression for Semi-Trailer System Zhao, Yang Electronic and Information Technology
More informationON THE NORM OF AN IDEMPOTENT SCHUR MULTIPLIER ON THE SCHATTEN CLASS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 000-9939XX)0000-0 ON THE NORM OF AN IDEMPOTENT SCHUR MULTIPLIER ON THE SCHATTEN CLASS WILLIAM D. BANKS AND ASMA HARCHARRAS
More information