Low Computational Cost Research Articles

Development of a Deep Learning-Based Flooding Region Segmentation Model for Recognizing Urban Flooding Situations

Urban flooding has become increasingly frequent due to the rising intensity of rainfall driven by urban development and climate change. Effective prevention measures are crucial to mitigate the significant human and material damages caused by such events. Rapid and accurate pre-detection techniques can help to reduce the impacts of urban flooding. With the advancement of deep learning, deep neural networks (DNNs) have been successfully applied across various domains, including computer vision and speech recognition. In particular, DNNs for computer vision demonstrate high performance with relatively low computational costs. In this paper, we propose a flooding region segmentation model for urban underpasses based on the U-Net architecture. To train and evaluate the model, we collected datasets from the Mannyeon, Oryang, and Daedong underpasses in Daejeon. The proposed method achieved Dice coefficients of 98.8%, 94.03%, and 93.85%, respectively. This model demonstrates high segmentation performance in detecting flooded regions and can be integrated into continuous flood monitoring systems.

Acceleration of Reaction Space Projector Analysis Using Combinatorial Optimization: Application to Organic Chemical Reactions.

In recent years, automated reaction path search methods have established the concept of a reaction route network. The Reaction Space Projector (ReSPer) visualizes the potential energy hypersurface into a lower-dimensional subspace using principal coordinates. The main time-consuming process in ReSPer is calculating the structural distance matrix, making it impractical for complex organic reaction route networks. We implemented the Alternate Optimization (AO) algorithm, one of the combinatorial optimizations, in ReSPer to reduce computational costs. Evaluations using gold clusters and the Au5 several reaction route networks showed that ReSPer-AO accurately computes distances with lower computational costs. Applying ReSPer-AO to the C5H8O reaction route network clarified dynamic conformation changes in its potential energy landscape. The ReSPer-AO method enables analysis of chemical reactions and dynamic conformations in a low-dimensional reaction space that accurately represents hydrocarbon reaction route networks.

EFC-Evolving Fuzzy Classifier with Incremental Clustering Algorithm Based on Samples Mean Value

This paper introduces a new multiclass classifier called the evolving Fuzzy Classifier (eFC). Starting its knowledge base from scratch, the eFC structure evolves based on a clustering algorithm that can add, merge, delete, or update clusters (= rules) simultaneously while providing class predictions. The procedure to add clusters uses the procrastination idea to prevent outliers from affecting the quality of learning. Two pruning mechanisms are used to maintain a concise and compact structure. In the first, redundant clusters are merged based on a similarity measure, and in the second, obsolete and unrepresentative clusters are excluded based on an inactivity strategy. The center of the clusters is adjusted based on the mean value of the attributes. The eFC model was evaluated and compared with state-of-the-art evolving fuzzy systems on 8 randomly selected data streams from the UCI and Kaggle repositories. The experimental results indicate that the eFC outperforms or is at least comparable to alternative state-of-the-art models. Specifically, the eFC achieved an average accuracy of 7% to 37% higher than the competing classifiers. The results and comparisons demonstrate that the eFC is a promising alternative for classification tasks in non-stationary environments, offering good accuracy, a compact structure, low computational cost, and efficient processing time.

Spin-symmetry-enforced solution of the many-body Schrödinger equation with a deep neural network.

The integration of deep neural networks with the variational Monte Carlo (VMC) method has marked a substantial advancement in solving the Schrödinger equation. In this work we enforce spin symmetry in the neural-network-based VMC calculation using a modified optimization target. Our method is designed to solve for the ground state and multiple excited states with target spin symmetry at a low computational cost. It predicts accurate energies while maintaining the correct symmetry in strongly correlated systems, even in cases in which different spin states are nearly degenerate. Our approach also excels at spin-gap calculations, including the singlet-triplet gap in biradical systems, which is of high interest in photochemistry. Overall, this work establishes a robust framework for efficiently calculating various quantum states with specific spin symmetry in correlated systems.

Future-proofing class-incremental learning

Exemplar-free class incremental learning is a highly challenging setting where replay memory is unavailable. Methods relying on frozen feature extractors have drawn attention recently in this setting due to their impressive performances and lower computational costs. However, those methods are highly dependent on the data used to train the feature extractor and may struggle when an insufficient amount of classes are available during the first incremental step. To overcome this limitation, we propose to use a pre-trained text-to-image diffusion model in order to generate synthetic images of future classes and use them to train the feature extractor. Experiments on the standard benchmarks CIFAR100 and ImageNet-Subset demonstrate that our proposed method can be used to improve state-of-the-art methods for exemplar-free class incremental learning, especially in the most difficult settings where the first incremental step only contains few classes. Moreover, we show that using synthetic samples of future classes achieves higher performance than using real data from different classes, paving the way for better and less costly pre-training methods for incremental learning.

