Dependent Data Research Articles

Area-Time-Efficient Secure Comb Scalar Multiplication Architecture Based on Recoding

With the development of mobile communication, digital signatures with low latency, low area, and high security are in increasing demand. Elliptic curve cryptography (ECC) is widely used because of its security and lightweight. Elliptic curve scalar multiplication (ECSM) is the basic arithmetic in ECC. Based on this background information, we propose our own research objectives. In this paper, a low-latency and low-area ECSM architecture based on the comb algorithm is proposed. The detailed methodology is as follows. The recoding-k algorithm and randomization-Z algorithm are used to improve security, which can resist sample power analysis (SPA) and differential power analysis (DPA). A low-area multi-functional architecture for comb is proposed, which takes into account different stages of the comb algorithm. Based on this, the data dependency is considered and the comb architecture is optimized to achieve a uniform and efficient execution pattern. The interleaved modular multiplication algorithm and modified binary inverse algorithm are used to achieve short clock cycle delay and high frequency while taking into account the need for a low area. The proposed architecture has been implemented on Xilinx Virtex-7 series FPGA to perform ECSM on 256-bits prime field GF(p). In the hardware architecture with only 7351 slices of resource usage, a single ECSM only takes 0.74 ms, resulting in an area-time product (ATP) of 5.41. The implementation results show that our design can compete with the existing state-of-the-art engineering in terms of performance and has higher security. Our design is suitable for computing scenarios where security and computing speed are required. The implementation of the overall architecture is of great significance and inspiration to the research community.

Comparative Study on Stock Movement Prediction Using Hybrid Deep Learning Model

Applying machine learning techniques in stock market prediction has evolved significantly, with deep learning methodologies gaining prominence. Conventional algorithms such as Linear Regression and Neural Networks initially dominated but struggled to capture complex temporal dependencies in financial data. Recent research has explored deep learning architectures like LSTM and CNN and hybrids such as CNN-LSTM and LSTM-CNN, showcasing promising results. However, there's a gap in research comparing these models across different datasets, particularly in predicting stock movements. This study addresses this gap by conducting a comparative analysis of deep learning and hybrid models for stock movement prediction in the Indonesian banking sector. The evaluation based on RMSE and MAE reveals that the LSTM-CNN hybrid consistently outperforms other models, showcasing its versatility and accuracy across different data characteristics. Then, exploration through hyperparameter tuning demonstrates the criticality of parameter selection in optimizing model performance. These findings contribute to advancing predictive modeling in financial markets, offering valuable insights for investors, analysts, and policymakers. Further research in hyperparameter tuning and model optimization holds promise for enhancing accuracy and reliability in stock price prediction.

Semantic Web-Based Prediction Method for Goodwill Impairment in Listed Companies Using Mamba

In the context of globalization and intense market competition, mergers and acquisitions (M&A) have become a common strategy for enterprises to expand and transform. However, goodwill issues in M&A are increasingly concerning. Traditional goodwill impairment prediction models face drawbacks like reliance on precise predictions, large datasets, complexity, poor interpretability, high computational costs, and data acquisition difficulties. This paper proposes a prediction model based on an improved Mamba algorithm. By processing financial data from listed companies in the CSMAR database, the model constructs lagged and rolling statistical features to reflect performance trends. The Mamba algorithm dynamically adjusts input parameters through a Selective State-Space Model (SSM), capturing dependencies in long-sequence data and improving prediction accuracy and timeliness. Experimental results show the Mamba algorithm excels in handling long-sequence data, offering valuable guidance for financial management and risk control.

Advanced Wind Power Forecasting

