Tanaka-Tagoshi Parametrization of post-1PN Spin-Free Gravitational Wave Chirps: Equispaced and Cardinal Interpolated Lattices For First Generation Interferometric Antennas

The spin-free binary-inspiral parameter-space introduced by Tanaka and Tagoshi to construct a uniformly-spaced lattice of templates at (and possibly beyond) $2.5PN$ order is shown to work for all first generation interferometric gravitational wave antennas. This allows to extend the minimum-redundant cardinal interpolation techniques of the correlator bank developed by the Authors to the highest available order PN templates. The total number of 2PN templates to be computed for a minimal match $\Gamma=0.97$ is reduced by a factor 4, as in the 1PN case.Comment: 9 pages, 8 figures, 3 tables, accepted for publication in Phys. Rev.

Optimum Placement of Post-1PN GW Chirp Templates Made Simple at any Match Level via Tanaka-Tagoshi Coordinates

A simple recipe is given for constructing a maximally sparse regular lattice of spin-free post-1PN gravitational wave chirp templates subject to a given minimal match constraint, using Tanaka-Tagoshi coordinates.Comment: submitted to Phys. Rev.

Rejection Properties of Stochastic-Resonance-Based Detectors of Weak Harmonic Signals

In (V. Galdi et al., Phys. Rev. E57, 6470, 1998) a thorough characterization in terms of receiver operating characteristics (ROCs) of stochastic-resonance (SR) detectors of weak harmonic signals of known frequency in additive gaussian noise was given. It was shown that strobed sign-counting based strategies can be used to achieve a nice trade-off between performance and cost, by comparison with non-coherent correlators. Here we discuss the more realistic case where besides the sought signal (whose frequency is assumed known) further unwanted spectrally nearby signals with comparable amplitude are present. Rejection properties are discussed in terms of suitably defined false-alarm and false-dismissal probabilities for various values of interfering signal(s) strength and spectral separation.Comment: 4 pages, 5 figures. Misprints corrected. PACS numbers added. RevTeX

An exact approach for the bilevel knapsack problem with interdiction constraints and extensions

We consider the bilevel knapsack problem with interdiction constraints, an extension of the classic 0–1 knapsack problem formulated as a Stackelberg game with two agents, a leader and a follower, that choose items from a common set and hold their own private knapsacks. First, the leader selects some items to be interdicted for the follower while satisfying a capacity constraint. Then the follower packs a set of the remaining items according to his knapsack constraint in order to maximize the profits. The goal of the leader is to minimize the follower’s total profit. We derive effective lower bounds for the bilevel knapsack problem and present an exact method that exploits the structure of the induced follower’s problem. The approach strongly outperforms the current state-of-the-art algorithms designed for the problem. We extend the same algorithmic framework to the interval min–max regret knapsack problem after providing a novel bilevel programming reformulation. Also for this problem, the proposed approach outperforms the exact algorithms available in the literature

How Many Templates for GW Chirp Detection? The Minimal-Match Issue Revisited

In a recent paper dealing with maximum likelihood detection of gravitational wave chirps from coalescing binaries with unknown parameters we introduced an accurate representation of the no-signal cumulative distribution of the supremum of the whole correlator bank. This result can be used to derive a refined estimate of the number of templates yielding the best tradeoff between detector's performance (in terms of lost signals among those potentially detectable) and computational burden.Comment: submitted to Class. Quantum Grav. Typing error in eq. (4.8) fixed; figure replaced in version

Structured lexical similarity via convolution Kernels on dependency trees

A central topic in natural language process-ing is the design of lexical and syntactic fea-tures suitable for the target application. In this paper, we study convolution dependency tree kernels for automatic engineering of syntactic and semantic patterns exploiting lexical simi-larities. We define efficient and powerful ker-nels for measuring the similarity between de-pendency structures, whose surface forms of the lexical nodes are in part or completely dif-ferent. The experiments with such kernels for question classification show an unprecedented results, e.g. 41 % of error reduction of the for-mer state-of-the-art. Additionally, semantic role classification confirms the benefit of se-mantic smoothing for dependency kernels.

Surface roughness effect on ultracold neutron interaction with a wall and implications for computer simulations

We review the diffuse scattering and the loss coefficient in ultracold neutron reflection from slightly rough surfaces, report a surprising reduction in loss coefficient due to roughness, and discuss the possibility of transition from quantum treatment to ray optics. The results are used in a computer simulation of neutron storage in a recent neutron lifetime experiment that re-ported a large discrepancy of neutron lifetime with the current particle data value. Our partial re-analysis suggests the possibility of systematic effects that were not included in this publication.Comment: 39 pages, 9 figures; additional calculations include

Effect of an Acute Bout of Low-, Moderate, and High-Intensity Aerobic Exercise on Immediate and Delayed Fractionated Response Time

In the present investigation, we investigated the role of three intensities of aerobic exercise (Low Intensity [LI], Moderate Intensity [MI], High Intensity [HI]) on IPC using a unique method to fractionate RPT into three components: (1) RT, which is the interval between the onset of the stimulus signal and the onset of muscle activity in the responding muscle (cognitive-decision making component), (2) movement time (MT), which is the time interval between the onset of muscle activation and completion of the required motor response, and (3) RPT, which encompasses both RT and MT. Movement time reflects more the muscular components of the stimulus-response action, whereas RT reflects the duration of all earlier stages of information processing