200 femtosecond impulse response of a Fabry–Pérot etalon with the spectral ballistic imaging technique

We use the spectral ballistic imaging technique to measure the impulse response of a Fabry–Pérot etalon with less than 0.2 ps temporal resolution. The results show excellent agreement with the theoretical predictions and negligible noise. Comparison to the Kramers–Kronig method along with its limitations is also presented. PACS 42.65.Re; 07.60.Ly; 42.30.Kq     

Some proximity and sensitivity results in quadratic integer programming

We show that for any optimal solution for a given separable quadratic integer programming problem there exist an optimal solution for its continuous relaxation such that wheren is the number of variables and(A) is the largest absolute subdeterminant of the integer constraint matrixA. Also for any feasible solutionz, which is not optimal for the separable quadratic integer programming problem, there exists a feasible solution having greater objective function value and with . We further prove, under some additional assumptions, that the distance between a pair of optimal solutions to an integer quadratic programming problem with right hand side vectorsb andb, respectively, depends linearly on b–b₁. Finally the validity of all the results for nonseparable mixed-integer quadratic programs is established. The proximity results obtained in this paper are extensions of some of the results described in Cook et al. (1986) for linear integer programming.This research was partially supported by Natural Sciences and Engineering Research Council of Canada Grant 5-83998.     

Spanning network games

We study fundamental properties of monotone network enterprises which contain public vertices and have positive and negative costs on edges and vertices. Among the properties studied are the nonemptiness of the core, characterization of nonredundant core constraints, ease of computation of the core and the nucleolus, and cases of decomposition of the core and the nucleolus. Received December 1994/Final version March 1998     

Neutrinos of energy approximately 10(16) eV from gamma-ray bursts in pulsar wind bubbles

The supranova model for gamma-ray bursts (GRBs) is becoming increasingly more popular. In this scenario the GRB occurs weeks to years after a supernova explosion, and is located inside a pulsar wind bubble (PWB). Protons accelerated in the internal shocks that emit the GRB may interact with the external PWB photons producing pions which decay into approximately 10(16) eV neutrinos. A km(2) neutrino detector would observe several events per year correlated with the GRBs.     

Kilohertz laser frequency sensing with Brillouin mutually modulated cross-gain modulation

Using mutually modulated cross-gain modulation, Stokes optical frequency changes are converted into modulation phase changes with high sensitivity. In the slow-light transition regime, we demonstrate kilohertz sensitivity to the Stokes optical carrier frequency. The sensitivity is inversely proportional to the modulation frequency of the pump and Stokes beams.     

Transition from the ballistic to the diffusive regime in a turbid medium

By varying the absorption coefficient and width of an intralipid-India ink solution in a quasi-one-dimensional experiment, we investigate the transition between the ballistic and the diffusive regimes. The medium's attenuation coefficient changes abruptly between two different values within a single mean free path. This problem is analyzed both experimentally and theoretically, and it is demonstrated that the transition location depends on the scattering coefficient as well as on the measuring solid angle.     

Polynomial algorithms for (integral) maximum two-flows in vertex edge-capacitated planar graphs

In this paper we study the maximum two-flow problem in vertex- and edge-capacitated undirected ST₂-planar graphs, that is, planar graphs where the vertices of each terminal pair are on the same face. For such graphs we provide an O(n) algorithm for finding a minimum two-cut and an O(n log n) algorithm for determining a maximum two-flow and show that the value of a maximum two-flow equals the value of a minimum two-cut. We further show that the flow obtained is half-integral and provide a characterization of edge and vertex capacitated ST₂-planar graphs that guarantees a maximum two-flow that is integral. By a simple variation of our maximum two-flow algorithm we then develop, for ST₂-planar graphs with vertex and edge capacities, an O(n log n) algorithm for determining an integral maximum two-flow of value not less than the value of a maximum two-flow minus one.