The popularity of LSTM networks in wind prediction is due to their inherent capabilities in handling the long-term dependencies of sequential data. This normally outperforms traditional methods like ARIMA. However, current work has illustrated that EMD-based approaches outperform LSTM models in many critical performance metrics. Although it is very powerful in gathering historical patterns due to the enhanced gating mechanisms, LSTM has a lot of challenges regarding computational efficiency and flexibility. EMD models overwhelmingly outperformed the LSTM model in computational time by probably about 20-25%, thereby solving a weakness that may be one of the intrinsic weaknesses of the LSTM model. In addition, the EMD models improved by about 2-4% in accuracy as compared to LSTM, thus evidencing better ability in the prediction of the wind data. On feature extraction, EMD did better, improving by 7% over LSTM. Moreover, EMD has better robustness and adaptability, with improvements of 6% and 4%, respectively. This introduction of EMD does bring a bit of an increase in model complexity, this disadvantage is rather insignificant when compared with the huge advantages it brings in efficiency and accuracy. While an LSTM network is very good at modeling a long-term relationship, it suffers from some problems in handling nonlinear interactions and continuous series data, thus its effectiveness may be limited in some cases of forecasting. In contrast, EMD has a clear advantage in real-time applications owing to enhanced efficiency and precision. From the results obtained in this study, it becomes easy to envision that the EMD methodology is un-equivocally better than LSTM in all the critical aspects, such as computational efficiency, accuracy in prediction, feature extraction, resilience, and adaptability when used individually. Results indicate that EMD has a more constructive methodology toward wind pattern predictions, beating LSTM on many measures of performance. The advantages presented should be maximized in future studies aimed at further improving and optimizing a wind-forecasting system, with special attention toward EMD's benefits in gaining more accurate and efficient forecasts.

A novel image inpainting method based on a modified Lengyel–Epstein model

With the increasing popularity of digital images, developing advanced algorithms that can accurately reconstruct damaged images while maintaining high visual quality is crucial. Traditional image restoration algorithms often struggle with complex structures and details, while recent deep learning methods, though effective, face significant challenges related to high data dependency and computational costs. To resolve these challenges, we propose a novel image inpainting model, which is based on a modified Lengyel–Epstein (LE) model. We discretize the modified LE model by using an explicit Euler algorithm. A series of restoration experiments are conducted on various image types, including binary images, grayscale images, index images, and color images. The experimental results demonstrate the effectiveness and robustness of the method, and even under complex conditions of noise interference and local damage, the proposed method can exhibit excellent repair performance. To quantify the fidelity of these restored images, we use the peak signal-to-noise ratio (PSNR), a widely accepted metric in image processing. The calculation results further demonstrate the applicability of our model across different image types. Moreover, by evaluating CPU time, our method can achieve ideal repair results within a remarkably brief duration. The proposed method validates significant potential for real-world applications in diverse domains of image restoration and enhancement.

Vul-LMGNNs: Fusing language models and online-distilled graph neural networks for code vulnerability detection

Code Language Models (codeLMs) and Graph Neural Networks (GNNs) are widely used in code vulnerability detection. However, a critical yet often overlooked issue is that GNNs primarily rely on aggregating information from adjacent nodes, limiting structural information transfer to single-layer updates. In code graphs, nodes and relationships typically require cross-layer information propagation to fully capture complex program logic and potential vulnerability patterns. Furthermore, while some studies utilize codeLMs to supplement GNNs with code semantic information, existing integration methods have not fully explored the potential of their collaborative effects.To address these challenges, we introduce Vul-LMGNNs that integrates pre-trained CodeLMs with GNNs, leveraging knowledge distillation to facilitate cross-layer propagation of both code semantic knowledge and structural information. Specifically, Vul-LMGNNs utilizes Code Property Graphs (CPGs) to incorporate code syntax, control flow, and data dependencies, while employing gated GNNs to extract structural information in the CPG. To achieve cross-layer information transmission, we implement an online knowledge distillation (KD) program that enables a single student GNN to acquire structural information extracted from a simultaneously trained counterpart through an alternating training procedure. Additionally, we leverage pre-trained CodeLMs to extract semantic features from code sequences. Finally, we propose an ”implicit-explicit” joint training framework to better leverage the strengths of both CodeLMs and GNNs. In the implicit phase, we utilize CodeLMs to initialize the node embeddings of each student GNN. Through online knowledge distillation, we facilitate the propagation of both code semantics and structural information across layers. In the explicit phase, we perform linear interpolation between the CodeLM and the distilled GNN to learn a late fusion model. The proposed method, evaluated across four real-world vulnerability datasets, demonstrated superior performance compared to 17 state-of-the-art approaches. Our source code can be accessed via GitHub: https://github.com/Vul-LMGNN/vul-LMGGNN.

