Memory Constraints Research Articles

Collective effect of self-learning and social learning on language dynamics: a naming game approach in social networks.

Linguistic rules form the cornerstone of human communication, enabling people to understand and interact with one another effectively. However, there are always irregular exceptions to regular rules, with one of the most notable being the past tense of verbs in English. In this work, a naming game approach is developed to investigate the collective effect of social behaviours on language dynamics, which encompasses social learning, self-learning with preference and forgetting due to memory constraints. Two features that pertain to individuals' influential ability and affinity are introduced to assess an individual's role of social influence and discount the information they communicate in the Bayesian inference-based social learning model. Our findings suggest that network heterogeneity and community structure significantly impact language dynamics, as evidenced in synthetic and real-world networks. Furthermore, self-learning significantly enhances the process of language regularization, while forgetting has a relatively minor impact. The results highlight the substantial influence of network structure and social behaviours on the transition of opinions, from consensus to polarization, demonstrating its importance in language dynamics. This work sheds new light on how individual learners adopt language rules through the lenses of complexity science and decision science, advancing our understanding of language dynamics.

An Entropy-Based Clustering Algorithm for Real-Time High-Dimensional IoT Data Streams.

The rapid growth of data streams, propelled by the proliferation of sensors and Internet of Things (IoT) devices, presents significant challenges for real-time clustering of high-dimensional data. Traditional clustering algorithms struggle with high dimensionality, memory and time constraints, and adapting to dynamically evolving data. Existing dimensionality reduction methods often neglect feature ranking, leading to suboptimal clustering performance. To address these issues, we introduce E-Stream, a novel entropy-based clustering algorithm for high-dimensional data streams. E-Stream performs real-time feature ranking based on entropy within a sliding time window to identify the most informative features, which are then utilized with the DenStream algorithm for efficient clustering. We evaluated E-Stream using the NSL-KDD dataset, comparing it against DenStream, CluStream, and MR-Stream. The evaluation metrics included the average F-Measure, Jaccard Index, Fowlkes-Mallows Index, Purity, and Rand Index. The results show that E-Stream outperformed the baseline algorithms in both clustering accuracy and computational efficiency while effectively reducing dimensionality. E-Stream also demonstrated significantly less memory consumption and fewer computational requirements, highlighting its suitability for real-time processing of high-dimensional data streams. Despite its strengths, E-Stream requires manual parameter adjustment and assumes a consistent number of active features, which may limit its adaptability to diverse datasets. Future work will focus on developing a fully autonomous, parameter-free version of the algorithm, incorporating mechanisms to handle missing features and improving the management of evolving clusters to enhance robustness and adaptability in dynamic IoT environments.

Dual attention model with reinforcement learning for classification of histology whole-slide images

Digital whole slide images (WSIs) are generally captured at microscopic resolution and encompass extensive spatial data (several billions of pixels per image). Directly feeding these images to deep learning models is computationally intractable due to memory constraints, while downsampling the WSIs risks incurring information loss. Alternatively, splitting the WSIs into smaller patches (or tiles) may result in a loss of important contextual information. In this paper, we propose a novel dual attention approach, consisting of two main components, both inspired by the visual examination process of a pathologist: The first soft attention model processes a low magnification view of the WSI to identify relevant regions of interest (ROIs), followed by a custom sampling method to extract diverse and spatially distinct image tiles from the selected ROIs. The second component, the hard attention classification model further extracts a sequence of multi-resolution glimpses from each tile for classification. Since hard attention is non-differentiable, we train this component using reinforcement learning to predict the location of the glimpses. This approach allows the model to focus on essential regions instead of processing the entire tile, thereby aligning with a pathologist’s way of diagnosis. The two components are trained in an end-to-end fashion using a joint loss function to demonstrate the efficacy of the model. The proposed model was evaluated on two WSI-level classification problems: Human epidermal growth factor receptor 2 (HER2) scoring on breast cancer histology images and prediction of Intact/Loss status of two Mismatch Repair (MMR) biomarkers from colorectal cancer histology images. We show that the proposed model achieves performance better than or comparable to the state-of-the-art methods while processing less than 10% of the WSI at the highest magnification and reducing the time required to infer the WSI-level label by more than 75%. The code is available at github.

