**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**3508

# Search results for: Approximate algorithm

##### 3508 Approximation Algorithm for the Shortest Approximate Common Superstring Problem

**Authors:**
A.S. Rebaï,
M. Elloumi

**Abstract:**

**Keywords:**
Shortest approximate common superstring,
approximation algorithms,
strings overlaps,
complexities.

##### 3507 Approximate Frequent Pattern Discovery Over Data Stream

**Authors:**
Kittisak Kerdprasop,
Nittaya Kerdprasop

**Abstract:**

**Keywords:**
Frequent pattern discovery,
Approximate algorithm,
Data stream analysis.

##### 3506 A Special Algorithm to Approximate the Square Root of Positive Integer

**Authors:**
Hsian Ming Goo

**Abstract:**

The paper concerns a special approximate algorithm of the square root of the specific positive integer, which is built by the use of the property of positive integer solution of the Pell’s equation, together with using some elementary theorems of matrices, and then takes it to compare with general used the Newton’s method and give a practical numerical example and error analysis; it is unexpected to find its special property: the significant figure of the approximation value of the square root of positive integer will increase one digit by one. It is well useful in some occasions.

**Keywords:**
Special approximate algorithm,
square root,
Pell’s
equation,
Newton’s method,
error analysis.

##### 3505 Optimal Control Problem, Quasi-Assignment Problem and Genetic Algorithm

**Authors:**
Omid S. Fard,
Akbar H. Borzabadi

**Abstract:**

**Keywords:**
Optimal control,
Integer programming,
Genetic algorithm,
Discrete approximation,
Linear programming.

##### 3504 Constructing a Simple Polygonalizations

**Authors:**
V. Tereshchenko,
V. Muravitskiy

**Abstract:**

**Keywords:**
simple polygon,
approximate algorithm,
minimal
area polygon,
polygonalizations

##### 3503 On Constructing Approximate Convex Hull

**Authors:**
M. Zahid Hossain,
M. Ashraful Amin

**Abstract:**

The algorithms of convex hull have been extensively studied in literature, principally because of their wide range of applications in different areas. This article presents an efficient algorithm to construct approximate convex hull from a set of n points in the plane in O(n + k) time, where k is the approximation error control parameter. The proposed algorithm is suitable for applications preferred to reduce the computation time in exchange of accuracy level such as animation and interaction in computer graphics where rapid and real-time graphics rendering is indispensable.

**Keywords:**
Convex hull,
Approximation algorithm,
Computational
geometry,
Linear time.

##### 3502 Some Preconditioners for Block Pentadiagonal Linear Systems Based on New Approximate Factorization Methods

**Authors:**
Xian Ming Gu,
Ting Zhu Huang,
Hou Biao Li

**Abstract:**

In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal linear systems suitable for vectors and parallel processors, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are appropriate when the desired target is to maximize parallelism. Moreover, some theoretical results about these preconditioners are presented and how to construct preconditioners effectively for any nonsingular block pentadiagonal H-matrices is also described. In addition, the availability of these preconditioners is illustrated with some numerical experiments arising from two dimensional biharmonic equation.

**Keywords:**
Parallel algorithm,
Pentadiagonal matrix,
Polynomial
approximate inverse,
Preconditioners,
Stair matrix.

##### 3501 Trajectory-Based Modified Policy Iteration

**Abstract:**

**Keywords:**
Markov Decision Process (MDP),
Mobile robot,
Policy iteration,
Simulation.

##### 3500 Approximately Jordan Maps and Their Stability

**Authors:**
Nasrin Eghbali

**Abstract:**

In this paper we consider the approximate Jordan maps and boundedness of these maps. Also we investigate the stability of approximate Jordan maps and prove some stability properties for approximate Jordan maps.

**Keywords:**
Approximate Jordan map,
stability.

##### 3499 Approximately Similarity Measurement of Web Sites Using Genetic Algorithms and Binary Trees

**Authors:**
Doru Anastasiu Popescu,
Dan Rădulescu

**Abstract:**

In this paper, we determine the similarity of two HTML web applications. We are going to use a genetic algorithm in order to determine the most significant web pages of each application (we are not going to use every web page of a site). Using these significant web pages, we will find the similarity value between the two applications. The algorithm is going to be efficient because we are going to use a reduced number of web pages for comparisons but it will return an approximate value of the similarity. The binary trees are used to keep the tags from the significant pages. The algorithm was implemented in Java language.

