Weak and strong disjunction in possibilistic ASP

Possibilistic answer set programming (PASP) unites answer set programming (ASP) and possibilistic logic (PL) by associating certainty values with rules. The resulting framework allows to combine both non-monotonic reasoning and reasoning under uncertainty in a single framework. While PASP has been well-studied for possibilistic definite and possibilistic normal programs, we argue that the current semantics of possibilistic disjunctive programs are not entirely satisfactory. The problem is twofold. First, the treatment of negation-as-failure in existing approaches follows an all-or-nothing scheme that is hard to match with the graded notion of proof underlying PASP. Second, we advocate that the notion of disjunction can be interpreted in several ways. In particular, in addition to the view of ordinary ASP where disjunctions are used to induce a non-deterministic choice, the possibilistic setting naturally leads to a more epistemic view of disjunction. In this paper, we propose a semantics for possibilistic disjunctive programs, discussing both views on disjunction. Extending our earlier work, we interpret such programs as sets of constraints on possibility distributions, whose least specific solutions correspond to answer sets.

Inference in Polytrees with Sets of Probabilities

Inferences in directed acyclic graphs associated with probability intervals and sets of probabilities are NP-hard, even for polytrees. We propose: 1) an improvement on Tessem’s A/R algorithm for inferences on polytrees associated with probability intervals; 2) a new algorithm for approximate inferences based on local search; 3) branch-and-bound algorithms that combine the previous techniques. The first two algorithms produce complementary approximate solutions, while branch-and-bound procedures can generate either exact or approximate solutions. We report improvements on existing techniques for inference with probability sets and intervals, in some cases reducing computational effort by several orders of magnitude.

Modeling the Rossiter-McLaughlin Effect: Impact of the Convective Center-to-limb Variations in the Stellar Photosphere

bservations of the Rossiter–McLaughlin (RM) effect provide information on star–planet alignments, which can inform planetary migration and evolution theories. Here, we go beyond the classical RM modeling and explore the impact of a convective blueshift that varies across the stellar disk and non-Gaussian stellar photospheric profiles. We simulated an aligned hot Jupiter with a four-day orbit about a Sun-like star and injected center-to-limb velocity (and profile shape) variations based on radiative 3D magnetohydrodynamic simulations of solar surface convection. The residuals between our modeling and classical RM modeling were dependent on the intrinsic profile width and v sin i; the amplitude of the residuals increased with increasing v sin i and with decreasing intrinsic profile width. For slowly rotating stars the center-to-limb convective variation dominated the residuals (with amplitudes of 10 s of cm s−1 to ~1 m s−1); however, for faster rotating stars the dominant residual signature was due a non-Gaussian intrinsic profile (with amplitudes from 0.5 to 9 m s−1). When the impact factor was 0, neglecting to account for the convective center-to-limb variation led to an uncertainty in the obliquity of ~10°–20°, even though the true v sin i was known. Additionally, neglecting to properly model an asymmetric intrinsic profile had a greater impact for more rapidly rotating stars (e.g., v sin i = 6 km s−1) and caused systematic errors on the order of ~20° in the measured obliquities. Hence, neglecting the impact of stellar surface convection may bias star–planet alignment measurements and consequently theories on planetary migration and evolution.

Systematically retrieving research in the digital age: Case study on the topic of social networking sites and young people’s mental health

Online information seeking has become normative practice among both academics and the general population. This study appraised the performance of eight databases to retrieve research pertaining to the influence of social networking sites on the mental health of young people. A total of 43 empirical studies on young people’s use of social networking sites and the mental health implications were retrieved. Scopus and SSCI had the highest sensitivity with PsycINFO having the highest precision. Effective searching requires large
generic databases, supplemented by subject-specific catalogues. The methodology developed here may provide inexperienced searchers, such as undergraduate students, with a framework to define a realistic scale of searching to undertake for a particular literature review or similar project.

Multilinear and Integer Programming for Markov Decision Processes with Imprecise Probabilities

Markov Decision Processes (MDPs) are extensively used to encode sequences of decisions with probabilistic effects. Markov Decision Processes with Imprecise Probabilities (MDPIPs) encode sequences of decisions whose effects are modeled using sets of probability distributions. In this paper we examine the computation of Γ-maximin policies for MDPIPs using multilinear and integer programming. We discuss the application of our algorithms to “factored” models and to a recent proposal, Markov Decision Processes with Set-valued Transitions (MDPSTs), that unifies the fields of probabilistic and “nondeterministic” planning in artificial intelligence research. 

Embracing an integromic approach to tissue biomarker research in cancer: Perspectives and lessons learned

Modern approaches to biomedical research and diagnostics targeted towards precision medicine are generating ‘big data’ across a range of high-throughput experimental and analytical platforms. Integrative analysis of this rich clinical, pathological, molecular and imaging data represents one of the greatest bottlenecks in biomarker discovery research in cancer and other diseases. Following on from the publication of our successful framework for multimodal data amalgamation and integrative analysis, Pathology Integromics in Cancer (PICan), this article will explore the essential elements of assembling an integromics framework from a more detailed perspective. PICan, built around a relational database storing curated multimodal data, is the research tool sitting at the heart of our interdisciplinary efforts to streamline biomarker discovery and validation. While recognizing that every institution has a unique set of priorities and challenges, we will use our experiences with PICan as a case study and starting point, rationalizing the design choices we made within the context of our local infrastructure and specific needs, but also highlighting alternative approaches that may better suit other programmes of research and discovery. Along the way, we stress that integromics is not just a set of tools, but rather a cohesive paradigm for how modern bioinformatics can be enhanced. Successful implementation of an integromics framework is a collaborative team effort that is built with an eye to the future and greatly accelerates the processes of biomarker discovery, validation and translation into clinical practice.