**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**2654

# Search results for: linear degradation path

##### 2654 A Partially Accelerated Life Test Planning with Competing Risks and Linear Degradation Path under Tampered Failure Rate Model

**Authors:**
Fariba Azizi,
Firoozeh Haghighi,
Viliam Makis

**Abstract:**

**Keywords:**
Expectation-maximization (EM) algorithm,
cause of
failure,
intensity,
linear degradation path,
masked data,
reliability
function.

##### 2653 Optimizing Network Latency with Fast Path Assignment for Incoming Flows

**Abstract:**

**Keywords:**
Latency,
Fast path assignment,
Bottleneck link.

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

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

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

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

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

##### 2647 Blind Image Deconvolution by Neural Recursive Function Approximation

**Authors:**
Jiann-Ming Wu,
Hsiao-Chang Chen,
Chun-Chang Wu,
Pei-Hsun Hsu

**Abstract:**

This work explores blind image deconvolution by recursive function approximation based on supervised learning of neural networks, under the assumption that a degraded image is linear convolution of an original source image through a linear shift-invariant (LSI) blurring matrix. Supervised learning of neural networks of radial basis functions (RBF) is employed to construct an embedded recursive function within a blurring image, try to extract non-deterministic component of an original source image, and use them to estimate hyper parameters of a linear image degradation model. Based on the estimated blurring matrix, reconstruction of an original source image from a blurred image is further resolved by an annealed Hopfield neural network. By numerical simulations, the proposed novel method is shown effective for faithful estimation of an unknown blurring matrix and restoration of an original source image.

**Keywords:**
Blind image deconvolution,
linear shift-invariant(LSI),
linear image degradation model,
radial basis functions (rbf),
recursive function,
annealed Hopfield neural networks.

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

##### 2645 Weight Loss Degradation of Hybrid Blends LLDPE/Starch/PVA upon Exposure to UV Light and Soil Burial

**Authors:**
M. Rahmah,
Noor Zuhaira Abd Aziz,
M. Mohd Muizz Fahimi,
M. Farhan

**Abstract:**

Poly bag and mulch films for agricultural field caused pose environmental problem due to the non-degradable plastics wastes upon disposal. Thus, a degradable poly bag was designed with hybrid sago starch (SS) and polyvinyl alcohol (PVA). Two Different blended compositions of SS and PVA hybrid have been compounded. Then, the hybrids blended are mixed with linear line density polyethylene (LLDPE) resin to fabricate poly bag film through conventional film blowing process. Samples of LLDPE, SS and PVA hybrid film were exposed to UV light and soil burial. The weight losses were determined during degradation process. Hybrid film by degradation of starch was found to hydrolyze and hydroxyl groups decrease on esterification upon exposure to soil burial and uv radiation. It was found out that, the hybrid film for 60% of SS composition showed greatest degradation in soil and UV radiation.

**Keywords:**
LLDPE,
PVA,
sago starch,
degradation,
soil burial,
UV radiation.

##### 2644 A New Multi-Target, Multi-Agent Search-and-Rescue Path Planning Approach

**Authors:**
Jean Berger,
Nassirou Lo,
Martin Noel

**Abstract:**

Perfectly suited for natural or man-made emergency and disaster management situations such as flood, earthquakes, tornadoes, or tsunami, multi-target search path planning for a team of rescue agents is known to be computationally hard, and most techniques developed so far come short to successfully estimate optimality gap. A novel mixed-integer linear programming (MIP) formulation is proposed to optimally solve the multi-target multi-agent discrete search and rescue (SAR) path planning problem. Aimed at maximizing cumulative probability of successful target detection, it captures anticipated feedback information associated with possible observation outcomes resulting from projected path execution, while modeling agent discrete actions over all possible moving directions. Problem modeling further takes advantage of network representation to encompass decision variables, expedite compact constraint specification, and lead to substantial problem-solving speed-up. The proposed MIP approach uses CPLEX optimization machinery, efficiently computing near-optimal solutions for practical size problems, while giving a robust upper bound obtained from Lagrangean integrality constraint relaxation. Should eventually a target be positively detected during plan execution, a new problem instance would simply be reformulated from the current state, and then solved over the next decision cycle. A computational experiment shows the feasibility and the value of the proposed approach.