Enhancing mixed gas discrimination in e-nose system: sparse recurrent neural networks using transient current fluctuation of SMO array sensor

Despite recent significant advancements in gas sensor array technology, accurately identifying gases in mixed environments remains challenging. This difficulty is primarily due to the rapid and competing processes of gas molecules attaching to (adsorption) and detaching from (desorption) the sensor. In this study, we present a simple method to fabricate a 2 × 4 SMO-based gas sensor array, coupled with a sparse recurrent neural network (SRNN) that employs weight regularization. The recurrent layers of the SRNN process nonlinear information and capture temporal dependencies in the sensor data, while the regularization technique simplifies the model, making it both efficient and easier to interpret. Additionally, we introduce a novel feature: the dynamics of current, labeled as ΔI. This feature enables the SRNN model to efficiently detect the adsorption and desorption of gas molecules. We demonstrate that our model can distinguish between three intuitively indistinguishable datasets of gas species (NO2, HCHO, and a mixture) with up to 92 % accuracy. By utilizing the fast and competitive adsorption/desorption information of gas molecules, our model can be applied to various gas combination environments, unlike conventional gas sensing data measured over longer periods. By integrating the sensor array with the advanced SRNN model, we pave the way for sophisticated e-nose systems, with potential applications in advanced gas sensing technologies, such as disease diagnosis through exhaled breath analysis and the detection of toxic species in mixed gas environments.

Dynamic Multi-Scale Spatial-Temporal Graph Convolutional Network for Traffic Flow Prediction

This paper proposes a dynamic multi-scale spatial-temporal graph convolutional network (DS-STGCN) for traffic flow prediction. The network aims to comprehensively extract global and local dependencies in dynamic spatial-temporal data by inputting traffic network flow data to construct node feature graphs, topology graphs, and time slot feature graphs, capturing the complexity and dynamics of traffic flow. DS-STGCN interprets feature information of the traffic network from both spatial and temporal dimensions through dynamic multi-scale graph convolutional blocks. In the spatial dimension, these blocks use constraints at different levels to balance fine-grained local features and extensive global features, revealing the intrinsic structure of traffic flow data. In the temporal dimension, these blocks jointly learn with temporal convolutional blocks to capture multi-frequency time patterns and handle long sequence data, effectively extracting potential dependencies of time series. Furthermore, DS-STGCN effectively models the changing spatial-temporal relationships in road network flow by constructing dynamically adaptive updated adjacency tensors, generating dynamic graph structures to address the challenge of changing spatial-temporal relationships in the transportation system. Experimental results show that our method significantly outperforms other competing methods on five real traffic datasets (PEMS03, PEMS04, PEMS07, PEMS08 and METR-LA).

Few-shot learning based histopathological image classification of colorectal cancer

Background Colorectal cancer is a prevalent and deadly disease worldwide, posing significant diagnostic challenges. Traditional histopathologic images classification is often inefficient and subjective. Although some histopathologists use computer-aided diagnosis (CAD) to improve efficiency, these methods depend heavily on extensive data and specific annotations, limiting their development. To address these challenges, this paper proposes a method based on few-shot learning. Methods This study introduces a few-shot learning approach that combines transfer learning and contrastive learning to classify colorectal cancer histopathology images into benign and malignant categories. The model comprises modules for feature extraction, dimensionality reduction, and classification, trained using a combination of contrast loss and cross-entropy loss. In this paper, we detail the setup of hyperparameters:n-way, k-shot, β and the creation of support, query, and test datasets. Results Our method achieved over 98% accuracy on a query dataset with 35 samples per category using only 10 training samples per category. We documented the model’s loss, accuracy, and the confusion matrix of the results. Additionally, we employed the t-SNE algorithm to analyze and assess the model’s classification performance. Conclusion The proposed model demonstrates significant advantages in accuracy and minimal data dependency, performing robustly across all tested n-way, k-shot scenarios. It consistently achieved over 93% accuracy on comprehensive test datasets, including 1916 samples, confirming its high classification accuracy and strong generalization capability. Our research advances the use of few-shot learning in medical diagnostics, and also lays the groundwork for extending it to deal with rare, difficult-to-diagnose cases.

