Abstract: In this article, we consider the estimation of P[Y < X], when strength, X and stress, Y are two independent variables of Burr Type XII distribution. The MLE of the R based on one simple iterative procedure is obtained. Assuming that the common parameter is known, the maximum likelihood estimator, uniformly minimum variance unbiased estimator and Bayes estimator of P[Y < X] are discussed. The exact confidence interval of the R is also obtained. Monte Carlo simulations are performed to compare the different proposed methods.
Abstract: Qk
n has been shown as an alternative to the hypercube
family. For any even integer k ≥ 4 and any integer n ≥ 2, Qk
n is
a bipartite graph. In this paper, we will prove that given any pair of
vertices, w and b, from different partite sets of Qk
n, there exist 2n
internally disjoint paths between w and b, denoted by {Pi | 0 ≤ i ≤ 2n-1}, such that 2n-1
i=0 Pi covers all vertices of Qk
n. The result is
optimal since each vertex of Qk
n has exactly 2n neighbors.
Abstract: Our study is concerned with the development of an Emergency Medical Services (EMS) ambulance location and allocation model called the Time-based Ambulance Zoning Optimization Model (TAZ_OPT). This paper presents the framework of the study. The model is formulated using the goal programming (GP), where the goals are to determine the satellite locations of ambulances and the number of ambulances to be allocated at these locations. The model aims at maximizing the expected demand coverage based on probability of reaching the emergency location within targetted time, and minimizing the ambulance busyness likelihood value. Among the benefits of the model is the increased accessibility and availability of ambulances, thus, enhanced quality of the EMS ambulance services.
Abstract: Cosmic showers, from their places of origin in space,
after entering earth generate secondary particles called Extensive Air
Shower (EAS). Detection and analysis of EAS and similar High
Energy Particle Showers involve a plethora of experimental setups
with certain constraints for which soft-computational tools like
Artificial Neural Network (ANN)s can be adopted. The optimality
of ANN classifiers can be enhanced further by the use of Multiple
Classifier System (MCS) and certain data - dimension reduction
techniques. This work describes the performance of certain data
dimension reduction techniques like Principal Component Analysis
(PCA), Independent Component Analysis (ICA) and Self Organizing
Map (SOM) approximators for application with an MCS formed
using Multi Layer Perceptron (MLP), Recurrent Neural Network
(RNN) and Probabilistic Neural Network (PNN). The data inputs are
obtained from an array of detectors placed in a circular arrangement
resembling a practical detector grid which have a higher dimension
and greater correlation among themselves. The PCA, ICA and SOM
blocks reduce the correlation and generate a form suitable for real
time practical applications for prediction of primary energy and
location of EAS from density values captured using detectors in a
circular grid.
Abstract: Grid computing provides a virtual framework for
controlled sharing of resources across institutional boundaries.
Recently, trust has been recognised as an important factor for
selection of optimal resources in a grid. We introduce a new method
that provides a quantitative trust value, based on the past interactions
and present environment characteristics. This quantitative trust value
is used to select a suitable resource for a job and eliminates run time
failures arising from incompatible user-resource pairs. The proposed
work will act as a tool to calculate the trust values of the various
components of the grid and there by improves the success rate of the
jobs submitted to the resource on the grid. The access to a resource
not only depend on the identity and behaviour of the resource but
also upon its context of transaction, time of transaction, connectivity
bandwidth, availability of the resource and load on the resource. The
quality of the recommender is also evaluated based on the accuracy
of the feedback provided about a resource. The jobs are submitted for
execution to the selected resource after finding the overall trust value
of the resource. The overall trust value is computed with respect to
the subjective and objective parameters.
Abstract: In today-s modern world, the number of vehicles is
increasing on the road. This causes more people to choose walking
instead of traveling using vehicles. Thus, proper planning of
pedestrians- paths is important to ensure the safety of pedestrians in a
walking area. Crowd dynamics study the pedestrians- behavior and
modeling pedestrians- movement to ensure safety in their walking paths.
To date, many models have been designed to ease pedestrians-
movement. The Social Force Model is widely used among researchers
as it is simpler and provides better simulation results. We will discuss
the problem regarding the ritual of circumambulating the Ka-aba
(Tawaf) where the entrances to this area are usually congested which
worsens during the Hajj season. We will use the computer simulation
model SimWalk which is based on the Social Force Model to simulate
the movement of pilgrims in the Tawaf area. We will first discuss the
effect of uni and bi-directional flows at the gates. We will then restrict
certain gates to the area as the entrances only and others as exits only.
From the simulations, we will study the effect of the distance of other
entrances from the beginning line and their effects on the duration of
pilgrims circumambulate Ka-aba. We will distribute the pilgrims at the
different entrances evenly so that the congestion at the entrances can be
reduced. We would also discuss the various locations and designs of
barriers at the exits and its effect on the time taken for the pilgrims to
exit the Tawaf area.
Abstract: In this paper a new concept of partial complement of a graph G is introduced and using the same a new graph parameter, called completion number of a graph G, denoted by c(G) is defined. Some basic properties of graph parameter, completion number, are studied and upperbounds for completion number of classes of graphs are obtained , the paper includes the characterization also.
Abstract: Convergence of power series solutions for a class of
non-linear Abel type equations, including an equation that arises
in nonlinear cooling of semi-infinite rods, is very slow inside their
small radius of convergence. Beyond that the corresponding power
series are wildly divergent. Implementation of nonlinear sequence
transformation allow effortless evaluation of these power series on
very large intervals..
Abstract: A new class of percolation model in complex networks,
in which nodes are characterized by hidden variables reflecting the
properties of nodes and the occupied probability of each link is
determined by the hidden variables of the end nodes, is studied
in this paper. By the mean field theory, the analytical expressions
for the phase of percolation transition is deduced. It is determined
by the distribution of the hidden variables for the nodes and the
occupied probability between pairs of them. Moreover, the analytical
expressions obtained are checked by means of numerical simulations
on a particular model. Besides, the general model can be applied
to describe and control practical diffusion models, such as disease
diffusion model, scientists cooperation networks, and so on.
Abstract: The aim of this paper is to express the input-output
matrix as a linear ordering problem which is classified as an NP-hard
problem. We then use a Tabu search algorithm to find the best
permutation among sectors in the input-output matrix that will give
an optimal solution. This optimal permutation can be useful in
designing policies and strategies for economists and government in
their goal of maximizing the gross domestic product.