The m-consecutive-k-out-of-n: F linear and circular system consists of n sequentially connected components; the components are ordered on a line or a circle; it fails if there are at least m non-overlapping runs of consecutive-k failed components. This paper proposes the reliability and failure probability functions for both linearly and circularly m-consecutive-k-out-of-n: F systems. More precisely, the failure states of the system components are separated into two collections (the working and the failure collections); where each one is defined as a collection of finite mutual disjoint classes of the system states. Illustrative example is provided.
A new ligand [ 2-chloro-N- (1,5-dimethyl-3-oxo-2-phenyl-2,3-dihydro -1H-pyrazol- 4- ylcarbamothioyl)acetamide](L) was synthesized by reacting the Chloro acetyl isothiocyanate with 4-aminoantipyrine,The ligand was characterized by(C HNS) elemental microanalysis and the spectral measurements including Uv-Vis ,IR ,1H and13C NMR spectra, some transition metals complex of this ligand were prepared and characterized by Uv-Vis, FT-IR spectra, conductivity measurements, magnetic susceptibility and atomic absorption. From the obtained results the molecular formula of all prepared complexes were [M(L)2(H2O)2]Cl2 (M+2 =Mn, Co, Ni, Cu, Zn, Cd and Hg),the proposed geometrical structure for all complexes were octahedra
Image compression is a serious issue in computer storage and transmission, that simply makes efficient use of redundancy embedded within an image itself; in addition, it may exploit human vision or perception limitations to reduce the imperceivable information Polynomial coding is a modern image compression technique based on modelling concept to remove the spatial redundancy embedded within the image effectively that composed of two parts, the mathematical model and the residual. In this paper, two stages proposed technqies adopted, that starts by utilizing the lossy predictor model along with multiresolution base and thresholding techniques corresponding to first stage. Latter by incorporating the near lossless com
... Show MoreIn this paper, a new analytical method is introduced to find the general solution of linear partial differential equations. In this method, each Laplace transform (LT) and Sumudu transform (ST) is used independently along with canonical coordinates. The strength of this method is that it is easy to implement and does not require initial conditions.
We present a reliable algorithm for solving, homogeneous or inhomogeneous, nonlinear ordinary delay differential equations with initial conditions. The form of the solution is calculated as a series with easily computable components. Four examples are considered for the numerical illustrations of this method. The results reveal that the semi analytic iterative method (SAIM) is very effective, simple and very close to the exact solution demonstrate reliability and efficiency of this method for such problems.
The software-defined network (SDN) is a new technology that separates the control plane from data plane for the network devices. One of the most significant issues in the video surveillance system is the link failure. When the path failure occurs, the monitoring center cannot receive the video from the cameras. In this paper, two methods are proposed to solve this problem. The first method uses the Dijkstra algorithm to re-find the path at the source node switch. The second method uses the Dijkstra algorithm to re-find the path at the ingress node switch (or failed link).
... Show MoreIn this paper, a random transistor-transistor logic signal generator and a synchronization circuit are designed and implemented in lab-scale measurement device independent–quantum key distribution systems. The random operation of the weak coherent sources and the system’s synchronization signals were tested by a time to digital convertor.
Nowadays, cloud computing has attracted the attention of large companies due to its high potential, flexibility, and profitability in providing multi-sources of hardware and software to serve the connected users. Given the scale of modern data centers and the dynamic nature of their resource provisioning, we need effective scheduling techniques to manage these resources while satisfying both the cloud providers and cloud users goals. Task scheduling in cloud computing is considered as NP-hard problem which cannot be easily solved by classical optimization methods. Thus, both heuristic and meta-heuristic techniques have been utilized to provide optimal or near-optimal solutions within an acceptable time frame for such problems. In th
... Show More