Автоматизований метод перевірки та налагодження тестових сценаріїв на основі формальної моделі

Introduction. Model-based test cases generation is a popular strategy for test automation. It helps to reduce time spent on the development of a test suite and can improve level of coverage. However, many reports show shortage of such test cases in poor quality and doubtable efficiency. Purpose. The main goal of the proposed method is cost-effective validation, assessment, debugging and concretization of generated test cases. The method helps improve quality and efficiency of the test cases, make their scenario meaningful and goal-oriented. The method also develops debugging facilities and simplifies data dependency analysis and test scenario editing. Methods. We propose an automated post-processing method which allows to evaluate path that is examined by the test case, and to make safe changes to the path which will eliminate the shortcomings while leaving the coverage targets of the test case unharmed. The method is based on visualization of the path along the control flow graph of the model with additional information about factual evaluation history of all variables and possible alternative variants of behavior. For consistent substitution of certain values in the signal parameters, which would determine the artifacts of the test environment (such as, for example, files, databases, etc.) and check boundary cases (in predicates of conditions, indexing of arrays, etc.), a method of interactive specification of symbolic traces has been developed. Results. The role of the user in deciding whether to add a test case to the project test suite and make changes to it remains crucial, but to reduce labor intensity, the following processes are automated: evaluation of test scenarios according to certain objective characteristics (level of coverage, ability to detect defects, data cohesion, etc.); highlighting of possible alternatives for making corrections; consistent updating of computations for the corresponding corrections. A prototype was developed based on the proposed methods. The empirical results demonstrated a positive impact on the overall efficiency (ability to detect defects and reduce resource consumption) and quality (meaningfulness, readability, maintenance, usefulness for debugging, etc) of the generated test suites. The method allows to make automatically generated test cases trustable and usable. Conclusion. The proposed toolkit significantly reduces the time spent on researching the results of test generation and validation of the obtained tests and their editing. Unlike existing simulation methods, the proposed method not only informs about the values of variables, but also explores the history of their computations and additionally provides information about admissible alternatives. Further we plan to improve the process of localizing the causes of test failure at execution phase to speed up the search for defects.

SIMTSeg: A self-supervised multivariate time series segmentation method with periodic subspace projection and reverse diffusion for industrial process

Subsequences with varied regimes in the industrial multivariate time series (MTS) are closely associated with the dynamic status of the multi-phased industrial process. Time series segmentation (TSS) provides insights into the underlying behavior of industrial systems. However, the complexity of industrial data poses significant challenges to the conventional TSS methods. Motivated by this, a Self-supervised Industrial Multivariate Time-series Segmentation method (SIMTSeg) is presented in this work. An MTS folding module based on Ramanujan periodic subspace projection is first proposed, where the MTS is reshaped into the 3D feature map to realize the compact representation of the intricate data dependencies. Subsequently, a self-supervised module based on the encoder-decoder architecture is adopted to address the problem of deficient and task-specific annotations in industrial data. The folded feature map is denoised step by step following the reverse diffusion process, and finally turns into the segmentation mask without redundant details. The proposed SIMTSeg has been validated by a popular industrial benchmark, the Tennessee Eastman Process, and outperforms the unsupervised data-driven baselines in terms of various performance metrics. SIMTSeg has no prerequisite on the number of segmentation points or regime types, and is capable of giving more meaningful segmentation results that are in line with the high-level semantics.

Cryptocurrencies Price Prediction Using Deep Learning Models (Gated Recurrent Unit And Recurrent Neural Network))

