%{search_type} search results

• 1. Models for mobile agent computing
• Introduction
• What is a mobile agent
• Why mobile agents
• An algorithmic model for mobile agents
• Mobile agents
• Distributed networks
• Resource measures
• Mobile agent rendezvous
• Outline of the book
• Comments and bibliographic remarks.

• 2. Deterministic rendezvous in a ring
• Introduction
• A single stationary token
• The feasibility of rendezvous
• The time complexity of rendezvous
• Memory tradeoff for rendezvous with detection
• Limits to the memory trade-off
• Movable tokens
• Comments and bibliographic remarks.

• 3. Multiple agent rendezvous in a ring
• Introduction
• Impossibility of rendezvous
• Rendezvous with detection
• Conditional solutions
• Comments and bibliographic remarks.

• 4. Randomized rendezvous in a ring
• Introduction
• Random walk algorithm
• Randomization and tokens
• Time/memory trade-offs
• Coin half tour algorithm
• Approximate counting algorithm
• Comments and bibliographic remarks.

• 5. Other models
• Introduction
• Leader election and rendezvous
• Rendezvous with failing tokens
• Rendezvous when tokens fail upon release
• Rendezvous when tokens can fail at any time
• The cost of token failure
• Flickering tokens
• Asynchronous rendezvous
• Look-compute-move
• Model and terminology
• Impossibility results
• Gathering configurations with a single multiplicity
• Gathering rigid configurations
• Gathering an odd number of robots
• Dangerous networks
• Black-hole search in an asynchronous ring
• Rendezvous in asynchronous rings in spite of a black-hole
• Comments and bibliographic remarks.

• 6. Other topologies
• Introduction
• Synchronous torus
• Memory lower bounds for rendezvous
• Rendezvous algorithms
• Trees
• Arbitrary graphs
• Comments and bibliographic remarks.

• Bibliography
• Glossary
• Authors' biographies
• Index.

Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents' ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault-tolerance, flexibility and simplicity. This monograph focuses on studying mobile agents as modelled in distributed systems research and in particular within the framework of research performed in the distributed algorithms community. It studies the fundamental question of how to achieve rendezvous, the gathering of two or more agents at the same node of a network. Like leader election, such an operation is a useful subroutine in more general computations that may require the agents to synchronize, share information, divide up chores, etc. The work provides an introduction to the algorithmic issues raised by the rendezvous problem in the distributed computing setting. For the most part our investigation concentrates on the simplest case of two agents attempting to rendezvous on a ring network. Other situations including multiple agents, faulty nodes and other topologies are also examined. An extensive bibliography provides many pointers to related work not covered in the text. The presentation has a distinctly algorithmic, rigorous, distributed computing flavor and most results should be easily accessible to advanced undergraduate and graduate students in computer science and mathematics departments.

• 1. Models for mobile agent computing
• Introduction
• What is a mobile agent
• Why mobile agents
• An algorithmic model for mobile agents
• Mobile agents
• Distributed networks
• Resource measures
• Mobile agent rendezvous
• Outline of the book
• Comments and bibliographic remarks --

• 2. Deterministic rendezvous in a ring
• Introduction
• A single stationary token
• The feasibility of rendezvous
• The time complexity of rendezvous
• Memory tradeoff for rendezvous with detection
• Limits to the memory trade-off
• Movable tokens
• Comments and bibliographic remarks --

• 3. Multiple agent rendezvous in a ring
• Introduction
• Impossibility of rendezvous
• Rendezvous with detection
• Conditional solutions
• Comments and bibliographic remarks --

• 4. Randomized rendezvous in a ring
• Introduction
• Random walk algorithm
• Randomization and tokens
• Time/memory trade-offs
• Coin half tour algorithm
• Approximate counting algorithm
• Comments and bibliographic remarks --

• 5. Other models
• Introduction
• Leader election and rendezvous
• Rendezvous with failing tokens
• Rendezvous when tokens fail upon release
• Rendezvous when tokens can fail at any time
• The cost of token failure
• Flickering tokens
• Asynchronous rendezvous
• Look-compute-move
• Model and terminology
• Impossibility results
• Gathering configurations with a single multiplicity
• Gathering rigid configurations
• Gathering an odd number of robots
• Dangerous networks
• Black-hole search in an asynchronous ring
• Rendezvous in asynchronous rings in spite of a black-hole
• Comments and bibliographic remarks --

