**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**4819

# Search results for: Induced path decomposition number.

##### 4819 Decomposition of Graphs into Induced Paths and Cycles

**Authors:**
I. Sahul Hamid,
Abraham V. M.

**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.

**Keywords:**
Path decomposition,
Induced path decomposition,
Induced path decomposition number.

##### 4818 Induced Acyclic Path Decomposition in Graphs

**Authors:**
Abraham V. M.,
I. Sahul Hamid

**Abstract:**

**Keywords:**
Cycle decomposition,
Induced acyclic path decomposition,
Induced acyclic path decomposition number.

##### 4817 Induced Graphoidal Covers in a Graph

**Authors:**
K. Ratan Singh,
P. K. Das

**Abstract:**

An induced graphoidal cover of a graph G is a collection ψ of (not necessarily open) paths in G such that every path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, every edge of G is in exactly one path in ψ and every member of ψ is an induced cycle or an induced path. The minimum cardinality of an induced graphoidal cover of G is called the induced graphoidal covering number of G and is denoted by ηi(G) or ηi. Here we find induced graphoidal cover for some classes of graphs.

**Keywords:**
Graphoidal cover,
Induced graphoidal cover,
Induced graphoidal covering number.

##### 4816 Induced Acyclic Graphoidal Covers in a Graph

**Authors:**
K. Ratan Singh,
P. K. Das

**Abstract:**

**Keywords:**
Graphoidal cover,
Induced acyclic graphoidal cover,
Induced acyclic graphoidal covering number.

##### 4815 A Feasible Path Selection QoS Routing Algorithm with two Constraints in Packet Switched Networks

**Authors:**
P.S.Prakash,
S.Selvan

**Abstract:**

**Keywords:**
feasible path,
multiple constraints,
path selection,
QoS routing

##### 4814 Laplace Adomian Decomposition Method Applied to a Two-Dimensional Viscous Flow with Shrinking Sheet

**Authors:**
M. A. Koroma,
S. Widatalla,
A. F. Kamara,
C. Zhang

**Abstract:**

**Keywords:**
Adomian polynomials,
Laplace Adomian
decomposition method,
Padé Approximant,
Shrinking sheet.

##### 4813 Generalized Morphological 3D Shape Decomposition Grayscale Interframe Interpolation Method

**Authors:**
Dragos Nicolae VIZIREANU

**Abstract:**

One of the main image representations in Mathematical Morphology is the 3D Shape Decomposition Representation, useful for Image Compression and Representation,and Pattern Recognition. The 3D Morphological Shape Decomposition representation can be generalized a number of times,to extend the scope of its algebraic characteristics as much as possible. With these generalizations, the Morphological Shape Decomposition 's role to serve as an efficient image decomposition tool is extended to grayscale images.This work follows the above line, and further develops it. Anew evolutionary branch is added to the 3D Morphological Shape Decomposition's development, by the introduction of a 3D Multi Structuring Element Morphological Shape Decomposition, which permits 3D Morphological Shape Decomposition of 3D binary images (grayscale images) into "multiparameter" families of elements. At the beginning, 3D Morphological Shape Decomposition representations are based only on "1 parameter" families of elements for image decomposition.This paper addresses the gray scale inter frame interpolation by means of mathematical morphology. The new interframe interpolation method is based on generalized morphological 3D Shape Decomposition. This article will present the theoretical background of the morphological interframe interpolation, deduce the new representation and show some application examples.Computer simulations could illustrate results.

**Keywords:**
3D shape decomposition representation,
mathematical morphology,
gray scale interframe interpolation

##### 4812 Blind Identification and Equalization of CDMA Signals Using the Levenvberg-Marquardt Algorithm

**Authors:**
Mohammed Boutalline,
Imad Badi,
Belaid Bouikhalene,
Said Safi

**Abstract:**

In this paper we describe the Levenvberg-Marquardt (LM) algorithm for identification and equalization of CDMA signals received by an antenna array in communication channels. The synthesis explains the digital separation and equalization of signals after propagation through multipath generating intersymbol interference (ISI). Exploiting discrete data transmitted and three diversities induced at the reception, the problem can be composed by the Block Component Decomposition (BCD) of a tensor of order 3 which is a new tensor decomposition generalizing the PARAFAC decomposition. We optimize the BCD decomposition by Levenvberg-Marquardt method gives encouraging results compared to classical alternating least squares algorithm (ALS). In the equalization part, we use the Minimum Mean Square Error (MMSE) to perform the presented method. The simulation results using the LM algorithm are important.

