1  20
Next
Number of results to display per page
1. Information and communication theory [2019]
 Höst, Stefan, author.
 Piscataway, New Jersey : IEEE Press, [2019] [Piscataqay, New Jersey] : IEEE Xplore, [2019]
 Description
 Book — 1 online resource (368 pages).
 Summary

 Preface ix
 Chapter 1 Introduction 1
 Chapter 2 Probability Theory 5
 2.1 Probabilities 5
 2.2 Random Variable 7
 2.3 Expectation and Variance 9
 2.4 The Law of Large Numbers 17
 2.5 Jensen's Inequality 21
 2.6 Random Processes 25
 2.7 Markov Process 28
 Problems 33
 Chapter 3 Information Measures 37
 3.1 Information 37
 3.2 Entropy 41
 3.3 Mutual Information 48
 3.4 Entropy of Sequences 58
 Problems 63
 Chapter 4 Optimal Source Coding 69
 4.1 Source Coding 69
 4.2 Kraft Inequality 71
 4.3 Optimal Codeword Length 80
 4.4 Huffman Coding 84
 4.5 Arithmetic Coding 95
 Problems 101
 Chapter 5 Adaptive Source Coding 105
 5.1 The Problem with Unknown Source Statistics 105
 5.2 Adaptive Huffman Coding 106
 5.3 The LempelZiv Algorithms 112
 5.4 Applications of Source Coding 125
 Problems 129
 Chapter 6 Asymptotic Equipartition Property and Channel Capacity 133
 6.1 Asymptotic Equipartition Property 133
 6.2 Source Coding Theorem 138
 6.3 Channel Coding 141
 6.4 Channel Coding Theorem 144
 6.5 Derivation of Channel Capacity for DMC 155
 Problems 164
 Chapter 7 Channel Coding 169
 7.1 ErrorCorrecting Block Codes 170
 7.2 Convolutional Code 188
 7.3 ErrorDetecting Codes 203
 Problems 210
 Chapter 8 Information Measures For Continuous Variables 213
 8.1 Differential Entropy and Mutual Information 213
 8.2 Gaussian Distribution 224
 Problems 232
 Chapter 9 Gaussian Channel 237
 9.1 Gaussian Channel 237
 9.2 Parallel Gaussian Channels 244
 9.3 Fundamental Shannon Limit 256
 Problems 260
 Chapter 10 Discrete Input Gaussian Channel 265
 10.1 MPAM Signaling 265
 10.2 A Note on Dimensionality 271
 10.3 Shaping Gain 276
 10.4 SNR Gap 281
 Problems 285
 Chapter 11 Information Theory and Distortion 289
 11.1 RateDistortion Function 289
 11.2 Limit For Fix Pb 300
 11.3 Quantization 302
 11.4 Transform Coding 306
 Problems 319
 Appendix A Probability Distributions 323
 A.1 Discrete Distributions 323
 A.2 Continuous Distributions 327
 Appendix B Sampling Theorem 337
 B.1 The Sampling Theorem 337
 Bibliography 343
 Index 347.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Parthasarathy, K. R., author.
 Second edition.  New Delhi, India : Hindustan Book Agency, [2013]
 Description
 Book — 1 online resource (176 pages).
 Summary

 Entropy of elementary information sources
 Stationary information sources
 Communication in the presence of noise
 Quantum coding theorems
 Quantum error correction.
(source: Nielsen Book Data)
 Hofkirchner, Wolfgang, 1953
 Singapore ; Hackensack, N.J. : World Scientific Pub. Co., c2013.
 Description
 Book — xvi, 274 p. : ill.
 Summary

 Reductionism Projectivism Disjunctivism Integrativism Evolutionary Systems: Dissipative Systems Autopoietic Systems ReCreative Systems Information Generation: Cognisability Communicability Cooperability Pattern Formation CodeMaking SenseMaking Reflectivity Coherency Cohesiveness Psyche Signalability Organicity Consciousness Languageability Sociability.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online

 www.worldscientific.com World Scientific
 Google Books (Full view)
