Discovering subgroups of patients from DNA copy number data using NMF on compacted matrices

In the study of complex genetic diseases, the identification of subgroups of patients sharing similar genetic characteristics represents a challenging task, for example, to improve treatment decision. One type of genetic lesion, frequently investigated in such disorders, is the change of the DNA copy number (CN) at specific genomic traits. Non-negative Matrix Factorization (NMF) is a standard technique to reduce the dimensionality of a data set and to cluster data samples, while keeping its most relevant information in meaningful components. Thus, it can be used to discover subgroups of patients from CN profiles. It is however computationally impractical for very high dimensional data, such as CN microarray data. Deciding the most suitable number of subgroups is also a challenging problem. The aim of this work is to derive a procedure to compact high dimensional data, in order to improve NMF applicability without compromising the quality of the clustering. This is particularly important for analyzing high-resolution microarray data. Many commonly used quality measures, as well as our own measures, are employed to decide the number of subgroups and to assess the quality of the results. Our measures are based on the idea of identifying robust subgroups, inspired by biologically/clinically relevance instead of simply aiming at well-separated clusters. We evaluate our procedure using four real independent data sets. In these data sets, our method was able to find accurate subgroups with individual molecular and clinical features and outperformed the standard NMF in terms of accuracy in the factorization fitness function. Hence, it can be useful for the discovery of subgroups of patients with similar CN profiles in the study of heterogeneous diseases.

New Complexity Results for MAP in Bayesian Networks

This paper presents new results for the (partial) maximum a posteriori (MAP) problem in Bayesian networks, which is the problem of querying the most probable state configuration of some of the network variables given evidence. It is demonstrated that the problem remains hard even in networks with very simple topology, such as binary polytrees and simple trees (including the Naive Bayes structure), which extends previous complexity results. Furthermore, a Fully Polynomial Time Approximation Scheme for MAP in networks with bounded treewidth and bounded number of states per variable is developed. Approximation schemes were thought to be impossible, but here it is shown otherwise under the assumptions just mentioned, which are adopted in most applications.

New Results for the MAP Problem in Bayesian Networks

This paper presents new results for the (partial) maximum a posteriori (MAP) problem in Bayesian networks, which is the problem of querying the most probable state configuration of some of the network variables given evidence. First, it is demonstrated that the problem remains hard even in networks with very simple topology, such as binary polytrees and simple trees (including the Naive Bayes structure). Such proofs extend previous complexity results for the problem. Inapproximability results are also derived in the case of trees if the number of states per variable is not bounded. Although the problem is shown to be hard and inapproximable even in very simple scenarios, a new exact algorithm is described that is empirically fast in networks of bounded treewidth and bounded number of states per variable. The same algorithm is used as basis of a Fully Polynomial Time Approximation Scheme for MAP under such assumptions. Approximation schemes were generally thought to be impossible for this problem, but we show otherwise for classes of networks that are important in practice. The algorithms are extensively tested using some well-known networks as well as random generated cases to show their effectiveness.

On the diversity of superluminous supernovae: ejected mass as the dominant factor

We assemble a sample of 24 hydrogen-poor superluminous supernovae(SLSNe). Parameterizing the light-curve shape through rise and declinetime-scales shows that the two are highly correlated. Magnetar-poweredmodels can reproduce the correlation, with the diversity in rise anddecline rates driven by the diffusion time-scale. Circumstellarinteraction models can exhibit a similar rise-decline relation, but onlyfor a narrow range of densities, which may be problematic for thesemodels. We find that SLSNe are approximately 3.5 mag brighter and havelight curves three times broader than SNe Ibc, but that the intrinsicshapes are similar. There are a number of SLSNe with particularly broadlight curves, possibly indicating two progenitor channels, butstatistical tests do not cleanly separate two populations. The generalspectral evolution is also presented. Velocities measured from Fe II aresimilar for SLSNe and SNe Ibc, suggesting that diffusion timedifferences are dominated by mass or opacity. Flat velocity evolution inmost SLSNe suggests a dense shell of ejecta. If opacities in SLSNe aresimilar to other SNe Ibc, the average ejected mass is higher by a factor2-3. Assuming κ = 0.1 cm2 g-1, we estimate amean (median) SLSN ejecta mass of 10 M⊙ (6M⊙), with a range of 3-30 M⊙. Doubling theassumed opacity brings the masses closer to normal SNe Ibc, but with ahigh-mass tail. The most probable mechanism for generating SLSNe seemsto be the core collapse of a very massive hydrogen-poor star, forming amillisecond magnetar.

