Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

102 results for “Numerical algorithm”
Set a search alert
Research ArticleOpen accessIn the abstractA Derivative-Free Optimization Method for Solving Classification ProblemParvaneh Shabanzadeh, Malik Abu Hassan, Wah June LeongProblem statement: The aim of data classification is to establish rules for the classification of some observations assuming that we have a database, which includes of at least two classes. There is a training set for each class. Those problems occur in a wide range of human activity. One of the most promising ways to data classification is based on … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 7,510 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Solution Methodology of Bi-Level Linear Programming Based on Genetic AlgorithmM. S. Osman, W.F. Abd El-Wahed, Mervat M.K. El Shafei, Hanaa B. Abd El WahabProblem statement: We deal with the bi-level linear programming problem. A bi-level programming problem is formulated for a problem in which two Decision-Makers (DMs) make decisions successively. Approach: In this research we studied and designs a Genetic Algorithm (GA) of Bi-Level Linear Programming Problems (BLPP) by constructing the fitness function of the upper-level programming problems based on the definition of … …Journal of Mathematics and Statistics, Vol. 5, Issue 4 · 31 Dec 2009 · 7,187 accessesView PDFCite
Research ArticleOpen accessIn the abstractMemoryless Modified Symmetric Rank-One Method for Large-Scale Unconstrained OptimizationFarzin Modarres, Malik Abu Hassan, Wah June LeongProblem statement: Memoryless QN methods have been regarded effective techniques for solving large-scale problems that can be considered as one step limited memory QN methods. In this study, we present a scaled memoryless modified Symmetric Rank-One (SR1) algorithm and investigate the numerical performance of the proposed algorithm for solving large-scale unconstrained optimization problems. Approach: The basic idea is to apply … …American Journal of Applied Sciences, Vol. 6, Issue 12 · 31 Dec 2009 · 7,986 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Modified Conjugate Gradient Formula for Back Propagation Neural Network AlgorithmAbbas Y. Al Bayati, Najmaddin A. Sulaiman, Gulnar W. SadiqProblem statement: The Conjugate Gradient (CG) algorithm which usually used for solving nonlinear functions is presented and is combined with the modified Back Propagation (BP) algorithm yielding a new fast training multilayer algorithm. Approach: This study consisted of determination of new search directions by exploiting the information calculated by gradient descent as well as the previous search direction. The proposed … …Journal of Computer Science, Vol. 5, Issue 11 · 30 Dec 2009 · 6,994 accessesView PDFCite
Research ArticleOpen accessIn the abstractThe Numerical Computation of Rational Structures and Asymptotic Standard Deviations in Causal Time Series DataConcepción González-Concepción, María Candelaria Gil-Fariña, Celina Pestano-GabinoProblem statement: The specific properties of data series are of primary importance in several sciences. In the field of time series analysis, several researchers have considered the rational approximation theory, particularly the Padé Approximation and Orthogonal Polynomials. Approach: In this study, an approach for the statistical significance of two numerical methods, the r-s and q-d algorithm, was proposed which made … …Journal of Mathematics and Statistics, Vol. 5, Issue 3 · 30 Sep 2009 · 7,054 accessesView PDFCite
Research ArticleOpen accessIn the abstractDiscretization Numerical Data for Relational Data with One-to-Many RelationsRayner AlfredProblem statement: Handling numerical data stored in a relational database has been performed differently from handling those numerical data stored in a single table due to the multiple occurrences (one-to-many association) of an individual record in the non-target table and non-determinate relations between tables. Numbers in Multi-Relational Data Mining (MRDM) were often discretized, after considering the schema of the relational … …Journal of Computer Science, Vol. 5, Issue 7 · 31 Jul 2009 · 7,031 accessesView PDFCite
Research ArticleOpen accessIn the abstractGeometric Optimization of Three-Phalanx Prosthesis Underactuated Fingers using Particles Swarm AlgorithmSomar M. Nacy, Shaker S. Hassan, Sadeq Hussein BakhyProblem statement: One are now interested to investigate the optimum design procedure for a finger driving mechanism to have a good configuration of the finger for its utilization in hand prosthesis. A Geometric Optimization of Three-Phalanx Prosthesis Underactuated Fingers (TPPUF) based on a Particle Swarm Optimization (PSO) was presented. Approach: Firstly, a numerical evaluation of the human-like motion was obtained … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 2 · 30 Jun 2009 · 7,706 accessesView PDFCite
Research ArticleOpen accessIn the abstractImprovement of the Simplified Fast Transversal Filter Type Algorithm for Adaptive FilteringMadjid Arezki, Ahmed Benallal, Daoud BerkaniProblem statement: In this study, we proposed a new algorithm M-SMFTF for adaptive filtering with fast convergence and low complexity. Approach: It was the result of a simplified FTF type algorithm, where the adaptation gain was obtained only from the forward prediction variables and using a new recursive method to compute the likelihood variable. Results: The computational complexity was reduced … …Journal of Computer Science, Vol. 5, Issue 5 · 31 May 2009 · 7,705 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Three-Term Preconditioned Gradient memory Algorithm for Nonlinear Optimization ProblemsAbbas Y. AL-Bayati, Ivan S. LatifIn the present study, we proposed a three-term of preconditioned gradient memory algorithms to solve a nonlinear optimization problem. The new algorithm subsumes some other families of nonlinear preconditioned gradient memory algorithms as its subfamilies with Powell's Restart Criterion and inexact Armijo line searches. Numerical experiments on twenty one well-known test functions with various dimensions generally encouraged and showed that … …Journal of Mathematics and Statistics, Vol. 4, Issue 2 · 30 Jun 2008 · 6,783 accessesView PDFCite
Research ArticleOpen accessIn the abstractGeneralized Shortest Path Problem in Uncertain Environment Based on PSOHayder A. Mukhef, Ekhlas M. Farhan, Mohammed R. JassimGeneralized network problems describe situations in which flow can be generated or consumed through arcs. This research considers generalized shortest path problem in stochastic environment in which the changing rate of flow is random. To satisfy the demands of decision makers, three types of models have been formulated to solve the generalized shortest path problem under different decision criteria. The … …Journal of Computer Science, Vol. 4, Issue 4 · 30 Apr 2008 · 6,756 accessesView PDFCite