Developing CBTC system safety requirement hierarchy through STPA methodology.

Safety-critical systems, such as the railway signal system, are subject to potentially high costs from failures, including loss of life and property damage. The use of new technology, including communication-based train control (CBTC) systems with software and computers, has changed the types of accidents that occur. Software-related issues and dysfunctional interactions between system components controlled by the software are increasingly the cause of incidents. Developing a "safe" safety-critical system requires accurate and complete safety requirements, which are the foundation of system development. Traditional hazard analysis techniques are insufficient for identifying the causes of accidents in modern railway signaling systems. Systems-Theoretic Process Analysis (STPA) is a powerful new hazard analysis method designed to address these limitations. Building upon this foundation, a hierarchical approach to safety requirement development has been further developed. This approach combines STPA analysis with a hierarchical modeling approach to establish traceability links from safety requirements to specific architectures, refine and allocate system-level safety requirements to relevant subsystems, and abstract safety requirements at higher hierarchical levels to enable easy changes to lower-level implementations. This paper employs the aforementioned methodology within the context of the CBTC system, thereby enhancing risk management and hazard analysis, enabling early insights, and facilitating the generation of safety requirements of CBTC System.

Parallel path detection for fraudulent accounts in banks based on graph analysis.

This article presents a novel parallel path detection algorithm for identifying suspicious fraudulent accounts in large-scale banking transaction graphs. The proposed algorithm is based on a three-step approach that involves constructing a directed graph, shrinking strongly connected components, and using a parallel depth-first search algorithm to mark potentially fraudulent accounts. The algorithm is designed to fully exploit CPU resources and handle large-scale graphs with exponential growth. The performance of the algorithm is evaluated on various datasets and compared with serial time baselines. The results demonstrate that our approach achieves high performance and scalability on multi-core processors, making it a promising solution for detecting suspicious accounts and preventing money laundering schemes in the banking industry. Overall, our work contributes to the ongoing efforts to combat financial fraud and promote financial stability in the banking sector.