Fragmentation of metastable SF6−* ions with microsecond lifetimes in competition with autodetachment

Fragmentation of metastable SF6-* ions formed in low energy electron attachment to SF₆has been investigated. The dissociation reaction SF6-*?SF5-+F has been observed ~ 1.5–3.4 µs and ~ 17–32 µs after electron attachment in a time-of-flight and a double focusing two sector field mass spectrometer, respectively. Metastable dissociation is observed with maximum intensity at ~ 0.3 eV between the SF6-* peak at zero and theSF5- peak at ~ 0.4 eV. The kinetic energy released in dissociation is low, with a most probable value of 18 meV. The lifetime of SF6-* decreases as the electron energy increases, but it is not possible to fit this decrease with statistical Rice–Ramsperger–Kassel/quasiequilibrium theory. Metastable dissociation of SF6-* appears to compete with autodetachment of the electron at all electron energies.

Deuterium in the Galactic Centre as a result of recent infall of low-metallicity gas

The Galactic Centre is the most active and heavily processed region of the Milky Way, so it can be used as a stringent test for the abundance of deuterium (a sensitive indicator of conditions in the first 1,000 seconds in the life of the Universe). As deuterium is destroyed in stellar interiors, chemical evolution models 1 predict that its Galactic Centre abundance relative to hydrogen is D/H = 5 x 10(-12), unless there is a continuous source of deuterium from relatively primordial (low-metallicity) gas. Here we report the detection of deuterium (in the molecule DCN) in a molecular cloud only 10 parsecs from the Galactic Centre. Our data, when combined with a model of molecular abundances, indicate that D/H = (1.7 +/- 0.3) x 10(-6), five orders of magnitude larger than the predictions of evolutionary models with no continuous source of deuterium. The most probable explanation is recent infall of relatively unprocessed metal-poor gas into the Galactic Centre (at the rate inferred by Wakker(2)). Our measured D/H is nine times less than the local interstellar value, and the lowest D/H observed in the Galaxy. We conclude that the observed Galactic Centre deuterium is cosmological, with an abundance reduced by stellar processing and mixing, and that there is no significant Galactic source of deuterium.

WASP-24 b: A New Transiting Close-in Hot Jupiter Orbiting a Late F-star

We report the discovery of a new transiting close-in giant planet, WASP-24 b, in a 2.341 day orbit, 0.037 AU from its F8-9 type host star. By matching the star's spectrum with theoretical models, we infer an effective temperature T eff = 6075 ± 100 K and a surface gravity of log g = 4.15 ± 0.10. A comparison of these parameters with theoretical isochrones and evolutionary mass tracks places only weak constraints on the age of the host star, which we estimate to be 3.8+1.3 –1.2 Gyr. The planetary nature of the companion was confirmed by radial velocity measurements and additional photometric observations. These data were fit simultaneously in order to determine the most probable parameter set for the system, from which we infer a planetary mass of 1.071+0.036 –0.038 M Jup and radius 1.3+0.039 –0.037 R Jup.

Failure of fiber bundles with local load sharing

We develop a recursion-relation approach for calculating the failure probabilities of a fiber bundle with local load sharing. This recursion relation is exact, so it provides a way to test the validity of the various approximate methods. Applying the exact calculation to uniform and Weibull threshold distributions, we find that the most probable failure load coincides with the average strength as the size of the system N --> infinity.

A short-timescale candidate microlensing event in the point-agape pixel lensing survey of M31

We report the discovery of a short-duration microlensing candidate in the northern field of the POINT-AGAPE pixel lensing survey toward M31. Almost certainly, the source star has been identified on Hubble Space Telescope archival images, allowing us to infer an Einstein crossing time of t(E) = 10.4 days, a maximum magnification of A(max) similar to 18, and a lens-source proper motion mu (rel) > 0.3 mu as day(-1). The event has a projected separation of 8' from the center of M31, beyond the bulk of the stellar lens population. There are three plausible identifications/locations for the lensing object: a massive compact halo object (MACHO) in either M31 or the Milky Way, or a star in the M31 disk. The most probable mass is 0.06 M-. for an M31 MACHO, 0.02 M-. for a Milky Way MACHO, and 0.2 M-. for an M31 stellar lens. While the stellar interpretation is possible, the MACHO interpretation is the most probable for halo fractions above 20%.