ADS-B Communication Security: Assessing the Performance of Format-Preserving Lightweight Block Ciphers

In this work, we document an investigation regarding the vulnerabilities of ADS-B (automatic dependent surveillance-broadcast) communication, considering the risks to operational security. The ADS-B technology is a communication protocol to transmit surveillance information, that is, data related to position, altimetry, and speed, from the aircraft's avionics, an evolution to radars. We present an encryption solution for this communication using format-preserving encryption implemented in a microcontroller-embedded system. We also evaluate the use of lightweight symmetric block ciphers for better computational performance. When used as a pseudorandom function, we observe that such ciphers maintain a high entropy output value with low computational cost --- up to sixteen times faster for similar entropy values. Finally, the computational performance obtained with the proposed solution is analyzed by processing real-time data from aircraft in the landing and takeoff phase at the international airport of Recife/Guararapes - Gilberto Freyre, based in Recife/PE, Brazil.

Machine Learning With Tree Tensor Networks, CP Rank Constraints, and Tensor Dropout.

Tensor networks developed in the context of condensed matter physics try to approximate order- N tensors with a reduced number of degrees of freedom that is only polynomial in N and arranged as a network of partially contracted smaller tensors. As we have recently demonstrated in the context of quantum many-body physics, computation costs can be further substantially reduced by imposing constraints on the canonical polyadic (CP) rank of the tensors in such networks. Here, we demonstrate how tree tensor networks (TTN) with CP rank constraints and tensor dropout can be used in machine learning. The approach is found to outperform other tensor-network-based methods in Fashion-MNIST image classification. A low-rank TTN classifier with branching ratio b=4 reaches a test set accuracy of 90.3% with low computation costs. Consisting of mostly linear elements, tensor network classifiers avoid the vanishing gradient problem of deep neural networks. The CP rank constraints have additional advantages: The number of parameters can be decreased and tuned more freely to control overfitting, improve generalization properties, and reduce computation costs. They allow us to employ trees with large branching ratios, substantially improving the representation power.

A fast differential network with adaptive reference sample for gaze estimation

Most non-invasive gaze estimation methods do not consider the inter-individual differences in anatomical structure, but directly regress the gaze direction from the appearance image information, which limits the accuracy of individual-independent gaze estimation networks. In addition, existing gaze estimation methods tend to consider only how to improve the model’s generalization performance, ignoring the crucial issue of efficiency, which leads to bulky models that are difficult to deploy and have questionable cost-effectiveness in practical use. This paper makes the following contributions: (1) A differential network for gaze estimation using adaptive reference samples is proposed, which can adaptively select reference samples based on scene and individual characteristics. (2) The knowledge distillation is used to transfer the knowledge structure of robust teacher networks into lightweight networks so that our networks can execute quickly and at low computational cost, dramatically increasing the prospect and value of applying gaze estimation. (3) Integrating the above innovations, a novel fast differential neural network (Diff-Net) named FDAR-Net is constructed and achieved excellent results on MPIIGaze, UTMultiview and EyeDiap.

Insight into uranyl binding by cyclic peptides from molecular dynamics and density functional theory

It is a challenging task to develop uranyl-chelating agents based on peptide chemistry. A recently developed cationic dummy atom model of uranyl in conjunction with the classical molecular dynamics simulation presents a helpful utility to study the chelation of uranyl by peptides with a low computational cost. In the present study, it was used to describe the chelation of uranyl by the cyclic decapeptide with 4 Glu residues cyc-GluArgGluProGlyGluTrpGluProGly and its derivatives containing two phosphorylated serines in place of two Glu, termed pS16, pS18, pS38, and pS68. The obtained structures were further studied by density functional theory (DFT) and subsequent density analysis. We show that a combination of steered molecular dynamics and simulated annealing, using standard forcefields for peptide with the cationic dummy atom model of uranyl, can quickly and reliably obtain binding modes of uranyl-peptide complexes. Classical molecular dynamics simulation in explicit water produces geometry very close to the DFT-optimized structure. The presence of uranyl completely changes the conformation of these cyclic peptides from unstructured to organised. The simulation of a peptide with two uranyl units explained why only the 1: 1 ratio of peptide and chelated-uranyl is observed experimentally in most cases, by the insufficiency of the anionic residues for the chelation of two UO22+ units, but that pS16 can accommodate two such units.

