Abstract: The travelling salesman problem (TSP) is a combinatorial optimization problem in which the goal is to find the shortest path between different cities that the salesman takes. In other words, the problem deals with finding a route covering all cities so that total distance and execution time is minimized. This paper adopts the nearest neighbor and minimum spanning tree algorithm to solve the well-known travelling salesman problem. The algorithms were implemented using java programming language. The approach is tested on three graphs that making a TSP tour instance of 5-city, 10 –city, and 229–city. The computation results validate the performance of the proposed algorithm.
Abstract: This paper presents a finite buffer renewal input single working vacation and vacation interruption queue with state dependent services and state dependent vacations, which has a wide range of applications in several areas including manufacturing, wireless communication systems. Service times during busy period, vacation period and vacation times are exponentially distributed and are state dependent. As a result of the finite waiting space, state dependent services and state dependent vacation policies, the analysis of these queueing models needs special attention. We provide a recursive method using the supplementary variable technique to compute the stationary queue length distributions at pre-arrival and arbitrary epochs. An efficient computational algorithm of the model is presented which is fast and accurate and easy to implement. Various performance measures have been discussed. Finally, some special cases and numerical results have been depicted in the form of tables and graphs.
Abstract: In this paper Algebraic Riccati matrix equation is used for Eigen-decomposition of special structured matrices. This is achieved by similarity transformation and then using algebraic riccati matrix equation to triangulation of matrices. The process is decomposition of matrices into small and specially structured submatrices with low dimensions for fast and easy finding of Eigenpairs. Numerical and structural examples included showing the efficiency of present method.
Abstract: The topological distance between a pair of vertices i and j, which is denoted by d(vi, vj), is the number of edges of the shortest path joining i and j. The Wiener index W(G) is the sum of distances between all pairs of vertices of a graph G. W(G) = i
Abstract: Most known methods for measuring the structural similarity of document structures are based on, e.g., tag measures, path metrics and tree measures in terms of their DOM-Trees. Other methods measures the similarity in the framework of the well known vector space model. In contrast to these we present a new approach to measuring the structural similarity of web-based documents represented by so called generalized trees which are more general than DOM-Trees which represent only directed rooted trees.We will design a new similarity measure for graphs representing web-based hypertext structures. Our similarity measure is mainly based on a novel representation of a graph as strings of linear integers, whose components represent structural properties of the graph. The similarity of two graphs is then defined as the optimal alignment of the underlying property strings. In this paper we apply the well known technique of sequence alignments to solve a novel and challenging problem: Measuring the structural similarity of generalized trees. More precisely, we first transform our graphs considered as high dimensional objects in linear structures. Then we derive similarity values from the alignments of the property strings in order to measure the structural similarity of generalized trees. Hence, we transform a graph similarity problem to a string similarity problem. We demonstrate that our similarity measure captures important structural information by applying it to two different test sets consisting of graphs representing web-based documents.
Abstract: Multi-Radio Multi-Channel (MRMC) systems are key to power control problems in wireless mesh networks (WMNs). In this paper, we present asynchronous multiple-state based power control for MRMC WMNs. First, WMN is represented as a set of disjoint Unified Channel Graphs (UCGs). Second, each network interface card (NIC) or radio assigned to a unique UCG adjusts transmission power using predicted multiple interaction state variables (IV) across UCGs. Depending on the size of queue loads and intra- and inter-channel states, each NIC optimizes transmission power locally and asynchronously. A new power selection MRMC unification protocol (PMMUP) is proposed that coordinates interactions among radios. The efficacy of the proposed method is investigated through simulations.
Abstract: A graph G is fractional k-covered if for each edge e of
G, there exists a fractional k-factor h, such that h(e) = 1. If k = 2,
then a fractional k-covered graph is called a fractional 2-covered
graph. The binding number bind(G) is defined as follows,
bind(G) = min{|NG(X)|
|X|
: ├ÿ = X Ôèå V (G),NG(X) = V (G)}.
In this paper, it is proved that G is fractional 2-covered if δ(G) ≥ 4
and bind(G) > 5
3 .
Abstract: Attack graph is an integral part of modeling the
overview of network security. System administrators use attack graphs to determine how vulnerable their systems are and to determine
what security measures to deploy to defend their systems. Previous methods on AGG(attack graphs generation) are aiming at
the whole network, which makes the process of AGG complex and
non-scalable. In this paper, we propose a new approach which is
simple and scalable to AGG by decomposing the whole network into atomic domains. Each atomic domain represents a host with a specific privilege. Then the process for AGG is achieved by communications
among all the atomic domains. Our approach simplifies the process
of design for the whole network, and can gives the attack graphs including each attack path for each host, and when the network changes we just carry on the operations of corresponding atomic
domains which makes the process of AGG scalable.
Abstract: Paleoclimate was reconstructed by the clay mineral
assemblages of shale units of Pabdeh (Paleocene- Oligocene), Gurpi
(Upper Cretaceous), Kazhdumi (Albian-Cenomanian) and Gadvan
(Aptian-Neocomian) formations in the Bangestan anticline. To
compare with clay minerals assemblages in these formations,
selected samples also taken from available formations in drilled wells
in Ahvaz, Marun, Karanj, and Parsi oil fields. Collected samples
prepared using standard clay mineral methodology. They were
treated as normal, glycolated and heated oriented glass slides. Their
identification was made on X-Ray diffractographs. Illite % varies
from 8 to 36. Illite quantity increased from Pabdeh to Gurpi
Formation. This may be due to dominant dry climate. Kaolinite is in
range of 12-49%. Its variation style in different formations could be a
marker of climate changes from wet to dry which is supported by the
lithological changes. Chlorite (4-28%) can also be detected in those
samples without any kaolinite. Mixed layer minerals as the mixture
of illite-chlorite and illite-vermiculite-montmorillonite are varied
from 6 to 36%, decreased during Kazhdumi deposition from the base
to the top. This result may be according to decreasing of illite
leaching process. Vermiculite was also determined in very less
quantity and found in those units without kaolinite. Montmorillonite
varies from 8 to 43%, and its presence is due to terrestrial
depositional condition. Stratigraphical documents is also supported
this idea that clay mineral distribution is a function of the climate
changes. It seems, thus, the present results can be indicated a possible
procedure for ancient climate changes evaluation.
Abstract: Motion capture devices have been utilized in
producing several contents, such as movies and video games. However,
since motion capture devices are expensive and inconvenient to use,
motions segmented from captured data was recycled and synthesized
to utilize it in another contents, but the motions were generally
segmented by contents producers in manual. Therefore, automatic
motion segmentation is recently getting a lot of attentions. Previous
approaches are divided into on-line and off-line, where on-line
approaches segment motions based on similarities between
neighboring frames and off-line approaches segment motions by
capturing the global characteristics in feature space. In this paper, we
propose a graph-based high-level motion segmentation method. Since
high-level motions consist of several repeated frames within temporal
distances, we consider all similarities among all frames within the
temporal distance. This is achieved by constructing a graph, where
each vertex represents a frame and the edges between the frames are
weighted by their similarity. Then, normalized cuts algorithm is used
to partition the constructed graph into several sub-graphs by globally
finding minimum cuts. In the experiments, the results using the
proposed method showed better performance than PCA-based method
in on-line and GMM-based method in off-line, as the proposed method
globally segment motions from the graph constructed based
similarities between neighboring frames as well as similarities among
all frames within temporal distances.
Abstract: Given bipartite graphs H1 and H2, the bipartite Ramsey number b(H1;H2) is the smallest integer b such that any subgraph G of the complete bipartite graph Kb,b, either G contains a copy of H1 or its complement relative to Kb,b contains a copy of H2. It is known that b(K2,2;K2,2) = 5, b(K2,3;K2,3) = 9, b(K2,4;K2,4) = 14 and b(K3,3;K3,3) = 17. In this paper we study the case that both H1 and H2 are even cycles, prove that b(C2m;C2n) ≥ m + n - 1 for m = n, and b(C2m;C6) = m + 2 for m ≥ 4.
Abstract: The fluid flow and the properties of the hydraulic
fluid inside a torque converter are the main topics of interest in this
research. The primary goal is to investigate the applicability of
various viscous fluids inside the torque converter. The Taguchi
optimization method is adopted to analyse the fluid flow in a torque
converter from a design perspective. Calculations are conducted in
maximizing the pressure since greater the pressure, greater the torque
developed. Using the values of the S/N ratios obtained, graphs are
plotted. Computational Fluid Dynamics (CFD) analysis is also
conducted.
Abstract: Due to the tremendous amount of information provided
by the World Wide Web (WWW) developing methods for mining
the structure of web-based documents is of considerable interest. In
this paper we present a similarity measure for graphs representing
web-based hypertext structures. Our similarity measure is mainly
based on a novel representation of a graph as linear integer strings,
whose components represent structural properties of the graph. The
similarity of two graphs is then defined as the optimal alignment of
the underlying property strings. In this paper we apply the well known
technique of sequence alignments for solving a novel and challenging
problem: Measuring the structural similarity of generalized trees.
In other words: We first transform our graphs considered as high
dimensional objects in linear structures. Then we derive similarity
values from the alignments of the property strings in order to
measure the structural similarity of generalized trees. Hence, we
transform a graph similarity problem to a string similarity problem for
developing a efficient graph similarity measure. We demonstrate that
our similarity measure captures important structural information by
applying it to two different test sets consisting of graphs representing
web-based document structures.
Abstract: The structural interpretation of a part of eastern Potwar
(Missa Keswal) has been carried out with available seismological,
seismic and well data. Seismological data contains both the source
parameters and fault plane solution (FPS) parameters and seismic data
contains ten seismic lines that were re-interpreted by using well data.
Structural interpretation depicts two broad types of fault sets namely,
thrust and back thrust faults. These faults together give rise to pop up
structures in the study area and also responsible for many structural
traps and seismicity. Seismic interpretation includes time and depth
contour maps of Chorgali Formation while seismological interpretation
includes focal mechanism solution (FMS), depth, frequency,
magnitude bar graphs and renewal of Seismotectonic map. The Focal
Mechanism Solutions (FMS) that surrounds the study area are
correlated with the different geological and structural maps of the area
for the determination of the nature of subsurface faults. Results of
structural interpretation from both seismic and seismological data
show good correlation. It is hoped that the present work will help in
better understanding of the variations in the subsurface structure and
can be a useful tool for earthquake prediction, planning of oil field and
reservoir monitoring.
Abstract: A bond graph model of a two degrees of freedom
PUMA is described. System inversion gives the system input
required to generate a given system output. In order to get the system
inversion of the PUMA manipulator, a linearization of the nonlinear
bond graph is obtained. Hence, the bicausality of the linearized bond
graph of the PUMA manipulator is applied. Thus, the bicausal bond
graph provides a systematic way of generating the equations of the
system inversion. Simulation results to verify the calculated input for
a given output are shown.
Abstract: Multi-Radio Multi-Channel Wireless Mesh Networks (MRMC-WMNs) operate at the backbone to access and route high volumes of traffic simultaneously. Such roles demand high network capacity, and long “online" time at the expense of accelerated transmission energy depletion and poor connectivity. This is the problem of transmission power control. Numerous power control methods for wireless networks are in literature. However, contributions towards MRMC configurations still face many challenges worth considering. In this paper, an energy-efficient power selection protocol called PMMUP is suggested at the Link-Layer. This protocol first divides the MRMC-WMN into a set of unified channel graphs (UCGs). A UCG consists of multiple radios interconnected to each other via a common wireless channel. In each UCG, a stochastic linear quadratic cost function is formulated. Each user minimizes this cost function consisting of trade-off between the size of unification states and the control action. Unification state variables come from independent UCGs and higher layers of the protocol stack. The PMMUP coordinates power optimizations at the network interface cards (NICs) of wireless mesh routers. The proposed PMMUP based algorithm converges fast analytically with a linear rate. Performance evaluations through simulations confirm the efficacy of the proposed dynamic power control.
Abstract: In this paper, SFQ (Start Time Fair Queuing)
algorithm is analyzed when this is applied in computer networks to
know what kind of behavior the traffic in the net has when different
data sources are managed by the scheduler. Using the NS2 software
the computer networks were simulated to be able to get the graphs
showing the performance of the scheduler. Different traffic sources
were introduced in the scripts, trying to establish the real scenario.
Finally the results were that depending on the data source, the traffic
can be affected in different levels, when Constant Bite Rate is
applied, the scheduler ensures a constant level of data sent and
received, but the truth is that in the real life it is impossible to ensure
a level that resists the changes in work load.
Abstract: In syntactic pattern recognition a pattern can be
represented by a graph. Given an unknown pattern represented by
a graph g, the problem of recognition is to determine if the graph g
belongs to a language L(G) generated by a graph grammar G. The
so-called IE graphs have been defined in [1] for a description of
patterns. The IE graphs are generated by so-called ETPL(k) graph
grammars defined in [1]. An efficient, parsing algorithm for ETPL(k)
graph grammars for syntactic recognition of patterns represented by
IE graphs has been presented in [1]. In practice, structural
descriptions may contain pattern distortions, so that the assignment
of a graph g, representing an unknown pattern, to
a graph language L(G) generated by an ETPL(k) graph grammar G is
rejected by the ETPL(k) type parsing. Therefore, there is a need for
constructing effective parsing algorithms for recognition of distorted
patterns. The purpose of this paper is to present a new approach to
syntactic recognition of distorted patterns. To take into account all
variations of a distorted pattern under study, a probabilistic
description of the pattern is needed. A random IE graph approach is
proposed here for such a description ([2]).
Abstract: The Merrifield-Simmons index of a graph G is defined as the total number of its independent sets. A (n, n + 2)-graph is a connected simple graph with n vertices and n + 2 edges. In this paper we characterize the (n, n+2)-graph with the largest Merrifield- Simmons index. We show that its Merrifield-Simmons index i.e. the upper bound of the Merrifield-Simmons index of the (n, n+2)-graphs is 9 × 2n-5 +1 for n ≥ 5.
Abstract: This paper presents an interactive modeling system of
polyhedra using the isomorphic graphs. Especially, Conway
polyhedron notation is implemented. The notation can be observed as
interactive animation.