Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence

We examine the representation of judgements of stochastic independence in probabilistic logics. We focus on a relational logic where (i) judgements of stochastic independence are encoded by directed acyclic graphs, and (ii) probabilistic assessments are flexible in the sense that they are not required to specify a single probability measure. We discuss issues of knowledge representation and inference that arise from our particular combination of graphs, stochastic independence, logical formulas and probabilistic assessments.

Inference in Credal Networks Through Integer Programming

A credal network associates a directed acyclic graph with a collection of sets of probability measures; it offers a compact representation for sets of multivariate distributions. In this paper we present a new algorithm for inference in credal networks based on an integer programming reformulation. We are concerned with computation of lower/upper probabilities for a variable in a given credal network. Experiments reported in this paper indicate that this new algorithm has better performance than existing ones for some important classes of networks.

Inference in credal networks using multilinear programming

A credal network is a graphical tool for representation and manipulation of uncertainty, where probability values may be imprecise or indeterminate. A credal network associates a directed acyclic graph with a collection of sets of probability measures; in this context, inference is the computation of tight lower and upper bounds for conditional probabilities. In this paper we present new algorithms for inference in credal networks based on multilinear programming techniques. Experiments indicate that these new algorithms have better performance than existing ones, in the sense that they can produce more accurate results in larger networks.

STEREOSELECTIVE ROUTE TO HIGHLY FUNCTIONALIZED AMINO-ALCOHOLS

Acyclic amino alcohols can be obtained in high stereoisomeric purity by Stevens [2,3] rearrangement of tetrahydropyridine salts followed by reduction of the ketones and ring opening of the disubstituted pyrrolidine.

Determining adsorbate configuration on alumina surfaces with 13C nuclear magnetic resonance relaxation time analysis

Relative strengths of surface interaction for individual carbon atoms in acyclic and cyclic hydrocarbons adsorbed on alumina surfaces are determined using chemically resolved 13C nuclear magnetic resonance (NMR) T1 relaxation times. The ratio of relaxation times for the adsorbed atoms T1,ads to the bulk liquid relaxation time T1,bulk provides an indication of the mobility of the atom. Hence a low T1,ads/T1,bulk ratio indicates a stronger surface interaction. The carbon atoms associated with unsaturated bonds in the molecules are seen to exhibit a larger reduction in T1 on adsorption relative to the aliphatic carbons, consistent with adsorption occurring through the carbon-carbon multiple bonds. The relaxation data are interpreted in terms of proximity of individual carbon atoms to the alumina surface and adsorption conformations are inferred. Furthermore, variations of interaction strength and molecular configuration have been explored as a function of adsorbate coverage, temperature, surface pre-treatment, and in the presence of co-adsorbates. This relaxation time analysis is appropriate for studying the behaviour of hydrocarbons adsorbed on a wide range of catalyst support and supported-metal catalyst surfaces, and offers the potential to explore such systems under realistic operating conditions when multiple chemical components are present at the surface.

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.

Enzyme-catalysed oxidation of 1,2-disulfides to yield chiral thiosulfinate, sulfoxide and cis-dihydrodiol metabolites

Enantioenriched and enantiopure thiosulfinates were obtained by asymmetric sulfoxidation of cyclic 1,2-disulfides, using chemical and enzymatic (peroxidase, monooxygenase, dioxygenase) oxidation methods and chiral stationary phase HPLC resolution of racemic thiosulfinates. Enantiomeric excess values, absolute configurations and configurational stabilities of chiral thiosulfinates were determined. Methyl phenyl sulfoxide, benzo[c]thiophene cis-4,5-dihydrodiol and 1,3-dihydrobenzo[c]thiophene derivatives were among unexpected types of metabolites isolated, when acyclic and cyclic 1,2-disulfide were used as substrates for Pseudomonas putida strains. Possible biosynthetic pathways are presented for the production of metabolites from 1,4-dihydrobenzo-2,3-dithiane, including a novel cis-dihydrodiol metabolite that was also derived from benzo[c]thiophene and 1,3-dihydrobenzo[c]thiophene.