Results 1 - 10 of 617

Specificity and stability in topology of protein networks

by Sergei Maslov - Science , 2002
"... Molecular networks guide the biochemistry of a living cell on multiple levels: its metabolic and signalling pathways are shaped by the network of interacting proteins, whose production, in turn, is controlled by the genetic regulatory network. To address topological properties of these two networks ..."
Abstract - Cited by 408 (3 self) - Add to MetaCart
we quantify correlations between connectivities of interacting nodes and compare them to a null model of a network, in which al links were randomly rewired. We find that for both interaction and regulatory networks, links between highly connected proteins are systematically suppressed, while those

WCA: A Weighted Clustering Algorithm for Mobile Ad hoc Networks

by Mainak Chatterjee, Sajal K. Das, Damla Turgut - Journal of Cluster Computing (Special Issue on Mobile Ad hoc Networks , 2001
"... this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in nature due to the mobility of the nodes. The association and dissociation of nodes to and from clusters perturb the stab ..."
Abstract - Cited by 275 (9 self) - Add to MetaCart
this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in nature due to the mobility of the nodes. The association and dissociation of nodes to and from clusters perturb

Location Privacy in Mobile Systems: A Personalized Anonymization Model

by Bugra Gedik, Ling Liu - IN: ICDCS , 2005
"... This paper describes a personalized k-anonymity model for protecting location privacy against various privacy threats through location information sharing. Our model has two unique features. First, we provide a unified privacy personalization framework to support location k-anonymity for a wide rang ..."
Abstract - Cited by 192 (8 self) - Add to MetaCart
range of users with context-sensitive personalized privacy requirements. This framework enables each mobile node to specify the minimum level of anonymity it desires as well as the maximum temporal and spatial resolutions it is willing to tolerate when requesting for k-anonymity preserving location

Summed Weight Neuron Perturbation: An O(N) Improvement over Weight Perturbation.

by Barry Flower, Marwan Jabri - Advances in Neural Information Processing Systems (NIPS92 , 1993
"... The algorithm presented performs gradient descent on the weight space of an Artificial Neural Network (ANN), using a finite difference to approximate the gradient. The method is novel in that it achieves a computational complexity similar to that of Node Perturbation, O(N 3 ), but does not require ..."
Abstract - Cited by 26 (2 self) - Add to MetaCart
The algorithm presented performs gradient descent on the weight space of an Artificial Neural Network (ANN), using a finite difference to approximate the gradient. The method is novel in that it achieves a computational complexity similar to that of Node Perturbation, O(N 3 ), but does

MoteTrack: A Robust, Decentralized Approach to RF-Based Location Tracking

by Konrad Lorincz, Matt Welsh , 2005
"... Abstract. In this paper, we present a robust, decentralized approach to RF-based location tracking. Our system, called MoteTrack, is based on low-power radio transceivers coupled with a modest amount of computation and storage capabilities. MoteTrack does not rely upon any back-end server or network ..."
Abstract - Cited by 170 (8 self) - Add to MetaCart
failure, radio signature perturbations, receiver sensitivity, and beacon node density. 1

Homoclinic Saddle-Node Bifurcations in Singularly Perturbed Systems

by Arjen Doelman, Geertje Hek - J. DYN. DIFF. EQ , 1997
"... In this paper we study the creation of homoclinic orbits by saddle-node bifurcations. Inspired on similar phenomena appearing in the analysis of so-called `localized structures' in modulation or amplitude equations, we consider a family of nearly integrable, singularly perturbed three dimension ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
In this paper we study the creation of homoclinic orbits by saddle-node bifurcations. Inspired on similar phenomena appearing in the analysis of so-called `localized structures' in modulation or amplitude equations, we consider a family of nearly integrable, singularly perturbed three

Node Vulnerability under Finite Perturbations in Complex Networks

by Ricardo Gutiérrez, Francisco Del-pozo, Stefano Boccaletti , 2011
"... A measure to quantify vulnerability under perturbations (attacks, failures, large fluctuations) in ensembles (networks) of coupled dynamical systems is proposed. Rather than addressing the issue of how the network properties change upon removal of elements of the graph (the strategy followed by most ..."
Abstract - Add to MetaCart
the collective (synchronized) dynamics of a network of chaotic units is disrupted under the action of a finite size perturbation on one of its nodes. Illustrative examples are provided for three systems of identical chaotic oscillators coupled according to three distinct well-known network topologies. A

Perturbation-resistant and overlayindependent resource discovery

by Steven Y. Ko, Indranil Gupta - In The 2005 Int’l Conf. on Dependable Systems and Networks (DSN 2005 , 2005
"... This paper realizes techniques supporting the position that strategies for resource location and discovery in dis-tributed systems should be both perturbation-resistant and overlay-independent. Perturbation-resistance means that inserts and lookups must be robust to ordinary stresses such as node pe ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
This paper realizes techniques supporting the position that strategies for resource location and discovery in dis-tributed systems should be both perturbation-resistant and overlay-independent. Perturbation-resistance means that inserts and lookups must be robust to ordinary stresses such as node

Relationship privacy: Output perturbation for queries with joins

by Vibhor Rastogi, Gerome Miklau - In ACM Symposium on Principles of Database Systems, 2009. [13] Yossi
"... We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges represent relationships. Nearly all interesting queries over social networks involve joins, and for such queries, existing ..."
Abstract - Cited by 53 (8 self) - Add to MetaCart
, existing output perturbation algorithms severely distort query answers. We propose an algorithm that significantly improves utility over competing techniques, typically reducing the error bound from polynomial in the number of nodes to polylogarithmic. The algorithm is, to the best of our knowledge

Perturbation of the hyperlinked environment

by Hyun Chul Lee, Allan Borodin - In Proceedings of the Ninth International Computing and Combinatorics Conference , 2003
"... a surge of research activity in the area of web mining using link analysis algorithms. Subsequent to the first generation of algorithms, a significant amount of improvements and variations appeared. However, the issue of stability has received little attention in spite of its practical and theoretic ..."
Abstract - Cited by 12 (2 self) - Add to MetaCart
and theoretical implications. For instance, the issue of “link spamming ” is closely related to stability: is it possible to boost up the rank of a page by adding/removing few nodes to/from it? In this paper, we study the stability aspect of various link analysis algorithms concluding that some algorithms
Results 1 - 10 of 617