Calibration of structure in a distributed forecasting model for a semiarid flash flood: dynamic surface storage and channel roughness

Flash floods pose a significant danger for life and property. Unfortunately, in arid and semiarid environment the runoff generation shows a complex non-linear behavior with a strong spatial and temporal non-uniformity. As a result, the predictions made by physically-based simulations in semiarid areas are subject to great uncertainty, and a failure in the predictive behavior of existing models is common. Thus better descriptions of physical processes at the watershed scale need to be incorporated into the hydrological model structures. For example, terrain relief has been systematically considered static in flood modelling at the watershed scale. Here, we show that the integrated effect of small distributed relief variations originated through concurrent hydrological processes within a storm event was significant on the watershed scale hydrograph. We model these observations by introducing dynamic formulations of two relief-related parameters at diverse scales: maximum depression storage, and roughness coefficient in channels. In the final (a posteriori) model structure these parameters are allowed to be both time-constant or time-varying. The case under study is a convective storm in a semiarid Mediterranean watershed with ephemeral channels and high agricultural pressures (the Rambla del Albujón watershed; 556 km 2 ), which showed a complex multi-peak response. First, to obtain quasi-sensible simulations in the (a priori) model with time-constant relief-related parameters, a spatially distributed parameterization was strictly required. Second, a generalized likelihood uncertainty estimation (GLUE) inference applied to the improved model structure, and conditioned to observed nested hydrographs, showed that accounting for dynamic relief-related parameters led to improved simulations. The discussion is finally broadened by considering the use of the calibrated model both to analyze the sensitivity of the watershed to storm motion and to attempt the flood forecasting of a stratiform event with highly different behavior.

Assessing the sensitivities of a distributed snow model to forcing data resolution

Highly heterogeneous mountain snow distributions strongly affect soil moisture patterns; local ecology; and, ultimately, the timing, magnitude, and chemistry of stream runoff. Capturing these vital heterogeneities in a physically based distributed snow model requires appropriately scaled model structures. This work looks at how model scale—particularly the resolutions at which the forcing processes are represented—affects simulated snow distributions and melt. The research area is in the Reynolds Creek Experimental Watershed in southwestern Idaho. In this region, where there is a negative correlation between snow accumulation and melt rates, overall scale degradation pushed simulated melt to earlier in the season. The processes mainly responsible for snow distribution heterogeneity in this region—wind speed, wind-affected snow accumulations, thermal radiation, and solar radiation—were also independently rescaled to test process-specific spatiotemporal sensitivities. It was found that in order to accurately simulate snowmelt in this catchment, the snow cover needed to be resolved to 100 m. Wind and wind-affected precipitation—the primary influence on snow distribution—required similar resolution. Thermal radiation scaled with the vegetation structure (~100 m), while solar radiation was adequately modeled with 100–250-m resolution. Spatiotemporal sensitivities to model scale were found that allowed for further reductions in computational costs through the winter months with limited losses in accuracy. It was also shown that these modeling-based scale breaks could be associated with physiographic and vegetation structures to aid a priori modeling decisions.

Energy-efficient resource allocation in OFDM systems with distributed antennas

In this paper, we develop an energy-efficient resource-allocation scheme with proportional fairness for downlink multiuser orthogonal frequency-division multiplexing (OFDM) systems with distributed antennas. Our aim is to maximize energy efficiency (EE) under the constraints of the overall transmit power of each remote access unit (RAU), proportional fairness data rates, and bit error rates (BERs). Because of the nonconvex nature of the optimization problem, obtaining the optimal solution is extremely computationally complex. Therefore, we develop a low-complexity suboptimal algorithm, which separates subcarrier allocation and power allocation. For the low-complexity algorithm, we first allocate subcarriers by assuming equal power distribution. Then, by exploiting the properties of fractional programming, we transform the nonconvex optimization problem in fractional form into an equivalent optimization problem in subtractive form, which includes a tractable solution. Next, an optimal energy-efficient power-allocation algorithm is developed to maximize EE while maintaining proportional fairness. Through computer simulation, we demonstrate the effectiveness of the proposed low-complexity algorithm and illustrate the fundamental trade off between energy and spectral-efficient transmission designs.

Distributed parallelization of greedy Mobile Network Optimization algorithms

The Mobile Network Optimization (MNO) technologies have advanced at a tremendous pace in recent years. And the Dynamic Network Optimization (DNO) concept emerged years ago, aimed to continuously optimize the network in response to variations in network traffic and conditions. Yet, DNO development is still at its infancy, mainly hindered by a significant bottleneck of the lengthy optimization runtime. This paper identifies parallelism in greedy MNO algorithms and presents an advanced distributed parallel solution. The solution is designed, implemented and applied to real-life projects whose results yield a significant, highly scalable and nearly linear speedup up to 6.9 and 14.5 on distributed 8-core and 16-core systems respectively. Meanwhile, optimization outputs exhibit self-consistency and high precision compared to their sequential counterpart. This is a milestone in realizing the DNO. Further, the techniques may be applied to similar greedy optimization algorithm based applications.

