Let L be a divergence form elliptic operator with complex bounded measurable coefficients, ω the positive concave function on (0,∞) of strictly critical lower type pω ∈ (0, 1] and ρ(t) = t /ω(t) for t ∈ (0,∞). In this paper, the authors introduce the generalized VMO spaces VMOρ,L(R) associated with L, and characterize them via tent spaces. As applications, the authors show that (VMOρ,L(R)) = Bω...

a r t i c l e i n f o Keywords: Foster care Juvenile delinquency Neighborhood characteristics Neighborhood social process This study aims to advance the knowledge base by investigating where foster youth are placed in terms of neighborhood characteristics and whether specific neighborhood characteristics were associated with delinquency for adolescents in the child welfare system. This study fo...

In this paper, we propose a new neighborhood semantics for contingency logic, by introducing a simple property in standard neighborhood models. This simplifies the neighborhood semantics given in Fan and van Ditmarsch [4], but does not change the set of valid formulas. Under this perspective, among various notions of bisimulation and respective Hennessy-Milner Theorems, we show that c-bisimulat...

The concepts of L-convex function and M-convex function have recently been introduced by Murota as generalizations of submodular function and base polyhedron, respectively, and discrete separation theorems are established for L-convex/concave functions and for M-convex/concave functions as generalizations of Frank's discrete separation theorem for submodular/supermodular set functions and Edmon...

Dijkstra’s algorithm is a well-known algorithm for the single-source shortest path problem in a directed graph with nonnegative edge length. We discuss Dijkstra’s algorithm from the viewpoint of discrete convex analysis, where the concept of discrete convexity called L-convexity plays a central role. We observe first that the dual of the linear programming (LP) formulation of the shortest path ...

Parallel computers, such as multiprocessors system-on-chip (Mp-SoCs), multicomputers and cluster computers, are consisting of hundreds or thousands multiple processing units and components (such as routers, channels and connectors) connected via some interconnection network that collectively may undergo high failure rates. Therefore, these systems are required to be equipped with fault-tolerant...

This paper deals with the single-item capacitated lot sizing problem with concave production and storage costs, considering minimum order quantity and dynamic time windows. This problem models a lot sizing where the production lots are constrained in amount and frequency. In this problem, a demand must be satisfied at each period t over a planning horizon of T periods. This demand can be satisf...

We explore the link between wealth inequality, preference heterogeneity and macroeconomic volatility in a two-sector neoclassical growth model. First we prove that, if agents have homogeneous preferences, when the absolute risk tolerance is a strictly convex (concave) function, sufficiently high (low) levels of wealth inequality may lead to endogenous fluctuations in the neighborhood of the ste...

this paper is concerned with the existence of multiple positive‎ ‎solutions for a quasilinear elliptic system involving concave-convex‎ ‎nonlinearities‎ ‎and sign-changing weight functions‎. ‎with the help of the nehari manifold and palais-smale condition‎, ‎we prove that the system has at least two nontrivial positive‎ ‎solutions‎, ‎when the pair of parameters $(lambda,mu)$ belongs to a certai...