Link prediction in networks is typically accomplished by estimating or ranking the probabilities of edges for all pairs nodes. In practice, especially social networks, data are often collected egocentric sampling, which means selecting a subset nodes and recording their edges. This sampling mechanism requires different tools than typical assumption links missing at random. We propose new comput...

Vehicles are important elements of military transport systems. Semi-Markov processes, owing to the generic assumption form, a useful tool for modelling operation process numerous technical objects and The suggested approach is an extension existing stochastic methods employed wide spectrum objects; however, research on light utility vehicles complements subject gap in scientific literature. Thi...

Magic Square is a ppeer-to-peer protocol for searching resources. The recovery cost of Magic Square is high and the system doesn’t recover the failure in simultaneous neighbor nodes’ failure. This paper uses a recovery node for handling all kind of node failure. The recovery node stores a chunk's routing information of the entire nodes and has links to neighbor recovery nodes. Our scheme is sim...

A central problem in risk management is to identify the optimal combination (or portfolio) of actions that improves the reliability of the system most through reducing failure event probabilities, subject to the availability of resources. This optimal portfolio can be sensitive with regard to epistemic uncertainties about the failure events’ probabilities. In this paper, we develop an optimizat...

Welch & Peers (1963) used a root-information prior to obtain posterior probabilities for a scalar parameter exponential model and showed that these Bayes probabilities had the confidence property to second order asymptotically. An important undercurrent of this indicates that the constant information reparameterization provides location model structure, for which the confidence property ...

 Long standing controversies in the foundations of frequentist statistics stem from failure to appreciate the multiplicity of frequentist methods, and erroneous conceptions of the unifying core that links together and directs their interpretation and justification  Learning from the work of statistician D.R. Cox serves to explicate the multiplicity of frequentist methods and goals, and identi...

The purpose of this paper is to study the loss probabilities of messages in an M/M/1/K queueing system where in addition to losses due to buffer overflow there are also random losses in the incoming and outgoing links. We focus on the influence of adding redundant packets to the messages (as in error correction coding, e.g. Reed–Solomon code, etc.). In the first part we use multi-dimensional pr...