Search

In this paper, a universal simulator for cellular neural network (CNN) is presented. This simulator is capable of performing Raster simulation for any size of input image, and thus is a powerful tool for researchers investigating potential applications of CNN. This paper reports the latency properties of CNNs along with popular numerical integration algorithms; results and comparisons are also presented. [ABSTRACT FROM AUTHOR]

This paper deals with the application of the global optimization methods (evolutionary algorithms) to the optimization and identification problems in laminates. The simple and hybrid laminates are considered. There are two aims of the paper: i) to find the optimum stacking sequence of the laminates and ii) to identify the material constants of the laminates. The modal analysis methods are used in both cases. The distributed version of the evolutionary algorithm is used to reduce the computation time. The finite element method software is employed to solve the direct boundary-value problem. [ABSTRACT FROM AUTHOR]

In this paper, a finite filter is used in the structure of the Barzilai–Browein (BB) gradient method in order to propose a new modified BB algorithm for solving large-scale unconstrained optimization problems. Our algorithm is equipped with a relaxed nonmonotone line search technique which allows the algorithm to enjoy the nonmonotonicity properties from scratch. Under some suitable conditions, the global convergence property of the new proposed algorithm is established. Numerical results on some test problems in CUTEr library show the efficiency and effectiveness of the new algorithm in practice too. [ABSTRACT FROM PUBLISHER]

Oriented interval exchange transformations (i.e.t.s) admitting infinite orbit of the Rauzy–Veech operator are minimal. In this paper, we analyse what happens for non-oriented i.e.t.s. In particular, we prove an analogous result for i.e.t.s with flips (Theorem A). We also show that the behaviour of i.e.t.s with flips is different to the one of oriented i.e.t.s, see Proposition 11. [ABSTRACT FROM AUTHOR]

The Chinese postman problem is a famous and classical problem in graph theory. This paper introduces a new variant of this problem, namely, the time-dependent rural postman problem, which is motivated by applications, involving scheduling with time-dependent processing time. We present an arc-path formulation for the problem with a constraint set that is divided into two parts. The first part is linear and has a strong combinatorial structure, which defines the polytope of the arc-path alternation sequence (APAS), while the second part is nonlinear and is closely related to time-dependent travel time. First, we investigate the facial structure of the APAS polytope and present several facet inequalities. Second, considering the travel and service time functions as piecewise functions, we linearize the nonlinear inequalities and propose several strong, valid inequalities. Finally, we propose a cutting plane algorithm and report numerical results on several randomly generated instances. [ABSTRACT FROM PUBLISHER]

This paper first proposes a trust region algorithm to obtain a stationary point of unconstrained multiobjective optimisation problem. Under suitable assumptions, the global convergence of the new algorithm is established. We then extend the trust region method to solve the non-smooth multiobjective optimisation problem. [ABSTRACT FROM PUBLISHER]

In this paper, we give the comments on the article ‘Inversion of a Generalized Vandermonde Matrix’ by M.E.A. El Mikkawy, Int. J. Computer Math. 80 (2003), pp. 759–765. The article gives an algorithm for the elementary symmetric function's calculation which contains a severe error. In these comments, we have proposed necessary corrections of that algorithm. [ABSTRACT FROM PUBLISHER]

In this paper, we consider a kernel-based online learning algorithm for regression when the sampling process is unbounded. Under a moment hypothesis on the sampling outputs, we provide a confidence-based bound for the error in the corresponding reproducing kernel Hilbert space. [ABSTRACT FROM AUTHOR]

Detection of copositivity plays an important role in combinatorial and quadratic optimization. Recently, an algorithm for copositivity detection by simplicial partition has been proposed. In this paper, we develop an improved depth-first simplicial partition algorithm which reduces memory requirements significantly and therefore enables copositivity checks of much larger matrices - of size up to a few thousands instead of a few hundreds. The algorithm has been investigated experimentally on a number of MaxClique problems as well as on generated random problems. We present numerical results showing that the algorithm is much faster than a recently published linear algebraic algorithm for copositivity detection based on traditional ideas - checking properties of principal sub-matrices. We also show that the algorithm works very well for solving MaxClique problems through copositivity checks. [ABSTRACT FROM AUTHOR]

This paper introduces the concept of a Quasi-Birth-and-Death process (QBD) with Rational Arrival Process (RAP) components. We use the physical interpretation of the prediction process of the RAP, developed by Asmussen and Bladt, and develop an analysis that parallels the analysis of a traditional QBD. Further, we present an algorithm for the numerical evaluation of the matrix G. As an example, we consider two queues where the arrival process and the sequence of service times are taken from two dependent RAPs, that are not Markovian Arrival Processes. [ABSTRACT FROM AUTHOR]

The objective of this paper is the analytical presentation of the Alan Wolf's Algorithm with the derivation of the equations needed to implement BASGEN and fixed evolution time algorithms, used for the numerical calculation of the largest positive Lyapunov exponent of an unknown time series. An improvement of the above algorithm is proposed by introducing a new stability criterion to make the algorithm more robust and improve its reliability. [ABSTRACT FROM AUTHOR]

This paper presents the numerical study to examine the characteristics of fluid flow and solute transport in a rough fracture subject to effective normal stresses. The aperture distribution is generated by using the self-affine fractal model. In order to represent a nonlinear relationship between the supported normal stress and the fracture aperture, we combine a simple mechanical model with the local flow model. The solute transport is simulated using the random walk particle following algorithm. Results of numerical simulations show that the flow is significantly affected by the geometry of aperture distribution varying with the effective normal stress level, while it is slightly affected by the fractal dimension that determines the degree of the fracture surface roughness. However, solute transport is influenced by the effective normal stress as well as the fracture surface roughness. [ABSTRACT FROM AUTHOR]

A novel approach to arbitrary array pattern synthesis utilizing weighted biorthogonal modes is presented in this paper. The algorithm, involving arrays with arbitrary geometry and incorporating mutual coupling effect, can accurately determine element excitations required to yield desired field pattern. The mutual orthogonality of modes is used to ensure the agreement between the desired and computed patterns. The effectiveness of the method is demonstrated with several numerical examples. [ABSTRACT FROM AUTHOR]

The aim of our paper is to provide a new class of five-phase anti-lock brake algorithms (that use wheel deceleration logic-based switching) and a simple mathematical background that explains their behavior. First, we completely characterize the conditions required for our algorithm to work. Next, we explain how to compute analytically an approximation of the Poincaré map of the system (without using numerical integration) and show how to calibrate the algorithm’s parameters to obtain the most efficient limit cycle. [ABSTRACT FROM AUTHOR]

This paper is devoted to numerical solutions for a class of jump-diffusions with regime switching. After briefly reviewing the notion of Jump-diffusions with regime switching, finite-difference procedures are constructed. Under simple conditions, it is proved that the algorithm converges to the desired limit by means or a martingale problem formulation. Numerical experiments are carried out to demonstrate the performance of the algorithm. [ABSTRACT FROM AUTHOR]

In the paper, a new trust region algorithm is given for nonlinear inequality constrained optimization problems. Motivated by a dual problem introduced by Han and Mangasarian [Han, S. P., Mangasarian, O. L. (1983). A dual differentiable exact penalty function. Math. Programming 25:293-306], which is a nonnegatively constrained maximization problem, we construct a trust region algorithm for solving the dual problem. At each iteration, we only need to minimize a quadratic subproblem with simple bound constraints. Under the condition that the iterate sequence generated by the algorithm is contained in some bounded closed set, any accumulation point of the sequence is a Karush- Kuhn-Tucker point of the original problem. [ABSTRACT FROM AUTHOR]