4. Perspectives on Information [2011]
 New York : Routledge, 2011.
 Description
 Book — viii, 168 pages : illustrations ; 24 cm.
 Summary

 1. Introduction. Magnus Ramage and David Chapman
 2. Competing Models of Information in the History of Cybernetics. Magnus Ramage
 3. 'The Information Revolution': Taking a Long View. Chris Bissell
 4. Information, Meaning and Context. David Chapman
 5. Signs and Signals. John Monk
 6. Fundamentals of Information: Purposeful Activity, Meaning and Conceptualisation. Sue Holwell
 7. Using Information (and Exformation) to Inform Action. Paul Lefrere
 8. Information and Libraries: Impact of Web 2.0. Juanita FosterJones
 9. Three Principles of Information Flow: Conversation as a Dialogue Game. Paul Piwek
 10. Quantum Information. Tony Nixon
 11. Information Policy Making: Developing the Rules of the Road for the Information Society (Or the Anatomy of a Digital Economy Act) Ray Corrigan
 12. Conclusion. David Chapman and Magnus Ramage.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
Q360 .P387 2011  Available 
 Burgin, Mark.
 Singapore ; Hackensack, N.J. : World Scientific Pub. Co., c2010.
 Description
 Book — xvi, 672 p. : ill.
 Summary

 How Do We Know What Information Is? Information in Society, Information in Nature, Technological Aspects of Information General Theory of Information: Information Ontology, Information Axiology, Information Typology Information, Data, and Knowledge Emotions and Information Statistical Information Theory: Information and Entropy, Information and Communication in Technical Systems, Quantum Information, Information and Problem Solving, Axiomatization of Information Measurement, Information in Physics Semantic Information Theory: The Three Dimensions of Information, Logic in Information, Knowledge from Information Algorithmic Information Theory: Information and Complexity, Recursive Algorithmic Information Theory, Inductive Algorithmic Information Theory, Relative Information Measures, Axiomatic Information Measures Pragmatic Information Theory: Economic Approach, MissionOriented Approach and Value of Information, Transformational Approach, Dynamics of Information: Information Flow, Operator Approach, Information Algebra.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
6. Advances in Nonlinear Speech Processing [2008]
 Chetouani, Mohamed.
 4885th ed.  Berlin : Springer, 2008.
 Description
 Book — 1 online resource (291 pages)
 Summary

 NonLinear and NonConventional Techniques. PhaseBased Methods for Voice Source Analysis. Some Experiments in AudioVisual Speech Processing. Exploiting Nonlinearity in Adaptive Signal Processing. Speech Synthesis. Mixing HMMBased Spanish Speech Synthesis with a CBR for Prosody Estimation. Objective and Subjective Evaluation of an Expressive Speech Corpus. Speaker Recognition. On the Usefulness of Linear and Nonlinear Prediction Residual Signals for Speaker Recognition. Multi Filter Bank Approach for Speaker Verification Based on Genetic Algorithm. Speaker Recognition Via Nonlinear Phonetic and SpeakerDiscriminative Features. PerceptronBased Class Verification. Speech Recognition. Manifold LearningBased Feature Transformation for Phone Classification. Word Recognition with a Hierarchical Neural Network. Hybrid Models for Automatic Speech Recognition: A Comparison of Classical ANN and Kernel Based Methods. Towards PhoneticallyDriven Hidden Markov Models: Can We Incorporate Phonetic Landmarks in HMMBased ASR?. A Hybrid GeneticNeural FrontEnd Extension for Robust Speech Recognition over Telephone Lines. Efficient Viterbi Algorithms for Lexical Tree Based Models. Speech Analysis. Nonstationary Selfconsistent Acoustic Objects as Atoms of Voiced Speech. The Hartley Phase Cepstrum as a Tool for Signal Analysis. Voiced Speech Analysis by Empirical Mode Decomposition. Estimation of Glottal Closure Instances from Speech Signals by Weighted Nonlinear Prediction. Quantitative Perceptual Separation of Two Kinds of Degradation in Speech Denoising Applications. Exploitation of nonlinear techniques. An Efficient VAD Based on a Generalized Gaussian PDF. Estimating the Dispersion of the Biometric Glottal Signature in Continuous Speech. Trajectory Mixture Density Networks with Multiple Mixtures for AcousticArticulatory Inversion. Application of Feature Subset Selection Based on Evolutionary Algorithms for Automatic Emotion Recognition in Speech.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