A universal method for seizure onset zone localization in focal epilepsy using standard deviation of spike amplitude

BackgroundPrecisely localizing the seizure onset zone (SOZ) is critical for focal epilepsy surgery. Existing methods mainly focus on high-frequency activities in stereo-electroencephalography, but often fail when seizures are not driven by high-frequency activities. Recognized as biomarkers of epileptic seizures, ictal spikes in SOZ induce epileptiform discharges in other brain regions. Based on this understanding, we aim to develop a universal algorithm to localize SOZ and investigate how ictal spikes within the SOZ induce seizures. MethodsWe proposed a novel metric called standard deviation of spike amplitude (SDSA) and utilized channel-averaged SDSA to describe seizure processes and detect seizures. By integrating SDSA values in specific intervals, the score for each channel located within SOZ was calculated. Channels with high SOZ scores were clustered as SOZ. The localization accuracy was asserted using area under the receiver operating characteristic (ROC) curve. Further, we analyzed early ictal signals from SOZ channels and investigated factors influencing their duration to reveal the seizure inducing conditions. ResultsWe analyzed data from 15 patients with focal epilepsy. The channel-averaged SDSA successfully detected all 28 seizures without false alarms. Using SDSA integration, we achieved precise SOZ localization with an average area under ROC curve (AUC) of 0.96, significantly outperforming previous methods based on high-frequency activities. Further, we discovered that energy of ictal spikes in SOZ was concentrated at a specific frequency distributed in [6, 12Hz]. Additionally, we found that the higher the energy per second in this frequency band, the faster ictal spikes could induce seizures. ConclusionThe SDSA metric offered precise SOZ localization with robustness and low computational cost, making it suitable for clinical practice. By studying the propagation patterns of ictal spikes between the SOZ and non-SOZ, we suggest that ictal spikes from SOZ need to accumulate energy at a specific central frequency to induce epileptic spikes in non-SOZ, which may have significant implications for understanding the seizure onset pattern.

Simulating concrete cracking and failure under impact loading using a novel constitutive integration paradigm in non-ordinary state-based Peridynamics

Concrete cracking and failure under external loads are common in infrastructure, particularly under impact conditions where the variability of loads and the complexity of the cracking process present significant challenges. While the Bond-Based Peridynamic (BBPD) and Ordinary State-Based Peridynamic (OSBPD) models are widely used in concrete damage analysis due to their low computational cost, their simple constitutive laws limit their effectiveness in simulating concrete’s response to impact loading. To overcome this limitation, we propose a novel approach that integrates classical constitutive models into the Peridynamics (PD) framework. Specifically, we reformulate the Concrete Damage Plasticity Model 2 (CDPM2) within a non-ordinary state-based PD (NOSBPD) framework, resulting in the CDPM2-PD model. This model incorporates factors such as strain rate effects and strain hardening and introduces a bond damage criterion for both tensile and compressive damage. Through three numerical examples, the CDPM2-PD model demonstrates its ability to accurately capture the cracking and failure process of concrete under impact, showing strong agreement with experimental observations in areas such as failure mode transitions and crack patterns. These results validate the model’s effectiveness and offer a versatile method for integrating classical constitutive models into the NOSBPD framework for complex material analysis.

3D visualization diagnostics for lung cancer detection

<span>Lung cancer is a leading cause of cancer deaths worldwide with an estimated 2 million new cases and 1·76 million deaths yearly. Early detection can improve survival, and CT scans are a precise imaging technique to diagnose lung cancer. However, analyzing hundreds of 2D CT slices is challenging and can cause false alarms. 3D visualization of lung nodules can aid clinicians in detection and diagnosis. The MobileNet model integrates multi-view and multi-scale nodule features using depthwise separable convolutional layers. These layers split standard convolutions into depthwise and pointwise convolutions to reduce computational cost. Finally, the 3D pulmonary nodular models were created using a ray-casting volume rendering approach. Compared to other state-of-the-art deep neural networks, this factorization enables MobileNet to achieve a much lower computational cost while maintaining a decent degree of accuracy. The proposed approach was tested on an LIDC dataset of 986 nodules. Experiment findings reveal that MobileNet provides exceptional segmentation performance on the LIDC dataset, with an accuracy of 93.3%. The study demonstrates that the MobileNet detects and segments lung nodules somewhat better than other older technologies. As a result, the proposed system proposes an automated 3D lung cancer tumor visualization.</span>

