This paper shows that nding the row minima (maxima) in an nn totally monotone matrix in the worst case requires any algorithm to make 3n ? 5 comparisons or 4n ? 5 matrix accesses. Where the, so called, SMAWK algorithm of Aggarwal et al. nds the row minima in no more than 5n ? 2 lg n ? 6 comparisons.

A complete Lyapunov function describes the qualitative behaviour of a dynamical system: areas where orbital derivative vanishes and it is strictly negative characterise chain recurrent set gradient-like flow, respectively. Moreover, its local maxima minima show stability properties connected components set. In this study, we use collocation with radial basis functions to numerically compute app...

A plane acoustic wave propagating through a high sound speed gradient layer in a liquid near a pressure-release surface is considered in detail. Analogously to the solution for the refraction of the incident plane wave obtained previously, equations describing the refraction of the reflected wave are derived. For the total acoustic field in the layer, dependencies of the pressure and the vertic...

Performance of Language Identification (LID) System using Gaussian Mixture Models (GMM) is limited by the convergence of Expectation Maximization (EM) algorithm to local maxima. In this paper an LID system is described using Gaussian Mixture Models for the extracted features which are then trained using Split and Merge Expectation Maximization Algorithm that improves the global convergence of E...

Abstract A general decomposition method developed by the authors is applied to global-local structural optimization problems. First, a large number of component optimizations for maximization of margins are performed. Response surface approximations (RSA) for maximum margins of component optimization are constructed. At the system level optimization, the RSA of maximum margins are used as surro...

Given simple undirected graph G = (V, E), the Maximum Clique Problem(MCP) is that of finding a maximum-cardinality subset Q of V such that any two vertices in Q are adjacent. We present a modified local search algorithm for this problem. Our algorithm build some maximal solution and can determine in polynomial time if a maximal solution can be improved by replacing a single vertex with k, k ≥ 2...

A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial random solution and searches for a locally optimal solution by successive transformations that improve a gain function, combining the mean squared residue, the row variance, and the size of the bicluster. Different strateg...

We introduce a multistart local search-based method with a taboo step for solving continuous global optimization problems with bound constraints. Since this algorithm has a characteristic taboo step[5, 1995] by removing candidate points that converge to the current local optimum in each iteration, the step enables us to avoid repeated convergence to one of an already known optima in a local sea...