Secure Implementation in Production Economies

This paper shows that, in production economies, the generalized serial social choice functions defined by Shenker (1992) are securely implementable (in the sense of Saijo et al., 2007) and that they include the well-known fixed path social choice functions.

A generalized functional response for predators that switch between multiple prey species

We develop a theory for the food intake of a predator that can switch between multiple prey species. The theory addresses empirical observations of prey switching and is based on the behavioural assumption that a predator tends to continue feeding on prey that are similar to the prey it has consumed last, in terms of, e.g., their morphology, defences, location, habitat choice, or behaviour. From a predator's dietary history and the assumed similarity relationship among prey species, we derive a general closed-form multi-species functional response for describing predators switching between multiple prey species. Our theory includes the Holling type II functional response as a special case and makes consistent predictions when populations of equivalent prey are aggregated or split. An analysis of the derived functional response enables us to highlight the following five main findings. (1) Prey switching leads to an approximate power-law relationship between ratios of prey abundance and prey intake, consistent with experimental data. (2) In agreement with empirical observations, the theory predicts an upper limit of 2 for the exponent of such power laws. (3) Our theory predicts deviations from power-law switching at very low and very high prey-abundance ratios. (4) The theory can predict the diet composition of a predator feeding on multiple prey species from diet observations for predators feeding only on pairs of prey species. (5) Predators foraging on more prey species will show less pronounced prey switching than predators foraging on fewer prey species, thus providing a natural explanation for the known difficulties of observing prey switching in the field. (C) 2013 Elsevier Ltd. All rights reserved.

Generalized Laplacian Eigenmaps for Modeling and Tracking Human Motions

This paper presents generalized Laplacian eigenmaps, a novel dimensionality reduction approach designed to address stylistic variations in time series. It generates compact and coherent continuous spaces whose geometry is data-driven. This paper also introduces graph-based particle filter, a novel methodology conceived for efficient tracking in low dimensional space derived from a spectral dimensionality reduction method. Its strengths are a propagation scheme, which facilitates the prediction in time and style, and a noise model coherent with the manifold, which prevents divergence, and increases robustness. Experiments show that a combination of both techniques achieves state-of-the-art performance for human pose tracking in underconstrained scenarios.

Physical and numerical constraints in source modeling for finite difference simulation of room acoustics

In finite difference time domain simulation of room acoustics, source functions are subject to various constraints. These depend on the way sources are injected into the grid and on the chosen parameters of the numerical scheme being used. This paper addresses the issue of selecting and designing sources for finite difference simulation, by first reviewing associated aims and constraints, and evaluating existing source models against these criteria. The process of exciting a model is generalized by introducing a system of three cascaded filters, respectively, characterizing the driving pulse, the source mechanics, and the injection of the resulting source function into the grid. It is shown that hard, soft, and transparent sources can be seen as special cases within this unified approach. Starting from the mechanics of a small pulsating sphere, a parametric source model is formulated by specifying suitable filters. This physically constrained source model is numerically consistent, does not scatter incoming waves, and is free from zero- and low-frequency artifacts. Simulation results are employed for comparison with existing source formulations in terms of meeting the spectral and temporal requirements on the outward propagating wave.

Generalized Selection Combining in Cognitive MIMO Relay Networks

We propose transmit antenna selection with receive generalized selection combining (TAS/GSC) in dual-hop cognitive decode-and-forward (DF) relay networks for reliability enhancement and interference relaxation. In this paradigm, a single antenna which maximizes the receive signal-to-noise ratio (SNR) is selected at the secondary transmitter and a subset of receive antennas with the highest SNRs are combined at the secondary receiver. To demonstrate the impact of multiple primary users on the cognitive relay network, we derive new closed-form expressions for the exact and asymptotic outage probability with TAS/GSC in the secondary network. Several important design insights are reached. We corroborate that the full diversity gain is achieved, which is entirely determined by the total number of antennas in the secondary network. The negative impact of the primary network on the secondary network is reflected in the SNR gain.

Generalized Langevin equation: An efficient approach to nonequilibrium molecular dynamics of open systems

The generalized Langevin equation (GLE) has been recently suggested to simulate the time evolution of classical solid and molecular systems when considering general nonequilibrium processes. In this approach, a part of the whole system (an open system), which interacts and exchanges energy with its dissipative environment, is studied. Because the GLE is derived by projecting out exactly the harmonic environment, the coupling to it is realistic, while the equations of motion are non-Markovian. Although the GLE formalism has already found promising applications, e. g., in nanotribology and as a powerful thermostat for equilibration in classical molecular dynamics simulations, efficient algorithms to solve the GLE for realistic memory kernels are highly nontrivial, especially if the memory kernels decay nonexponentially. This is due to the fact that one has to generate a colored noise and take account of the memory effects in a consistent manner. In this paper, we present a simple, yet efficient, algorithm for solving the GLE for practical memory kernels and we demonstrate its capability for the exactly solvable case of a harmonic oscillator coupled to a Debye bath.

Elucidation of the Burkholderia cenocepacia hopanoid biosynthesis pathway uncovers functions for conserved proteins in hopanoid-producing bacteria

