Forest soil carbon cycle under elevated CO2 – a case of increased throughput?

Forest soils account for a large part of the stable carbon pool held in terrestrial ecosystems. Future levels of atmospheric CO2 are likely to increase C input into the soils through increased above- and below-ground production of forests. This increased input will result in greater sequestration of C only if the additional C enters stable pools. In this review, we compare current observations from four large-scale Free Air FACE Enrichment (FACE) experiments on forest ecosystems (EuroFACE, Aspen-FACE, Duke FACE and ORNL-FACE) and consider their predictive power for long-term C sequestration. At all sites, FACE increased fine root biomass, and in most cases higher fine root turnover resulted in higher C input into soil via root necromass. However, at all sites, soil CO2 efflux also increased in excess of the increased root necromass inputs. A mass balance calculation suggests that a large part of the stimulation of soil CO2 efflux may be due to increased root respiration. Given the duration of these experiments compared with the life cycle of a forest and the complexity of processes involved, it is not yet possible to predict whether elevated CO2 will result in increased C storage in forest soil.

The population dynamics of disease on short and long time-scales

Observational evidence is scarce concerning the distribution of plant pathogen population sizes or densities as a function of time-scale or spatial scale. For wild pathosystems we can only get indirect evidence from evolutionary patterns and the consequences of biological invasions.We have little or no evidence bearing on extermination of hosts by pathogens, or successful escape of a host from a pathogen. Evidence over the last couple of centuries from crops suggest that the abundance of particular pathogens in the spectrum affecting a given host can vary hugely on decadal timescales. However, this may be an artefact of domestication and intensive cultivation. Host-pathogen dynamics can be formulated mathematically fairly easily–for example as SIR-type differential equation or difference equation models, and this has been the (successful) focus of recent work in crops. “Long-term” is then discussed in terms of the time taken to relax from a perturbation to the asymptotic state. However, both host and pathogen dynamics are driven by environmental factors as well as their mutual interactions, and both host and pathogen co-evolve, and evolve in response to external factors. We have virtually no information about the importance and natural role of higher trophic levels (hyperpathogens) and competitors, but they could also induce long-scale fluctuations in the abundance of pathogens on particular hosts. In wild pathosystems the host distribution cannot be modelled as either a uniform density or even a uniform distribution of fields (which could then be treated as individuals). Patterns of short term density-dependence and the detail of host distribution are therefore critical to long-term dynamics. Host density distributions are not usually scale-free, but are rarely uniform or clearly structured on a single scale. In a (multiply structured) metapopulation with coevolution and external disturbances it could well be the case that the time required to attain equilibrium (if it exists) based on conditions stable over a specified time-scale is longer than that time-scale. Alternatively, local equilibria may be reached fairly rapidly following perturbations but the meta-population equilibrium be attained very slowly. In either case, meta-stability on various time-scales is a more relevant than equilibrium concepts in explaining observed patterns.

Seeking for simplicity in complex networks

Complex networks can be understood as graphs whose connectivity properties deviate from those of regular or near-regular graphs, which are understood as being ""simple"". While a great deal of the attention so far dedicated to complex networks has been duly driven by the ""complex"" nature of these structures, in this work we address the identification of their simplicity. The basic idea is to seek for subgraphs whose nodes exhibit similar measurements. This approach paves the way for complementing the characterization of networks, including results suggesting that the protein-protein interaction networks, and to a lesser extent also the Internet, may be getting simpler over time. Copyright (C) EPLA, 2009

EFFECTIVE NETWORKS FOR REAL-TIME DISTRIBUTED PROCESSING

This paper applies the concepts and methods of complex networks to the development of models and simulations of master-slave distributed real-time systems by introducing an upper bound in the allowable delivery time of the packets with computation results. Two representative interconnection models are taken into account: Uniformly random and scale free (Barabasi-Albert), including the presence of background traffic of packets. The obtained results include the identification of the uniformly random interconnectivity scheme as being largely more efficient than the scale-free counterpart. Also, increased latency tolerance of the application provides no help under congestion.

A Comparative Study of the Information-Seeking Behavior of Bachelor of Science and Master of Science Agricultural Extension and Education Students

