Structural similarity of directed universal hierarchical graphs: A low computational complexity approach

In the present paper we mainly introduce an efficient approach to measure the structural similarity of so called directed universal hierarchical graphs. We want to underline that directed universal hierarchical graphs can be obtained from generalized trees which are already introduced. In order to classify these graphs, we state our novel graph similarity method. As a main result we notice that our novel algorithm has low computational complexity. (c) 2007 Elsevier Inc. All rights reserved.

A Capabilities-Aware Framework for Using Computational Accelerators in Data-Intensive Computing

Multicore computational accelerators such as GPUs are now commodity components for highperformance computing at scale. While such accelerators have been studied in some detail as stand-alone computational engines, their integration in large-scale distributed systems raises new challenges and trade-offs. In this paper, we present an exploration of resource management alternatives for building asymmetric accelerator-based distributed systems. We present these alternatives in the context of a capabilities-aware framework for data-intensive computing, which uses an enhanced implementation of the MapReduce programming model for accelerator-based clusters, compared to the state of the art. The framework can transparently utilize heterogeneous accelerators for deriving high performance with low programming effort. Our work is the first to compare heterogeneous types of accelerators, GPUs and a Cell processors, in the same environment and the first to explore the trade-offs between compute-efficient and control-efficient accelerators on data-intensive systems. Our investigation shows that our framework scales well with the number of different compute nodes. Furthermore, it runs simultaneously on two different types of accelerators, successfully adapts to the resource capabilities, and performs 26.9% better on average than a static execution approach.

A COMPUTATIONAL INVESTIGATION OF THE NEON-LIKE GERMANIUM COLLISIONALLY PUMPED LASER

The complex problem of a collisionally pumped Ne-like geranium laser is examined through several detailed models. The central model is EHYBRID; a 1 1/2D fluid code which self consistently treats the plasma expansion with the atomic physics of the Ne-like ion for 124 excited levels through a collisional radiative treatment. The output of EHYBRID is used as data for ray-tracing and saturation codes which generate experimental observables. A detailed description of the models is given.

A computational model of cellular response to modulated radiation fields

Purpose:
To develop a model to describe the response of cell populations to spatially modulated radiation exposures of relevance to advanced radiotherapies.

Materials and Methods:
A Monte Carlo model of cellular radiation response was developed. This model incorporated damage from both direct radiation and intercellular communication including bystander signaling. The predictions of this model were compared to previously measured survival curves for a normal human fibroblast line (AGO1522) and prostate tumor cells (DU145) exposed to spatially modulated fields.

Results:
The model was found to be able to accurately reproduce cell survival both in populations which were directly exposed to radiation and those which were outside the primary treatment field. The model predicts that the bystander effect makes a significant contribution to cell killing even in uniformly irradiated cells. The bystander effect contribution varies strongly with dose, falling from a high of 80% at low doses to 25% and 50% at 4 Gy for AGO1522 and DU145 cells, respectively. This was verified using the inducible nitric oxide synthase inhibitor aminoguanidine to inhibit the bystander effect in cells exposed to different doses, which showed significantly larger reductions in cell killing at lower doses.

Conclusions:
The model presented in this work accurately reproduces cell survival following modulated radiation exposures, both in and out of the primary treatment field, by incorporating a bystander component. In addition, the model suggests that the bystander effect is responsible for a significant portion of cell killing in uniformly irradiated cells, 50% and 70% at doses of 2 Gy in AGO1522 and DU145 cells, respectively. This description is a significant departure from accepted radiobiological models and may have a significant impact on optimization of treatment planning approaches if proven to be applicable in vivo.

Computational learning of the conditional phase-type (C-Ph) distribution: Learning C-Ph distributions

This paper presents a new algorithm for learning the structure of a special type of Bayesian network. The conditional phase-type (C-Ph) distribution is a Bayesian network that models the probabilistic causal relationships between a skewed continuous variable, modelled by the Coxian phase-type distribution, a special type of Markov model, and a set of interacting discrete variables. The algorithm takes a dataset as input and produces the structure, parameters and graphical representations of the fit of the C-Ph distribution as output.The algorithm, which uses a greedy-search technique and has been implemented in MATLAB, is evaluated using a simulated data set consisting of 20,000 cases. The results show that the original C-Ph distribution is recaptured and the fit of the network to the data is discussed.

Computational identification of self-inhibitory peptides from envelope proteins

Fusion process is known to be the initial step of viral infection and hence targeting the entry process is a promising strategy to design antiviral therapy. The self-inhibitory peptides derived from the enveloped (E) proteins function to inhibit the proteinprotein interactions in the membrane fusion step mediated by the viral E protein. Thus, they have the potential to be developed into effective antiviral therapy. Herein, we have developed a Monte Carlo-based computational method with the aim to identify and optimize potential peptide hits from the E proteins. The stability of the peptides, which indicates their potential to bind in situ to the E proteins, was evaluated by two different scoring functions, dipolar distance-scaled, finite, ideal-gas reference state and residue-specific all-atom probability discriminatory function. The method was applied to a-helical Class I HIV-1 gp41, beta-sheet Class II Dengue virus (DENV) type 2 E proteins, as well as Class III Herpes Simplex virus-1 (HSV-1) glycoprotein, a E protein with a mixture of a-helix and beta-sheet structural fold. The peptide hits identified are in line with the druggable regions where the self-inhibitory peptide inhibitors for the three classes of viral fusion proteins were derived. Several novel peptides were identified from either the hydrophobic regions or the functionally important regions on Class II DENV-2 E protein and Class III HSV-1 gB. They have potential to disrupt the proteinprotein interaction in the fusion process and may serve as starting points for the development of novel inhibitors for viral E proteins. 

The Computational Complexity of Dominance and Consistency in CP-Nets

We investigate the computational complexity of testing dominance and consistency in CP-nets. Previously, the complexity of dominance has been determined for restricted classes in which the dependency graph of the CP-net is acyclic. However, there are preferences of interest that define cyclic dependency graphs; these are modeled with general CP-nets. In our main results, we show here that both dominance and consistency for general CP-nets are PSPACE-complete. We then consider the concept of strong dominance, dominance equivalence and dominance incomparability, and several notions of optimality, and identify the complexity of the corresponding decision problems. The reductions used in the proofs are from STRIPS planning, and thus reinforce the earlier established connections between both areas.