Abstract. In this paper, a modified gradient projection method is proposed to solve the nonlinear constrained optimization problems, where the search direction is obtained by combing feasibility with descent. In addition, it is pointed out that, for linear constrained optimization problems, this method may be simplified and viewed as the modified version to Rosen’s method. The theoretical analy...

The various meta-heuristic techniques for cloud and grid environment are: Ant Colony Optimization (ACO), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Tabu Search, Firefly Algorithm, BAT Algorithm and many more. So this paper represents the two types of meta-heuristic techniques, i.e. BAT algorithm and Genetic Algorithm. The different types of methods which comprise meta-heuristic ...

This paper describes an online Japanese character recognition system using advanced techniques of pattern normalization and direction feature extraction. The normalization of point coordinates and the decomposition of direction elements are directly performed on online trajectory, and therefore, are computationally efficient. We compare one-dimensional and pseudo two-dimensional (pseudo 2D) nor...

Search algorithms based on the notion of proof and disproof numbers have been shown to be effective in many games. In this paper, we modify the depth-first proof-number search algorithm df-pn, in order to apply it to the game of Go. We develop a solver for one-eye problems, a special case of enclosed tsume-Go [ life and death] problems. Our results show that this approach is very promising.

13  Abstract— Mobile technology has contributed to the evolution of several media of communication such as chats, emails and short message service (SMS) text. This has significantly influenced the traditional standard way of expressing views from letter writing to a high-tech form of expression known as texting language. In this paper we investigated building a mobile information access system...

The travelling salesman problem (TSP) is a problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once (Aarts & Laarhoven, 1985; Beale & Jackson, 1990; Bout & Miller, 1988; Cichock & Unbehaun, 1993; Lin, 1965; Zurada, 199...

1. A longstanding view of simple cells is that they sum their inputs linearly. However, the linear model falls short of a complete account of simple-cell direction selectivity. We have developed a nonlinear model of simple-cell responses (hereafter referred to as the normalization model) to explain a larger body of physiological data. 2. The normalization model consists of an underlying linear ...

By a modification of the classic-Newton direction in scaled version for linear optimization, we give a new interior-point algorithm based on a very simple function. The algorithm uses full modified-Newton step, thus no need to perform line search. In the processing of the algorithm, the simple function is used to control the searching direction and measure the proximity of iterates to the centr...