eta-production on the proton via electromagnetic and hadronic probes

The reactions pi(-)p -> eta n and gamma p -> eta p are investigated within a dynamical coupled-channels model of meson production reactions in the nucleon resonance region The meson-baryon channels included are pi N, pi Delta, sigma N, and rho N The direct eta-photoproduction process is studied within a formalism based on a chiral constituent quark model approach, complemented with a one-gluon-exchange mechanism, to take into account the breakdown of the SU(6)circle times O(3) symmetry In the models search, the following known nucleon resonances are embodied S-11(1535), S-11(1650), P-11(1440), P-11(1710), P-13(1720), D-13(1520), D-13(1700), D-15(1675), and F-15(1680). Data for the pi(-)p -> eta n reaction from threshold up to a total center-of-mass energy of W approximate to 2 GeV are satisfactorily reproduced For the photoproduction channel: two additional higher mass known resonances, P-13(1900) and F-15(2000), are also considered However, reproducing the data for gamma p -> eta p requires, within our approach, two new nucleon resonances, for which we extract, mass and width

Optimal Scheduling of Secondary Content for Aggregation in Video-on-Demand Systems

Dynamic service aggregation techniques can exploit skewed access popularity patterns to reduce the costs of building interactive VoD systems. These schemes seek to cluster and merge users into single streams by bridging the temporal skew between them, thus improving server and network utilization. Rate adaptation and secondary content insertion are two such schemes. In this paper, we present and evaluate an optimal scheduling algorithm for inserting secondary content in this scenario. The algorithm runs in polynomial time, and is optimal with respect to the total bandwidth usage over the merging interval. We present constraints on content insertion which make the overall QoS of the delivered stream acceptable, and show how our algorithm can satisfy these constraints. We report simulation results which quantify the excellent gains due to content insertion. We discuss dynamic scenarios with user arrivals and interactions, and show that content insertion reduces the channel bandwidth requirement to almost half. We also discuss differentiated service techniques, such as N-VoD and premium no-advertisement service, and show how our algorithm can support these as well.

Effect of Grazing-Mediated Dimethyl Sulfide (DMS) Production on the Swimming Behavior of the Copepod Calanus helgolandicus

Chemical interactions play a fundamental role in the ecology of marine foodwebs. Dimethyl sulfide (DMS) is a ubiquitous marine trace gas that acts as a bioactive compound by eliciting foraging behavior in a range of marine taxa including the copepod Temora longicornis. Production of DMS can rapidly increase following microzooplankton grazing on phytoplankton. Here, we investigated whether grazing-induced DMS elicits an increase in foraging behavior in the copepod Calanus helgolandicus. We developed a semi-automated method to quantify the effect of grazing-mediated DMS on the proportion of the time budget tethered females allocate towards slow swimming, typically associated with feeding. The pooled data showed no differences in the proportion of the 25 min time budget allocated towards slow swimming between high (23.6 +/- 9.74%) and low (29.1 +/- 18.33%) DMS treatments. However, there was a high degree of variability between behavioral responses of individual copepods. We discuss the need for more detailed species-specific studies of individual level responses of copepods to chemical signals at different spatial scales to improve our understanding of chemical interactions between copepods and their prey.

An On Demand Queue Management Architecture for a Programmable Traffic Manager

A queue manager (QM) is a core traffic management (TM) function used to provide per-flow queuing in access andmetro networks; however current designs have limited scalability. An on-demand QM (OD-QM) which is part of a new modular field-programmable gate-array (FPGA)-based TM is presented that dynamically maps active flows to the available physical resources; its scalability is derived from exploiting the observation that there are only a few hundred active flows in a high speed network. Simulations with real traffic show that it is a scalable, cost-effective approach that enhances per-flow queuing performance, thereby allowing per-flow QM without the need for extra external memory at speeds up to 10 Gbps. It utilizes 2.3%–16.3% of a Xilinx XC5VSX50t FPGA and works at 111 MHz.