**Keywords:**
Search path planning,
search and rescue,
multi-agent,
mixed-integer linear programming,
optimization.

##### 2643 Image Restoration in Non-Linear Filtering Domain using MDB approach

**Authors:**
S. K. Satpathy,
S. Panda,
K. K. Nagwanshi,
C. Ardil

**Abstract:**

This paper proposes a new technique based on nonlinear Minmax Detector Based (MDB) filter for image restoration. The aim of image enhancement is to reconstruct the true image from the corrupted image. The process of image acquisition frequently leads to degradation and the quality of the digitized image becomes inferior to the original image. Image degradation can be due to the addition of different types of noise in the original image. Image noise can be modeled of many types and impulse noise is one of them. Impulse noise generates pixels with gray value not consistent with their local neighborhood. It appears as a sprinkle of both light and dark or only light spots in the image. Filtering is a technique for enhancing the image. Linear filter is the filtering in which the value of an output pixel is a linear combination of neighborhood values, which can produce blur in the image. Thus a variety of smoothing techniques have been developed that are non linear. Median filter is the one of the most popular non-linear filter. When considering a small neighborhood it is highly efficient but for large window and in case of high noise it gives rise to more blurring to image. The Centre Weighted Mean (CWM) filter has got a better average performance over the median filter. However the original pixel corrupted and noise reduction is substantial under high noise condition. Hence this technique has also blurring affect on the image. To illustrate the superiority of the proposed approach, the proposed new scheme has been simulated along with the standard ones and various restored performance measures have been compared.

**Keywords:**
Filtering,
Minmax Detector Based (MDB),
noise,
centre weighted mean filter,
PSNR,
restoration.

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

##### 2641 Passive Non-Prehensile Manipulation on Helix Path Based on Mechanical Intelligence

**Authors:**
Abdullah Bajelan,
Adel Akbarimajd

**Abstract:**

**Keywords:**
Mechanical intelligence,
Object manipulation,
Passive mechanism,
Passive non-prehensile manipulation.

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

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

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

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

##### 2636 Effect of Different pH on Canthaxanthin Degradation

**Authors:**
N. Seyedrazi,
S. H. Razavi,
Z. Emam-Djomeh

**Abstract:**

**Keywords:**
Degradation,
Emulsion,
Response SurfaceMethodology (RSM)

##### 2635 A Comparison of the Sum of Squares in Linear and Partial Linear Regression Models

**Authors:**
Dursun Aydın

**Abstract:**

**Keywords:**
Partial Linear Regression Model,
Linear RegressionModel,
Residuals,
Deviance,
Smoothing Spline.

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

##### 2633 Drivers of Land Degradation in Trays Ecosystem as Modulated under a Changing Climate: Case Study of Côte d'Ivoire

**Authors:**
Kadio Valere R. Angaman,
Birahim Bouna Niang

**Abstract:**

Land degradation is a serious problem in developing countries including Cote d’Ivoire, which has its economy focused on agriculture. It occurs in all kinds of ecosystems over the world. However, the drivers of land degradation vary from one region to another, and from one ecosystem to another. Thus, identifying these drivers is an essential prerequisite to develop and implement appropriate policies to reverse the trend of land degradation in the country, especially in the trays ecosystem. Using the binary logistic model with primary data obtained through 780 farmers surveyed, we analyze and identify the drivers of land degradation in the trays ecosystem. The descriptive statistics show that 52% of farmers interviewed have stated facing land degradation in their farmland. This high rate shows the extent of land degradation in this ecosystem. Also, the results obtained from the binary logit regression reveal that land degradation is significantly influenced by a set of variables such as sex, education, slope, erosion, pesticide, agricultural activity, deforestation, and temperature. The drivers identified are mostly local, as a result, the government must implement some policies and strategies that facilitate and incentive the adoption of sustainable land management practices by farmers to reverse the negative trend of land degradation.

**Keywords:**
Drivers,
land degradation,
trays ecosystem,
sustainable land management.

