DOCSLIB.ORG

IEEE Information Theory Society Officers Governors Other Voting

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
IEEE Information Theory Society Officers Governors Other Voting IEEE Information Theory Society 2013 Roster (v: indicates voting member of BoG) Officers Gerhard Kramer President v Abbas El Gamal First Vice President v Michelle Effros Second Vice President v Edmund Yeh Secretary v Aylin Yener Treasurer v Muriel M´edard Junior Past President v Giuseppe Caire Senior Past President v Governors Until End of Nicholas Laneman 2013 v Amin Shokrollahi 2013 v David Tse 2013 v Alexander Vardy 2013 v Emanuele Viterbo 2013 v Urbashi Mitra 2014 v Alon Orlitsky 2014 v Paul Siegel 2014 v Sergio Verd´u 2014 v Jeff Andrews 2015 v Michael Honig 2015 v P. Vijay Kumar 2015 v Emina Soljanin 2015 v R¨udigerUrbanke 2015 v Ram Zamir 2015 v Other Voting Members of BoG Helmut B¨olcskei IT Transactions Editor-in-Chief (until June) v Yiannis Kontoyiannis IT Transactions Editor-in-Chief (from July) v Elza Erkip Chair, Conference Committee v total number of voting members: 24 quorum: 13 1 Standing Committees Awards Abbas El Gamal Chair, ex officio 1st VP Michelle Effros ex officio 2nd VP Randall Berry since 2012 Michael Gastpar since 2012 Alex Grant since 2012 Urbashi Mitra since 2012 Emanuele Viterbo since 2012 Aaron Wagner since 2012 Merouane Debbah since 2013 Young-Han Kim since 2013 Vijay Kumar since 2013 Pascal Vontobel since 2013 Andreas Winter since 2013 Aaron D. Wyner Award Selection Gerhard Kramer Chair, ex officio President Muriel M´edard ex officio Junior Past President Rolf Johannesson since 2012 H. Vincent Poor since 2012 Ian Blake since 2013 Claude E. Shannon Award Selection Gerhard Kramer Chair, ex officio President Abbas El Gamal ex officio 1st VP Michelle Effros ex officio 2nd VP Raymond Yeung since 2012 Imre Csisz´ar since 2013 Sol Golomb since 2013 Te Sun Han since 2013 Paul Siegel since 2013 Conference Elza Erkip Chair, since 2013 Aylin Yener ex officio Treasurer Paul Siegel since July 2010 Lars Rasmussen since August 2011 Alon Orlitsky since 2013 R¨udigerUrbanke since 2013 Gerhard Kramer for 2013 Abbas El Gamal for 2013 2 Constitution and Bylaws Giuseppe Caire Chair, ex officio Senior PP Muriel M´edard ex officio Junior PP Fellows Robert Calderbank Chair, since 2013 Alon Orlitsky since 2011 Thomas Richardson since 2012 Raymond Yeung since 2012 Helmut B¨olcskei since 2013 Andrea Goldsmith since 2013 Ram Zamir since 2013 Membership and Chapters Michelle Effros Chair, ex officio 2nd VP Sae-Young Chung since 2012 Michael Gastpar since 2012 Andrew Thangaraj since 2012 Negar Kiyavesh since 2013 Joerg Kliewer since 2013 Sriram Vishwanath since 2013 Nominations and Appointments Giuseppe Caire Chair, ex officio Senior PP Muriel M´edard ex officio Junior PP David Neuhoff since 2011 David Forney since 2012 Shlomo Shamai since 2013 Online Matthieu Bloch Chair Gerhard Kramer ex officio President Abbas El Gamal ex officio 1st VP J. Nicholas Laneman since 2007 Anand Sarwate since 2007 Amin Mobasher since 2009 Stefan Moser since 2009 3 External Nominations Alon Orlitsky Chair, since 2013 Gerhard Kramer ex officio President Han Vinck since 2012 Richard Blahut since 2013 Helmut B¨olcskei since 2013 Outreach Joerg Kliewer Chair and Mentoring Program Coordinator Negar Kiyavash WITHITS Coordinator Elza Erkip for 2013 Bobak Nazer for 2013 Daniela Tuninetti for 2013 Student Sriram Vishwanath Co-Chair, since 2012 Deniz G¨und¨uz Co-Chair, since 2013 Michelle Effros ex officio 2nd VP Publications Helmut B¨olcskei Chair, Editor-in-Chief (until June 2013) Yiannis Kontoyiannis Chair, Editor-in-Chief (from July 2013) Giuseppe Caire ex officio Senior PP and VP Publications Gerhard Kramer ex officio President Abbas El Gamal ex officio 1st VP Michelle Effros ex officio 2nd VP Tara Javidi Newsletter Editor David Forney Exec. Editorial Board Shlomo Shamai Exec. Editorial Board Alexander Vardy Exec. Editorial Board Sergio Verd´u Exec. Editorial Board Giuseppe Durisi Publications Editor Erdal Arikan Coding Theory Alexei Ashikhmin Coding Techniques Francois Baccelli Communication Networks Jean-Claude Belfiore Coding Theory Ian Blake Complexity and Cryptography Vivek Borkar Communication Networks David Burshtein Coding Techniques Nicolo Cesa-Bianchi Pattern Recognition, Statistical Learning, and Inference Ronald Cramer Complexity and Cryptography Michael Elad Signal Processing Robert Fischer Communications Albert Guillen I Fabregas Communications 4 Dongning Guo Shannon Theory Venkatesan Guruswami Complexity and Cryptography Tor Helleseth Sequences Alexander Holevo Quantum Information Theory Navin Kashyap Coding Theory Young-Han Kim Shannon Theory Ioannis Kontoyiannis Assoc. Editor At Large Janos K¨orner Shannon Theory Michael Langberg Coding Theory Yingbin Liang Shannon Theory Angel Lozano Communications Yi Ma Signal Processing Gerald Matz Detection and Estimation Ueli Maurer Complexity and Cryptography Olgica Milenkovic Coding Theory Georg Moustakides Detection and Estimation Yasutada Oohama Source Coding Henry Pfister Coding Theory B. Sundar Rajan Coding Theory Venkatesh Saligrama Signal Processing Devavrat Shah Communication Networks Adam Smith Complexity and Cryptography Yossef Steinberg Assoc. Editor At Large Rajesh Sundaresan Communications Antonia Tulino Communications Tomohiko Uyematsu Shannon Theory Aaron Wagner Shannon Theory Tsachy Weissman Shannon Theory Kyeongcheol Yang Sequences Wei Yu Shannon Theory Extrasocietal Representatives Nicholas J. Laneman IEEE-USA Committee on Communications Policy John B. Anderson IEEE Press Liaison Andrea Goldsmith ComSoc Liaison Urbashi Mitra SPSoc Liaison Negar Kiyavash Women in Engineering Coordinator Edmund Yeh IEEE SmartGrid ad Hoc Committee liaisons Tony Ephremides IEEE SmartGrid ad Hoc Committee liaisons 5 Distinguished Lecturers Christina Fragouli 2012-2013 Young-Han Kim 2012-2013 Frank Kschischang 2012-2013 Shlomo Shamai 2012-2013 Emre Telatar 2012-2013 Helmut B¨olcskei 2013-2014 Elza Erkip 2013-2014 Muriel M´edard 2013-2014 H. Vincent Poor 2013-2014 R¨udigerUrbanke 2013-2014 Division Directors Jose M.F. Moura Director, Division IX Marina Ruggieri Director-Elect, Division IX Other Institutional Roles Anthony Ephremides Historian 6.
Load more

