An adaptive modulation scheme for two-user fading MAC with quantized fade state feedback

For transmission over the two-user Gaussian Multiple Access Channel with fading and finite constellation at the inputs, we propose a scheme which uses only quantized knowledge of fade state at users with the feedback overhead being nominal. One of the users rotates its constellation without varying the transmit power to adapt to the existing channel conditions, in order to meet certain pre-determined minimum Euclidean distance requirement in the equivalent constellation at the destination. The optimal modulation scheme has been described for the case when both the users use symmetric M-PSK constellations at the input, where M = 2λ, λ being a positive integer. The strategy has been illustrated by considering examples where both the users use QPSK signal set at the input. It is shown that the proposed scheme has considerable better error performance compared to the conventional non-adaptive scheme, at the cost of a feedback overhead of just [log2 (M2/8 - M/4 + 2)] + 1 bits, for the M-PSK case.

Does linear separability really matter? Complex visual search is explained by simple search

Visual search in real life involves complex displays with a target among multiple types of distracters, but in the laboratory, it is often tested using simple displays with identical distracters. Can complex search be understood in terms of simple searches? This link may not be straightforward if complex search has emergent properties. One such property is linear separability, whereby search is hard when a target cannot be separated from its distracters using a single linear boundary. However, evidence in favor of linear separability is based on testing stimulus configurations in an external parametric space that need not be related to their true perceptual representation. We therefore set out to assess whether linear separability influences complex search at all. Our null hypothesis was that complex search performance depends only on classical factors such as target-distracter similarity and distracter homogeneity, which we measured using simple searches. Across three experiments involving a variety of artificial and natural objects, differences between linearly separable and nonseparable searches were explained using target-distracter similarity and distracter heterogeneity. Further, simple searches accurately predicted complex search regardless of linear separability (r = 0.91). Our results show that complex search is explained by simple search, refuting the widely held belief that linear separability influences visual search.

Full-rate full-diversity finite feedback space-time schemes with minimum feedback and transmission duration

A Finite Feedback Scheme (FFS) for a quasi-static MIMO block fading channel with finite N-ary delay-free noise-free feedback consists of N Space-Time Block Codes (STBCs) at the transmitter, one corresponding to each possible value of feedback, and a function at the receiver that generates N-ary feedback. A number of FFSs are available in the literature that provably attain full-diversity. However, there is no known full-diversity criterion that universally applies to all FFSs. In this paper a universal necessary condition for any FFS to achieve full-diversity is given, and based on this criterion the notion of Feedback-Transmission duration optimal (FT-optimal) FFSs is introduced, which are schemes that use minimum amount of feedback N for the given transmission duration T, and minimum T for the given N to achieve full-diversity. When there is no feedback (N = 1) an FT-optimal scheme consists of a single STBC, and the proposed condition reduces to the well known necessary and sufficient condition for an STBC to achieve full-diversity. Also, a sufficient criterion for full-diversity is given for FFSs in which the component STBC yielding the largest minimum Euclidean distance is chosen, using which full-rate (N-t complex symbols per channel use) full-diversity FT-optimal schemes are constructed for all N-t > 1. These are the first full-rate full-diversity FFSs reported in the literature for T < N-t. Simulation results show that the new schemes have the best error performance among all known FFSs.

Features in visual search combine linearly

Single features such as line orientation and length are known to guide visual search, but relatively little is known about how multiple features combine in search. To address this question, we investigated how search for targets differing in multiple features ( intensity, length, orientation) from the distracters is related to searches for targets differing in each of the individual features. We tested race models (based on reaction times) and coactivation models ( based on reciprocal of reaction times) for their ability to predict multiple feature searches. Multiple feature searches were best accounted for by a co-activation model in which feature information combined linearly (r = 0.95). This result agrees with the classic finding that these features are separable i.e., subjective dissimilarity ratings sum linearly. We then replicated the classical finding that the length and width of a rectangle are integral features-in other words, they combine nonlinearly in visual search. However, to our surprise, upon including aspect ratio as an additional feature, length and width combined linearly and this model outperformed all other models. Thus, length and width of a rectangle became separable when considered together with aspect ratio. This finding predicts that searches involving shapes with identical aspect ratio should be more difficult than searches where shapes differ in aspect ratio. We confirmed this prediction on a variety of shapes. We conclude that features in visual search co-activate linearly and demonstrate for the first time that aspect ratio is a novel feature that guides visual search.

Online Estimation of Evolving Human Visual Interest

