1,640 research outputs found

    The inverse electromagnetic scattering problem in a piecewise homogeneous medium

    Full text link
    This paper is concerned with the problem of scattering of time-harmonic electromagnetic waves from an impenetrable obstacle in a piecewise homogeneous medium. The well-posedness of the direct problem is established, employing the integral equation method. Inspired by a novel idea developed by Hahner [11], we prove that the penetrable interface between layers can be uniquely determined from a knowledge of the electric far field pattern for incident plane waves. Then, using the idea developed by Liu and Zhang [21], a new mixed reciprocity relation is obtained and used to show that the impenetrable obstacle with its physical property can also be recovered. Note that the wave numbers in the corresponding medium may be different and therefore this work can be considered as a generalization of the uniqueness result of [20].Comment: 19 pages, 2 figures, submitted for publicatio

    "Oxide-free" tip for scanning tunneling microscopy

    Get PDF
    We report a new tip for scanning tunneling microscopy and a tip repair procedure that allows one to reproducibly obtain atomic images of highly oriented pyrolytic graphite with previously inoperable tips. The tips are shown to be relatively oxide-free and highly resistant to oxidation. The tips are fabricated with graphite by two distinct methods

    Convergence and Stability of the Inverse Scattering Series for Diffuse Waves

    Full text link
    We analyze the inverse scattering series for diffuse waves in random media. In previous work the inverse series was used to develop fast, direct image reconstruction algorithms in optical tomography. Here we characterize the convergence, stability and approximation error of the serie

    On the Convergence of the Born Series in Optical Tomography with Diffuse Light

    Full text link
    We provide a simple sufficient condition for convergence of Born series in the forward problem of optical diffusion tomography. The condition does not depend on the shape or spatial extent of the inhomogeneity but only on its amplitude.Comment: 23 pages, 7 figures, submitted to Inverse Problem

    Confidentiality and public protection: ethical dilemmas in qualitative research with adult male sex offenders

    Get PDF
    This paper considers the ethical tensions present when engaging in in-depth interviews with convicted sex offenders. Many of the issues described below are similar to those found in other sensitive areas of research. However, confidentiality and public protection are matters that require detailed consideration when the desire to know more about men who have committed serious and harmful offences is set against the possibility of a researcher not disclosing previously unknown sensitive information that relates to the risk of someone being harmed.</p

    Suffix Tree of Alignment: An Efficient Index for Similar Data

    Full text link
    We consider an index data structure for similar strings. The generalized suffix tree can be a solution for this. The generalized suffix tree of two strings AA and BB is a compacted trie representing all suffixes in AA and BB. It has āˆ£Aāˆ£+āˆ£Bāˆ£|A|+|B| leaves and can be constructed in O(āˆ£Aāˆ£+āˆ£Bāˆ£)O(|A|+|B|) time. However, if the two strings are similar, the generalized suffix tree is not efficient because it does not exploit the similarity which is usually represented as an alignment of AA and BB. In this paper we propose a space/time-efficient suffix tree of alignment which wisely exploits the similarity in an alignment. Our suffix tree for an alignment of AA and BB has āˆ£Aāˆ£+ld+l1|A| + l_d + l_1 leaves where ldl_d is the sum of the lengths of all parts of BB different from AA and l1l_1 is the sum of the lengths of some common parts of AA and BB. We did not compromise the pattern search to reduce the space. Our suffix tree can be searched for a pattern PP in O(āˆ£Pāˆ£+occ)O(|P|+occ) time where occocc is the number of occurrences of PP in AA and BB. We also present an efficient algorithm to construct the suffix tree of alignment. When the suffix tree is constructed from scratch, the algorithm requires O(āˆ£Aāˆ£+ld+l1+l2)O(|A| + l_d + l_1 + l_2) time where l2l_2 is the sum of the lengths of other common substrings of AA and BB. When the suffix tree of AA is already given, it requires O(ld+l1+l2)O(l_d + l_1 + l_2) time.Comment: 12 page

    Resonance regimes of scattering by small bodies with impedance boundary conditions

    Full text link
    The paper concerns scattering of plane waves by a bounded obstacle with complex valued impedance boundary conditions. We study the spectrum of the Neumann-to-Dirichlet operator for small wave numbers and long wave asymptotic behavior of the solutions of the scattering problem. The study includes the case when k=0k=0 is an eigenvalue or a resonance. The transformation from the impedance to the Dirichlet boundary condition as impedance grows is described. A relation between poles and zeroes of the scattering matrix in the non-self adjoint case is established. The results are applied to a problem of scattering by an obstacle with a springy coating. The paper describes the dependence of the impedance on the properties of the material, that is on forces due to the deviation of the boundary of the obstacle from the equilibrium position
    • ā€¦
    corecore