This article introduces a general framework of multi-granulation fuzzy probabilistic roughsets (MG-FPRSs) models in multi-granulation fuzzy probabilistic approximation space over twouniverses. Four types of MG-FPRSs are established, by the four different conditional probabilitiesof fuzzy event. For different constraints on parameters, we obtain four kinds of each type MG-FPRSs...

CoLoSS, the Coalgebraic Logic Satisfiability Solver, decides satisfiability of modal formulas in a generic and compositional way. It implements a uniform polynomial space algorithm to decide satisfiability for modal logics that are amenable to coalgebraic semantics. This includes e.g. the logics K, KD, Pauly’s coalition logic, graded modal logic, and probabilistic modal logic. Logics are easily...

Two important recent trends in nlg are (i) probabilistic techniques and (ii) comprehensive approaches that move away from traditional strictly modular and sequential models. This paper reports experiments in which pcru — a generation framework that combines probabilistic generation methodology with a comprehensive model of the generation space — was used to semi-automatically create five differ...

We present a flexible object-oriented framework for specifying modular resource management policies in concurrent systems. The framework generalizes the basic abstractions we originally developed for lottery scheduling [16]. It is independent of the underlying proportional-share scheduler; a variety of probabilistic and deterministic algorithms can be used, including a min-funding revocation al...

Two important recent trends in NLG are (i) probabilistic techniques and (ii) comprehensive approaches that move away from traditional strictly modular and sequential models. This paper reports experiments in which pCRU — a generation framework that combines probabilistic generation methodology with a comprehensive model of the generation space — was used to semi-automatically create five differ...

CoLoSS, the Coalgebraic Logic Satisfiability Solver, decides satisfiability of modal formulas in a generic and compositional way. It implements a uniform polynomial space algorithm to decide satisfiability for modal logics that are amenable to coalgebraic semantics. This includes e.g. the logics K, KD, Pauly’s coalition logic, graded modal logic, and probabilistic modal logic. Logics are easily...

We present a new approach to building a modular segmented space telescope that greatly leverages the heritage of the Hubble Space Telescope and the James Webb Space Telescope. The modular design in which mirror segments are assembled into identical panels allows for economies of scale and for efficient space assembly that make a 20-m aperture approach cost effective. This assembly approach can ...

SUMMARY The Infobiotics Workbench is an integrated software suite incorporating model specification, simulation, parameter optimization and model checking for Systems and Synthetic Biology. A modular model specification allows for straightforward creation of large-scale models containing many compartments and reactions. Models are simulated either using stochastic simulation or numerical integr...