The most persistent soft-clique in a set of sampled graphs

When searching for characteristic subpatterns in potentially noisy graph data, it appears self-evident that having multiple observations would be better than having just one. However, it turns out that the inconsistencies introduced when different graph instances have different edge sets pose a serious challenge. In this work we address this challenge for the problem of finding maximum weighted cliques. We introduce the concept of most persistent soft-clique. This is subset of vertices, that 1) is almost fully or at least densely connected, 2) occurs in all or almost all graph instances, and 3) has the maximum weight. We present a measure of clique-ness, that essentially counts the number of edge missing to make a subset of vertices into a clique. With this measure, we show that the problem of finding the most persistent soft-clique problem can be cast either as: a) a max-min two person game optimization problem, or b) a min-min soft margin optimization problem. Both formulations lead to the same solution when using a partial Lagrangian method to solve the optimization problems. By experiments on synthetic data and on real social network data we show that the proposed method is able to reliably find soft cliques in graph data, even if that is distorted by random noise or unreliable observations. Copyright 2012 by the author(s)/owner(s).

On the transition from finite-volume negatively buoyant releases to continuous fountains

An experimental investigation to identify the source conditions that distinguish finite-volume negatively buoyant fluid projectile behaviour from fountain behaviour in quiescent environments of uniform density is described. Finite-volume releases are governed by their source Froude number Fr D and the aspect ratio L/D of the release, where L denotes the length of the column of fluid dispensed vertically from the nozzle of diameter D. We establish the influence of L/D on the peak rise heights of a release formed by dispensing saline solution into fresh water for 0

Random function priors for exchangeable arrays with applications to graphs and relational data

A fundamental problem in the analysis of structured relational data like graphs, networks, databases, and matrices is to extract a summary of the common structure underlying relations between individual entities. Relational data are typically encoded in the form of arrays; invariance to the ordering of rows and columns corresponds to exchangeable arrays. Results in probability theory due to Aldous, Hoover and Kallenberg show that exchangeable arrays can be represented in terms of a random measurable function which constitutes the natural model parameter in a Bayesian model. We obtain a flexible yet simple Bayesian nonparametric model by placing a Gaussian process prior on the parameter function. Efficient inference utilises elliptical slice sampling combined with a random sparse approximation to the Gaussian process. We demonstrate applications of the model to network data and clarify its relation to models in the literature, several of which emerge as special cases.

Aromaticity on the fly: cyclic transition state stabilization at finite temperature.

We study the transition state of pericyclic reactions at elevated temperature with unbiased ab initio molecular dynamics. We find that the transition state of the intramolecular rearrangements for barbaralane and bullvalene remains aromatic at high temperature despite the significant thermal atomic motions. Structural, magnetic, and electronic properties of the dynamical transition state show the concertedness and aromatic character. Free-energy calculations also support the validity of the transition state theory for the present rearrangement reactions. The calculations demonstrate that cyclic delocalization represents a strong force to synchronize the thermal atomic motions even at high temperatures.

Accurate screened exchange band structures for the transition metal monoxides MnO, FeO, CoO and NiO.

We report calculations of the band structures and density of states of the four transition metal monoxides MnO, FeO, CoO and NiO using the hybrid density functional sX-LDA ('screened exchange local density approximation'). Late transition metal oxides are prototypical examples of strongly correlated materials, which pose challenges for electronic structure methods. We compare our results with available experimental data and show that our calculations generally yield accurate predictions for the fundamental band gaps and valence bands, in favourable agreement with previously reported theoretical studies. For MnO, the band gaps are still underestimated, suggesting additional many-body effects that are not captured by our screened hybrid functional approach.

Model reductions for inference: generality of pairwise, binary, and planar factor graphs.

We offer a solution to the problem of efficiently translating algorithms between different types of discrete statistical model. We investigate the expressive power of three classes of model-those with binary variables, with pairwise factors, and with planar topology-as well as their four intersections. We formalize a notion of "simple reduction" for the problem of inferring marginal probabilities and consider whether it is possible to "simply reduce" marginal inference from general discrete factor graphs to factor graphs in each of these seven subclasses. We characterize the reducibility of each class, showing in particular that the class of binary pairwise factor graphs is able to simply reduce only positive models. We also exhibit a continuous "spectral reduction" based on polynomial interpolation, which overcomes this limitation. Experiments assess the performance of standard approximate inference algorithms on the outputs of our reductions.

A fast detailed-chemistry modelling approach for simulating the SI-HCCI transition

An established Stochastic Reactor Model (SRM) is used to simulate the transition from Spark Ignition (SI) to Homogeneous Charge Compression Ignition (HCCI) combustion mode in a four cylinder in-line four-stroke naturally aspirated direct injection SI engine with cam profile switching. The SRM is coupled with GT-Power, a one-dimensional engine simulation tool used for modelling engine breathing during the open valve portion of the engine cycle, enabling multi-cycle simulations. The mode change is achieved by switching the cam profiles and phasing, resulting in a Negative Valve Overlap (NVO), opening the throttle, advancing the spark timing and reducing the fuel mass as well as using a pilot injection. A proven technique for tabulating the model is used to create look-up tables in both SI and HCCI modes. In HCCI mode several tables are required, including tables for the first NVO, transient valve timing NVO, transient valve timing HCCI and steady valve timing HCCI and NVO. This results in the ability to simulate the transition with detailed chemistry in very short computation times. The tables are then used to optimise the transition with the goal of reducing NO x emissions and fluctuations in IMEP. Copyright © 2010 SAE International.