An assessment of coherent coupling through radiation fields in time varying slab waveguides

This paper presents an analytical methodology for analysing two-dimensional, dielectric slab waveguides where the guiding region is subject to abrupt and arbitrary temporal changes in permittivity. The methodology solves Maxwell’s equations in the frequency domain and recovers the solutions for the guided and radiation fields in the time domain using the Laplace transformation (LT). Explicit separation of the complete field solution into a set of guided modes and a radiation field continuum provides a clearer insight into the transient effects present in time-varying dielectric waveguides. In particular, the method is used to assess and quantify the impact of coherent radiation field coupling for arbitrary time variation of the waveguide permittivity.     

Whispering gallery mode transformation in a switched micro-cavity with concentric ring geometry

This article presents an analytical approach to the 2D problem in which a circular whispering-gallery mode (WGM) resonator is subject to an abrupt temporal change in refractive index in a circular coaxial region or in a ring region near the rim.     

Klee sets and Chebyshev centers for the right Bregman distance

We systematically investigate the farthest distance function, farthest points, Klee sets, and Chebyshev centers, with respect to Bregman distances induced by Legendre functions. These objects are of considerable interest in Information Geometry and Machine Learning; when the Legendre function is specialized to the energy, one obtains classical notions from Approximation Theory and Convex Analysis.The contribution of this paper is twofold. First, we provide an affirmative answer to a recently-posed question on whether or not every Klee set with respect to the right Bregman distance is a singleton. Second, we prove uniqueness of the Chebyshev center and we present a characterization that relates to previous works by Garkavi, by Klee, and by Nielsen and Nock.     

W *-dynamics of infinite quantum systems

We prove that the dynamics of an infinite quantum system, as formulated in the Schrödinger representation within the framework constructed in an earlier work [1], corresponds to ^*-automorphisms of the W ^*-algebra dual to the space of its physical states.     

Cross sections for charged current ν and\bar v interactions in the energy range 10 to 50 GeV

Charged-current neutrino and antineutrino interaction cross sections have been measured in the energy range 10 to 50 GeV using BEBC filled with a neon-hydrogen mixture. At these energies, σ/E was measured to be (0.73±0.08) 10^?38 cm²/GeV per nucleon for neutrinos and (0.32±0.06) 10^?38 cm²/GeV per nucleon for antineutrinos.     

KMS conditions and local thermodynamical stability of quantum lattice systems. II

We prove that local thermodynamical stability (LTS), as defined in [1], implies the KMS conditions in quantum lattice systems, without any assumption of translational invariance. This result, together with those of [1], establishes the equivalence between the LTS and the KMS conditions for such systems.     

Catching the first oligomerization event in the catalytic formation of polyaminoboranes: H3B·NMeHBH2·NMeH2 bound to iridium

We report the first insertion step at a metal center for the catalytic dehydropolymerization of H(3)B·NMeH(2) to form the simplest oligomeric species, H(3)B·NMeHBH(2)·NMeH(2), by the addition of 1 equiv of H(3)B·NMeH(2) to [Ir(PCy(3))(2)(H)(2)(η(2)-H(3)B·NMeH(2))][BAr(F)(4)] to give [Ir(PCy(3))(2)(H)(2)(η(2)-H(3)B·NMeHBH(2)·NMeH(2))][BAr(F)(4)]. This reaction is also catalytic for the formation of the free linear diborazane, but this is best obtained by an alternative stoichiometric synthesis.     

A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times

This paper presents a Branch, Bound, and Remember (BB&R) exact algorithm using the Cyclic Best First Search (CBFS) exploration strategy for solving the ${1|ST_{sd}|\sum T_{i}}$ scheduling problem, a single machine scheduling problem with sequence dependent setup times where the objective is to find a schedule with minimum total tardiness. The BB&R algorithm incorporates memory-based dominance rules to reduce the solution search space. The algorithm creates schedules in the reverse direction for problems where fewer than half the jobs are expected to be tardy. In addition, a branch and bound algorithm is used to efficiently compute tighter lower bounds for the problem. This paper also presents a counterexample for a previously reported exact algorithm in Luo and Chu (Appl Math Comput 183(1):575–588, 2006) and Luo et?al. (Int J Prod Res 44(17):3367–3378, 2006). Computational experiments demonstrate that the algorithm is two orders of magnitude faster than the fastest exact algorithm that has appeared in the literature. Computational experiments on two sets of benchmark problems demonstrate that the CBFS search exploration strategy can be used as an effective heuristic on problems that are too large to solve to optimality.