We present a predictor{corrector non{interior path following algorithm for the monotone linear complementarity problem based on Chen{Harker{Kanzow{Smale smoothing techniques. Although the method is modeled on the interior point predictor{ corrector strategies, it is the rst instance of a non{interior point predictor{corrector algorithm. The algorithm is shown to be both globally linearly conver...

Sense of security is one of the basic human needs and the most influential social components of urban life. Perhaps it can be the most important factor in promoting or hindering walking in cities. In other words, if the neighborhoods of a city have a good level of security, the presents of pedestrians can be seen in local streets even in the late night hours. In this regard and to the answer to...

This article provides a comprehensive review of research on the effects of neighborhood residence on child and adolescent well-being. The first section reviews key methodological issues. The following section considers links between neighborhood characteristics and child outcomes and suggests the importance of high socioeconomic status (SES) for achievement and low SES and residential instabili...

Given a double-well potential F , a Z-periodic function H, small and with zero average, and ε > 0, we find a large R, a small δ and a function Hε which is ε-close to H for which the following two problems have solutions: 1. Find a set Eε,R whose boundary is uniformly close to ∂BR and has mean curvature equal to −Hε at any point, 2. Find u = uε,R,δ solving −δ∆u+ F (u) δ + c0 2 Hε = 0, such that ...

Resum In this work, we consider the following NP-hard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings that differ maximally in a pre-defined number of positions. First of all, we introduce an integer linear programming model for this problem. Second, two variants of a rat...

Resum In this work, we consider the following NP-hard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings that differ maximally in a pre-defined number of positions. First of all, we introduce an integer linear programming model for this problem. Second, two variants of a rat...

Resum In this work, we consider the following NP-hard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings that differ maximally in a pre-defined number of positions. First of all, we introduce an integer linear programming model for this problem. Second, two variants of a rat...

Resum In this work, we consider the following NP-hard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings that differ maximally in a pre-defined number of positions. First of all, we introduce an integer linear programming model for this problem. Second, two variants of a rat...

Resumen In this work, we consider the following NP-hard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings that differ maximally in a pre-defined number of positions. First of all, we introduce an integer linear programming model for this problem. Second, two variants of a r...