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.

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.

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.

Applications of the generalized Langevin equation: Towards a realistic description of the baths

The generalized Langevin equation (GLE) method, as developed previously [L. Stella et al., Phys. Rev. B 89, 134303 (2014)], is used to calculate the dissipative dynamics of systems described at the atomic level. The GLE scheme goes beyond the commonly used bilinear coupling between the central system and the bath, and permits us to have a realistic description of both the dissipative central system and its surrounding bath. We show how to obtain the vibrational properties of a realistic bath and how to convey such properties into an extended Langevin dynamics by the use of the mapping of the bath vibrational properties onto a set of auxiliary variables. Our calculations for a model of a Lennard-Jones solid show that our GLE scheme provides a stable dynamics, with the dissipative/relaxation processes properly described. The total kinetic energy of the central system always thermalizes toward the expected bath temperature, with appropriate fluctuation around the mean value. More importantly, we obtain a velocity distribution for the individual atoms in the central system which follows the expected canonical distribution at the corresponding temperature. This confirms that both our GLE scheme and our mapping procedure onto an extended Langevin dynamics provide the correct thermostat. We also examined the velocity autocorrelation functions and compare our results with more conventional Langevin dynamics.

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.

Outperformance in exchange-traded fund pricing deviations: Generalized control of data snooping bias

An investigation into exchange-traded fund (ETF) outperforrnance during the period 2008-2012 is undertaken utilizing a data set of 288 U.S. traded securities. ETFs are tested for net asset value (NAV) premium, underlying index and market benchmark outperformance, with Sharpe, Treynor, and Sortino ratios employed as risk-adjusted performance measures. A key contribution is the application of an innovative generalized stepdown procedure in controlling for data snooping bias. We find that a large proportion of optimized replication and debt asset class ETFs display risk-adjusted premiums with energy and precious metals focused funds outperforming the S&P 500 market benchmark. 

Low complexity greedy detection method with generalized multicarrier index keying OFDM

Multicarrier Index Keying (MCIK) is a recently developed technique that modulates subcarriers but also indices of the subcarriers. In this paper a novel low-complexity detection scheme of subcarrier indices is proposed for an MCIK system and addresses a substantial reduction in complexity over the optimalmaximum likelihood (ML) detection. For the performance evaluation, a closed-form expression for the pairwise error probability (PEP) of an active subcarrier index, and a tight approximation of the average PEP of multiple subcarrier indices are derived in closed-form. The theoretical outcomes are validated usingsimulations, at a difference of less than 0.1dB. Compared to the optimal ML, the proposed detection achieves a substantial reduction in complexity with small loss in error performance (<= 0.6dB).

Towards generalized Doherty power amplifier design for multiband operation

This paper presents a new variant of broadband Doherty power amplifier that employs a novel output combiner. A new parameter ∝ is introduced to permit a generalized analysis of the recently reported Parallel Doherty power amplifier (PDPA),and hence offer design flexibility. The circuit prototype of the new DPA fabricated using GaN devices exhibits maximum drain efficiency of 85% at 43-dBm peak power and 63% at 6-dB backoff power (BOP). Measured drain efficiency of >60% at peak power across 500-MHz frequency range and >50% at 6-dB BOP across 480-MHz frequency range were achieved, confirming the  theoretical wideband characteristics of the new DPA.

Generalized collisional radiative model for light elements: C: Data for the B isonuclear sequence

A first stage collision database is assembled which contains electron-impact excitation, ionization,\r and recombination rate coefficients for B, B + , B 2+ , B 3+ , and B 4+ . The first stage database\r is constructed using the R-matrix with pseudostates, time-dependent close-coupling, and perturbative\r distorted-wave methods. A second stage collision database is then assembled which contains\r generalized collisional-radiative ionization, recombination, and power loss rate coefficients as a\r function of both temperature and density. The second stage database is constructed by solution of\r the collisional-radiative equations in the quasi-static equilibrium approximation using the first\r stage database. Both collision database stages reside in electronic form at the IAEA Labeled Atomic\r Data Interface (ALADDIN) database and the Atomic Data Analysis Structure (ADAS) open database.

Generalized collisional radiative model for light elements. Part B: Data for the Be isonuclear sequence

A first-stage collision database is assembled which contains electron-impact excitation, ionization, and recombination rate coefficients for Be, Be+, Be2+, and Be3+. The first-stage database is constructed using the R-matrix with pseudo-states, time-dependent close-coupling, and perturbative, distorted-wave methods. A second-stage collision database is then assembled which contains generalized collisional-radiative and radiated power loss coefficients. The second-stage database is constructed by solution of collisional-radiative equations in the quasi-static equilibrium approximation using the first-stage database. Both collision database stages reside in electronic form at the ORNL Controlled Fusion Atomic Data Center and in the ADAS database, and are easily accessed over the worldwide internet. © 2007 Elsevier Inc. All rights reserved.