##### 2632 An Approach to the Solving Non-Steiner Minimum Link Path Problem

**Authors:**
V. Tereshchenko,
A. Tregubenko

**Abstract:**

In this study we survey the method for fast finding a minimum link path between two arbitrary points within a simple polygon, which can pass only through the vertices, with preprocessing.

**Keywords:**
Minimum link path,
simple polygon,
Steiner points,
optimal algorithm.

##### 2631 Memetic Algorithm Based Path Planning for a Mobile Robot

**Authors:**
Neda Shahidi,
Hadi Esmaeilzadeh,
Marziye Abdollahi,
Caro Lucas

**Abstract:**

In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memetic algorithm. What is new in this work is a novel representation of solutions for evolutionary algorithms that is efficient, simple and also compatible with memetic algorithm. The new representation makes it possible to solve the problem with a small population and in a few generations. It also makes the genetic operator simple and allows using an efficient local search operator within the evolutionary algorithm. The proposed algorithm is applied to two instances of path planning problem and the results are available.

**Keywords:**
Path planning problem,
Memetic Algorithm,
Representation.

##### 2630 Thermal Analysis of the Current Path from Circuit Breakers Using Finite Element Method

**Authors:**
Adrian T. Plesca

**Abstract:**

**Keywords:**
Current path,
power circuit breakers,
temperature
distribution,
thermal analysis.

##### 2629 Simplex Method for Fuzzy Variable Linear Programming Problems

**Authors:**
S.H. Nasseri,
E. Ardil

**Abstract:**

Fuzzy linear programming is an application of fuzzy set theory in linear decision making problems and most of these problems are related to linear programming with fuzzy variables. A convenient method for solving these problems is based on using of auxiliary problem. In this paper a new method for solving fuzzy variable linear programming problems directly using linear ranking functions is proposed. This method uses simplex tableau which is used for solving linear programming problems in crisp environment before.

**Keywords:**
Fuzzy variable linear programming,
fuzzy number,
ranking function,
simplex method.

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

##### 2627 Path Planning of a Robot Manipulator using Retrieval RRT Strategy

**Authors:**
K. Oh,
J. P. Hwang,
E. Kim,
H. Lee

**Abstract:**

**Keywords:**
Path planning,
RRT,
6 DOF manipulator,
SVM.

##### 2626 Optimal Path Planning under Priori Information in Stochastic, Time-varying Networks

**Authors:**
Siliang Wang,
Minghui Wang,
Jun Hu

**Abstract:**

**Keywords:**
pruning method,
stochastic,
time-varying networks,
optimal path planning.

##### 2625 Path-Tracking Controller for Tracked Mobile Robot on Rough Terrain

**Authors:**
Toshifumi Hiramatsu,
Satoshi Morita,
Manuel Pencelli,
Marta Niccolini,
Matteo Ragaglia,
Alfredo Argiolas

**Abstract:**

Automation technologies for agriculture field are needed to promote labor-saving. One of the most relevant problems in automated agriculture is represented by controlling the robot along a predetermined path in presence of rough terrain or incline ground. Unfortunately, disturbances originating from interaction with the ground, such as slipping, make it quite difficult to achieve the required accuracy. In general, it is required to move within 5-10 cm accuracy with respect to the predetermined path. Moreover, lateral velocity caused by gravity on the incline field also affects slipping. In this paper, a path-tracking controller for tracked mobile robots moving on rough terrains of incline field such as vineyard is presented. The controller is composed of a disturbance observer and an adaptive controller based on the kinematic model of the robot. The disturbance observer measures the difference between the measured and the reference yaw rate and linear velocity in order to estimate slip. Then, the adaptive controller adapts “virtual” parameter of the kinematics model: Instantaneous Centers of Rotation (ICRs). Finally, target angular velocity reference is computed according to the adapted parameter. This solution allows estimating the effects of slip without making the model too complex. Finally, the effectiveness of the proposed solution is tested in a simulation environment.

**Keywords:**
Agricultural robot,
autonomous control,
path-tracking control,
tracked mobile robot.