This study compares information-seeking behavior of Bachelor of Science and Master of Science students in the fields of agricultural extension and education. The authors surveyed Iranian students in departments of agricultural extension and education at four universities in Tehran, Shiraz, Mollasani, and Kermanshah. This study focused on three aspects: (1) comparison of amounts of information-seeking behavior between Bachelor of Science and Master of Science agricultural extension and education students; (2) comparison of information-seeking behavior varieties in Bachelor of Science and Master of Science agricultural extension and education students; (3) Comparison of amounts of available information resources at four universities and its effectiveness on students' information-seeking behavior; and (4) comparison of research and educational outputs in Bachelor of Science and Master of Science students. Scale free technique, division by mean method, principal components analysis technique, Delphi method, t-test, correlation and regression tools were used for data analysis. This study revealed that Bachelor of Science students' information-seeking behavior is for improving educational output, but Master of Science students' information-seeking behavior is for promoting research output. Among varieties of Internet searching skills, library searching skills, and awareness of library information-seeking methods with students' information-seeking behavior, there are not significant differences between two groups of students.

Explosive synchronization enhanced by time-delayed coupling

This paper deals with the emergence of explosive synchronization in scale-free networks by considering the Kuramoto model of coupled phase oscillators. The natural frequencies of oscillators are assumed to be correlated with their degrees, and a time delay is included in the system. This assumption allows enhancing the explosive transition to reach a synchronous state. We provide an analytical treatment developed in a star graph, which reproduces results obtained in scale-free networks. Our findings have important implications in understanding the synchronization of complex networks since the time delay is present in most real-world complex systems due to the finite speed of the signal transmission over a distance.

Complex Transition to Cooperative Behavior in a Structured Population Model

Cooperation plays an important role in the evolution of species and human societies. The understanding of the emergence and persistence of cooperation in those systems is a fascinating and fundamental question. Many mechanisms were extensively studied and proposed as supporting cooperation. The current work addresses the role of migration for the maintenance of cooperation in structured populations. This problem is investigated in an evolutionary perspective through the prisoner's dilemma game paradigm. It is found that migration and structure play an essential role in the evolution of the cooperative behavior. The possible outcomes of the model are extinction of the entire population, dominance of the cooperative strategy and coexistence between cooperators and defectors. The coexistence phase is obtained in the range of large migration rates. It is also verified the existence of a critical level of structuring beyond that cooperation is always likely. In resume, we conclude that the increase in the number of demes as well as in the migration rate favor the fixation of the cooperative behavior.

Methodologies for Synthesizable Programmable Devices based on Multi-Stage Switching Networks

Nowadays the rise of non-recurring engineering (NRE) costs associated with complexity is becoming a major factor in SoC design, limiting both scaling opportunities and the flexibility advantages offered by the integration of complex computational units. The introduction of embedded programmable elements can represent an appealing solution, able both to guarantee the desired flexibility and upgradabilty and to widen the SoC market. In particular embedded FPGA (eFPGA) cores can provide bit-level optimization for those applications which benefits from synthesis, paying on the other side in terms of performance penalties and area overhead with respect to standard cell ASIC implementations. In this scenario this thesis proposes a design methodology for a synthesizable programmable device designed to be embedded in a SoC. A soft-core embedded FPGA (eFPGA) is hence presented and analyzed in terms of the opportunities given by a fully synthesizable approach, following an implementation flow based on Standard-Cell methodology. A key point of the proposed eFPGA template is that it adopts a Multi-Stage Switching Network (MSSN) as the foundation of the programmable interconnects, since it can be efficiently synthesized and optimized through a standard cell based implementation flow, ensuring at the same time an intrinsic congestion-free network topology. The evaluation of the flexibility potentialities of the eFPGA has been performed using different technology libraries (STMicroelectronics CMOS 65nm and BCD9s 0.11μm) through a design space exploration in terms of area-speed-leakage tradeoffs, enabled by the full synthesizability of the template. Since the most relevant disadvantage of the adopted soft approach, compared to a hardcore, is represented by a performance overhead increase, the eFPGA analysis has been made targeting small area budgets. The generation of the configuration bitstream has been obtained thanks to the implementation of a custom CAD flow environment, and has allowed functional verification and performance evaluation through an application-aware analysis.

Disseminazioni in reti peer-to-peer attraverso algoritmi di gossip a due fasi

