The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error correcting codes. First, we show that the local minimum degree of the Paley graph of order p is greater than √ p− 3 2 , which is, up to our knowledge, the highest kn...

The energy minimization of a small molecule alone does not automatically stop at a local minimum of the potential energy surface of the molecule if the minimum is shallow, thus leading to folding of the molecule and consequently hampering the generation of the bound conformation of a guest in the absence of its host. This questions the practicality of virtual screening methods that use conforma...

background: local ethical committees in medical sciences in iran were established in 1999 in order to assess and evaluate the observance of ethical standards throughout the universities and research centers. the purpose of this study is to analyze the situation of local ethical committees in order to develop research ethics guideline. methods: for this cross-sectional study which has been condu...

augmented downhill simplex method (adsm) is introduced here, that is a heuristic combination of downhill simplex method (dsm) with random search algorithm. in fact, dsm is an interpretable nonlinear local optimization method. however, it is a local exploitation algorithm; so, it can be trapped in a local minimum. in contrast, random search is a global exploration, but less efficient. here, rand...

Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...

In this paper, we propose a stochastic dynamic local search (SDLS) method for Multiple-Valued Logic (MVL) learning by introducing stochastic dynamics into the traditional local search method. The proposed learning network maintains some trends of quick descent to either global minimum or a local minimum, and at the same time has some chance of escaping from local minima by permitting temporary ...

Recently proposed methods for ordering sparse symmetric matrices are discussed and their performance is compared with that of the Minimum Degree and the Minimum Local Fill algorithms. It is shown that these methods applied to symmetrized modified nodal analysis matrices yield orderings significantly better than those obtained from the Minimum Degree and Minimum Local Fill algorithms, in some ca...

Let v be a vertex with n edges incident to it, such that the n edges partition an infinitesimally small circle C around v into convex pieces. The minimum local convex partition (MLCP) problem asks for two or three out of the n edges that still partition C into convex pieces and that are of minimum total length. We present an optimal algorithm solving the problem in linear time if the edges inci...

We show that there is no deterministic local algorithm (constant-time distributed graph algorithm) that finds a (7 − )-approximation of a minimum dominating set on planar graphs, for any positive constant . In prior work, the best lower bound on the approximation ratio has been 5− ; there is also an upper bound of 52.

Abstract. The present work deals with the establishment of stability conditions of finite volume methods to approximate weak solutions of the general Euler equations to simulate compressible flows. In oder to ensure discrete entropy inequalities, we derive a new technique based on a local minimum principle to be satisfied by the specific entropy. Sufficient conditions are exhibited to satisfy t...