Probabilistic logic with independence

This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider graph-theoretic representations for propositional probabilistic logic with independence; complexity is analyzed, algorithms are derived, and examples are discussed. Finally, we examine a restricted first-order probabilistic logic that generalizes relational Bayesian networks. (c) 2007 Elsevier Inc. All rights reserved.

Approximate algorithms for credal networks with binary variables

This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can represent incomplete or vague beliefs, lack of data, and disagreements among experts; they can also encode models based on belief functions and possibilistic measures. All algorithms for approximate inference in this paper rely on exact inferences in credal networks based on polytrees with binary variables, as these inferences have polynomial complexity. We are inspired by approximate algorithms for Bayesian networks; thus the Loopy 2U algorithm resembles Loopy Belief Propagation, while the Iterated Partial Evaluation and Structured Variational 2U algorithms are, respectively, based on Localized Partial Evaluation and variational techniques. (C) 2007 Elsevier Inc. All rights reserved.

Sequential decision making with partially ordered preferences

This paper presents new insights and novel algorithms for strategy selection in sequential decision making with partially ordered preferences; that is, where some strategies may be incomparable with respect to expected utility. We assume that incomparability amongst strategies is caused by indeterminacy/imprecision in probability values. We investigate six criteria for consequentialist strategy selection: Gamma-Maximin, Gamma-Maximax, Gamma-Maximix, Interval Dominance, Maximality and E-admissibility. We focus on the popular decision tree and influence diagram representations. Algorithms resort to linear/multilinear programming; we describe implementation and experiments. (C) 2010 Elsevier B.V. All rights reserved.

A Separation Principle for the Continuous-Time LQ-Problem With Markovian Jump Parameters

In this paper, we devise a separation principle for the finite horizon quadratic optimal control problem of continuous-time Markovian jump linear systems driven by a Wiener process and with partial observations. We assume that the output variable and the jump parameters are available to the controller. It is desired to design a dynamic Markovian jump controller such that the closed loop system minimizes the quadratic functional cost of the system over a finite horizon period of time. As in the case with no jumps, we show that an optimal controller can be obtained from two coupled Riccati differential equations, one associated to the optimal control problem when the state variable is available, and the other one associated to the optimal filtering problem. This is a separation principle for the finite horizon quadratic optimal control problem for continuous-time Markovian jump linear systems. For the case in which the matrices are all time-invariant we analyze the asymptotic behavior of the solution of the derived interconnected Riccati differential equations to the solution of the associated set of coupled algebraic Riccati equations as well as the mean square stabilizing property of this limiting solution. When there is only one mode of operation our results coincide with the traditional ones for the LQG control of continuous-time linear systems.

Expertise and the perception of kinematic and situational probability information

