This study presents a comparative survey of direct methods for solving Variational Problems. Thisproblems can be used to solve various differential equations in physics and chemistry like RateEquation for a chemical reaction. There are procedures that any type of a differential equation isconvertible to a variational problem. Therefore finding the solution of a differential equation isequivalen...

This paper describes and analyses distinct patterns of 'governance conversation' observed in interactions on a discussion list that aims to support local, direct, governance in a geographically colocated community in South Africa. Although each pattern relates to governance, making 'binding decisions', which has been seen as a key attribute of deliberative democratic processes, is almost entire...

In this paper we discuss a global optimization problem arising in the calculation of aircraft flight paths. Since gradient information for this problem may not be readily available, a direct-search algorithm (DIRECT), proposed by Jones et al. [11] appears to be a promising solution technique. We describe some numerical experience in which DIRECT is used in several different ways to solve a samp...

We present a modification of the DIRECT algorithm, called DIRECT-G, to solve a box-constrained global optimization problem arising in the detection of gravitational waves emitted by coalescing binary systems of compact objects. This is a hard problem since the objective function is highly nonlinear and expensive to evaluate, has a huge number of local extrema and unavailable derivatives. DIRECT...

In this paper, we propose a new algorithm to solve the 7 parameters transformation problem. Using Gröbner bases techniques and solving polynomial systems, we find, in a direct manner and without the need of a linearization, the values of the translation, rotation and a scale factor. Then, with the aid of simulated data, we will confront the algorithm to all sorts of configurations. Finally, we ...

Recently, an interesting class of the direct gauge mediation supersymmetry (SUSY) breaking models are proposed, in which the minimum of the potential of the SUSY breaking field is determined by the inverted hierarchy mechanism. We consider their cosmological implications. In this class of models, SUSY breaking field has a very flat potential, which may have a cosmological importance. Assuming t...

We provide a new proof of a recent theorem of Ben-Yaacov, Melleray, and Tsankov. If G is a Polish group and X is a minimal, metrizable G-flow with all orbits meager, then the universal minimal flow M(G) is non-metrizable. In particular, we show that given X as above, the universal highly proximal extension of X is non-metrizable.

We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.