**Keywords:**
Tag,
HTML,
web page,
genetic algorithm,
similarity value,
binary tree.

##### 3498 Spline Basis Neural Network Algorithm for Numerical Integration

**Authors:**
Lina Yan,
Jingjing Di,
Ke Wang

**Abstract:**

A new basis function neural network algorithm is proposed for numerical integration. The main idea is to construct neural network model based on spline basis functions, which is used to approximate the integrand by training neural network weights. The convergence theorem of the neural network algorithm, the theorem for numerical integration and one corollary are presented and proved. The numerical examples, compared with other methods, show that the algorithm is effective and has the characteristics such as high precision and the integrand not required known. Thus, the algorithm presented in this paper can be widely applied in many engineering fields.

**Keywords:**
Numerical integration,
Spline basis function,
Neural
network algorithm

##### 3497 An Improved Ant Colony Algorithm for Genome Rearrangements

**Authors:**
Essam Al Daoud

**Abstract:**

Genome rearrangement is an important area in computational biology and bioinformatics. The basic problem in genome rearrangements is to compute the edit distance, i.e., the minimum number of operations needed to transform one genome into another. Unfortunately, unsigned genome rearrangement problem is NP-hard. In this study an improved ant colony optimization algorithm to approximate the edit distance is proposed. The main idea is to convert the unsigned permutation to signed permutation and evaluate the ants by using Kaplan algorithm. Two new operations are added to the standard ant colony algorithm: Replacing the worst ants by re-sampling the ants from a new probability distribution and applying the crossover operations on the best ants. The proposed algorithm is tested and compared with the improved breakpoint reversal sort algorithm by using three datasets. The results indicate that the proposed algorithm achieves better accuracy ratio than the previous methods.

**Keywords:**
Ant colony algorithm,
Edit distance,
Genome breakpoint,
Genome rearrangement,
Reversal sort.

##### 3496 Image Dehazing Using Dark Channel Prior and Fast Guided Filter in Daubechies Lifting Wavelet Transform Domain

**Authors:**
Harpreet Kaur,
Sudipta Majumdar

**Abstract:**

In this paper a method for image dehazing is proposed in lifting wavelet transform domain. Lifting Daubechies (D4) wavelet has been used to obtain the approximate image and detail images. As the haze is contained in low frequency part, only the approximate image is used for further processing. This region is processed by dehazing algorithm based on dark channel prior (DCP). The dehazed approximate image is then recombined with the detail images using inverse lifting wavelet transform. Implementation of lifting wavelet transform has the advantage of auxiliary memory saving, fast implementation and simplicity. Also, the proposed method deals with near white scene problem, blue horizon issue and localized light sources in a way to enhance image quality and makes the algorithm robust. Simulation results present improvement in terms of visual quality, parameters such as root mean square (RMS) contrast, structural similarity index (SSIM), entropy and execution time.

**Keywords:**
Dark channel prior,
image dehazing,
lifting wavelet transform.

##### 3495 A New Derivative-Free Quasi-Secant Algorithm For Solving Non-Linear Equations

**Authors:**
F. Soleymani,
M. Sharifi

**Abstract:**

**Keywords:**
Non-linear equation,
iterative methods,
derivative-free,
convergence.

##### 3494 Using Interval Trees for Approximate Indexing of Instances

**Authors:**
Khalil el Hindi

**Abstract:**

This paper presents a simple and effective method for approximate indexing of instances for instance based learning. The method uses an interval tree to determine a good starting search point for the nearest neighbor. The search stops when an early stopping criterion is met. The method proved to be very effective especially when only the first nearest neighbor is required.

**Keywords:**
Instance based learning,
interval trees,
the knn
algorithm,
machine learning.

##### 3493 An Efficient Algorithm for Reliability Lower Bound of Distributed Systems

**Authors:**
Mohamed H. S. Mohamed,
Yang Xiao-zong,
Liu Hong-wei,
Wu Zhi-bo

**Abstract:**

**Keywords:**
Distributed systems,
probabilistic network,
residual
connectedness reliability,
lower bound.

##### 3492 Finding Approximate Tandem Repeats with the Burrows-Wheeler Transform

**Authors:**
Agnieszka Danek,
Rafał Pokrzywa

**Abstract:**

**Keywords:**
approximate tandem repeats,
Burrows-Wheeler transform,
Hamming distance,
suffix array

