TL;DR: The Revised Edition of Shift Register Sequences contains a comprehensive bibliography of some 400 entries which cover the literature concerning the theory and applications of shift register sequences.
Abstract: From the Publisher:
Shift register sequences are used in a broad range of applications, particularly in random number generation, multiple access and polling techniques, secure and privacy communication systems, error detecting and correcting codes, and synchronization pattern generation, as well as in modern cryptographic systems. The first edition of Shift Register Sequences, published in 1967, has been for many years the definitive work on this subject. In the revised edition, Dr. Golomb has added valuable supplemental material. The Revised Edition contains a comprehensive bibliography of some 400 entries which cover the literature concerning the theory and applications of shift register sequences. Written in a clear and lucid style, Dr. Golomb's approach is completely mathematical with rigorous proofs of all assertions. The proofs, however, may be omitted without loss of continuity by the reader who is interested only in results. Dr. Golomb is considered one of the foremost experts in the world with respect to combinatorial and geometrical aspects of coded communications.
TL;DR: Text sentiment extracted from social media posts can be used to predict public opinion trends and consumer confidence.
Abstract: We connect measures of public opinion measured from polls with sentiment measured from text. We analyze several surveys on consumer confidence and political opinion over the 2008 to 2009 period, and find they correlate to sentiment word frequencies in contempora- neous Twitter messages. While our results vary across datasets, in several cases the correlations are as high as 80%, and capture important large-scale trends. The re- sults highlight the potential of text streams as a substi- tute and supplement for traditional polling. consumer confidence and political opinion, and can also pre- dict future movements in the polls. We find that temporal smoothing is a critically important issue to support a suc- cessful model.
TL;DR: 1. Introduction to Queuing Theory, Layered Architectures in Data Networks, and The Evolution toward Integrated Networks.
Abstract: 1. Introduction and Overview. 2. Introduction to Queuing Theory. 3. Layered Architectures in Data Networks. 4. Data Link Layer. 5. Examples and Performance Analysis. 6. Network Layer: Flow Control and Congestion Control. 7. Network Layer: Routing Function Transport Layer. 8. Polling and Random Access in Data Networks. 9. Local Area Networks. 10. Introduction to Circuits Switching. 11. Call Processing in Digital Circuit-switching Systems. 12. The Evolution toward Integrated Networks.
TL;DR: This work investigates design issues for access networks based on passive optical network technology and proposes an interleaved polling algorithm called IPACT and a scheme for in-band signaling that allows using a single wavelength for both downstream data and control message transmission.
Abstract: We investigate design issues for access networks based on passive optical network technology. A PON based on polling, with data encapsulated in Ethernet frames, possesses many desirable qualities, such as dynamic bandwidth distribution, use of a single downstream and a single upstream wavelength, ability to provision a fractional wavelength capacity to each user, and ease of adding a new user. To support dynamic bandwidth distribution, we propose an interleaved polling algorithm called IPACT. We also suggest a scheme for in-band signaling that allows using a single wavelength for both downstream data and control message transmission. To obtain realistic simulation results, we generated synthetic traffic that exhibits the properties of self-similarity and long-range dependence. We then analyzed the network performance under varying offered loads.
TL;DR: This work proposes a self-regulating system where the P2P network is used to implement a robust reputation mechanism, and a distributed polling algorithm by which resource requestors can assess the reliability of a resource offered by a participant before initiating the download.
Abstract: Peer-to-peer (P2P) applications have seen an enormous success, and recently introduced P2P services have reached tens of millions of users. A feature that significantly contributes to the success of many P2P applications is user anonymity. However, anonymity opens the door to possible misuses and abuses, exploiting the P2P network as a way to spread tampered with resources, including Trojan Horses, viruses, and spam. To address this problem we propose a self-regulating system where the P2P network is used to implement a robust reputation mechanism. Reputation sharing is realized through a distributed polling algorithm by which resource requestors can assess the reliability of a resource offered by a participant before initiating the download. This way, spreading of malicious contents will be reduced and eventually blocked. Our approach can be straightforwardly piggybacked on existing P2P protocols and requires modest modifications to current implementations.