Evaluating opportunistic networks in disaster scenarios

Forwarding data in scenarios where devices have sporadic connectivity is a challenge. An example scenario is a disaster area, where forwarding information generated in the incident location, like victims' medical data, to a coordination point is critical for quick, accurate and coordinated intervention. New applications are being developed based on mobile devices and wireless opportunistic networks as a solution to destroyed or overused communication networks. But the performance of opportunistic routing methods applied to emergency scenarios is unknown today. In this paper, we compare and contrast the efficiency of the most significant opportunistic routing protocols through simulations in realistic disaster scenarios in order to show how the different characteristics of an emergency scenario impact in the behaviour of each one of them.     

Cracking the walnut: Using a computer game to impact cognition,emotion, and behavior of highly aggressive fifth grade students

Three fifth grade highly aggressive students participated in a study examining effects of an aggression intervention game. Using single-subject multiple baseline research design, the effect of the game was measured across three domains: attribution of peer intent (cognitive), emotional response (affective) and behavior response (behavioral). The results indicate that, while there were observable individual differences, the game had an immediate impact on attribution of peer behavior across all participants, had a less predictable impact on reported behavioral reactions, and had no discernable impact on reported emotional response. Theoretical and practical implications of the study are discussed.     

Guessing Tangents in Normal Flows

Given a flow field parallel to isophote normals, a normal flow field, we seek a unobservable tangential field as the minimum of a general energy functional of the total field. We generalize existing methods to any linear, differential operator order on the combined field while keeping the projection onto the isophote normal constant. We discuss invariant flow fields, present a novel iterative solution based on Euler-Lagrange equations, prove continuous convergence, and give synthetic examples for common energy functionals. Possible uses are: estimating physical flow in image sequences, estimating human growth processes, and co-warping textures in animation sequences.     

Improving SCTP retransmission delays for time-dependent thin streams

A large number of network services rely on IP and reliable transport protocols. For applications that provide abundant data for transmission, loss is usually handled satisfactorily, even if the application is latency-sensitive (Wang et al. 2004). For data streams where small packets are sent intermittently, however, applications can occasionally experience extreme latencies (Griwodz and Halvorsen 2006). As it is not uncommon that such thin-stream applications are time-dependent, any unnecessarily induced delay can have severe consequences for the service provided. Massively Multiplayer Online Games (MMOGs) are a defining example of thin streams. Many MMOGs (like World of Warcraft and Age of Conan) use TCP for the benefits of reliability, in-order delivery and NAT/firewall traversal. It has been shown that TCP has several shortcomings with respect to the latency requirements of thin streams because of the way it handles retransmissions (Griwodz and Halvorsen 2006). As such, an alternative to TCP may be SCTP (Stewart et al. 2000), which was originally developed to meet the requirements of signaling transport. In this paper, we evaluate the Linux-kernel SCTP implementation in the context of thin streams. To address the identified latency challenges, we propose sender-side only enhancements that reduce the application-layer latency in a manner that is compatible with unmodified receivers. These enhancements can be switched on by applications and are used only when the system identifies the stream as thin. To evaluate the latency performance, we have performed several tests over various real networks and over an emulated network, varying parameters like RTT, packet loss and amount of competing cross traffic. When comparing our modifications with SCTP on Linux and FreeBSD and TCP New Reno, our results show great latency improvements and indicate the need for a separate handling of thin and thick streams.     

Progress in additive manufacturing on new materials: A review

Recent efforts and advances in additive manufacturing (AM) on different types of new materials are presented and reviewed. Special attention is paid to the material design of cladding layers, the choice of feedstock materials, the metallurgical behavior and synthesis principle during the AM process, and the resulted microstructures and properties, as well as the relationship between these factors. Thereafter, the trend of development in the future is forecasted, including: Effects of the particles size and size distribution of powders; Approaches for producing fine microstructures; Opportunities for creating new materials by AM; Wide applications in reconditioning of damaged components; Challenges for deep understanding and applications of the AMed new materials. The idea of “Develop Materials” or “Create Materials” by AM is highlighted, but a series of scientific, technological and engineering problems remain to be solved in future.     

Experimental verification of analytic modeling of erbium-doped silica fiber amplifiers pumped at 1480 nm

Gain measurements are carried out for different lengths of three types of erbium-doped silica fiber with different pump powers at 1480 nm. From these measurements a relation is established for each type of fiber between gain and the attenuation factor of the pump power. This relation is in complete agreement with the one predicted by an analytic model based on overlapping factors, which makes it possible to obtain methods for the experimental characterization of doped fibers.     

DYFRAM: dynamic fragmentation and replica management in distributed database systems

In distributed database systems, tables are frequently fragmented and replicated over a number of sites in order to reduce network communication costs. How to fragment, when to replicate and how to allocate the fragments to the sites are challenging problems that has previously been solved either by static fragmentation, replication and allocation, or based on a priori query analysis. Many emerging applications of distributed database systems generate very dynamic workloads with frequent changes in access patterns from different sites. In such contexts, continuous refragmentation and reallocation can significantly improve performance. In this paper we present DYFRAM, a decentralized approach for dynamic table fragmentation and allocation in distributed database systems based on observation of the access patterns of sites to tables. The approach performs fragmentation, replication, and reallocation based on recent access history, aiming at maximizing the number of local accesses compared to accesses from remote sites. We show through simulations and experiments on the DASCOSA distributed database system that the approach significantly reduces communication costs for typical access patterns, thus demonstrating the feasibility of our approach.