18 research outputs found

    Formal Modeling and Analysis of the MAL-Associated Biological Regulatory Network: Insight into Cerebral Malaria

    Get PDF
    The discrete modeling formalism of René Thomas is a well known approach for the modeling and analysis of Biological Regulatory Networks (BRNs). This formalism uses a set of parameters which reflect the dynamics of the BRN under study. These parameters are initially unknown but may be deduced from the appropriately chosen observed dynamics of a BRN. The discrete model can be further enriched by using the model checking tool HyTech along with delay parameters. This paves the way to accurately analyse a BRN and to make predictions about critical trajectories which lead to a normal or diseased response. In this paper, we apply the formal discrete and hybrid (discrete and continuous) modeling approaches to characterize behavior of the BRN associated with MyD88-adapter-like (MAL) – a key protein involved with innate immune response to infections. In order to demonstrate the practical effectiveness of our current work, different trajectories and corresponding conditions that may lead to the development of cerebral malaria (CM) are identified. Our results suggest that the system converges towards hyperinflammation if Bruton's tyrosine kinase (BTK) remains constitutively active along with pre-existing high cytokine levels which may play an important role in CM pathogenesis

    Visualizing Large Telecommunication Data Sets

    No full text

    Visual Exploration of Large Telecommunication Data Sets

    No full text
    Visual exploration of massive data sets arising in the telecommunication industry is a challenge. This paper describes a number of different techniques for visually exploring large data sets. The techniques cover a wide range of techniques, including statistical 2D displays, pixel-oriented displays, and dynamic 3D displays with variable resolution. The techniques have been successfully applied in the telecommunications industry to analyze call detail data for understanding customer behavior and preventing fraudulent usage, and to monitor network traffic for analyzing unexpected network events such as high volumes of unanswered calls

    Capturing and Visualizing Event Flow Graphs of MPI Applications

    No full text

    Visualizing large-scale telecommunication networks and services (case study

    No full text
    Visual exploration of massive data sets arising from telecommunication networks and services is a challenge. This paper describes SWIFT-3D, an integrated data visualization and exploration system created at AT&T Labs for large scale network analysis. SWIFT-3D integrates a collection of interactive tools that includes pixel-oriented 2D maps, interactive 3D maps, statistical displays, network topology diagrams and an interactive drill-down query interface. Example applications are described, demonstrating a successful application to analyze unexpected network events (high volumes of unanswered calls), and comparison of usage of an Internet service with voice network traffic and local access coverage.

    A graph drawing and translation service on the WWW

    No full text

    Visualizing Large-Scale Telecommunication Networks and Services

    No full text
    Global telecommunication networks and services are among the enterprises having the highest volumes of real-time data. A voice network may complete more than 250 million calls per day. Each is de

    Visitor combination and traversal control

    Get PDF
    The emph{Visitor design pattern allows the encapsulation of polymorphic behavior outside the class hierarchy on which it operates. A common application of emph{Visitor is the encapsulation of tree traversals. Unfortunately, visitors resist composition and allow little traversal control. To remove these limitations, we introduce visitor emph{combinators. These are implementations of the visitor interface that can be used to emph{compose new visitors from given ones. The set of combinators we propose includes emph{traversal combinators that can be used to obtain full traversal control. A clean separation can be made between the generic parts of the combinator set and the parts that are specific to a particular class hierarchy. The generic parts form a reusable framework. The specific parts can be generated from a (tree) grammar. Due to this separation, programming with visitor combinators becomes a form of emph{generic programming with significant reuse of (visitor) code
    corecore