Abstract: In this paper, the decomposition-aggregation method
is used to carry out connective stability criteria for general linear
composite system via aggregation. The large scale system is
decomposed into a number of subsystems. By associating directed
graphs with dynamic systems in an essential way, we define the
relation between system structure and stability in the sense of
Lyapunov. The stability criteria is then associated with the stability
and system matrices of subsystems as well as those interconnected
terms among subsystems using the concepts of vector differential
inequalities and vector Lyapunov functions. Then, we show that the
stability of each subsystem and stability of the aggregate model
imply connective stability of the overall system. An example is
reported, showing the efficiency of the proposed technique.
Abstract: A spanning tree of a connected graph is a tree which
consists the set of vertices and some or perhaps all of the edges from
the connected graph. In this paper, a model for spanning tree
transformation of connected graphs into single-row networks, namely
Spanning Tree of Connected Graph Modeling (STCGM) will be
introduced. Path-Growing Tree-Forming algorithm applied with
Vertex-Prioritized is contained in the model to produce the spanning
tree from the connected graph. Paths are produced by Path-Growing
and they are combined into a spanning tree by Tree-Forming. The
spanning tree that is produced from the connected graph is then
transformed into single-row network using Tree Sequence Modeling
(TSM). Finally, the single-row routing problem is solved using a
method called Enhanced Simulated Annealing for Single-Row
Routing (ESSR).
Abstract: For a generalized Hermite sinosiodal / hyperbolic Gaussian beam passing through an ABCD system with a finite aperture, the propagation properties are derived using the Collins integral. The results are obtained in the form of intensity graphs indicating that previously demonstrated rules of reciprocity are applicable, while the existence of the aperture accelerates this transformation.
Abstract: Abstract–Let k ≥ 3 be an integer, and let G be a graph of order n with n ≥ 9k +3- 42(k - 1)2 + 2. Then a spanning subgraph F of G is called a k-factor if dF (x) = k for each x ∈ V (G). A fractional k-factor is a way of assigning weights to the edges of a graph G (with all weights between 0 and 1) such that for each vertex the sum of the weights of the edges incident with that vertex is k. A graph G is a fractional k-deleted graph if there exists a fractional k-factor after deleting any edge of G. In this paper, it is proved that G is a fractional k-deleted graph if G satisfies δ(G) ≥ k + 1 and |NG(x) ∪ NG(y)| ≥ 1 2 (n + k - 2) for each pair of nonadjacent vertices x, y of G.
Abstract: The present work consecutively on synthesis and
characterization of composites, Al/Al alloy A 384.1 as matrix in
which the main ingredient as Al/Al-5% MgO alloy based metal
matrix composite. As practical implications the low cost processing
route for the fabrication of Al alloy A 384.1 and operational
difficulties of presently available manufacturing processes based in
liquid manipulation methods. As all new developments, complete
understanding of the influence of processing variables upon the final
quality of the product. And the composite is applied comprehensively
to the acquaintance for achieving superiority of information
concerning the specific heat measurement of a material through the
aid of thermographs. Products are evaluated concerning relative
particle size and mechanical behavior under tensile strength.
Furthermore, Taguchi technique was employed to examine the
experimental optimum results are achieved, owing to effectiveness of
this approach.
Abstract: The purpose of this research is to compare the original
intra-oral digital dental radiograph images with images that are
enhanced using a combination of image processing algorithms. Intraoral
digital dental radiograph images are often noisy, blur edges and
low in contrast. A combination of sharpening and enhancement
method are used to overcome these problems. Three types of
proposed compound algorithms used are Sharp Adaptive Histogram
Equalization (SAHE), Sharp Median Adaptive Histogram
Equalization (SMAHE) and Sharp Contrast adaptive histogram
equalization (SCLAHE). This paper presents an initial study of the
perception of six dentists on the details of abnormal pathologies and
improvement of image quality in ten intra-oral radiographs. The
research focus on the detection of only three types of pathology
which is periapical radiolucency, widen periodontal ligament space
and loss of lamina dura. The overall result shows that SCLAHE-s
slightly improve the appearance of dental abnormalities- over the
original image and also outperform the other two proposed
compound algorithms.
Abstract: Housing is a basic human right. The provision of new
house shall be free from any defects, even for the defects that people
do normally considered as 'cosmetic defects'. This paper studies
about the building defects of newly completed house of 72 unit of
double-storey terraced located in Bangi, Selangor. The building
survey implemented using protocol 1 (visual inspection). As for new
house, the survey work is very stringent in determining the defects
condition and priority. Survey and reporting procedure is carried out
based on CSP1 Matrix that involved scoring system, photographs and
plan tagging. The analysis is done using Statistical Package for Social
Sciences (SPSS). The finding reveals that there are 2119 defects
recorded in 72 terraced houses. The cumulative score obtained was
27644 while the overall rating is 13.05. These results indicate that the
construction quality of the newly terraced houses is low and not up to
an acceptable standard as the new house should be.
Abstract: This paper presents the development of analysis tools
for Home Agriculture project. The tools are required for monitoring
the condition of greenhouse which involves two components:
measurement hardware and data analysis engine. Measurement
hardware is functioned to measure environment parameters such as
temperature, humidity, air quality, dust and etc while analysis tool is
used to analyse and interpret the integrated data against the condition
of weather, quality of health, irradiance, quality of soil and etc. The
current development of the tools is completed for off-line data
recorded technique. The data is saved in MMC and transferred via
ZigBee to Environment Data Manager (EDM) for data analysis.
EDM converts the raw data and plot three combination graphs. It has
been applied in monitoring three months data measurement for
irradiance, temperature and humidity of the greenhouse..
Abstract: This paper reviews various approaches that have been
used for the modeling and simulation of large-scale engineering
systems and determines their appropriateness in the development of a
RICS modeling and simulation tool. Bond graphs, linear graphs,
block diagrams, differential and difference equations, modeling
languages, cellular automata and agents are reviewed. This tool
should be based on linear graph representation and supports symbolic
programming, functional programming, the development of noncausal
models and the incorporation of decentralized approaches.
Abstract: In this paper a new definition of adjacency matrix in
the simple graphs is presented that is called fuzzy adjacency matrix,
so that elements of it are in the form of 0 and
n N
n
1 , ∈
that are
in the interval [0, 1], and then some charactristics of this matrix are
presented with the related examples . This form matrix has complete
of information of a graph.
Abstract: LDPC codes could be used in magnetic storage devices because of their better decoding performance compared to other error correction codes. However, their hardware implementation results in large and complex decoders. This one of the main obstacles the decoders to be incorporated in magnetic storage devices. We construct small high girth and rate 2 columnweight codes from cage graphs. Though these codes have low performance compared to higher column weight codes, they are easier to implement. The ease of implementation makes them more suitable for applications such as magnetic recording. Cages are the smallest known regular distance graphs, which give us the smallest known column-weight 2 codes given the size, girth and rate of the code.
Abstract: Let G be a graph of order n, and let a, b and m be positive integers with 1 ≤ a n + a + b − 2 √bn+ 1, then for any subgraph H of G with m edges, G has an [a, b]-factor F such that E(H)∩ E(F) = ∅. This result is an extension of thatof Egawa [2].
Abstract: We present the development of a system of programs designed for the compilation and execution of applications for handheld computers. In introduction we describe the purpose of the project and its components. The next two paragraphs present the first two components of the project (the scanner and parser generators). Then we describe the Object Pascal compiler and the virtual machines for Windows and Palm OS. In conclusion we emphasize the ways in which the project can be extended.
Abstract: Let G be a graph of order n, and let k 2 and m 0 be two integers. Let h : E(G) [0, 1] be a function. If e∋x h(e) = k holds for each x V (G), then we call G[Fh] a fractional k-factor of G with indicator function h where Fh = {e E(G) : h(e) > 0}. A graph G is called a fractional (k,m)-deleted graph if there exists a fractional k-factor G[Fh] of G with indicator function h such that h(e) = 0 for any e E(H), where H is any subgraph of G with m edges. In this paper, it is proved that G is a fractional (k,m)-deleted graph if (G) k + m + m k+1 , n 4k2 + 2k − 6 + (4k 2 +6k−2)m−2 k−1 and max{dG(x), dG(y)} n 2 for any vertices x and y of G with dG(x, y) = 2. Furthermore, it is shown that the result in this paper is best possible in some sense.
Abstract: In this paper, the strength of a stabilizer is determined when the static and fatigue multiaxial loading are applied. Stabilizer is a part of suspension system in the heavy truck for stabilizing the cabin against the vibration of the road which composes of a thin-walled tube joined to a forge component by fillet weld. The component is loaded by non proportional random sequence of torsion and bending. Residual stress of welding process is considered here for static loading. This static loading with road irregularities are applied in this study as fatigue case that can affected in the fillet welded area of this part. The stresses in the welded structure are calculated using FEA. In addition, the fatigue with multi axial loading in the fillet weld is also investigated and the critical zone of the stabilizer is specified and presented by graphs. Residual stresses that have been resulted by the thermal forces are considered in FEA. Force increasing is the element of finding the critical point of the component.
Abstract: Graph decompositions are vital in the study of
combinatorial design theory. A decomposition of a graph G is a
partition of its edge set. An n-sun graph is a cycle Cn with an edge
terminating in a vertex of degree one attached to each vertex. In this
paper, we define n-sun decomposition of some even order graphs
with a perfect matching. We have proved that the complete graph
K2n, complete bipartite graph K2n, 2n and the Harary graph H4, 2n have
n-sun decompositions. A labeling scheme is used to construct the n-suns.
Abstract: A decomposition of a graph G is a collection ψ of subgraphs H1,H2, . . . , Hr of G such that every edge of G belongs to exactly one Hi. If each Hi is either an induced path or an induced cycle in G, then ψ is called an induced path decomposition of G. The minimum cardinality of an induced path decomposition of G is called the induced path decomposition number of G and is denoted by πi(G). In this paper we initiate a study of this parameter.
Abstract: Connected dominating set (CDS) problem in unit disk
graph has signi£cant impact on an ef£cient design of routing protocols
in wireless sensor networks, where the searching space for a
route is reduced to nodes in the set. A set is dominating if all the
nodes in the system are either in the set or neighbors of nodes in the
set. In this paper, a simple and ef£cient heuristic method is proposed
for £nding a minimum connected dominating set (MCDS) in ad hoc
wireless networks based on the new parameter support of vertices.
With this parameter the proposed heuristic approach effectively
£nds the MCDS of a graph. Extensive computational experiments
show that the proposed approach outperforms the recently proposed
heuristics found in the literature for the MCD
Abstract: Col is a classic combinatorial game played on graphs
and to solve a general instance is a PSPACE-complete problem.
However, winning strategies can be found for some specific graph
instances. In this paper, the solution of Col on complete k-ary trees
is presented.
Abstract: The recent developments in computing and
communication technology permit to users to access multimedia
documents with variety of devices (PCs, PDAs, mobile phones...)
having heterogeneous capabilities. This diversification of supports
has trained the need to adapt multimedia documents according to
their execution contexts. A semantic framework for multimedia
document adaptation based on the conceptual neighborhood graphs
was proposed. In this framework, adapting consists on finding
another specification that satisfies the target constraints and which is
as close as possible from the initial document. In this paper, we
propose a new way of building the conceptual neighborhood graphs
to best preserve the proximity between the adapted and the original
documents and to deal with more elaborated relations models by
integrating the relations relaxation graphs that permit to handle the
delays and the distances defined within the relations.