Gli algoritmi di gossip sono utilizzati per la disseminazione di messaggi in una rete peer-to-peer. La tesi tratta lo sviluppo, l'implementazione e l'analisi di quattro nuovi algoritmi di gossip "a due fasi". Gli algoritmi sono stati sviluppati e testati con il simulatore LUNES per poi essere analizzati in vari confronti con gli algoritmi classici dell'ambito, ovvero Fixed Probability e Conditional Broadcast. Le prove sono state effettuate su varie tipologie di grafi, ovvero Random, Scale-free, Small-world e K-Regular.

A Parametric Test of Perfect Ranking in Balanced Ranked Set Sampling

Many techniques based on data which are drawn by Ranked Set Sampling (RSS) scheme assume that the ranking of observations is perfect. Therefore it is essential to develop some methods for testing this assumption. In this article, we propose a parametric location-scale free test for assessing the assumption of perfect ranking. The results of a simulation study in two special cases of normal and exponential distributions indicate that the proposed test performs well in comparison with its leading competitors.

A derivation of thermodynamic principles

A detailed macroscopic description as in continuum mechanics, and just the concept of microstate,have been used to derive thermodynamics from mechanics. In opposition to statistical physics, the derivation lays emphasis on a definite prescription for macrostates (and non-equilibrium entropy), and uses basic features of the macrostate concept: complementary descriptions, involving either conservative and additive quantities or densities;scale-free character; reference to finite velocities and regions distant in space, thus introducing time indirectly. On the other hand, the derivation keeps the particle substratum (limit of number of particles N taken at fixed densities), and makes no ergodic-type considerations.

ExperNet: An Intelligent Multiagent System for WAN Management

This paper describes ExperNet, an intelligent multi-agent system that was developed under an EU funded project to assist in the management of a large-scale data network. ExperNet assists network operators at various nodes of a WAN to detect and diagnose hardware failures and network traffic problems and suggests the most feasible solution, through a web-based interface. ExperNet is composed by intelligent agents, capable of both local problem solving and social interaction among them for coordinating problem diagnosis and repair. The current network state is captured and maintained by conventional network management and monitoring software components, which have been smoothly integrated into the system through sophisticated information exchange interfaces. For the implementation of the agents, a distributed Prolog system enhanced with networking facilities was developed. The agents’ knowledge base is developed in an extensible and reactive knowledge base system capable of handling multiple types of knowledge representation. ExperNet has been developed, installed and tested successfully in an experimental network zone of Ukraine.

Contributions to the Resilience Management in the Internet of Things