ATP: Achieving Throughput Peak for DNN Training via Smart GPU Memory Management

Due to the limited GPU memory, the performance of large DNNs training is constrained by the unscalable batch size. Existing researches partially address the issue of GPU memory limit through tensor recomputation and swapping, but overlook the exploration of optimal performance. In response, we propose ATP, a recomputation and swapping based GPU memory management framework that aims to maximize training performance by breaking GPU memory constraints. ATP utilizes a throughput model we proposed to evaluate the theoretical peak performance achievable by DNN training on GPU, and provide the optimum memory size required for recomputation and swapping. We optimize the mechanisms for GPU memory pool and CUDA stream control, employs an optimization method to search for specific tensors requiring recomputation and swapping, thereby bringing the actual DNN training performance on ATP closer to theoretical values. Evaluations with different types of large DNN models indicate that ATP achieve throughput improvements ranging from 1.14 ∼ 1.49 ×, while support model training exceeding the GPU memory limit by up to 9.2 ×.

Enhancing Cover Management Factor Classification Through Imbalanced Data Resolution

This study addresses the persistent challenge of class imbalance in land use and land cover (LULC) classification within the Shihmen Reservoir watershed in Taiwan, where LULC is used to map the Cover Management factor (C-factor). The dominance of forests in the LULC categories leads to an imbalanced dataset, resulting in poor prediction performance for minority classes when using machine learning techniques. To overcome this limitation, we applied the Synthetic Minority Over-sampling Technique (SMOTE) and the 90-model SMOTE-variants package in Python to balance the dataset. Due to the multi-class nature of the data and memory constraints, 42 models were successfully used to create a balanced dataset, which was then integrated with a Random Forest algorithm for C-factor classification. The results show a marked improvement in model accuracy across most SMOTE variants, with the Selected Synthetic Minority Over-sampling Technique (Selected_SMOTE) emerging as the best-performing method, achieving an overall accuracy of 0.9524 and a sensitivity of 0.6892. Importantly, the previously observed issue of poor minority class prediction was resolved using the balanced dataset. This study provides a robust solution to the class imbalance issue in C-factor classification, demonstrating the effectiveness of SMOTE variants and the Random Forest algorithm in improving model performance and addressing imbalanced class distributions. The success of Selected_SMOTE underscores the potential of balanced datasets in enhancing machine learning outcomes, particularly in datasets dominated by a majority class. Additionally, by addressing imbalance in LULC classification, this research contributes to Sustainable Development Goal 15, which focuses on the protection, restoration, and sustainable use of terrestrial ecosystems.

Lightweight and Low-Parametric Network for Hardware Inference of Obstructive Sleep Apnea.

Background: Obstructive sleep apnea is a sleep disorder that is linked to many health complications and can even be lethal in its severe form. Overnight polysomnography is the gold standard for diagnosing apnea, which is expensive, time-consuming, and requires manual analysis by a sleep expert. Artificial intelligence (AI)-embedded wearable device as a portable and less intrusive monitoring system is a highly desired alternative to polysomnography. However, AI models often require substantial storage capacity and computational power for edge inference which makes it a challenging task to implement the models in hardware with memory and power constraints. Methods: This study demonstrates the implementation of depth-wise separable convolution (DSC) as a resource-efficient alternative to spatial convolution (SC) for real-time detection of apneic activity. Single lead electrocardiogram (ECG) and oxygen saturation (SpO2) signals were acquired from the PhysioNet databank. Using each type of convolution, three different models were developed using ECG, SpO2, and model fusion. For both types of convolutions, the fusion models outperformed the models built on individual signals across all the performance metrics. Results: Although the SC-based fusion model performed the best, the DSC-based fusion model was 9.4, 1.85, and 11.3 times more energy efficient than SC-based ECG, SpO2, and fusion models, respectively. Furthermore, the accuracy, precision, and specificity yielded by the DSC-based fusion model were comparable to those of the SC-based individual models (~95%, ~94%, and ~94%, respectively). Conclusions: DSC is commonly used in mobile vision tasks, but its potential in clinical applications for 1-D signals remains unexplored. While SC-based models outperform DSC in accuracy, the DSC-based model offers a more energy-efficient solution with acceptable performance, making it suitable for AI-embedded apnea detection systems.

