3,641 research outputs found
Improving Resource Efficiency with Partial Resource Muting for Future Wireless Networks
We propose novel resource allocation algorithms that have the objective of
finding a good tradeoff between resource reuse and interference avoidance in
wireless networks. To this end, we first study properties of functions that
relate the resource budget available to network elements to the optimal utility
and to the optimal resource efficiency obtained by solving max-min utility
optimization problems. From the asymptotic behavior of these functions, we
obtain a transition point that indicates whether a network is operating in an
efficient noise-limited regime or in an inefficient interference-limited regime
for a given resource budget. For networks operating in the inefficient regime,
we propose a novel partial resource muting scheme to improve the efficiency of
the resource utilization. The framework is very general. It can be applied not
only to the downlink of 4G networks, but also to 5G networks equipped with
flexible duplex mechanisms. Numerical results show significant performance
gains of the proposed scheme compared to the solution to the max-min utility
optimization problem with full frequency reuse.Comment: 8 pages, 9 figures, to appear in WiMob 201
The role of asymptotic functions in network optimization and feasibility studies
Solutions to network optimization problems have greatly benefited from
developments in nonlinear analysis, and, in particular, from developments in
convex optimization. A key concept that has made convex and nonconvex analysis
an important tool in science and engineering is the notion of asymptotic
function, which is often hidden in many influential studies on nonlinear
analysis and related fields. Therefore, we can also expect that asymptotic
functions are deeply connected to many results in the wireless domain, even
though they are rarely mentioned in the wireless literature. In this study, we
show connections of this type. By doing so, we explain many properties of
centralized and distributed solutions to wireless resource allocation problems
within a unified framework, and we also generalize and unify existing
approaches to feasibility analysis of network designs. In particular, we show
sufficient and necessary conditions for mappings widely used in wireless
communication problems (more precisely, the class of standard interference
mappings) to have a fixed point. Furthermore, we derive fundamental bounds on
the utility and the energy efficiency that can be achieved by solving a large
family of max-min utility optimization problems in wireless networks.Comment: GlobalSIP 2017 (to appear
Consensus Acceleration in Multiagent Systems with the Chebyshev Semi-Iterative Method
We consider the fundamental problem of reaching consensus in multiagent systems; an operation required in many applications such as, among others, vehicle formation and coordination, shape formation in modular robotics, distributed target tracking, and environmental modeling. To date, the consensus problem (the problem where agents have to agree on their reported values) has been typically solved with iterative decentralized algorithms based on graph Laplacians. However, the convergence of these existing consensus algorithms is often too slow for many important multiagent applications, and thus they are increasingly being combined with acceleration methods. Unfortunately, state-of-the-art acceleration techniques require parameters that can be optimally selected only if complete information about the network topology is available, which is rarely the case in practice. We address this limitation by deriving two novel acceleration methods that can deliver good performance even if little information about the network is available. The first proposed algorithm is based on the Chebyshev semi-iterative method and is optimal in a well defined sense; it maximizes the worst-case convergence speed (in the mean sense) given that only rough bounds on the extremal eigenvalues of the network matrix are available. It can be applied to systems where agents use unreliable communication links, and its computational complexity is similar to those of simple Laplacian-based methods. This algorithm requires synchronization among agents, so we also propose an asynchronous version that approximates the output of the synchronous algorithm. Mathematical analysis and numerical simulations show that the convergence speed of the proposed acceleration methods decrease gracefully in scenarios where the sole use of Laplacian-based methods is known to be impractical
Nutrição de caprinos e ovinos em pastejo.
Exigências nutricionais de caprinos e ovinos em pastejo, Seleção de dietas, fatores morfológicos que interferem na seleção de dietas, volume rumino-reticular, tamanho da boca, correlação entre parâmetros, o manejo das pastagens, sistemas de pastejo, suplementação a pasto
Feno de gramíneas: processo de produção passo a passo.
bitstream/item/52148/1/Midia-Feno-de-gramineas.pd
Sustentabilidade em ecossitemas de pastagem para a produçao de caprinos e ovinos.
bitstream/item/86467/1/Midia-Sustentabilidade-em-ecossitemas.pd
Electrostatics of electron-hole interactions in van der Waals heterostructures
The role of dielectric screening of electron-hole interaction in van der
Waals heterostructures is theoretically investigated. A comparison between
models available in the literature for describing these interactions is made
and the limitations of these approaches are discussed. A simple numerical
solution of Poissons equation for a stack of dielectric slabs based on a
transfer matrix method is developed, enabling the calculation of the
electron-hole interaction potential at very low computational cost and with
reasonable accuracy. Using different potential models, direct and indirect
exciton binding energies in these systems are calculated within Wannier-Mott
theory, and a comparison of theoretical results with recent experiments on
excitons in two-dimensional materials is discussed.Comment: 10 pages, 8 figure
- …