32 resultados para Differential Inclusions with Constraints


Relevância:

40.00% 40.00%

Publicador:

Resumo:

Evidence correlates physical activity, psychological restoration, and social health to proximity to parks and sites of recreation. The purpose of this study was to identify perceived constraints to park use in low-income communities facing significant health disparities, with access to underutilized parks. We used a series of focus groups with families, teens, and older adults in neighborhoods with similar demographic distribution and access to parks over 125 acres in size. Constraints to park use varied across age groups as well as across social ecological levels, with perceived constraints to individuals, user groups, communities, and society. Policies and interventions aimed at increasing park use must specifically address barriers across social ecological levels to be successful.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We consider a linear precoder design for an underlay cognitive radio multiple-input multiple-output broadcast channel, where the secondary system consisting of a secondary base-station (BS) and a group of secondary users (SUs) is allowed to share the same spectrum with the primary system. All the transceivers are equipped with multiple antennas, each of which has its own maximum power constraint. Assuming zero-forcing method to eliminate the multiuser interference, we study the sum rate maximization problem for the secondary system subject to both per-antenna power constraints at the secondary BS and the interference power constraints at the primary users. The problem of interest differs from the ones studied previously that often assumed a sum power constraint and/or single antenna employed at either both the primary and secondary receivers or the primary receivers. To develop an efficient numerical algorithm, we first invoke the rank relaxation method to transform the considered problem into a convex-concave problem based on a downlink-uplink result. We then propose a barrier interior-point method to solve the resulting saddle point problem. In particular, in each iteration of the proposed method we find the Newton step by solving a system of discrete-time Sylvester equations, which help reduce the complexity significantly, compared to the conventional method. Simulation results are provided to demonstrate fast convergence and effectiveness of the proposed algorithm.