Asynchronous distributed parallelization of mobile network optimization algorithms

It has been years since the introduction of the Dynamic Network Optimization (DNO) concept, yet the DNO development is still at its infant stage, largely due to a lack of breakthrough in minimizing the lengthy optimization runtime. Our previous work, a distributed parallel solution, has achieved a significant speed gain. To cater for the increased optimization complexity pressed by the uptake of smartphones and tablets, however, this paper examines the potential areas for further improvement and presents a novel asynchronous distributed parallel design that minimizes the inter-process communications. The new approach is implemented and applied to real-life projects whose results demonstrate an augmented acceleration of 7.5 times on a 16-core distributed system compared to 6.1 of our previous solution. Moreover, there is no degradation in the optimization outcome. This is a solid sprint towards the realization of DNO.

An optimized auditory P300 BCI based on spatially distributed sound in different voices

In this paper, a new paradigm is presented, to improve the performance of audio-based P300 Brain-computer interfaces (BCIs), by using spatially distributed natural sound stimuli. The new paradigm was compared to a conventional paradigm using spatially distributed sound to demonstrate the performance of this new paradigm. The results show that the new paradigm enlarged the N200 and P300 components, and yielded significantly better BCI performance than the conventional paradigm.

Using Distributed Temperature Sensing to monitor field scale dynamics of ground surface temperature and related substrate heat flux

We present one of the first studies of the use of Distributed Temperature Sensing (DTS) along fibre-optic cables to purposely monitor spatial and temporal variations in ground surface temperature (GST) and soil temperature, and provide an estimate of the heat flux at the base of the canopy layer and in the soil. Our field site was at a groundwater-fed wet meadow in the Netherlands covered by a canopy layer (between 0-0.5 m thickness) consisting of grass and sedges. At this site, we ran a single cable across the surface in parallel 40 m sections spaced by 2 m, to create a 40×40 m monitoring field for GST. We also buried a short length (≈10 m) of cable to depth of 0.1±0.02 m to measure soil temperature. We monitored the temperature along the entire cable continuously over a two-day period and captured the diurnal course of GST, and how it was affected by rainfall and canopy structure. The diurnal GST range, as observed by the DTS system, varied between 20.94 and 35.08◦C; precipitation events acted to suppress the range of GST. The spatial distribution of GST correlated with canopy vegetation height during both day and night. Using estimates of thermal inertia, combined with a harmonic analysis of GST and soil temperature, substrate and soil-heat fluxes were determined. Our observations demonstrate how the use of DTS shows great promise in better characterising area-average substrate/soil heat flux, their spatiotemporal variability, and how this variability is affected by canopy structure. The DTS system is able to provide a much richer data set than could be obtained from point temperature sensors. Furthermore, substrate heat fluxes derived from GST measurements may be able to provide improved closure of the land surface energy balance in micrometeorological field studies. This will enhance our understanding of how hydrometeorological processes interact with near-surface heat fluxes.

Distributed access control and privacy for the internet of me

This article presents an experimental scalable message driven IoT and its security architecture based on Decentralized Information Flow Control. The system uses a gateway that exports SoA (REST) interfaces to the internet simplifying external applications whereas uses DIFC and asynchronous messaging within the home environment.

Five New and Narrowly Distributed Species of Paepalanthus Section Diphyomene (Eriocaulaceae) from Central Brazil

Five new species of Paepalanthus section Diphyomene are described and illustrated: P. brevis, P. flexuosus, P. longiciliatus, P. macer, and P. stellatus. Paepalanthus brevis, similar to P. decussus, is easily distinguished by its short reproductive axis, and pilose and mucronate leaves. Paepalanthus flexuosus, morphologically related to P. urbanianus, possesses a distinctive short and tortuous reproductive axis. Paepalanthus longiciliatus, morphologically similar to P. weddellianus, possesses long trichomes on the margins of the reproductive axis bracts, considered a diagnostic feature. Paepalanthus macer shares similarities with P. amoenus, differing by its sulfurous capitula and adpressed reproductive axis bracts. Paepalanthus stellatus also has affinity with P. decussus, but possesses unique, membranaceous, reproductive-axis bracts and a punctual inner-capitulum arrangement of pistillate flowers. Four of the described species are narrowly distributed in the state of Goias, whereas P. brevis is endemic to Distrito Federal. All are considered critically endangered. Detailed comparisons of these species are presented in tables. Comments on phenology, distribution, habitat and etymology, along with an identification key, are provided.

