Conceptual damage-sensitive features for structural health monitoring: Laboratory and field demonstrations

The use of damage-sensitive features to evaluate structural condition or health is a very critical aspect of structural health monitoring. The purpose of this paper is to investigate the potential of two different damage-sensitive features for detecting damage. Different damage scenarios are simulated on a large-scale laboratory structure and a three-span highway bridge for demonstration. The features presented in this paper are the modal flexibility-based deflection and curvature both of which are obtained directly from dynamic properties. In the literature, flexibility associated with mode shapes and mode shapes curvatures have been mostly explored. In this study, multi-input–multi-output dynamic data are used to obtain modal flexibility, which is a close approximation to the actual flexibility. A main novelty is that the curvature is calculated from the deflected shapes using the modal flexibility as opposed to using modal vectors. In this paper, the theory of the methodology is explained and then experimental studies and results are presented. For the experimental studies, the laboratory specimen and the three-span bridge were gradually damaged. It is shown that both deflection and curvature are conceptual and physically meaningful features for damage detection and localization. The issues and the requirements for these features to perform successfully are also presented.     

Effect of sampling density on the measurement of stream condition indicators in two lowland Australian streams

There is widespread application of indicators to the assessment of environmental condition of streams. These indicators are intended for use by managers in making various comparative and absolute assessments and often have a role in resource allocation and performance assessment. Therefore, the problem of formally defining confidence in the results is important but difficult because the sampling strategies used are commonly based on a compromise between the requirements of statistical rigour and the pragmatic issues of access and resources. It is rare to see this compromise explicitly considered and consequently there is seldom quantification of the uncertainty that could affect the confidence a manager has in an indicator. In this paper, we present a method for quantitatively assessing the tradeoffs between sampling density and uncertainty in meeting various monitoring objectives. Assessments using judgement‐based representative reaches are shown to be unreliable; instead a sampling approach is recommended based on the random selection of measuring sites. A detailed dataset was collected along two streams in Victoria, Australia, and the effect of sampling density was assessed by subsampling from this dataset with precision related to the number of sites assessed per reach length and the intensity of the sampling at each site. The sampling scheme to achieve a given precision is shown to depend on the monitoring objective. In particular, three objectives were considered: (1) making a baseline assessment of current condition; (2) change detection; and (3) detection of a critical threshold in condition. Change detection is shown to be more demanding than assessing baseline condition with additional sampling effort required to achieve the same precision. Sampling to detect a critical threshold depends on nominating acceptable values of Type I and II error and the size of the effect to be detected. Copyright © 2006 John Wiley & Sons, Ltd.     

Dynamic Multicast Session Provisioning in WDM Optical Networks with Sparse Splitting Capability

In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes.     

Analysis of S-SEED''s characteristics in optical switch

This article introduces the basic structure of a symmetric self-electrooptic effect device （S-SEED）, and applies the Kirchoff＇ s current law and a purely equivalent capacitive model, to analyze S-SEED＇s switch characteristics. Linear approximation and N-segment approximation are utilized to obtain S-SEED＇s voltage-time （V-T） and characteristics. Theoretical analysis is verified by simulations, and the results demonstrate that the precision of S-SEED＇s switch time can satisfy the requirement in applications with linear approximation. Moreover, the simulations compare S-SEED＇s switch characteristics with different input powers and input contrast ratios, which reveal that increasing input contrast ratio is an effective way to improve S-SEED＇s switch characteristics.     

高分辨率合成孔径雷达图像舰船检测方法

寻找针对高分辨率SAR图像的舰船目标检测算法。利用KSW双阈值分割技术，其效果比传统检测方法好，有利于进一步的目标分类和识别。且必须根据SAR图像分辨率来选择舰船检测算法。     

Efficient similarity-based operations for data integration

Dealing with discrepancies in data is still a big challenge in data integration systems. The problem occurs both during eliminating duplicates from semantic overlapping sources as well as during combining complementary data from different sources. Though using SQL operations like grouping and join seems to be a viable way, they fail if the attribute values of the potential duplicates or related tuples are not equal but only similar by certain criteria. As a solution to this problem, we present in this paper similarity-based variants of grouping and join operators. The extended grouping operator produces groups of similar tuples, the extended join combines tuples satisfying a given similarity condition. We describe the semantics of this operator, discuss efficient implementations for the edit distance similarity and present evaluation results. Finally, we give examples of application from the context of a data reconciliation project for looted art.     

Cycle detection using a stack

We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix.     

Pedestrian detection and tracking at crossroads

This paper presents a system that can perform pedestrian detection and tracking using vision-based techniques. A very important issue in the field of intelligent transportation system is to prevent pedestrians from being hit by vehicles. Recently, a great number of vision-based techniques have been proposed for this purpose. In this paper, we propose a vision-based method, which combines the use of a pedestrian model as well as the walking rhythm of pedestrians to detect and track walking pedestrians. Through integrating some spatial and temporal information grabbed by a vision system, we are able to develop a reliable system that can be used to prevent traffic accidents happened at crossroads. In addition, the proposed system can deal with the occlusion problem. Experimental results obtained by executing some real world cases have demonstrated that the proposed system is indeed superb.     

An immune oriented multi-agent system for biological image processing

In this article, we present a parallel image processing system based on the concept of reactive agents. Our system lies in the oRis language, which allows to describe finely and simply the agents’ behaviors to detect image features. We also present a method of segmentation using a multi-agent system, and two biological applications made with oRis. The stopping of this multi-agent system is implemented through a technique issued from immunology: the apoptosis.     

Kernel Spectral Matched Filter for Hyperspectral Imagery

In this paper a kernel-based nonlinear spectral matched filter is introduced for target detection in hyperspectral imagery, which is implemented by using the ideas in kernel-based learning theory. A spectral matched filter is defined in a feature space of high dimensionality, which is implicitly generated by a nonlinear mapping associated with a kernel function. A kernel version of the matched filter is derived by expressing the spectral matched filter in terms of the vector dot products form and replacing each dot product with a kernel function using the so called kernel trick property of the Mercer kernels. The proposed kernel spectral matched filter is equivalent to a nonlinear matched filter in the original input space, which is capable of generating nonlinear decision boundaries. The kernel version of the linear spectral matched filter is implemented and simulation results on hyperspectral imagery show that the kernel spectral matched filter outperforms the conventional linear matched filter.