Order parameters in physical and biological systems can sometimes become unbounded as the size of an underlying system increases. It is proposed that such a quantity be modeled as a minimizer of the energy functional Iε(u) = − ∫ [ ε2 2 |∇u| − 1 2 log(1 + |u|) ] dx, where u is constrained by a side condition, and ε > 0 is a parameter that is inversely proportional to the linear size of the syste...

We describe the asymptotic behavior of conformal modulus an unbounded doubly-connected domain, non-symmetric with respect to coordinate axes, when stretched in direction abscissa axis coefficient $$H\to+\infty$$ . Therefore, we give a partial answer problem, suggested by M. Vourinen, for case arbitrary domain.

the present study is an attempt to investigate some features of radial basis functions (rbfs) approximation methods related to variational problems. thereby authors applied some properties of rbfs to develop a direct method which reduces constrained variational problem to a static optimization problem. to assess the applicability and effectiveness of the method, some examples are examined. dyna...

in this paper we investigate multi-objective integer linear programming (moilp) problems with unbounded feasible region and introduce recession direction for moilp problems. then we present necessary and sufficient conditions to have unbounded feasible region and infinite optimal values for objective functions of moilp problems. finally we present some examples with unbounded feasible region and fi...

Let f be a transcendental entire function and let I(f) be the set of points whose iterates under f tend to infinity. We show that I(f) has at least one unbounded component. In the case that f has a Baker wandering domain, we show that I(f) is a connected unbounded set.

This article is devoted to prove a stability result for two independent coefficients for a Schrödinger operator in an unbounded strip. The result is obtained with only one observation on an unbounded subset of the boundary and the data of the solution at a fixed time on the whole domain.

The idea of automatic programming using the genetic programming paradigm is a concept that has been explored in the work of Koza and several works since. Most problems attempted using genetic programming are finite in size, meaning that the problem involved evolving a function that operates over a finite domain, or evolving a routine that will only run for a finite amount of time. For problems ...