Regions in video streams attracting human interest contribute significantly to human understanding of the video. Being able to predict salient and informative Regions of Interest (ROIs) through a sequence of eye movements is a challenging problem. Applications such as content-aware retargeting of videos to different aspect ratios while preserving informative regions and smart insertion of dialog (closed-caption text) into the video stream can significantly be improved using the predicted ROIs. We propose an interactive human-in-the-loop framework to model eye movements and predict visual saliency into yet-unseen frames. Eye tracking and video content are used to model visual attention in a manner that accounts for important eye-gaze characteristics such as temporal discontinuities due to sudden eye movements, noise, and behavioral artifacts. A novel statistical-and algorithm-based method gaze buffering is proposed for eye-gaze analysis and its fusion with content-based features. Our robust saliency prediction is instantiated for two challenging and exciting applications. The first application alters video aspect ratios on-the-fly using content-aware video retargeting, thus making them suitable for a variety of display sizes. The second application dynamically localizes active speakers and places dialog captions on-the-fly in the video stream. Our method ensures that dialogs are faithful to active speaker locations and do not interfere with salient content in the video stream. Our framework naturally accommodates personalisation of the application to suit biases and preferences of individual users.

In a hot bubble: why does superbubble feedback work, but isolated supernovae do not?

Using idealized one-dimensional Eulerian hydrodynamic simulations, we contrast the behaviour of isolated supernovae with the superbubbles driven by multiple, collocated supernovae. Continuous energy injection via successive supernovae exploding within the hot/dilute bubble maintains a strong termination shock. This strong shock keeps the superbubble over-pressured and drives the outer shock well after it becomes radiative. Isolated supernovae, in contrast, with no further energy injection, become radiative quite early (less than or similar to 0.1Myr, tens of pc), and stall at scales less than or similar to 100 pc. We show that isolated supernovae lose almost all of their mechanical energy by 1 Myr, but superbubbles can retain up to similar to 40 per cent of the input energy in the form of mechanical energy over the lifetime of the star cluster (a few tens of Myr). These conclusions hold even in the presence of realistic magnetic fields and thermal conduction. We also compare various methods for implementing supernova feedback in numerical simulations. For various feedback prescriptions, we derive the spatial scale below which the energy needs to be deposited in order for it to couple to the interstellar medium. We show that a steady thermal wind within the superbubble appears only for a large number (greater than or similar to 10(4)) of supernovae. For smaller clusters, we expect multiple internal shocks instead of a smooth, dense thermalized wind.

A media access and feedback protocol for reliable multicast over wireless channel

A link level reliable multicast requires a channel access protocol to resolve the collision of feedback messages sent by multicast data receivers. Several deterministic media access control protocols have been proposed to attain high reliability, but with large delay. Besides, there are also protocols which can only give probabilistic guarantee about reliability, but have the least delay. In this paper, we propose a virtual token-based channel access and feedback protocol (VTCAF) for link level reliable multicasting. The VTCAF protocol introduces a virtual (implicit) token passing mechanism based on carrier sensing to avoid the collision between feedback messages. The delay performance is improved in VTCAF protocol by reducing the number of feedback messages. Besides, the VTCAF protocol is parametric in nature and can easily trade off reliability with the delay as per the requirement of the underlying application. Such a cross layer design approach would be useful for a variety of multicast applications which require reliable communication with different levels of reliability and delay performance. We have analyzed our protocol to evaluate various performance parameters at different packet loss rate and compared its performance with those of others. Our protocol has also been simulated using Castalia network simulator to evaluate the same performance parameters. Simulation and analytical results together show that the VTCAF protocol is able to considerably reduce average access delay while ensuring very high reliability at the same time.

VISUAL OBJECT TRACKING VIA RANDOM FERNS BASED CLASSIFICATION

Designing a robust algorithm for visual object tracking has been a challenging task since many years. There are trackers in the literature that are reasonably accurate for many tracking scenarios but most of them are computationally expensive. This narrows down their applicability as many tracking applications demand real time response. In this paper, we present a tracker based on random ferns. Tracking is posed as a classification problem and classification is done using ferns. We used ferns as they rely on binary features and are extremely fast at both training and classification as compared to other classification algorithms. Our experiments show that the proposed tracker performs well on some of the most challenging tracking datasets and executes much faster than one of the state-of-the-art trackers, without much difference in tracking accuracy.

Characterizing the Impact of Feedback Delays on Wideband Rate Adaptation

