Communications of the ACM.

Material type: TextTextSeries: Communications of the ACM, Vol. 56, No. 10, October 2013Publication details: New York : Association for Computing Machinery (ACM), c2013Description: 112 pages : color illustrations ; 28 cmISSN: 0001-0782Subject(s): COMPUTATIONAL SCIENCE | COMPUTER SCIENCE | VIRTUAL ENVIRONMENTS | ENTERPRISE COMPUTING | NUMERICAL ANALYSIS | NATURAL LANGUAGE PROCESSING
Contents:
On the future of ACM -- Revisiting the tragedy of the commons -- Deep accountability, beyond even liability -- Helping scientists, engineers to work up to 100 times faster -- Tuning in to graphene -- Making the internet safe for gadgets -- Software helps linguists reconstruct, decipher ancient languages -- The Alan Turing Year leaves a rich legacy -- Evaluating a startup venture -- Evaluating a startup venture -- The naming of hosts is a difficult matter -- Controlling for cybersecurity risks of medical device software -- Beyond efficiency -- Barbarians at the gateways -- Online algorithms in high-frequency trading -- Passively measuring TCP round-trip times -- Implementing the argument web -- Trends in computer science research -- A blueprint for building a quantum computer -- Can we verify cyber-physical systems?: technical perspective -- Formal verification of phase-locked loops using reachability analysis and continuization -- Future Tense: Quantum Precog.
Summary: [Article Title: On the future of ACM / John White, p.5] https://doi.org/10.1145/2507771.2507772Summary: [Article Title: Revisiting the tragedy of the commons / Vinton G. Cerf, p.7] https://doi.org/10.1145/2507771.2507773Summary: [Article Title: Deep accountability, beyond even liability / CACM Staff, p.8-9] https://doi.org/10.1145/2507771.2507774Summary: [Article Title: Helping scientists, engineers to work up to 100 times faster / Philip Guo, p. 12- 13] Abstract: The Communications Web site, http://cacm.acm.org, features more than a dozen bloggers in the BLOG@CACM community. In each issue of Communications, we'll publish selected posts or excerpts. https://doi.org/10.1145/2507771.2507775Summary: [Article Title: Tuning in to graphene / Alex Wright, p.15-17] Abstract: New ultra-fast wireless antennas may be on the way, but don't throw away your old wireless router just yet. https://doi.org/10.1145/2507771.2507776Summary: [Article Title: Making the internet safe for gadgets / Tom Geller, p.18-20] Abstract: Initiatives favor direct connections, named resources, and cryptography. https://doi.org/10.1145/2507771.2507777Summary: [Article Title: Software helps linguists reconstruct, decipher ancient languages / Paul Hyman, p.21-23] Abstract: Linguists who once spent an entire career reconstructing a major language family now can accomplish that in just a few hours. https://doi.org/10.1145/2507771.2507778Summary: [Article Title: The Alan Turing Year leaves a rich legacy / Sarah Underwood, p.24-25] Abstract: A year-long celebration of the life and work of a man whom many call the founding father of computer science. https://doi.org/10.1145/2507771.2507785Summary: [Article Title: Evaluating a startup venture / Michael A. Cusumano, p.26-29] Abstract: Considering the key elements of successful startups. https://doi.org/10.1145/2505337Summary: [Article Title: When faster is slower / Phillip G. Armour, p.30-32] Abstract: How the speed of modern tools may decelerate development. https://doi.org/10.1145/2505338Summary: [Article Title: The naming of hosts is a difficult matter / George V. Neville-Neil, p. 33-34] Abstract: Also, the perils of premature rebooting. https://doi.org/10.1145/2505339Summary: [Article Title: Controlling for cybersecurity risks of medical device software / Kevin Fu, and James Blum, p.35-37] Abstract: Medical device hacking is a red herring. But the flaws are real. https://doi.org/10.1145/2508701Summary: [Article Title: Beyond efficiency / David H. Ackley, p.38-40] Abstract: Esteem for efficiency should be tempered with respect for robustness. https://doi.org/10.1145/2505340Summary: [Article Title: Barbarians at the gateways / Jacob Loveless, p.42-49] Abstract: A special section on high-frequency trading and exchange technology. https://doi.org/10.1145/2507771.2507779Summary: [Article Title: Online algorithms in high-frequency trading / Rolf Waeber, p.50-56] Abstract: The challenges faced by competing HFT algorithms. https://doi.org/10.1145/2507771.2507780Summary: [Article Title: Passively measuring TCP round-trip times / Stephen D. Strowes, p.57-64] Abstract: A close look at round-trip time measurements with the Transmission Control Protocol. https://doi.org/10.1145/2507771.2507781Summary: [Article Title: Implementing the argument web / Floris Bex, John Lawrence, Mark Snaith, and Chris Reed, p.66-73] Abstract: Improve online public discourse by connecting opinions across blogs, editorials, and social media. https://doi.org/10.1145/2500891Summary: [Article Title: Trends in computer science research / Apirak Hoonlor, Boleslaw K. Szymanski, and Mohammed J. Zaki, p.74-83] Abstract: Keywords in the ACM Digital Library and IEEE Xplore digital library and in NSF grants anticipate future CS research. https://doi.org/10.1145/2500892Summary: [Article Title: A blueprint for building a quantum computer / Rodney Van Meter and Dominic Horsman, p.83-93] Abstract: Quantum computer architecture holds the key to building commercially viable systems. https://doi.org/10.1145/2494568Summary: [Article Title: Can we verify cyber-physical systems?: technical perspective / Rajeev Alur, p.96] https://doi.org/10.1145/2507771.2507782Summary: [Article Title: Formal verification of phase-locked loops using reachability analysis and continuization / Matthias Althoff, Akshay Rajhans, Bruce H. Krogh, Soner Yaldiz, and Xin Li, p.97-104] Abstract: We present a scalable and formal technique to verify locking time and stability for charge-pump phase-locked loops (PLLs). In contrast to the traditional simulation approach that only validates the PLL at a given operation condition, our proposed technique formally verified the PLL at all possible operation conditions. The dynamics of the PLL is described by a hybrid automaton, which incorporates the differential equations of the analog circuit elements as well as the switching logic of the digital circuit elements. Existing methods for computing reachable sets for hybrid automata cannot be used to verify the PLL model due to the large number of cycles required for locking. We develop a new method for computing effective overapproximations of the sets of states reached on each cycle by using uncertain parameters in a discrete-time model to represent the range of possible switching times, a technique we call continuization. Using this new method for reachability analysis, it is possible to verify locking specifications for a charge-pump PLL design for all possible initial states and parameter values in time comparable to the time required for a few simulation runs of the same behavioral model. https://doi.org/10.1145/2507771.2507783Summary: [Article Title: Future Tense: Quantum Precog / Brian Clegg, p.112] Abstract: From the intersection of computational science and technological speculation, with boundaries limited only by our ability to imagine what could be. Spared a horrible death, it was murder just the same. https://doi.org/10.1145/2507771.2507784
Item type: Serials
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Home library Collection Shelving location Call number Copy number Status Date due Barcode
Serials Serials LRC - Main
National University - Manila
Gen. Ed. - CCIT Periodicals Communications of the ACM, Vol. 56, No. 10, October 2013 (Browse shelf (Opens below)) c.1 Available PER000000929

