Search

Multivariate multipoint evaluation is the problem of evaluating a multivariate polynomial, given as a coefficient vector, simultaneously at multiple evaluation points. In this work, we show that there exists a deterministic algorithm for multivariate multipoint evaluation over any finite field \(\mathbb {F}\) that outputs the evaluations of an m-variate polynomial of degree less than d in each variable at N points in time, \(\begin{equation*} (d^m+N)^{1+o(1)}\cdot {{\sf poly}}(m,d,\log |\mathbb {F}|), \end{equation*}\) for all \(m\in \mathbb {N}\) and all sufficiently large \(d\in \mathbb {N}\). A previous work of Kedlaya and Umans (FOCS 2008 and SICOMP 2011) achieved the same time complexity when the number of variables m is at most \(d^{o(1)}\) and had left the problem of removing this condition as an open problem. A recent work of Bhargava, Ghosh, Kumar, and Mohapatra (STOC 2022) answered this question when the underlying field is not too large and has characteristic less than \(d^{o(1)}\). In this work, we remove this constraint on the number of variables over all finite fields, thereby answering the question of Kedlaya and Umans over all finite fields. Our algorithm relies on a non-trivial combination of ideas from three seemingly different previously known algorithms for multivariate multipoint evaluation, namely the algorithms of Kedlaya and Umans, that of Björklund, Kaski, and Williams (IPEC 2017 and Algorithmica 2019), and that of Bhargava, Ghosh, Kumar, and Mohapatra, together with a result of Bombieri and Vinogradov from analytic number theory about the distribution of primes in an arithmetic progression. We also present a second algorithm for multivariate multipoint evaluation that is completely elementary and, in particular, avoids the use of the Bombieri–Vinogradov theorem. However, it requires a mild assumption that the field size is bounded by an exponential tower in d of bounded height. More specifically, our second algorithm solves the multivariate multipoint evaluation problem over a finite field \(\mathbb {F}\) in time, \(\begin{equation*} (d^m+N)^{1+o(1)}\cdot {{\sf poly}}(m,d,\log |\mathbb {F}|), \end{equation*}\) for all \(m\in \mathbb {N}\) and all sufficiently large \(d\in \mathbb {N}\) , provided that the size of the finite field \(\mathbb {F}\) is at most \((\exp (\exp (\exp (\cdots (\exp (d)))))\) , where the height of this tower of exponentials is fixed. [ABSTRACT FROM AUTHOR]

Multipoint evaluation is the computational task of evaluating a polynomial given as a list of coefficients at a given set of inputs. Besides being a natural and fundamental question in computer algebra on its own, fast algorithms for this problem are also closely related to fast algorithms for other natural algebraic questions such as polynomial factorization and modular composition. And while nearly linear time algorithms have been known for the univariate instance of multipoint evaluation for close to five decades due to a work of Borodin and Moenck [7], fast algorithms for the multivariate version have been much harder to come by. In a significant improvement to the state-of-the-art for this problem, Umans [25] and Kedlaya & Umans [16] gave nearly linear time algorithms for this problem over field of small characteristic and over all finite fields, respectively, provided that the number of variables n is at most do(1) where the degree of the input polynomial in every variable is less than d. They also stated the question of designing fast algorithms for the large variable case (i.e., n x do(1)) as an open problem. In this work, we show that there is a deterministic algorithm for multivariate multipoint evaluation over a field Fq of characteristic p, which evaluates an n-variate polynomial of degree less than d in each variable on N inputs in time provided that p is at most do(1), and q is at most (exp(exp(exp(· · · (exp(d))))), where the height of this tower of exponentials is fixed. When the number of variables is large (e.g., n x do(1)), this is the first nearly linear time algorithm for this problem over any (large enough) field. Our algorithm is based on elementary algebraic ideas, and this algebraic structure naturally leads to the following two independently interesting applications: --We show that there is an algebraic data structure for univariate polynomial evaluation with nearly linear space complexity and sublinear time complexity over finite fields of small characteristic and quasipolynomially bounded size. This provides a counterexample to a conjecture of Miltersen [21] who conjectured that over small finite fields, any algebraic data structure for polynomial evaluation using polynomial space must have linear query complexity. We also show that over finite fields of small characteristic and quasipolynomially bounded size, Vandermonde matrices are not rigid enough to yield size-depth tradeoffs for linear circuits via the current quantitative bounds in Valiant's program [26]. More precisely, for every fixed prime p, we show that for every constant e > 0, and large enough n, the rank of any n × n Vandermonde matrix V over the field Fpa can be reduced to (n/exp(O(poly(e)log0.53 n))) by changing at most nT(e) entries in every row of V, provided a = poly(logn). Prior to this work, similar upper bounds on rigidity were known only for special Vandermonde matrices. For instance, the Discrete Fourier Transform matrices and Vandermonde matrices with generators in a geometric progression [9]. [ABSTRACT FROM AUTHOR]

Certificateless public key infrastructure (PKI) avoids the key escrow problem associated with identity-based PKI and has recently been widely employed in anonymous communication schemes for vehicular adhoc networks (VANETs). In existing certificateless anonymous signcryption schemes for VANETs, vulnerabilities such as potential attacks involving the substitution of pseudonyms and the forging of pseudonymous public-private key pairs exist due to the lack of "identity-key binding" and "non-linearity processing of public-private key pairs." To address this issue, we propose an improved certificateless anonymous signcryption scheme based on elliptic curve cryptography. The scheme incorporates bilinear pairing as one of the authentication mechanisms, designs pseudonym generation algorithms and public-private key pair structures, and introduces a pseudonym verification mechanism. The correctness of the scheme is proven under the random oracle model, and its security is extensively demonstrated through detailed discussions on its confidentiality, authentication, unforgeability, anonymity, and traceability. Furthermore, the time and space complexity of the scheme are calculated. By comparing with recently published certificateless signcryption schemes, it is shown that the proposed scheme offers higher security with smaller computational and communication overheads. This certificateless vehicular network signcryption algorithm provides an efficient encryption solution for anonymous communication in vehicular networks, thereby ensuring the rapid development of secure technology for intelligent connected vehicle super terminals. [ABSTRACT FROM AUTHOR]

In this study, we analyze the changes over time in the complexity and structure of words used in article titles and the connections between articles in citation networks, focusing on the topic of artificial intelligence (AI) up to 2020. By measuring unpredictability in word usage and changes in the connections between articles, we gain insights into shifts in research focus and diversity of themes. Our investigation reveals correspondence between fluctuations in word complexity and changes in the structure of citation networks, highlighting links between thematic evolution and network dynamics. This approach not only enhances our understanding of scientific progress but also may help in anticipating emerging fields and fostering innovation, providing a quantitative lens for studying scientific domains beyond AI. [ABSTRACT FROM AUTHOR]

Recent studies have shown that graph‐based clustering methods are good at processing hyperspectral images (HSIs), while falling short for large‐scale HSIs due to high time complexity. Meanwhile, the performance of these methods relies on the quality of the constructed graph with selected anchor points. More anchor points bring better clustering results for graph‐based methods. Time complexity, however, sees a considerable increase as the number of anchor points grows. Therefore, a method that can obtain efficient clustering accuracy and consumes less time is to be developed. Against this backdrop, a novel algorithm named fast spectral clustering via efficient multilayer anchor graph (FEMAG) is proposed to resolve the accuracy and time‐consuming trade‐off problem. First, FEMAG adopts superpixel principal component analysis (SuperPCA) to extract the low‐dimensional features of HSIs. Then, a multilayer anchor graph is constructed to improve the clustering performance. When constructing the similarity graph, FEMAG takes balanced K‐means‐based hierarchical K‐means (BKHK) to obtain outperforming anchor points efficiently. Extensive experiments validate that FEMAG achieves better clustering accuracy while taking less time compared to previous clustering methods. [ABSTRACT FROM AUTHOR]

Background: The maximal sensitivity for local pairwise alignment makes the Smith-Waterman algorithm a popular choice for protein sequence database search. However, its quadratic time complexity makes it compute-intensive. Unfortunately, current state-of-the-art software tools are not able to leverage the massively parallel processing capabilities of modern GPUs with close-to-peak performance. This motivates the need for more efficient implementations. Results: CUDASW++4.0 is a fast software tool for scanning protein sequence databases with the Smith-Waterman algorithm on CUDA-enabled GPUs. Our approach achieves high efficiency for dynamic programming-based alignment computation by minimizing memory accesses and instructions. We provide both efficient matrix tiling, and sequence database partitioning schemes, and exploit next generation floating point arithmetic and novel DPX instructions. This leads to close-to-peak performance on modern GPU generations (Ampere, Ada, Hopper) with throughput rates of up to 1.94 TCUPS, 5.01 TCUPS, 5.71 TCUPS on an A100, L40S, and H100, respectively. Evaluation on the Swiss-Prot, UniRef50, and TrEMBL databases shows that CUDASW++4.0 gains over an order-of-magnitude performance improvements over previous GPU-based approaches (CUDASW++3.0, ADEPT, SW#DB). In addition, our algorithm demonstrates significant speedups over top-performing CPU-based tools (BLASTP, SWIPE, SWIMM2.0), can exploit multi-GPU nodes with linear scaling, and features an impressive energy efficiency of up to 15.7 GCUPS/Watt. Conclusion: CUDASW++4.0 changes the standing of GPUs in protein sequence database search with Smith-Waterman alignment by providing close-to-peak performance on modern GPUs. It is freely available at https://github.com/asbschmidt/CUDASW4. [ABSTRACT FROM AUTHOR]

Crater identification aims to match the craters of a planetary body observed in an image to the corresponding entries in a catalogue of known craters of the same body. It is a key step in crater-based navigation algorithms for planetary missions. Many crater identification methods extract descriptors from the observed craters and compare them to an index of descriptors constructed a priori from the crater catalogue. The need for viewpoint invariance motivates descriptors defined over crater tuples (e.g. , crater triads for projective invariance). However, this implies a descriptor index that grows rapidly (e.g. , cubically) with the size of the catalogue, which practically limits the spatial resolution and/or coverage of the catalogue. Another serious drawback is the sensitivity of the descriptors and the matching accuracy to noise and outliers in the crater detection result, which are inevitable due to imperfect crater detection algorithms. In this paper, we propose a novel descriptorless crater identification technique. At its core, our method solves the perspective cone alignment problem with geometric verification iteratively over the crater catalogue. We show that our simple algorithm, with time and space complexities that are linear in the catalogue size, is substantially more accurate than state-of-the-art descriptor-based methods in the presence of noise. Moreover, the availability of multi-core onboard processors raises the prospect of speeding up our method through parallelisation. • This paper introduces the first descriptor-less crater identification method. • It comprises a perspective cone alignment solver and a geometric verification scheme. • It achieves 2–3 orders of magnitude memory improvement over descriptor-based methods. • It demonstrated superior robustness against input noise and challenging conditions. [ABSTRACT FROM AUTHOR]

In this paper, the approximate parallel prefix adders with minimizing hardware and timing complexities are proposed. Moreover, an approximate multiplier based on these adders is designed. The approximate structures include two approximate Sklansky adders, one approximate Ladner-Fischer adder, and one approximate Kogge-Stone adder. The proposed adders are free from carry rippling. The main strategy for approximate design is primarily based on rearranging and deleting sub-blocks and secondary reducing the critical path delay and area in the adders. In this case, we have a trade-off between accuracy, delay, and area. The proposed approximate multiplier has a serial structure that is designed based on using one approximate parallel prefix adder. The proposed approximate adders and multiplier are compared from hardware and accuracy point of view such as gate count, delay, area delay product, error rate, mean error distance, mean relative error distance, and normalized error distance. The efficacy of proposed structures in image processing applications such as image smoothing (low-pass filter) and image multiplication is performed using MATLAB. The results show the proposed approximate structures are comparable in terms of area, delay, PSNR, and mean structural similarity index metric parameters with other works. [ABSTRACT FROM AUTHOR]

Nonlinearity in sensor measurements reduces the sensor's accuracy. Therefore, accurate calibration is necessary for reliable sensor operation. This study proposes a segmented calibration method that divides the input range into multiple sections and calculates the optimized calibration functions for each one. This approach reduces the overall error rate and improves the calibration accuracy by isolating distinctive regions. The modified progressive polynomial calibration technique is used to calculate the calibration function. This algorithm addresses the computational complexity, allowing for reduced polynomial degrees and improving the accuracy. The segmented calibration method achieves a significantly lower error rate of 0.000006% compared to the original single calibration method, which has an error rate of 0.0823%, when using the same six calibration points and a fifth-degree polynomial function. This method maintains improved accuracy with fewer calibration points, and its ability to reduce the computational complexity and calculation time while using lower polynomial degrees is confirmed. Additionally, it can be extended to two dimensions to reduce the errors caused by cross-sensitivity. The results from a two-dimensional simulation show a reduction in the error rate ranging from 15.84% to 2.07% in an 8-bit signed fixed-point system. These results indicate that the segmented calibration method is an effective and scalable solution for various typical sensors. [ABSTRACT FROM AUTHOR]

To enhance the decoding efficiency of Globally Coupled (GC) LDPC codes, we incorporated Early Termination (ET) and Forced Convergence (FC) into the local/global two-phase decoding algorithm to expedite the decoding process. The two-phase decoding scheme integrates the ET technique to halt unnecessary iterations in the local decoding phase while employing the FC technique to accelerate convergence in the global phase decoding. The application of ET technology in the local decoding of GC-LDPC codes will not cause performance loss as in traditional block codes and will cause considerable complexity gains. For a longer code length and larger convergence differences between nodes' global codes, the FC technique operates more efficiently in global code than local code. Two variants are proposed for the ET scheme in the local decoding, namely ET-1 and ET-2. The initial variant, ET-1, predicts whether local decoding can be successful according to data characteristics and stop the local decoding iteration that is not expected to be successful in time. In the case of ET-2, the saved local iterations are transformed to global decoding equally. The results show that ET-1 saves considerable decoding time complexity and ET-2 improves the performance of the GC-LDPC code with the same decoding time complexity. The combined approach of ET-1 with FC reduces the decoding time complexity up to 42% at a low Signal Noise Rate region while maintaining its performance; ET-2-FC two-phase decoding saves approximately 25% decoding time complexity while improving the BER by about 0.18 dB and FER by about 0.23 dB. [ABSTRACT FROM AUTHOR]

The poor timeliness of routing has always been an urgent problem in practical operator networks, especially in situations with large-scale networks and multiple network domains. In this article, a pruning idea of routing integrated with Dijkstra's shortest path searching is utilized to accelerate the process of routing in large-scale multi-domain elastic optical networks (EONs). The layered-graph approach is adopted in the spectrum allocation stage. To this end, an efficient heuristic algorithm is proposed, called "Branch-and-Bound based Routing and Layered Graph based Spectrum Allocation algorithm (BBR-LGSA)", which is an integrated RSA algorithm. Notably, the significant reduction in algorithm time complexity is not only reflected in the pruning method used in the routing stage but also in the construction of auxiliary graphs during the spectrum allocation stage utilizing the Branch-and-Bound method. Simulation results show that the proposed BBR-LGSA significantly reduces the average running time by nearly 78% with higher spectrum utilization in large-scale multi-domain EONs, compared with benchmark algorithms. In addition, the impact of key parameters on performance comparisons of different algorithms is evaluated. [ABSTRACT FROM AUTHOR]

This research paper explores the CONIKS key management system's security and efficiency, a system designed to ensure transparency and privacy in cryptographic operations. We conducted a comprehensive analysis of the underlying mathematical principles, focusing on cryptographic hash functions and digital signature schemes, and their implementation in the CONIKS model. Through the use of Merkle trees, we verified the integrity of the system, while zero-knowledge proofs were utilized to ensure the confidentiality of key bindings. We conducted experimental evaluations to measure the performance of cryptographic operations like key generation, signing, and verification with varying key sizes and compared the results against theoretical expectations. Our findings demonstrate that the system performs as predicted by cryptographic theory, with only minor deviations in computational time complexities. The analysis also reveals significant trade-offs between security and efficiency, particularly when larger key sizes are used. These results confirm that the CONIKS system offers a robust framework for secure and efficient key management, highlighting its potential for real-world applications in secure communication systems. [ABSTRACT FROM AUTHOR]

The geospatial domain increasingly relies on data-driven methodologies to extract actionable insights from the growing volume of available data. Despite the effectiveness of tree-based models in capturing complex relationships between features and targets, they fall short when it comes to considering spatial factors. This limitation arises from their reliance on univariate, axis-parallel splits that result in rectangular areas on a map. To address this issue and enhance both performance and interpretability, we propose a solution that introduces two novel bivariate splits: an oblique and Gaussian split designed specifically for geographic coordinates. Our innovation, called Geospatial Random Forest (geoRF), builds upon Geospatial Regression Trees (GeoTrees) to effectively incorporate geographic features and extract maximum spatial insights. Through an extensive benchmark, we show that our geoRF model outperforms traditional spatial statistical models, other spatial RF variations, machine learning and deep learning methods across a range of geospatial tasks. Furthermore, we contextualize our method's computational time complexity relative to baseline approaches. Our prediction maps illustrate that geoRF produces more robust and intuitive decision boundaries compared to conventional tree-based models. Utilizing impurity-based feature importance measures, we validate geoRF's effectiveness in highlighting the significance of geographic coordinates, especially in data sets exhibiting pronounced spatial patterns. [ABSTRACT FROM AUTHOR]

3D printing technology proves itself to be effective in the field of medical industry due to processing potential of titanium alloys. Nonetheless it also has its drawbacks, the most severe being high roughness of printed elements’ area as well as the need to remove support structures created following the printing. Mechanical processing is commonly used for said parameters being enhanced. The completion of that process, however, takes a lot of time and prevents hard-to-reach elements from being reached. The task of this article is to provide a new method of firming the print’s surface and removing load-bearing structures. To achieve this, selective laser melting (SLM) technology will be used along with bathing prints in HF/HNO3 solution, all of which are supported by ultrasound. This process will enhance the material fatigue processing while reducing the postprocessing time and complexity. [ABSTRACT FROM AUTHOR]

Self-sufficient sensors scattered over different regions of the world comprise distributed wireless sensor networks (DWSNs), which track a range of environmental and physical factors such as pressure, temperature, vibration, sound, motion, and pollution. The use of data fusion becomes essential for combining information from various sensors and system performance. In this study, we suggested the multi-class support vector machine (SDF-MCSVM) with synthetic minority over-sampling techniques (SMOTE) data fusion for wireless sensor network (WSN) performance. The dataset includes 1,334 instances of hourly averaged answers for 12 variables from an AIR quality chemical multisensor device. To create a balanced dataset, the unbalanced data was first pre-processed using the SMOTE. The grey wolf optimization (GWO) approach is then used to reduce features in an effort to improve the efficacy and efficiency of feature selection procedures. This method is applied to classify the fused feature vectors into multiple categories at once to improve classification performance in WSNs and address unbalance datasets. The result shows the proposed method reaches high precision, accuracy, F1-score, recall, and specificity. The computational complexity and processing time were decreased in the study by using the proposed method. This is great potential for accurate and timely data fusion in dispersed WSNs with the successful integration of data fusion technologies. [ABSTRACT FROM AUTHOR]

Large fingerprint databases can make the automated search process tedious and time‐consuming. Fingerprint pattern classification is a significant step in the identification system's complexity in terms of time and speed. Although several fingerprint algorithms have been developed for classification tasks, further improvements in performance and efficiency are still required. Most of the fingerprint algorithms use deep learning techniques. However, some deep learning techniques can be resource‐intensive and computationally expensive, while others can disregard the spatial relationships between the features used in classifying fingerprint patterns. This study proposes using lightweight deep learning models (i.e., MobileNet and EfficientNet‐B0) integrated with attention modules to classify fingerprint patterns. The two lightweight models are modified, yielding MobileNet+ and EfficientNet‐B0+ models. The lightweight deep learning models can help achieve optimal performance and reduce computational complexity. The attention modules focus on distinctive features for classification. Our proposed approach integrates four attention modules for fingerprint pattern classification into two lightweight deep learning models, that is, MobileNet+ and EfficientNet‐B0+. To evaluate our approach, we use two publicly available fingerprint datasets, that is, the NIST special database 301 dataset and the LivDet dataset. The evaluation results show that the EfficientNet‐B0+ model achieves the highest classification accuracy of 97% with only 854,086 training parameters. As a conclusion, we consider the training parameters small enough for the EfficientNet‐B0+ model to be deployed on low‐resource devices. [ABSTRACT FROM AUTHOR]

Linear cryptanalysis is one of the most classical cryptanalysis methods for block ciphers. Some critical techniques of the key-recovery phase are developed for enhancing linear cryptanalysis. Collard et al. improved the time complexity for last-round key-recovery attacks by using FWT. A generalized key-recovery algorithm for an arbitrary number of rounds with an associated time complexity formula is further provided by Flórez-Gutiérrez and Naya-Plasencia based on FWT in Eurocrypt 2020. However, the previous generalized algorithms are mainly applied to block ciphers with SPN structures, where the round-keys in the first and last round XORed to the state can be easily defined as outer keys. In Asiacrypt 2021, Leurent et al. applied the algorithm by Flórez-Gutiérrez et al. to Feistel structure ciphers. However, for other structures, such as NLFSR-based, the outer keys can not be directly deduced to utilize the previous algorithms. This paper extends the algorithm by Flórez-Gutiérrez et al. for more complicated structures, including but not limited to NLFSR-based, Feistel, ARX, and SPN. We also use the dependency relationships between ciphertext, plaintext and key information bits to eliminate the redundancy calculation and the improve analysis phase. We apply the algorithm with the improved analysis phase to KATAN (NLFSR-based) and SPARX (ARX). We obtain significantly improved results. The linear results we find for SPARX-128/128 beat other cryptanalytic techniques, becoming the best key recovery attacks on this cipher. The previous best linear attacks on KATAN32, KATAN48 and KATAN64 are improved by 9, 4, and 14 rounds, respectively. [ABSTRACT FROM AUTHOR]

Quantum algorithms have demonstrated extraordinary potential across numerous fields, offering significant advantages in solving practical problems. Power Quality Disturbances (PQDs) have always been a critical factor affecting the stability and safety of electrical power systems, and accurately detecting and identifying PQDs is crucial for ensuring reliable system operation. This paper explores the application of quantum algorithms in the field of power quality and proposes a novel method using Quantum Support Vector Machines (QSVM) to detect and identify PQDs, which marks the first application of QSVM in PQD analysis. The QSVM model employed involves three main stages: quantum feature mapping, quantum kernel computation, and model training. Quantum feature mapping uses quantum circuits to map classical data into a high-dimensional Hilbert space, enhancing feature separability. Quantum kernel computation calculates the inner products between features for model training. Rigorous theoretical and experimental analyses validate our approach. This method achieves a time complexity of O (N 2 log (N)) , superior to classical SVM algorithms. Simulation results show high accuracy in PQDs detection, achieving a 100% detection rate and a 96.25% accuracy rate in single PQD identification. Experimental outcomes demonstrate robustness, maintaining over 87% accuracy even with increased noise levels, confirming its effectiveness in PQDs detection and identification. [ABSTRACT FROM AUTHOR]

Physical unclonable functions (PUFs) have emerged as a favorable hardware security primitive, they exploit the process variations to provide unique signatures or secret keys amidst other critical cryptographic applications. CMOS-based PUFs are the most popular type, they generate unique bit strings using process variations in semiconductor fabrication. However, most existing CMOS PUFs are found to be vulnerable to modeling attacks based on machine learning (ML) algorithms. Memristors leveraging nanotechnology fabrication processes and highly nonlinear behavior became an interesting alternative to the existing CMOS-based PUF technology, introducing cryptographic and resilient random outputs. Memristor-based PUFs are emerging due to the inherent randomness at both the memristor level due to the cycle-to-cycle (C2C) programming variation of the device and the fabrication process level such as the cross-sectional area and variations. Our study focuses on building a machine learning analysis and attack framework of tools on C u / H f O 2 - x / p + + S i memristor-based PUF (MR-PUF). Our objective is to test the resiliency of the security margins of the presented PUF using machine learning analysis tools, on-top of holistic NIST cryptographic randomness testing initially provided, to provide a high level of certainty in predicting the randomness output of the verified Memrister-based PUF. Our main contribution is a holistic study that focuses on attacking the randomness output resiliency based on building randomness predictors using Logistic Regression (LR), Support Vector Machine (SVM), Gaussian Mixture Models (GMM), K-means, K-means + + , Random Forest, XGBoost and LSTM, within efficient time, and data complexity. Our results yield low accuracy and ROC results of within 0.49 - 0.52 and 0.49 - 0.52 respectively, indicating failure in predicting random data demonstrates efficient randomness prediction resiliency of the MR-PUF. The efficient time and data complexities of these attacks illustrated in this study are yielded to be linear and quadratic resulting in attack execution time in seconds and 5032 training samples combined with 2157 testing samples to verify the randomness of PUF. [ABSTRACT FROM AUTHOR]

Min–max programming problems with addition–min constraints have been studied in the literature to model data transfer in BitTorrent-like peer-to-peer file-sharing systems. It is well known that the class of overlap functions contains various operators, including the "min" operator. The aim of this paper is to generalize the above min–max programming problem with addition–overlap function constraints. We demonstrate that this new optimization problem can be transformed into a simplified single-variable optimization problem, which makes it easier to find an optimal solution. The bisection method will be used to find this optimal solution. In addition, when the overlap function is explicitly specified, an iterative method is given to compute the optimal objective value with a polynomial time complexity. A numerical example is provided to illustrate the procedures. [ABSTRACT FROM AUTHOR]

In this paper, we study covert communications in a hybrid decode-and-forward (DF)/ amplify-and-forward (AF) relay system. The considered relay in normal operation forwards messages from a source node to a destination node in either DF or AF mode on request. Meanwhile, the source and destination nodes also attempt to secretly exchange covert messages such as confidential or sensitive information and avoid detection by the covert message detector embedded on the relay. We first establish an optimal DF/AF mode selection criterion to maximize the covert rate based on the analyses of delay-aware achievable covert rates of individual DF and AF modes. To further reduce the time complexity, we propose a low-complexity selection criterion as well for practical use. The numerical results demonstrate the covert rate gain as high as 50% and running time gain as high as 20% for particular system parameters, which verify the effectiveness of the proposed criteria. [ABSTRACT FROM AUTHOR]

Although existing in situ oceanographic data are sparse, such data still play an important role in submarine monitoring and forecasting. Considering budget limitations, an efficient spatial sampling scheme is critical to obtain data with much information from as few sampling stations as possible. This study improved existing sampling methods based on the Quadtree (QT) algorithm. In the first-phase sampling, the gradient-based QT (GQT) algorithm is recommended since it avoids the repeated calculation of variance in the Variance QT (VQT) algorithm. In addition, based on the GQT algorithm, we also propose the algorithm considering the change in variation (the GGQT algorithm) to alleviate excessive attention to the area with large changes. In second-phase sampling, QT decomposition and the greedy algorithm are combined (the BG algorithm). QT decomposition is used to divide the region into small blocks first, and then within the small blocks, the greedy algorithm is applied to sampling simultaneously. In terms of sampling efficiency, both the GQT (GGQT) algorithm and the BG algorithm are close to the constant time complexity, which is much lower than the time consumption of the VQT algorithm and the dynamic greedy (DG) algorithm and conducive to large-scale sampling tasks. At the same time, the algorithms recommend above share similar qualities with the VQT algorithm and the dynamic greedy algorithm. [ABSTRACT FROM AUTHOR]

The N-Queens problem is a fundamental challenge in combinatorial optimization, commonly used as a benchmark for assessing the efficiency of algorithms. Traditional algorithms, such as Backtracking with Forward Checking (BFC), constraint satisfaction problem (CSP) techniques, Lookahead algorithms, and heuristic-based methods, often face challenges with exponential time complexity, making them less practical for large-scale instances. This paper introduces a novel algorithm, non-sequential conflict resolution (NSCR), which improves performance over traditional algorithms through dynamic conflict resolution. The NSCR algorithm iteratively resolves conflicts among queens by adjusting their positions, aiming to optimize both time complexity and memory usage. While NSCR also operates within exponential time bounds, it demonstrates improved scalability and efficiency compared to traditional methods. A significant strength of the NSCR algorithm lies in its space complexity, which is O(n), and a time complexity that, while typically lower than traditional methods, can reach O(n3) in the worst-case scenario. This linear space complexity is highly advantageous, particularly when dealing with large problem sizes, as it ensures efficient use of memory resources. Comparative analysis with the aforementioned algorithms shows that NSCR offers superior resource management, using up to 60% less memory and reducing runtime by approximately 50%, making it an efficient option for large-scale instances of the N-Queens problem. The algorithm's performance, evaluated on problem sizes ranging from 8 to 1000 queens, highlights its ability to manage computational resources effectively, despite the inherent challenges of exponential time complexity. [ABSTRACT FROM AUTHOR]

Recent studies have shown the potential of transformer-based neural networks in increasing prediction capacity. However, classical transformers present several problems such as computational time complexity and high memory requirements, which make Long Sequence Time-Series Forecasting (LSTF) challenging. The contribution to the prediction of time series of flood events using deep learning techniques is examined, with a particular focus on evaluating the performance of the Informer model (a particular implementation of transformer architecture), which attempts to address the previous issues. The predictive capabilities of the Informer model are explored and compared to statistical methods, stochastic models and traditional deep neural networks. The accuracy, efficiency as well as the limits of the approaches are demonstrated via numerical benchmarks relating to real river streamflow applications. Using daily flow data from the River Test in England as the main case study, we conduct a rigorous evaluation of the Informer efficacy in capturing the complex temporal dependencies inherent in streamflow time series. The analysis is extended to encompass diverse time series datasets from various locations (>100) in the United Kingdom, providing insights into the generalizability of the Informer. The results highlight the superiority of the Informer model over established forecasting methods, especially regarding the LSTF problem. For a forecast horizon of 168 days, the Informer model achieves an NSE of 0.8 and maintains a MAPE below 10%, while the second-best model (LSTM) only achieves −0.63 and 25%, respectively. Furthermore, it is observed that the dependence structure of time series, as expressed by the climacogram, affects the performance of the Informer network. [ABSTRACT FROM AUTHOR]

Accurate forecasting of ship encounter positions is crucial for preventing collisions at sea. This paper presents a framework for predicting a ship's trajectory using a sparse Gaussian process. The proposed method effectively addresses the limitations of existing full Gaussian processes, specifically the significant storage requirements and time complexity associated with data training. The model is trained using Automatic Identification System (AIS) data on trajectories, with hyperparameters optimized through a genetic algorithm. Experimental analysis demonstrates that the proposed model reduces average time complexity by 61.3 s and improves average prediction error to 9.2 m compared to full Gaussian-process-based models. [ABSTRACT FROM AUTHOR]

The graph theory is one of the fundamental structures in computer science used to model various scientific and engineering problems. Many problems within the graph theory are categorized as NP-hard and NP-complete. One such problem is the minimum dominating set (MDS) problem, which seeks to identify the minimum possible subsets in a graph such that every other node in the subset is directly connected to a node in this subset. Due to its inherent complexity, developing an efficient polynomial-time method to address the MDS problem remains a significant challenge in graph theory. This paper introduces a novel algorithm that utilizes a centrality measure known as the Malatya Centrality to effectively address the MDS problem. The proposed algorithm, called the Malatya Dominating Set Algorithm (MDSA), leverages centrality values to identify dominating sets within a graph. It extends the Malatya centrality by incorporating a second-level centrality measure, which enhances the identification of dominating nodes. Through a systematic and algorithmic approach, these centrality values are employed to pinpoint the elements of the dominating set. The MDSA uniquely integrates greedy and dynamic programming strategies. At each step, the algorithm selects the most optimal (or near-optimal) node based on the centrality values (greedy approach) while updating the neighboring nodes' criteria to influence subsequent decisions (dynamic programming). The proposed algorithm demonstrates efficient performance, particularly in large-scale graphs, with time and space requirements scaling proportionally with the size of the graph and its average degree. Experimental results indicate that our algorithm outperforms existing methods, especially in terms of time complexity when applied to large datasets, showcasing its effectiveness in addressing the MDS problem. [ABSTRACT FROM AUTHOR]

Glaucoma represents a significant global contributor to blindness. Accurately segmenting the optic disc (OD) and optic cup (OC) to obtain precise CDR is essential for effective screening. However, existing convolutional neural network (CNN)-based segmentation techniques are often limited by high computational demands and long inference times. This paper proposes an efficient end-to-end method for OD and OC segmentation, utilizing the lightweight MobileNetv3 network as the core feature-extraction module. Our approach combines boundary branches with adversarial learning, to achieve multi-label segmentation of the OD and OC. We validated our proposed approach across three public available datasets: Drishti-GS, RIM-ONE-r3, and REFUGE. The outcomes reveal that the Dice coefficients for the segmentation of OD and OC within these datasets are 0.974/0.900, 0.966/0.875, and 0.962/0.880, respectively. Additionally, our method substantially lowers computational complexity and inference time, thereby enabling efficient and precise segmentation of the optic disc and optic cup. [ABSTRACT FROM AUTHOR]

In this paper, we address the challenge of creating candidate sets for large-scale Traveling Salesman Problem (TSP) instances, where choosing a subset of edges is crucial for efficiency. Traditional methods for improving tours, such as local searches and heuristics, depend greatly on the quality of these candidate sets but often struggle in large-scale situations due to insufficient edge coverage or high time complexity. We present a new heuristic based on fuzzy clustering, designed to produce high-quality candidate sets with nearly linear time complexity. Thoroughly tested on benchmark instances, including VLSI and Euclidean types with up to 316,000 nodes, our method consistently outperforms traditional and current leading techniques for large TSPs. Our heuristic's tours encompass nearly all edges of optimal or best-known solutions, and its candidate sets are significantly smaller than those produced with the POPMUSIC heuristic. This results in faster execution of subsequent improvement methods, such as Helsgaun's Lin–Kernighan heuristic and evolutionary algorithms. This substantial enhancement in computation time and solution quality establishes our method as a promising approach for effectively solving large-scale TSP instances. [ABSTRACT FROM AUTHOR]

Existing methods to obtain position from inertial sensors typically use a combination of multiple sensors and orientation modeling; thus, obtaining position from a single inertial sensor is highly desirable given the decreased setup time and reduced complexity. The dead reckoning method is commonly chosen to obtain position from acceleration; however, when applied to upper limb tracking, the accuracy of position estimates are questionable, which limits feasibility. A new method of obtaining position estimates through the use of zero velocity updates is reported, using a commercial IMU, a push-to-make momentary switch, and a 3D printed object to house the sensors. The generated position estimates can subsequently be converted into sound through sonification to provide audio feedback on reaching movements for rehabilitation applications. An evaluation of the performance of the generated position estimates from a system labeled 'Soniccup' is presented through a comparison with the outputs from a Vicon Nexus system. The results indicate that for reaching movements below one second in duration, the Soniccup produces positional estimates with high similarity to the same movements captured through the Vicon system, corresponding to comparable audio output from the two systems. However, future work to improve the performance of longer-duration movements and reduce the system latency to produce real-time audio feedback is required to improve the acceptability of the system. [ABSTRACT FROM AUTHOR]

Plant Leaf Disease (PLD) detection is helpful for several fields like Agriculture Institute and Biological Research. The country’s economic growth depends on the productivity of the agricultural field. Recently developed models based on deep learning give more accurate and precise results over the detection and classification of PLD while evolving through image processing approaches. Many image-processing approaches are used for the identification and classification of PLD. The quality of agricultural products is mainly affected by several factors like fungi, bacteria, and viruses. These factors severely destroy the entire growth of the plant. Hence, some outperformed models are needed to detect and identify the severity level of plant diseases yet, the identification requires more time and has a struggle to identify the appropriate type of disease based on its symptoms. Therefore, several automatic detection and classification models are developed to avoid the time complexity. Computerized image processing approaches are utilized for crop protection, which analyzes the color information of leaves from the collected images. Hence, image processing techniques play an important role in the identification and classification of PLD. It gives more advantages by lowering the task of illustrating crops on large farms and detecting the leaf diseases at the initial stage itself based on the symptoms of the plant leaves. While implementing a new model, there is a need to study various machine and deep learning-based structures for PLD detection approaches. This research work provides an overview of various heuristic approaches, machine learning, and deep learning models for the detection and classification of PLD. This research work also covers the various constraints like PLD detection tools, performance measures, datasets used, and chronological review. Finally, the research work explores the research findings and also the research gaps with future scope. [ABSTRACT FROM AUTHOR]

In a market, there are many groups caused by geographical location or other reasons, and consumers in groups have their own brand preferences for a type of products. The diversity of consumers' brand preferences will avoid the phenomenon of brand simplification and monopoly caused by consistent brand reference of consumers, and to some extent, promote the prosperity and development of various brands in each group. For brand diversification in a market, we hope the brand preferences of consumers in each groups are as equilibrious as possible, so Influence Maximization under Equilibrious Groups (IMEG) is proposed to select k nodes to maximize the number of equilibrious groups after information diffusion. This paper proves that the IMEG is NP-hard, and computing the objective function is #P-hard. It also proves that the objective function is neither submodular nor supermodular under Independent Cascade (IC) model and Linear Threshold (LT) model. Then, the Equilibrious Groups Maximization Solution (EGMS) algorithm is presented to solve our problem. And by comparing with baseline algorithms using different datasets (dolphins, wildbird, weaver and hamsterster), it can be found that the EGMS has obvious advantages in time complexity and spatial complexity. In particular, the running time of EGMS is about 3.7 × 10 - 2 , 2.4 × 10 - 2 , 1.1 × 10 - 1 and 1.8 × 10 - 3 times that of the fastest baseline algorithm in dolphins, wildbird, weaver and hamsterster respectively. And the experiments in small-world, scale-free, random and regular network verify the robustness of EGMS with the varying parameters, such as the number of nodes, the probability of adding edges and the number of adjacencies. [ABSTRACT FROM AUTHOR]

Although the density peak clustering (DPC) algorithm can effectively distribute samples and quickly identify noise points, it lacks adaptability and cannot consider the local data structure. In addition, clustering algorithms generally suffer from high time complexity. Prior research suggests that clustering algorithms grounded in P systems can mitigate time complexity concerns. Within the realm of membrane systems (P systems), spiking neural P systems (SN P systems), inspired by biological nervous systems, are third-generation neural networks that possess intricate structures and offer substantial parallelism advantages. Thus, this study first improved the DPC by introducing the maximum nearest neighbor distance and K-nearest neighbors (KNN). Moreover, a method based on delayed spiking neural P systems (DSN P systems) was proposed to improve the performance of the algorithm. Subsequently, the DSNP-ANDPC algorithm was proposed. The effectiveness of DSNP–ANDPC was evaluated through comprehensive evaluations across four synthetic datasets and 10 real-world datasets. The proposed method outperformed the other comparison methods in most cases. [ABSTRACT FROM AUTHOR]

Analog circuits composed by large number of nodes in a tightly coupled structure pose significant challenges due to their prohibitive CPU simulation time. This work describes a method to speed up the simulation of such circuits by means of the combination of space state formulation of circuit equations with explicit integration methods parallelized over a many-core processor such as a GPU. Although stability of explicit techniques require smaller integration steps compared to implicit methods, the proposed method employs a fast estimate of the maximum allowed step size to guarantee numerical stability, which yields a shorter simulation time for increasing complexity circuit architectures. Moreover, the proposed technique can be straightforward parallelized on a many core architecture. The proposed method is demonstrated with two examples using constant and variable coefficients respectively: an RLC interconnect and a MOS-C network to perform Gaussian filtering of medium resolution images. The results obtained have been compared to a parallel version of SPICE and show improvements up to two orders of magnitude for transient simulations depending of the circuit size. [ABSTRACT FROM AUTHOR]

This paper proposes an encryption algorithm for crucial areas of a video based on chaos and a neural network, which SVEA (Selective Video Encryption Algorithm). The critical areas of each frame in a video are extracted by deep learning to the encryption system. A one-step encryption algorithm is used to encrypt these critical areas based on chaos, where scrambling and diffusion are simultaneously performed. A new chaotic system 2D extended Schaffer function map (2D-ESFM) is utilized in the encryption system, inspired by the Schaffer function. The system has demonstrated excellent performance through Lyapunov exponents (LEs), permutation entropy (PE), the 0-1 test, and other methods. Additionally, to resist chosen plaintext attacks, the secret key is generated by a neural network, with the critical areas of the video as inputs to the neural network. The chaotic system generates the biases and weights for the neural network. We evaluate SVEA on our dataset (Gymnastics at the Olympic Games) and public datasets. SVEA exhibits strong security characteristics compared to state-of-the-art algorithms and reduces time complexity by approximately 51.3%. • An encryption algorithm for critical areas of a video is proposed. • A 2D extended Schaffer function map (2D-ESFM) with a larger parameter space and a better performance is proposed. • The secret key of the cryptosystem is generated by the neural network, and a one-step encryption method is proposed. • A dataset is built about video encryption, called "Gymnastics at the Olympic Games". [ABSTRACT FROM AUTHOR]

A hybrid structure is an arrangement that makes use of many hierarchical reporting structures and is applied to algebraic structures such as groups and rings. In the discipline of abstract algebra, an ideal of a near-ring is a unique subset of its elements in ring theory. Ideals generalize specific subsets of integers, such as even numbers or multiples of three. Researchers have been using mathematical theories of fuzzy sets in ring theory to explain the uncertainties that emerge in various domains such as art and science, engineering, medical science, and in environment. By fusing soft sets and fuzzy sets, a new mathematical tool that has significant advantages in dealing with uncertain information is provided. Consequently, there is always some discrepancy between reality's haziness and its mathematical model's precision. Hence ring theory has been widely used in many researches but there is some uncertainty in converting the fuzzy sets to a hybrid structure of any algebraic structure. Many approaches were done in groups. Therefore, the Hybrid structure of fuzzy sets in near rings is introduced, in which the fuzzy ideals are converted to hybrid ideals and fuzzy maximal ideals are converted to hybrid maximal ideals. For hybridization, firstly the hybrid structure is established and then sub-near rings and near rings are also determined. Then the hybrid structure of sub-near rings and ideals is introduced. This converts the fuzzy ideals and fuzzy maximal ideals to hybrid ideals and hybrid maximal ideals. The result obtained by the proposed model efficiently solved the uncertainty problems and the effectiveness of the proposed approach shows the best class, mean, worst class, and time complexity. [ABSTRACT FROM AUTHOR]

Dynamic networks are ubiquitous in many domains for modelling evolving graph-structured data and detecting changes allows us to understand the dynamic of the domain represented. A category of computational solutions is represented by the pattern-based change detectors (PBCDs), which are non-parametric unsupervised change detection methods based on observed changes in sets of frequent patterns over time. Patterns have the ability to depict the structural information of the sub-graphs, becoming a useful tool in the interpretation of the changes. Existing PBCDs often rely on exhaustive mining, which corresponds to the worst-case exponential time complexity, making this category of algorithms inefficient in practice. In fact, in such a case, the pattern mining process is even more time-consuming and inefficient due to the combinatorial explosion of the sub-graph pattern space caused by the inherent complexity of the graph structure. Non-exhaustive search strategies can represent a possible approach to this problem, also because not all the possible frequent patterns contribute to changes in the time-evolving data. In this paper, we investigate the viability of different heuristic approaches which prevent the complete exploration of the search space, by returning a concise set of sub-graph patterns (compared to the exhaustive case). The heuristics differ on the criterion used to select representative patterns. The results obtained on real-world and synthetic dynamic networks show that these solutions are effective, when mining patterns, and even more accurate when detecting changes. [ABSTRACT FROM AUTHOR]

Mobile agents are agents that can migrate from host-to-host to work in a heterogeneous network environment. A mobile agent can migrate from host-to-host in its plan with the statistics generated on each host through a route known as migration pattern. Migration pattern therefore is the route the agents use to travel within the plan from the first host to the last host. However, there is a need for a comparison between the commonly used optimization algorithms in developing migration patterns for mobile agents with respect to some evaluation metrics. In this paper, the three techniques firefly algorithm (FFA), honeybee optimization (HBO) and particle swarm optimization (PSO) were used for developing migration patterns for mobile agents and their comparison was done based on migration time, time complexity and network load as metrics. PSO is discovered to perform better in terms of network load with an average of 242.3905 bits per second (bps), time complexity with an average of 41.2688 number of nodes (n), and migration/transmission time with an average of 4.203462 seconds (s). [ABSTRACT FROM AUTHOR]

Most existing knowledge graphs (KGs) suffer from incompleteness, which will be detrimental to a variety of downstream applications. Link prediction is the task of predicting missing links in the KGs and can effectively address the issue of incompleteness by knowledge graph embedding (KGE). ConvE, a relatively popular KGE model based on convolutional neural networks, has shown superiority in link prediction. Some subsequent extension models of ConvE achieve state-of-the-art performance by increasing complexity and training time, which result in a high risk of overfitting and a limited performance due to the large number of parameters concentrated in the fully connected projection layer. To address these challenges, we for the first time innovatively introduce and extend a recently simple network architecture gMLP (based on multi-layer perceptrons MLPs with gating) in vision applications for link prediction. We propose a simple and efficient model called gMLP-KGE, which consists of an embedding layer, an input layer, an extended gMLP layer, and an output layer. Extensive experiments show that the number of parameters of gMLP-KGE is close to that of ConvE and less than other extension models, while gMLP-KGE consistently performs well on seven datasets of different scales under most evaluation metrics. [ABSTRACT FROM AUTHOR]

Many ecological systems dominated by stochastic dynamics can produce complex time series that inherently limit forecast accuracy. The 'intrinsic predictability' of these systems can be approximated by a time series complexity metric called weighted permutation entropy (WPE). While WPE is a useful metric to gauge forecast performance prior to model building, it is sensitive to noise and may be biased depending on the length of the time series. Here, we introduce a simple randomized permutation test (rWPE) to assess whether a time series is intrinsically more predictable than white noise.We apply rWPE to both simulated and empirical data to assess its performance and usefulness. To do this, we simulate population dynamics under various scenarios, including a linear trend, chaotic, periodic and equilibrium dynamics. We further test this approach with observed abundance time series for 932 species across four orders of animals from the Global Population Dynamics Database. Finally, using Adélie (Pygoscelis adeliae) and emperor penguin (Aptenodytes forsteri) time series as case studies, we demonstrate the application of rWPE to multiple populations for a single species.We show that rWPE can determine whether a system is significantly more predictable than white noise, even with time series as short as 10 years that show an apparent trend under biologically realistic stochasticity levels. Additionally, rWPE has statistical power close to 100% when time series are at least 30 time steps long and show chaotic or periodic dynamics. Power decreases to ~10% under equilibrium dynamics, irrespective of time series length. Among four classes of animal taxa, mammals have the highest relative frequency (28%) of time series that are both longer than 30 time steps and indistinguishable from white noise in terms of complexity, followed by insects (16%), birds (16%) and bony fishes (11%).rWPE is a straightforward and useful method widely applicable to any time series, including short ones. By informing forecasters of the inherent limitations to a system's predictability, it can guide a modeller's expectations for forecast performance. [ABSTRACT FROM AUTHOR]

A satisfactory partition is a partition of undirected-graph vertices such that the partition has only two nonempty parts, and every vertex has at least as many adjacent vertices in its part as it has in the other part. Generally, the problem of determining whether a given undirected graph has a satisfactory partition is known to be NP-complete. In this paper, we show that for a given undirected graph with n vertices, a satisfactory partition (if any exists) can be computed recursively with a recursion tree of depth of O (ln ⁡ n) in expectation. Subsequently, we show that a satisfactory partition for those undirected graphs with recursion tree depth meeting the expectation can be computed in time O (n 3 2 O (ln ⁡ n)). [ABSTRACT FROM AUTHOR]

This article presents a methodology for analyzing probabilistic air traffic complexity by integrating prediction uncertainties in convective weather scenarios. With the Performance Review Unit (PRU) model as a base, this method modifies the original framework by incorporating a weather-related complexity indicator. The approach was tested in Austrian airspace using ensemble weather forecasts and historical flight plan data. The results demonstrated that a probabilistic model effectively assesses traffic complexity and captures trends in complexity over time, providing greater reliability in high-complexity sectors. Validation revealed a strong alignment between simulator complexity values and probabilistic complexity, especially in sectors characterized by dense data distributions. In contrast, sectors with more elongated distributions tended to overestimate complexity. Quantitative analysis indicated that the error between the probabilistic mean complexity and the simulator complexity values ranged from 12% to 23%, with higher errors in sectors with lower complexity. This validation confirmed the model's ability to predict complexity trends, thereby assisting flow manager positions (FMPs) in traffic flow and airspace management. Overall, this study demonstrated that probabilistic complexity assessment provides a deeper understanding of traffic behaviour, facilitating more effective air traffic flow management in uncertain and dynamic conditions. [ABSTRACT FROM AUTHOR]

The Single-Source Shortest Paths (SSSP) graph problem is a fundamental computation. This study attempted to characterize concretely the energy behaviors of the two primary methods to solve it, the Bellman–Ford and Dijkstra algorithms. The very different interactions of the algorithms with the hardware may have significant implications for energy. The study was motivated by the multidisciplinary nature of the problem. Gaining better insights should help vital applications in many domains. The work used reliable embedded sensors in an HPC-class CPU to collect empirical data for a wide range of sizes for two graph cases: complete as an upper-bound case and moderately dense. The findings confirmed that Dijkstra's algorithm is drastically more energy efficient, as expected from its decisive time complexity advantage. In terms of power draw, however, Bellman–Ford had an advantage for sizes that fit in the upper parts of the memory hierarchy (up to 2.36 W on average), with a region of near parity in both power draw and total energy budgets. This result correlated with the interaction of lighter logic and graph footprint in memory with the Level 2 cache. It should be significant for applications that rely on solving a lot of small instances since Bellman–Ford is more general and is easier to implement. It also suggests implications for the design and parallelization of the algorithms when efficiency in power draw is in mind. [ABSTRACT FROM AUTHOR]

Survey data play a crucial role in various research fields, including economics, education, and healthcare, by providing insights into human behavior and opinions. However, item non-response, where respondents fail to answer specific questions, presents a significant challenge by creating incomplete datasets that undermine data integrity and can hinder or even prevent accurate analysis. Traditional methods for addressing missing data, such as statistical imputation techniques and deep learning models, often fall short when dealing with the rich linguistic content of survey data. These approaches are also hampered by high time complexity for training and the need for extensive preprocessing or feature selection. In this paper, we introduce an approach that leverages Large Language Models (LLMs) through prompt engineering for predicting item non-responses in survey data. Our method combines the strengths of both traditional imputation techniques and deep learning methods with the advanced linguistic understanding of LLMs. By integrating respondent similarities, question relevance, and linguistic semantics, our approach enhances the accuracy and comprehensiveness of survey data analysis. The proposed method bypasses the need for complex preprocessing and additional training, making it adaptable, scalable, and capable of generating explainable predictions in natural language. We evaluated the effectiveness of our LLM-based approach through a series of experiments, demonstrating its competitive performance against established methods such as Multivariate Imputation by Chained Equations (MICE), MissForest, and deep learning models like TabTransformer. The results show that our approach not only matches but, in some cases, exceeds the performance of these methods while significantly reducing the time required for data processing. [ABSTRACT FROM AUTHOR]

Semantic code clone detection is to find code snippets that are structurally or syntactically different, but semantically identical. It plays an important role in software reuse, code compression. Many existing studies have achieved good performance in non-semantic clone, but semantic clone is still a challenging task. Recently, several works have used tree or graph, such as Abstract Syntax Tree (AST), Control Flow Graph (CFG) or Program Dependency Graph (PDG) to extract semantic information from source codes. In order to reduce the complexity of tree and graph, some studies transform them into node sequences. However, this transformation will lose some semantic information. To address this issue, we propose a novel high-performance method that utilizes community detection to extract features of AST while preserving its semantic information. First, based on the AST of source code, we exploit community detection to split AST into different subtrees to extract the underlying semantics information of different code blocks, and use centrality analysis to quantify the semantic information as the weight of AST nodes. Then, the AST is converted into a sequence of tokens with weights, and a Siamese neural network model is used to detect the similarity of token sequences for semantic code clone detection. Finally, to evaluate our approach, we conduct experiments on two standard benchmark datasets, Google Code Jam (GCJ) and BigCloneBench (BCB). Experimental results show that our model outperforms the eight publicly available state-of-the-art methods in detecting code clones. It is five times faster than the tree-based method (ASTNN) in terms of time complexity. [ABSTRACT FROM AUTHOR]

Objective: Alzheimer's disease (AD) is a type of neurological illness that significantly impacts individuals' daily lives. In the intelligent diagnosis of AD, 3D networks require larger computational resources and storage space for training the models, leading to increased model complexity and training time. On the other hand, 2D slices analysis may overlook the 3D structural information of MRI and can result in information loss. Approach: We propose a multi-slice attention fusion and multi-view personalized fusion lightweight network for automated AD diagnosis. It incorporates a multi-branch lightweight backbone to extract features from sagittal, axial, and coronal view of MRI, respectively. In addition, we introduce a novel multi-slice attention fusion module, which utilizes a combination of global and local channel attention mechanism to ensure consistent classification across multiple slices. Additionally, a multi-view personalized fusion module is tailored to assign appropriate weights to the three views, taking into account the varying significance of each view in achieving accurate classification results. To enhance the performance of the multi-view personalized fusion module, we utilize a label consistency loss to guide the model's learning process. This encourages the acquisition of more consistent and stable representations across all three views. Main results: The suggested strategy is efficient in lowering the number of parameters and FLOPs, with only 3.75M and 4.45G respectively, and accuracy improved by 10.5% to 14% in three tasks. Moreover, in the classification tasks of AD vs. CN, AD vs. MCI and MCI vs. CN, the accuracy of the proposed method is 95.63%, 86.88% and 85.00%, respectively, which is superior to the existing methods. Conclusions: The results show that the proposed approach not only excels in resource utilization, but also significantly outperforms the four comparison methods in terms of accuracy and sensitivity, particularly in detecting early-stage AD lesions. It can precisely capture and accurately identify subtle brain lesions, providing crucial technical support for early intervention and treatment. [ABSTRACT FROM AUTHOR]

Estimating pain levels is crucial for patients with serious illnesses, those recovering from brain surgery, and those receiving intensive care etc. An automatic pain intensity estimator is proposed in this study that gathers information about pain and intensity from the user's expressions. The faces in the database are first cropped using a 'Chehra' face detector, which performs well even in wildly uncontrolled environments with a wide range of lighting and position fluctuations. The suggested technique extracts the beneficial and distinct patterns from facial expressions using novel Statistical Frei-Chen Mask (SFCM)-based features and DenseNet-based features. As it offers quick as well as accurate pain identification and pain intensity estimation, the Radial Basis Function Based Extreme Learning Machine (RBF-ELM) is employed for pain recognition and pain intensity level estimation using the characteristics. All the data is kept, updated and protected in the cloud because availability and high-performance decision-making are so important for informing physicians and auxiliary IoT nodes (such as wearable sensors). In addition, cloud computing reduces the time complexity of the training phase of Machine Learning algorithms in situations where it is possible to build a complete cloud/edge architecture by allocating additional computational resources and memory in use. The facial expression images from the UNBC-McMaster Shoulder Pain Expression Archive and 2D face dataset are used to test the proposed method. The measurement of pain intensity uses four stages. When compared to the results from the literature, the proposed work attains enhanced performance. [ABSTRACT FROM AUTHOR]

Effective resource allocation is crucial in operating systems to prevent deadlocks, especially when resources are limited and non-shareable. Traditional methods like the Banker's algorithm provide solutions but suffer from limitations such as static process handling, high time complexity, and a lack of real-time adaptability. To address these challenges, we propose the Dynamic Banker's Deadlock Avoidance Algorithm (DBDAA). The DBDAA introduces real-time processing for safety checks, significantly improving system efficiency and reducing the risk of deadlocks. Unlike conventional methods, the DBDAA dynamically includes processes in safety checks, considerably decreasing the number of comparisons required to determine safe states. This optimization reduces the time complexity to O(n) in the best-case and O(nd) in the average and worst-case scenarios, compared to the O(n2d) complexity of the original Banker's algorithm. The integration of real-time processing ensures that all processes can immediately engage in safety checks, improving system responsiveness and making the DBDAA suitable for dynamic and time-sensitive applications. Additionally, the DBDAA introduces a primary unsafe sequence mechanism that enhances the acceptability and efficiency of the algorithm by allowing processes to participate in safety checks repeatedly after a predetermined amount of system-defined time. Experimental comparisons with existing algorithms demonstrate the superiority of the DBDAA in terms of reduced safe state prediction time and increased efficiency, making it a robust solution for deadlock avoidance in real-time systems. [ABSTRACT FROM AUTHOR]

The automated collection of plant phenotypic information has become a trend in breeding and smart agriculture. Four YOLOv8-based models were used to segment mature soybean plants placed in a simple background in a laboratory environment, identify pods, distinguish the number of soybeans in each pod, and obtain soybean phenotypes. The YOLOv8-Repvit model yielded the most optimal recognition results, with an R 2 coefficient value of 0.96 for both pods and beans, and the RMSE values were 2.89 and 6.90, respectively. Moreover, a novel algorithm was devised to efficiently differentiate between the main stem and branches of soybean plants, called the midpoint coordinate algorithm (MCA). This was accomplished by linking the white pixels representing the stems in each column of the binary image to draw curves that represent the plant structure. The proposed method reduces computational time and spatial complexity in comparison to the A* algorithm, thereby providing an efficient and accurate approach for measuring the phenotypic characteristics of soybean plants. This research lays a technical foundation for obtaining the phenotypic data of densely overlapped and partitioned mature soybean plants under field conditions at harvest. [ABSTRACT FROM AUTHOR]

In today's digital world, the extensive use of devices, including smartphones, tablets, IoT devices, and the internet, emphasizes the necessity for strong security measures. These measures are essential to safeguard both user data and sensitive government information. As technology advances, the enhancement of cryptographic methods becomes imperative, ensuring alignment with this rapid progression. This paper introduces a novel approach to encrypting classified data using the modified AES cipher system. It employs a dynamic and secure substitution byte operation with a 4x4 matrix, replacing the static and public 16x16 S-box found in the original version of AES. To construct the presented S-box, the system makes a secret key of 56 bytes (4x14 Rounds), where each round of the AES-256 utilizes 4 bytes to generate a 4x4 Hexadecimal Playfair matrix. By altering the S-boxes in each round and block (where each block utilizes AES key expansion to generate a 56-byte secret key for the Playfair matrix), it becomes feasible to produce distinct encrypted blocks even when the original blocks remain identical. In terms of security, the effectiveness of the provided method has been verified by experimental and analytical studies including the Avalanche effect, Balanced output, Hamming distance, and Time complexity. The result shows that the Avalanche effect of the proposed method exceeds 50% and increase the time of brute force attack. Moreover, the proposed algorithm exhibits impressive execution speed, handling approximately 200 KB in just one second. [ABSTRACT FROM AUTHOR]

The split delivery vehicle routing problem (SDVRP) is a relaxed variant of the capacitated vehicle routing problem (CVRP) where the restriction that each customer is visited precisely once is removed. Compared with CVRP, the SDVRP allows a reduction in the total cost of the routes traveled by vehicles. The exact methods to solve the SDVRP are computationally expensive. Moreover, the complexity and difficult implementation of the state-of-the-art heuristic approaches hinder their application in real-life scenarios of the SDVRP. In this paper, we propose an easily understandable and effective approach to solve the SDVPR based on an a priori adaptive splitting algorithm (AASA) that improves the existing state of the art on a priori split strategy in terms of both solution accuracy and time complexity. In this approach, the demand of the customers is split into smaller demand values using a splitting rule in advance. Consequently, the original SDVRP instance is converted to a CVRP instance which is solved using an existing CVRP solver. While the proposed a priori splitting rule in the literature is fixed for all customers regardless of their demand and location, we suggest an adaptive splitting rule that takes into account the distance of the customers to the depot and their demand values. Our experiments show that AASA can generate solutions comparable to the state of the art, but much faster. [ABSTRACT FROM AUTHOR]