7. Attention in Cognitive Systems [2008]
 Paletta, Lucas.
 4840th ed.  Berlin : Springer, 2008.
 Description
 Book — 1 online resource (505 pages)
 Summary

 Embodiment of Attention. The Embodied Dynamics of Emotion, Appraisal and Attention. The Role of Attention in Creating a Cognitive System. The Influence of the Body and Action on Spatial Attention. Abstraction Level Regulation of Cognitive Processing Through EmotionBased Attention Mechanisms. Embodied Active Vision in Language Learning and Grounding. Language Label Learning for Visual Concepts Discovered from Video Sequences. Cognitive Control of Attention. Learning to Attend  From BottomUp to TopDown. An Attentional System Combining TopDown and BottomUp Influences. The Selective Attention for Identification Model (SAIM): Simulating Visual Search in Natural Colour Images. A Bayesian Approach to Attention Control and Concept Abstraction. Modeling of Saliency and Visual Search. An Information Theoretic Model of Saliency and Visual Search. An Experimental Comparison of Three Guiding Principles for the Detection of Salient Image Locations: Stability, Complexity, and Discrimination. A Protoobject Based Visual Attention Model. Context Driven Focus of Attention for Object Detection. Color Saliency and Inhibition Using Static and Dynamic Scenes in Region Based Visual Attention. I See What You See: Eye Movements in RealWorld Scenes Are Affected by Perceived Direction of Gaze. Sequential Attention. Selective Attention in the Learning of Viewpoint and Position Invariance. Generating Sequence of Eye Fixations Using DecisionTheoretic Attention Model. Reinforcement Learning for Decision Making in Sequential Visual Attention. Biologically Inspired Framework for Learning and Abstract Representation of Attention Control. Biological Aspects of Attention. Modeling the Dynamics of Feature Binding During ObjectSelective Attention. The Spiking Search over Time and Space Model (sSoTS): Simulating Dual Task Experiments and the Temporal Dynamics of Preview Search. On the Role of Dopamine in Cognitive Vision. Differences and Interactions Between Cerebral Hemispheres When Processing Ambiguous Words. Attention in Early Vision: Some Psychophysical Insights. Auditory Gist Perception: An Alternative to Attentional Selection of Auditory Streams?. Applications of Attentive Vision. Simultaneous Robot Localization and Mapping Based on a Visual Attention System. Autonomous Attentive Exploration in Search and Rescue Scenarios. AttentionBased Landmark Selection in Autonomous Robotics. Simulation and Formal Analysis of Visual Attention in Cognitive Systems. RegionOriented Visual Attention Framework for Activity Detection. Autonomous Attentive Exploration in Search and Rescue Scenarios.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Yeung, Raymond W., 1962
 New York : Springer, 2008.
 Description
 Book — xx, 579 p. : ill.
 Summary

 pt.
 1. Components of information theory
 pt.
 2. Fundamentals of network coding.
 Cervesato, Iliano.
 4846th ed.  Berlin : Springer, 2007.
 Description
 Book — 1 online resource (321 pages)
 Summary

 Invited Speaker: Andrei Sabelfeld. Dimensions of Declassification in Theory and Practice. A Static Birthmark of Binary Executables Based on API Call Structure. Compiling C Programs into a Strongly Typed Assembly Language. Information Flow Testing. Large Scale Simulation of Tor:. Privacy Enhancing Credentials. Browser Based Agile EVoting System. Risk Balance in Exchange Protocols. Scalable DRM System for Media Portability. Computational Semantics for Basic Protocol Logic  A Stochastic Approach. Management Advantages of Object Classification in RoleBased Access Control (RBAC). An Integrated Model for Access Control and Information Flow Requirements. Digital Rights Management Using a Master Control Device. Invited Speaker: Joshua Guttman. How to do Things with Cryptographic Protocols. A Formal Analysis for Capturing Replay Attacks in Cryptographic Protocols. An Abstraction and Refinement Framework for Verifying Security Protocols Based on Logic Programming. Secure Verification of Location Claims with Simultaneous Distance Modification. Invited Speaker: Kazuhiko Kato. Modeling and Virtualization for Secure Computing Environments. Empirical Study of the Impact of MetasploitRelated Attacks in 4 Years of Attack Traces. A Logical Framework for Evaluating Network Resilience Against Faults and Attacks. Masquerade Detection Based Upon GUI User Profiling in Linux Systems. OneTime Receiver Address in IPv6 for Protecting Unlinkability. A Comprehensive Approach to Detect Unknown Attacks Via Intrusion Detection Alerts. Combining Heterogeneous Classifiers for Network Intrusion Detection. Managing Uncertainty in Access Control Decisions in Distributed Autonomous Collaborative Environments. On RunTime Enforcement of Policies. Static vs Dynamic Typing for Access Control in PiCalculus. A Sandbox with a Dynamic Policy Based on Execution Contexts of Applications.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
