In this paper, we study properties of exp-uniform distribution and its applications. We provide closed forms for the density function and moments of order statistics and we also discuss estimation of the parameters via the maximum likelihood method. We will present certain characterizations of exp-uniform distribution. The applications of this distribution are illustrated by fitting it to three...

In this paper, we discuss the prediction problem based on censored coherent system lifetime data when the system structure is known and the component lifetime follows the proportional reversed hazard model. Different point and interval predictors based on classical and Bayesian approaches are derived. A numerical example is presented to illustrate the prediction methods used in this paper. Mont...

We consider a specific kind of Abstract State Machines. It is shown how the machines can be used to provide a low-level formal semantics for a tiny object-oriented language, including control flow operators, object creation and field manipulation. Then the decidability result is established for checking invariants of programs corresponding to that class of ASMs.

Based on the observation that graphs play an important role in the representation of databases, an algebra is presented for the manipulation of binary relations, i.e., of directed unlabeled graphs. This so-called Tarski algebra is based on early work by Tarski. The key notion that has been added to it here is tagging , which is needed for providing both enough modeling power and enough querying...

[1] By means of a simple analytical one-dimensional (1-D) model, we predict mean vertical structure and fluctuations in trace gas concentrations as a function of species lifetime in the atmosphere. The model assumes a well-mixed planetary boundary layer (PBL) overlain by a free troposphere with constant diffusivity separated by a jump in species concentration. A jump in concentration is also as...

In this paper the performance of the proposed DLMT and CLMT algorithms are compared. These proposed algorithms tend to extend the node lifetime. Decentralized lifetime maximizing tree(DLMT) features in nodes with higher energy to be chosen as data aggregating parents while Centralized Lifetime Maximizing Tree(CLMT) features with the identification of the bottleneck node to collect data in a cen...