El auge del "Internet de las Cosas" (IoT, "Internet of Things") y sus tecnologías asociadas han permitido su aplicación en diversos dominios de la aplicación, entre los que se encuentran la monitorización de ecosistemas forestales, la gestión de catástrofes y emergencias, la domótica, la automatización industrial, los servicios para ciudades inteligentes, la eficiencia energética de edificios, la detección de intrusos, la gestión de desastres y emergencias o la monitorización de señales corporales, entre muchas otras. La desventaja de una red IoT es que una vez desplegada, ésta queda desatendida, es decir queda sujeta, entre otras cosas, a condiciones climáticas cambiantes y expuestas a catástrofes naturales, fallos de software o hardware, o ataques maliciosos de terceros, por lo que se puede considerar que dichas redes son propensas a fallos. El principal requisito de los nodos constituyentes de una red IoT es que estos deben ser capaces de seguir funcionando a pesar de sufrir errores en el propio sistema. La capacidad de la red para recuperarse ante fallos internos y externos inesperados es lo que se conoce actualmente como "Resiliencia" de la red. Por tanto, a la hora de diseñar y desplegar aplicaciones o servicios para IoT, se espera que la red sea tolerante a fallos, que sea auto-configurable, auto-adaptable, auto-optimizable con respecto a nuevas condiciones que puedan aparecer durante su ejecución. Esto lleva al análisis de un problema fundamental en el estudio de las redes IoT, el problema de la "Conectividad". Se dice que una red está conectada si todo par de nodos en la red son capaces de encontrar al menos un camino de comunicación entre ambos. Sin embargo, la red puede desconectarse debido a varias razones, como que se agote la batería, que un nodo sea destruido, etc. Por tanto, se hace necesario gestionar la resiliencia de la red con el objeto de mantener la conectividad entre sus nodos, de tal manera que cada nodo IoT sea capaz de proveer servicios continuos, a otros nodos, a otras redes o, a otros servicios y aplicaciones. En este contexto, el objetivo principal de esta tesis doctoral se centra en el estudio del problema de conectividad IoT, más concretamente en el desarrollo de modelos para el análisis y gestión de la Resiliencia, llevado a la práctica a través de las redes WSN, con el fin de mejorar la capacidad la tolerancia a fallos de los nodos que componen la red. Este reto se aborda teniendo en cuenta dos enfoques distintos, por una parte, a diferencia de otro tipo de redes de dispositivos convencionales, los nodos en una red IoT son propensos a perder la conexión, debido a que se despliegan en entornos aislados, o en entornos con condiciones extremas; por otra parte, los nodos suelen ser recursos con bajas capacidades en términos de procesamiento, almacenamiento y batería, entre otros, por lo que requiere que el diseño de la gestión de su resiliencia sea ligero, distribuido y energéticamente eficiente. En este sentido, esta tesis desarrolla técnicas auto-adaptativas que permiten a una red IoT, desde la perspectiva del control de su topología, ser resiliente ante fallos en sus nodos. Para ello, se utilizan técnicas basadas en lógica difusa y técnicas de control proporcional, integral y derivativa (PID - "proportional-integral-derivative"), con el objeto de mejorar la conectividad de la red, teniendo en cuenta que el consumo de energía debe preservarse tanto como sea posible. De igual manera, se ha tenido en cuenta que el algoritmo de control debe ser distribuido debido a que, en general, los enfoques centralizados no suelen ser factibles a despliegues a gran escala. El presente trabajo de tesis implica varios retos que conciernen a la conectividad de red, entre los que se incluyen: la creación y el análisis de modelos matemáticos que describan la red, una propuesta de sistema de control auto-adaptativo en respuesta a fallos en los nodos, la optimización de los parámetros del sistema de control, la validación mediante una implementación siguiendo un enfoque de ingeniería del software y finalmente la evaluación en una aplicación real. Atendiendo a los retos anteriormente mencionados, el presente trabajo justifica, mediante una análisis matemático, la relación existente entre el "grado de un nodo" (definido como el número de nodos en la vecindad del nodo en cuestión) y la conectividad de la red, y prueba la eficacia de varios tipos de controladores que permiten ajustar la potencia de trasmisión de los nodos de red en respuesta a eventuales fallos, teniendo en cuenta el consumo de energía como parte de los objetivos de control. Así mismo, este trabajo realiza una evaluación y comparación con otros algoritmos representativos; en donde se demuestra que el enfoque desarrollado es más tolerante a fallos aleatorios en los nodos de la red, así como en su eficiencia energética. Adicionalmente, el uso de algoritmos bioinspirados ha permitido la optimización de los parámetros de control de redes dinámicas de gran tamaño. Con respecto a la implementación en un sistema real, se han integrado las propuestas de esta tesis en un modelo de programación OSGi ("Open Services Gateway Initiative") con el objeto de crear un middleware auto-adaptativo que mejore la gestión de la resiliencia, especialmente la reconfiguración en tiempo de ejecución de componentes software cuando se ha producido un fallo. Como conclusión, los resultados de esta tesis doctoral contribuyen a la investigación teórica y, a la aplicación práctica del control resiliente de la topología en redes distribuidas de gran tamaño. Los diseños y algoritmos presentados pueden ser vistos como una prueba novedosa de algunas técnicas para la próxima era de IoT. A continuación, se enuncian de forma resumida las principales contribuciones de esta tesis: (1) Se han analizado matemáticamente propiedades relacionadas con la conectividad de la red. Se estudia, por ejemplo, cómo varía la probabilidad de conexión de la red al modificar el alcance de comunicación de los nodos, así como cuál es el mínimo número de nodos que hay que añadir al sistema desconectado para su re-conexión. (2) Se han propuesto sistemas de control basados en lógica difusa para alcanzar el grado de los nodos deseado, manteniendo la conectividad completa de la red. Se han evaluado diferentes tipos de controladores basados en lógica difusa mediante simulaciones, y los resultados se han comparado con otros algoritmos representativos. (3) Se ha investigado más a fondo, dando un enfoque más simple y aplicable, el sistema de control de doble bucle, y sus parámetros de control se han optimizado empleando algoritmos heurísticos como el método de la entropía cruzada (CE, "Cross Entropy"), la optimización por enjambre de partículas (PSO, "Particle Swarm Optimization"), y la evolución diferencial (DE, "Differential Evolution"). (4) Se han evaluado mediante simulación, la mayoría de los diseños aquí presentados; además, parte de los trabajos se han implementado y validado en una aplicación real combinando técnicas de software auto-adaptativo, como por ejemplo las de una arquitectura orientada a servicios (SOA, "Service-Oriented Architecture"). ABSTRACT The advent of the Internet of Things (IoT) enables a tremendous number of applications, such as forest monitoring, disaster management, home automation, factory automation, smart city, etc. However, various kinds of unexpected disturbances may cause node failure in the IoT, for example battery depletion, software/hardware malfunction issues and malicious attacks. So, it can be considered that the IoT is prone to failure. The ability of the network to recover from unexpected internal and external failures is known as "resilience" of the network. Resilience usually serves as an important non-functional requirement when designing IoT, which can further be broken down into "self-*" properties, such as self-adaptive, self-healing, self-configuring, self-optimization, etc. One of the consequences that node failure brings to the IoT is that some nodes may be disconnected from others, such that they are not capable of providing continuous services for other nodes, networks, and applications. In this sense, the main objective of this dissertation focuses on the IoT connectivity problem. A network is regarded as connected if any pair of different nodes can communicate with each other either directly or via a limited number of intermediate nodes. More specifically, this thesis focuses on the development of models for analysis and management of resilience, implemented through the Wireless Sensor Networks (WSNs), which is a challenging task. On the one hand, unlike other conventional network devices, nodes in the IoT are more likely to be disconnected from each other due to their deployment in a hostile or isolated environment. On the other hand, nodes are resource-constrained in terms of limited processing capability, storage and battery capacity, which requires that the design of the resilience management for IoT has to be lightweight, distributed and energy-efficient. In this context, the thesis presents self-adaptive techniques for IoT, with the aim of making the IoT resilient against node failures from the network topology control point of view. The fuzzy-logic and proportional-integral-derivative (PID) control techniques are leveraged to improve the network connectivity of the IoT in response to node failures, meanwhile taking into consideration that energy consumption must be preserved as much as possible. The control algorithm itself is designed to be distributed, because the centralized approaches are usually not feasible in large scale IoT deployments. The thesis involves various aspects concerning network connectivity, including: creation and analysis of mathematical models describing the network, proposing self-adaptive control systems in response to node failures, control system parameter optimization, implementation using the software engineering approach, and evaluation in a real application. This thesis also justifies the relations between the "node degree" (the number of neighbor(s) of a node) and network connectivity through mathematic analysis, and proves the effectiveness of various types of controllers that can adjust power transmission of the IoT nodes in response to node failures. The controllers also take into consideration the energy consumption as part of the control goals. The evaluation is performed and comparison is made with other representative algorithms. The simulation results show that the proposals in this thesis can tolerate more random node failures and save more energy when compared with those representative algorithms. Additionally, the simulations demonstrate that the use of the bio-inspired algorithms allows optimizing the parameters of the controller. With respect to the implementation in a real system, the programming model called OSGi (Open Service Gateway Initiative) is integrated with the proposals in order to create a self-adaptive middleware, especially reconfiguring the software components at runtime when failures occur. The outcomes of this thesis contribute to theoretic research and practical applications of resilient topology control for large and distributed networks. The presented controller designs and optimization algorithms can be viewed as novel trials of the control and optimization techniques for the coming era of the IoT. The contributions of this thesis can be summarized as follows: (1) Mathematically, the fault-tolerant probability of a large-scale stochastic network is analyzed. It is studied how the probability of network connectivity depends on the communication range of the nodes, and what is the minimum number of neighbors to be added for network re-connection. (2) A fuzzy-logic control system is proposed, which obtains the desired node degree and in turn maintains the network connectivity when it is subject to node failures. There are different types of fuzzy-logic controllers evaluated by simulations, and the results demonstrate the improvement of fault-tolerant capability as compared to some other representative algorithms. (3) A simpler but more applicable approach, the two-loop control system is further investigated, and its control parameters are optimized by using some heuristic algorithms such as Cross Entropy (CE), Particle Swarm Optimization (PSO), and Differential Evolution (DE). (4) Most of the designs are evaluated by means of simulations, but part of the proposals are implemented and tested in a real-world application by combining the self-adaptive software technique and the control algorithms which are presented in this thesis.