10. Algorithms and Computation [2007]
 Tokuyama, Takeshi.
 4835th ed.  Berlin : Springer, 2007.
 Description
 Book — 1 online resource (943 pages)
 Summary

 Invited Talk. Modeling and Analyzing Massive Terrain Data Sets. Coloring TriangleFree Graphs on Surfaces. Best Paper Award Presentation. Integer Representation and Counting in the Bit Probe Model. 1A Graph Algorithms I. Minimum Degree Orderings. Greedy Approximation for Source Location Problem with VertexConnectivity Requirements in Undirected Graphs. Dynamic Distance Hereditary Graphs Using Split Decomposition. Unifying Two Graph Decompositions with Modular Decomposition. 1B Computational Geometry I. Escaping OffLine Searchers and a Discrete Isoperimetric Theorem. Geometric Spanner of Segments. DilationOptimal Edge Deletion in Polygonal Cycles. 2A Complexity I. UnboundedError Classical and Quantum Communication Complexity. A Spectral Method for MAX2SAT in the Planted Solution Model. On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices. The 1Versus2 Queries Problem Revisited. 2B Graph Drawing. Approximating the Crossing Number of Toroidal Graphs. WidthOptimal Visibility Representations of Plane Graphs. Computing Upward Topological Book Embeddings of Upward Planar Digraphs. Algorithms for the Hypergraph and the Minor Crossing Number Problems. 3A Distributed Algorithms. On Mixing and Edge Expansion Properties in Randomized Broadcasting. Linear Reconfiguration of CubeStyle Modular Robots. Fast Message Dissemination in Random Geometric AdHoc Radio Networks. Sensor Network Gossiping or How to Break the Broadcast Lower Bound. On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem. 3B Optimization I. Capacitated Domination Problem. The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. New Bounds for the Nearly Equitable Edge Coloring Problem. Approximation to the Minimum Cost Edge Installation Problem. Approximability of Packing Disjoint Cycles. 4A Data Structure I. Succinct Representation of Labeled Graphs. More Efficient Algorithms and Analyses for Unequal Letter Cost PrefixFree Coding. Kinetic Maintenance of Mobile kCentres on Trees. Checking ValueSensitive Data Structures in Sublinear Space. 4B Game Theory. Manipulation in Games. Using Nash Implementation to Achieve Better Frugality Ratios. The Price of Nash Equilibria in Multicast Transmissions Games. 5A Database Applications. An Efficient Algorithm for Enumerating Pseudo Cliques. Fast Adaptive Diagnosis with a Minimum Number of Tests. Dynamic Structures for Topk Queries on Uncertain Data. Separating Populations with Wide Data: A Spectral Analysis. 5B Online Algorithms. A ConstantCompetitive Algorithm for Online OVSF Code Assignment. AverageCase Analysis of Online Topological Ordering. Energy Efficient Deadline Scheduling in Two Processor Systems. On the Relative Dominance of Paging Algorithms. 6A I/O Algorithms. I/OEfficient Map Overlay and Point Location in LowDensity Subdivisions. Geometric Streaming Algorithms with a Sorting Primitive. External Memory Range Reporting on a Grid. Approximate Range Searching in External Memory. 6B Networks. Faster Treasure Hunt and Better Strongly Universal Exploration Sequences. Hardness and Approximation of Traffic Grooming. Depth of Field and CautiousGreedy Routing in Social Networks. Locating Facilities on a Network to Minimize Their Average Service Radius. 7A Optimization II. Faster Combinatorial Algorithms for Determinant and Pfaffian. A PolynomialTimeDelay and PolynomialSpace Algorithm for Enumeration Problems in Multicriteria Optimization. The Parameterized Complexity of the Unique Coverage Problem. Bounded TreeWidth and CSPRelated Problems. 7B Computational Geometry II. Covering Points by Unit Disks of Fixed Location. Geodesic Disks and Clustering in a Simple Polygon. An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane. Optimal Triangulation with Steiner Points. 8A Geometric Applications. New Algorithm for Field Splitting in Radiation Therapy. InPlace Algorithm for Image Rotation. Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction. 8B Data Structures II. Distributed Relationship Schemes for Trees. Fast Evaluation of UnionIntersection Expressions. A Subcubic Time Algorithm for the kMaximum Subarray Problem. 9A Computational Geometry III. Compressing Spatiotemporal Trajectories. Finding Popular Places. Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations. 9B Complexity II. The Monomial Ideal Membership Problem and Polynomial Identity Testing. On the Fault Testing for Reversible Circuits. The Space Complexity of kTree Isomorphism. 10A String. Algorithms for Computing the LengthConstrained MaxScore Segments with Applications to DNA Copy Number Data Analysis. Space Efficient Indexes for String Matching with Don't Cares. 2Stage Fault Tolerant Interval Group Testing. Approximate String Matching with Swap and Mismatch. 10B Graph Algorithms II. Minimum FillIn and Treewidth of Split+?ke and Split+?kv Graphs. Weighted Treewidth Algorithmic Techniques and Results. Spanning Trees with Many Leaves in Regular Bipartite Graphs. Problem Kernels for NPComplete Edge Deletion Problems: Split and Related Graphs.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