• 6. Other topologies
• Introduction
• Synchronous torus
• Memory lower bounds for rendezvous
• Rendezvous algorithms
• Trees
• Arbitrary graphs
• Comments and bibliographic remarks --

• Bibliography
• Glossary
• Authors' biographies
• Index.

Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents' ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault-tolerance, flexibility and simplicity. This monograph focuses on studying mobile agents as modelled in distributed systems research and in particular within the framework of research performed in the distributed algorithms community. It studies the fundamental question of how to achieve rendezvous, the gathering of two or more agents at the same node of a network. Like leader election, such an operation is a useful subroutine in more general computations that may require the agents to synchronize, share information, divide up chores, etc. The work provides an introduction to the algorithmic issues raised by the rendezvous problem in the distributed computing setting.For the most part our investigation concentrates on the simplest case of two agents attempting to rendezvous on a ring network.Other situations including multiple agents, faulty nodes and other topologies are also examined. An extensive bibliography provides many pointers to related work not covered in the text. The presentation has a distinctly algorithmic, rigorous, distributed computing flavor and most results should be easily accessible to advanced undergraduate and graduate students in computer science and mathematics departments.

• Introduction
• E. Kranakis, P. van Oorschot. On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
• D.R. Stinson. MD2 is not Secure Without the Checksum Byte
• N. Rogier, P. Chauvaud. On the Weaknesses of Non-Surjective Round Functions
• V. Rijmen, et al. Resistance of a CAST-Like Encryption Algorithm to Linear and Differential Cryptanalysis
• J. Lee, et al. Constructing Symmetric Ciphers Using the CAST Design Procedure
• C.M. Adams.
• (source: Nielsen Book Data)

Selected Areas in Cryptography brings together in one place important contributions and up-to-date research results in this fast moving area. Selected Areas in Cryptography serves as an excellent reference, providing insight into some of the most challenging research issues in the field.
(source: Nielsen Book Data)

• Number Theory. Primality Tests. Probability Theory. Pseudorandom Generators. Public Key Cryptosystems. Towards a General Theory. References. Frequently Used Notation. Index.
• (source: Nielsen Book Data)

A comprehensive account of recent algorithms developed in computational number theory and primality testing. Provides a general framework for the theoretical study of public key cryptography and pseudorandom generators. Unique in its approach, the book will be a valuable addition to computer literature.
(source: Nielsen Book Data)

• FINANCIAL NETWORKS:
• 1. Mathematical modeling of systemic risk: H. Amini, A. Minca.-
• 2. Systemic risk in banking networks without Monte Carlo simulation: J. P. Gleeson, T. R. Hurd, S. Melnik, A. Hackett.-
• 3. Systemic Valuation of Banks - Interbank Equilibrium and Contagion: G. Halaj.-
• 4. An Open Problem: J. B. Walsh.- II SECURITY NETWORKS:
• 5. Dynamic Trust Management: Network Profiling for High Assurance Resilience: M. Burmester , W. O. Redwood.-
• 6. Security Issues in Link State Routing Protocols for MANETs: G.Cervera, M.Barbeau, J. Garcia-Alfaro, E.Kranakis.
• -7. TCHo: a Code-based Cryptosystem: A. Duc , S. Vaudenay.-
• 8. Formal Method for (k)-Neighborhood Discovery Protocols: R.Jamet, P.Lafourcade.-
• 9. A Tutorial on White-box AES: J. A. Muir.-
• 10. Efficient 1-Round Almost-Perfect Secure Message Transmission Protocols with Flexible Connectivity: R. Safavi-Naini, M. Ashraful Alam Tuhin.- III SOCIAL NETWORKS:
• 11. Mathematical modelling to evaluate measures and control the spread of illicit drug use: A. Bakhtiari, A. Rutherford.-
• 12. Complex Networks and Social Networks: A. Bonato, A. Tian.-
• 13. NAVEL Gazing: Studying a Networked Scholarly Organization: D. Dimitrova, A. Gruzd, Z.Hayat, G. Ying Mo, D.Mok, Th. Robbins, B.Wellman, X. Zhuo.-
• 14. How Al Qaeda can use order theory to evade or defeat U.S. Forces: J.D.Farley.-
• 15. The ABCs of Designing Social Networks for Health Behaviour Change: The VivoSpace Social Network: N. Kamal, S. Fels, M. Blackstock, K. Ho.-
• 16. Evolution of an Open Source Community Network: N. Saraf, A. Seary, D. Chandrasekaran, P.Monge.-
• 17. SociQL: A Query Language for the SocialWeb: D. Serrano, E. Stroulia, D. Barbosa, V. Guana.
• (source: Nielsen Book Data)