Emergent spindle oscillations and intermittent burst firing in a thalamic model: specific neuronal mechanisms.

The rhythmogenesis of 10-Hz sleep spindles is studied in a large-scale thalamic network model with two cell populations: the excitatory thalamocortical (TC) relay neurons and the inhibitory nucleus reticularis thalami (RE) neurons. Spindle-like bursting oscillations emerge naturally from reciprocal interactions between TC and RE neurons. We find that the network oscillations can be synchronized coherently, even though the RE-TC connections are random and sparse, and even though individual neurons fire rebound bursts intermittently in time. When the fast gamma-aminobutyrate type A synaptic inhibition is blocked, synchronous slow oscillations resembling absence seizures are observed. Near-maximal network synchrony is established with even modest convergence in the RE-to-TC projection (as few as 5-10 RE inputs per TC cell suffice). The hyperpolarization-activated cation current (Ih) is found to provide a cellular basis for the intermittency of rebound bursting that is commonly observed in TC neurons during spindles. Such synchronous oscillations with intermittency can be maintained only with a significant degree of convergence for the TC-to-RE projection.

Rede e apoio social entre idosos atendidos em um ambulatório de Geriatria

O objetivo geral deste estudo foi analisar a relação entre a rede e apoio social, satisfação com o apoio social recebido e as variáveis sociodemográficas, de saúde física e mental, dos idosos atendidos em um Ambulatório de Geriatria de um Hospital Geral Terciário do interior paulista. Trata-se de um estudo descritivo, transversal e exploratório, realizado com 98 idosos atendidos no referido ambulatório. Para a coleta de dados, utilizaram-se o Mini Exame do Estado Mental, um questionário de caracterização sociodemográfica e de saúde, a Escala de Depressão Geriátrica (EDG-15), o Índice de Katz, a Escala de Lawton e Brody, a Escala de medida da rede e apoio social do Medical Outcomes Study e a Escala de Satisfação com o Suporte Social. Os aspectos éticos foram respeitados conforme a Resolução 466/2012 do Conselho Nacional de Saúde. A média de idade dos idosos foi de 80,1 anos, 70,4% eram mulheres, 49,0% viúvos; a média de anos de estudo foi 2,3; 24,5% dos idosos residiam com o cônjuge e filhos ou somente com os filhos; a renda familiar média foi de R$1.773,70. Quanto à capacidade funcional, 80,6% eram independentes para as atividades básicas da vida diária e 88,8% eram parcialmente dependentes para as instrumentais. Os idosos possuíam, em média, 5,3 diagnósticos médicos e os sintomas depressivos estiveram presentes para 61,2% deles. Quanto à rede social, o escore total médio foi de 6,4 pessoas para contato na rede, sendo que 36,7% apresentavam médio contato e participação em atividades sociais. Em relação ao apoio social, o maior escore médio foi para a dimensão material (90,2) e o menor para a interação social positiva (81,8); já para a satisfação com o suporte social, 36,7% e 32,7% apresentaram alta e média satisfação, respectivamente. Foi encontrada correlação inversa entre os escores de todas as dimensões da escala de apoio social e os escores da EDG-15, indicando que quanto maior o apoio social em todas as dimensões, menor é a presença de sintomas depressivos e houve diferenças estatisticamente significativas para todas as dimensões, material (p=0,014), afetiva (p=0,026), interação (p=0,011), emocional (p=0,001) e informação (p=0,005); já a correlação entre os escores das dimensões da escala de apoio social e os escores na escala de Lawton e Brody, foi inversa e fraca para as dimensões material (r=-0,157) e informação (r=-0,027), sugerindo que quanto menor a independência para as AIVDs, maior o apoio social nas referidas dimensões, porém, não houve diferença estatisticamente significativa, material (p=0,121) e informação (p=0,789). A correlação entre os escores da EDG-15 e os escores da escala de satisfação com o apoio social, foi inversa e moderada (r=- 0,467), indicando que quanto maior a satisfação com o apoio social, menor a presença de sintomas depressivos, sendo estatisticamente significativa (p=0,000). Evidencia-se a importância de conhecer se os idosos estão inseridos em rede social e se percebem o apoio social para um melhor direcionamento da assistência prestada ao idoso e para o planejamento e formulação de políticas públicas, programas e projetos voltados a essa população