Uncertainty quantification analysis using multi-fidelity deep neural network

Abstract In order to solve the highly-dimensional and highly-nonlinear problems in uncertainty quantification of CFD, the paper develops a multi-fidelity neural network model and proposes a residual connection-based multi-fidelity deep neural network fusion model. Based on the small sample size and low computational cost of multi-fidelity models, the residual structure is further utilized to accelerate the convergence rate of the model and reduce the possibility of inducing systemic risks. Finally, the feasibility and accuracy of the algorithm are verified by six typical numerical examples, and the uncertainty quantification analysis of the NACA0012 airfoil’s yaw moment coefficients is completed.

Dilated convolution neural operator for multiscale partial differential equations

This paper introduces a data-driven operator learning method for multiscale partial differential equations, with a particular emphasis on preserving high-frequency information. Drawing inspiration from the representation of multiscale parameterized solutions as a combination of low-rank global bases (such as low-frequency Fourier modes) and localized bases over coarse patches (analogous to dilated convolution), we propose the Dilated Convolutional Neural Operator (DCNO). The DCNO architecture effectively captures both high-frequency and low-frequency features while maintaining a low computational cost through a combination of convolution and Fourier layers. We conduct experiments to evaluate the performance of DCNO on various datasets, including the multiscale elliptic equation, its inverse problem, Navier–Stokes equation, and Helmholtz equation. Our results demonstrate that DCNO achieves an optimal balance between accuracy and computational efficiency, making it a promising approach for multiscale operator learning.

Nonlinear subspace clustering by functional link neural networks

Nonlinear subspace clustering based on a feed-forward neural network has been demonstrated to provide better clustering accuracy than some advanced subspace clustering algorithms. While this approach demonstrates impressive outcomes, it involves a balance between effectiveness and computational cost. In this study, we employ a functional link neural network to transform data samples into a nonlinear domain. Subsequently, we acquire a self-representation matrix through a learning mechanism that builds upon the mapped samples. As the functional link neural network is a single-layer neural network, our proposed method achieves high computational efficiency while ensuring desirable clustering performance. By incorporating the local similarity regularization to enhance the grouping effect, our proposed method further improves the quality of the clustering results. We name our method as Functional Link Neural Network Subspace Clustering (FLNNSC). Furthermore, we propose a convex combination subspace clustering scheme that combines a linear subspace clustering method with the functional link neural network subspace clustering approach. This combination method is named as Convex Combination Subspace Clustering (CCSC), which allows for a dynamic balance between linear and nonlinear representations. Extensive experiments conducted on four widely used datasets, including Extended Yale B, USPS, COIL20, and ORL, demonstrate that both FLNNSC and CCSC outperform several state-of-art subspace clustering methods in terms of clustering accuracy. Our affinity graph experiments reveal that FLNNSC exhibits clear block diagonal structures. We provide recommendations for hyperparameters in FLNNSC by performing a parameter sensitivity analysis, and empirically verify the convergence of FLNNSC. Additionally, we show that FLNNSC has a lower computational cost compared to two high-performing methods.

A pseudo-density conjugate heat transfer method and its application to simulating the quasi-steady temperature field of a compressor cylinder

The substantial disparity in time scales between heat conduction and convection requires extremely tiny time steps in simulations, leading to significant computational demands when using current-tightly coupled methods to solve the temperature field of cylinders at the quasi-steady stage. A new pseudo-density method is proposed to accelerate the heat conduction rate. The influence of solid density on transient temperature under the periodic third-type boundary conditions is analyzed in a one-dimensional model by analytical methods and verified in a three-dimensional structure by numerical methods. It is found that reducing solid density can accelerate the heat conduction rate and increase the fluctuation amplitude of solid temperature. Therefore, a variable pseudo density is adopted for solids in the simulation of the transient heat transfer characteristics between the compressed gas and the cylinder. The results show that the pseudo-density method provides similar computational accuracy to the current tightly coupled methods, but at significantly lower computational cost. The fluctuation amplitude of the cylinder's temperature decreases rapidly in the wall thickness direction. The distribution of the convective heat transfer coefficient on the inner wall of the cylinder is extremely transient and highly non-uniform, which is consistent with the distribution of gas velocity near the cylinder wall.