A novel approach for distributed application scheduling based on prediction of communication events

The evolution of commodity computing lead to the possibility of efficient usage of interconnected machines to solve computationally-intensive tasks, which were previously solvable only by using expensive supercomputers. This, however, required new methods for process scheduling and distribution, considering the network latency, communication cost, heterogeneous environments and distributed computing constraints. An efficient distribution of processes over such environments requires an adequate scheduling strategy, as the cost of inefficient process allocation is unacceptably high. Therefore, a knowledge and prediction of application behavior is essential to perform effective scheduling. In this paper, we overview the evolution of scheduling approaches, focusing on distributed environments. We also evaluate the current approaches for process behavior extraction and prediction, aiming at selecting an adequate technique for online prediction of application execution. Based on this evaluation, we propose a novel model for application behavior prediction, considering chaotic properties of such behavior and the automatic detection of critical execution points. The proposed model is applied and evaluated for process scheduling in cluster and grid computing environments. The obtained results demonstrate that prediction of the process behavior is essential for efficient scheduling in large-scale and heterogeneous distributed environments, outperforming conventional scheduling policies by a factor of 10, and even more in some cases. Furthermore, the proposed approach proves to be efficient for online predictions due to its low computational cost and good precision. (C) 2009 Elsevier B.V. All rights reserved.

On modeling and evaluating multicomputer transcoding architectures for live-video streams

The pervasive and ubiquitous computing has motivated researches on multimedia adaptation which aims at matching the video quality to the user needs and device restrictions. This technique has a high computational cost which needs to be studied and estimated when designing architectures and applications. This paper presents an analytical model to quantify these video transcoding costs in a hardware independent way. The model was used to analyze the impact of transcoding delays in end-to-end live-video transmissions over LANs, MANs and WANs. Experiments confirm that the proposed model helps to define the best transcoding architecture for different scenarios.

Enzyme immobilisation on electroactive nanostructured membranes (ENM): Optimised architectures for biosensing

Electroactive nanostructured membranes have been produced by the layer-by-layer (LbL) technique, and used to make electrochemical enzyme biosensors for glucose by modification with cobalt hexacyanoferrate redox mediator and immobilisation of glucose oxidase enzyme. Indium tin oxide (ITO) glass electrodes were modified with up to three bilayers of polyamidoamine (PAMAM) dendrimers containing gold nanoparticles and poly(vinylsulfonate) (PVS). The gold nanoparticles were covered with cobalt hexacyanoferrate that functioned as a redox mediator, allowing the modified electrode to be used to detect H(2)O(2), the product of the oxidase enzymatic reaction, at 0.0 V vs. SCE. Enzyme was then immobilised by cross-linking with glutaraldehyde. Several parameters for optimisation of the glucose biosensor were investigated, including the number of deposited bilayers, the enzyme immobilisation protocol and the concentrations of immobilised enzyme and of the protein that was crosslinked with PAMAM. The latter was used to provide glucose oxidase with a friendly environment, in order to preserve its bioactivity. The optimised biosensor, with three bilayers, has high sensitivity and operational stability, with a detection limit of 6.1 mu M and an apparent Michaelis-Menten constant of 0.20 mM. It showed good selectivity against interferents and is suitable for glucose measurements in natural samples. (C) 2008 Elsevier B.V. All rights reserved.

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.

The CATH classification revisited-architectures reviewed and new ways to characterize structural divergence in superfamilies

The latest version of CATH (class, architecture, topology, homology) (version 3.2), released in July 2008 (http://www.cathdb.info), contains 1 14215 domains, 2178 Homologous superfamilies and 1110 fold groups. We have assigned 20 330 new domains, 87 new homologous superfamilies and 26 new folds since CATH release version 3.1. A total of 28 064 new domains have been assigned since our NAR 2007 database publication (CATH version 3.0). The CATH website has been completely redesigned and includes more comprehensive documentation. We have revisited the CATH architecture level as part of the development of a `Protein Chart` and present information on the population of each architecture. The CATHEDRAL structure comparison algorithm has been improved and used to characterize structural diversity in CATH superfamilies and structural overlaps between superfamilies. Although the majority of superfamilies in CATH are not structurally diverse and do not overlap significantly with other superfamilies, similar to 4% of superfamilies are very diverse and these are the superfamilies that are most highly populated in both the PDB and in the genomes. Information on the degree of structural diversity in each superfamily and structural overlaps between superfamilies can now be downloaded from the CATH website.