910 resultados para content distribution networks
Resumo:
Precision Spray is a technique to increase performance of Precision Agriculture. This spray technique may be aided by a Wireless Sensor Network, however, for such approach, the communication between the agricultural input applicator vehicle and network is critical due to its proper functioning. Thus, this work analyzes how the number of nodes in a wireless sensor network, its type of distribution and different areas of scenario affects the performance of communication. We performed simulations to observe system's behavior changing to find the most fitted non-controlled mobility model to the system.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
This paper proposes a model of educative content structuring for interactive digital television programs. Its intent was to provide references for collaborative production processes and content organization in learning networks associated with university and educative television broadcasting services. The model defines terms, actors, events, environments, as well as content categories, classes and attributes, indicating criteria for their synchronic or asynchronic association in a dynamic television schedule. The model is presented in both descriptive and visual formats, with the use of conceptual maps. The results indicate that interactive use of digital television in education requires systematic content models covering communitarian participation in both media production and distribution processes, in order to enhance learning instruments beyond vertical, hierarchical and centralized communication sustained by traditional broadcast channels.
Resumo:
The aim of this work is to investigate microscopic correlations between trace elements in breast human tissues. A synchrotron X-ray fluorescence microprobe system (μ-XRF) was used to obtain two-dimensional distribution of trace element Ca, Fe, Cu and Zn in normal (6 samples) and malignant (14 samples) breast tissues. The experiment was performed in X-ray Fluorescence beam line at Laboratório Nacional de Luz Síncrotron (LNLS), Campinas, Brazil. The white microbeam was generated with a fine conical capillary with a 20 μm output diameter. The samples were supported on a XYZ table. An optical microscope with motorized zoom was used for sample positioning and choice the area to be scanned. Automatic two-dimensional scans were programmed and performed with steps of 30 μm in each direction (x, y) on the selected area. The fluorescence signals were recorded using a Si(Li) detector, positioned at 90 degrees with respect to the incident beam, with a collection time of 10 s per point. The elemental maps obtained from each sample were overlap to observe correlation between trace elements. Qualitative results showed that the pairs of elements Ca-Zn and Fe-Cu could to be correlated in malignant breast tissues. Quantitative results, achieved by Spearman correlation tests, indicate that there is a spatial correlation between these pairs of elements (p < 0.001) suggesting the importance of these elements in metabolic processes associated with the development of the tumor.
Resumo:
The relationships between the spatial and temporal variations in the abundance of the shrimp Nematopalaemon schmitti and water temperature, salinity, and texture and organic-matter content of the sediment, were analysed in Ubatumirim, Ubatuba and Mar Virado bays on the northern coast of São Paulo, Brazil. Sampling was carried out monthly, from January 1998 through December 1999, from a shrimp boat equipped with double-rig nets, along six transects in each bay. In total, 2 116 specimens of N. schmitti were caught. Their distribution differed among bays, transects and seasons (ANOVA, p < 0.05). Highest total abundance was found in areas of high organicmatter content, in substrate composed mainly of very fine sand and silt and clay, and during winter and autumn. Although multiple regression analysis showed no significant relationship (p > 0.05), observations suggest that water tempera ture, sediment texture, organic-matter content, and the presence of biodetritus and plant fragments, provided favourable environmental conditions for the establishment of N. schmitti in the region.
Resumo:
Artificial neural networks (ANNs) have been widely applied to the resolution of complex biological problems. An important feature of neural models is that their implementation is not precluded by the theoretical distribution shape of the data used. Frequently, the performance of ANNs over linear or non-linear regression-based statistical methods is deemed to be significantly superior if suitable sample sizes are provided, especially in multidimensional and non-linear processes. The current work was aimed at utilising three well-known neural network methods in order to evaluate whether these models would be able to provide more accurate outcomes in relation to a conventional regression method in pupal weight predictions of Chrysomya megacephala, a species of blowfly (Diptera: Calliphoridae), using larval density (i.e. the initial number of larvae), amount of available food and pupal size as input data. It was possible to notice that the neural networks yielded more accurate performances in comparison with the statistical model (multiple regression). Assessing the three types of networks utilised (Multi-layer Perceptron, Radial Basis Function and Generalised Regression Neural Network), no considerable differences between these models were detected. The superiority of these neural models over a classical statistical method represents an important fact, because more accurate models may clarify several intricate aspects concerning the nutritional ecology of blowflies.
Resumo:
Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.
Resumo:
The next-generation SONET metro network is evolving into a service-rich infrastructure. At the edge of such a network, multi-service provisioning platforms (MSPPs) provide efficient data mapping enabled by Generic Framing Procedure (GFP) and Virtual Concatenation (VC). The core of the network tends to be a meshed architecture equipped with Multi-Service Switches (MSSs). In the context of these emerging technologies, we propose a load-balancing spare capacity reallocation approach to improve network utilization in the next-generation SONET metro networks. Using our approach, carriers can postpone network upgrades, resulting in increased revenue with reduced capital expenditures (CAPEX). For the first time, we consider the spare capacity reallocation problem from a capacity upgrade and network planning perspective. Our approach can operate in the context of shared-path protection (with backup multiplexing) because it reallocates spare capacity without disrupting working services. Unlike previous spare capacity reallocation approaches which aim at minimizing total spare capacity, our load-balancing approach minimizes the network load vector (NLV), which is a novel metric that reflects the network load distribution. Because NLV takes into consideration both uniform and non-uniform link capacity distribution, our approach can benefit both uniform and non-uniform networks. We develop a greedy loadbalancing spare capacity reallocation (GLB-SCR) heuristic algorithm to implement this approach. Our experimental results show that GLB-SCR outperforms a previously proposed algorithm (SSR) in terms of established connection capacity and total network capacity in both uniform and non-uniform networks.
Resumo:
Wavelength-routed networks (WRN) are very promising candidates for next-generation Internet and telecommunication backbones. In such a network, optical-layer protection is of paramount importance due to the risk of losing large amounts of data under a failure. To protect the network against this risk, service providers usually provide a pair of risk-independent working and protection paths for each optical connection. However, the investment made for the optical-layer protection increases network cost. To reduce the capital expenditure, service providers need to efficiently utilize their network resources. Among all the existing approaches, shared-path protection has proven to be practical and cost-efficient [1]. In shared-path protection, several protection paths can share a wavelength on a fiber link if their working paths are risk-independent. In real-world networks, provisioning is usually implemented without the knowledge of future network resource utilization status. As the network changes with the addition and deletion of connections, the network utilization will become sub-optimal. Reconfiguration, which is referred to as the method of re-provisioning the existing connections, is an attractive solution to fill in the gap between the current network utilization and its optimal value [2]. In this paper, we propose a new shared-protection-path reconfiguration approach. Unlike some of previous reconfiguration approaches that alter the working paths, our approach only changes protection paths, and hence does not interfere with the ongoing services on the working paths, and is therefore risk-free. Previous studies have verified the benefits arising from the reconfiguration of existing connections [2] [3] [4]. Most of them are aimed at minimizing the total used wavelength-links or ports. However, this objective does not directly relate to cost saving because minimizing the total network resource consumption does not necessarily maximize the capability of accommodating future connections. As a result, service providers may still need to pay for early network upgrades. Alternatively, our proposed shared-protection-path reconfiguration approach is based on a load-balancing objective, which minimizes the network load distribution vector (LDV, see Section 2). This new objective is designed to postpone network upgrades, thus bringing extra cost savings to service providers. In other words, by using the new objective, service providers can establish as many connections as possible before network upgrades, resulting in increased revenue. We develop a heuristic load-balancing (LB) reconfiguration approach based on this new objective and compare its performance with an approach previously introduced in [2] and [4], whose objective is minimizing the total network resource consumption.
Resumo:
Key management is a core mechanism to ensure the security of applications and network services in wireless sensor networks. It includes two aspects: key distribution and key revocation. Many key management protocols have been specifically designed for wireless sensor networks. However, most of the key management protocols focus on the establishment of the required keys or the removal of the compromised keys. The design of these key management protocols does not consider the support of higher level security applications. When the applications are integrated later in sensor networks, new mechanisms must be designed. In this paper, we propose a security framework, uKeying, for wireless sensor networks. This framework can be easily extended to support many security applications. It includes three components: a security mechanism to provide secrecy for communications in sensor networks, an efficient session key distribution scheme, and a centralized key revocation scheme. The proposed framework does not depend on a specific key distribution scheme and can be used to support many security applications, such as secure group communications. Our analysis shows that the framework is secure, efficient, and extensible. The simulation and results also reveal for the first time that a centralized key revocation scheme can also attain a high efficiency.
Resumo:
Key management is a core mechanism to ensure the security of applications and network services in wireless sensor networks. It includes two aspects: key distribution and key revocation. Key distribution has been extensively studied in the context of sensor networks. However, key revocation has received relatively little attention. Existing key revocation schemes can be divided into two categories: centralized key revocation scheme and distributed key revocation scheme. In this paper, we first summarize the current key revocation schemes for sensor networks. Then, we propose an efficient centralized key revocation scheme, KeyRev, for wireless sensor networks. Unlike most proposed key revocation schemes focusing on removing the compromised keys, we propose to use key updating techniques to obsolesce the keys owned by the compromised sensor nodes and thus remove the nodes from the network. Our analyses show that the KeyRev scheme is secure inspite of not removing the pre-distributed key materials at compromised sensor nodes. Simulation results also indicate that the KeyRev scheme is scalable and performs very well in wireless sensor networks.
Resumo:
Most of the proposed key management protocols for wireless sensor networks (WSNs) in the literature assume that a single base station is used and that the base station is trustworthy. However, there are applications in which multiple base stations are used and the security of the base stations must be considered. This paper investigates a key management protocol in wireless sensor networks which include multiple base stations. We consider the situations in which both the base stations and the sensor nodes can be compromised. The proposed key management protocol, mKeying, includes two schemes, a key distribution scheme, mKeyDist, supporting multiple base stations in the network, and a key revocation scheme, mKeyRev, used to efficiently remove the compromised nodes from the network. Our analyses show that the proposed protocol is efficient and secure against the compromise of the base stations and the sensor nodes.
Resumo:
Central-place foragers that must return to a breeding site to deliver food to offspring are faced with trade-offs between prey patch quality and distance from the colony. Among colonial animals, pinnipeds and seabirds may have different provisioning strategies, due to differences in their ability to travel and store energy. We compared the foraging areas of lactating Antarctic fur seals and chinstrap penguins breeding at Seal Island, Antarctica, to investigate whether they responded differently to the distribution of their prey (Antarctic krill and myctophid fish) and spatial heterogeneity in their habitat. Dense krill concentrations occurred in the shelf region near the colony. However, only brooding penguins, which are expected to be time-minimizers because they must return frequently with whole food for their chicks, foraged mainly in this proximal shelf region. Lactating fur seals and incubating penguins, which can make longer trips to increase energy gain per trip, and so are expected to be energy-maximizers, foraged in the more distant (>20 km from the island) slope and oceanic regions. The shelf region was characterized by more abundant, but lower-energy-content immature krill, whereas the slope and oceanic regions had less abundant but higher-energy-content gravid krill, as well as high-energy-content myctophids. Furthermore, krill in the shelf region undertook diurnal vertical migration, whereas those in the slope and oceanic regions stayed near the surface throughout the day, which may enhance the capture rate for visual predators. Therefore, we sug- gest that the energy-maximizers foraged in distant, but potentially more profitable feeding regions, while the time-minimizers foraged in closer, but potentially less profitable regions. Thus, time and energy constraints derived from different provisioning strategies may result in sympatric colonial predator species using different foraging areas, and as a result, some central-place foragers use sub- optimal foraging habitats, in terms of the quality or quantity of available prey.