Useful applications of earth-oriented satellites - Systems for remote-sensing information and distribution, panel 8

Problems and potential use of data gathered by remote sensing from satellites or aircraf

DNA structural deformations in the interaction of the controller protein C.AhdI with its operator sequence

Controller proteins such as C.AhdI regulate the expression of bacterial restriction–modification genes, and ensure that methylation of the host DNA precedes restriction by delaying transcription of the endonuclease. The operator DNA sequence to which C.AhdI binds consists of two adjacent binding sites, OL and OR. Binding of C.AhdI to OL and to OL + OR has been investigated by circular permutation DNA-bending assays and by circular dichroism (CD) spectroscopy. CD indicates considerable distortion to the DNA when bound by C.AhdI. Binding to one or two sites to form dimeric and tetrameric complexes increases the CD signal at 278 nm by 40 and 80% respectively, showing identical local distortion at both sites. In contrast, DNA-bending assays gave similar bend angles for both dimeric and tetrameric complexes (47 and 38°, respectively). The relative orientation of C.AhdI dimers in the tetrameric complex and the structural role of the conserved Py-A-T sequences found at the centre of C-protein-binding sites are discussed

DNA structural deformations in the interaction of the controller protein C.AhdI with its operator sequence

Controller proteins such as C.AhdI regulate the expression of bacterial restriction–modification genes, and ensure that methylation of the host DNA precedes restriction by delaying transcription of the endonuclease. The operator DNA sequence to which C.AhdI binds consists of two adjacent binding sites, OL and OR. Binding of C.AhdI to OL and to OL + OR has been investigated by circular permutation DNA-bending assays and by circular dichroism (CD) spectroscopy. CD indicates considerable distortion to the DNA when bound by C.AhdI. Binding to one or two sites to form dimeric and tetrameric complexes increases the CD signal at 278 nm by 40 and 80% respectively, showing identical local distortion at both sites. In contrast, DNA-bending assays gave similar bend angles for both dimeric and tetrameric complexes (47 and 38°, respectively). The relative orientation of C.AhdI dimers in the tetrameric complex and the structural role of the conserved Py-A-T sequences found at the centre of C-protein-binding sites are discussed

Discovering Valuable Items from Massive Data

Suppose there is a large collection of items, each with an associated cost and an inherent utility that is revealed only once we commit to selecting it. Given a budget on the cumulative cost of the selected items, how can we pick a subset of maximal value? This task generalizes several important problems such as multi-arm bandits, active search and the knapsack problem. We present an algorithm, GP-Select, which utilizes prior knowledge about similarity be- tween items, expressed as a kernel function. GP-Select uses Gaussian process prediction to balance exploration (estimating the unknown value of items) and exploitation (selecting items of high value). We extend GP-Select to be able to discover sets that simultaneously have high utility and are diverse. Our preference for diversity can be specified as an arbitrary monotone submodular function that quantifies the diminishing returns obtained when selecting similar items. Furthermore, we exploit the structure of the model updates to achieve an order of magnitude (up to 40X) speedup in our experiments without resorting to approximations. We provide strong guarantees on the performance of GP-Select and apply it to three real-world case studies of industrial relevance: (1) Refreshing a repository of prices in a Global Distribution System for the travel industry, (2) Identifying diverse, binding-affine peptides in a vaccine de- sign task and (3) Maximizing clicks in a web-scale recommender system by recommending items to users

Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling

Greedy heuristics may be attuned by looking ahead for each possible choice, in an approach called the rollout or Pilot method. These methods may be seen as meta-heuristics that can enhance (any) heuristic solution, by repetitively modifying a master solution: similarly to what is done in game tree search, better choices are identified using lookahead, based on solutions obtained by repeatedly using a greedy heuristic. This paper first illustrates how the Pilot method improves upon some simple well known dispatch heuristics for the job-shop scheduling problem. The Pilot method is then shown to be a special case of the more recent Monte Carlo Tree Search (MCTS) methods: Unlike the Pilot method, MCTS methods use random completion of partial solutions to identify promising branches of the tree. The Pilot method and a simple version of MCTS, using the $\varepsilon$-greedy exploration paradigms, are then compared within the same framework, consisting of 300 scheduling problems of varying sizes with fixed-budget of rollouts. Results demonstrate that MCTS reaches better or same results as the Pilot methods in this context.Comment: Learning and Intelligent OptimizatioN (LION'6) 7219 (2012

Measuring fast electron spectra and laser absorption in relativistic laser-solid interactions using differential bremsstrahlung photon detectors

A photon detector suitable for the measurement of bremsstrahlung spectra generated in relativistically-intense laser-solid interactions is described. The Monte Carlo techniques used to back-out the fast electron spectrum and laser energy absorbed into fast electrons are detailed. A relativistically-intense laser-solid experiment using frequency doubled laser light is used to demonstrate the effective operation of the detector. The experimental data was interpreted using the 3-spatial-dimension Monte Carlo code MCNPX (Pelowitz 2008), and the fast electron temperature found to be 125 keV