MemoriaNova: Optimizing Memory-Aware Model Inference for Edge Computing

In recent years, deploying deep learning models on edge devices has become pervasive, driven by the increasing demand for intelligent edge computing solutions across various industries. From industrial automation to intelligent surveillance and healthcare, edge devices are being leveraged for real-time analytics and decision-making. Existing methods face two challenges when deploying machine learning models on edge devices. The first challenge is handling the execution order of operators with a simple strategy, which can lead to a potential waste of memory resources when dealing with directed acyclic graph structure models. The second challenge is that they usually process operators of a model one by one to optimize the inference latency, which may lead to the optimization problem getting trapped in local optima. We present MemoriaNova, comprising BTSearch and GenEFlow, to solve these two problems. BTSearch is a graph state backtracking algorithm with efficient pruning and hashing strategies designed to minimize memory overhead during inference and enlarge latency optimization search space. GenEFlow, based on genetic algorithms, integrates latency modeling and memory constraints to optimize distributed inference latency. This innovative approach considers a comprehensive search space for model partitioning, ensuring robust and adaptable solutions. We implement BTSearch and GenEFlow and test them on eleven deep-learning models with different structures and scales. The results show that BTSearch can reach 12% memory optimization compared with the widely used random execution strategy. At the same time, GenEFlow reduces inference latency by 33.9% in distributed systems with four-edge devices.

Benchmarking In-Sensor Machine Learning Computing: An Extension to the MLCommons-Tiny Suite

This paper proposes a new benchmark specifically designed for in-sensor digital machine learning computing to meet an ultra-low embedded memory requirement. With the exponential growth of edge devices, efficient local processing is essential to mitigate economic costs, latency, and privacy concerns associated with the centralized cloud processing. Emerging intelligent sensors equipped with computing assets to run neural network inferences and embedded in the same package, which hosts the sensing elements, present new challenges due to their limited memory resources and computational skills. This benchmark evaluates models trained with Quantization Aware Training (QAT) and compares their performance with Post-Training Quantization (PTQ) across three use cases: Human Activity Recognition (HAR) by means of the SHL dataset, Physical Activity Monitoring (PAM) by means of the PAMAP2 dataset, and superficial electromyography (sEMG) regression with the NINAPRO DB8 dataset. The results demonstrate the effectiveness of QAT over PTQ in most scenarios, highlighting the potential for deploying advanced AI models on highly resource-constrained sensors. The INT8 versions of the models always outperformed their FP32, regarding memory and latency reductions, except for the activations for CNN. The CNN model exhibited reduced memory usage and latency with respect to its Dense counterpart, allowing it to meet the stringent 8KiB data RAM and 32 KiB program RAM limits of the ISPU. The TCN model proved to be too large to fit within the memory constraints of the ISPU, primarily due to its greater capacity in terms of number of parameters, designed for processing more complex signals like EMG. This benchmark aims to guide the development of efficient AI solutions for In-Sensor Machine Learning Computing, fostering innovation in the field of Edge AI benchmarking, such as the one conducted by the MLCommons-Tiny working group.

Using the Discrete Wavelet Transform for Lossy On‐the‐Fly Compression of GPU Fluid Simulations

