Results 1  10
of
14,920
Secure Routing for Mobile Ad Hoc Networks
 MOBILE COMPUTING AND COMMUNICATIONS REVIEW
, 2002
"... For such selforganizing infrastructures as mobile ad hoc
networks , envisioned to operate in an open, collaborative,
and highly volatile environment, the importance of secu
rity cannot be underrated. The provision of comprehen
sive secure communication mandates that both route dis
covery and dat ..."
Abstract

Cited by 599 (14 self)
 Add to MetaCart
For such selforganizing infrastructures as mobile ad hoc
networks , envisioned to operate in an open, collaborative,
and highly volatile environment, the importance of secu
rity cannot be underrated. The provision of comprehen
sive secure communication mandates that both route dis
covery
Ecology of the family as a context for human development: Research perspectives.
 Developmental Psychology,
, 1986
"... This review collates and examines critically a theoretically convergent but widely dispersed body of research on the influence of external environments on the functioning of families as contexts of human development. Investigations falling within this expanding domain include studies of the interac ..."
Abstract

Cited by 518 (0 self)
 Add to MetaCart
of the interaction of genetics and environment in family processes; transitions and linkages between the family and other major settings influencing development, such as hospitals, day care, peer groups, school, social networks, the world of work (both for parents and children), and neighborhoods and communities
Randomized Gossip Algorithms
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2006
"... Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join a ..."
Abstract

Cited by 532 (5 self)
 Add to MetaCart
and old nodes leave the network. Algorithms for such networks need to be robust against changes in topology. Additionally, nodes in sensor networks operate under limited computational, communication, and energy resources. These constraints have motivated the design of “gossip ” algorithms: schemes which
Transfer of Cognitive Skill
, 1989
"... A framework for skill acquisition is proposed that includes two major stages in the development of a cognitive skill: a declarative stage in which facts about the skill domain are interpreted and a procedural stage in which the domain knowledge is directly embodied in procedures for performing the s ..."
Abstract

Cited by 894 (22 self)
 Add to MetaCart
the skill. This general framework has been instantiated in the ACT system in which facts are encoded in a propositional network and procedures are encoded as productions. Knowledge compilation is the process by which the skill transits from the declarative stage to the procedural stage. It consists
Nondeterministic Space is Closed Under Complementation
, 1988
"... this paper we show that nondeterministic space s(n) is closed under complementation, for s(n) greater than or equal to log n. It immediately follows that the contextsensitive languages are closed under complementation, thus settling a question raised by Kuroda in 1964 [9]. See Hartmanis and Hunt [4 ..."
Abstract

Cited by 262 (14 self)
 Add to MetaCart
complementation [6]. This holds with or without an ordering relation on the structure. If an ordering is present the resulting class is P. Many people expected that the result was false in the absence of an ordering. In 1983 we studied firstorder logic, with ordering, with a transitive closure operator. We
Languages That Capture Complexity Classes
 SIAM Journal of Computing
, 1987
"... this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a property of graphs (respectively groups, binary strings, etc.) is in polynomial time if and only if it is expressible in the first ..."
Abstract

Cited by 245 (21 self)
 Add to MetaCart
order language of graphs (respectively groups, binary strings, etc.) together with a least fixed point operator. As another example, a property is in logspace if and only if it is expressible in first order logic together with a deterministic transitive closure operator. The roots of our approach
On the Cost of Transitive Closures in Relational Databases
, 1993
"... We consider the question of taking transitive closures on top of pure relational systems (Sybase and Ingres in this case). We developed three kinds of transitive closure programs, one using a stored procedure to simulate a builtin transitive closure operator, one using the C language embedded with ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider the question of taking transitive closures on top of pure relational systems (Sybase and Ingres in this case). We developed three kinds of transitive closure programs, one using a stored procedure to simulate a builtin transitive closure operator, one using the C language embedded
Anti de Sitter space and holography
, 1998
"... Recently, it has been proposed by Maldacena that large N limits of certain conformal field theories in d dimensions can be described in terms of supergravity (and string theory) on the product of d+1dimensional AdS space with a compact manifold. Here we elaborate on this idea and propose a precise ..."
Abstract

Cited by 383 (7 self)
 Add to MetaCart
correspondence between conformal field theory observables and those of supergravity: correlation functions in conformal field theory are given by the dependence of the supergravity action on the asymptotic behavior at infinity. In particular, dimensions of operators in conformal field theory are given by masses
Transitive Closure, Induction, and Logical Frameworks
"... The concept of transitive closure is the key for understanding inductive definitions and inductive reasoning, and so the ability to define the transitive closure of any given relation and make appropriate inferences concerning it is one of the most important challenges that every logical framewor ..."
Abstract
 Add to MetaCart
framework should meet. We investigate here languages with transitive closure operations and their expressive power. In particular, we show that with the simplest transitive closure operation one can define multiplication from 0, the successor function and addition, but addition is not definable from 0
Using Transitiveclosure Logic for Deciding Linear Properties of Monoids
, 2003
"... We use firstorder logic with transitive closure operator FO(TC¹) for deciding rstorder linear monoid properties. These are written in the style of linear sentences of Ron V. Book, but with a less restrictive language. The ..."
Abstract
 Add to MetaCart
We use firstorder logic with transitive closure operator FO(TC¹) for deciding rstorder linear monoid properties. These are written in the style of linear sentences of Ron V. Book, but with a less restrictive language. The
Results 1  10
of
14,920