A Flow Trace Generator using Graph-based Traffic Classification Techniques

We propose a novel methodology to generate realistic network flow traces to enable systematic evaluation of network monitoring systems in various traffic conditions. Our technique uses a graph-based approach to model the communication structure observed in real-world traces and to extract traffic templates. By combining extracted and user-defined traffic templates, realistic network flow traces that comprise normal traffic and customized conditions are generated in a scalable manner. A proof-of-concept implementation demonstrates the utility and simplicity of our method to produce a variety of evaluation scenarios. We show that the extraction of templates from real-world traffic leads to a manageable number of templates that still enable accurate re-creation of the original communication properties on the network flow level.

Curve Decomposition for Large Deflection Analysis of Fixed-Guided Beams With Application to Statically Balanced Compliant Mechanisms

Statically balanced compliant mechanisms require no holding force throughout their range of motion while maintaining the advantages of compliant mechanisms. In this paper, a postbuckled fixed-guided beam is proposed to provide the negative stiffness to balance the positive stiffness of a compliant mechanism. To that end, a curve decomposition modeling method is presented to simplify the large deflection analysis. The modeling method facilitates parametric design insight and elucidates key points on the force-deflection curve. Experimental results validate the analysis. Furthermore, static balancing with fixed-guided beams is demonstrated for a rectilinear proof-of-concept prototype.

Hierarchical Approach for Survivable Network Design

A central design challenge facing network planners is how to select a cost-effective network configuration that can provide uninterrupted service despite edge failures. In this paper, we study the Survivable Network Design (SND) problem, a core model underlying the design of such resilient networks that incorporates complex cost and connectivity trade-offs. Given an undirected graph with specified edge costs and (integer) connectivity requirements between pairs of nodes, the SND problem seeks the minimum cost set of edges that interconnects each node pair with at least as many edge-disjoint paths as the connectivity requirement of the nodes. We develop a hierarchical approach for solving the problem that integrates ideas from decomposition, tabu search, randomization, and optimization. The approach decomposes the SND problem into two subproblems, Backbone design and Access design, and uses an iterative multi-stage method for solving the SND problem in a hierarchical fashion. Since both subproblems are NP-hard, we develop effective optimization-based tabu search strategies that balance intensification and diversification to identify near-optimal solutions. To initiate this method, we develop two heuristic procedures that can yield good starting points. We test the combined approach on large-scale SND instances, and empirically assess the quality of the solutions vis-à-vis optimal values or lower bounds. On average, our hierarchical solution approach generates solutions within 2.7% of optimality even for very large problems (that cannot be solved using exact methods), and our results demonstrate that the performance of the method is robust for a variety of problems with different size and connectivity characteristics.

No adverse effect of genetically modified antifungal wheat on decomposition dynamics and the soil fauna community - a field study

The cultivation of genetically modified (GM) plants has raised several environmental concerns. One of these concerns regards non-target soil fauna organisms, which play an important role in the decomposition of organic matter and hence are largely exposed to GM plant residues. Soil fauna may be directly affected by transgene products or indirectly by pleiotropic effects such as a modified plant metabolism. Thus, ecosystem services and functioning might be affected negatively. In a litterbag experiment in the field we analysed the decomposition process and the soil fauna community involved. Therefore, we used four experimental GM wheat varieties, two with a race-specific antifungal resistance against powdery mildew (Pm3b) and two with an unspecific antifungal resistance based on the expression of chitinase and glucanase. We compared them with two non-GM isolines and six conventional cereal varieties. To elucidate the mechanisms that cause differences in plant decomposition, structural plant components (i.e. C:N ratio, lignin, cellulose, hemicellulose) were examined and soil properties, temperature and precipitation were monitored. The most frequent taxa extracted from decaying plant material were mites (Cryptostigmata, Gamasina and Uropodina), springtails (Isotomidae), annelids (Enchytraeidae) and Diptera (Cecidomyiidae larvae). Despite a single significant transgenic/month interaction for Cecidomyiidae larvae, which is probably random, we detected no impact of the GM wheat on the soil fauna community. However, soil fauna differences among conventional cereal varieties were more pronounced than between GM and non-GM wheat. While leaf residue decomposition in GM and non-GM wheat was similar, differences among conventional cereals were evident. Furthermore, sampling date and location were found to greatly influence soil fauna community and decomposition processes. The results give no indication of ecologically relevant adverse effects of antifungal GM wheat on the composition and the activity of the soil fauna community.

Graph-Based Multi-Surface Segmentation of OCT Data Using Trained Hard and Soft Constraints

Optical coherence tomography (OCT) is a well-established image modality in ophthalmology and used daily in the clinic. Automatic evaluation of such datasets requires an accurate segmentation of the retinal cell layers. However, due to the naturally low signal to noise ratio and the resulting bad image quality, this task remains challenging. We propose an automatic graph-based multi-surface segmentation algorithm that internally uses soft constraints to add prior information from a learned model. This improves the accuracy of the segmentation and increase the robustness to noise. Furthermore, we show that the graph size can be greatly reduced by applying a smart segmentation scheme. This allows the segmentation to be computed in seconds instead of minutes, without deteriorating the segmentation accuracy, making it ideal for a clinical setup. An extensive evaluation on 20 OCT datasets of healthy eyes was performed and showed a mean unsigned segmentation error of 3.05 ±0.54 μm over all datasets when compared to the average observer, which is lower than the inter-observer variability. Similar performance was measured for the task of drusen segmentation, demonstrating the usefulness of using soft constraints as a tool to deal with pathologies.