Background: With their volatile prices, cryptocurrencies have become valuable assets in the financial market. Predicting cryptocurrency prices accurately is essential for making well-informed investment decisions. Time series prediction models, like Gated Recurrent Unit (GRU) and Recurrent Neural Networks (RNN), are popular tools for financial data forecasting because they can capture sequential dependencies in data. Aim: This study aims to predict the average monthly closing prices of five major cryptocurrencies—Bitcoin (BTC), Ethereum (ETH), Binance Coin (BNB), Litecoin (LTC), and Ripple (XRP)—using GRU and RNN models and evaluate their performance in forecasting these prices. Method: Time series input sequences were produced and historical price data for the chosen cryptocurrencies were preprocessed using Min-Max Scaling. This data was divided into training and test sets, and it was used to train both the GRU and RNN models. The Mean Absolute Percentage Error (MAPE) and Root Mean Squared Error (RMSE) were used to assess the performance of the model. Results: For the majority of cryptocurrencies, the RNN model exhibited better predicted accuracy and consistently outperformed the GRU model. For instance, the RMSE for Ripple was 0.06 for the RNN model and 0.09 for GRU. In a similar vein, the RNN model outperformed the GRU model with a MAPE of 12.97% for Ethereum. These results imply that RNN models are more suitable for financial forecasting in this sector, as they yield more accurate predictions for cryptocurrency values.

Results of Convergence, Stability, and Data Dependency for an Iterative Algorithm

In this study, we reconstruct an existing result related to the strong convergence of a recently introduced iterative algorithm by removing certain restrictions on the coefficient sequences. We then obtain some new results on the stability and data dependency of this algorithm. To validate our results, we provide a series of nontrivial complex examples, demonstrating the significance and accuracy of our theoretical contributions.

Disquisition on convergence, stability, and data dependence for a new fast iterative process

This paper introduces a novel fast iterative process designed for approximating fixed points of contraction and weak contraction mappings. The study presents strong convergence results for this newly proposed iterative process, and proving its efficiency. Analytical and numerical evidences are provided to establish that the proposed iterative method converges more rapidly than several existing processes. Furthermore, stability results and dependence analysis are presented for the newly developed iterative process, enhancing its practical applicability and robustness.

A novel bidirectional LSTM network model for very high cycle random fatigue performance of CFRP composite thin plates

This study proposes a novel Double-layer Bidirectional Long Short-Term Memory (BiLSTM) neural network model, shorted as TDA-BiLSTM, which integrates Transfer learning and Attention mechanisms. The model aims to predict the fatigue life of carbon fiber reinforced polymer (CFRP) thin plate structures subjected to very high cycle random vibration fatigue loads. Distinct from conventional servo-hydraulic and ultrasonic fatigue testing methods, this research pioneers the use of a vibration table for very high cycle fatigue (VHCF) testing to fill the gap in the field. By training and validating data across various life ranges, the TDA-BiLSTM model demonstrates significant advantages in training speed and predicting accuracy. Its bidirectional structure and attention mechanism effectively capture complex patterns and long-term dependencies in sequence data. Experimental results indicate that the TDA-BiLSTM model achieves significantly lower Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) compared to Long Short-Term Memory (LSTM) and Long Short-Term Memory with Transfer learning (Tr-LSTM) models across different life ranges on the ε-N curve, indicating higher accuracy and stability in strain life prediction tasks. Additionally, an analysis of typical damage areas using Scanning Electron Microscopy (SEM) reveals the failure mechanisms of CFRP plates under very high cycle vibration fatigue loads.

Risk Analysis in Customer Relationship Management via QRCNN-LSTM and Cross-Attention Mechanism

Risk analysis is an important business decision support task in Customer Relationship Management (CRM), involving the identification of potential risks or challenges that may affect customer satisfaction, retention rates, and overall business performance. To enhance risk analysis in CRM, this paper combines the advantages of QRCNN-LSTM and cross-attention mechanisms for modeling. The QRCNN-LSTM model combines sequence modeling with deep learning architectures commonly used in natural language processing tasks, enabling the capture of both local and global dependencies in sequence data. The cross-attention mechanism enhances interactions between different input data parts, allowing the model to focus on specific areas or features relevant to CRM risk analysis. By applying QRCNN-LSTM and cross-attention mechanisms to CRM risk analysis, empirical evidence demonstrates that this approach can effectively identify potential risks and provide data-driven support for business decisions.

Self-Supervised Learning for Unlabeled Data Reducing Data Dependency in AI Systems