11. Algorithms and Models for the WebGraph [2007]
 Bonato, Anthony.
 4863th ed.  Berlin : Springer, 2007.
 Description
 Book — 1 online resource (224 pages)
 Summary

 Bias Reduction in Traceroute Sampling  Towards a More Accurate Map of the Internet. Distribution of PageRank Mass Among Principle Components of the Web. Finding a DenseCore in Jellyfish Graphs. A Geometric Preferential Attachment Model of Networks II. Clustering Social Networks. ManipulationResistant Reputations Using Hitting Time. Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model. A Spatial Web Graph Model with Local Influence Regions. Determining Factors Behind the PageRank LogLog Plot. Approximating Betweenness Centrality. Random Dot Product Graph Models for Social Networks. Local Computation of PageRank Contributions. Local Partitioning for Directed Graphs Using PageRank. Stochastic Kronecker Graphs. Deterministic Decentralized Search in Random Graphs. Using Bloom Filters to Speed Up HITSLike Ranking Algorithms. Parallelizing the Computation of PageRank. Giant Component and Connectivity in Geographical Threshold Graphs.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Janowski, Tomasz.
 4882th ed.  Berlin : Springer, 2007.
 Description
 Book — 1 online resource (356 pages)
 Summary

 Section 1  Network Protocols. TimeEfficient Broadcasting in Radio Networks: A Review. An Efficient and Optimized Bluetooth Scheduling Algorithm for Piconets. EETO: An EnergyEfficient TargetOriented Clustering Protocol in Wireless Sensor Networks. On the Design of MobilityTolerant TDMABased Media Access Control (MAC) Protocol for Mobile Sensor Networks. Selfstabilizing Routing Algorithms for Wireless AdHoc Networks. A Structured Mesh Overlay Network for P2P Applications on Mobile Ad Hoc Networks. A Scalable and Adaptive Clustering Scheme for MANETs.
 Section 2  Security and Privacy. A Key Establishment Scheme for LargeScale Mobile Wireless Sensor Networks. Monitoring Information Leakage During Query Aggregation. An Efficient Certificate Authority for Ad Hoc Networks. Design and Analysis of a Game Theoretic Model for P2P Trust Management. Hasslefree: Simplified Access Control Management for XML Documents. LISA: LIghtweight Security Algorithm for Wireless Sensor Networks.
 Section 3  Network Management. An Optimal WeightedAverage Congestion Based Pricing Scheme for Enhanced QoS. Distributed Resource Adaptation for Virtual Network Operators. Maximum Lifetime Tree Construction for Wireless Sensor Networks. Overlay Network Management for Scheduling Tasks on the Grid.
 Section 4  Network Services. An EndSystems Supported Highly Distributed Content Delivery Network. An Analytical Estimation of Durability in DHTs. A Multiple Tree Approach for Fault Tolerance in MPLS Networks. Selective Querying and Other Proposals for a Less Congested Gnutella Network.
 Section 5  eApplication Engineering. Language Support and Compiler Optimizations for STM and Transactional Boosting. Unifying Denotational Semantics with Operational Semantics for Web Services. PHAC: An Environment for Distributed Collaborative Applications on P2P Networks. Webformer: A Rapid Application Development Toolkit for Writing Ajax Web Form Applications.
 Section 6  eApplication Services. Continuous Adaptive Mining the Thin Skylines over Evolving Data Stream. Service Recommendation with Adaptive User Interests Modeling. An Approach to Aggregating Web Services for EndUserDoable Construction of GridDoc Application. An Adaptive Metadata Model for DomainSpecific Service Registry.
 Section 7  eApplications. Globalization from the Information and Communication Perspective. WAND: A Robust P2P File System Tree Interface. A Tsunami Warning System Employing Level Controlled Gossiping in Wireless Sensor Networks. Relation Extraction and Validation Algorithm. A FairExchange and CustomerAnonymity Electronic Commerce Protocol for Digital Content Transactions. A Practical Way to Provide Perfect Forward Secrecy for Secure EMail Protocols. Augmentation to GT4 Framework for B2B Collaboration over Grid.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
