The all-nodes shortest paths problem is undoubtedly one of
the most basic problems in algorithmic graph theory. In this paper,
we introduce simple and efficient algorithm for all nodes shortest
paths problem for directed (undirected) graphs. In th
is problem, we
find the shortest path from a given source node to all other nodes in
the graph, in which the shortest path is a path with minimum cost,
i.e., sum of the edge weights.
We proved that the complexity of the proposed algorithm in
this paper depends only on the edges graph, and we show that the
time of implementation of this algorithm is linear time O(m) and
This is considered the best times of the algorithms at all. And
a Comparison between complexity of proposed algorithm and the
famous shortest path algorithms have been made, and the obtained
results have shown that the complexity of the proposed algorithm
is best.
Gas condensate consists essentionaly of two kinds of compounds:
hydrocarbon compounds and nonhydrocarbon compounds such as
(CO2, H2S, N2, H2O……..). Nonhydrocarbon compounds form a
very small rate in gas condensate ,but it effect on many properties
of
gas condensate. This research studies the effect of these componentson the pseudocritical pressure and pseudocritical temperature of gas condensate which are very important to study the phase behavioure of gas condensate and to determine the region of retrograde phenomenas which happen in gas condensate reservoirs.The study was done by presenting some methods to calculate these properties and the correcting of these values if there are nonhydrocarbon components in the condensate . the calculations were made by Stewartt methode and we put a computed program to calculate the correcting pseudocritical properties and noncorrecting ones, then we compear the tow values by drawing many diagrams between the mole fraction of the component and the calculated pseudocritical temperature and pressure.
The ability of data mining to provide predictive information
derived from huge databases became an effective tool in the hands
of companies and individuals، allowing them to focus on areas that
are important to them from the massive data generated
by the
march of their daily lives. Along with the increasing importance of
this science there was a rapidly increasing in the tools that produced
to implement the theory concepts as fast as possible. So it will be
hard to take a decision on which of these tools is the best to
perform the desired task. This study provides a comparison
between the two most commonly used data mining tools according
to opinion polls، namely: Rapidminer and R programming language
in order to help researchers and developers to choose the best suited
tool for them between the two. Adopted the comparison on seven
criteria: platform، algorithms، input/output formats، visualization،
user’s evaluation، infrastructure and potential development، and
performance by applying a set of classification algorithms on a
number of data sets and using two techniques to split data set: cross
validation and hold-out to make sure of the results. The Results
show that R supports the largest number of algorithms، input/output
formats، and visualization. While Rapidminer superiority in terms
of ease of use and support for a greater number of platforms. In
terms of performance the accuracy of classification models that
were built using the R packages were higher. That was not true in
some cases imposed by the nature of the data because we did not
added any pre-processing stage. Finally the preference option in
any tool is depending on the extent of the user experience and
purpose that the tool is used for
The shortest path problem can be categorized in to two
different problems; single source shortest path problem (SSSP) and
all pair shortest algorithm (APSP). In this paper, analysis and
comparison between complexity of the famous shortest path
al
gorithms have been made, and the obtained results have shown
that researchers have got remarkable success in designing better
algorithms in the terms of time complexity to solve shortest path
algorithms.
In this paper we present mathematical models for
transportation problems, primal problem and dual. First, we show
how is the formulation of dual transportation problem models.
Finally, As a solution to the two models lead to a solution other
model, we have to dissolve the Dual transportation problem, so we
relied on the least cost method in resolving the primal
transportation problem.