In contemporary orthogonal frequency division multiplexing (OFDM) systems, such as Long Term Evolution (LTE), LTE-Advanced, and WiMAX, a codeword is transmitted over a group of subcarriers. Since different subcarriers see different channel gains in frequency-selective channels, the modulation and coding scheme (MCS) of the codeword must be selected based on the vector of signal-to-noise-ratios (SNRs) of these subcarriers. Exponential effective SNR mapping (EESM) maps the vector of SNRs into an equivalent flat-fading SNR, and is widely used to simplify this problem. We develop a new analytical framework to characterize the throughput of EESM-based rate adaptation in such wideband channels in the presence of feedback delays. We derive a novel accurate approximation for the throughput as a function of feedback delay. We also propose a novel bivariate gamma distribution to model the time evolution of EESM between the times of estimation and data transmission, which facilitates the analysis. These are then generalized to a multi-cell, multi-user scenario with various frequency-domain schedulers. Unlike prior work, most of which is simulation-based, our framework encompasses both correlated and independent subcarriers and various multiple antenna diversity modes; it is accurate over a wide range of delays.

Performance of OFDM Systems With Best-m Feedback, Scheduling, and Delays for Uniformly Correlated Subchannels

Contemporary cellular standards, such as Long Term Evolution (LTE) and LTE-Advanced, employ orthogonal frequency-division multiplexing (OFDM) and use frequency-domain scheduling and rate adaptation. In conjunction with feedback reduction schemes, high downlink spectral efficiencies are achieved while limiting the uplink feedback overhead. One such important scheme that has been adopted by these standards is best-m feedback, in which every user feeds back its m largest subchannel (SC) power gains and their corresponding indices. We analyze the single cell average throughput of an OFDM system with uniformly correlated SC gains that employs best-m feedback and discrete rate adaptation. Our model incorporates three schedulers that cover a wide range of the throughput versus fairness tradeoff and feedback delay. We show that, for small m, correlation significantly reduces average throughput with best-m feedback. This result is pertinent as even in typical dispersive channels, correlation is high. We observe that the schedulers exhibit varied sensitivities to correlation and feedback delay. The analysis also leads to insightful expressions for the average throughput in the asymptotic regime of a large number of users.

Throughput Analysis of Best-m Feedback in OFDM Systems with Uniformly Correlated Subchannels

Practical orthogonal frequency division multiplexing (OFDM) systems, such as Long Term Evolution (LTE), exploit multi-user diversity using very limited feedback. The best-m feedback scheme is one such limited feedback scheme, in which users report only the gains of their m best subchannels (SCs) and their indices. While the scheme has been extensively studied and adopted in standards such as LTE, an analysis of its throughput for the practically important case in which the SCs are correlated has received less attention. We derive new closed-form expressions for the throughput when the SC gains of a user are uniformly correlated. We analyze the performance of the greedy but unfair frequency-domain scheduler and the fair round-robin scheduler for the general case in which the users see statistically non-identical SCs. An asymptotic analysis is then developed to gain further insights. The analysis and extensive numerical results bring out how correlation reduces throughput.

Direct Link-Aware Optimal Relay Selection and a Low Feedback Variant for Underlay CR

Cooperative relaying combined with selection has been extensively studied in the literature to improve the performance of interference-constrained secondary users in underlay cognitive radio (CR). We present a novel symbol error probability (SEP)-optimal amplify-and-forward relay selection rule for an average interference-constrained underlay CR system. A fundamental principle, which is unique to average interference-constrained underlay CR, that the proposed rule brings out is that the choice of the optimal relay is affected not just by the source-to-relay, relay-to-destination, and relay-to-primary receiver links, which are local to the relay, but also by the direct source-to-destination (SD) link, even though it is not local to any relay. We also propose a simpler, practically amenable variant of the optimal rule called the 1-bit rule, which requires just one bit of feedback about the SD link gain to the relays, and incurs a marginal performance loss relative to the optimal rule. We analyze its SEP and develop an insightful asymptotic SEP analysis. The proposed rules markedly outperform several ad hoc SD link-unaware rules proposed in the literature. They also generalize the interference-unconstrained and SD link-unaware optimal rules considered in the literature.

Plant reproductive traits mediate tritrophic feedback effects within an obligate brood-site pollination mutualism