13. FSTTCS 2007 [2007]
 Arvind, V.
 4855th ed.  Berlin : Springer, 2007.
 Description
 Book — 1 online resource (569 pages)
 Summary

 Invited Papers. The Multicore Revolution. Streaming Algorithms for Selection and Approximate Sorting. Adventures in Bidirectional Programming. Program Analysis Using Weighted Pushdown Systems. The Complexity of Zero Knowledge. Contributed Papers. The Priority kMedian Problem. "RentorBuy" Scheduling and Cost Coloring Problems. Order Scheduling Models: Hardness and Algorithms. On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography. Key Substitution in the Symbolic Analysis of Cryptographic Protocols. Symbolic Bisimulation for the Applied Pi Calculus. Nonmitotic Sets. Reductions to Graph Isomorphism. Strong Reductions and Isomorphism of Complete Sets. Probabilistic and Topological Semantics for Timed Automata. A Theory for Game Theories. An Incremental Bisimulation Algorithm. Logspace Algorithms for Computing Shortest and Longest Paths in SeriesParallel Graphs. Communication Lower Bounds Via the Chromatic Number. The Deduction Theorem for Strong Propositional Proof Systems. Satisfiability of Algebraic Circuits over Sets of Natural Numbers. Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems. Synthesis of Safe MessagePassing Systems. Automata and Logics for Timed Message Sequence Charts. Propositional Dynamic Logic for MessagePassing Systems. Better Algorithms and Bounds for Directed Maximum Leaf Problems. Faster Algorithms for AllPairs Small Stretch Distances in Weighted Graphs. Covering Graphs with Few Complete Bipartite Subgraphs. Safely Composing Security Protocols. Computationally Sound Typing for Noninterference: The Case of Deterministic Encryption. Bounding Messages for Free in Security Protocols. Triangulations of Line Segment Sets in the Plane. Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures. Compressed Dynamic Tries with Applications to LZCompression in Sublinear Time and Space. Stochastic Muller Games are PSPACEComplete. Solving Parity Games in Big Steps. Efficient and Expressive Tree Filters. Markov Decision Processes with Multiple LongRun Average Objectives. A Formal Investigation of Diff3. Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. Undirected Graphs of Entanglement 2. Acceleration in Convex DataFlow Analysis. Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths. Closures and Modules Within Linear Logic Concurrent Constraint Programming.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
14. Membrane Computing [2007]
 Eleftherakis, George.
 4860th ed.  Berlin : Springer, 2007.
 Description
 Book — 1 online resource (461 pages)
 Summary

 Invited Lectures. Psim: A Computational Platform for Metabolic P Systems. Modeling the Dynamics of HIV Infection with ConformonP Systems and Cellular Automata. (UREM) P Systems with a QuantumLike Behavior: Background, Definition, and Computational Power. The Calculus of Looping Sequences for Modeling Biological Membranes. Membrane Computing in Connex Environment. Regular Papers. Skin Output in P Systems with Minimal Symport/Antiport and Two Membranes. On the Reachability Problem in P Systems with Mobile Membranes. Modeling Symport/Antiport P Systems with a Class of Hierarchical Petri Nets. A Hybrid Approach to Modeling Biological Systems. Causality in Membrane Systems. Simulating the Bitonic Sort Using P Systems. On the Number of Agents in P Colonies. Events, Causality, and Concurrency in Membrane Systems. P Systems with String Objects and with Communication by Request. On the Dynamics of PB Systems with Volatile Membranes. A Logarithmic Bound for Solving Subset Sum with P Systems. A Formal Framework for Static (Tissue) P Systems. ConformonP Systems with Negative Values. Optimizing Evolution Rules Application and Communication Times in Membrane Systems Implementation. Hill Kinetics Meets P Systems: A Case Study on Gene Regulatory Networks as Computing Agents in silico and in vivo. Solving Numerical NPComplete Problems with Spiking Neural P Systems. Towards a Complete Covering of SBML Functionalities. Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P. Balancing Performance, Flexibility, and Scalability in a Parallel Computing Platform for Membrane Computing Applications. On FlipFlop Membrane Systems with Proteins. Characterizing Membrane Structures Through Multiset Tree Automata. OPERAS CC : An Instance of a Formal Framework for MAS Modeling Based on Population P Systems.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