Dynamic Graphical Models with Variable Selection for Effective Connectivity

This paper proposes a novel approach that combines dynamic linear models applied to graph data and variable selection through spike-and-slab priors. The new class of models, called Dynamic Graphical Variable Selection, is used to infer effective connectivity in certain brain regions allowing both connectivity weights and graphical structure to vary over time. One advantage of our method is that as the graphical structure is estimated inferentially, the computational cost is reduced. That way our methodology can accommodate high-dimensional data, such as large networks observed through long periods of time. We illustrate our methodology via numerical experiments with simulated and synthetic data, and then applied to fNIRS real data. The obtained results showed that the static version of our model is competitive against previous methodologies and demands a lower computational cost. Our model is more flexible than the previous methodologies by allowing the graphical structure to vary over time.

Practical Heterogeneous Pairing-Free Signcryption Scheme for Internet of Medical Things Communications with Edge Computing

Internet of Medical Things technology is becoming popular because of recent advancements in sensor node technology. A sensor node is characterized as a resource-limited device. This characteristic has led to several security challenges that underpin the necessity for cryptosystems that are both more effective and robust in protecting vital data. We propose an efficient and secure access control scheme where the transmitting node and receiving node are in certificateless cryptography and identity-based cryptographic environment, respectively. The design of the access control protocol for use in Internet of Medical Things with mobile edge computing is based on a heterogeneous signcryption scheme, and it is supported by 5G network. Random oracle model was used to provide the security proof of the proposed scheme. The proposed heterogeneous access control scheme provides public verifiability and ciphertext authentication properties. In addition, we have compared the efficiency of our access control scheme with other related existing schemes, and our scheme has low energy consumption and computation cost.

Autonomous loading of ore piles with Load-Haul-Dump machines using deep reinforcement learning

This work presents a deep reinforcement learning-based approach to train controllers for the autonomous loading of ore piles with a Load-Haul-Dump (LHD) machine. These controllers must perform a complete loading maneuver, filling the LHD’s bucket with material while avoiding wheel drift, dumping material, or getting stuck in the pile. The training process is conducted entirely in simulation, using a simple environment that leverages the Fundamental Equation of Earth-Moving Mechanics to achieve a low computational cost. Two different types of policies are trained: one with a hybrid action space and another with a continuous action space. The RL-based policies are evaluated both in simulation and in the real world using a scaled LHD and a scaled muck pile, and their performance is compared to that of a heuristics-based controller and human teleoperation. Additional real-world experiments are performed to assess the robustness of the RL-based policies to measurement errors in the characterization of the piles. Overall, the RL-based controllers show good performance in the real world, achieving fill factors between 71%–94%, and less wheel drift than the other baselines during the loading maneuvers. A video showing the training environment and the learned behavior in simulation, as well as some of the performed experiments in the real world, can be found in https://youtu.be/jOpA1rkwhDY.

Wind Turbine Wake Regulation Method Coupling Actuator Model and Engineering Wake Model

The wake effect is one of the main factors affecting the power generation of wind farms. Wake regulation is often used to reduce the wake interference between wind turbines. Accurate assessment of the wake flow of wind turbine is essential to wake regulation. Engineering wake models are widely used for rapid evaluation of the wake at present due to lower computational resource cost. However, the selection of empirical parameters of the wake model has significant influence on the prediction accuracy, especially in the case of yaw. The actuator model based on CFD simulation has less dependence on empirical parameters and higher simulation accuracy. However, the computational cost is too high for wake regulation for large wind farms. This paper proposed an improved wake regulation method that combines the advantages of the actuator line model (ALM) method and the engineering wake mode. The simulation results of the ALM is used to calibrate the empirical parameters of the engineering wake model. The calibrated wake model can be used to optimize the yaw angle of wind turbines during wake regulation. The accuracy of two models is compared using wind tunnel experimental data. The ALM results give better agreement to the experimental data. The Horns Rev wind farm case is used for the coupled method verification. The power generation increase using the engineering wake model is obviously greater than that of the ALM. After calibrating the wake model, the gap between the two power predictions is greatly narrowed, which proves the effectiveness of the proposed method. The proposed coupling method can be used to improve the credibility of the wake regulation with affordable computational cost.