**Keywords:**
Identification and equalization,
communication
channel,
Levenvberg-Marquardt,
tensor decomposition

##### 4811 A Review on Comparative Analysis of Path Planning and Collision Avoidance Algorithms

**Authors:**
Divya Agarwal,
Pushpendra S. Bharti

**Abstract:**

Autonomous mobile robots (AMR) are expected as smart tools for operations in every automation industry. Path planning and obstacle avoidance is the backbone of AMR as robots have to reach their goal location avoiding obstacles while traversing through optimized path defined according to some criteria such as distance, time or energy. Path planning can be classified into global and local path planning where environmental information is known and unknown/partially known, respectively. A number of sensors are used for data collection. A number of algorithms such as artificial potential field (APF), rapidly exploring random trees (RRT), bidirectional RRT, Fuzzy approach, Purepursuit, A* algorithm, vector field histogram (VFH) and modified local path planning algorithm, etc. have been used in the last three decades for path planning and obstacle avoidance for AMR. This paper makes an attempt to review some of the path planning and obstacle avoidance algorithms used in the field of AMR. The review includes comparative analysis of simulation and mathematical computations of path planning and obstacle avoidance algorithms using MATLAB 2018a. From the review, it could be concluded that different algorithms may complete the same task (i.e. with a different set of instructions) in less or more time, space, effort, etc.

**Keywords:**
Autonomous mobile robots,
obstacle avoidance,
path planning,
and processing time.

##### 4810 Optimizing Approach for Sifting Process to Solve a Common Type of Empirical Mode Decomposition Mode Mixing

**Authors:**
Saad Al-Baddai,
Karema Al-Subari,
Elmar Lang,
Bernd Ludwig

**Abstract:**

**Keywords:**
Empirical mode decomposition,
mode mixing,
sifting
process,
over-sifting.

##### 4809 Estimating Shortest Circuit Path Length Complexity

**Authors:**
Azam Beg,
P. W. Chandana Prasad,
S.M.N.A Senenayake

**Abstract:**

**Keywords:**
Monte Carlo circuit simulation data,
binary
decision diagrams,
neural network modeling,
shortest path length
estimation

##### 4808 A Reconfigurable Processing Element for Cholesky Decomposition and Matrix Inversion

**Authors:**
Aki Happonen,
Adrian Burian,
Erwin Hemming

**Abstract:**

**Keywords:**
Cholesky Decomposition,
Fixed-point,
Matrix
inversion,
Reconfigurable processing.

##### 4807 Blind Channel Estimation Based on URV Decomposition Technique for Uplink of MC-CDMA

**Authors:**
Pradya Pornnimitkul,
Suwich Kunaruttanapruk,
Bamrung Tau Sieskul,
Somchai Jitapunkul

**Abstract:**

In this paper, we investigate a blind channel estimation method for Multi-carrier CDMA systems that use a subspace decomposition technique. This technique exploits the orthogonality property between the noise subspace and the received user codes to obtain channel of each user. In the past we used Singular Value Decomposition (SVD) technique but SVD have most computational complexity so in this paper use a new algorithm called URV Decomposition, which serve as an intermediary between the QR decomposition and SVD, replaced in SVD technique to track the noise space of the received data. Because of the URV decomposition has almost the same estimation performance as the SVD, but has less computational complexity.

**Keywords:**
Channel estimation,
MC-CDMA,
SVD,
URV.

##### 4806 The Same or Not the Same - On the Variety of Mechanisms of Path Dependence

**Authors:**
Jürgen Beyer

**Abstract:**

**Keywords:**
path dependence,
increasing returns,
historicalinstitutionalism,
lock-in.

##### 4805 Using Multi-Thread Technology Realize Most Short-Path Parallel Algorithm

**Authors:**
Chang-le Lu,
Yong Chen

**Abstract:**

**Keywords:**
Dijkstra algorithm,
parallel algorithms,
multi-thread
technology,
most short-path,
ratio.

##### 4804 An UML Statechart Diagram-Based MM-Path Generation Approach for Object-Oriented Integration Testing

