893 resultados para ARPANET (Computer network)
Resumo:
We recently developed an approach for testing the accuracy of network inference algorithms by applying them to biologically realistic simulations with known network topology. Here, we seek to determine the degree to which the network topology and data sampling regime influence the ability of our Bayesian network inference algorithm, NETWORKINFERENCE, to recover gene regulatory networks. NETWORKINFERENCE performed well at recovering feedback loops and multiple targets of a regulator with small amounts of data, but required more data to recover multiple regulators of a gene. When collecting the same number of data samples at different intervals from the system, the best recovery was produced by sampling intervals long enough such that sampling covered propagation of regulation through the network but not so long such that intervals missed internal dynamics. These results further elucidate the possibilities and limitations of network inference based on biological data.
Resumo:
MOTIVATION: Although many network inference algorithms have been presented in the bioinformatics literature, no suitable approach has been formulated for evaluating their effectiveness at recovering models of complex biological systems from limited data. To overcome this limitation, we propose an approach to evaluate network inference algorithms according to their ability to recover a complex functional network from biologically reasonable simulated data. RESULTS: We designed a simulator to generate data representing a complex biological system at multiple levels of organization: behaviour, neural anatomy, brain electrophysiology, and gene expression of songbirds. About 90% of the simulated variables are unregulated by other variables in the system and are included simply as distracters. We sampled the simulated data at intervals as one would sample from a biological system in practice, and then used the sampled data to evaluate the effectiveness of an algorithm we developed for functional network inference. We found that our algorithm is highly effective at recovering the functional network structure of the simulated system-including the irrelevance of unregulated variables-from sampled data alone. To assess the reproducibility of these results, we tested our inference algorithm on 50 separately simulated sets of data and it consistently recovered almost perfectly the complex functional network structure underlying the simulated data. To our knowledge, this is the first approach for evaluating the effectiveness of functional network inference algorithms at recovering models from limited data. Our simulation approach also enables researchers a priori to design experiments and data-collection protocols that are amenable to functional network inference.
Resumo:
The European Skynet Radiometers network (EuroSkyRad or ESR) has been recently established as a research network of European PREDE sun-sky radiometers. Moreover, ESR is federated with SKYNET, an international network of PREDE sun-sky radiometers mostly present in East Asia. In contrast to SKYNET, the European network also integrates users of the CIMEL CE318 sky–sun photometer. Keeping instrumental duality in mind, a set of open source algorithms has been developed consisting of two modules for (1) the retrieval of direct sun products (aerosol optical depth, wavelength exponent and water vapor) from the sun extinction measurements; and (2) the inversion of the sky radiance to derive other aerosol optical properties such as size distribution, single scattering albedo or refractive index. In this study we evaluate the ESR direct sun products in comparison with the AERosol RObotic NETwork (AERONET) products. Specifically, we have applied the ESR algorithm to a CIMEL CE318 and PREDE POM simultaneously for a 4-yr database measured at the Burjassot site (Valencia, Spain), and compared the resultant products with the AERONET direct sun measurements obtained with the same CIMEL CE318 sky–sun photometer. The comparison shows that aerosol optical depth differences are mostly within the nominal uncertainty of 0.003 for a standard calibration instrument, and fall within the nominal AERONET uncertainty of 0.01–0.02 for a field instrument in the spectral range 340 to 1020 nm. In the cases of the Ångström exponent and the columnar water vapor, the differences are lower than 0.02 and 0.15 cm, respectively. Therefore, we present an open source code program that can be used with both CIMEL and PREDE sky radiometers and whose results are equivalent to AERONET and SKYNET retrievals.
Resumo:
Front detection and aggregation techniques were applied to 300m resolution MERIS satellite ocean colour data for the first time, to describe frequently occurring shelf-sea fronts near to the Scottish coast. Medium resolution (1km) thermal and colour data have previously been used to analyse the distribution of surface fronts, though these cannot capture smaller frontal zones or those in close proximity to the coast, particularly where the coastline is convoluted. Seasonal frequent front maps, derived from both chlorophyll and SST data, revealed a number of key frontal zones, a subset of which were based on new insights into the sediment and plankton dynamics provided exclusively by the higher-resolution chlorophyll fronts. The methodology is described for applying colour and thermal front data to the task of identifying zones of ecological importance that could assist the process of defining marine protected areas. Each key frontal zone is analysed to describe its spatial and temporal extent and variability, and possible mechanisms. It is hoped that these tools can provide guidance on the dynamic habitats of marine fauna towards aspects of marine spatial planning and conservation.
Resumo:
Front detection and aggregation techniques were applied to 300m resolution MERIS satellite ocean colour data for the first time, to describe frequently occurring shelf-sea fronts near to the Scottish coast. Medium resolution (1km) thermal and colour data have previously been used to analyse the distribution of surface fronts, though these cannot capture smaller frontal zones or those in close proximity to the coast, particularly where the coastline is convoluted. Seasonal frequent front maps, derived from both chlorophyll and SST data, revealed a number of key frontal zones, a subset of which were based on new insights into the sediment and plankton dynamics provided exclusively by the higher-resolution chlorophyll fronts. The methodology is described for applying colour and thermal front data to the task of identifying zones of ecological importance that could assist the process of defining marine protected areas. Each key frontal zone is analysed to describe its spatial and temporal extent and variability, and possible mechanisms. It is hoped that these tools can provide guidance on the dynamic habitats of marine fauna towards aspects of marine spatial planning and conservation.
Resumo:
Ecosystems consist of complex dynamic interactions among species and the environment, the understanding of which has implications for predicting the environmental response to changes in climate and biodiversity. However, with the recent adoption of more explorative tools, like Bayesian networks, in predictive ecology, few assumptions can be made about the data and complex, spatially varying interactions can be recovered from collected field data. In this study, we compare Bayesian network modelling approaches accounting for latent effects to reveal species dynamics for 7 geographically and temporally varied areas within the North Sea. We also apply structure learning techniques to identify functional relationships such as prey–predator between trophic groups of species that vary across space and time. We examine if the use of a general hidden variable can reflect overall changes in the trophic dynamics of each spatial system and whether the inclusion of a specific hidden variable can model unmeasured group of species. The general hidden variable appears to capture changes in the variance of different groups of species biomass. Models that include both general and specific hidden variables resulted in identifying similarity with the underlying food web dynamics and modelling spatial unmeasured effect. We predict the biomass of the trophic groups and find that predictive accuracy varies with the models' features and across the different spatial areas thus proposing a model that allows for spatial autocorrelation and two hidden variables. Our proposed model was able to produce novel insights on this ecosystem's dynamics and ecological interactions mainly because we account for the heterogeneous nature of the driving factors within each area and their changes over time. Our findings demonstrate that accounting for additional sources of variation, by combining structure learning from data and experts' knowledge in the model architecture, has the potential for gaining deeper insights into the structure and stability of ecosystems. Finally, we were able to discover meaningful functional networks that were spatially and temporally differentiated with the particular mechanisms varying from trophic associations through interactions with climate and commercial fisheries.
Resumo:
A neural network based tool has been developed to assist in the process of code transformation. The tool offers advice on appropriate transformations within a knowledge-driven, semi-automatic parallelisation environment. We have identified the essential characteristics of codes relevant to loop transformations. A Kohonen network is used to discover structure in the characterised codes thus revealing new knowledge that may be brought to bear on the mapping between codes and transformations or transformation sequences. A transform selector based on this process has been developed and successfully applied to the parallelisation of sequential codes.
Resumo:
This paper proposes a novel hybrid forward algorithm (HFA) for the construction of radial basis function (RBF) neural networks with tunable nodes. The main objective is to efficiently and effectively produce a parsimonious RBF neural network that generalizes well. In this study, it is achieved through simultaneous network structure determination and parameter optimization on the continuous parameter space. This is a mixed integer hard problem and the proposed HFA tackles this problem using an integrated analytic framework, leading to significantly improved network performance and reduced memory usage for the network construction. The computational complexity analysis confirms the efficiency of the proposed algorithm, and the simulation results demonstrate its effectiveness
Resumo:
This letter reports the statistical characterization and modeling of the indoor radio channel for a mobile wireless personal area network operating at 868 MHz. Line of sight (LOS) and non-LOS conditions were considered for three environments: anechoic chamber, open office area and hallway. Overall, the Nakagami-m cdf best described fading for bodyworn operation in 60% of all measured channels in anechoic chamber and open office area environments. The Nakagami distribution was also found to provide a good description of Rician distributed channels which predominated in the hallway. Multipath played an important role in channel statistics with the mean recorded m value being reduced from 7.8 in the anechoic chamber to 1.3 in both the open office area and hallway.
Resumo:
The future convergence of voice, video and data applications on the Internet requires that next generation technology provides bandwidth and delay guarantees. Current technology trends are moving towards scalable aggregate-based systems where applications are grouped together and guarantees are provided at the aggregate level only. This solution alone is not enough for interactive video applications with sub-second delay bounds. This paper introduces a novel packet marking scheme that controls the end-to-end delay of an individual flow as it traverses a network enabled to supply aggregate- granularity Quality of Service (QoS). IPv6 Hop-by-Hop extension header fields are used to track the packet delay encountered at each network node and autonomous decisions are made on the best queuing strategy to employ. The results of network simulations are presented and it is shown that when the proposed mechanism is employed the requested delay bound is met with a 20% reduction in resource reservation and no packet loss in the network.