WASP-34b: a near-grazing transiting sub-Jupiter-mass exoplanet in a hierarchical triple system

We report the discovery of WASP-34b, a sub-Jupiter-mass exoplanet transiting its 10.4-magnitude solar-type host star (1SWASP J110135.89-235138.4; TYC 6636-540-1) every 4.3177 days in a slightly eccentric orbit (e = 0.038±0.012). We find a planetary mass of 0.59±0.01 MJup and radius of 1.22-0.08+0.11 RJup. There is a linear trend in the radial velocities of 55±4 m s-1 y-1 indicating the presence of a long-period third body in the system with a mass ?0.45 MJup at a distance of ?1.2 AU from the host star. This third-body is either a low-mass star, a white dwarf, or another planet. The transit depth ((RP/Rstar)2 = 0.0126) and high impact parameter (b = 0.90) suggest that this could be the first known transiting exoplanet expected to undergo grazing transits, but with a confidence of only 80%. Radial velocity and photometric data are only available in electronic form at the CDS via anonymous ftp to cdsarc.u-strasbg.fr (130.79.128.5) or via http://cdsarc.u-strasbg.fr/viz-bin/qcat?J/A+A/526/A130

Hierarchical Bayesian models in ecology: Reconstructing species interaction networks from non-homogeneous species abundance data

The relationships among organisms and their surroundings can be of immense complexity. To describe and understand an ecosystem as a tangled bank, multiple ways of interaction and their effects have to be considered, such as predation, competition, mutualism and facilitation. Understanding the resulting interaction networks is a challenge in changing environments, e.g. to predict knock-on effects of invasive species and to understand how climate change impacts biodiversity. The elucidation of complex ecological systems with their interactions will benefit enormously from the development of new machine learning tools that aim to infer the structure of interaction networks from field data. In the present study, we propose a novel Bayesian regression and multiple changepoint model (BRAM) for reconstructing species interaction networks from observed species distributions. The model has been devised to allow robust inference in the presence of spatial autocorrelation and distributional heterogeneity. We have evaluated the model on simulated data that combines a trophic niche model with a stochastic population model on a 2-dimensional lattice, and we have compared the performance of our model with L1-penalized sparse regression (LASSO) and non-linear Bayesian networks with the BDe scoring scheme. In addition, we have applied our method to plant ground coverage data from the western shore of the Outer Hebrides with the objective to infer the ecological interactions. (C) 2012 Elsevier B.V. All rights reserved.

Hierarchical zeolites prepared by organosilane templating: A study of the synthesis mechanism and catalytic activity

The crystallization of hierarchical ZSM-5 in the presence of the organosilane octadecyl-dimethyl-(3-trimethoxysilyl-propyl)-ammonium chloride as the mesoporogen was investigated as a function of time and temperature. The synthesis by this method proceeds in two steps. The rapid formation of a predominantly amorphous disordered mesoporous aluminosilicate precursor phase is followed by the formation of globular highly mesoporous zeolite particles involving dissolution of the precursor phase. It is difficult to completely convert the initial phase into the final hierarchical zeolite. This limits the amount of aluminium built into the MFI network and the resulting Bronsted acidity. In the presence of iron, more crystalline hierarchical zeolite is obtained. These Fe-containing zeolites are excellent catalysts for the selective oxidation of benzene to phenol. Their hierarchical pore structure leads to higher reaction rates due to increased mass transfer and increased catalyst longevity despite more substantial coke formation. (C) 2011 Elsevier B.V. All rights reserved.

Hierarchical VHDL libraries for DSP ASIC design

Methods are presented for the rapid design of DSP ASICs based on the use of hierarchical VHDL libraries. These are portable across many silicon foundries and allow complex DSP silicon systems to be developed in a fraction of the time normally required. Resulting designs are highly competitive with ones created using conventional methods. The approach is illustrated by its application to ADPCM codec and DCT cores.

Rapid design of DSP ASIC cores using hierarchical VHDL libraries

Methods are presented for the rapid design of DSP ASICs based on the use of a series of hierarchical VHDL libraries which are portable across many silicon foundries. These allows complex DSP silicon systems to be developed in a small fraction of the time normally required. Resulting designs are highly competitive with those developed using more conventional methods. The approach is illustrated using several examples. These include ADPCM codecs, as well as DCT and FFT cores.

Ordering the cytochrome c-initiated caspase cascade:hierarchical activation of caspases-2, -3, -6, -7, -8, and -10 in a caspase-9-dependent manner

Exit of cytochrome c from mitochondria into the cytosol has been implicated as an important step in apoptosis. In the cytosol, cytochrome c binds to the CED-4 homologue, Apaf-1, thereby triggering Apaf-1-mediated activation of caspase-9. Caspase-9 is thought to propagate the death signal by triggering other caspase activation events, the details of which remain obscure. Here, we report that six additional caspases (caspases-2, -3, -6, -7, -8, and -10) are processed in cell-free extracts in response to cytochrome c, and that three others (caspases-1, -4, and -5) failed to be activated under the same conditions. In vitro association assays confirmed that caspase-9 selectively bound to Apaf-1, whereas caspases-1, -2, -3, -6, -7, -8, and -10 did not. Depletion of caspase-9 from cell extracts abrogated cytochrome c-inducible activation of caspases-2, -3, -6, -7, -8, and -10, suggesting that caspase-9 is required for all of these downstream caspase activation events. Immunodepletion of caspases-3, -6, and -7 from cell extracts enabled us to order the sequence of caspase activation events downstream of caspase-9 and reveal the presence of a branched caspase cascade. Caspase-3 is required for the activation of four other caspases (-2, -6, -8, and -10) in this pathway and also participates in a feedback amplification loop involving caspase-9.

Dense Multiperson Tracking with Robust Hierarchical Linear Assignment

We introduce a novel dual-stage algorithm for online multi-target tracking in realistic conditions. In the first stage, the problem of data association between tracklets and detections, given partial occlusion, is addressed using a novel occlusion robust appearance similarity method. This is used to robustly link tracklets with detections without requiring explicit knowledge of the occluded regions. In the second stage, tracklets are linked using a novel method of constraining the linking process that removes the need for ad-hoc tracklet linking rules. In this method, links between tracklets are permitted based on their agreement with optical flow evidence. Tests of this new tracking system have been performed using several public datasets.

Hierarchical demand response using dantzig-wolfe decomposition

Demand Side Management (DSM) programmes are designed to shift electrical loads from peak times. Demand Response (DR) algorithms automate this process for controllable loads. DR can be implemented explicitly in terms of Peak to Average Ratio Reduction (PARR), in which case the maximum peak load is minimised over a prediction horizon by manipulating the amount of energy given to controllable loads at different times. A hierarchical predictive PARR algorithm is presented here based on Dantzig-Wolfe decomposition. © 2013 IEEE.

Hierarchical Demand Response for Peak Reduction using Dantzig‐Wolfe Decomposition

Demand Response (DR) algorithms manipulate the energy consumption schedules of controllable loads so as to satisfy grid objectives. Implementation of DR algorithms using a centralised agent can be problematic for scalability reasons, and there are issues related to the privacy of data and robustness to communication failures. Thus it is desirable to use a scalable decentralised algorithm for the implementation of DR. In this paper, a hierarchical DR scheme is proposed for Peak Minimisation (PM) based on Dantzig-Wolfe Decomposition (DWD). In addition, a Time Weighted Maximisation option is included in the cost function which improves the Quality of Service for devices seeking to receive their desired energy sooner rather than later. The paper also demonstrates how the DWD algorithm can be implemented more efficiently through the calculation of the upper and lower cost bounds after each DWD iteration.