ABSTRACTHigh‐performance computing in fluid dynamics frequently confronts substantial memory demands, especially in large‐scale applications. Data compression techniques can alleviate these memory constraints, but introduce new challenges. This paper introduces an innovative on‐the‐fly low‐overhead lossy compression technique tailored for GPU‐based fluid simulations, utilizing the discrete wavelet transform (DWT). The technique is applicable to any numerical scheme where the data is stored on a regular grid and the time step is computed using a stencil. Our approach significantly diminishes memory requirements, achieving up to a 10‐fold long‐term reduction on a D3Q27 simulation, while minimally impacting the simulation accuracy. The methodology is built around careful design choices to achieve a satisfactory compression ratio/speed trade‐off. It effectively maintains mass conservation and accurately preserves essential discontinuities in simulations. Extensive testing with a D3Q27 Lattice‐Boltzmann method (LBM) simulation on a single GPU has shown that large‐scale grids can be processed with minimal impact on the simulation accuracy and acceptable compression times. This compression technique demonstrates a robust capability to handle memory limitations in fluid simulations, opening the door to more complex and larger‐scale simulations.

CLOUDSPAM: Contrastive Learning On Unlabeled Data for Segmentation and Pre-Training Using Aggregated Point Clouds and MoCo

SegContrast TEST paved the way for contrastive learning on outdoor point clouds. Its original formulation targeted individual scans in applications like autonomous driving and object detection. However, mobile mapping purposes such as digital twin cities and urban planning require large-scale dense datasets to capture the full complexity and diversity present in outdoor environments. In this paper, the SegContrast method is revisited and adapted to overcome its limitations associated with mobile mapping datasets, namely the scarcity of contrastive pairs and memory constraints. To overcome the scarcity of contrastive pairs, we propose the merging of heterogeneous datasets. However, this merging is not a straightforward procedure due to the variety of size and number of points in the point clouds of these datasets. Therefore, a data augmentation approach is designed to create a vast number of segments while optimizing the size of the point cloud samples to the allocated memory. This methodology, called CLOUDSPAM, guarantees the performance of the self-supervised model for both small- and large-scale mobile mapping point clouds. Overall, the results demonstrate the benefits of utilizing datasets with a wide range of densities and class diversity. CLOUDSPAM matched the state of the art on the KITTI-360 dataset, with a 63.6% mIoU, and came in second place on the Toronto-3D dataset. Finally, CLOUDSPAM achieved competitive results against its fully supervised counterpart with only 10% of labeled data.

Visual Lock - Enhancing Security with Visual Password

The prevailing method of user authentication commonly involves the submission of a text-based password along with a username. However, this approach has inherent drawbacks that have been widely acknowledged. A significant challenge is the difficulty users face in remembering passwords, leading to the adoption of short and simplistic ones, which in turn renders them susceptible to easy guessing or hacking. To address these concerns, this article introduces a novel financial graphical password authentication system. The operational details are elucidated through real-world examples, emphasizing key features of the system. In response to the limitations of conventional text-based password authentication, a groundbreaking financial graphical password method is proposed in this article. The prevailing issue of users resorting to short and easily guessable passwords due to memory constraints is addressed through this innovative approach. The article not only explains the functioning of the new system using real-world instances but also underscores its crucial features that enhance security in user authentication

Accelerating the clean-SC and CMF beamforming deconvolution methods using neural gridcompression

Deconvolution algorithms can considerably improve the spatial resolution of sound sources when applied to beamforming techniques. However, they are often associated with additional computation time, which can be prohibitive for real-time applications, especially when using high-resolution scanning grids. Additionally, depending on the size of the problem, full deconvolution may not even be possible due to memory constraints. Recently, it has been shown that a neural network approach to compress the possible source directions can speed up the results of the DAMAS deconvolution algorithm by orders of magnitude. In this paper, this neural grid compression preprocessing is evaluated for the CLEAN-SC and CMF deconvolution techniques, and it is shown that it is possible to achieve dramatic speedups without significant loss of accuracy and even improve the results in some examples, especially for the CLEAN-SC technique.

