Search results for "ddc:004"
showing 10 items of 21 documents
Fuzzy subgroup mining for gene associations
2004
When studying the therapeutic efficacy of potential new drugs, it would be much more efficient to use predictors in order to assess their toxicity before going into clinical trials. One promising line of research has focused on the discovery of sets of candidate gene profiles to be used as toxicity indicators in future drug development. In particular genomic microarrays may be used to analyze the causality relationship between the administration of the drugs and the so-called gene expression, a parameter typically used by biologists to measure its influence at gene level. This kind of experiments involves a high throughput analysis of noisy and particularly unreliable data, which makes the …
Measurement, Prediction, and Control of Individual Heart Rate Responses to Exercise-Basics and Options for Wearable Devices.
2018
The use of wearable devices or "wearables" in the physical activity domain has been increasing in the last years. These devices are used as training tools providing the user with detailed information about individual physiological responses and feedback to the physical training process. Advantages in sensor technology, miniaturization, energy consumption and processing power increased the usability of these wearables. Furthermore, available sensor technologies must be reliable, valid, and usable. Considering the variety of the existing sensors not all of them are suitable to be integrated in wearables. The application and development of wearables has to consider the characteristics of the p…
FO^2 with one transitive relation is decidable
2013
We show that the satisfiability problem for the two-variable first-order logic, FO^2, over transitive structures when only one relation is required to be transitive, is decidable. The result is optimal, as FO^2 over structures with two transitive relations, or with one transitive and one equivalence relation, are known to be undecidable, so in fact, our result completes the classification of FO^2-logics over transitive structures with respect to decidability. We show that the satisfiability problem is in 2-NExpTime. Decidability of the finite satisfiability problem remains open.
The complexity of finite model reasoning in description logics
2005
AbstractWe analyse the complexity of finite model reasoning in the description logic ALCQI, i.e., ALC augmented with qualifying number restrictions, inverse roles, and general TBoxes. It turns out that all relevant reasoning tasks such as concept satisfiability and ABox consistency are ExpTime-complete, regardless of whether the numbers in number restrictions are coded unarily or binarily. Thus, finite model reasoning with ALCQI is not harder than standard reasoning with ALCQI.
High Order Compact Finite Difference Schemes for A Nonlinear Black-Scholes Equation
2001
A nonlinear Black-Scholes equation which models transaction costs arising in the hedging of portfolios is discretized semi-implicitly using high order compact finite difference schemes. A new compact scheme, generalizing the compact schemes of Rigal [29], is derived and proved to be unconditionally stable and non-oscillatory. The numerical results are compared to standard finite difference schemes. It turns out that the compact schemes have very satisfying stability and non-oscillatory properties and are generally more efficient than the considered classical schemes.
Earth System Chemistry integrated Modelling (ESCiMo) with the Modular Earth Submodel System (MESSy) version 2.51
2016
Abstract. Three types of reference simulations, as recommended by the Chemistry–Climate Model Initiative (CCMI), have been performed with version 2.51 of the European Centre for Medium-Range Weather Forecasts – Hamburg (ECHAM)/Modular Earth Submodel System (MESSy) Atmospheric Chemistry (EMAC) model: hindcast simulations (1950–2011), hindcast simulations with specified dynamics (1979–2013), i.e. nudged towards ERA-Interim reanalysis data, and combined hindcast and projection simulations (1950–2100). The manuscript summarizes the updates of the model system and details the different model set-ups used, including the on-line calculated diagnostics. Simulations have been performed with two diff…
The IceProd framework: distributed data processing for the IceCube neutrino observatory
2015
IceCube is a one-gigaton instrument located at the geographic South Pole, designed to detect cosmic neutrinos, identify the particle nature of dark matter, and study high-energy neutrinos themselves. Simulation of the IceCube detector and processing of data require a significant amount of computational resources. This paper presents the first detailed description of IceProd, a lightweight distributed management system designed to meet these requirements. It is driven by a central database in order to manage mass production of simulations and analysis of data produced by the IceCube detector. IceProd runs as a separate layer on top of other middleware and can take advantage of a variety of c…
Update of the Binoth Les Houches Accord for a standard interface between Monte Carlo tools and one-loop programs
2014
We present an update of the Binoth Les Houches Accord (BLHA) to standardise the interface between Monte Carlo programs and codes providing one-loop matrix elements.
When are researchers willing to share their data? - Impacts of values and uncertainty on open data in academia.
2020
PLOS ONE 15(7), e0234172 (2020). doi:10.1371/journal.pone.0234172
Most Diverse Near-Shortest Paths
2021
Computing the shortest path in a road network is a fundamental problem that has attracted lots of attention. However, in many real-world scenarios, determining solely the shortest path is not enough as users want to have additional, alternative ways of reaching their destination. In this paper, we investigate a novel variant of alternative routing, termed the k-Most Diverse Near-Shortest Paths (kMDNSP). In contrast to previous work, kMDNSP aims at maximizing the diversity of the recommended paths, while bounding their length based on a user-defined constraint. Our theoretical analysis proves the NP-hardness of the problem at hand. To compute an exact solution to kMDNSP, we present an algori…