##### 3491 A New Approach to the Approximate Solutions of Hamilton-Jacobi Equations

**Authors:**
Joe Imae,
Kenjiro Shinagawa,
Tomoaki Kobayashi,
Guisheng Zhai

**Abstract:**

We propose a new approach on how to obtain the approximate solutions of Hamilton-Jacobi (HJ) equations. The process of the approximation consists of two steps. The first step is to transform the HJ equations into the virtual time based HJ equations (VT-HJ) by introducing a new idea of ‘virtual-time’. The second step is to construct the approximate solutions of the HJ equations through a computationally iterative procedure based on the VT-HJ equations. It should be noted that the approximate feedback solutions evolve by themselves as the virtual-time goes by. Finally, we demonstrate the effectiveness of our approximation approach by means of simulations with linear and nonlinear control problems.

**Keywords:**
Nonlinear Control,
Optimal Control,
Hamilton-Jacobi Equation,
Virtual-Time

##### 3490 Using Genetic Algorithm to Improve Information Retrieval Systems

**Authors:**
Ahmed A. A. Radwan,
Bahgat A. Abdel Latef,
Abdel Mgeid A. Ali,
Osman A. Sadek

**Abstract:**

**Keywords:**
Cosine similarity,
Fitness function,
Genetic
Algorithm,
Information Retrieval,
Query learning.

##### 3489 A New Approach to Solve Blasius Equation using Parameter Identification of Nonlinear Functions based on the Bees Algorithm (BA)

**Authors:**
E. Assareh,
M.A. Behrang,
M. Ghalambaz,
A.R. Noghrehabadi,
A. Ghanbarzadeh

**Abstract:**

**Keywords:**
Bees Algorithm (BA); Approximate Solutions;
Blasius Differential Equation.

##### 3488 An Approximate Solution of the Classical Van der Pol Oscillator Coupled Gyroscopically to a Linear Oscillator Using Parameter-Expansion Method

**Authors:**
Mohammad Taghi Darvishi,
Samad Kheybari

**Abstract:**

In this article, we are dealing with a model consisting of a classical Van der Pol oscillator coupled gyroscopically to a linear oscillator. The major problem is analyzed. The regular dynamics of the system is considered using analytical methods. In this case, we provide an approximate solution for this system using parameter-expansion method. Also, we find approximate values for frequencies of the system. In parameter-expansion method the solution and unknown frequency of oscillation are expanded in a series by a bookkeeping parameter. By imposing the non-secularity condition at each order in the expansion the method provides different approximations to both the solution and the frequency of oscillation. One iteration step provides an approximate solution which is valid for the whole solution domain.

**Keywords:**
Parameter-expansion method,
classical Van der Pol oscillator.

##### 3487 Solving One-dimensional Hyperbolic Telegraph Equation Using Cubic B-spline Quasi-interpolation

**Authors:**
Marzieh Dosti,
Alireza Nazemi

**Abstract:**

In this paper, the telegraph equation is solved numerically by cubic B-spline quasi-interpolation .We obtain the numerical scheme, by using the derivative of the quasi-interpolation to approximate the spatial derivative of the dependent variable and a low order forward difference to approximate the temporal derivative of the dependent variable. The advantage of the resulting scheme is that the algorithm is very simple so it is very easy to implement. The results of numerical experiments are presented, and are compared with analytical solutions by calculating errors L2 and L∞ norms to confirm the good accuracy of the presented scheme.

**Keywords:**
Cubic B-spline,
quasi-interpolation,
collocation method,
second-order hyperbolic telegraph equation.

##### 3486 Approximate Range-Sum Queries over Data Cubes Using Cosine Transform

**Authors:**
Wen-Chi Hou,
Cheng Luo,
Zhewei Jiang,
Feng Yan

**Abstract:**

##### 3485 Radial Basis Surrogate Model Integrated to Evolutionary Algorithm for Solving Computation Intensive Black-Box Problems

**Authors:**
Abdulbaset Saad,
Adel Younis,
Zuomin Dong

**Abstract:**