15. Principles of Distributed Systems [2007]
 Tovar, Eduardo.
 Berlin : Springer, 2007.
 Description
 Book — 1 online resource (468 pages)
 Summary

 A Decentralized, Scalable, and Autonomous Grid Monitoring System. A Formal Analysis of the Deferred Update Technique. ASAP: A Camera Sensor Network for Situation Awareness. Asynchronous Active Recommendation Systems. BruteForce Determination of Multiprocessor Schedulability for Sets of Sporadic HardDeadline Tasks. Byzantine Consensus with Few Synchronous Links. Clock Synchronization in the ByzantineRecovery Failure Model. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. Deterministic Communication in the Weak Sensor Model. Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System. Distance Sensitive Snapshots in Wireless Sensor Networks. Distributed Approximation Algorithms for Finding 2EdgeConnected Subgraphs. Does Clock Precision Influence ZigBee's Energy Consumptions?. From an Intermittent Rotating Star to a Leader. Global DeadlineMonotonic Scheduling of ArbitraryDeadline Sporadic Task Systems. LFthreads: A LockFree Thread Library. Making Distributed Applications Robust. Maximizing the Number of Broadcast Operations in Static Random Geometric AdHoc Networks. NConsensus is the Second Strongest Object for N?+?1 Processes. NonSearchability of Random PowerLaw Graphs. O(logn)Time Overlay Network Construction from Graphs with OutDegree 1. On the Selfstabilization of Mobile Robots in Graphs. Peer to Peer Multidimensional Overlays: Approximating Complex Structures. Secretive Birds: Privacy in Population Protocols. Selfstabilizing and ByzantineTolerant Overlay Network. Separability to Help Parallel Simulation of Distributed Computations. SmallWorld Networks: From Theoretical Bounds to Practical Systems. The Anonymous Consensus Hierarchy and Naming Problems. The Baskets Queue. The Cost of Monotonicity in Distributed Graph Searching. Timed Quorum Systems for LargeScale and Dynamic Environments. Worm Versus Alert: Who Wins in a Battle for Control of a LargeScale Network?.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
16. Sequences, Subsequences, and Consequences [2007]
 Golomb, Solomon W.
 4893th ed.  Berlin : Springer, 2007.
 Description
 Book — 1 online resource (225 pages)
 Summary

 Periodic Binary Sequences: Solved and Unsolved Problems. On Boolean Functions Which Are Bent and Negabent. Strongly Primitive Elements. The Perfect Binary Sequence of Period 4 for Low Periodic and Aperiodic Autocorrelations. On the Dual of Monomial Quadratic pary Bent Functions. A New Family of GoldLike Sequences. Sequencings and Directed Graphs with Applications to Cryptography. Double Periodic Arrays with Optimal Correlation for Applications in Watermarking. Sequences for PhaseEncoded Optical CDMA. Packing Centrosymmetric Patterns of n Nonattacking Queens on an nxn Board. Cyclotomic Mapping Permutation Polynomials over Finite Fields. SingleTrack Gray Codes and Sequences. The Asymptotic Behavior of ?Adic Complexity with ?2?=???2. Shannon Capacity Limits of Wireless Networks. Some Mysterious Sequences Associated with LDPC Codes. Remarks on a Sequence of Minimal Niven Numbers. The Linear Vector Space Spanned by the Nonlinear Filter Generator. Existence of Modular Sonar Sequences of TwinPrime Product Length. Randomness and Representation of Span n Sequences. On Attacks on Filtering Generators Using Linear Subspace Structures.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
