**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**856

# Search results for: Path decomposition

##### 856 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.

##### 855 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.

##### 854 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.

##### 853 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.

##### 852 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

##### 851 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.

##### 850 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.

##### 849 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.

##### 848 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

##### 847 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

##### 846 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.

##### 845 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.

##### 844 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.

##### 843 A Novel Instantaneous Frequency Computation Approach for Empirical Mode Decomposition

**Authors:**
Liming Zhang

**Abstract:**

**Keywords:**
Instantaneous frequency,
empirical mode decomposition,
intrinsic mode function.

##### 842 Adaptive Fourier Decomposition Based Signal Instantaneous Frequency Computation Approach

**Authors:**
Liming Zhang

**Abstract:**

**Keywords:**
Adaptive Fourier decomposition,
Fourier series,
signal processing,
instantaneous frequency

##### 841 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

##### 840 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.

##### 839 Module and Comodule Structures on Path Space

**Abstract:**

*kQ*, there is a trivial

*kQ*-module structure determined by the multiplication of path algebra

^{a}*kQ*and a trivial

^{a }*kQ*-comodule structure determined by the comultiplication of path coalgebra

^{c}*kQ*. In this paper, on path space

^{c}*kQ*, a nontrivial

*kQ*-module structure is defined, and it is proved that this nontrivial left

^{a}*kQ*-module structure is isomorphic to the dual module structure of trivial right

^{a}*kQ*-comodule. Dually, on path space

^{c}*kQ*, a nontrivial

*kQ*-comodule structure is defined, and it is proved that this nontrivial right

^{c}*kQ*-comodule structure is isomorphic to the dual comodule structure of trivial left

^{c}*kQ*-module. Finally, the trivial and nontrivial module structures on path space are compared from the aspect of submodule, and the trivial and nontrivial comodule structures on path space are compared from the aspect of subcomodule.

^{a}**Keywords:**
Quiver,
path space,
module,
comodule,
dual.

##### 838 A Decomposition Method for the Bipartite Separability of Bell Diagonal States

**Authors:**
Wei-Chih Su,
Kuan-Peng Chen,
Ming-Chung Tsai,
Zheng-Yao Su

**Abstract:**

**Keywords:**
decomposition,
bipartite separability,
Bell diagonal states.

##### 837 Algebraic Riccati Matrix Equation for Eigen- Decomposition of Special Structured Matrices; Applications in Structural Mechanics

**Authors:**
Mahdi Nouri

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

**Keywords:**
Riccati,
matrix equation,
eigenvalue problem,
symmetric,
bisymmetric,
persymmetric,
decomposition,
canonical
forms,
Graphs theory,
adjacency and Laplacian matrices.

##### 836 Geometric Data Structures and Their Selected Applications

**Authors:**
Miloš Šeda

**Abstract:**

**Keywords:**
motion planning,
spanning tree,
Steiner tree,
Delaunay triangulation,
Voronoi diagram.

##### 835 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.

##### 834 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.

##### 833 ECG Analysis using Nature Inspired Algorithm

**Authors:**
A.Sankara Subramanian,
G.Gurusamy,
G.Selvakumar,
P.Gnanasekar,
A.Nagappan

**Abstract:**

**Keywords:**
Daubechies 4 Wavelet,
ECG,
Nature inspired
algorithm,
Ventricular Arrhythmias,
Wavelet Decomposition.

##### 832 The Problem of Using the Calculation of the Critical Path to Solver Instances of the Job Shop Scheduling Problem

**Authors:**
Marco Antonio Cruz-Chávez,
Juan Frausto-Solís,
Fernando Ramos-Quintana

**Abstract:**

A procedure commonly used in Job Shop Scheduling Problem (JSSP) to evaluate the neighborhoods functions that use the non-deterministic algorithms is the calculation of the critical path in a digraph. This paper presents an experimental study of the cost of computation that exists when the calculation of the critical path in the solution for instances in which a JSSP of large size is involved. The results indicate that if the critical path is use in order to generate neighborhoods in the meta-heuristics that are used in JSSP, an elevated cost of computation exists in spite of the fact that the calculation of the critical path in any digraph is of polynomial complexity.

**Keywords:**
Job Shop,
CPM,
critical path,
neighborhood,
meta-heuristic.

##### 831 An Improved Transfer Logic of the Two-Path Algorithm for Acoustic Echo Cancellation

**Abstract:**

**Keywords:**
Acoustic echo cancellation,
Echo return lossenhancement (ERLE),
Two-path algorithm,
Transfer logic

##### 830 Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization

**Authors:**
Lana Dalawr Jalal

**Abstract:**

**Keywords:**
Obstacle Avoidance,
Particle Swarm Optimization,
Three-Dimensional Path Planning Unmanned Aerial Vehicles.

##### 829 A Reconfigurable Processing Element Implementation for Matrix Inversion Using Cholesky Decomposition

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

**Abstract:**

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

##### 828 Linear Elasticity Problems Solved by Using the Fictitious Domain Method and Total - FETI Domain Decomposition

**Authors:**
Lukas Mocek,
Alexandros Markopoulos

**Abstract:**

The main goal of this paper is to show a possibility, how to solve numerically elliptic boundary value problems arising in 2D linear elasticity by using the fictitious domain method (FDM) and the Total-FETI domain decomposition method. We briefly mention the theoretical background of these methods and demonstrate their performance on a benchmark.

**Keywords:**
Linear elasticity,
fictitious domain method,
Total-FETI,
domain decomposition,
saddle-point system.

##### 827 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.