We study an area minimization problem for spacelike zero mean curvature surfaces in four dimensional Lorentz-Minkowski space. The areas of these surfaces are compared of with the areas of certain marginally trapped surfaces having the same boundary values. Department of Mathematics, Idaho State University, Pocatello, ID 83209, U.S.A. e-mail: [email protected] The quintessential property of zero ...

We study an area minimization problem for spacelike zero mean curvature surfaces in four dimensional Lorentz-Minkowski space. The areas of these surfaces are compared of with the areas of certain marginally trapped surfaces having the same boundary values. The quintessential property of zero mean curvature surfaces in Euclidean space is that they locally minimize area with respect to their boun...

The feature map represented by the set of weight vectors of the basic SOM (Self-Organizing Map) provides a good approximation to the input space from which the sample vectors come. But the timedecreasing learning rate and neighborhood function of the basic SOM algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changi...

BACKGROUND Although environmental characteristics as perceived by parents are known to be related to children's outdoor play behavior, less is known about the relation between independently measured neighborhood characteristics and outdoor play among children. The purpose of this study was to identify quantitative as well as qualitative neighborhood characteristics related to outdoor play by me...

The analogue of Theorem A for the topological case was proved by H. Kneser [2]. The problem in his case seems to be of a different nature from the differentiable case. J. Munkres [3] has proved that fi is arcwise connected. Conversations with R. Palais have been helpful in the preparation of this paper. Let I2 be the square in the Euclidean plane E2 with coordinate (t,x) such that (t, x)EI2 ii ...

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...

execution of every planned program in cities has different process. process involves inhabitant's preferences, capacity of area or neighborhood, scale of people participation. after these strategies plans will prepared and executors apply them. planning in city scale considering potentials of area and participation of people is very important stage to eliminate undesirable appearances of c...

Scientists and engineers are making increasingly use of hp-adaptive discretization methods to compute simulations. While techniques for isocontouring the high-order data generated by these methods have started to appear, they typically do not facilitate interactive data exploration. This work presents a novel interactive approach for approximate isocontouring of high-order data. The method is b...