Two experiments were conducted on the nature of expert perception in the sport of squash. In the first experiment, ten expert and fifteen novice players attempted to predict the direction and force of squash strokes from either a film display (occluded at variable time periods before and after the opposing player had struck the ball) or a matched point-light display (containing only the basic kinematic features of the opponent's movement pattern). Experts outperformed the novices under both display conditions, and the same basic time windows that characterised expert and novice pick-up of information in the film task also persisted in the point-light task. This suggests that the experts' perceptual advantage is directly related to their superior pick-up of essential kinematic information. In the second experiment, the vision of six expert and six less skilled players was occluded by remotely triggered liquid-crystal spectacles at quasi-random intervals during simulated match play. Players were required to complete their current stroke even when the display was occluded and their prediction performance was assessed with respect to whether they moved to the correct half of the court to match the direction and depth of the opponent's stroke. Consistent with experiment 1, experts were found to be superior in their advance pick-up of both directional and depth information when the display was occluded during the opponent's hitting action. However, experts also remained better than chance, and clearly superior to less skilled players, in their prediction performance under conditions where occlusion occurred before any significant pre-contact preparatory movement by the opposing player was visible. This additional source of expert superiority is attributable to their superior attunement to the information contained in the situational probabilities and sequential dependences within their opponent's pattern of play.

Spectral properties of the tandem Jackson network, seen as a quasi-birth-and-death process

Quasi-birth-and-death (QBD) processes with infinite “phase spaces” can exhibit unusual and interesting behavior. One of the simplest examples of such a process is the two-node tandem Jackson network, with the “phase” giving the state of the first queue and the “level” giving the state of the second queue. In this paper, we undertake an extensive analysis of the properties of this QBD. In particular, we investigate the spectral properties of Neuts’s R-matrix and show that the decay rate of the stationary distribution of the “level” process is not always equal to the convergence norm of R. In fact, we show that we can obtain any decay rate from a certain range by controlling only the transition structure at level zero, which is independent of R. We also consider the sequence of tandem queues that is constructed by restricting the waiting room of the first queue to some finite capacity, and then allowing this capacity to increase to infinity. We show that the decay rates for the finite truncations converge to a value, which is not necessarily the decay rate in the infinite waiting room case. Finally, we show that the probability that the process hits level n before level 0 given that it starts in level 1 decays at a rate which is not necessarily the same as the decay rate for the stationary distribution.

A fast cross-entropy method for estimating buffer overflows in queuing networks

In this paper, we propose a fast adaptive importance sampling method for the efficient simulation of buffer overflow probabilities in queueing networks. The method comprises three stages. First, we estimate the minimum cross-entropy tilting parameter for a small buffer level; next, we use this as a starting value for the estimation of the optimal tilting parameter for the actual (large) buffer level. Finally, the tilting parameter just found is used to estimate the overflow probability of interest. We study various properties of the method in more detail for the M/M/1 queue and conjecture that similar properties also hold for quite general queueing networks. Numerical results support this conjecture and demonstrate the high efficiency of the proposed algorithm.

The collision branching process

We consider a branching model, which we call the collision branching process (CBP), that accounts for the effect of collisions, or interactions, between particles or individuals. We establish that there is a unique CBP, and derive necessary and sufficient conditions for it to be nonexplosive. We review results on extinction probabilities, and obtain explicit expressions for the probability of explosion and the expected hitting times. The upwardly skip-free case is studied in some detail.

Asymmetry and duration dependence in Australian GDP and unemployment

The per iodic structure of business cycles suggests that significant asymmetries are present over different phases of the cycle. This paper uses markov regime-switching models with fixed and duration dependent transition probabilities to directly model expansions, contractions and durations in Australian GDP growth and unemployment growth. Evidence is found of significant asymmetry in growth rates across expansions and contractions for both series. GDP contractions exhibit duration dependence implying that as output recessions age the likelihood of switching into an expansion phase increases. Unemployment growth does not exhibit duration dependence in either phase. Evidence is also presented that non-linearities in unemployment growth are well explained by the asymmetries in the GDP growth cycle. The analysis suggests that recessions are periods of rapid and intense job destruction, that Australian unemployment tends to ratchet up in recessionary periods and, in contrast to US and UK studies, that shocks to Australian unemployment growth are more persistent in recessions than expansions. [E37 C5 C41].

Quasistationarity of continuous-time Markov chains with positive drift

We shall study continuous-time Markov chains on the nonnegative integers which are both irreducible and transient, and which exhibit discernible stationarity before drift to infinity sets in. We will show how this 'quasi' stationary behaviour can be modelled using a limiting conditional distribution: specifically, the limiting state probabilities conditional on not having left 0 for the last time. By way of a dual chain, obtained by killing the original process on last exit from 0, we invoke the theory of quasistationarity for absorbing Markov chains. We prove that the conditioned state probabilities of the original chain are equal to the state probabilities of its dual conditioned on non-absorption, thus allowing us to establish the simultaneous existence and then equivalence, of their limiting conditional distributions. Although a limiting conditional distribution for the dual chain is always a quasistationary distribution in the usual sense, a similar statement is not possible for the original chain.

Further results on the relationship between mu-invariant measures and quasi-stationary distributions for absorbing continuous-time Markov chains

This note considers continuous-time Markov chains whose state space consists of an irreducible class, C, and an absorbing state which is accessible from C. The purpose is to provide results on mu-invariant and mu-subinvariant measures where absorption occurs with probability less than one. In particular, the well-known premise that the mu-invariant measure, m, for the transition rates be finite is replaced by the more natural premise that m be finite with respect to the absorption probabilities. The relationship between mu-invariant measures and quasi-stationary distributions is discussed. (C) 2000 Elsevier Science Ltd. All rights reserved.

Limiting conditional distributions for birth-death processes

In a recent paper [16], one of us identified all of the quasi-stationary distributions for a non-explosive, evanescent birth-death process for which absorption is certain, and established conditions for the existence of the corresponding limiting conditional distributions. Our purpose is to extend these results in a number of directions. We shall consider separately two cases depending on whether or not the process is evanescent. In the former case we shall relax the condition that absorption is certain. Furthermore, we shall allow for the possibility that the minimal process might be explosive, so that the transition rates alone will not necessarily determine the birth-death process uniquely. Although we shall be concerned mainly with the minimal process, our most general results hold for any birth-death process whose transition probabilities satisfy both the backward and the forward Kolmogorov differential equations.

Optimal quantum trajectories for discrete measurements

Using the method of quantum trajectories we show that a known pure state can be optimally monitored through time when subject to a sequence of discrete measurements. By modifying the way that we extract information from the measurement apparatus we can minimize the average algorithmic information of the measurement record, without changing the unconditional evolution of the measured system. We define an optimal measurement scheme as one which has the lowest average algorithmic information allowed. We also show how it is possible to extract information about system operator averages from the measurement records and their probabilities. The optimal measurement scheme, in the limit of weak coupling, determines the statistics of the variance of the measured variable directly. We discuss the relevance of such measurements for recent experiments in quantum optics.

Consistency of FDG-PET Accuracy and Cost-Effectiveness in Initial Staging of Patients With Hodgkin Lymphoma Across Jurisdictions

Introduction: Two hundred ten patients with newly diagnosed Hodgkin`s lymphoma (HL) were consecutively enrolled in this prospective trial to evaluate the cost-effectiveness of fluorine-18 ((18)F)-fluoro-2-deoxy-D-glucose-positron emission tomography (FDG-PET) scan in initial staging of patients with HL. Methods: All 210 patients were staged with conventional clinical staging (CCS) methods, including computed tomography (CT), bone marrow biopsy (BMB), and laboratory tests. Patients were also submitted to metabolic staging (MS) with whole-body FDG-PET scan before the beginning of treatment. A standard of reference for staging was determined with all staging procedures, histologic examination, and follow-up examinations. The accuracy of the CCS was compared with the MS. Local unit costs of procedures and tests were evaluated. Incremental cost-effectiveness ratio (ICER) was calculated for both strategies. Results: In the 210 patients with HL, the sensitivity for initial staging of FDG-PET was higher than that of CT and BMB in initial staging (97.9% vs. 87.3%; P < .001 and 94.2% vs. 71.4%, P < 0.003, respectively). The incorporation of FDG-PET in the staging procedure upstaged disease in 50 (24%) patients and downstaged disease in 17 (8%) patients. Changes in treatment would be seen in 32 (15%) patients. Cumulative cost for staging procedures was $3751/patient for CCS compared to $5081 for CCS + PET and $4588 for PET/CT. The ICER of PET/CT strategy was $16,215 per patient with modified treatment. PET/CT costs at the beginning and end of treatment would increase total costs of HL staging and first-line treatment by only 2%. Conclusion: FDG-PET is more accurate than CT and BMB in HL staging. Given observed probabilities, FDG-PET is highly cost-effective in the public health care program in Brazil.

Cost Effectiveness of Positron Emission Tomography in Patients With Hodgkin`s Lymphoma in Unconfirmed Complete Remission or Partial Remission After First-Line Therapy

Purpose To assess the cost effectiveness of fluorine-18-fluorodeoxyglucose positron emission tomography (FDG-PET) in patients with Hodgkin`s lymphoma (HL) with unconfirmed complete remission (CRu) or partial remission (PR) after first-line treatment. Patients and Methods One hundred thirty patients with HL were prospectively studied. After treatment, all patients with CRu/PR were evaluated with FDG-PET. In addition, PET-negative patients were evaluated with standard follow-up, and PET-positive patients were evaluated with biopsies of the positive lesions. Local unit costs of procedures and tests were evaluated. Cost effectiveness was determined by evaluating projected annual economic impact of strategies without and with FDG-PET on HL management. Results After treatment, CRu/PR was observed in 50 (40.0%) of the 127 patients; the sensitivity, specificity, and positive and negative predictive values of FDG-PET were 100%, 92.0%, 92.3%, and 100%, respectively (accuracy of 95.9%). Local restaging costs without PET were $350,050 compared with $283,262 with PET, a 19% decrease. The incremental cost-effectiveness ratio is -$3,268 to detect one true case. PET costs represented 1% of total costs of HL treatment. Simulated costs in the 974 patients registered in the 2008 Brazilian public health care database showed that the strategy including restaging PET would have a total program cost of $56,498,314, which is $516,942 less than without restaging PET, resulting in a 1% cost saving. Conclusion FDG-PET demonstrated 95.9% accuracy in restaging for patients with HL with CRu/PR after first-line therapy. Given the observed probabilities, FDG-PET is highly cost effective and would reduce costs for the public health care program in Brazil.