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.

A population study of binocular function

As part of a genome-wide association study (GWAS) of perceptual traits in healthy adults, we measured stereo acuity, the duration of alternative percepts in binocular rivalry and the extent of dichoptic masking in 1060 participants. We present the distributions of the measures, the correlations between measures, and their relationships to other psychophysical traits. We report sex differences, and correlations with age, interpupillary distance, eye dominance, phorias, visual acuity and personality. The GWAS, using data from 988 participants, yielded one genetic association that passed a permutation test for significance: The variant rs1022907 in the gene VTI1A was associated with self-reported ability to see autostereograms. We list a number of other suggestive genetic associations (p<10^-5).

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.

The BRUTUS Automatic Cryptanalytic Framework: Testing CAESAR Authenticated Encryption Candidates for Weaknesses

This report summarizes our results from security analysis covering all 57 competitions for authenticated encryption: security, applicability, and robustness (CAESAR) first-round candidates and over 210 implementations. We have manually identified security issues with three candidates, two of which are more serious, and these ciphers have been withdrawn from the competition. We have developed a testing framework, BRUTUS, to facilitate automatic detection of simple security lapses and susceptible statistical structures across all ciphers. From this testing, we have security usage notes on four submissions and statistical notes on a further four. We highlight that some of the CAESAR algorithms pose an elevated risk if employed in real-life protocols due to a class of adaptive-chosen-plaintext attacks. Although authenticated encryption with associated data are often defined (and are best used) as discrete primitives that authenticate and transmit only complete messages, in practice, these algorithms are easily implemented in a fashion that outputs observable ciphertext data when the algorithm has not received all of the (attacker-controlled) plaintext. For an implementor, this strategy appears to offer seemingly harmless and compliant storage and latency advantages. If the algorithm uses the same state for secret keying information, encryption, and integrity protection, and the internal mixing permutation is not cryptographically strong, an attacker can exploit the ciphertext–plaintext feedback loop to reveal secret state information or even keying material. We conclude that the main advantages of exhaustive, automated cryptanalysis are that it acts as a very necessary sanity check for implementations and gives the cryptanalyst insights that can be used to focus more specific attack methods on given candidates.

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.

ANRIL Variants and Aggressive Periodontitis in European and African Populations

Introduction: The chromosome 9p21 locus has been identified as a marker of coronary artery disease. In this locus studies have focused on variations in the ANRIL gene that has also been identified as a strong candidate for association with aggressive periodontitis (AgP).
Objective: To investigate possible associations between gene variants of ANRIL and AgP in European and African populations.
Methods: European AgP cases (n= 213) and age-matched periodontally healthy controls (n= 81) were recruited from centres in the United Kingdom (Belfast, Glasgow, Newcastle and London). African AgP cases (n= 95) and controls (n= 105) were recruited in Khartoum, Sudan. Five single nucleotide polymorphisms (SNPs) in ANRIL were genotyped using Sequenom and analysed using Haploview with permutation testing to correct for multiple candidates. Odds ratios (OR) and 95% confidence intervals (95%CI) were calculated.
Results: In the European subjects there was a significant association between rs518394 (p=0.0013; OR = 1.81, 95%CI 1.26-2.61) and rs1333049 (p=0.0028; OR = 1.75, 95%CI 1.21-2.52) and AgP. These associations remained significant after permutation testing. In addition there was an association between rs 1360590 (p=0.035) and AgP in females. In the African subjects there was a significant association between only one SNP rs1537415 and AgP (p=0.036; OR = 1.59, 95%CI 1.04-2.43), however, this was not significant following permutation testing. There were no significant associations with rs3217992 in either population.
Conclusions: SNP variants in the ANRIL locus were shown to be significantly associated with AgP in a European population and for the first time in an African population confirming this as the best replicated locus for aggressive periodontitis.

Building Support Vector Machines in the Context of Regularised Least Squares

This paper formulates a linear kernel support vector machine (SVM) as a regularized least-squares (RLS) problem. By defining a set of indicator variables of the errors, the solution to the RLS problem is represented as an equation that relates the error vector to the indicator variables. Through partitioning the training set, the SVM weights and bias are expressed analytically using the support vectors. It is also shown how this approach naturally extends to Sums with nonlinear kernels whilst avoiding the need to make use of Lagrange multipliers and duality theory. A fast iterative solution algorithm based on Cholesky decomposition with permutation of the support vectors is suggested as a solution method. The properties of our SVM formulation are analyzed and compared with standard SVMs using a simple example that can be illustrated graphically. The correctness and behavior of our solution (merely derived in the primal context of RLS) is demonstrated using a set of public benchmarking problems for both linear and nonlinear SVMs.