skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Brillouin scattering spectrum-based crack measurement using distributed fiber optic sensing
Brillouin scattering-based distributed fiber optic sensing (Brillouin-DFOS) technology is widely used in health monitoring of large-scale structures with the aim to provide early warning of structural degradation and timely maintenance and renewal. Material cracking is one of the key mechanisms that contribute to structural failure. However, the conventional strain measurement using the Brillouin-DFOS system has a decimeter-order spatial resolution, and therefore it is difficult to measure the highly localized strain generated by a sub-millimeter crack. In this study, a new crack analysis method based on Brillouin scattering spectrum (BSS) data is proposed to overcome this spatial resolution-induced measurement limitation. By taking the derivative of the BSS data and tracking their local minimums, the method can extract the maximum strain within the spatial resolution around the measurement points. By comparing the variation of the maximum strain within the spatial resolution around different measurement points along the fiber, cracks can be located. The performance of the method is demonstrated and verified by locating and quantifying a small gap created between two wood boards when one of the wood boards is pushed away from the other. The test result verifies the accuracy of the crack strain quantification of the method and proves its capability to measure a sub-millimeter crack. The method is also applied to a thin bonded concrete overlay of asphalt pavement field experiment, in which the growth of a transverse joint penetrating through the concrete–asphalt interface was monitored. The method successfully locates the position, traces the strain variation, and estimates the width of a crack less than [Formula: see text] wide using a Brillouin-DFOS system with [Formula: see text] spatial resolution.  more » « less
Award ID(s):
1741042
PAR ID:
10303822
Author(s) / Creator(s):
 ;  ;  
Date Published:
Journal Name:
Structural Health Monitoring
ISSN:
1475-9217
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, Structural Health Monitoring)
    Material cracking is one of the key mechanisms contributing to structural failure. Distributed fiber optic sensing (DFOS) can measure the strain profile along optical fiber distributively. However, the conventional strain measurement using a Brillouin-DFOS system (Brillouin optical time-domain analysis/reflectometry (BOTDA/R)) has a decimeter-order spatial resolution, making it difficult to measure the highly localized strain generated by a sub-millimeter crack. This paper introduces a crack analysis method based on decomposing the Brillouin scattering spectrum to overcome the spatial resolution induced crack measurement limitation of the BOTDA/R system. The method uses the non-negative least squares algorithm to back-calculate the strain profile within the spatial resolution around each measurement point. The performance of this method is verified by a four point bending test of a brittle slag cement-cement-bentonite beam. The crack width estimation error is improved to ±0.005 mm for a crack as narrow as 0.76 mm. 
    more » « less
  2. ; (, International Journal of Computational Geometry & Applications)
    We study the problem of covering barrier points by mobile sensors. Each sensor is represented by a point in the plane with the same covering range [Formula: see text] so that any point within distance [Formula: see text] from the sensor can be covered by the sensor. Given a set [Formula: see text] of [Formula: see text] points (called “barrier points”) and a set [Formula: see text] of [Formula: see text] points (representing the “sensors”) in the plane, the problem is to move the sensors so that each barrier point is covered by at least one sensor and the maximum movement of all sensors is minimized. The problem is NP-hard. In this paper, we consider two line-constrained variations of the problem and present efficient algorithms that improve the previous work. In the first problem, all sensors are given on a line [Formula: see text] and are required to move on [Formula: see text] only while the barrier points can be anywhere in the plane. We propose an [Formula: see text] time algorithm for the problem. We also consider the weighted case where each sensor has a weight; we give an [Formula: see text] time algorithm for this case. In the second problem, all barrier points are on [Formula: see text] while all sensors are in the plane but are required to move onto [Formula: see text] to cover all barrier points. We also solve the weighted case in [Formula: see text] time. 
    more » « less
  3. ; ; ; ; ; (, Reviews in Mathematical Physics)
    We consider how the outputs of the Kadison transitivity theorem and Gelfand–Naimark–Segal (GNS) construction may be obtained in families when the initial data are varied. More precisely, for the Kadison transitivity theorem, we prove that for any nonzero irreducible representation [Formula: see text] of a [Formula: see text]-algebra [Formula: see text] and [Formula: see text], there exists a continuous function [Formula: see text] such that [Formula: see text] for all [Formula: see text], where [Formula: see text] is the set of pairs of [Formula: see text]-tuples [Formula: see text] such that the components of [Formula: see text] are linearly independent. Versions of this result where [Formula: see text] maps into the self-adjoint or unitary elements of [Formula: see text] are also presented. Regarding the GNS construction, we prove that given a topological [Formula: see text]-algebra fiber bundle [Formula: see text], one may construct a topological fiber bundle [Formula: see text] whose fiber over [Formula: see text] is the space of pure states of [Formula: see text] (with the norm topology), as well as bundles [Formula: see text] and [Formula: see text] whose fibers [Formula: see text] and [Formula: see text] over [Formula: see text] are the GNS Hilbert space and closed left ideal, respectively, corresponding to [Formula: see text]. When [Formula: see text] is a smooth fiber bundle, we show that [Formula: see text] and [Formula: see text] are also smooth fiber bundles; this involves proving that the group of ∗-automorphisms of a [Formula: see text]-algebra is a Banach Lie group. In service of these results, we review the topology and geometry of the pure state space. A simple non-interacting quantum spin system is provided as an example illustrating the physical meaning of some of these results. 
    more » « less
  4. ; ; (, Asia-Pacific Journal of Operational Research)
    Let [Formula: see text] be a directed graph associated with a weight [Formula: see text]. For an edge-cut [Formula: see text] of [Formula: see text], the average weight of [Formula: see text] is denoted and defined as [Formula: see text]. An optimal edge-cut with average weight is an edge-cut [Formula: see text] such that [Formula: see text] is maximum among all edge-cuts (or minimum, symmetrically). In this paper, a polynomial algorithm for this problem is proposed for finding an optimal edge-cut in a rooted tree separating the root and the set of all leafs. This algorithm enables us to develop an automatic clustering method with more accurate detection of community output. 
    more » « less
  5. ; ; (, Journal of Topology and Analysis)
    Locally trivial bundles of [Formula: see text]-algebras with fiber [Formula: see text] for a strongly self-absorbing [Formula: see text]-algebra [Formula: see text] over a finite CW-complex [Formula: see text] form a group [Formula: see text] that is the first group of a cohomology theory [Formula: see text]. In this paper, we compute these groups by expressing them in terms of ordinary cohomology and connective [Formula: see text]-theory. To compare the [Formula: see text]-algebraic version of [Formula: see text] with its classical counterpart we also develop a uniqueness result for the unit spectrum of complex periodic topological [Formula: see text]-theory. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email