Hopanoids are bacterial surrogates of eukaryotic membrane sterols and among earth's most abundant natural products. Their molecular fossils remain in sediments spanning more than a billion years. However, hopanoid metabolism and function are not fully understood. Burkholderia species are environmental opportunistic pathogens that produce hopanoids and also occupy diverse ecological niches. We investigated hopanoids biosynthesis in Burkholderia cenocepacia by deletion mutagenesis and structural characterization of the hopanoids produced by the mutants. The enzymes encoded by hpnH and hpnG were essential for production of all C35 extended hopanoids, including bacteriohopanetetrol (BHT), BHT glucosamine and BHT cyclitol ether. Deletion of hpnI resulted in BHT production, while ΔhpnJ produced only BHT glucosamine. Thus, HpnI is required for BHT glucosamine production while HpnJ is responsible for its conversion to the cyclitol ether. The ΔhpnH and ΔhpnG mutants could not grow under any stress condition tested, whereas ΔhpnI, ΔhpnJ and ΔhpnK displayed wild-type growth rates when exposed to detergent, but varying levels of sensitivity to low pH and polymyxin B. This study not only elucidates the biosynthetic pathway of hopanoids in B. cenocepacia, but also uncovers a biosynthetic role for the conserved proteins HpnI, HpnJ and HpnK in other hopanoid-producing bacteria.whereas ΔhpnI, ΔhpnJ and ΔhpnK displayed wild-type growth rates when exposed to detergent, but varying levels of sensitivity to low pH and polymyxin B. This study not only elucidates the biosynthetic pathway of hopanoids in B. cenocepacia, but also uncovers a biosynthetic role for the conserved proteins HpnI, HpnJ and HpnK in other hopanoid-producing bacteria.

Efficient predictive demand response using laguerre functions

Predictive Demand Response (DR) algorithms allow schedulable loads in power systems to be shifted to off-peak times. However, the size of the optimisation problems associated with predictive DR can grow very large and so efficient implementations of algorithms are desirable. In this paper Laguerre functions are used to significantly reduce the size of the optimisation needed to implement predictive DR, thus significantly increasing the efficiency of the implementation. © 2013 IEEE.

Generalized Selection Combining for Cognitive Relay Networks over Nakagami-m Fading

We consider transmit antenna selection with receive generalized selection combining (TAS/GSC) for cognitive decodeand-forward (DF) relaying in Nakagami-m fading channels. In an effort to assess the performance, the probability density function and the cumulative distribution function of the endto-end SNR are derived using the moment generating function, from which new exact closed-form expressions for the outage probability and the symbol error rate are derived. We then derive a new closed-form expression for the ergodic capacity. More importantly, by deriving the asymptotic expressions for the outage probability and the symbol error rate, as well as the high SNR approximations of the ergodic capacity, we establish new design insights under the two distinct constraint scenarios: 1) proportional interference power constraint, and 2) fixed interference power constraint. Several pivotal conclusions are reached. For the first scenario, the full diversity order of the
outage probability and the symbol error rate is achieved, and the high SNR slope of the ergodic capacity is 1/2. For the second scenario, the diversity order of the outage probability and the symbol error rate is zero with error floors, and the high SNR slope of the ergodic capacity is zero with capacity ceiling.

Generalized loopy 2U: A new algorithm for approximate inference in credal networks

Credal networks generalize Bayesian networks by relaxing the requirement of precision of probabilities. Credal networks are considerably more expressive than Bayesian networks, but this makes belief updating NP-hard even on polytrees. We develop a new efficient algorithm for approximate belief updating in credal networks. The algorithm is based on an important representation result we prove for general credal networks: that any credal network can be equivalently reformulated as a credal network with binary variables; moreover, the transformation, which is considerably more complex than in the Bayesian case, can be implemented in polynomial time. The equivalent binary credal network is then updated by L2U, a loopy approximate algorithm for binary credal networks. Overall, we generalize L2U to non-binary credal networks, obtaining a scalable algorithm for the general case, which is approximate only because of its loopy nature. The accuracy of the inferences with respect to other state-of-the-art algorithms is evaluated by extensive numerical tests.

Generalized Loopy 2U: A New Algorithm for Approximate Inference in Credal Networks

Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes belief updating NP-hard even on polytrees. We develop a new efficient algorithm for approximate belief updating in credal nets. The algorithm is based on an important representation result we prove for general credal nets: that any credal net can be equivalently reformulated as a credal net with binary variables; moreover, the transformation, which is considerably more complex than in the Bayesian case, can be implemented in polynomial time. The equivalent binary credal net is updated by L2U, a loopy approximate algorithm for binary credal nets. Thus, we generalize L2U to non-binary credal nets, obtaining an accurate and scalable algorithm for the general case, which is approximate only because of its loopy nature. The accuracy of the inferences is evaluated by empirical tests.

Solar phase functions of cometary nuclei

Relatively few measurements of the solar phase function of cometary nuclei exist, despite the importance of this parameter in determining accurate sizes and its use in modeling surface properties. We make use of robotic telescopes and servicemode observing to monitor cometary nuclei over months at a time, combining intensive observations at a single epoch with regular short light-curve segments to efficiently account for brightness changes due to both nucleus rotation and changing solar phase angle. We present our latest results on comets 8P/Tuttle, 14P/Wolf, 67P/Churyumov- Gerasimenko and 110P/Hartley 3.