ALBERT

Description: Background: Centralized silos of genomic data are architecturally easier to initially design, develop and deploy than distributed models. However, as interoperability pains in EHR/EMR, HIE and other collaboration-centric life sciences domains have taught us, the core challenge of networking genomics systems is not in the construction of individual silos, but the interoperability of those deployments in a manner embracing the heterogeneous needs, terms and infrastructure of collaborating parties. This article demonstrates the adaptation of BitTorrent to private collaboration networks in an authenticated, authorized and encrypted manner while retaining the same characteristics of standard BitTorrent. Results: The BitTorious portal was sucessfully used to manage many concurrent domestic Bittorrent clients across the United States: exchanging genomics data payloads in excess of 500GiB using the uTorrent client software on Linux, OSX and Windows platforms. Individual nodes were sporadically interrupted to verify the resilience of the system to outages of a single client node as well as recovery of nodes resuming operation on intermittent Internet connections. Conclusions: The authorization-based extension of Bittorrent and accompanying BitTorious reference tracker and user management web portal provide a free, standards-based, general purpose and extensible data distribution system for large ‘omics collaborations.

Description: The use of multiple-input multiple-output (MIMO) communication systems has attracted considerable attention due to capacity and performance improvements without increasing the required bandwidth or transmission power. Although MIMO improves the transmission rate and provides reliable communication, these advantages come at a high cost, since multiple radio frequency (RF) chains have to be employed. Therefore, cost-effective implementation of MIMO systems remains as an important challenge. In this sense, antenna selection techniques (AST) can help reduce the high cost of MIMO systems, while retaining most of their benefits; and in order to improve channel capacity, transmission power can be allocated efficiently according to the channel experienced by each antenna element. In this paper, we show the channel capacity improvement of MIMO systems, by combining the use of AST and transmission power allocation through the water-pouring algorithm (WPA) for different antenna configurations. We apply WPA and allocate more power to the channel with better conditions, when the MIMO channel is Rayleigh distributed and noise is Gaussian. By employing these two techniques (AST and WPA), we show that channel capacity is significantly improved, with higher capacity values than those obtained using traditional systems which just spread equal power among all the transmit antennas. We also show that bounds on the capacity can be considered when these improvements are used in a MIMO system.

Description: Vehicular ad hoc networks are a long-term solution contributing significantly towards intelligent transport systems (ITS) in providing access to critical life-safety applications and services. Although vehicular ad hoc networks are attracting greater commercial interest, current research has not adequately captured the real-world constraints in vehicular ad hoc network handover techniques. Therefore, in order to have the best practice for vehicular ad hoc network services, it is necessary to have seamless connectivity for optimal coverage and ideal channel utilisation. Due to the high velocity of vehicles and smaller coverage distances, there are serious challenges in providing seamless handover from one roadside unit (RSU) to another. Though other research efforts have looked at many issues in vehicular ad hoc networks (VANETs), very few research work have looked at handover issues. Most literature assume that handover does not take a significant time and does not affect the overall VANET operation. In our previous work, we started to investigate these issues. This journal provides a more comprehensive analysis involving the beacon frequency, the size of beacon and the velocity of the vehicle. We used some of the concepts of Y-Comm architecture such as network dwell time (NDT), time before handover (TBH) and exit time (ET) to provide a framework to investigate handover issues. Further simulation studies were used to investigate the relation between beaconing, velocity and the network dwell time. Our results show that there is a need to understand the cumulative effect of beaconing in addition to the probability of successful reception as well as how these probability distributions are affected by the velocity of the vehicle. This provides more insight into how to support life critical applications using proactive handover techniques.

Description: We study the following separation problem: given \(n\) connected curves and two points \(s\) and \(t\) in the plane, compute the minimum number of curves one needs to retain so that any path connecting \(s\) to \(t\) intersects some of the retained curves. We give the first polynomial \((\fancyscript{O}(n^3))\) time algorithm for the problem, assuming that the curves have reasonable computational properties. The algorithm is based on considering the intersection graph of the curves, defining an appropriate family of closed walks in the intersection graph that satisfies the 3-path-condition, and arguing that a shortest cycle in the family gives an optimal solution. The 3-path-condition has been used mainly in topological graph theory, and thus its use here makes the connection to topology clear. We also show that the generalized version, where several input points are to be separated, is NP-hard for natural families of curves, like segments in two directions or unit circles.

Description: Monitoring is an important aspect of designing and maintaining large-scale systems. Cloud computing presents a unique set of challenges to monitoring including: on-demand infrastructure, unprecedented scalability, rapid elasticity and performance uncertainty. There are a wide range of monitoring tools originating from cluster and high-performance computing, grid computing and enterprise computing, as well as a series of newer bespoke tools, which have been designed exclusively for cloud monitoring. These tools express a number of common elements and designs, which address the demands of cloud monitoring to various degrees. This paper performs an exhaustive survey of contemporary monitoring tools from which we derive a taxonomy, which examines how effectively existing tools and designs meet the challenges of cloud monitoring. We conclude by examining the socio-technical aspects of monitoring, and investigate the engineering challenges and practices behind implementing monitoring strategies for cloud computing.

Description: No abstract

Description: Wireless sensor network (WSN) consists of a large number of sensors and sink nodes which are used to monitor events or environmental parameters, such as movement, temperature, humidity, etc. Reinforcement learning (RL) has been applied in a wide range of schemes in WSNs, such as cooperative communication, routing and rate control, so that the sensors and sink nodes are able to observe and carry out optimal actions on their respective operating environment for network and application performance enhancements. This article provides an extensive review on the application of RL to WSNs. This covers many components and features of RL, such as state, action and reward. This article presents how most schemes in WSNs have been approached using the traditional and enhanced RL models and algorithms. It also presents performance enhancements brought about by the RL algorithms, and open issues associated with the application of RL in WSNs. This article aims to establish a foundation in order to spark new research interests in this area. Our discussion has been presented in a tutorial manner so that it is comprehensive and applicable to readers outside the specialty of both RL and WSNs.

Description: Photographic volumes have been increasingly used in medical and biological researches in recent years. The original colors kept in photographic volumes present great opportunities to capture a rich set of information within the dataset for a wide variety of data analysis and visualization applications. Despite years of research, an interactive and user-friendly transfer function is still lacking for photographic volume visualization. The difficulty lies in how to map colors to a space that is convenient and intuitive for users to interactively classify features, i.e., specifying opacities for voxels. In this paper, we propose a color-based transfer function for intuitive opacity specification of photographic volumes. The color-based transfer function intelligently maps the colors from 3D to 1D, resulting in 256 representative colors which preserve the original colors to the maximum extent. Users can directly classify voxels based on these representative colors similar to the conventional 1D transfer function. Experiments are performed to evaluate the effectiveness of the proposed method, and also demonstrate the intuitiveness and flexibility of the proposed method. Graphical Abstract

Description: To clearly visualize the video structure and provide a user-friendly video content review and retrieval system, we first apply total variation (TV) metric to video shot segmentation and propose a novel video visualization method in this paper. Firstly, video data visualization design principles are proposed based on the analysis of video data characteristics. Secondly, a TV metric is proposed to measure the distance between two video frames. Then, video shots are detected by TV metric, video key frames are extracted by k-means algorithm, and similar shots are retrieved based on frame dominant color. Finally, according to the proposed video visualization design principles, a hierarchical radial video visualization method is presented. Experimental results show that the proposed video visualization method can express the video content and the whole structure directly and clearly. Graphical abstract