Results 1  10
of
2,511
Fusion, Propagation, and Structuring in Belief Networks
 ARTIFICIAL INTELLIGENCE
, 1986
"... Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used to repre ..."
Abstract

Cited by 484 (8 self)
 Add to MetaCart
with the task of fusing and propagating the impacts of new information through the networks in such a way that, when equilibrium is reached, each proposition will be assigned a measure of belief consistent with the axioms of probability theory. It is shown that if the network is singly connected (e.g. tree
Computational Models of Sensorimotor Integration
 SCIENCE
, 1997
"... The sensorimotor integration system can be viewed as an observer attempting to estimate its own state and the state of the environment by integrating multiple sources of information. We describe a computational framework capturing this notion, and some specific models of integration and adaptati ..."
Abstract

Cited by 424 (12 self)
 Add to MetaCart
information from visual and auditory systems is integrated so as to reduce the variance in localization. (2) The effects of a remapping in the relation between visual and auditory space can be predicted from a simple learning rule. (3) The temporal propagation of errors in estimating the hand
Recursive Distributed Representations
 Artificial Intelligence
, 1990
"... A longstanding difficulty for connectionist modeling has been how to represent variablesized recursive data structures, such as trees and lists, in fixedwidth patterns. This paper presents a connectionist architecture which automatically develops compact distributed representations for such compo ..."
Abstract

Cited by 414 (9 self)
 Add to MetaCart
for such compositional structures, as well as efficient accessing mechanisms for them. Patterns which stand for the internal nodes of fixedvalence trees are devised through the recursive use of backpropagation on threelayer autoassociative encoder networks. The resulting representations are novel
Gravity coupled with matter and the foundation of non commutative geometry
, 1996
"... We first exhibit in the commutative case the simple algebraic relations between the algebra of functions on a manifold and its infinitesimal length element ds. Its unitary representations correspond to Riemannian metrics and Spin structure while ds is the Dirac propagator ds = ×— × = D −1 where D i ..."
Abstract

Cited by 343 (17 self)
 Add to MetaCart
We first exhibit in the commutative case the simple algebraic relations between the algebra of functions on a manifold and its infinitesimal length element ds. Its unitary representations correspond to Riemannian metrics and Spin structure while ds is the Dirac propagator ds = ×— × = D −1 where D
MulticastBased Inference of NetworkInternal Characteristics: Accuracy of Packet Loss Estimation
 IEEE Transactions on Information Theory
, 1998
"... We explore the use of endtoend multicast traffic as measurement probes to infer networkinternal characteristics. We have developed in an earlier paper [2] a Maximum Likelihood Estimator for packet loss rates on individual links based on losses observed by multicast receivers. This technique explo ..."
Abstract

Cited by 323 (40 self)
 Add to MetaCart
We explore the use of endtoend multicast traffic as measurement probes to infer networkinternal characteristics. We have developed in an earlier paper [2] a Maximum Likelihood Estimator for packet loss rates on individual links based on losses observed by multicast receivers. This technique
BotHunter: Detecting Malware Infection Through IDSDriven Dialog Correlation
, 2007
"... We present a new kind of network perimeter monitoring strategy, which focuses on recognizing the infection and coordination dialog that occurs during a successful malware infection. BotHunter is an application designed to track the twoway communication flows between internal assets and external ent ..."
Abstract

Cited by 197 (18 self)
 Add to MetaCart
We present a new kind of network perimeter monitoring strategy, which focuses on recognizing the infection and coordination dialog that occurs during a successful malware infection. BotHunter is an application designed to track the twoway communication flows between internal assets and external
Transition Density, A New Measure of Activity in Digital Circuits
 IEEE Transactions on ComputerAided Design
, 1992
"... Reliability assessment is an important part of the design process of digital integrated circuits. We observe that a common thread that runs through most causes of runtime failure is the extent of circuit activity, i.e., the rate at which its nodes are switching. We propose a new measure of activity ..."
Abstract

Cited by 180 (25 self)
 Add to MetaCart
of activity, called the transition density, which may be defined as the "average switching rate" at a circuit node. Based on a stochastic model of logic signals, we also present an algorithm to propagate density values from the primary inputs to internal and output nodes. To illustrate the practical
Session 2520 Considering Numerical Error Propagation in Modeling and Regression of Data
"... The use of userfriendly interactive regression software enables undergraduate engineering students to reach a high level of sophistication in regression, correlation and analysis of data. In order to interpret correctly the results, the students must be familiar with potential causes for poor fits ..."
Abstract
 Add to MetaCart
in correlations, should be able to recognize a poor correlation and improve it if possible. They should also be aware of the practical consequences of using a correlation which has no statistical validity. In this paper, the harmful effects of numerical error propagation (resulting from collinearity among
On ellipsoidal techniques for reachability analysis. Part II. Internal Approximations Boxvalued constraints
, 2001
"... Following Part I, this article continues to describe the calculation of the reach sets and tubes for linear control systems with timevarying coefficients and ellipsoidal hard bounds on the controls and initial states. It deals with parametrized families of internal ellipsoidal approximations constr ..."
Abstract

Cited by 168 (8 self)
 Add to MetaCart
Following Part I, this article continues to describe the calculation of the reach sets and tubes for linear control systems with timevarying coefficients and ellipsoidal hard bounds on the controls and initial states. It deals with parametrized families of internal ellipsoidal approximations
Transition Density, A Stochastic Measure of Activity in Digital Circuits
 In Proceedings of the 28 th Design Automation Conference
, 1991
"... Reliability assessment is an important part of the design process of digital integrated circuits. We observe that a common thread that runs through most causes of runtime failure is the extent of circuit activity, i.e., the rate at which its nodes are switching. We propose a new measure of activity ..."
Abstract

Cited by 112 (5 self)
 Add to MetaCart
of activity, called the transition density, which may be defined as the "average switching rate" at a circuit node. Based on a stochastic model of logic signals, we rigorously define the transition density and present an algorithm to propagate it from the primary inputs to internal and output nodes
Results 1  10
of
2,511