Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...

Neighborhood crime may be an important social determinant of health in many high-poverty, urban communities, yet little is known about its relationship with access to health-enabling resources. We recruited an address-based probability sample of 267 participants (ages ≥35 years) on Chicago's South Side between 2012 and 2013. Participants were queried about their perceptions of neighborhood safe...

in this paper, we interpret a fuzzy differential equation by using the strongly generalized differentiability concept. utilizing the generalized characterization theorem. then a novel hybrid method based on learning algorithm of fuzzy neural network for the solution of differential equation with fuzzy initial value is presented. here neural network is considered as a part of large eld called n...

BACKGROUND Recent obesity prevention initiatives focus on healthy neighborhood design, but most research examines neighborhood food retail and physical activity (PA) environments in isolation. We estimated joint, interactive, and cumulative impacts of neighborhood food retail and PA environment characteristics on body mass index (BMI) throughout early adulthood. METHODS AND FINDINGS We used c...

An important technique for exploratory data analysis is to form a mapping from the high-dimensional data space to a low-dimensional representation space such that neighborhoods are preserved. A popular method for achieving this is Kohonen's self-organizing map (SOM) algorithm. However, in its original form, this requires the user to choose the values of several parameters heuristically to achie...

It is well known that a large neighborhood interior point algorithm for linear optimization performs much better in implementation than its small neighborhood counterparts. One of the key elements of interior point algorithms is how to update the barrier parameter. The main goal of this paper is to introduce an “adaptive” long step interior-point algorithm in a large neighborhood of central pat...