For design optimization with high-dimensional expensive problems, an effective and efficient optimization methodology is desired. This work proposes a series of modification to the Differential Evolution (DE) algorithm for solving computation Intensive Black-Box Problems. The proposed methodology is called Radial Basis Meta-Model Algorithm Assisted Differential Evolutionary (RBF-DE), which is a global optimization algorithm based on the meta-modeling techniques. A meta-modeling assisted DE is proposed to solve computationally expensive optimization problems. The Radial Basis Function (RBF) model is used as a surrogate model to approximate the expensive objective function, while DE employs a mechanism to dynamically select the best performing combination of parameters such as differential rate, cross over probability, and population size. The proposed algorithm is tested on benchmark functions and real life practical applications and problems. The test results demonstrate that the proposed algorithm is promising and performs well compared to other optimization algorithms. The proposed algorithm is capable of converging to acceptable and good solutions in terms of accuracy, number of evaluations, and time needed to converge.

**Keywords:**
Differential evolution,
engineering design,
expensive computations,
meta-modeling,
radial basis function,
optimization.

##### 3484 A Spatial Information Network Traffic Prediction Method Based on Hybrid Model

**Authors:**
Jingling Li,
Yi Zhang,
Wei Liang,
Tao Cui,
Jun Li

**Abstract:**

Compared with terrestrial network, the traffic of spatial information network has both self-similarity and short correlation characteristics. By studying its traffic prediction method, the resource utilization of spatial information network can be improved, and the method can provide an important basis for traffic planning of a spatial information network. In this paper, considering the accuracy and complexity of the algorithm, the spatial information network traffic is decomposed into approximate component with long correlation and detail component with short correlation, and a time series hybrid prediction model based on wavelet decomposition is proposed to predict the spatial network traffic. Firstly, the original traffic data are decomposed to approximate components and detail components by using wavelet decomposition algorithm. According to the autocorrelation and partial correlation smearing and truncation characteristics of each component, the corresponding model (AR/MA/ARMA) of each detail component can be directly established, while the type of approximate component modeling can be established by ARIMA model after smoothing. Finally, the prediction results of the multiple models are fitted to obtain the prediction results of the original data. The method not only considers the self-similarity of a spatial information network, but also takes into account the short correlation caused by network burst information, which is verified by using the measured data of a certain back bone network released by the MAWI working group in 2018. Compared with the typical time series model, the predicted data of hybrid model is closer to the real traffic data and has a smaller relative root means square error, which is more suitable for a spatial information network.

**Keywords:**
Spatial Information Network,
Traffic prediction,
Wavelet decomposition,
Time series model.

##### 3483 APPLE: Providing Absolute and Proportional Throughput Guarantees in Wireless LANs

**Authors:**
Zhijie Ma,
Qinglin Zhao,
Hongning Dai,
Huan Zhang

**Abstract:**

**Keywords:**
IEEE 802.11e,
throughput guarantee,
priority.

##### 3482 Fuzzy Population-Based Meta-Heuristic Approaches for Attribute Reduction in Rough Set Theory

**Authors:**
Mafarja Majdi,
Salwani Abdullah,
Najmeh S. Jaddi

**Abstract:**

**Keywords:**
Rough Set Theory,
Attribute Reduction,
Fuzzy
Logic,
Memetic Algorithms,
Record to Record Algorithm,
Great
Deluge Algorithm.

##### 3481 Approximate Method of Calculation of Inviscid Hypersonic Flow

**Authors:**
F. Sokhanvar,
A. B. Khoshnevis

**Abstract:**

**Keywords:**
Hypersonic flow,
Inverse problem method

##### 3480 Analysis of EEG Signals Using Wavelet Entropy and Approximate Entropy: A Case Study on Depression Patients

**Authors:**
Subha D. Puthankattil,
Paul K. Joseph

**Abstract:**

Analyzing brain signals of the patients suffering from the state of depression may lead to interesting observations in the signal parameters that is quite different from a normal control. The present study adopts two different methods: Time frequency domain and nonlinear method for the analysis of EEG signals acquired from depression patients and age and sex matched normal controls. The time frequency domain analysis is realized using wavelet entropy and approximate entropy is employed for the nonlinear method of analysis. The ability of the signal processing technique and the nonlinear method in differentiating the physiological aspects of the brain state are revealed using Wavelet entropy and Approximate entropy.

**Keywords:**
EEG,
Depression,
Wavelet entropy,
Approximate entropy,
Relative Wavelet energy,
Multiresolution decomposition.

##### 3479 Meta Model Based EA for Complex Optimization

**Authors:**
Maumita Bhattacharya

**Abstract:**

**Keywords:**
Meta model,
Evolutionary algorithm,
Stochastictechnique,
Fitness function,
Optimization,
Support vector machine.