4,021 research outputs found

    Abnormal phenomena in a one-dimensional periodic structure containing left-handed materials

    Full text link
    The explicit dispersion equation for a one-dimensional periodic structure with alternative layers of left-handed material (LHM) and right-handed material (RHM) is given and analyzed. Some abnormal phenomena such as spurious modes with complex frequencies, discrete modes and photon tunnelling modes are observed in the band structure. The existence of spurious modes with complex frequencies is a common problem in the calculation of the band structure for such a photonic crystal. Physical explanation and significance are given for the discrete modes (with real values of wave number) and photon tunnelling propagation modes (with imaginary wave numbers in a limited region).Comment: 10 pages, 4 figure

    About the maximal rank of 3-tensors over the real and the complex number field

    Full text link
    High dimensional array data, tensor data, is becoming important in recent days. Then maximal rank of tensors is important in theory and applications. In this paper we consider the maximal rank of 3 tensors. It can be attacked from various viewpoints, however, we trace the method of Atkinson-Stephens(1979) and Atkinson-Lloyd(1980). They treated the problem in the complex field, and we will present various bounds over the real field by proving several lemmas and propositions, which is real counterparts of their results.Comment: 13 pages, no figure v2: correction and improvemen

    Stability of complex hyperbolic space under curvature-normalized Ricci flow

    Full text link
    Using the maximal regularity theory for quasilinear parabolic systems, we prove two stability results of complex hyperbolic space under the curvature-normalized Ricci flow in complex dimensions two and higher. The first result is on a closed manifold. The second result is on a complete noncompact manifold. To prove both results, we fully analyze the structure of the Lichnerowicz Laplacian on complex hyperbolic space. To prove the second result, we also define suitably weighted little H\"{o}lder spaces on a complete noncompact manifold and establish their interpolation properties.Comment: Some typos in version 2 are correcte

    Laser gas-discharge absorption measurements of the ratio of two transition rates in argon

    Full text link
    The ratio of two line strengths at 922.7 nm and 978.7 nm of argon is measured in an argon pulsed discharge with the use of a single-mode Ti:Sapphire laser. The result 3.29(0.13) is in agreement with our theoretical prediction 3.23 and with a less accurate ratio 2.89(0.43) from the NIST database.Comment: 5 pages, 2 figures, 1 tabl

    Influence of a low magnetic field on the thermal diffusivity of Bi-2212

    Full text link
    The thermal diffusivity of a Bi-2212 polycrystalline sample has been measured under a 1T magnetic field applied perpendicularly to the heat flux. The magnetic contribution to the heat carrier mean free path has been extracted and is found to behave as a simple power law. This behavior can be attributed to a percolation process of electrons in the vortex lattice created by the magnetic field.Comment: 10 pages, 3 figures; to be published in Phys. Rev.

    Fast Searching in Packed Strings

    Get PDF
    Given strings PP and QQ the (exact) string matching problem is to find all positions of substrings in QQ matching PP. The classical Knuth-Morris-Pratt algorithm [SIAM J. Comput., 1977] solves the string matching problem in linear time which is optimal if we can only read one character at the time. However, most strings are stored in a computer in a packed representation with several characters in a single word, giving us the opportunity to read multiple characters simultaneously. In this paper we study the worst-case complexity of string matching on strings given in packed representation. Let mnm \leq n be the lengths PP and QQ, respectively, and let σ\sigma denote the size of the alphabet. On a standard unit-cost word-RAM with logarithmic word size we present an algorithm using time O\left(\frac{n}{\log_\sigma n} + m + \occ\right). Here \occ is the number of occurrences of PP in QQ. For m=o(n)m = o(n) this improves the O(n)O(n) bound of the Knuth-Morris-Pratt algorithm. Furthermore, if m=O(n/logσn)m = O(n/\log_\sigma n) our algorithm is optimal since any algorithm must spend at least \Omega(\frac{(n+m)\log \sigma}{\log n} + \occ) = \Omega(\frac{n}{\log_\sigma n} + \occ) time to read the input and report all occurrences. The result is obtained by a novel automaton construction based on the Knuth-Morris-Pratt algorithm combined with a new compact representation of subautomata allowing an optimal tabulation-based simulation.Comment: To appear in Journal of Discrete Algorithms. Special Issue on CPM 200

    Excitable Scale Free Networks

    Full text link
    When a simple excitable system is continuously stimulated by a Poissonian external source, the response function (mean activity versus stimulus rate) generally shows a linear saturating shape. This is experimentally verified in some classes of sensory neurons, which accordingly present a small dynamic range (defined as the interval of stimulus intensity which can be appropriately coded by the mean activity of the excitable element), usually about one or two decades only. The brain, on the other hand, can handle a significantly broader range of stimulus intensity, and a collective phenomenon involving the interaction among excitable neurons has been suggested to account for the enhancement of the dynamic range. Since the role of the pattern of such interactions is still unclear, here we investigate the performance of a scale-free (SF) network topology in this dynamic range problem. Specifically, we study the transfer function of disordered SF networks of excitable Greenberg-Hastings cellular automata. We observe that the dynamic range is maximum when the coupling among the elements is critical, corroborating a general reasoning recently proposed. Although the maximum dynamic range yielded by general SF networks is slightly worse than that of random networks, for special SF networks which lack loops the enhancement of the dynamic range can be dramatic, reaching nearly five decades. In order to understand the role of loops on the transfer function we propose a simple model in which the density of loops in the network can be gradually increased, and show that this is accompanied by a gradual decrease of dynamic range.Comment: 6 pages, 4 figure

    Relativistic theory of elastic deformable astronomical bodies: perturbation equations in rotating spherical coordinates and junction conditions

    Full text link
    In this paper, the dynamical equations and junction conditions at the interface between adjacent layers of different elastic properties for an elastic deformable astronomical body in the first post-Newtonian approximation of Einstein theory of gravity are discussed in both rotating Cartesian coordinates and rotating spherical coordinates. The unperturbed rotating body (the ground state) is described as uniformly rotating, stationary and axisymmetric configuration in an asymptotically flat space-time manifold. Deviations from the equilibrium configuration are described by means of a displacement field. In terms of the formalism of relativistic celestial mechanics developed by Damour, Soffel and Xu, and the framework established by Carter and Quintana the post Newtonian equations of the displacement field and the symmetric trace-free shear tensor are obtained. Corresponding post-Newtonian junction conditions at interfaces also the outer surface boundary conditions are presented. The PN junction condition is an extension of Wahr's one which is a Newtonian junction conditions without rotating.Comment: Revtex4, 14 page
    corecore