Includes bibliographical references.

On the future of ACM -- Revisiting the tragedy of the commons -- Deep accountability, beyond even liability -- Helping scientists, engineers to work up to 100 times faster -- Tuning in to graphene -- Making the internet safe for gadgets -- Software helps linguists reconstruct, decipher ancient languages -- The Alan Turing Year leaves a rich legacy -- Evaluating a startup venture -- Evaluating a startup venture -- The naming of hosts is a difficult matter -- Controlling for cybersecurity risks of medical device software -- Beyond efficiency -- Barbarians at the gateways -- Online algorithms in high-frequency trading -- Passively measuring TCP round-trip times -- Implementing the argument web -- Trends in computer science research -- A blueprint for building a quantum computer -- Can we verify cyber-physical systems?: technical perspective -- Formal verification of phase-locked loops using reachability analysis and continuization -- Future Tense: Quantum Precog.

[Article Title: On the future of ACM / John White, p.5]

https://doi.org/10.1145/2507771.2507772

[Article Title: Revisiting the tragedy of the commons / Vinton G. Cerf, p.7]

https://doi.org/10.1145/2507771.2507773

[Article Title: Deep accountability, beyond even liability / CACM Staff, p.8-9]

https://doi.org/10.1145/2507771.2507774

[Article Title: Helping scientists, engineers to work up to 100 times faster / Philip Guo, p. 12- 13]

Abstract: The Communications Web site, http://cacm.acm.org, features more than a dozen bloggers in the BLOG@CACM community. In each issue of Communications, we'll publish selected posts or excerpts.

https://doi.org/10.1145/2507771.2507775

[Article Title: Tuning in to graphene / Alex Wright, p.15-17]

Abstract: New ultra-fast wireless antennas may be on the way, but don't throw away your old wireless router just yet.

https://doi.org/10.1145/2507771.2507776

[Article Title: Making the internet safe for gadgets / Tom Geller, p.18-20]