As well as highlighting potentially useful applications for network analysis, this volume identifies new targets for mathematical research that promise to provide insights into network systems theory as well as facilitating the cross-fertilization of ideas between sectors. Focusing on financial, security and social aspects of networking, the volume adds to the growing body of evidence showing that network analysis has applications to transportation, communication, health, finance, and social policy more broadly. It provides powerful models for understanding the behavior of complex systems that, in turn, will impact numerous cutting-edge sectors in science and engineering, such as wireless communication, network security, distributed computing and social networking, financial analysis, and cyber warfare. The volume offers an insider's view of cutting-edge research in network systems, including methodologies with immense potential for interdisciplinary application. The contributors have all presented material at a series of workshops organized on behalf of Canada's MITACS initiative, which funds projects and study grants in `mathematics for information technology and complex systems'. These proceedings include papers from workshops on financial networks, network security and cryptography, and social networks. MITACS has shown that the partly ghettoized nature of network systems research has led to duplicated work in discrete fields, and thus this initiative has the potential to save time and accelerate the pace of research in a number of areas of network systems research.
(source: Nielsen Book Data)

• Preface.Glossary
• .1. Wireless Data Communications.1.1 Signal Representation.1.2 Analog to Digital Conversion.1.3 Digital to Analog Conversion.1.4 Architecture of an SDR Application.1.5 Quadrature Modulation and Demodulation.1.6 Spread Spectrum.1.7 Antenna.1.8 Propagation.1.9 Ultrawideband.1.10 Energy Management.1.11 Exercise
• .2. Medium Access Control.2.1 Fundamentals of Probability and Statistics.2.2 Modeling Traffic.2.3 Multiple Access.2.4 Demand Assigned Multiple Access.2.5 Carrier Sense Multiple Access in IEEE 802.11.2.6 Medium Access Control in ad hov Networks.2.7 Bibliographic Comments.2.8 Exercises
• .3. Ad Hov Wireless Access.3.1 Management of Bluetooth Networks.3.2 Model for Node Discovery in Bluetooth.3.3 Bluetooth Formation Algorithms.3.4 Mesh Mode of WiMAX/802.16.3.5 Bibliographic Comments.Exercises
• .4. Wireless Network Programming.4.1 Structure of Information.4.2 Socket.4.3 Parameters and Control.4.4 Receiving Frames.4.5 Sending Frames.4.6 Exercises
• .5. Ad Hov Networks Protocols.5.1 Normal IP Routing.5.2 The Reactive Approach.5.3 The Proactive Approach.5.4 The Hybrid Approach.5.5 Clustering.5.6 Quality of Service.5.7 Sensor Network Protocols.5.8 Exercises
• .6. Location Awareness.6.1 Geographic Proximity.6.2 Constructing Spanners of ad hov Networks.6.3 Information Dissemination.6.4 Geographic Location Determination.6.5 Random Unit Disc Graphs.6.6 Coverage and Connectivity with Directional Sensors.6.7 Bibliographic Comments.6.8 Exercises
• .7. Ad Hov Networks Security.7.1 Authentication Techniques.7.2 Physical Layer Attacks.7.3 Security of Application Protocols.7.4 Biometrics-based Key Establishment.7.5 Routing Security.7.6 Broadcast Security.7.7 Secure Location Verification.7.8 Security in Directional Antenna Systems.7.9 Bibliographic Comments.7.10 Exercises.Bibliography.Index.
• (source: Nielsen Book Data)

"Principles of Ad Hoc Networking" presents a systematic introduction to the fundamentals of ad hoc networks. An ad hoc network is a small network, especially one with wireless or temporary plug in connections. Typically, some of the network devices are part of the network only for the duration of a communications session or, in the case of mobile or portable devices, while in some close proximity to the rest of the network. These networks can range from small and static systems with constrained power resources to larger scale dynamic and mobile environments. Wireless ad hoc networks facilitate numerous and diverse applications for establishing survivable dynamic systems in emergency and rescue operations, disaster relief and intelligent home settings. "Principles of Ad Hoc Networking" introduces the essential characteristics of ad hoc networks such as: physical layer, medium access control, Bluetooth discovery and network formation, wireless network programming and protocols. It explains the crucial components involved in ad hoc networks in detail with numerous exercises to aid understanding. It offers key results and merges practical methodologies with mathematical considerations. "Principles of Ad Hoc Networking" will prove essential reading for graduate students in Computer Science, Electrical Engineering, Applied Mathematics and Physics as well as researchers in the field of ad hoc networking, professionals in wireless telecoms, and networking system developers.
(source: Nielsen Book Data)

• 1. Boolean Functions
• 2. Circuit Lower Bounds
• Circuit Upper Bounds
• 4. Randomness and Satisfiability
• 5. Propositional Proof Systems
• 6. Machine Models and Function Algebras
• 7. Higher Types
• References.
• (source: Nielsen Book Data)

This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of "fast" parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Nonuniform computation models are studied in the form of boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. The book will benefit advanced undergraduates and graduate students as well as researchers in the field of complexity theory.
(source: Nielsen Book Data)

• Routing.- Local Routing on Tori.- Topology Control and Geographic Routing in Realistic Wireless Networks.- Routing in Wireless Networks with Position Trees.- Statistical Monitoring to Control a Proactive Routing Protocol.- Topology Control.- A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs.- Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs.- Information Brokerage Via Location-Free Double Rulings.- Level Set Estimation Using Uncoordinated Mobile Sensors.- The Impact of Delay in Dominating Set and Neighbor Elimination Based Broadcasting in Ad Hoc Networks.- Security and Privacy.- Building a Trusted Community for Mobile Ad Hoc Networks Using Friend Recommendation.- Dependable and Secure Distributed Storage System for Ad Hoc Networks.- An Energy and Communication Efficient Group Key in Sensor Networks Using Elliptic Curve Polynomial.- Protocols.- A Cooperative CDMA-Based Multi-channel MAC Protocol for Ad Hoc Networks.- FDAR: A Load-Balanced Routing Scheme for Mobile Ad-Hoc Networks.- TOLB: A Traffic-Oblivious Load-Balancing Protocol for Next-Generation Sensornets.- A Comparative Analysis of Multicast Protocols for Small MANET Groups.- ODCP: An On-Demand Clustering Protocol for Directed Diffusion.- Quality of Service and Performance.- Quality of Service Support for ODMRP Multicast Routing in Ad Hoc Networks.- The Analysis of Fault Tolerance in Triangular Topology Sensor Networks.- Performance Modeling of Mobile Sensor Networks.- Electronic-Oriented IP Address Auto-Configuration Protocol for MANET.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 6th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2007, held in Morelia, Mexico, in September 2007. The 21 revised full papers were carefully reviewed and selected from 50 submissions. The papers are organized in topical sections on routing, topology control, security and privacy, protocols, as well as quality of service and performance.
(source: Nielsen Book Data)

• Reversible Figures and Solids
• Simplicity is in Vogue (again)
• Subgame Perfect Equilibrium: Computation and Efficiency
• Buying Stuff Online
• Data Crowdsourcing: Is It for Real
• A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
• A Middle Curve Based on Discrete Fréchet Distance
• Comparison-Based FIFO Buffer Management in QoS Switches
• Scheduling on Power-Heterogeneous Processors
• Period Recovery over the Hamming and Edit Distances
• Chasing Convex Bodies and Functions
• Parameterized Lower Bounds and Dichotomy Results for the NP-Completeness of H-Free Edge Modification Problems
• Parameterized Complexity of Red Blue Set Cover for lines
• Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
• On Mobile Agent Verifiable Problems
• Computing Maximal Layers Of Points In Ef(n)
• On the Total Number of Bends for Planar Octilinear Drawings
• Bidirectional BWT-Based De Bruijn Graphs
• The Read/Write Protocol Complex is Collapsible
• The I/O Complexity of Computing Prime Tables.-Increasing Diamonds
• Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs
• A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-Vertex Cover in Bipartite Graphs
• Improved Spanning Ratio for Low Degree Spanners
• Constructing Consistent Digital Line Segments
• Faster Information Gathering in Ad-Hoc Radio Tree Networks
• Stabbing circles for Sets of Segments in the Plane
• Faster Algorithms to Enumerate Hypergraph Transversals
• Listing Acyclic Orientations of Graphs with Single and Multiple Sources
• Linear-Time Sequence Comparison Using Minimal Absent Words
• The Grandmama de Bruijn Sequence for Binary Strings
• Compressing Bounded Degree Graphs
• Random Partial Match Queries in Quad-K-d Trees
• From Discrepancy to Majority
• On the Planar Split Thickness of Graphs
• A Bounded-Risk Mechanism for the Kidney Exchange Game
• Tight Approximations of Degeneracy in Large Graphs
• Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center
• Bundled Crossings in Embedded Graphs
• Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering
• Deterministic Sparse Suffix Sorting on Rewritable Texts
• Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Ordering
• Unshuffling Permutations
• Generating Random Spanning Trees via Fast Matrix Multiplication
• Routing in Unit Disk Graphs
• Graph Drawings with One Bend and Few Slopes
• Edge-Editing to a Dense and a Sparse Graph Class
• Containment and Evasion in Stochastic Point Data
• Tree Compression Using String Grammars
• Trees and Languages with Periodic Signature
• Rank Reduction of Directed Graphs by Vertex and Edge Deletions
• New Deterministic Algorithms for Solving Parity Games
• Computing a Geodesic Two-Center of Points in a Simple Polygon
• Simple Approximation Algorithms for Balanced MAX 2SAT
• A Parameterized Algorithm for Mixed-Cut
• (k; n
• k)-MAX-CUT: An O*(2p)-Time Algorithm and a Polynomial Kernel
• Independent set of convex polygons: from nƐ to 1 + Ɛ via shrinking.

This book constitutes the refereed proceedings of the 12th Latin American Symposium on Theoretical Informatics, LATIN 2016, held in Ensenada, Mexico, in April 2016. The 52 papers presented together with 5 abstracts were carefully reviewed and selected from 131 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures.

• Routing.- Local Routing on Tori.- Topology Control and Geographic Routing in Realistic Wireless Networks.- Routing in Wireless Networks with Position Trees.- Statistical Monitoring to Control a Proactive Routing Protocol.- Topology Control.- A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs.- Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs.- Information Brokerage Via Location-Free Double Rulings.- Level Set Estimation Using Uncoordinated Mobile Sensors.- The Impact of Delay in Dominating Set and Neighbor Elimination Based Broadcasting in Ad Hoc Networks.- Security and Privacy.- Building a Trusted Community for Mobile Ad Hoc Networks Using Friend Recommendation.- Dependable and Secure Distributed Storage System for Ad Hoc Networks.- An Energy and Communication Efficient Group Key in Sensor Networks Using Elliptic Curve Polynomial.- Protocols.- A Cooperative CDMA-Based Multi-channel MAC Protocol for Ad Hoc Networks.- FDAR: A Load-Balanced Routing Scheme for Mobile Ad-Hoc Networks.- TOLB: A Traffic-Oblivious Load-Balancing Protocol for Next-Generation Sensornets.- A Comparative Analysis of Multicast Protocols for Small MANET Groups.- ODCP: An On-Demand Clustering Protocol for Directed Diffusion.- Quality of Service and Performance.- Quality of Service Support for ODMRP Multicast Routing in Ad Hoc Networks.- The Analysis of Fault Tolerance in Triangular Topology Sensor Networks.- Performance Modeling of Mobile Sensor Networks.- Electronic-Oriented IP Address Auto-Configuration Protocol for MANET.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 6th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2007, held in Morelia, Mexico, in September 2007. The 21 revised full papers were carefully reviewed and selected from 50 submissions. The papers are organized in topical sections on routing, topology control, security and privacy, protocols, as well as quality of service and performance.
(source: Nielsen Book Data)