DOCSLIB.ORG

Report on the First Iran Workshop on Communication and Information Theory (IWCIT 2013)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Report on the First Iran Workshop on Communication and Information Theory (IWCIT 2013) IEEE Information Theory Society Newsletter Vol. 63, No. 4, December 2013 Editor: Tara Javidi ISSN 1059-2362 Editorial committee: Frank Kschischang, Giuseppe Caire, Meir Feder, Tracey Ho, Joerg Kliewer, Anand Sarwate, Andy Singer, and Sergio Verdú President’s Column Gerhard Kramer The 2013 Information Theory Workshop was nominate outstanding dissertations by held in Sevilla, Spain, in mid-September. Be- Jan. 15, 2014. Instructions can be found at fore the Workshop began, the Board of Gov- www.itsoc.org. ernors held their third and final meeting of the year to discuss and vote on a variety of 3) The ISIT Student Paper Award was issues concerning our Society. I would like renamed the IEEE Jack Keil Wolf ISIT to thank the members of the “core” team for Student Paper Award. I appreciate Paul their support during this eventful year: past Siegel’s efforts in managing the change. and future presidents Giuseppe Caire, Mu- riel Médard, Abbas El Gamal, Michelle Eff- 4) A Shannon stamp initiative was started ros, and Alon Orlitsky, treasurer Aylin Yener, at the suggestion of Sergio Verdú, and secretary Edmund Yeh, conference commit- Michelle Effros kindly agreed to orga- tee chair Elza Erkip, and editors-in-chief nize a web page with electronic signa- Helmut Bölcskei and Yiannis Kontoyiannis. tures. If you have not done so already, please add your support at http:// The December column gives opportunity to list some of the www.itsoc.org/about/shannons-centenary-us- important changes that the Board deemed useful and neces- postal-stamp sary for 2014. These changes were thoroughly discussed by an active and supportive Board, and I appreciate their con- 5) Two new Annual Schools of Information Theory were structive comments, criticisms, and suggestions throughout founded in Australia and East Asia. A third new School the year. will be held in India together with the established JTG Summer School. A fourth new School is planned for 1) Our Transactions papers will now receive “moderate/ South America. The new Schools will be funded in part light” editing. This change reduces our IEEE page charg- by tapping into our reserves for 2014. es from $57/page to $37/page (and reduces our publica- tion costs from $100/page to $80/page; we are budgeting 6) Five new initiatives were approved: an ISIT video 8500 pages for 2014; the Transactions costs will remain a event, a meet-the-Shannon-Awardee lunch event, a major issue in the near future). What this means, for WITHITS video initiative, and two online initiatives to instance, is that you will no longer have an editor check- enhance and sustain our media content. A sixth initia- ing your documents closely for grammar and spelling. tive on semi-automatic LaTeX-to-XML conversion is An important side effect is that the Associate Editor han- being coordinated with IEEE Publishing Operations. dling your paper may require you to pay for further editing on the order of $45/page. A future article by the 7) A new Membership committee was formed to con- 2014 Editor-in-Chief will give further information. solidate the efforts of three committees: the former Membership & Chapters, Student, and Outreach 2) A Thomas M. Cover Dissertation Award was estab- committees. The new Membership committee lished at the suggestion of Abbas El Gamal and with includes a new School subcommittee to support our the help of a committee led by Paul Siegel. The award will be given for the first time next year. Please continued on page 3 2 From the Editor Tara Javidi Dear IT Society members, a report on the First Workshop on Entropy and Information Inequality held in April, Amin Aminzadeh Gohari contrib- The last issue of 2013, naturally, contains uted the report on the First Iran Workshop on Communica- Gerhard Kramer’s last column as the IT tion and Information Theory held in May, and Emina Soljanin society president. Please join me in thank- prepared a report on the Dagstuhl Seminar on Coding Theory ing Gerhard for continuing the tradition held in August. These reports all attest to the vibrancy of our of excellence and growth as well as pre- society. paring a detailed report on our Society’s governance activities. With sadness, we As a reminder, announcements, news and events intended for pay tribute to my dear friend, colleague, both the printed newsletter and the website, such as award collaborator, and mentor, Professor Rene announcements, calls for nominations and upcoming con- Cruz, who passed away in June. This is a ferences, can be submitted jointly at the IT Society website loss for us at UCSD as well as for the IT http://www.itsoc.org/, using the quick links “Share News” and “Announce an Event.” society. I would very much like to thank Articles and columns also can be e-mailed to me at [email protected] with Bruce Hajek, Rene’s PhD advisor and close a subject line that includes the words “IT newsletter.” The next few deadlines are: friend, for preparing the tribute. Issue Deadline On a much happier note, we congratu- March 2013 January 10, 2014 late David Donoho who was awarded the June 2013 April 10, 2014 Shaw Prize in Mathematical Sciences. In September 2013 July 10, 2014 addition to our popular and regular con- tributions by historian Ephremides and Please submit plain text, LaTeX or Word source files; do not worry about fonts or layout as puzzle-master Golomb, we have three ex- this will be taken care of by IEEE layout specialists. Electronic photos and graphics should cellent workshop reports. Babak Hassibi be in high resolution and sent as separate files. I look forward to hear your suggestions and Raymond Yeung have kindly prepared (especially regarding the new column) and contributions. IEEE Information Theory Table of Contents Society Newsletter President’s Column �������������������������������������������������������������������������������������������1 IEEE Information Theory Society Newsletter (USPS 360-350) is published quarterly by the From the Editor . 2 Information Theory Society of the Institute of Electrical and Electronics Engineers, Inc. In Memorium: Rene Cruz ���������������������������������������������������������������������������������3 Headquarters: 3 Park Avenue, 17th Floor, The Historian’s Column. 4 New York, NY 10016-5997. David Donoho Receives Cost is $1.00 per member per year (included in Society fee) for each member of the 2013 Shaw Prize in Mathematical Sciences. 5 Information Theory Society. Printed in the Report on the First Workshop U.S.A. Periodicals postage paid at New York, NY and at additional mailing offices. on Entropy and Information Inequalities . 5 Postmaster: Send address changes to IEEE Report on the First Iran Workshop on Communication and Information Theory Society Newsletter, Information Theory (IWCIT 2013) �������������������������������������������������������������������7 IEEE, 445 Hoes Lane, Piscataway, NJ 08854. Workshop Report: Dagstuhl Seminar on Coding © 2013 IEEE. Information contained in this newsletter may be copied without permis- Theory, August 25–30, Schloss Dagstuhl, Germany �������������������������������������8 sion provided that the copies are not made or Golomb’s Puzzle ColumnTM: Rep-Tile Sets ���������������������������������������������������9 distributed for direct commercial advantage, and the title of the publication and its date Golomb’s Puzzle ColumnTM: Combinatorial Counting Solutions �����������10 appear. Thomas M. Cover Dissertation Award ���������������������������������������������������������10 IEEE prohibits discrimination, harassment, and bullying. For more information, visit http://www.ieee.org/web/aboutus/ whatis/policies/p9-26.html. Call for Nominations ���������������������������������������������������������������������������������������11 Call for Papers . 12 Call for Workshops . 17 SFI-00484 Conference Calendar ���������������������������������������������������������������������������������������20 IEEE Information Theory Society Newsletter December 2013 3 In Memorium: Rene Cruz The information theory community lost a dear connections into a single high-speed service. At friend and distinguished contributor last sum- the time of his death, Cruz was the company’s mer with the untimely death, on June 29, of Rene chief science officer. L. Cruz, a professor of electrical and computer engineering at the University of California, San Cruz’s most recent research was in the emerg- Diego. Cruz was 54. ing field of “content-centric networking,” an al- ternative to the current host-centric architecture Rene was born and raised in Urbana where he ob- of the Internet, which aims to reduce congestion tained his bachelor’s degree at Illinois. After com- and complexity while enhancing speed and secu- pleting his master’s degree at MIT and working as rity. Specifically, he was investigating algorithms a senior engineer at Stanford Telecommunications, to distribute the message forwarding function he returned to Illinois for doctoral work with Bruce among network users so that each received the Hajek. Cruz’s 1987 dissertation laid the ground- content relevant to him or her. It’s unfortunate he work for his novel methodology of “network calcu- won’t be able to develop this work further. lus,” which enabled engineers to ascertain bounds on delay and buffering requirements in networks. After joining the Rene’s pioneering work was recognized by the IEEE INFOCOMM UCSD faculty in 1987, Cruz refined his dissertation work into a tan- Achievement Award (2009) for contributions to network calcu- dem of articles for the IEEE Transactions on
Load more