Lightweight medical image segmentation network with multi-scale feature-guided fusion

In the field of computer-aided medical diagnosis, it is crucial to adapt medical image segmentation to limited computing resources. There is tremendous value in developing accurate, real-time vision processing models that require minimal computational resources. When building lightweight models, there is always a trade-off between computational cost and segmentation performance. Performance often suffers when applying models to meet resource-constrained scenarios characterized by computation, memory, or storage constraints. This remains an ongoing challenge. This paper proposes a lightweight network for medical image segmentation. It introduces a lightweight transformer, proposes a simplified core feature extraction network to capture more semantic information, and builds a multi-scale feature interaction guidance framework. The fusion module embedded in this framework is designed to address spatial and channel complexities. Through the multi-scale feature interaction guidance framework and fusion module, the proposed network achieves robust semantic information extraction from low-resolution feature maps and rich spatial information retrieval from high-resolution feature maps while ensuring segmentation performance. This significantly reduces the parameter requirements for maintaining deep features within the network, resulting in faster inference and reduced floating-point operations (FLOPs) and parameter counts. Experimental results on ISIC2017 and ISIC2018 datasets confirm the effectiveness of the proposed network in medical image segmentation tasks. For instance, on the ISIC2017 dataset, the proposed network achieved a segmentation accuracy of 82.33 % mIoU, and a speed of 71.26 FPS on 256 × 256 images using a GeForce GTX 3090 GPU. Furthermore, the proposed network is tremendously lightweight, containing only 0.524M parameters. The corresponding source codes are available at https://github.com/CurbUni/LMIS-lightweight-network.

Efficient time series adaptive representation learning via Dynamic Routing Sparse Attention

Time series prediction plays a crucial role in various fields but also faces significant challenges. Converting original 1D time series data into 2D data through dimension transformation allows capturing more hidden features but incurs high memory consumption and low time efficiency. We have designed a sparse attention mechanism with dynamic routing perception called Dynamic Routing Sparse Attention (DRSA) to address these issues. Specifically, DRSA can effectively handle variations of complex time series data. Meanwhile, under memory constraints, the Dynamic Routing Filter (DRF) module further refines it by filtering the blocked 2D time series data to identify the most relevant feature vectors in the local context. We conducted predictive experiments on six real-world time series datasets with fine granularity and long sequence dependencies. Compared to eight state-of-the-art (SOTA) models, DRSA demonstrated relative improvements ranging from 4.18% to 81.02%. Furthermore, its time efficiency is 2 to 5 times higher than the baseline. Our code and dataset will be available at https://github.com/wwy8/DRSA_main.

Learning-Augmented Sketching Offers Improved Performance for Privacy Preserving and Secure GWAS.

The introduction of trusted execution environments (TEEs), such as secure enclaves provided by the Intel SGX technology has enabled secure and privacy-preserving computation on the cloud. The stringent resource limitations, such as memory constraints, required by some TEEs necessitates the development of computational approaches with reduced memory usage, such as sketching. One example is the SkSES method for GWAS on a cohort of case and control samples from multiple institutions, which identifies the most significant SNPs in a privacy-preserving manner without disclosing sensitive genotype information to other institutions or the cloud service provider. Here we show how to improve the performance of SkSES on large datasets by augmenting it with a learning-augmented approach. Specifically, we show how individual institutions can perform smaller scale GWAS on their own datasets and identify two sets of variants according to certain criteria, which are then used to guide the sketching process to more accurately identify significant variants over the collective dataset. The new method achieves up to 40% accuracy gain compared to the original SkSES method under the same memory constraints on datasets we tested on. The code is available at https://github.com/alreadydone/sgx-genome-variants-search.

Lossy Image Compression with Stochastic Quantization