Abstract: Initiatives favor direct connections, named resources, and cryptography.

https://doi.org/10.1145/2507771.2507777

[Article Title: Software helps linguists reconstruct, decipher ancient languages / Paul Hyman, p.21-23]

Abstract: Linguists who once spent an entire career reconstructing a major language family now can accomplish that in just a few hours.

https://doi.org/10.1145/2507771.2507778

[Article Title: The Alan Turing Year leaves a rich legacy / Sarah Underwood, p.24-25]

Abstract: A year-long celebration of the life and work of a man whom many call the founding father of computer science.

https://doi.org/10.1145/2507771.2507785

[Article Title: Evaluating a startup venture / Michael A. Cusumano, p.26-29]

Abstract: Considering the key elements of successful startups.

https://doi.org/10.1145/2505337

[Article Title: When faster is slower / Phillip G. Armour, p.30-32]

Abstract: How the speed of modern tools may decelerate development.

https://doi.org/10.1145/2505338

[Article Title: The naming of hosts is a difficult matter / George V. Neville-Neil, p. 33-34]

Abstract: Also, the perils of premature rebooting.

https://doi.org/10.1145/2505339

[Article Title: Controlling for cybersecurity risks of medical device software / Kevin Fu, and James Blum, p.35-37]

Abstract: Medical device hacking is a red herring. But the flaws are real.

https://doi.org/10.1145/2508701

[Article Title: Beyond efficiency / David H. Ackley, p.38-40]

Abstract: Esteem for efficiency should be tempered with respect for robustness.

https://doi.org/10.1145/2505340

[Article Title: Barbarians at the gateways / Jacob Loveless, p.42-49]

Abstract: A special section on high-frequency trading and exchange technology.

https://doi.org/10.1145/2507771.2507779

[Article Title: Online algorithms in high-frequency trading / Rolf Waeber, p.50-56]

Abstract: The challenges faced by competing HFT algorithms.

https://doi.org/10.1145/2507771.2507780

[Article Title: Passively measuring TCP round-trip times / Stephen D. Strowes, p.57-64]

Abstract: A close look at round-trip time measurements with the Transmission Control Protocol.

https://doi.org/10.1145/2507771.2507781

[Article Title: Implementing the argument web / Floris Bex, John Lawrence, Mark Snaith, and Chris Reed, p.66-73]

Abstract: Improve online public discourse by connecting opinions across blogs, editorials, and social media.

https://doi.org/10.1145/2500891

[Article Title: Trends in computer science research / Apirak Hoonlor, Boleslaw K. Szymanski, and Mohammed J. Zaki, p.74-83]

Abstract: Keywords in the ACM Digital Library and IEEE Xplore digital library and in NSF grants anticipate future CS research.

https://doi.org/10.1145/2500892

[Article Title: A blueprint for building a quantum computer / Rodney Van Meter and Dominic Horsman, p.83-93]

Abstract: Quantum computer architecture holds the key to building commercially viable systems.

https://doi.org/10.1145/2494568

[Article Title: Can we verify cyber-physical systems?: technical perspective / Rajeev Alur, p.96]

https://doi.org/10.1145/2507771.2507782

[Article Title: Formal verification of phase-locked loops using reachability analysis and continuization / Matthias Althoff, Akshay Rajhans, Bruce H. Krogh, Soner Yaldiz, and Xin Li, p.97-104]

Abstract: We present a scalable and formal technique to verify locking time and stability for charge-pump phase-locked loops (PLLs). In contrast to the traditional simulation approach that only validates the PLL at a given operation condition, our proposed technique formally verified the PLL at all possible operation conditions. The dynamics of the PLL is described by a hybrid automaton, which incorporates the differential equations of the analog circuit elements as well as the switching logic of the digital circuit elements. Existing methods for computing reachable sets for hybrid automata cannot be used to verify the PLL model due to the large number of cycles required for locking. We develop a new method for computing effective overapproximations of the sets of states reached on each cycle by using uncertain parameters in a discrete-time model to represent the range of possible switching times, a technique we call continuization. Using this new method for reachability analysis, it is possible to verify locking specifications for a charge-pump PLL design for all possible initial states and parameter values in time comparable to the time required for a few simulation runs of the same behavioral model.

https://doi.org/10.1145/2507771.2507783

[Article Title: Future Tense: Quantum Precog / Brian Clegg, p.112]

Abstract: From the intersection of computational science and technological speculation, with boundaries limited only by our ability to imagine what could be. Spared a horrible death, it was murder just the same.

https://doi.org/10.1145/2507771.2507784

There are no comments on this title.

to post a comment.

© 2021 NU LRC. All rights reserved.Privacy Policy I Powered by: KOHA