If E = {ei} and F = {fi} are two 1-unconditional basic sequences in L1 with E r-concave and F p-convex, for some 1 ≤ r < p ≤ 2, then the space of matrices {ai,j} with norm ∥{ai,j}∥E(F ) = ∥∥∑ k ∥ ∑ l ak,lfl∥ek ∥∥ embeds into L1. This generalizes a recent result of Prochno and Schütt.

The local positivity of solutions to logarithmically singular diffusion equations is investigated in some space-time domain E×(0, T ]. It is shown that if at some time level to ∈ (0, T ] and some point xo ∈ E the solution u(·, to) is not identically zero in a neighborhood of xo, in a measure-theoretical sense, then it is strictly positive in a neighborhood of (xo, to). The precise form of this ...

In the last few decades, there has been an increase in community-based participatory research being conducted within the United States. Recent research has demonstrated that working with local community organizations, interest groups, and individuals can assist in the creation of, and sustainability in, health initiatives, adoption of emergency protocols, and potentially improve health outcomes...

A Fuzzy Adaptive Neighborhood Search for Function Optimization David A. Pelta Armando Blanco Jose-L. Verdegay Depto. de Ciencias de la Computaci6n e Inteiigencia Artificial. Universidad de Granada, Granada, Spain {dpelta,armando ,verdegay}@ugr . es Neighborhood based search algorithms have been applied with success in the optimization field. In this work, a Fuzzy Adaptive Neighborhood Search al...

Multiobjective optimization using the conventional weighted aggregation of the objectives method is known to have several drawbacks. In this paper, multiobjective optimization using the weighted aggregation method is approached with the help of evolutionary algorithms. It is shown through a number of test functions that a Pareto front can be achieved from one single run of evolutionary optimiza...

Given noisy data, function estimation is considered when the unknown function is known a priori to consist of a small number of regions where the function is either convex or concave. When the number of regions is unknown, the model selection problem is to determine the number of convexity change points. For kernel estimates in Gaussian noise, the number of false change points is evaluated as a...

We study the minimum concave cost flow problem over a two-dimensional grid network (CFG), where one dimension represents time periods and the other dimension represents echelons. The concave function over each arc is given by a value oracle. We give a characterization of the computational complexity of CFG based on the grid size (T periods and L echelons), the distribution of sources and sinks ...

In various applications with large spatial regions, the relationship between response variable and covariates is expected to exhibit complex patterns. We propose a spatially clustered varying coefficient model, where regression coefficients are allowed vary smoothly within each cluster but change abruptly across boundaries of adjacent clusters, we develop unified approach for simultaneous estim...

the neighborhood has had a long history in iranian urbanization. since urban plans wereintroduced by the authorities to shape urban development in iran half a century ago, the concept of iranian traditional neighborhood has been neglected gradually. the concept of neighborhood has not found the appropriate status in urban design and planning yet. one of the main reasons is that academics, profe...

a watching system in a graph $g=(v, e)$ is a set $w={omega_{1}, omega_{2}, cdots, omega_{k}}$, where $omega_{i}=(v_{i}, z_{i}), v_{i}in v$ and $z_{i}$ is a subset of closed neighborhood of $v_{i}$ such that the sets $l_{w}(v)={omega_{i}: vin omega_{i}}$ are non-empty and distinct, for any $vin v$. in this paper, we study the watching systems of line graph $k_{n}$ which is called triangular grap...