Micro-Satellite Structure Fracture Investigation techniques

Mounting accuracy of satellite payload and
ADCS (attitude determination and control subsystem) seats
is one of the requirements to achieve the satellite mission
with satisfactory performance. Deviation of the position of
the mounting seat for Multi-Band-Earth-Imager (MBEI) is
caused by cracks in the plate of the basis unit and bracket
for attachment of MBEI. These cracks were detected during
inspection of the satellite strength mock-up after vibration
testing for air transportation phase. Most probable reason of
the cracking is fatigue damage as strength mock-up
structure was subjected to prolonged vibration loading
during various loading cases. Total vibration duration
during testing is about 56 hours. In order to study the
cracking reasons, finite element modeling of the structural
parts of the basis unit including MBEI bracket and
instrument MBEI is subjected to harmonic response to
simulate vibration loading for the case of air transportation.
Numerical results are compared with the experimental ones,
and mechanical design of the basis-plate unit is modified

A spatio-temporal 2D-models framework for human pose recovery in monocular sequences

This paper addresses the pose recovery problem of a particular articulated object: the human body. In this model-based approach, the 2D-shape is associated to the corresponding stick figure allowing the joint segmentation and pose recovery of the subject observed in the scene. The main disadvantage of 2D-models is their restriction to the viewpoint. To cope with this limitation, local spatio-temporal 2D-models corresponding to many views of the same sequences are trained, concatenated and sorted in a global framework. Temporal and spatial constraints are then considered to build the probabilistic transition matrix (PTM) that gives a frame to frame estimation of the most probable local models to use during the fitting procedure, thus limiting the feature space. This approach takes advantage of 3D information avoiding the use of a complex 3D human model. The experiments carried out on both indoor and outdoor sequences have demonstrated the ability of this approach to adequately segment pedestrians and estimate their poses independently of the direction of motion during the sequence. (c) 2008 Elsevier Ltd. All rights reserved.

Methanol oxidation on PtRu electrodes. Influence of surface structure and Pt-Ru atom distribution

The activities of different types of PtRu catalysts for methanol oxidation are compared. Materials used were: UHV-cleaned PtRu alloys, UHV-evaporated Ru onto Pt(111) as well as adsorbed Ru on Pt(111) prepared with and without additional reduction by hydrogen. Differences in the catalytic activity are observed to depend on the preparation procedure of the catalysts. The dependence of the respective catalytic activities upon the surface composition is reported. UHV-STM data for Pt(111)/Ru show the formation of two- and three-dimensional structures depending on surface coverage. A molecular insight on the electrochemical reaction is given via in situ infrared spectroscopy. Analysis of the data indicates that the most probable rate-determining step is the reaction of adsorbed CO with Ru oxide.

Semi-Qualitative Probabilistic Networks in Computer Vision Problems

This paper explores the application of semi-qualitative probabilistic networks (SQPNs) that combine numeric and qualitative information to computer vision problems. Our version of SQPN allows qualitative influences and imprecise probability measures using intervals. We describe an Imprecise Dirichlet model for parameter learning and an iterative algorithm for evaluating posterior probabilities, maximum a posteriori and most probable explanations. Experiments on facial expression recognition and image segmentation problems are performed using real data.

Algorithms for Hidden Markov Models With Imprecisely Specified Parameters

Hidden Markov models (HMMs) are widely used models for sequential data. As with other probabilistic graphical models, they require the specification of precise probability values, which can be too restrictive for some domains, especially when data are scarce or costly to acquire. We present a generalized version of HMMs, whose quantification can be done by sets of, instead of single, probability distributions. Our models have the ability to suspend judgment when there is not enough statistical evidence, and can serve as a sensitivity analysis tool for standard non-stationary HMMs. Efficient inference algorithms are developed to address standard HMM usage such as the computation of likelihoods and most probable explanations. Experiments with real data show that the use of imprecise probabilities leads to more reliable inferences without compromising efficiency.

NP-hardness of MAP in Ternary Tree Bayesian Networks

This paper strengthens the NP-hardness result for the (partial) maximum a posteriori (MAP) problem in Bayesian networks with topology of trees (every variable has at most one parent) and variable cardinality at most three. MAP is the problem of querying the most probable state configuration of some (not necessarily all) of the network variables given evidence. It is demonstrated that the problem remains hard even in such simplistic networks.