Recommended publications
  • Digital Communication Systems 2.2 Optimal Source Coding
    Digital Communication Systems EES 452 Asst. Prof. Dr. Prapun Suksompong [email protected] 2. Source Coding 2.2 Optimal Source Coding: Huffman Coding: Origin, Recipe, MATLAB Implementation 1 Examples of Prefix Codes Nonsingular Fixed-Length Code Shannon–Fano code Huffman Code 2 Prof. Robert Fano (1917-2016) Shannon Award (1976 ) Shannon–Fano Code Proposed in Shannon’s “A Mathematical Theory of Communication” in 1948 The method was attributed to Fano, who later published it as a technical report. Fano, R.M. (1949). “The transmission of information”. Technical Report No. 65. Cambridge (Mass.), USA: Research Laboratory of Electronics at MIT. Should not be confused with Shannon coding, the coding method used to prove Shannon's noiseless coding theorem, or with Shannon–Fano–Elias coding (also known as Elias coding), the precursor to arithmetic coding. 3 Claude E. Shannon Award Claude E. Shannon (1972) Elwyn R. Berlekamp (1993) Sergio Verdu (2007) David S. Slepian (1974) Aaron D. Wyner (1994) Robert M. Gray (2008) Robert M. Fano (1976) G. David Forney, Jr. (1995) Jorma Rissanen (2009) Peter Elias (1977) Imre Csiszár (1996) Te Sun Han (2010) Mark S. Pinsker (1978) Jacob Ziv (1997) Shlomo Shamai (Shitz) (2011) Jacob Wolfowitz (1979) Neil J. A. Sloane (1998) Abbas El Gamal (2012) W. Wesley Peterson (1981) Tadao Kasami (1999) Katalin Marton (2013) Irving S. Reed (1982) Thomas Kailath (2000) János Körner (2014) Robert G. Gallager (1983) Jack KeilWolf (2001) Arthur Robert Calderbank (2015) Solomon W. Golomb (1985) Toby Berger (2002) Alexander S. Holevo (2016) William L. Root (1986) Lloyd R. Welch (2003) David Tse (2017) James L.
    [Show full text]
  • Principles of Communications ECS 332
    Principles of Communications ECS 332 Asst. Prof. Dr. Prapun Suksompong (ผศ.ดร.ประพันธ ์ สขสมปองุ ) [email protected] 1. Intro to Communication Systems Office Hours: Check Google Calendar on the course website. Dr.Prapun’s Office: 6th floor of Sirindhralai building, 1 BKD 2 Remark 1 If the downloaded file crashed your device/browser, try another one posted on the course website: 3 Remark 2 There is also three more sections from the Appendices of the lecture notes: 4 Shannon's insight 5 “The fundamental problem of communication is that of reproducing at one point either exactly or approximately a message selected at another point.” Shannon, Claude. A Mathematical Theory Of Communication. (1948) 6 Shannon: Father of the Info. Age Documentary Co-produced by the Jacobs School, UCSD- TV, and the California Institute for Telecommunic ations and Information Technology 7 [http://www.uctv.tv/shows/Claude-Shannon-Father-of-the-Information-Age-6090] [http://www.youtube.com/watch?v=z2Whj_nL-x8] C. E. Shannon (1916-2001) Hello. I'm Claude Shannon a mathematician here at the Bell Telephone laboratories He didn't create the compact disc, the fax machine, digital wireless telephones Or mp3 files, but in 1948 Claude Shannon paved the way for all of them with the Basic theory underlying digital communications and storage he called it 8 information theory. C. E. Shannon (1916-2001) 9 https://www.youtube.com/watch?v=47ag2sXRDeU C. E. Shannon (1916-2001) One of the most influential minds of the 20th century yet when he died on February 24, 2001, Shannon was virtually unknown to the public at large 10 C.
    [Show full text]
  • IEEE Information Theory Society Newsletter
    IEEE Information Theory Society Newsletter Vol. 59, No. 3, September 2009 Editor: Tracey Ho ISSN 1059-2362 Optimal Estimation XXX Shannon lecture, presented in 2009 in Seoul, South Korea (extended abstract) J. Rissanen 1 Prologue 2 Modeling Problem The fi rst quest for optimal estimation by Fisher, [2], Cramer, The modeling problem begins with a set of observed data 5 5 5 c 6 Rao and others, [1], dates back to over half a century and has Y yt:t 1, 2, , n , often together with other so-called 5 51 c26 changed remarkably little. The covariance of the estimated pa- explanatory data Y, X yt, x1,t, x2,t, . The objective is rameters was taken as the quality measure of estimators, for to learn properties in Y expressed by a set of distributions which the main result, the Cramer-Rao inequality, sets a lower as models bound. It is reached by the maximum likelihood (ML) estima- 5 1 u 26 tor for a restricted subclass of models and asymptotically for f Y|Xs; , s . a wider class. The covariance, which is just one property of u5u c u models, is too weak a measure to permit extension to estima- Here s is a structure parameter and 1, , k1s2 real- valued tion of the number of parameters, which is handled by various parameters, whose number depends on the structure. The ad hoc criteria too numerous to list here. structure is simply a subset of the models. Typically it is used to indicate the most important variables in X. (The traditional Soon after I had studied Shannon’s formal defi nition of in- name for the set of models is ‘likelihood function’ although no formation in random variables and his other remarkable per- such concept exists in probability theory.) formance bounds for communication, [4], I wanted to apply them to other fi elds – in particular to estimation and statis- The most important problem is the selection of the model tics in general.
    [Show full text]
  • IEEE Information Theory Society Newsletter
    IEEE Information Theory Society Newsletter Vol. 53, No.4, December 2003 Editor: Lance C. Pérez ISSN 1059-2362 The Shannon Lecture Hidden Markov Models and the Baum-Welch Algorithm Lloyd R. Welch Content of This Talk what the ‘running variable’ is. The lectures of previous Shannon Lecturers fall into several Of particular use will be the concept of conditional probabil- categories such as introducing new areas of research, resusci- ity and recursive factorization. The recursive factorization tating areas of research, surveying areas identified with the idea says that the joint probability of a collection of events can lecturer, or reminiscing on the career of the lecturer. In this be expressed as a product of conditional probabilities, where talk I decided to restrict the subject to the Baum-Welch “algo- each is the probability of an event conditioned on all previous rithm” and some of the ideas that led to its development. events. For example, let A, B, and C be three events. Then I am sure that most of you are familiar with Markov chains Pr(A ∩ B ∩ C) = Pr(A)Pr(B | A)Pr(C | A ∩ B) and Markov processes. They are natural models for various communication channels in which channel conditions change Using the bracket notation, we can display the recursive fac- with time. In many cases it is not the state sequence of the torization of the joint probability distribution of a sequence of model which is observed but the effects of the process on a discrete random variables: signal. That is, the states are not observable but some func- tions, possibly random, of the states are observed.
    [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]
  • IEEE Information Theory Society Newsletter
    IEEE Information Theory Society Newsletter Vol. 63, No. 3, September 2013 Editor: Tara Javidi ISSN 1059-2362 Editorial committee: Ioannis Kontoyiannis, Giuseppe Caire, Meir Feder, Tracey Ho, Joerg Kliewer, Anand Sarwate, Andy Singer, and Sergio Verdú Annual Awards Announced The main annual awards of the • 2013 IEEE Jack Keil Wolf ISIT IEEE Information Theory Society Student Paper Awards were were announced at the 2013 ISIT selected and announced at in Istanbul this summer. the banquet of the Istanbul • The 2014 Claude E. Shannon Symposium. The winners were Award goes to János Körner. the following: He will give the Shannon Lecture at the 2014 ISIT in 1) Mohammad H. Yassaee, for Hawaii. the paper “A Technique for Deriving One-Shot Achiev - • The 2013 Claude E. Shannon ability Results in Network Award was given to Katalin János Körner Daniel Costello Information Theory”, co- Marton in Istanbul. Katalin authored with Mohammad presented her Shannon R. Aref and Amin A. Gohari Lecture on the Wednesday of the Symposium. If you wish to see her slides again or were unable to attend, a copy of 2) Mansoor I. Yousefi, for the paper “Integrable the slides have been posted on our Society website. Communication Channels and the Nonlinear Fourier Transform”, co-authored with Frank. R. Kschischang • The 2013 Aaron D. Wyner Distinguished Service Award goes to Daniel J. Costello. • Several members of our community became IEEE Fellows or received IEEE Medals, please see our web- • The 2013 IT Society Paper Award was given to Shrinivas site for more information: www.itsoc.org/honors Kudekar, Tom Richardson, and Rüdiger Urbanke for their paper “Threshold Saturation via Spatial Coupling: The Claude E.
    [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]
  • Quantum Leap FINAL Case Study
    Case study A Quantum Leap at INI Case study: Mathematics for Quantum Information “The application of quantum technologies to In their original proposal, two years earlier, MQI encryption algorithms threatens to dramatically programme organisers Richard Jozsa (Cambridge), impact the US government’s ability to both protect Noah Linden (Bristol), Peter Shor (MIT) and its communications and eavesdrop on the Andreas Winter (Bristol/CQT, Singapore) had communications of foreign governments,” correctly anticipated the readiness of their according to an internal document leaked by discipline for such breakthroughs predicting whistle-blower Edward Snowden. That the UK Government takes quantum computing seriously “we see this as a moment of substantial scientific is evinced by its commitment to “provide £270 opportunity: we believe we are at the beginning million over 5 years to fund a programme to of a period in the subject where diverse areas of support translation of the UK’s world leading mathematics will play an increasing important quantum research into application and new role. A Newton Institute programme at this time industries – from quantum computation to secure offers the possibility of major influence in the communication”, as announced by Chancellor of speed and direction of the field”. the Exchequer George Osborne in his 2013 Autumn Statement. This statement by the UK In October 2013, Alexander Holevo, a pioneer in Chancellor came during the closing weeks of an the field of Quantum Information Science and INI programme on Mathematics for Quantum winner of the Humbolt Prize, gave the Rothschild Information (MQI) and within days of an Lecture for the MQI programme.
    [Show full text]
  • Ieee Information Theory Society
    IEEE INFORMATION THEORY SOCIETY The Information Theory Society is an organization, within the framework of the IEEE, of members with principal professional interests in information theory. All members of the IEEE are eligible for membership in the Society and will receive this TRANSACTIONS upon payment of the annual Society membership fee of $30.00. For information on joining, write to the IEEE at the address below. Member copies of Transactions/Journals are for personal use only. BOARD OF GOVERNORS President Secretary Treasurer Transactions Editor Conference Committee Chair GIUSEPPE CAIRE NATASHA DEVROYE NIHAR JINDAL HELMUT BÖLCSKEI BRUCE HAJEK EE Dept. Dept. ECE Dept. Elec. Eng. Comp. Sci. Dept. IT & EE Dept. EECS and Univ. of Southern California Univ. of Illinois Univ. of Minnesota ETH Zurich Coordinated Science Lab. Los Angeles, CA 90089 USA Chicago, IL 60607 USA Minneapolis, MN 55455 USA Zurich, Switzerland Univ. of Illinois Urbana, IL 61801 USA First Vice President Second Vice President Junior Past President Senior Past President MURIEL MÉDARD GERHARD KRAMER FRANK R. KSCHISCHANG ANDREA J. GOLDSMITH HELMUT BÖLCSKEI (2011) ALEX GRANT (2011) MURIEL MÉDARD (2012) EMINA SOLJANIN (2011) MARTIN BOSSERT (2012) ROLF JOHANNESSON (2012) PRAKASH NARAYAN (2012) DAVID TSE (2013) MAX H. M. COSTA (2012) GERHARD KRAMER (2011) L. PING (2012) ALEXANDER VARDY (2013) MICHELLE EFFROS (2013) J. NICHOLAS LANEMAN (2013) AMIN SHOKROLLAHI (2013) SERGIO VERDÚ (2011) ABBAS EL GAMAL (2011) HANS-ANDREA LOELIGER (2012) PAUL SIEGEL (2011) EMANUELE VITERBO (2013) IEEE TRANSACTIONS ON INFORMATION THEORY HELMUT BÖLCSKEI, Editor-in-Chief Executive Editorial Board G. DAVID FORNEY,JR.SHLOMO SHAMAI (SHITZ)ALEXANDER VARDY SERGIO VERDÚ CYRIL MÉASSON, Publications Editor PREDRAG SPASOJEVIc´, Publications Editor ERDAL ARIKAN ELZA ERKIP NAVIN KASHYAP DANIEL P.
    [Show full text]
  • Analysis of Quantum Error-Correcting Codes: Symplectic Lattice Codes and Toric Codes
    Analysis of quantum error-correcting codes: symplectic lattice codes and toric codes Thesis by James William Harrington Advisor John Preskill In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 2004 (Defended May 17, 2004) ii c 2004 James William Harrington All rights Reserved iii Acknowledgements I can do all things through Christ, who strengthens me. Phillipians 4:13 (NKJV) I wish to acknowledge first of all my parents, brothers, and grandmother for all of their love, prayers, and support. Thanks to my advisor, John Preskill, for his generous support of my graduate studies, for introducing me to the studies of quantum error correction, and for encouraging me to pursue challenging questions in this fascinating field. Over the years I have benefited greatly from stimulating discussions on the subject of quantum information with Anura Abeyesinge, Charlene Ahn, Dave Ba- con, Dave Beckman, Charlie Bennett, Sergey Bravyi, Carl Caves, Isaac Chenchiah, Keng-Hwee Chiam, Richard Cleve, John Cortese, Sumit Daftuar, Ivan Deutsch, Andrew Doherty, Jon Dowling, Bryan Eastin, Steven van Enk, Chris Fuchs, Sho- hini Ghose, Daniel Gottesman, Ted Harder, Patrick Hayden, Richard Hughes, Deborah Jackson, Alexei Kitaev, Greg Kuperberg, Andrew Landahl, Chris Lee, Debbie Leung, Carlos Mochon, Michael Nielsen, Smith Nielsen, Harold Ollivier, Tobias Osborne, Michael Postol, Philippe Pouliot, Marco Pravia, John Preskill, Eric Rains, Robert Raussendorf, Joe Renes, Deborah Santamore, Yaoyun Shi, Pe- ter Shor, Marcus Silva, Graeme Smith, Jennifer Sokol, Federico Spedalieri, Rene Stock, Francis Su, Jacob Taylor, Ben Toner, Guifre Vidal, and Mas Yamada. Thanks to Chip Kent for running some of my longer numerical simulations on a computer system in the High Performance Computing Environments Group (CCN-8) at Los Alamos National Laboratory.
    [Show full text]
  • Principles of Communications ECS 332
    Principles of Communications ECS 332 Asst. Prof. Dr. Prapun Suksompong (ผศ.ดร.ประพันธ ์ สขสมปองุ ) [email protected] 1. Intro to Communication Systems Office Hours: BKD, 4th floor of Sirindhralai building Monday 9:30-10:30 Monday 14:00-16:00 1 Thursday 16:00-17:00 “The fundamental problem of communication is that of reproducing at one point either exactly or approximately a message selected at another point.” Shannon, Claude. A Mathematical Theory Of Communication. (1948) 2 Shannon: Father of the Info. Age Documentary Co-produced by the Jacobs School, UCSD-TV, and the California Institute for Telecommunications and Information Technology Won a Gold award in the Biography category in the 2002 Aurora Awards. 3 [http://www.uctv.tv/shows/Claude-Shannon-Father-of-the-Information-Age-6090] [http://www.youtube.com/watch?v=z2Whj_nL-x8] C. E. Shannon (1916-2001) 1938 MIT master's thesis: A Symbolic Analysis of Relay and Switching Circuits Insight: The binary nature of Boolean logic was analogous to the ones and zeros used by digital circuits. The thesis became the foundation of practical digital circuit design. The first known use of the term bit to refer to a “binary digit.” Possibly the most important, and also the most famous, master’s thesis of the century. It was simple, elegant, and important. 4 C. E. Shannon: Master Thesis 5 An Interesting Book The Logician and the Engineer: How George Boole and Claude Shannon Created the Information Age by Paul J. Nahin ISBN: 9780691151007 http://press.princeton.edu/titles/ 9819.html 6 C.
    [Show full text]
  • International Online Conference One-Parameter Semigroups of Operators
    International Online Conference One-Parameter Semigroups of Operators BOOK OF ABSTRACTS stable version from 20:21 (UTC+0), Friday 9th April, 2021 Nizhny Novgorod 2021 International Online Conference “One-Parameter Semigroups of Operators 2021” Preface International online conference One-Parameter Semigroups of Operators (OPSO 2021), 5-9 April 2021, is organized by the International laboratory of dynamical systems and applications, and research group Evolution semigroups and applications, both located in Russia, Nizhny Novgorod city. The Laboratory was created in 2019 at the National research university Higher School of Economics (HSE). Website of the Laboratory: https://nnov.hse.ru/en/bipm/dsa/ HSE is a young university (established in 1992) which rapidly become one of the leading Russian universities according to international ratings. In 2021 HSE is a large university focused on only on economics. There are departments of Economics (including Finance, Statistics etc), Law, Mathematics, Computer Science, Media and Design, Physics, Chemistry, Biotechnology, Geography and Geoinformation Technologies, Foreign Languages and some other. Website of the HSE: https://www.hse.ru/en/ The OPSO 2021 online conference has connected 106 speakers and 26 participants without a talk from all over the world. The conference covered the following topics: 1. One-parameter groups and semigroups of linear operators; 2. Nonlinear flows and semiflows; 3. Interplay between linear infinite-dimensional systems and nonlinear finite-dimensional systems; 4. Quan- tum
    [Show full text]