Search

Taiwan that is located at the junction of the Eurasian Plate and the Philippine Sea Plate is one of the most active seismic zones in the world. Devastating earthquakes have occurred around the island and have caused severe damages from time to time. To avoid the severe loss, earthquake early warning (EEW) is of great importance, and one of the most critical issues of EEW is fast and reliable detection for the presence of earthquakes. Traditional methods for earthquake detection usually use criterion-based algorithms to detect the onset of the earthquake waves. Currently, the thresholds for those criteria are usually decided empirically and may result in excessive false alarms. Obviously, false alarms can cause undue panics and diminish the credibility of the system. In this article, the recurrent neural network (RNN) models are adopted to develop a real-time EEW system. The developed system is designed to identify the occurrence of an earthquake event, and the duration of the P-wave and the S-wave. It was trained and tested using the seismograms recorded in Taiwan from 2016 to 2017. From the simulation results, the proposed scheme outperforms the traditional criterion-based schemes in terms of detection accuracy and processing time. [ABSTRACT FROM AUTHOR]

Earthquake early warning system uses high-speed computer network to transmit earthquake information to population center ahead of the arrival of destructive earthquake waves. This short (10 s of seconds) lead time will allow emergency responses such as turning off gas pipeline valves to be activated to mitigate potential disaster and casualties. However, the excessive false alarm rate of such a system imposes heavy cost in terms of loss of services, undue panics, and diminishing credibility of such a warning system. At the current, the decision algorithm to issue an early warning of the onset of an earthquake is often based on empirically chosen features and heuristically set thresholds and suffers from excessive false alarm rate. In this paper, we experimented with three advanced machine learning algorithms, namely, $K$ -nearest neighbor (KNN), classification tree, and support vector machine (SVM) and compared their performance against a traditional criterion-based method. Using the seismic data collected by an experimental strong motion detection network in Taiwan for these experiments, we observed that the machine learning algorithms exhibit higher detection accuracy with much reduced false alarm rate. [ABSTRACT FROM AUTHOR]

Target detection is one of the most important topics in wireless sensor networks. Many studies in the literature have addressed the problem of evaluating the performance of a sensor network based on detection probability. However, it is difficult to guarantee detection probability in a sensor network since it depends on the topology of the sensor deployment and the location of the target. A sensor network without a careful sensor location arrangement may experience very low detection probability. This paper integrates collaborative fusion and sequential detection to guarantee the quality of the decisions made by a sensor network and analytically derives the average detection latency based on value fusion and decision fusion. Specifically, sensors periodically report their local measurements or decisions to a fusion center. The fusion center makes final decisions only when both the pre-defined false alarm probability and missing probability are satisfied. Otherwise, it will continue to collect data and repeat the decision making operations. Simple and elegant detection rules are provided for the collaborative sequential detection operations. Extensive simulations are conducted to show the performance of a sensor network in terms of detection latency. The correctness of the analytical results for detection latency is also verified by simulations. [ABSTRACT FROM AUTHOR]

Developing on-site earthquake early warning systems has been a challenging problem because of time limitations and the amount of information that can be collected before the warning needs to be issued. A potential solution that could prevent severe disasters is to predict the potential strong motion using the initial P-wave signal and provide warnings before serious ground shaking starts. In practice, the accuracy of prediction is the most critical issue for earthquake early warning systems. Traditional methods use certain criteria, selected through intuition or experience, to make the prediction. However, the criteria thresholds are difficult to select and may significantly affect the prediction accuracy. This paper investigates methods based on artificial intelligence for predicting the greatest earthquake ground motion early, when the P-wave arrives at seismograph stations. A neural network model is built to make the predictions using a small window of the initial P-wave acceleration signal. The model is trained by seismic waves collected from 1991 to 2019 in Taiwan and is evaluated by events in 2020 and 2021. From these evaluations, the proposed scheme significantly outperforms the threshold-based method in terms of its accuracy and average leading time. [ABSTRACT FROM AUTHOR]

The earthquake early warning (EEW) system is difficult to provide consistent magnitude estimate in the early stage of an earthquake occurrence because only few stations are triggered and few seismic signals are recorded. One of the feasible methods to measure the size of earthquakes is to extract amplitude parameters using the initial portion of the recorded waveforms after P-wave arrival. However, for a large-magnitude earthquake (M w > 7.0), the time to complete the whole ruptures resulted from the corresponding fault may be very long. The magnitude estimations may not be correctly predicted by the initial portion of the seismograms. To estimate the magnitude of a large earthquake in real-time, the amplitude parameters should be updated with ongoing waveforms instead of adopting amplitude contents in a predefined fixed-length time window, since it may underestimate magnitude for large-magnitude events. In this paper, we propose a fast, robust and less-saturated approach to estimate earthquake magnitudes. The EEW system will initially give a lower-bound of the magnitude in a time window with a few seconds and then update magnitude with less saturation by extending the time window. Here we compared two kinds of time windows for measuring amplitudes. One is P-wave time window (PTW) after P-wave arrival; the other is whole-wave time window after P-wave arrival (WTW), which may include both P and S wave. One to ten second time windows for both PTW and WTW are considered to measure the peak ground displacement from the vertical component of the waveforms. Linear regression analysis are run at each time step (1- to 10-s time interval) to find the empirical relationships among peak ground displacement, hypocentral distances, and magnitudes using the earthquake records from 1993 to 2012 in Taiwan with magnitude greater than 5.5 and focal depth less than 30 km. The result shows that considering WTW to estimate magnitudes has smaller standard deviation than PTW. The magnitude estimations using 1-s time widow have larger uncertainties. Progressively adopting peak displacement amplitudes (P d ) from 2- to 10-s WTW is suggested for EEW systems. [ABSTRACT FROM AUTHOR]

Group services are highly important for a variety of computing application domains. In this paper, we study the fundamental problem of allocating a set of service patrons to a set of service groups in an attempt to maximize the total profit gained by the grouping platform. The problem under consideration is unique in that group service is not provided at all unless its lower bound requirement is satisfied. In addition, we allow each service patron to join multiple groups. In this paper, after proving the hardness property of the problem, we focus first on a special case of the problem. To this end, we propose two approaches. One aims at providing a suboptimal solution using a 1/2-approximation algorithm. The other approach turns to seeking an optimal solution using a branch and bound technique. For this purpose, we introduce a theorem that captures a useful property of an optimal allocation. Based on this theorem, we design an efficient branch and bound algorithm to find an optimal solution. We then extend these methods to solve the general problem. Extensive experiments show that our branch and bound algorithm is able to obtain an optimal solution with a small amount of computation time in many different settings. [ABSTRACT FROM PUBLISHER]

This work considers data query applications in tree-structured networks, where a given set of source nodes generate (or collect) data and forward the data to some halfway storage nodes for satisfying queries that call for data generated by all source nodes. The goal is to determine an optimal set of storage nodes that minimizes overall communication cost. Prior work toward this problem assumed homogeneous channel cost, which may not be the case in many network environments. We generalize the optimal storage problem for a tree-structured network by considering heterogeneous channel costs. The necessary and sufficient conditions for the optimal solution are identified, and an algorithm that incurs a linear time cost is proposed. We have also conducted extensive simulations to validate the algorithm and to evaluate its performance. [ABSTRACT FROM AUTHOR]