Self-Supervised Learning for Unlabeled Data Reducing Data Dependency in AI Systems

Deep learning for blood glucose level prediction: How well do models generalize across different data sets?

Deep learning-based models for predicting blood glucose levels in diabetic patients can facilitate proactive measures to prevent critical events and are essential for closed-loop control therapy systems. However, selecting appropriate models from the literature may not always yield conclusive results, as the choice could be influenced by biases or misleading evaluations stemming from different methodologies, datasets, and preprocessing techniques. This study aims to compare and comprehensively analyze the performance of various deep learning models across diverse datasets to assess their applicability and generalizability across a broader spectrum of scenarios. Commonly used deep learning models for blood glucose level forecasting, such as feed-forward neural network, convolutional neural network, long short-term memory network (LSTM), temporal convolutional neural network, and self-attention network (SAN), are considered in this study. To evaluate the generalization capabilities of each model, four datasets of varying sizes, encompassing samples from different age groups and conditions, are utilized. Performance metrics include Root Mean Square Error (RMSE), Mean Absolute Difference (MAD), and Coefficient of Determination (CoD) for analytical asssessment, Clarke Error Grid (CEG) for clinical assessments, Kolmogorov-Smirnov (KS) test for statistical analysis, and generalization ability evaluations to obtain both coarse and granular insights. The experimental findings indicate that the LSTM model demonstrates superior performance with the lowest root mean square error and highest generalization capability among all other models, closely followed by SAN. The ability of LSTM and SAN to capture long-term dependencies in blood glucose data and their correlations with various influencing factors and events contribute to their enhanced performance. Despite the lower predictive performance, the FFN was able to capture patterns and trends in the data, suggesting its applicability in forecasting future direction. Moreover, this study helps in identifying the optimal model based on specific objectives, whether prioritizing generalization or accuracy.

Vessel Trajectory Prediction Based on Automatic Identification System Data: Multi-Gated Attention Encoder Decoder Network

Utilizing time-series data from ship trajectories to forecast their subsequent movement is crucial for enhancing the safety within maritime traffic environments. The application of deep learning techniques, leveraging Automatic Identification System (AIS) data, has emerged as a pivotal area in maritime traffic studies. Within this domain, the precise forecasting of ship trajectories stands as a central challenge. In this study, we propose the multi-gated attention encoder decoder (MGAED) network, a model based on an encoder–decoder structure specialized for predicting ship trajectories in canals. The model employs a long short-term memory network (LSTM) as an encoder, combined with multiple Gated Recurrent Units (GRUs) and an attention mechanism for the decoder. Long-term dependencies in time-series data are captured through GRUs, while the attention mechanism is used to strengthen the model’s ability to capture key information, and a soft threshold residual structure is introduced to handle sparse features, thus enhancing the model’s generalization ability and robustness. The efficacy of our model is substantiated by an extensive evaluation against current deep learning benchmarks. Through comprehensive comparison experiments with existing deep learning methods, our model shows significant improvements in prediction accuracy, with an at least 9.63% reduction in the mean error (MAE) and an at least 20.0% reduction in the mean square error (MSE), providing a new solution to improve the accuracy and efficiency of ship trajectory prediction.

TimeNorm: a novel normalization method for time course microbiome data.

Metagenomic time-course studies provide valuable insights into the dynamics of microbial systems and have become increasingly popular alongside the reduction in costs of next-generation sequencing technologies. Normalization is a common but critical preprocessing step before proceeding with downstream analysis. To the best of our knowledge, currently there is no reported method to appropriately normalize microbial time-series data. We propose TimeNorm, a novel normalization method that considers the compositional property and time dependency in time-course microbiome data. It is the first method designed for normalizing time-series data within the same time point (intra-time normalization) and across time points (bridge normalization), separately. Intra-time normalization normalizes microbial samples under the same condition based on common dominant features. Bridge normalization detects and utilizes a group of most stable features across two adjacent time points for normalization. Through comprehensive simulation studies and application to a real study, we demonstrate that TimeNorm outperforms existing normalization methods and boosts the power of downstream differential abundance analysis.