Results 31 to 40 of about 14,849 (145)
Verifiable Network-Performance Measurements [PDF]
, 2010 In the current Internet, there is no clean way for affected parties to react to poor forwarding performance: when a domain violates its Service Level Agreement (SLA) with a contractual partner, the partner must resort to ad-hoc probing-based monitoring ...
Argyraki, Katerina +2 more
core +9 more sources
Intrusion detection routers: Design, implementation and evaluation using an experimental testbed [PDF]
, 2006 In this paper, we present the design, the implementation details, and the evaluation results of an intrusion detection and defense system for distributed denial-of-service (DDoS) attack. The evaluation is conducted using an experimental testbed.
Chan, EYK +20 more
core +2 more sources
Sketching Cuts in Graphs and Hypergraphs [PDF]
, 2014 Sketching and streaming algorithms are in the forefront of current research directions for cut problems in graphs. In the streaming model, we show that $(1-\epsilon)$-approximation for Max-Cut must use $n^{1-O(\epsilon)}$ space; moreover, beating $4/5 ...
Kogan, Dmitry, Krauthgamer, Robert
core
, 2023 It was the L_2 L_infinity performance index that for the first time is initiated into the discussion on state estimation of delayed MJNNs with with partially known transition probabilities, which provides a more general promotion for the estimation error.The WTOD protocol is adopted to dispatch the sensor nodes so as to effectively alleviate the ...
Zou, Cong, Chen, Wei
openaire +2 more sources
Topological Phases: An Expedition off Lattice
, 2011 Motivated by the goal to give the simplest possible microscopic foundation for a broad class of topological phases, we study quantum mechanical lattice models where the topology of the lattice is one of the dynamical variables.
Ambjorn +19 more
core +1 more source
Self-organization of Nodes using Bio-Inspired Techniques for Achieving Small World Properties
, 2011 In an autonomous wireless sensor network, self-organization of the nodes is essential to achieve network wide characteristics. We believe that connectivity in wireless autonomous networks can be increased and overall average path length can be reduced by
Agarwal, Rachit +5 more
core +3 more sources
AMISEC: Leveraging Redundancy and Adaptability to Secure AmI Applications [PDF]
, 2008 Security in Ambient Intelligence (AmI) poses too many challenges due to the inherently insecure nature of wireless sensor nodes. However, there are two characteristics of these environments that can be used effectively to prevent, detect, and confine ...
Araujo Pinto, Álvaro +5 more
core +1 more source
Phase-Remapping Attack in Practical Quantum Key Distribution Systems
, 2006 Quantum key distribution (QKD) can be used to generate secret keys between two distant parties. Even though QKD has been proven unconditionally secure against eavesdroppers with unlimited computation power, practical implementations of QKD may contain ...
B. Qi +11 more
core +2 more sources
A Graph-Theoretical Approach to the Selection of the Minimum Tiling Path from a Physical Map [PDF]
, 2013 The problem of computing the minimum tiling path (MTP) from a set of clones arranged in a physical map is a cornerstone of hierarchical (clone-by-clone) genome sequencing projects.
Bozdag, Serdar
core +1 more source
Max-min Fairness in 802.11 Mesh Networks [PDF]
, 2010 In this paper we build upon the recent observation that the 802.11 rate region is log-convex and, for the first time, characterise max-min fair rate allocations for a large class of 802.11 wireless mesh networks.
Cao, Qizhi +2 more
core +2 more sources