The effect of diotic and dichotic level-randomization on the binaural masking-level difference

Detection thresholds for tones in narrow-band noise were measured for two binaural configurations: N(o)S(o) and N(o)S(pi). The 30-Hz noise band had a mean overall level of 65 dB SPL and was centered on 250, 500, or 5000 Hz. Signals and noise were simultaneously gated for 500, 110, or 20 ms. Three conditions of level randomization were tested: (1) no randomization; (2) diotic randomization--the stimulus level (common to both ears) was randomly chosen from an uniformly distributed 40-dB range every presentation interval; and (3) dichotic randomization--the stimulus levels for each ear were each independently and randomly chosen from the 40-dB range. Regardless of binaural configuration, level randomization had small effects on thresholds at 500 and 110 ms, implying that binaural masking-level differences (BMLDs) do not depend on interaural level differences for individual stimuli. For 20-ms stimuli, both diotic and dichotic randomization led to markedly poorer performance than at 500- and 110-ms durations; BMLDs diminished with no randomization and dichotic randomization but not with diotic randomization. The loss of BMLDs at 20 ms, with degrees-of-freedom (2WT) approximately 1, implies that changes in intracranial parameters occurring during the course of the observation interval are necessary for BMLDs when mean-level and mean-intracranial-position cues have been made unhelpful.     

Entanglement of macroscopic test masses and the standard quantum limit in laser interferometry

We show that the generation of entanglement of two heavily macroscopic mirrors is feasible with state of the art techniques of high-precision laser interferometry. The basis of such a demonstration would be a Michelson interferometer with suspended mirrors and simultaneous homodyne detections at both interferometer output ports. We present the connection between the generation of entanglement and the standard quantum limit (SQL) for a free mass. The SQL is a well-known reference limit in operating interferometers for gravitational-wave detection and provides a measure of when macroscopic entanglement can be observed in the presence of realistic decoherence processes.     

Tailoring enhanced chaos in optically injected semiconductor lasers

We demonstrate theoretically and experimentally that the injection of two optical signals into a semiconductor laser can be a feasible and practical method of enhancing chaos, influencing the stability map and generating various nonlinear dynamics.     

Induced Cycles in Graphs

The maximum number vertices of a graph G inducing a 2-regular subgraph of G is denoted by \(c_\mathrm{ind}(G)\). We prove that if G is an r-regular graph of order n, then \(c_\mathrm{ind}(G) \ge \frac{n}{2(r-1)} + \frac{1}{(r-1)(r-2)}\) and we prove that if G is a cubic, claw-free graph on order n, then \(c_\mathrm{ind}(G) > \frac{13}{20}n\) and this bound is asymptotically best possible.     

Stratification and domination in graphs II

A graph G is 2-stratified if its vertex set is partitioned into two classes (each of which is a stratum or a color class.) We color the vertices in one color class red and the other color class blue. Let F be a 2-stratified graph with one fixed blue vertex v specified. We say that F is rooted at v. The F-domination number of a graph G is the minimum number of red vertices of G in a red-blue coloring of the vertices of G such that every blue vertex v of G belongs to a copy of F rooted at v. In this paper we investigate the F-domination number when (i) F is a 2-stratified path P₃ on three vertices rooted at a blue vertex which is a vertex of degree 1 in the P₃ and is adjacent to a blue vertex and with the remaining vertex colored red, and (ii) F is a 2-stratified K₃ rooted at a blue vertex and with exactly one red vertex.     

Domination versus disjunctive domination in graphs

A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacent to a vertex of S. The domination number of G is the minimum cardinality of a dominating set of G. For a positive integer b, a set S of vertices in a graph G is a b-disjunctive dominating set in G if every vertex v not in S is adjacent to a vertex of S or has at least b vertices in S at distance 2 from it in G. The b-disjunctive domination number of G is the minimum cardinality of a b-disjunctive dominating set. In this paper, we continue the study of disjunctive domination in graphs. We present properties of b-disjunctive dominating sets in a graph. A characterization of minimal b-disjunctive dominating sets is given. We obtain bounds on the ratio of the domination number and the b-disjunctive domination number for various families of graphs, including regular graphs and trees.     

Ein analogon zum Primzahlsatz für algebraische Funktionenkörper

LetF be an algebraic function field of one variable over a finite field . We prove that

Subthreshold kaon production in Au on Au collisions at 1 GeV/u

Subthreshold kaon production in¹⁹⁷ Au+¹⁹⁷ Au collisions at 1.0 GeV/u has been investigated with the Kaon Spectrometer at SIS. At _lab =44±4 we found aK ⁺/p ratio of>3 · 10^–4 for the momentum range 650 MeV/c to 1150 MeV/c.Dedicated to Prof. Dr. P. Kienle on the occasion of his 60th birthday