Characterizing peers communities and dynamics in a P2P live streaming system

Despite the large number of works devoted to understand P2P live streaming applications, most of them put forth so far rely on characterizing the static view of these systems. In this work, we characterize the SopCast, one of the most important P2P live streaming applications. We focus on its dynamics behavior as well as on the community formation phenomena. Our results show that SopCast presents a low overlay topology diameter and low end-to-end shortest path. In fact, diameter is smaller than 6 hops in almost 90 % of the observation time. More than 96 % of peers’ end-to-end connections present only 3 hops. These values combined may lead to low latencies and a fast streaming diffusion. Second, we show that communities in SopCast are well defined by the streaming data exchange process. Moreover, the SopCast protocol does not group peers according to their Autonomous System. In fact, the probability that a community contains 50 % of its members belonging to the same AS (when we observe the largest AS of our experiments) is lower then 10 %. Peers exchange more data with partners belonging to the same community instead of peers inside the same AS. For the largest AS we have, less than 18 % of peer traffic has been exchanged with another AS partners. Finally, our analysis provides important information to support the future design of more efficient P2P live streaming systems and new protocols that exploit communities’ relationships.     

Image blur and energy broadening effects in XPEEM

We report image blurring and energy broadening effects in energy-filtered XPEEM when illuminating the specimen with soft X-rays at high flux densities. With a flux of 2×10¹³ photons/s, the lateral resolution in XPEEM imaging with either core level or secondary electrons is degraded to more than 50 nm. Fermi level broadening up to several hundred meV and spectral shift to higher kinetic energies are also systematically observed. Simple considerations suggest that these artifacts result from Boersch and Loeffler effects, and that the electron-electron interactions are strongest in the initial part of the microscope optical path. Implications for aberration corrected instruments are discussed.     

A Secure Correspondent Router Protocol for NEMO Route Optimization

The Network Mobility (NEMO) protocol is needed to support the world-wide mobility of aircraft mobile networks across different access networks in the future IPv6 based aeronautical telecommunications network (ATN). NEMO suffers from the constraint that all traffic has to be routed via the home agent though. The already existing correspondent router (CR) protocol solves this triangular routing problem and permits to route packets on a direct path between the mobile network and the ground based correspondent nodes. We identify security deficiencies of this protocol that make it unsuitable for use within the ATN. We therefore propose a new route optimization procedure based on the CR protocol that provides a higher level of security. We evaluate our new protocol in three ways. We first conduct a simulation based handover performance study using an implementation of a realistic aeronautical access technology. We then investigate the mobility signaling overhead. Finally, we specify a threat model applicable for the aeronautical environment and use it to perform a security analysis of both the old and our new protocol. It is shown that our protocol is not only more secure but also provides better handover latency, smaller overhead in the aeronautical scenario and a higher level of resilience when compared to the original CR protocol.     

Our current understanding of lake ecosystem response to climate change: What have we really learned from the north temperate deep lakes?

Climatic change is recognized as an important factor capable of influencing the structural properties of aquatic ecosystems. Lake ecosystems are particularly sensitive to climate change. Several long time-series studies have shown close coupling between climate, lake thermal properties and individual organism physiology, population abundance, community structure, and food-web structure. Understanding the complex interplay between climate, hydrological variability, and ecosystem structure and functioning is essential to inform water resources risk assessment and fisheries management. The purpose of this paper is to present the current understanding of climate-induced changes on lake ecosystem phenology. We first review the ability of climate to modulate the interactions among lake hydrodynamics, chemical factors, and food-web structure in several north temperate deep lakes (e.g., Lake Washington, Lake Tahoe, Lake Constance, Lake Geneva, Lake Baikal, and Lake Zurich). Our aim is to assess long-term trends in the physical (e.g., temperature, timing of stratification, and duration of ice cover), chemical (e.g., nutrient concentrations), and biological (e.g., timing of the spring bloom, phytoplankton composition, and zooplankton abundance) characteristics of the lakes and to examine the signature of local weather conditions (e.g., air temperature and rainfall) and large-scale climatic variability (e.g., ENSO and PDO) on the lake physics, chemistry and biology. We also conducted modeling experiments to quantify the relative effect of climate change and nutrient loading on lake phenology. These modeling experiments focused on the relative changes to the major causal associations underlying plankton dynamics during the spring bloom and the summer stratified period. To further understand the importance of climate change on lakes, we propose two complementary directions of future research. First, additional research is needed to elucidate the wide array of in-lake processes that are likely to be affected by the climate change. Second, it is essential to examine the heterogeneity in responses among different water bodies. The rationale of this approach and its significance for dealing with the uncertainty that the climate signals cascade through lake ecosystems and shape abiotic variability and/or biotic responses have been recently advocated by several other synthesis papers.     

Data-Intensive Computing in the 21st Century

The deluge of data that future applications must process—in domains ranging from science to business informatics—creates a compelling argument for substantially increased R&D targeted at discovering scalable hardware and software solutions for data-intensive problems.     

Eigenfeature regularization and extraction in face recognition