**Authors:**
Ruilian Zhao,
Ling Lin

**Abstract:**

MM-Path, an acronym for Method/Message Path, describes the dynamic interactions between methods in object-oriented systems. This paper discusses the classifications of MM-Path, based on the characteristics of object-oriented software. We categorize it according to the generation reasons, the effect scope and the composition of MM-Path. A formalized representation of MM-Path is also proposed, which has considered the influence of state on response method sequences of messages. .Moreover, an automatic MM-Path generation approach based on UML Statechart diagram has been presented, and the difficulties in identifying and generating MM-Path can be solved. . As a result, it provides a solid foundation for further research on test cases generation based on MM-Path.

**Keywords:**
MM-Path,
Message Sequence,
Object-Oriented Integration Testing,
Response Method Sequence,
UML Statechart Diagram.

##### 4803 Laplace Decomposition Approximation Solution for a System of Multi-Pantograph Equations

**Authors:**
M. A. Koroma,
C. Zhan,
A. F. Kamara,
A. B. Sesay

**Abstract:**

In this work we adopt a combination of Laplace transform and the decomposition method to find numerical solutions of a system of multi-pantograph equations. The procedure leads to a rapid convergence of the series to the exact solution after computing a few terms. The effectiveness of the method is demonstrated in some examples by obtaining the exact solution and in others by computing the absolute error which decreases as the number of terms of the series increases.

**Keywords:**
Laplace decomposition,
pantograph equations,
exact
solution,
numerical solution,
approximate solution.

##### 4802 N-Sun Decomposition of Complete Graphs and Complete Bipartite Graphs

**Authors:**
R. Anitha,
R. S. Lekshmi

**Abstract:**

**Keywords:**
Hamilton cycle,
n-sun decomposition,
perfectmatching,
spanning tree.

##### 4801 The Traffic Prediction Multi-path Energy-aware Source Routing (TP-MESR)in Ad hoc Networks

**Authors:**
Su Jin Kim,
Ji Yeon Cho,
Bong Gyou Lee

**Abstract:**

**Keywords:**
Ad hoc,
energy-aware,
multi-path,
routing protocol,
traffic prediction.

##### 4800 Adomian’s Decomposition Method to Generalized Magneto-Thermoelasticity

**Authors:**
Hamdy M. Youssef,
Eman A. Al-Lehaibi

**Abstract:**

Due to many applications and problems in the fields of plasma physics, geophysics, and other many topics, the interaction between the strain field and the magnetic field has to be considered. Adomian introduced the decomposition method for solving linear and nonlinear functional equations. This method leads to accurate, computable, approximately convergent solutions of linear and nonlinear partial and ordinary differential equations even the equations with variable coefficients. This paper is dealing with a mathematical model of generalized thermoelasticity of a half-space conducting medium. A magnetic field with constant intensity acts normal to the bounding plane has been assumed. Adomian’s decomposition method has been used to solve the model when the bounding plane is taken to be traction free and thermally loaded by harmonic heating. The numerical results for the temperature increment, the stress, the strain, the displacement, the induced magnetic, and the electric fields have been represented in figures. The magnetic field, the relaxation time, and the angular thermal load have significant effects on all the studied fields.

**Keywords:**
Adomian’s Decomposition Method,
magneto-thermoelasticity,
finite conductivity,
iteration method,
thermal load.

##### 4799 Analysis of Catalytic Properties of Ni3Al Thin Foils for the Methanol and Hexane Decomposition

**Authors:**
M. Michalska-Domańska,
P. Jóźwik,
Z. Bojar

**Abstract:**

**Keywords:**
hexane decomposition,
methanol decomposition,
Ni3Al thin foils,
Ni nanoparticles

##### 4798 N-Sun Decomposition of Complete, Complete Bipartite and Some Harary Graphs

**Authors:**
R. Anitha,
R. S. Lekshmi

**Abstract:**

**Keywords:**
Decomposition,
Hamilton cycle,
n-sun graph,
perfect matching,
spanning tree.

##### 4797 Influence of Number Parallels Paths of a Winding on Overvoltage in the Asynchronous Motors Fed by PWM- converters

**Authors:**
Belassel Mohand-Tahar

**Abstract:**

