Abstract: In pattern recognition applications the low level segmentation and the high level object recognition are generally considered as two separate steps. The paper presents a method that bridges the gap between the low and the high level object recognition. It is based on a Bayesian network representation and network propagation algorithm. At the low level it uses hierarchical structure of quadratic spline wavelet image bases. The method is demonstrated for a simple circuit diagram component identification problem.
Abstract: Time varying network induced delays in networked
control systems (NCS) are known for degrading control system-s
quality of performance (QoP) and causing stability problems. In
literature, a control method employing modeling of communication
delays as probability distribution, proves to be a better method. This
paper focuses on modeling of network induced delays as probability
distribution.
CAN and MIL-STD-1553B are extensively used to carry periodic
control and monitoring data in networked control systems.
In literature, methods to estimate only the worst-case delays for
these networks are available. In this paper probabilistic network
delay model for CAN and MIL-STD-1553B networks are given.
A systematic method to estimate values to model parameters from
network parameters is given. A method to predict network delay in
next cycle based on the present network delay is presented. Effect of
active network redundancy and redundancy at node level on network
delay and system response-time is also analyzed.
Abstract: The reliability of distributed systems and computer
networks have been modeled by a probabilistic network or a graph G.
Computing the residual connectedness reliability (RCR), denoted by
R(G), under the node fault model is very useful, but is an NP-hard
problem. Since it may need exponential time of the network size to
compute the exact value of R(G), it is important to calculate its tight
approximate value, especially its lower bound, at a moderate
calculation time. In this paper, we propose an efficient algorithm for
reliability lower bound of distributed systems with unreliable nodes.
We also applied our algorithm to several typical classes of networks
to evaluate the lower bounds and show the effectiveness of our
algorithm.