This work proposes a subspace approach that regularizes and extracts eigenfeatures from the face image. Eigenspace of the within-class scatter matrix is decomposed into three subspaces: a reliable subspace spanned mainly by the facial variation, an unstable subspace due to noise and finite number of training samples and a null subspace. Eigenfeatures are regularized differently in these three subspaces based on an eigenspectrum model to alleviate problems of instability, over-fitting or poor generalization. This also enables the discriminant evaluation performed in the whole space. Feature extraction or dimensionality reduction occurs only at the final stage after the discriminant assessment. These efforts facilitate a discriminative and stable low-dimensional feature representation of the face image. Experiments comparing the proposed approach with some other popular subspace methods on the FERET, ORL, AR and GT databases show that our method consistently outperforms others.     

A two-stage hardware scheduler combining greedy and optimal scheduling

Greedy scheduling heuristics provide a low complexity and scalable albeit particularly sub-optimal strategy for hardware-based crossbar schedulers. In contrast, the maximum matching algorithm for Bipartite graphs can be used to provide optimal scheduling for crossbar-based interconnection networks with a significant complexity and scalability cost. In this paper, we show how maximum matching can be reformulated in terms of Boolean operations rather than the more traditional formulations. By leveraging the inherent parallelism available in custom hardware design, we reformulate maximum matching in terms of Boolean operations rather than matrix computations and introduce three maximum matching implementations in hardware. Specifically, we examine a Pure Logic Scheduler with three dimensions of parallelism, a Matrix Scheduler with two dimensions of parallelism and a Vector Scheduler with one dimension of parallelism. These designs reduce the algorithmic complexity for an N×N$N\times N$ network from O(N³)$O\left(N^3\right)$ to O(1)$O\left(1\right)$, O(K)$O\left(K\right)$, and O(KN)$O\left(KN\right)$, respectively, where K$K$ is the number of optimization steps. While an optimal scheduling algorithm requires K=2N−1$K=2N-1$ steps, by starting with our hardware-based greedy strategy to generate an initial schedule, our simulation results show that the maximum matching scheduler can achieve 99% of the optimal schedule when K=9$K=9$. We examine hardware and time complexity of these architectures for crossbar sizes of up to N=1024$N=1024$. Using FPGA synthesis results, we show that a greedy schedule for crossbars, ranging from 8×8 to 256×256, can be optimized in less than 20 ns per optimization step. For crossbars reaching 1024×1024 the scheduling can be completed in approximately 10 μs with current technology and could reach under 90 ns with future technologies.     

Incremental application of knowledge to continuously arriving time-oriented data

In our previous work, we introduced a computational architecture that effectively supports the tasks of continuous monitoring and of aggregation querying of complex domain meaningful time-oriented concepts and patterns (temporal abstractions), in environments featuring large volumes of continuously arriving and accumulating time-oriented raw data. Examples include provision of decision support in clinical medicine, making financial decisions, detecting anomalies and potential threats in communication networks, integrating intelligence information from multiple sources, etc. In this paper, we describe the general, domain-independent but task-specific problem-solving method underling our computational architecture, which we refer to as incremental knowledge-based temporal abstraction (IKBTA). The IKBTA method incrementally computes temporal abstractions by maintaining persistence and validity of continuously computed temporal abstractions from arriving time-stamped data. We focus on the computational framework underlying our reasoning method, provide well-defined semantic and knowledge requirements for incremental inference, which utilizes a logical model of time, data, and high-level abstract concepts, and provide a detailed analysis of the computational complexity of our approach.     

Relationships between process, microstructure and properties of molded zirconia micro specimens

Due to size effects the mechanical behavior of micro-components with dimensions in the range of some 100 μm and structure details of about 10 μm differs markedly from those of larger components. This is a crucial aspect for the design of micro-components for applications where demands for high strength are critical. The present study, which was performed in the frame of the Collaborative Research Centre 499 (SFB 499), approaches this issue by investigating the relationship between production process, microstructure and the mechanical properties of micro-specimens made from zirconia using two different feedstocks. The specimens were produced by a sintering process. The sintering temperature was varied between 1,300 and 1,500°C. Mechanical and tribological behavior of the specimens was determined by three-point bending tests as well as static and sliding friction tests, respectively. Properties derived from these tests were then correlated to the surface states in the specimens such as porosity, edge radius and roughness. The strength of the micro-specimens was found to be significantly influenced by these surface features. Whilst low porosity alone is not sufficient for high strength, notch effects resulting from pores as well as surface roughness can lower the strength. With increasing edge radius the strength of the material also increases. The porosity, edge radius and surface roughness were mathematically correlated with the strength to allow for a forecast. Within the SFB 499 feedstocks with specific properties were designed and reliable processes were developed to guarantee desirable surface roughness and porosity in the specimens. A characteristic bending strength of about 2,000 MPa is realizable in the micro-specimens within a good statistical reliability. The tribological tests revealed that the wear properties of the zirconia micro-components are strongly dependent on the quality of the feedstock.