Recommended publications
  • Download PDF Call for Papers
    2020 IEEE International Symposium on Information Theory Los Angeles, CA, USA |June 21-26, 2020 The Westin Bonaventure Hotel & Suites, Los Angeles Call for Papers Interested authors are encouraged to submit previously unpublished contributions in any area related to information theory, including but not limited to the following topic areas: Topics ➢ Communication and Storage Coding ➢ Distributed Storage ➢ Network Information Theory ➢ Coding Theory ➢ Emerging Applications of IT ➢ Pattern Recognition and ML ➢ Coded and Distributed Computing ➢ Information Theory and Statistics ➢ Privacy in Information Processing ➢ Combinatorics and Information Theory ➢ Information Theory in Biology ➢ Quantum Information Theory ➢ Communication Theory ➢ Information Theory in CS ➢ Shannon Theory ➢ Compressed Sensing and Sparsity ➢ Information Theory in Data Science ➢ Signal Processing ➢ Cryptography and Security ➢ Learning Theory ➢ Source Coding and Data Compression ➢ Detection and Estimation ➢ Network Coding and Applications ➢ Wireless Communication ➢ Deep Learning for Networks ➢ Network Data Analysis Researchers working in emerging fields of information theory or on novel applications of information theory are especially encouraged to submit original findings. The submitted work and the published version are limited to 5 pages in the standard IEEE format, plus an optional extra page containing references only. Information about paper formatting and submission policies can be found on the conference web page, noted below. The paper submission deadline is Sunday, January 12, 2020, at 11:59 PM, Eastern Time (New York, USA). Acceptance notifications will be sent out by Friday, March 27, 2020. We look forward to your participation in ISIT 2020! General Chairs: Salman Avestimehr, Giuseppe Caire, and Babak Hassibi TPC Chairs: Young-Han Kim, Frederique Oggier, Greg Wornell, and Wei Yu https://2020.ieee-isit.org .
    [Show full text]
  • Arxiv:2010.10473V2 [Cs.LG] 1 Feb 2021
    Proceedings of Machine Learning Research vol 134:1{22, 2021 Regret-optimal control in dynamic environments Gautam Goel [email protected] California Insititute of Technology Babak Hassibi [email protected] California Insititute of Technology Abstract We consider control in linear time-varying dynamical systems from the perspective of regret minimization. Unlike most prior work in this area, we focus on the problem of designing an online controller which minimizes regret against the best dynamic sequence of control actions selected in hindsight (dynamic regret), instead of the best fixed controller in some specific class of controllers (policy regret). This formulation is attractive when the environ- ment changes over time and no single controller achieves good performance over the entire time horizon. We derive the state-space structure of the regret-optimal controller via a novel reduction to H1 control and present a tight data-dependent bound on its regret in terms of the energy of the disturbance. Our results easily extend to the model-predictive setting where the controller can anticipate future disturbances and to settings where the controller only affects the system dynamics after a fixed delay. We present numerical experiments which show that our regret-optimal controller interpolates between the performance of the H2-optimal and H1-optimal controllers across stochastic and adversarial environments. Keywords: dynamic regret, robust control 1. Introduction The central question in control theory is how to regulate the behavior of an evolving system with state x that is perturbed by a disturbance w by dynamically adjusting a control action u. Traditionally, this question has been studied in two distinct settings: in the H2 setting, we assume that the disturbance w is generated by a stochastic process and seek to select the control u so as to minimize the expected control cost, whereas in the H1 setting we assume the noise is selected adversarially and instead seek to minimize the worst-case control cost.
    [Show full text]
  • Looking Back
    Looking Back Martha E. (Hinds) Crosby Department of Information and Computer Sciences, University of Hawaii [email protected] Abstract: In this chapter, I am reminiscing on some of my experiences from my 53 years of living with computers. I am currently a professor and chair in the department of Information and Computer Sciences at the University of Hawaii. Over the years, I have only experienced computing environments in three locations (Colorado, Washington, D.C. and Hawaii) but they have all been memorable. The computers that I describe are a part of computing history but are rarely documented. Keywords: Computer science, geophysical parameters, mapping program, mathematics. I was not aware of computing before I went to college. I majored in mathematics and I had a professor who believed that computers would be the wave of the future so he gave some short courses on machine language and numerical analysis techniques. Little did I realize that this would make me a qualified applicant for a computing career. I graduated with a Bachelor of Science degree from Colorado State University (CSU) in 1959. At that time, calculators were mechanical and very large and heavy and no one would consider owning one. Also, very few commercial digital computers could be found in the United States and the ones that existed usually occupied a room and were primarily for calculations. I planned to teach mathematics in high school after graduation from CSU. However, I finished my classes a quarter early so teaching positions would be at least a half year away. I was offered positions at Martin Marietta in Denver, Colorado and the National Bureau of Standards (NBS) Central Radio Propagation Laboratories (CRPL) in Boulder, Colorado.
    [Show full text]
  • General Disclaimer One Or More of the Following Statements May Affect
    https://ntrs.nasa.gov/search.jsp?R=19750023705 2020-03-22T20:30:18+00:00Z General Disclaimer One or more of the Following Statements may affect this Document This document has been reproduced from the best copy furnished by the organizational source. It is being released in the interest of making available as much information as possible. This document may contain data, which exceeds the sheet parameters. It was furnished in this condition by the organizational source and is the best copy available. This document may contain tone-on-tone or color graphs, charts and/or pictures, which have been reproduced in black and white. This document is paginated as submitted by the original source. Portions of this document are not fully legible due to the historical nature of some of the material. However, it is the best reproduction available from the original submission. Produced by the NASA Center for Aerospace Information (CASI) AD-AO08 865 FINAL TECHNICAL REPORT, OCTOBER 11, 1974 "THE ALOHA SYSTEM" Norman Abramson Hawaii University Prepared for: National Aeronautics and Space Administration Advanced Research Projects Agency 11 October 1974 DISTRIBUTED BY: mum National Technical Information Service U. S. DEPARTMENT Of COMMERCE ,-W 128 4 171AL TECHNICAL kSMT CONTRACT FOR NUMBER 2 -67W 511 rrrrilfi,llr^f{ "iir ► II^J ll^tltfllll oll . 11,111111 e,!Produted by t NATIONAL TECHNICAL INFORMATION SERVICE US Deoenmaf of C.—I" SVrinq field, VA. 22151 - t OCTOBER 11. 1994 DISTPULMON STA Approved for public Wec" et oa Unlimited { FINAL TECHNICAL REPORT October 11, 1974 ARPA Order Number: 1956 Program Code Number: 2P10 Name of Contractor: University of Hawaii Effective Date of Contract: November 1, 1971 Contract Expiration Date: October 11, 1974 Amount of Contract: $2,571,266 Contract Number: NAS2-6700 PrincipaZ Investigator and Phone Number: Norman Abramson (808) 948-7490 Project Scientist or Engineer and Phone Number: Norman Abramson (808) 948-7490 Short TitZe of Work: THE ALOHA SYSTEM D D C F D r-Dr ^' MAY 6 1975 D Sponsored by Advanced Research Projects Agency ARPA Order No.
    [Show full text]
  • Information Theory and Statistics: a Tutorial
    Foundations and Trends™ in Communications and Information Theory Volume 1 Issue 4, 2004 Editorial Board Editor-in-Chief: Sergio Verdú Department of Electrical Engineering Princeton University Princeton, New Jersey 08544, USA [email protected] Editors Venkat Anantharam (Berkeley) Amos Lapidoth (ETH Zurich) Ezio Biglieri (Torino) Bob McEliece (Caltech) Giuseppe Caire (Eurecom) Neri Merhav (Technion) Roger Cheng (Hong Kong) David Neuhoff (Michigan) K.C. Chen (Taipei) Alon Orlitsky (San Diego) Daniel Costello (NotreDame) Vincent Poor (Princeton) Thomas Cover (Stanford) Kannan Ramchandran (Berkeley) Anthony Ephremides (Maryland) Bixio Rimoldi (EPFL) Andrea Goldsmith (Stanford) Shlomo Shamai (Technion) Dave Forney (MIT) Amin Shokrollahi (EPFL) Georgios Giannakis (Minnesota) Gadiel Seroussi (HP-Palo Alto) Joachim Hagenauer (Munich) Wojciech Szpankowski (Purdue) Te Sun Han (Tokyo) Vahid Tarokh (Harvard) Babak Hassibi (Caltech) David Tse (Berkeley) Michael Honig (Northwestern) Ruediger Urbanke (EPFL) Johannes Huber (Erlangen) Steve Wicker (GeorgiaTech) Hideki Imai (Tokyo) Raymond Yeung (Hong Kong) Rodney Kennedy (Canberra) Bin Yu (Berkeley) Sanjeev Kulkarni (Princeton) Editorial Scope Foundations and Trends™ in Communications and Information Theory will publish survey and tutorial articles in the following topics: • Coded modulation • Multiuser detection • Coding theory and practice • Multiuser information theory • Communication complexity • Optical communication channels • Communication system design • Pattern recognition and learning • Cryptology
    [Show full text]
  • Network Information Theory
    Network Information Theory This comprehensive treatment of network information theory and its applications pro- vides the first unified coverage of both classical and recent results. With an approach that balances the introduction of new models and new coding techniques, readers are guided through Shannon’s point-to-point information theory, single-hop networks, multihop networks, and extensions to distributed computing, secrecy, wireless communication, and networking. Elementary mathematical tools and techniques are used throughout, requiring only basic knowledge of probability, whilst unified proofs of coding theorems are based on a few simple lemmas, making the text accessible to newcomers. Key topics covered include successive cancellation and superposition coding, MIMO wireless com- munication, network coding, and cooperative relaying. Also covered are feedback and interactive communication, capacity approximations and scaling laws, and asynchronous and random access channels. This book is ideal for use in the classroom, for self-study, and as a reference for researchers and engineers in industry and academia. Abbas El Gamal is the Hitachi America Chaired Professor in the School of Engineering and the Director of the Information Systems Laboratory in the Department of Electri- cal Engineering at Stanford University. In the field of network information theory, he is best known for his seminal contributions to the relay, broadcast, and interference chan- nels; multiple description coding; coding for noisy networks; and energy-efficient packet scheduling and throughput–delay tradeoffs in wireless networks. He is a Fellow of IEEE and the winner of the 2012 Claude E. Shannon Award, the highest honor in the field of information theory. Young-Han Kim is an Assistant Professor in the Department of Electrical and Com- puter Engineering at the University of California, San Diego.
    [Show full text]
  • Linear Estimation in Krein Spaces-- Part II: Applications
    34 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 41, NO. 1, JANUARY 1996 stimation in Krein Spaces- art 11: Applications Babak Hassibi, Ali H. Sayed, Member, IEEE, and Thomas Kailath, Fellow, IEEE Abstract-We show that several interesting problems in Rw - by constructing the corresponding Krein-space "stoc filtering, quadratic game theory, and risk sensitive control and problems for which the Kalman-filter solutions can be written estimation follow as special cases of the Krein-space linear esti- down immediately; moreover, the conditions for a minimum mation theory developed in [l]. We show that a11 these problems can be cast into the problem of calculating the stationary point can also be expressed in terms of quantities easily related to the of certain second-order forms, and that by considering the ap- basic Riccati equations of the Kalman filter. This approach also propriate state space models and error Gramians, we can use the explains the many similarities between, say, the H" solutions ~re~n-spa~eestimation theory to calculate the stationary points and ~e classical LQ solutions and in addition marks out their and study their properties. The approach discussed here allows key differences. for interesting generalizations, such as finite memory adaptive filtering with varying sliding patterns. The paper is organized as follows. In Section I1 we introduce the H" estimation problem, state the conventional solution, and discuss its similarities with and differences from the I. INTRODUCTION Conventional Kalman filter. In Section I11 we reduce the H" LASSICAL results in linear least-squares estimation and estimation problem to guaranteeing the positivity of a certain Kalman filtering are based on an LZ or HZ criterion indefinite quadratic form.
    [Show full text]
  • Stochastic Mirror Descent on Overparameterized Nonlinear Models: Convergence, Implicit Regularization, and Generalization
    Stochastic Mirror Descent on Overparameterized Nonlinear Models: Convergence, Implicit Regularization, and Generalization Navid Azizan1, Sahin Lale2, Babak Hassibi2 1 Department of Computing and Mathematical Sciences 2 Department of Electrical Engineering California Institute of Technology {azizan,alale,hassibi}@caltech.edu Abstract Most modern learning problems are highly overparameterized, meaning that there are many more parameters than the number of training data points, and as a result, the training loss may have infinitely many global minima (parameter vectors that perfectly interpolate the training data). Therefore, it is important to understand which interpolating solutions we converge to, how they depend on the initialization point and the learning algorithm, and whether they lead to different generalization performances. In this paper, we study these questions for the family of stochastic mirror descent (SMD) algorithms, of which the popular stochastic gradient descent (SGD) is a special case. Our contributions are both theoretical and experimental. On the theory side, we show that in the overparameterized nonlinear setting, if the initialization is close enough to the manifold of global minima (something that comes for free in the highly overparameterized case), SMD with sufficiently small step size converges to a global minimum that is approximately the closest one in Bregman divergence. On the experimental side, our extensive experiments on standard datasets and models, using various initializations, various mirror descents,
    [Show full text]
  • Symposium in Remembrance of Rudolf Ahlswede
    in cooperation with Fakultät für Mathematik Department of Mathematics Symposium in Remembrance of Rudolf Ahlswede July 25 -26, 2011 Program and Booklet of Abstracts Symposium in Remembrance of Rudolf Ahlswede Bielefeld, Germany, July 25 -26, 2011 Program and Booklet of Abstracts Organizers: Harout Aydinian Ingo Alth¨ofer Ning Cai Ferdinando Cicalese Christian Deppe Gunter Dueck Ulrich Tamm Andreas Winter Contents 1 Program 1 2 Rudolf Ahlswede 1938-2010 5 Christian Deppe 3 Obituary of the ZIF 11 Manuela Lenzen 4 AZ-identity for regular posets 13 Harout Aydinian 5 Quantum information, the ambiguity of the past, and the complexity of the present 15 Charles Bennett 6 Local-global principles in discrete extremal problems 17 Sergei L. Bezrukov 7 Secure network coding 19 Ning Cai 8 Common randomness in information theory 21 Imre Csisz´ar 9 The deep impact of Rudolf Ahlswede on combinatorics 23 Gyula O. H. Katona 10 Common randomness and multiterminal secure computation 25 Prakash Narayan 11 String reconstruction from substring compositions 27 Alon Orlitsky 12 Stochastic search for locally clustered targets 29 K. R¨udigerReischuk 13 Information flows and bottle necks in dynamic communication networks 31 Soren Riis 14 On the complexity of families of binary sequences and lattices 33 Andras Sarkozy 15 Higher order extremal problems 35 L´aszl´oSz´ekely 16 A generalisation of the Gilbert-Varshamov bound and its asymptotic evaluation 37 Ludo Tolhuizen 17 Quantum channels and identification theory 39 Andreas Winter 18 List of Participants 41 iii Monday July 25, 2011 PROGRAM 10:15 Warm up: C. Bennett - Quantum information, the ambiguity of the past, and the complexity of the present 12:00 Welcome and registration at the ZiF - Chair C.
    [Show full text]
  • Reflections on Compressed Sensing, by E
    itNL1208.qxd 11/26/08 9:09 AM Page 1 IEEE Information Theory Society Newsletter Vol. 58, No. 4, December 2008 Editor: Daniela Tuninetti ISSN 1059-2362 Source Coding and Simulation XXIX Shannon Lecture, presented at the 2008 IEEE International Symposium on Information Theory, Toronto Canada Robert M. Gray Prologue Source coding/compression/quantization A unique aspect of the Shannon Lecture is the daunting fact that the lecturer has a year to prepare for (obsess over?) a single lec- source reproduction ture. The experience begins with the comfort of a seemingly infi- { } - bits- - Xn encoder decoder {Xˆn} nite time horizon and ends with a relativity-like speedup of time as the date approaches. I early on adopted a few guidelines: I had (1) a great excuse to review my more than four decades of Simulation/synthesis/fake process information theoretic activity and historical threads extending simulation even further back, (2) a strong desire to avoid repeating the top- - - ics and content I had worn thin during 2006–07 as an interconti- random bits coder {X˜n} nental itinerant lecturer for the Signal Processing Society, (3) an equally strong desire to revive some of my favorite topics from the mid 1970s—my most active and focused period doing Figure 1: Source coding and simulation. unadulterated information theory, and (4) a strong wish to add something new taking advantage of hindsight and experience, The goal of source coding [1] is to communicate or transmit preferably a new twist on some old ideas that had not been pre- the source through a constrained, discrete, noiseless com- viously fully exploited.
    [Show full text]
  • 4 AN10 Abstracts
    4 AN10 Abstracts IC1 IC4 On Dispersive Equations and Their Importance in Kinematics and Numerical Algebraic Geometry Mathematics Kinematics underlies applications ranging from the design Dispersive equations, like the Schr¨odinger equation for ex- and control of mechanical devices, especially robots, to the ample, have been used to model several wave phenom- biomechanical modelling of human motion. The major- ena with the distinct property that if no boundary con- ity of kinematic problems can be formulated as systems ditions are imposed then in time the wave spreads out of polynomial equations to be solved and so fall within spatially. In the last fifteen years this field has seen an the domain of algebraic geometry. While symbolic meth- incredible amount of new and sophisticated results proved ods from computer algebra have a role to play, numerical with the aid of mathematics coming from different fields: methods such as polynomial continuation that make strong Fourier analysis, differential and symplectic geometry, an- use of algebraic-geometric properties offer advantages in alytic number theory, and now also probability and a bit of efficiency and parallelizability. Although these methods, dynamical systems. In this talk it is my intention to present collectively called Numerical Algebraic Geometry, are ap- few simple, but still representative examples in which one plicable wherever polynomials arise, e.g., chemistry, biol- can see how these different kinds of mathematics are used ogy, statistics, and economics, this talk will concentrate on in this context. applications in mechanical engineering. A brief review of the main algorithms of the field will indicate their broad Gigliola Staffilani applicability.
    [Show full text]
  • Theoretic Security
    itNL0306.qxd 3/13/06 11:06 AM Page 1 IEEE Information Theory Society Newsletter Vol. 56, No. 1, March 2006 Editor: Daniela Tuninetti ISSN 1059-2362 President’s Column David L. Neuhoff Among the many things that happen and to permit the Society to be credited for providing this on January 1 of each year is that the content to IEEE Explore. This past year was the first full year Information Theory Society acquires in which we have encouraged authors to submit paper a new president. This year the man- preprints to the arXiv e-print server (http://arxiv.org), in tle has passed to me from the capa- order to foster rapid dissemination of information theory ble hands of Steve McLaughlin. It is results. In response, nearly 400 papers were posted in the indeed an honor to take this respon- information theory category. Finally, we have just begun to sibility. I do so with the knowledge initiate an upgrade of our website. that under his leadership, as well as that of his predecessors, and others With all these good things happening, there do remain some who have contributed so much, our challenges. For one, membership remains an issue. Last year David L. Neuhoff Society is in good shape. the number of IT members declined approximately 8%. This is a smaller decline than the 10 to 12% of the two previous I would like to mention a few of the important things that years. However, it remains a concern. Most puzzling was the happened this past year under Steve’s watch.
    [Show full text]