Abstract: Graph decompositions are vital in the study of combinatorial design theory. Given two graphs G and H, an H-decomposition of G is a partition of the edge set of G into disjoint isomorphic copies of H. An n-sun is a cycle Cn with an edge terminating in a vertex of degree one attached to each vertex. In this paper we have proved that the complete graph of order 2n, K2n can be decomposed into n-2 n-suns, a Hamilton cycle and a perfect matching, when n is even and for odd case, the decomposition is n-1 n-suns and a perfect matching. For an odd order complete graph K2n+1, delete the star subgraph K1, 2n and the resultant graph K2n is decomposed as in the case of even order. The method of building n-suns uses Walecki's construction for the Hamilton decomposition of complete graphs. A spanning tree decomposition of even order complete graphs is also discussed using the labeling scheme of n-sun decomposition. A complete bipartite graph Kn, n can be decomposed into n/2 n-suns when n/2 is even. When n/2 is odd, Kn, n can be decomposed into (n-2)/2 n-suns and a Hamilton cycle.
Abstract: The paper deals with the pulsating flow of an incompressible couple stress fluid between permeable beds. The couple stress fluid is injected into the channel from the lower permeable bed with a certain velocity and is sucked into the upper permeable bed with the same velocity. The flow between the permeable beds is assumed to be governed by couple stress fluid flow equations of V. K. Stokes and that in the permeable regions by Darcy-s law. The equations are solved analytically and the expressions for velocity and volume flux are obtained. The effects of the material parameters are studied numerically and the results are presented through graphs.
Abstract: We report here structural, mechanical and I-V
characteristics of Zn1-xMxO ceramic samples with various x and M.
It is found that the considered dopants does not influence the wellknown
peaks related to wurtzite structure of ZnO ceramics, while the
shape and size of grains are clearly affected. Average crystalline
diameters, deduced from XRD are between 42 nm and 54 nm, which
are 70 times lower than those obtained from SEM micrographs.
Interestingly, the potential barrier could be formed by adding Cu up
to 0.20, and it is completely deformed by 0.025 Ni additions. The
breakdown field could be enhanced up to 4138 V/cm by 0.025 Cu
additions, followed by a decrease with further increase of Cu . On
the other hand a gradual decrease in VHN is reported for both
dopants and their values are higher in Ni samples as compared to Cu
samples. The electrical conductivity is generally improved by Ni,
while addition of Cu improved it only in the over doped region (≥
0.10). These results are discussed in terms of the difference of
valency and ferromagnetic ordering for both dopants as compared to
undoped sample.
Abstract: The flow and heat transfer characteristics for natural
convection along an inclined plate in a saturated porous medium with
an applied magnetic field have been studied. The fluid viscosity has
been assumed to be an inverse function of temperature. Assuming
temperature vary as a power function of distance. The transformed
ordinary differential equations have solved by numerical integration
using Runge-Kutta method. The velocity and temperature profile
components on the plate are computed and discussed in detail for
various values of the variable viscosity parameter, inclination angle,
magnetic field parameter, and real constant (λ). The results have also
been interpreted with the aid of tables and graphs. The numerical
values of Nusselt number have been calculated for the mentioned
parameters.
Abstract: As the world changes more rapidly, the demand for update information for resource management, environment monitoring, planning are increasing exponentially. Integration of Remote Sensing with GIS technology will significantly promote the ability for addressing these concerns. This paper presents an alternative way of update GIS applications using image processing and high resolution images. We show a method of high-resolution image segmentation using graphs and morphological operations, where a preprocessing step (watershed operation) is required. A morphological process is then applied using the opening and closing operations. After this segmentation we can extract significant cartographic elements such as urban areas, streets or green areas. The result of this segmentation and this extraction is then used to update GIS applications. Some examples are shown using aerial photography.
Abstract: The design requirements for successful human
accommodation in urban spaces are well known; and the range of
facilities available for meeting urban water quality and quantity
requirements is also well established. Their competing requirements
must be reconciled in order for urban spaces to be successful for
both. This paper outlines the separate human and water imperatives
and their interactions in urban spaces. Stormwater management
facilities- relative potential contributions to urban spaces are
contrasted, and design choices for achieving those potentials are
described. This study uses human success of urban space as the
evaluative criterion of stormwater amenity: human values call on
stormwater facilities to contribute to successful human spaces.
Placing water-s contribution under the overall idea of successful
urban space is an evolution from previous subjective evaluations.
The information is based on photographs and notes from
approximately 1,000 stormwater facilities and urban sites collected
during the last 35 years in North America and overseas, and the
author-s experience on multi-disciplinary design teams. This
conceptual study combines the disciplinary roles of engineering,
landscape architecture, and sociology in effecting successful urban
design.
Abstract: A number of routing algorithms based on learning
automata technique have been proposed for communication
networks. How ever, there has been little work on the effects of
variation of graph scarcity on the performance of these algorithms. In
this paper, a comprehensive study is launched to investigate the
performance of LASPA, the first learning automata based solution to
the dynamic shortest path routing, across different graph structures
with varying scarcities. The sensitivity of three main performance
parameters of the algorithm, being average number of processed
nodes, scanned edges and average time per update, to variation in
graph scarcity is reported. Simulation results indicate that the LASPA
algorithm can adapt well to the scarcity variation in graph structure
and gives much better outputs than the existing dynamic and fixed
algorithms in terms of performance criteria.
Abstract: Many well-known interconnection networks, such as kary n-cubes, recursive circulant graphs, generalized recursive circulant graphs, circulant graphs and so on, are shown to belong to the family of cycle composition networks. Recently, various studies about mutually independent hamiltonian cycles, abbreviated as MIHC-s, on interconnection networks are published. In this paper, using an improved construction method, we obtain MIHC-s on cycle composition networks with a much weaker condition than the known result. In fact, we established the existence of MIHC-s in the cycle composition networks and the result is optimal in the sense that the number of MIHC-s we constructed is maximal.
Abstract: Minimally invasive surgery (MIS) is now being widely used as a preferred choice for various types of operations. The need to detect various tactile properties, justifies the key role of tactile sensing that is currently missing in MIS. In this regard, Laparoscopy is one of the methods of minimally invasive surgery that can be used in kidney stone removal surgeries. At this moment, determination of the exact location of stone during laparoscopy is one of the limitations of this method that no scientific solution has been found for so far. Artificial tactile sensing is a new method for obtaining the characteristics of a hard object embedded in a soft tissue. Artificial palpation is an important application of artificial tactile sensing that can be used in different types of surgeries. In this study, a new method for determining the exact location of stone during laparoscopy is presented. In the present study, the effects of stone existence on the surface of kidney were investigated using conceptual 3D model of kidney containing a simulated stone. Having imitated palpation and modeled it conceptually, indications of stone existence that appear on the surface of kidney were determined. A number of different cases were created and solved by the software and using stress distribution contours and stress graphs, it is illustrated that the created stress patterns on the surface of kidney show not only the existence of stone inside, but also its exact location. So three-dimensional analysis leads to a novel method of predicting the exact location of stone and can be directly applied to the incorporation of tactile sensing in artificial palpation, helping surgeons in non-invasive procedures.
Abstract: The study of a real function of two real variables can be supported by visualization using a Computer Algebra System (CAS). One type of constraints of the system is due to the algorithms implemented, yielding continuous approximations of the given function by interpolation. This often masks discontinuities of the function and can provide strange plots, not compatible with the mathematics. In recent years, point based geometry has gained increasing attention as an alternative surface representation, both for efficient rendering and for flexible geometry processing of complex surfaces. In this paper we present different artifacts created by mesh surfaces near discontinuities and propose a point based method that controls and reduces these artifacts. A least squares penalty method for an automatic generation of the mesh that controls the behavior of the chosen function is presented. The special feature of this method is the ability to improve the accuracy of the surface visualization near a set of interior points where the function may be discontinuous. The present method is formulated as a minimax problem and the non uniform mesh is generated using an iterative algorithm. Results show that for large poorly conditioned matrices, the new algorithm gives more accurate results than the classical preconditioned conjugate algorithm.
Abstract: The balanced Hamiltonian cycle problemis a quiet new topic of graph theorem. Given a graph G = (V, E), whose edge set can be partitioned into k dimensions, for positive integer k and a Hamiltonian cycle C on G. The set of all i-dimensional edge of C, which is a subset by E(C), is denoted as Ei(C).
Abstract: In this paper we present a method for gene ranking
from DNA microarray data. More precisely, we calculate the correlation
networks, which are unweighted and undirected graphs, from
microarray data of cervical cancer whereas each network represents
a tissue of a certain tumor stage and each node in the network
represents a gene. From these networks we extract one tree for
each gene by a local decomposition of the correlation network. The
interpretation of a tree is that it represents the n-nearest neighbor
genes on the n-th level of a tree, measured by the Dijkstra distance,
and, hence, gives the local embedding of a gene within the correlation
network. For the obtained trees we measure the pairwise similarity
between trees rooted by the same gene from normal to cancerous
tissues. This evaluates the modification of the tree topology due to
progression of the tumor. Finally, we rank the obtained similarity
values from all tissue comparisons and select the top ranked genes.
For these genes the local neighborhood in the correlation networks
changes most between normal and cancerous tissues. As a result
we find that the top ranked genes are candidates suspected to be
involved in tumor growth and, hence, indicates that our method
captures essential information from the underlying DNA microarray
data of cervical cancer.
Abstract: This paper presents a unified approach based graph
theory and system theory postulates for the modeling and analysis
of Simple open cycle Gas turbine system. In the present paper, the
simple open cycle gas turbine system has been modeled up to its subsystem
level and system variables have been identified to develop the
process subgraphs. The theorems and algorithms of the graph theory
have been used to represent behavioural properties of the system like
rate of heat and work transfers rates, pressure drops and temperature
drops in the involved processes of the system. The processes have
been represented as edges of the process subgraphs and their limits
as the vertices of the process subgraphs. The system across variables
and through variables has been used to develop terminal equations of
the process subgraphs of the system. The set of equations developed
for vertices and edges of network graph are used to solve the system
for its process variables.
Abstract: The rheological properties, structure and potential synergistic interactions of whey proteins (1-6%) and inulin (20%) in mixed gels in the presence of CaCl2 was the aim of this study. Whey proteins have a strong influence on inulin gel formation. At low concentrations (2%) whey proteins did not impair in inulin gel formation. At higher concentration (4%) whey proteins impaired inulin gelation and inulin impaired the formation of a Ca2+-induced whey protein network. The presence of whey proteins at a level allowing for protein gel network formation (6%) significantly increased the rheological parameters values of the gels. SEM micrographs showed that whey protein structure was coated by inulin moieties which could make the mixed gels firmer. The protein surface hydrophobicity measurements did not exclude synergistic interactions between inulin and whey proteins, however. The use of an electrophoretic technique did not show any stable inulin-whey protein complexes.
Abstract: A decomposition of a graph G is a collection ψ of
graphs H1,H2, . . . , Hr of G such that every edge of G belongs
to exactly one Hi. If each Hi is either an induced path in G,
then ψ is called an induced acyclic path decomposition of G and
if each Hi is a (induced) cycle in G then ψ is called a (induced)
cycle decomposition of G. The minimum cardinality of an induced
acyclic path decomposition of G is called the induced acyclic path
decomposition number of G and is denoted by ¤Çia(G). Similarly
the cyclic decomposition number ¤Çc(G) is defined. In this paper we
begin an investigation of these parameters.