Introduction. Lossy image compression algorithms play a crucial role in various domains, including graphics, and image processing. As image information density increases, so do the resources required for processing and transmission. One of the most prominent approaches to address this challenge is color quantization, proposed by Orchard et al. (1991). This technique optimally maps each pixel of an image to a color from a limited palette, maintaining image resolution while significantly reducing information content. Color quantization can be interpreted as a clustering problem (Krishna et al. (1997), Wan (2019)), where image pixels are represented in a three-dimensional space, with each axis corresponding to the intensity of an RGB channel. The purpose of the paper. Scaling of traditional algorithms like K-Means can be challenging for large data, such as modern images with millions of colors. This paper reframes color quantization as a three-dimensional stochastic transportation problem between the set of image pixels and an optimal color palette, where the number of colors is a predefined hyperparameter. We employ Stochastic Quantization (SQ) with a seeding technique proposed by Arthur et al. (2007) to enhance the scalability of color quantization. This method introduces a probabilistic element to the quantization process, potentially improving efficiency and adaptability to diverse image characteristics. Results. To demonstrate the efficiency of our approach, we present experimental results using images from the ImageNet dataset. These experiments illustrate the performance of our Stochastic Quantization method in terms of compression quality, computational efficiency, and scalability compared to traditional color quantization techniques. Conclusions. This study introduces a scalable algorithm for solving the color quantization problem without memory constraints, demonstrating its efficiency on a subset of images from the ImageNet dataset. The convergence speed of the algorithm can be further enhanced by modifying the update rule with alternative methods to Stochastic Gradient Descent (SGD) that incorporate adaptive learning rates. Moreover, the stochastic nature of the proposed solution enables the utilization of parallelization techniques to simultaneously update the positions of multiple quants, potentially leading to significant performance improvements. This aspect of parallelization and its impact on algorithm efficiency presents a topic for future research. The proposed method not only addresses the limitations of existing color quantization techniques but also opens up new possibilities for optimizing image compression algorithms in resource-constrained environments. Keywords: non-convex optimization, stochastic optimization, stochastic quantization, color quantization, lossy compression.

3D Lightweight Cryptosystem Design For IoT Applications Based On Composite S-Box

The security of the Internet of Things (IoT) depends on strong cryptographic functions that require extensive computation and resources. The security of Internet of Things (IoT) relies on the use of strong cryptographic functions that demand extensive computation and resources. Therefore, the selection of a cryptographic system is influenced by the computational and communicational capabilities of IoT devices, including their energy requirements, memory constraints, and execution time. This paper aims to develop a lightweight and secure encryption algorithm for IoT applications, focusing on advancing cryptanalysis techniques. We propose a new lightweight algorithm named enhanced 3D RECTANGLE, designed to deliver robust security for IoT applications and optimized for cell phones with minimal memory usage, low power consumption, and efficient performance. The RECTANGLE block cipher was chosen for this research due to its high efficiency and speed relative to other lightweight algorithms, despite some security issues. The proposed enhanced 3D RECTANGLE algorithm improves confusion and diffusion properties through a new 3D array block rotation method for 4x4 plaintext, based on a 128-bit key and 16 rounds. Additionally, we designed a 4x4 composite S-Box with a Galois field pipelining structure, offering a more advanced solution compared to the Look-Up Table method. The cryptanalysis, avalanche effect, and bit error rate tests were conducted to verify the security strength of the proposed algorithm. The proposed algorithm was evaluated against two existing algorithms, RECTANGLE and Extended 3D RECTANGLE. The enhanced 3D RECTANGLE algorithm provides better cryptanalysis, demonstrating a 40% avalanche effect and achieving a bit error rate (BER) of 31%, indicating its greater effectiveness compared to the other two lightweight algorithms.

Robust Left-Right Hashing Scheme for Ubiquitous Computing