**Keywords:**
Asynchronous Motors,
Parallel path,
PWMconverters,
Undulatory process,
Undulatory parameters,
Undulatory
voltage

##### 4796 Learning Monte Carlo Data for Circuit Path Length

**Authors:**
Namal A. Senanayake,
A. Beg,
Withana C. Prasad

**Abstract:**

**Keywords:**
Monte Carlo data,
Binary decision diagrams,
Neural
network modeling,
Shortest path length estimation.

##### 4795 Principal Component Analysis using Singular Value Decomposition of Microarray Data

**Authors:**
Dong Hoon Lim

**Abstract:**

A series of microarray experiments produces observations of differential expression for thousands of genes across multiple conditions. Principal component analysis(PCA) has been widely used in multivariate data analysis to reduce the dimensionality of the data in order to simplify subsequent analysis and allow for summarization of the data in a parsimonious manner. PCA, which can be implemented via a singular value decomposition(SVD), is useful for analysis of microarray data. For application of PCA using SVD we use the DNA microarray data for the small round blue cell tumors(SRBCT) of childhood by Khan et al.(2001). To decide the number of components which account for sufficient amount of information we draw scree plot. Biplot, a graphic display associated with PCA, reveals important features that exhibit relationship between variables and also the relationship of variables with observations.

**Keywords:**
Principal component analysis,
singular value decomposition,
microarray data,
SRBCT

##### 4794 A Hamiltonian Decomposition of 5-star

**Authors:**
Walter Hussak,
Heiko Schröder

**Abstract:**

Star graphs are Cayley graphs of symmetric groups of permutations, with transpositions as the generating sets. A star graph is a preferred interconnection network topology to a hypercube for its ability to connect a greater number of nodes with lower degree. However, an attractive property of the hypercube is that it has a Hamiltonian decomposition, i.e. its edges can be partitioned into disjoint Hamiltonian cycles, and therefore a simple routing can be found in the case of an edge failure. The existence of Hamiltonian cycles in Cayley graphs has been known for some time. So far, there are no published results on the much stronger condition of the existence of Hamiltonian decompositions. In this paper, we give a construction of a Hamiltonian decomposition of the star graph 5-star of degree 4, by defining an automorphism for 5-star and a Hamiltonian cycle which is edge-disjoint with its image under the automorphism.

**Keywords:**
interconnection networks,
paths and cycles,
graphs andgroups.

##### 4793 New Subband Adaptive IIR Filter Based On Polyphase Decomposition

**Authors:**
Young-Seok Choi

**Abstract:**

We present a subband adaptive infinite-impulse response (IIR) filtering method, which is based on a polyphase decomposition of IIR filter. Motivated by the fact that the polyphase structure has benefits in terms of convergence rate and stability, we introduce the polyphase decomposition to subband IIR filtering, i.e., in each subband high order IIR filter is decomposed into polyphase IIR filters with lower order. Computer simulations demonstrate that the proposed method has improved convergence rate over conventional IIR filters.

**Keywords:**
Subband adaptive filter,
IIR filtering. Polyphase decomposition.

##### 4792 A Low-cost Reconfigurable Architecture for AES Algorithm

**Authors:**
Yibo Fan,
Takeshi Ikenaga,
Yukiyasu Tsunoo,
Satoshi Goto

**Abstract:**

**Keywords:**
AES,
Reconfigurable architecture,
low cost

##### 4791 Lifting Wavelet Transform and Singular Values Decomposition for Secure Image Watermarking

**Authors:**
Siraa Ben Ftima,
Mourad Talbi,
Tahar Ezzedine

**Abstract:**

**Keywords:**
Color image,
grayscale image,
singular values decomposition,
lifting wavelet transform,
image watermarking,
watermark,
secure.

##### 4790 Maximum Induced Subgraph of an Augmented Cube

**Authors:**
Meng-Jou Chien,
Jheng-Cheng Chen,
Chang-Hsiung Tsai

**Abstract:**

Let max_{ζG}(*m*) denote the maximum number of edges in a subgraph of graph *G *induced by *m* nodes. The *n*-dimensional augmented cube, denoted as *AQn*, a variation of the hypercube, possesses some properties superior to those of the hypercube. We study the cases when *G* is the augmented cube *AQn*.

**Keywords:**
Interconnection network,
Augmented cube,
Induced subgraph,
Bisection width.