The reliability polynomial of a graph gives the probability that remains operational when all its edges could fail independently with certain fixed probability. In general, problem finding uniformly most reliable graphs inside family graphs, is, one whose is at least as large any other family, very difficult. this paper, we study in containing hamiltonian cycle.

Accurate and reliable time is necessary for financial and legal transactions, transportation, distribution systems, and many other applications. Time synchronization protocols such as NTP (the Network Time Protocol) have kept clocks of such applications synchronized to each other for many years. Nowadays there are many commercial GPS based NTP time server products at the market but they almost ...

This paper addresses an NP-hard problem of designing a network topology with maximum (s, t) reliability subject to given constraints, such as the computer centers location (nodes), their connecting links reliability and cost, and the maximum budget cost to install the links. Cost is a major issue in the network design, and thus the problem is applicable for networks requiring maximized reliabil...

In this paper, we present RADYBAN (Reliability Analysis with DYnamic BAyesian Networks), a software tool which allows to analyze a dynamic fault tree relying on its conversion into a dynamic Bayesian network. The tool implements a modular algorithm for automatically translating a dynamic fault tree into the corresponding dynamic Bayesian network and exploits classical algorithms for the inferen...

Even though convolutional neural networks (CNN) has achieved near-human performance in various computer vision tasks, its ability to tolerate scale variations is limited. The popular practise is making the model bigger first, and then train it with data augmentation using extensive scale-jittering. In this paper, we propose a scaleinvariant convolutional neural network (SiCNN), a model designed...

we compare two approaches for a markovian model in flexible manufacturing systems (fmss) using monte carlo simulation. the model which is a development of fazlollahtabar and saidi-mehrabad (2013), considers two features of automated flexible manufacturing systems equipped with automated guided vehicle (agv) namely, the reliability of machines and the reliability of agvs in a multiple agv jobsho...

Wireless networks composed of multimedia-enabled resource-constrained sensor nodes have enriched a large set of monitoring sensing applications. In such communication scenario, however, new challenges in data transmission and energy-efficiency have arisen due to the stringent requirements of those sensor networks. Generally, congested nodes may deplete the energy of the active congested paths t...

The visual complexity of orthographies varies across writing systems. Prior research has shown that complexity strongly influences the initial stage of reading development: the perceptual learning of grapheme forms. This study presents a computational simulation that examines the degree to which visual complexity leads to grapheme learning difficulty. We trained each of 131 identical neural net...