Ubiquitous computing systems possess the capability to collect and process data, which is subsequently shared with other devices. These systems encounter resource challenges such as memory constraints, processor speed limitations, power consumption considerations, and the availability of data storage. Therefore, maintaining data access and query processing speed in ubiquitous computing is challenging. Hashing is crucial to search operations and has caught the interest of many researchers. Several hashing techniques have been proposed and Cuckoo Hashing is found efficient to use in several applications. There are two variants of Cuckoo Hashing: Parallel Cuckoo Hashing and Sequential Cuckoo Hashing. Cuckoo Hashing suffers from challenges like high insertion latency, inefficient memory usage, and data migration. This paper proposes two hashing schemes: Left-Right Hashing and Robust Left-Right Hashing that successfully address and solve the major challenges of Sequential Cuckoo Hashing. The proposed schemes adopt the Combinatorial Hashing technique after modification and use this with a new collision resolution technique called Left-Right Random Probing. Left-Right Random Probing is a variant of random probing and uses prime numbers and Fibonacci numbers. In addition, this paper proposes a new performance indicator, degree of dexterity to estimate the performance of hashing techniques. Sequential Cuckoo Hashing suffers from hidden switching costs which are identified and its estimation is given by a new performance indicator called, T.R.C./Key. Performance of Sequential Cuckoo Hashing is order dependent.

Pipeline Leak Detection System for a Smart City: Leveraging Acoustic Emission Sensing and Sequential Deep Learning

This study explores a novel approach utilizing acoustic emission (AE) signaling technology for pipeline leakage detection and analysis. Pipeline leaks are a significant concern in the liquids and gases industries, prompting the development of innovative detection methods. Unlike conventional methods, which often require contact and visual inspection with the pipeline surface, the proposed time-series-based deep learning approach offers real-time detection with higher safety and efficiency. In this study, we propose an automatic detection system of pipeline leakage for efficient transportation of liquid (water) and gas across the city, considering the smart city approach. We propose an AE-based framework combined with time-series deep learning algorithms to detect pipeline leaks through time-series features. The time-series AE signal detection module is designed to capture subtle changes in the AE signal state caused by leaks. Sequential deep learning models, including long short-term memory (LSTM), bi-directional LSTM (Bi-LSTM), and gated recurrent units (GRUs), are used to classify the AE response into normal and leakage detection from minor seepage, moderate leakage, and major ruptures in the pipeline. Three AE sensors are installed at different configurations on a pipeline, and data are acquired at 1 MHz sample/sec, which is decimated to 4K sample/second for efficiently utilizing the memory constraints of a remote system. The performance of these models is evaluated using metrics, namely accuracy, precision, recall, F1 score, and convergence, demonstrating classification accuracies of up to 99.78%. An accuracy comparison shows that BiLSTM performed better mostly with all hyperparameter settings. This research contributes to the advancement of pipeline leakage detection technology, offering improved accuracy and reliability in identifying and addressing pipeline integrity issues.

Towards Non-Region Specific Large-Scale Inundation Modelling with Machine Learning Methods

Traditional flood inundation modelling methods are computationally expensive and not suitable for near-real time inundation prediction. In this study we explore a data-driven machine learning method to complement and, in some cases, replace existing methods. Given sufficient training data and model capacity, our design enables a single neural network instance to approximate the flow characteristics of any input region, opening the possibility of applying the model to regions without available training data. To demonstrate the method we apply it to a very large >8000 km2 region of the Fitzroy river basin in Western Australia with a spatial resolution of 30 m × 30 m, placing an emphasis on efficiency and scalability. In this work we identify and address a range of practical limitations, e.g., we develop a novel water height regression method and cost function to address extreme class imbalances and by carefully constructing the input data, we introduce some natural physical constraints. Furthermore, a compact neural network design and training method was developed to enable the training problem to fit within GPU memory constraints and a novel dataset was constructed from the output of a calibrated two-dimensional hydrodynamic model. A good correlation between the predicted and groundtruth water heights was observed.