Distributed File System Virtualization Techniques Supporting On-Demand Virtual Machine Environments for Grid Computing

This paper presents a data management solution which allows fast Virtual Machine (VM) instantiation and efficient run-time execution to support VMs as execution environments in Grid computing. It is based on novel distributed file system virtualization techniques and is unique in that: (1) it provides on-demand cross-domain access to VM state for unmodified VM monitors; (2) it enables private file system channels for VM instantiation by secure tunneling and session-key based authentication; (3) it supports user-level and write-back disk caches, per-application caching policies and middleware-driven consistency models; and (4) it leverages application-specific meta-data associated with files to expedite data transfers. The paper reports on its performance in wide-area setups using VMware-based VMs. Results show that the solution delivers performance over 30% better than native NFS and with warm caches it can bring the application-perceived overheads below 10% compared to a local-disk setup. The solution also allows a VM with 1.6 GB virtual disk and 320 MB virtual memory to be cloned within 160 seconds for the first clone and within 25 seconds for subsequent clones. Ming Zhao is a PhD candidate in the department of Electrical and Computer Engineering and a member of the Advance Computing and Information Systems Laboratory, at University of Florida. He received the degrees of BE and ME from Tsinghua University. His research interests are in the areas of computer architecture, operating systems and distributed computing. Jian Zhang is a PhD student in the Department of Electrical and Computer Engineering at University of Florida and a member of the Advance Computing and Information Systems Laboratory (ACIS). Her research interest is in virtual machines and Grid computing. She is a member of the IEEE and the ACM. Renato J. Figueiredo received the B.S. and M.S. degrees in Electrical Engineering from the Universidade de Campinas in 1994 and 1995, respectively, and the Ph.D. degree in Electrical and Computer Engineering from Purdue University in 2001. From 2001 until 2002 he was on the faculty of the School of Electrical and Computer Engineering of Northwestern University at Evanston, Illinois. In 2002 he joined the Department of Electrical and Computer Engineering of the University of Florida as an Assistant Professor. His research interests are in the areas of computer architecture, operating systems, and distributed systems.     

GIS-based distributed model for simulating runoff and sediment load in the Malian River Basin

GIS-based modeling is an effective approach for reflecting spatially-varied complexities in watershed systems. In this study, a GIS-aided distributive hydrological model was developed to simulate runoff and sediment transport in a loess-plateau context with semi-arid climate, sparse vegetation, and serious soil erosion. The model was then applied to a case study in the Malian River Basin, which is one of the largest catchments in the middle reach of the Yellow River. Based on the GIS technique, the DEM of the study basin was successfully used to delineate the stream network and extract information of catchment characteristics. The results show satisfactory accuracy for runoff simulation. Especially, the integrated soil-erosion and hydrological models can be used for simulating both runoff and sediment loads, which provide a useful decision-support tool for water resources management and pollution control. This study is an attempt to develop a distributed rainfall-runoff model for river basins in the loess plateau region. The developed model can also be extended to larger basins. Further works of field survey and investigation would be helpful for better calibrating critical parameters and thus improving performance of the developed model.     

Global exponential stability of positive periodic solution of the n-species impulsive Gilpin–Ayala competition model with discrete and distributed time delays

In this paper, we study the n-species impulsive Gilpin–Ayala competition model with discrete and distributed time delays. The existence of positive periodic solution is proved by employing the fixed point theorem on cones. By constructing appropriate Lyapunov functional, we also obtain the global exponential stability of the positive periodic solution of this system. As an application, an interesting example is provided to illustrate the validity of our main results.     

Advanced Cell Mapping Visualizations for Single Cell Functional Proteomics Enabling Patient Stratification

Highly multiplexed single‐cell functional proteomics has emerged as one of the next‐generation toolkits for a deeper understanding of functional heterogeneity in cell. Different from the conventional population‐based bulk and single‐cell RNA‐Seq assays, the microchip‐based proteomics at the single‐cell resolution enables a unique identification of highly polyfunctional cell subsets that co‐secrete many proteins from live single cells and most importantly correlate with patient response to a therapy. The 32‐plex IsoCode chip technology has defined a polyfunctional strength index (PSI) of pre‐infusion anti‐CD19 chimeric antigen receptor (CAR)‐T products, that is significantly associated with patient response to the CAR‐T cell therapy. To complement the clinical relevance of the PSI, a comprehensive visualization toolkit of 3D uniform manifold approximation and projection (UMAP) and t‐distributed stochastic neighbor embedding (t‐SNE) in a proteomic analysis pipeline is developed, providing more advanced analytical algorithms for more intuitive data visualizations. The UMAP and t‐SNE of anti‐CD19 CAR‐T products reveal distinct cytokine profiles between nonresponders and responders and demonstrate a marked upregulation of antitumor‐associated cytokine signatures in CAR‐T cells from responding patients. Using this powerful while user‐friendly analytical tool, the multi‐dimensional single‐cell data can be dissected from complex immune responses and uncover underlying mechanisms, which can promote correlative biomarker discovery, improved bioprocessing, and personalized treatment development.     