Plants, herbivores and parasitoids affect each other directly and indirectly; however, feedback effects mediated by host plant traits have rarely been demonstrated in these tritrophic interactions. Brood-site pollination mutualisms (e.g. those involving figs and fig wasps) represent specialised tritrophic communities where the progeny of mutualistic pollinators and of non-mutualistic gallers (both herbivores) together with that of their parasitoids develop within enclosed inflorescences called syconia (hence termed brood-sites or microcosms). Plant reproductive phenology (which affects temporal brood-site availability) and inflorescence size (representing brood-site size) are plant traits that could affect reproductive resources, and hence relationships between trees, pollinators and non-pollinating wasps. Analysing wasp and seed contents of syconia, we examined direct, indirect, trophic and non-trophic relationships within the interaction web of the fig-fig wasp community of Ficus racemosa in the context of brood site size and availability. We demonstrate that in addition to direct resource competition and predator-prey (host-parasitoid) interactions, these communities display exploitative or apparent competition and trait-mediated indirect interactions. Inflorescence size and plant reproductive phenology impacted plant-herbivore and plant-parasitoid associations. These plant traits also influenced herbivore-herbivore and herbivore-parasitoid relationships via indirect effects. Most importantly, we found a reciprocal effect between within-tree reproductive asynchrony and fig wasp progeny abundances per syconium that drives a positive feedback cycle within the system. The impact of a multitrophic feedback cycle within a community built around a mutualistic core highlights the need for a holistic view of plant-herbivore-parasitoid interactions in the community ecology of mutualisms.

COOL CORE CYCLES: COLD GAS AND AGN JET FEEDBACK IN CLUSTER CORES

Using high-resolution 3D and 2D (axisymmetric) hydrodynamic simulations in spherical geometry, we study the evolution of cool cluster cores heated by feedback-driven bipolar active galactic nuclei (AGNs) jets. Condensation of cold gas, and the consequent enhanced accretion, is required for AGN feedback to balance radiative cooling with reasonable efficiencies, and to match the observed cool core properties. A feedback efficiency (mechanical luminosity approximate to epsilon(M) over dot(acc)c(2); where (M) over dot(acc). is the mass accretion rate at 1 kpc) as small as 6 x 10(-5) is sufficient to reduce the cooling/accretion rate by similar to 10 compared to a pure cooling flow in clusters (with M-200 less than or similar to 7 x 10(14) M-circle dot). This value is much smaller compared to the ones considered earlier, and is consistent with the jet efficiency and the fact that only a small fraction of gas at 1 kpc is accreted onto the supermassive black hole (SMBH). The feedback efficiency in earlier works was so high that the cluster core reached equilibrium in a hot state without much precipitation, unlike what is observed in cool-core clusters. We find hysteresis cycles in all our simulations with cold mode feedback: condensation of cold gas when the ratio of the cooling-time to the free-fall time (t(cool)/t(ff)) is less than or similar to 10 leads to a sudden enhancement in the accretion rate; a large accretion rate causes strong jets and overheating of the hot intracluster medium such that t(cool)/t(ff) > 10; further condensation of cold gas is suppressed and the accretion rate falls, leading to slow cooling of the core and condensation of cold gas, restarting the cycle. Therefore, there is a spread in core properties, such as the jet power, accretion rate, for the same value of core entropy t(cool)/t(ff). A smaller number of cycles is observed for higher efficiencies and for lower mass halos because the core is overheated to a longer cooling time. The 3D simulations show the formation of a few-kpc scale, rotationally supported, massive (similar to 10(11) M-circle dot) cold gas torus. Since the torus gas is not accreted onto the SMBH, it is largely decoupled from the feedback cycle. The radially dominant cold gas (T < 5 x 10(4) K; vertical bar v(r)vertical bar >vertical bar v(phi vertical bar)) consists of fast cold gas uplifted by AGN jets and freely infalling cold gas condensing out of the core. The radially dominant cold gas extends out to 25 kpc for the fiducial run (halo mass 7 x 10(14) M-circle dot and feedback efficiency 6 x 10(-5)), with the average mass inflow rate dominating the outflow rate by a factor of approximate to 2. We compare our simulation results with recent observations.

The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint

The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1, infinity)-RLL constraint. We derive the capacity for this setting, which can be expressed as C-is an element of = max(0 <= p <= 0.5) (1-is an element of) H-b (p)/1+(1-is an element of) p, where is an element of is the erasure probability and Hb(.) is the binary entropy function. Moreover, we prove that a priori knowledge of the erasure at the encoder does not increase the feedback capacity. The feedback capacity was calculated using an equivalent dynamic programming (DP) formulation with an optimal average-reward that is equal to the capacity. Furthermore, we obtained an optimal encoding procedure from the solution of the DP, leading to a capacity-achieving, zero-error coding scheme for our setting. DP is, thus, shown to be a tool not only for solving optimization problems, such as capacity calculation, but also for constructing optimal coding schemes. The derived capacity expression also serves as the only non-trivial upper bound known on the capacity of the input-constrained erasure channel without feedback, a problem that is still open.