17. Applications and Theory of Petri Nets 2005 [2005]
 International Conference on Applications and Theory of Petri Nets (26th : 2005 : Miami, Fl.
 3536th ed.  Berlin : Springer, 2005.
 Description
 Book — 1 online resource (484 pages)
 Summary

 Invited Papers. Expressiveness and Efficient Analysis of Stochastic WellFormed Nets. Applications of Craig Interpolation to Model Checking. Towards an Algebra for Security Policies. Continuization of Timed Petri Nets: From Performance Evaluation to Observation and Control. Full Papers. Genetic Process Mining. The (True) Concurrent Markov Property and Some Applications to Markov Nets. On the Equivalence Between Liveness and DeadlockFreeness in Petri Nets. Extremal Throughputs in FreeChoice Nets. A Framework to Decompose GSPN Models. Modeling Dynamic Architectures Using NetsWithinNets. A High Level Language for Structural Relations in WellFormed Nets. Derivation of Nonstructural Invariants of Petri Nets Using Abstract Interpretation. Modeling Multivalued Genetic Regulatory Networks Using HighLevel Petri Nets. Termination Properties of TCP's Connection Management Procedures. Soundness of ResourceConstrained Workflow Nets. HighLevel Nets with Nets and Rules as Tokens. Can I Execute My Scenario in Your Net?. Reference and Value Semantics Are Equivalent for Ordinary Object Petri Nets. Particle Petri Nets for Aircraft Procedure Monitoring Under Uncertainty. On the Expressive Power of Petri Net Schemata. Determinate STG Decomposition of Marked Graphs. TimedArc Petri Nets vs. Networks of Timed Automata. Specifying and Analyzing Software Safety Requirements of a Frequency Converter Using Coloured Petri Nets. Achieving a General, Formal and Decidable Approach to the ORJoin in Workflow Using Reset Nets. Tool Papers. The ProM Framework: A New Era in Process Mining Tool Support. High Level Petri Nets Analysis with Helena. Protos 7.0: Simulation Made Accessible.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Lew, Art.
 6th ed.  Berlin : Springer, 2005.
 Description
 Book — 1 online resource (380 pages)
 Summary

 From the contents: Part I Foundations of Data Mining Knowledge Discovery as Translation Mathematical Foundation of Association Rules  Mining Associations by Solving Integral Linear Inequalities Comparative Study of Sequential Pattern Mining Models Designing Robust Regression Models A Probabilistic Logicbased Framework for Characterizing Knowledge Discovery in Databases A Careful Look at the Use of Statistical Methodology in Data Mining Justification and Hypothesis Selection in Data Mining. Part II Methods of Data Mining A Comparative Investigation on Model Selection in Binary Factor Analysis Extraction of Generalized Rules with Automated Attribute Abstraction Decision Making Based on Hybrid of Multiknowledge and Naive Bayes Classifier FirstOrder Logic Based Formalism for Temporal Data Mining An Alternative Approach to Mining Association Rules. Part III General Knowledge Discovery Posting Act Tagging Using TransformationBased Learning.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 MacKay, David J. C.
 Cambridge, UK ; New York : Cambridge University Press, 2003.
 Description
 Book — xii, 628 p. : ill. ; 26 cm.
 Summary

 1. Introduction to information theory
 2. Probability, entropy and inference
 3. More about inference Part I. Data Compression:
 4. The source coding theorem
 5. Symbol codes
 6. Stream codes
 7. Codes for integers Part II. NoisyChannel Coding:
 8. Dependent random variables
 9. Communication over a noisy channel
 10. The noisychannel coding theorem
 11. Errorcorrecting codes and real channels Part III. Further Topics in Information Theory:
 12. Hash codes
 13. Binary codes
 14. Very good linear codes exist
 15. Further exercises on information theory
 16. Message passing
 17. Constrained noiseless channels
 18. Crosswords and codebreaking
 19. Why have sex? Information acquisition and evolution Part IV. Probabilities and Inference:
 20. An example inference task: clustering
 21. Exact inference by complete enumeration
 22. Maximum likelihood and clustering
 23. Useful probability distributions
 24. Exact marginalization
 25. Exact marginalization in trellises
 26. Exact marginalization in graphs
 27. Laplace's method
 28. Model comparison and Occam's razor
 29. Monte Carlo methods
 30. Efficient Monte Carlo methods
 31. Ising models
 32. Exact Monte Carlo sampling
 33. Variational methods
 34. Independent component analysis
 35. Random inference topics
 36. Decision theory
 37. Bayesian inference and sampling theory Part V. Neural Networks:
 38. Introduction to neural networks
 39. The single neuron as a classifier
 40. Capacity of a single neuron
 41. Learning as inference
 42. Hopfield networks
 43. Boltzmann machines
 44. Supervised learning in multilayer networks
 45. Gaussian processes
 46. Deconvolution Part VI. Sparse Graph Codes
 47. Lowdensity paritycheck codes
 48. Convolutional codes and turbo codes
 49. Repeataccumulate codes
 50. Digital fountain codes Part VII. Appendices: A. Notation B. Some physics C. Some mathematics Bibliography Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online
Engineering Library (Terman)
Engineering Library (Terman)  Status 

Stacks  Request (opens in new tab) 
Q360 .M23 2003  Unknown 
 Jōhō riron ni okeru jōhō supekutoruteki hōhō. English
 Han, Te Sun, 1941
 New York : Springer, c2003.
 Description
 Book — 538 p.
 Online
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Stacks  Request (opens in new tab) 
Q360 .H34 2003  Unknown 
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.