Comparative Map and Trait Viewer (CMTV): an integrated bioinformatic tool to construct consensus maps and compare QTL and functional genomics data across genomes and experiments

In the past few decades, a wealth of genomic data has been produced in a wide variety of species using a diverse array of functional and molecular marker approaches. In order to unlock the full potential of the information contained in these independent experiments, researchers need efficient and intuitive means to identify common genomic regions and genes involved in the expression of target phenotypic traits across diverse conditions. To address this need, we have developed a Comparative Map and Trait Viewer (CMTV) tool that can be used to construct dynamic aggregations of a variety of types of genomic datasets. By algorithmically determining correspondences between sets of objects on multiple genomic maps, the CMTV can display syntenic regions across taxa, combine maps from separate experiments into a consensus map, or project data from different maps into a common coordinate framework using dynamic coordinate translations between source and target maps. We present a case study that illustrates the utility of the tool for managing large and varied datasets by integrating data collected by CIMMYT in maize drought tolerance research with data from public sources. This example will focus on one of the visualization features for Quantitative Trait Locus (QTL) data, using likelihood ratio (LR) files produced by generic QTL analysis software and displaying the data in a unique visual manner across different combinations of traits, environments and crosses. Once a genomic region of interest has been identified, the CMTV can search and display additional QTLs meeting a particular threshold for that region, or other functional data such as sets of differentially expressed genes located in the region; it thus provides an easily used means for organizing and manipulating data sets that have been dynamically integrated under the focus of the researchers specific hypothesis.     

A \sqrt N Dynamic Load Distribution Algorithm Using Anti-Tasks and Load State Vectors

One of the fundamental issues to ensure maximal performance improvement in a cluster computing environment is load distribution, which is commonly achieved by using polling-based load distribution algorithms. Such algorithms suffer from two weaknesses: (1) Load information exchanged during a polling session is confined to the two negotiating nodes only. (2) Such algorithms are not scalable in that growth of the distributed system is accompanied with increasing amount of polling sessions.In this paper, we proposed a LD algorithm which is based on anti-tasks and load state vectors. Anti-tasks travel around the distributed system for pairing up task senders and receivers. As an anti-task travels, timed load information is collected and disseminated over the entire system via the load state vector bundled with the anti-task. Guided by load state vectors, anti-tasks are spontaneously directed towards processing nodes having high transient workload, thus allowing their surplus workload to be relocated soonest possible. No peer-to-peer negotiations between senders and receivers are needed.To reduce the network bandwidth consumption caused by the anti-task algorithm, the number of hosts that an anti-task needs to travel to must be carefully limited. The algorithm achieves this by employing the mathematical notion of Finite Projective Plane (FPP). By employing FPP, the number of nodes that each anti-task has to travel is at most , where N is the number of nodes in the system, without sacrifying the spread of load information.     

Improved protein-ligand docking using GOLD

The Chemscore function was implemented as a scoring function for the protein-ligand docking program GOLD, and its performance compared to the original Goldscore function and two consensus docking protocols, "Goldscore-CS" and "Chemscore-GS," in terms of docking accuracy, prediction of binding affinities, and speed. In the "Goldscore-CS" protocol, dockings produced with the Goldscore function are scored and ranked with the Chemscore function; in the "Chemscore-GS" protocol, dockings produced with the Chemscore function are scored and ranked with the Goldscore function. Comparisons were made for a "clean" set of 224 protein-ligand complexes, and for two subsets of this set, one for which the ligands are "drug-like," the other for which they are "fragment-like." For "drug-like" and "fragment-like" ligands, the docking accuracies obtained with Chemscore and Goldscore functions are similar. For larger ligands, Goldscore gives superior results. Docking with the Chemscore function is up to three times faster than docking with the Goldscore function. Both combined docking protocols give significant improvements in docking accuracy over the use of the Goldscore or Chemscore function alone. "Goldscore-CS" gives success rates of up to 81% (top-ranked GOLD solution within 2.0 A of the experimental binding mode) for the "clean list," but at the cost of long search times. For most virtual screening applications, "Chemscore-GS" seems optimal; search settings that give docking speeds of around 0.25-1.3 min/compound have success rates of about 78% for "drug-like" compounds and 85% for "fragment-like" compounds. In terms of producing binding energy estimates, the Goldscore function appears to perform better than the Chemscore function and the two consensus protocols, particularly for faster search settings. Even at docking speeds of around 1-2 min/compound, the Goldscore function predicts binding energies with a standard deviation of approximately 10.5 kJ/mol.