Search

In recent years, with the advent of digital imaging technology, e.g., color printers and color scanners, it has become easier for counterfeiters to produce fake banknotes. The spread of counterfeit money causes loss to everyone involved in financial transactions. Therefore, an effective and reliable verification technique is necessary for successful and reliable financial transactions. This paper presents a cognitive computationbased technique for paper currency verification. In this regard, Scanning Electron Microscopy (SEM) and X-Ray Diffraction (XRD) analyses of counterfeit and genuine banknotes were performed. This experimentation confirmed that the materials used in preparation of genuine and counterfeit banknotes were totally different from each other. Based on these findings, a set of discriminative and robust features was proposed to re ect these differences in currency images. The proposed features represented characteristics of the materials of the banknote, such as printing ink, chemical composition, and surface coarseness. With these robust features, Support Vector Machines (SVMs) were employed for classification. In order to evaluate the performance of the proposed technique, experimentations were performed on a self-constructed dataset of Pakistani banknotes, comprised of 195 currency images, including 35 counterfeit banknotes. The results showed that the proposed system achieved 100% verification ability for properly captured images. [ABSTRACT FROM AUTHOR]

Beamforming technique can effectively improve the spectrum utilization in the multi‐antenna systems, while the dirty‐paper coding (DPC) technique can reduce the inter‐user interference. In this letter, it is aimed to maximize the weighted sum‐rate under the total power constraint in the multiple‐input‐single‐output (MISO) system with the DPC technique. However, the existing methods of beamforming optimization mainly rely on customized iterative algorithms, which have high computational complexity. To address this issue, the beamforming neural network (BFNNet) is devised by utilizing the deep learning technique and the uplink‐downlink duality and exploring the optimal solution structure, which includes the deep neural network module and the signal processing module. Simulation results show that the BFNNet can achieve near‐optimal solutions and significantly reduce computational complexity. [ABSTRACT FROM AUTHOR]

In this paper we make a proposal that writing modality (pen-and-paper versus computer-based writing can be conceptualized as a cognitive task complexity factor. To lay ground for this theoretical proposal, we first review previous adaptations of cognitive task-based models to second language (L2) writing. We then compare pen-and-paper and computer-based writing modalities in terms of their general characteristics, outline the main tenets of multidisciplinary theoretical models which attribute learning and performance-related importance to writing modality, and review the available empirical evidence. From this we draw theoretical and empirical justification for our conceptualization of writing modality as a task complexity dimension. After outlining our conceptual view, we proceed with the review of the methods which could be used to independently assess cognitive load in paper and computer-written L2 tasks. In the conclusion, implications and suggestions for future research are provided. [ABSTRACT FROM AUTHOR]

This paper presents results of topic modeling and network models of topics using the ICCS corpus, which contains domain-specific (computational science) papers over sixteen years (a total of 5695 papers). We discuss topical structures of ICCS, how these topics evolve over time in response to the topicality of various problems, technologies and methods, and how all these topics relate to one another. This analysis illustrates multidisciplinary research and collaborations among scientific communities, by constructing static and dynamic networks from the topic modeling results and the authors’ keywords. The results of this study give insights about the past and future trends of core discussion topics in computational science. We used the Non-negative Matrix Factorization(NMF) topic modeling algorithm to discover topics and labeled and grouped results hierarchically. We used Gephi to study static networks of topics, and an R library called DyA to analyze the dynamic networks of topics. [ABSTRACT FROM AUTHOR]

The requirements of public administration institutions are increasing and projects becoming progressively challenging. Managing a project is a complex activity, in particular when it involves many people working over long periods of time and many different stakeholders. This increasing complexity requires management practices and tools that assure an efficient use of resources. In this context, a Project Management Office (PMO) can be of great value. In this position paper we discuss several scenarios for PMO implementation in the public administration sector, as a promoter of project success and a key ingredient for a better resources usage. [ABSTRACT FROM AUTHOR]

In social network applications, competitive influence propagation often exhibits a certain degree of time lag. In the scenario of positive and negative competitive propagation studied in this paper, under the premise that negative nodes are activated first, how to find a set of positive seed nodes to participate in competitive propagation is studied, aiming to minimize the spread of negative influence. In the current study, the time complexity of the improved algorithms based on greedy strategies is high, which limits their scope of application in practical scenarios; some heuristic algorithms achieve better scalability, but there is still much room for improvement. Therefore, this paper proposes a new method to solve the influence propagation problem of delayed competition, also known as a heuristic propagation factor evaluation algorithm (HeuPFE). The main process is as follows: (1) We build a shortest path snapshot for the nearest propagation region of negative nodes and reduce the search space of competing nodes. (2) Then, we construct a node propagation factor evaluation method based on this shortest negative-oriented node path snapshot to reduce computational complexity. Comparing results with those of traditional heuristic algorithms, we carry out experiments on real datasets and verify the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

The biggest challenge of texture filtering is to smooth the strong gradient textures while maintaining the weak structures, which is difficult to achieve with current methods. Based on this, we propose a scale-adaptive texture filtering algorithm in this paper. First, the four-directional detection with gradient information is proposed for structure measurement. Second, the spatial kernel scale for each pixel is obtained based on the structure information; the larger spatial kernel is for pixels in textural regions to enhance the smoothness, while the smaller spatial kernel is for pixels on structures to maintain the edges. Finally, we adopt the Fourier approximation of range kernel, which reduces computational complexity without compromising the filtering visual quality. By subjective and objective analysis, our method outperforms the previous methods in eliminating the textures while preserving main structures and also has advantages in structure similarity and visual perception quality. [ABSTRACT FROM AUTHOR]

Paper recommendation systems are important for alleviating academic information overload. Such systems provide personalized recommendations based on implicit feedback from users, supplemented by their subject information, citation networks, etc. However, such recommender systems face problems like data sparsity for positive samples and uncertainty for negative samples. In this paper, we address these two issues and improve upon them from the perspective of metric learning. The algorithm is modeled as a push–pull loss function. For the positive sample pull-out operation, we introduce a context factor, which accelerates the convergence of the objective function through the multiplication rule to alleviate the data sparsity problem. For the negative sample push operation, we adopt an unbiased global negative sample method and use an intermediate matrix caching method to greatly reduce the computational complexity. Experimental results on two real datasets show that our method outperforms other baseline methods in terms of recommendation accuracy and computational efficiency. Moreover, our metric learning method that introduces context improves by more than 5% over the element-wise alternating least squares method. We demonstrate the potential of metric learning in addressing the problem of implicit feedback recommender systems with positive and negative sample imbalances. [ABSTRACT FROM AUTHOR]

The Last decade saw significant growth in the digital terrestrial television (DTT) subscribers. The High peak-to-average power ratio (PAPR) of the transmitted signal is implied by the large fluctuations in its amplitude, which is a serious issue in the contemporary and next generation DTT broadcasting systems. These large fluctuations prevent feeding the high power amplifier (HPA) at an operating point near its non-linear (NL) saturation region, thereby lowering its power efficiency. For a better future, energy-efficient green communications is the need of hour. This paper focuses on digital predistortion (DPD), which is among the widely used techniques for HPA linearization in order to minimize the NL effects. DPD technique requires a feedback signal. This paper proposes a novel adding signal-based digital predistortion, where the output of the HPA is gradually linearized by adding a signal at the input in an iterative manner. By Taylor series approximation, the DPD problem can be posed as a convex one. We prove that a tighter upper bound exists for the convergence factor and instead of directly solving the convex problem, we pick a convergence factor value within its bounds that offers a good trade-off between convergence speed and residual error value. The simulation results show that the proposed technique can quickly linearize the HPA with good convergence. [ABSTRACT FROM AUTHOR]

Scene graphs can enhance the understanding capability of intelligent ships in navigation scenes. However, the complex entity relationships and the presence of significant noise in contextual information within navigation scenes pose challenges for navigation scene graph generation (NSGG). To address these issues, this paper proposes a novel NSGG network named SGK-Net. This network comprises three innovative modules. The Semantic-Guided Multimodal Fusion (SGMF) module utilizes prior information on relationship semantics to fuse multimodal information and construct relationship features, thereby elucidating the relationships between entities and reducing semantic ambiguity caused by complex relationships. The Graph Structure Learning-based Structure Evolution (GSLSE) module, based on graph structure learning, reduces redundancy in relationship features and optimizes the computational complexity in subsequent contextual message passing. The Key Entity Message Passing (KEMP) module takes full advantage of contextual information to refine relationship features, thereby reducing noise interference from non-key nodes. Furthermore, this paper constructs the first Ship Navigation Scene Graph Simulation dataset, named SNSG-Sim, which provides a foundational dataset for the research on ship navigation SGG. Experimental results on the SNSG-sim dataset demonstrate that our method achieves an improvement of 8.31% (R@50) in the PredCls task and 7.94% (R@50) in the SGCls task compared to the baseline method, validating the effectiveness of our method in navigation scene graph generation. [ABSTRACT FROM AUTHOR]

The guest editors introduce the Top Picks and Honorable Mentions from the 2016 computer architecture conferences. [ABSTRACT FROM PUBLISHER]

License plate detection is an important task in Intelligent Transportation Systems (ITS) and has a wide range of applications in vehicle management, traffic control, and public safety. In order to improve the accuracy and speed of mobile recognition, an improved lightweight YOLOv5s model is proposed for license plate detection. First, an improved Stemblock network is used to replace the original Focus layer in the network, which ensures strong feature expression capability and reduces a large number of parameters to lower the computational complexity; then, an improved lightweight network, ShuffleNetv2, is used to replace the backbone network of the YOLOv5s, which makes the model lighter and ensures the detection accuracy at the same time. Then, a feature enhancement module is designed to reduce the information loss caused by the rearrangement of the backbone network channels, which facilitates the information interaction in the feature fusion process; finally, the low‐, medium‐ and high‐level features in the Shufflenetv2 network structure are fused to form the final high‐level output features. Experimental results on the CCPD dataset show that compared to other methods this paper obtains better performance and faster speed in the license plate detection task, in which the average precision mean value reaches 96.6%, and can achieve a detection speed of 43.86 frame/s, and the parameter volume is reduced to 5.07 M. [ABSTRACT FROM AUTHOR]

Private Set Intersection Cardinality (PSI-CA) is a cryptographic method in secure multi-party computation that allows entities to identify the cardinality of the intersection without revealing their private data. Traditional approaches assume similar-sized datasets and equal computational power, overlooking practical imbalances. In real-world applications, dataset sizes and computational capacities often vary, particularly in Internet of Things and mobile scenarios where device limitations restrict computational types. Traditional PSI-CA protocols are inefficient here, as computational and communication complexities correlate with the size of larger datasets. Thus, adapting PSI-CA protocols to these imbalances is crucial. This paper explores unbalanced scenarios where one party (the receiver) has a relatively small dataset and limited computational power, while the other party (the sender) has a large amount of data and strong computational capabilities.This paper, based on the concept of commutative encryption, introduces Cuckoo filter, cloud computing technology, and homomorphic encryption, among other technologies, to construct three novel solutions for unbalanced Private Set Intersection Cardinality (PSI-CA): an unbalanced PSI-CA protocol based on Cuckoo filter, an unbalanced PSI-CA protocol based on single-cloud assistance, and an unbalanced PSI-CA protocol based on dual-cloud assistance. Depending on performance and security requirements, different protocols can be employed for various applications. [ABSTRACT FROM AUTHOR]

In the field of medical image segmentation, achieving fast and accurate semantic segmentation of tumor cell nuclei and skin lesions is of significant importance. However, the considerable variations in skin lesion forms and cell types pose challenges to attaining high network accuracy and robustness. Additionally, as network depth increases, the growing parameter size and computational complexity make practical implementation difficult. To address these issues, this paper proposes MD-UNet, a fast cell nucleus segmentation network that integrates Tokenized Multi-Layer Perceptron modules, attention mechanisms, and Inception structures. Firstly, tokenized MLP modules are employed to label and project convolutional features, reducing computational complexity. Secondly, the paper introduces Depthwise Attention blocks and Multi-layer Feature Extraction modules. The Depthwise Attention blocks eliminate irrelevant and noisy responses from coarse-scale extracted information, serving as alternatives to skip connections in the UNet architecture. The Multilayer Feature Extraction modules capture a wider range of high-level and lowlevel semantic features during decoding and facilitate feature fusion. The proposed MD-UNet approach is evaluated on two datasets: the International Skin Imaging Collaboration (ISIC2018) dataset and the PanNuke dataset. The experimental results demonstrate that MD-UNet achieves the best performance on both datasets. [ABSTRACT FROM AUTHOR]

With the advancement of network technology, multimedia videos have emerged as a crucial channel for individuals to access external information, owing to their realistic and intuitive effects. In the presence of high frame rate and high dynamic range videos, the coding efficiency of high-efficiency video coding (HEVC) falls short of meeting the storage and transmission demands of the video content. Therefore, versatile video coding (VVC) introduces a nested quadtree plus multi-type tree (QTMT) segmentation structure based on the HEVC standard, while also expanding the intra-prediction modes from 35 to 67. While the new technology introduced by VVC has enhanced compression performance, it concurrently introduces a higher level of computational complexity. To enhance coding efficiency and diminish computational complexity, this paper explores two key aspects: coding unit (CU) partition decision-making and intra-frame mode selection. Firstly, to address the flexible partitioning structure of QTMT, we propose a decision-tree-based series partitioning decision algorithm for partitioning decisions. Through concatenating the quadtree (QT) partition division decision with the multi-type tree (MT) division decision, a strategy is implemented to determine whether to skip the MT division decision based on texture characteristics. If the MT partition decision is used, four decision tree classifiers are used to judge different partition types. Secondly, for intra-frame mode selection, this paper proposes an ensemble-learning-based algorithm for mode prediction termination. Through the reordering of complete candidate modes and the assessment of prediction accuracy, the termination of redundant candidate modes is accomplished. Experimental results show that compared with the VVC test model (VTM), the algorithm proposed in this paper achieves an average time saving of 54.74%, while the BDBR only increases by 1.61%. [ABSTRACT FROM AUTHOR]

Methods for short-term voltage stability (STVS) assessment based on phasor measurement unit (PMU) data have become quite abundant. However, most of them are challenged to deal with the commonly encountered incomplete PMU data. Existing models for STVS assessment of incomplete PMU data mostly have the disadvantages of high computational complexity and large impact from the level of data missing. This paper proposes a multi-task learning method that performs stability assessment and missing data completion in parallel. The Transformer Encoder is used as the shared feature extractor, a GRU structure is used to output complete PMU data sequences, and a BP neural network is used to output stability assessment results. The loss function used for the missing completion task considers the accuracy in both the shape and time domains. A comparison with relevant models shows that the model proposed in this paper achieves the best performance in all indicators and is minimally affected by the observation windows and the level of data loss, demonstrating good robustness. [ABSTRACT FROM AUTHOR]

Privacy preserving utility mining (PPUM) aims to solve the problem of sensitive information leakage in utility pattern mining. In recent years, researchers have proposed algorithms to solve the privacy-preserving problem. However, these algorithms have high side effects, long sanitization time, and computational complexity. Although the FPUTT algorithm reduces the number of database scans, tree construction and traversal still take much time. The paper proposes a fast utility-list dictionary algorithm (FULD). The utility-list dictionary consists of all sensitive items. Through dictionary lookup, sensitive items can be found and modified. In addition, the novel concepts of SINS and tns are proposed to reduce the side effects of the algorithm. In this paper, the experiments show that the FULD algorithm has good performance, such as running time and side effects. The running time of the FULD is 15–20 times shorter than the FPUTT algorithm. It performs well both on sparse and dense datasets. [ABSTRACT FROM AUTHOR]

To accelerate the solution of electromagnetic scattering problems, compressive sensing (CS) has been introduced into the method of moments (MoM). Consequently, a computational model based on underdetermined equations has been proposed, which effectively reduces the computational complexity compared with the traditional MoM. However, while solving surface-integral formulations for three-dimensional targets by MoM, due to the severe oscillation of current signals, commonly used sparse bases become inapplicable, which renders the application of the underdetermined equation model quite challenging. To address this issue, this paper puts forward a scheme that employs Krylov subspace, which is constructed with low complexity by meticulously designing a group of non-orthogonal basis vectors, to replace the sparse transforms in the algorithmic framework. The principle of the method is elaborated in detail, and its effectiveness is validated through numerical experiments. [ABSTRACT FROM AUTHOR]

In infrared detection scenarios, detecting and recognizing low-contrast and small-sized targets has always been a challenge in the field of computer vision, particularly in complex road traffic environments. Traditional target detection methods usually perform poorly when processing infrared small targets, mainly due to their inability to effectively extract key features and the significant feature loss that occurs during feature transmission. To address these issues, this paper proposes a fast detection and recognition model based on a multi-scale self-attention mechanism, specifically for small road targets in infrared detection scenarios. We first introduce and improve the DyHead structure based on the YOLOv8 algorithm, which employs a multi-head self-attention mechanism to capture target features at various scales and enhance the model's perception of small targets. Additionally, to prevent information loss during the feature transmission process via the FPN structure in traditional YOLO algorithms, this paper introduces and enhances the Gather-and-Distribute Mechanism. By computing dependencies between features using self-attention, it reallocates attention weights in the feature maps to highlight important features and suppress irrelevant information. These improvements significantly enhance the model's capability to detect small targets. Moreover, to further increase detection speed, we pruned the network architecture to reduce computational complexity and parameter count, making the model suitable for real-time processing scenarios. Experiments on our self built infrared road traffic dataset (mainly including two types of targets: vehicles and people) show that compared with the baseline, our method achieves a 3.1% improvement in AP and a 2.5% increase in mAP on the VisDrone2019 dataset, showing significant enhancements in both detection accuracy and processing speed for small targets, with improved robustness and adaptability. [ABSTRACT FROM AUTHOR]

In this paper, we develop a new Best Uniform Rational Approximation-Semi-Discrete (BURA-SD) method taking into account the singularities of the solution of fractional diffusion problems in polygonal domains. The complementary capabilities of the exponential convergence rate of BURA-SD and the h p FEM are explored with the aim of maximizing the overall performance. A challenge here is the emerging singularly perturbed diffusion–reaction equations. The main contributions of this paper include asymptotically accurate error estimates, ending with sufficient conditions to balance errors of different origins, thereby guaranteeing the high computational efficiency of the method. [ABSTRACT FROM AUTHOR]

Time series forecasting has played an important role in different industries, including economics, energy, weather, and healthcare. RNN-based methods have shown promising potential due to their strong ability to model the interaction of time and variables. However, they are prone to gradient issues like gradient explosion and vanishing gradients. And the prediction accuracy is not high. To address the above issues, this paper proposes a Fractional-order Lipschitz Recurrent Neural Network with a Frequency-domain Gated Attention mechanism (FLRNN-FGA). There are three major components: the Fractional-order Lipschitz Recurrent Neural Network (FLRNN), frequency module, and gated attention mechanism. In the FLRNN, fractional-order integration is employed to describe the dynamic systems accurately. It can capture long-term dependencies and improve prediction accuracy. Lipschitz weight matrices are applied to alleviate the gradient issues. In the frequency module, temporal data are transformed into the frequency domain by Fourier transform. Frequency domain processing can reduce the computational complexity of the model. In the gated attention mechanism, the gated structure can regulate attention information transmission to reduce the number of model parameters. Extensive experimental results on five real-world benchmark datasets demonstrate the effectiveness of FLRNN-FGA compared with the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Boron-doped diamond thin films exhibit extensive applications in chemical sensing, in which the performance could be further enhanced by nano-structuring of the surfaces. In order to discover the relationship between diamond nanostructures and properties, this paper is dedicated to deep learning target detection methods. However, great challenges, such as noise, unclear target boundaries, and mutual occlusion between targets, are inevitable during the target detection of nanostructures. To tackle these challenges, DWS-YOLOv8 (DCN + WIoU + SA + YOLOv8n) is introduced to optimize the YOLOv8n model for the detection of diamond nanostructures. A deformable convolutional C2f (DCN_C2f) module is integrated into the backbone network, as is a shuffling attention (SA) mechanism, for adaptively tuning the perceptual field of the network and reducing the effect of noise. Finally, Wise-IoU (WIoU)v3 is utilized as a bounding box regression loss to enhance the model's ability to localize diamond nanostructures. Compared to YOLOv8n, a 9.4% higher detection accuracy is achieved for the present model with reduced computational complexity. Additionally, the enhancement of precision (P), recall (R), mAP@0.5, and mAP@0.5:0.95 is demonstrated, which validates the effectiveness of the present DWS-YOLOv8 method. These methods provide effective support for the subsequent understanding and customization of the properties of surface nanostructures. [ABSTRACT FROM AUTHOR]

Rayleigh-Ritz discriminant analysis (RRDA) is an effective algorithm for linear discriminant analysis (LDA), but there are some drawbacks in its implementation. In this paper, we first improved Rayleigh-Ritz discriminant analysis (IRRDA) to make its framework more concise, and established the equivalence theory of the solution space between our discriminant analysis and RRDA. Second, we proposed a new model based on positive definite systems of linear equations for linear discriminant analysis, and certificated the rationality of the new model. Compared with the traditional linear regression model for linear discriminant analysis, the coefficient matrix of our model avoided forming a centralized matrix or appending the original data matrix, but the original matrix itself, which greatly reduced the computational complexity. According to the size of data matrix, we designed two solution schemes for the new model based on the block conjugate gradient method. Experiments in real-world datasets demonstrated the effectiveness and efficiency of our algorithm and it showed that our method was more efficient and faster than RRDA. [ABSTRACT FROM AUTHOR]

Precoding techniques are widely used to eliminate interference between multiple user signals in a wireless fading channel environment. The linear MMSE precoding technique, one of the most widely used techniques so far, has low computational complexity but has the disadvantage of relatively poor symbol error rate (SER) performance. The symbol-level precoding (SLP) technique, on which much research has been conducted recently, has excellent SER performance but has the disadvantage of being too computationally complex. In this paper, we propose a hybrid precoding technique that simultaneously applies SLP and MMSE precoding to appropriately adjust SER performance and computational complexity performance. If two different types of precoding techniques are applied simultaneously, interference may occur between signals to which different types of precoding are applied, which can significantly deteriorate SER performance. Therefore, in this paper, precoding is designed to prevent interference between the two signals using the null space of the channel matrices. Through computer simulation, the proposed scheme showed that its SER performance was superior to that of the linear MMSE scheme, and the computational complexity was much lower than that of the SLP scheme. [ABSTRACT FROM AUTHOR]

The development of the Internet and big data has led to the emergence of graphs as an important data representation structure in various real-world scenarios. However, as data size increases, computational complexity and memory requirements pose significant challenges for graph embedding. To address this challenge, this paper proposes a multilevel embedding refinement framework (MERIT) based on large-scale graphs, using spectral distance-constrained graph coarsening algorithms and an improved graph convolutional neural network model that addresses the over-smoothing problem by incorporating initial values and identity mapping. Experimental results on large-scale datasets demonstrate the effectiveness of MERIT, with an average AUROC score 8% higher than other baseline methods. Moreover, in a node classification task on a large-scale graph with 126,825 nodes and 22,412,658 edges, the framework improves embedding quality while enhancing the runtime by 25 times. The experimental findings highlight the superior efficiency and accuracy of the proposed approach compared to other graph embedding methods. [ABSTRACT FROM AUTHOR]

The attention mechanism can extract salient features in images, which has been proved to be effective in improving the performance of person re-identification (Re-ID). However, most of the existing attention modules have the following two shortcomings: On the one hand, they mostly use global average pooling to generate context descriptors, without highlighting the guiding role of salient information on descriptor generation, resulting in insufficient ability of the final generated attention mask representation; On the other hand, the design of most attention modules is complicated, which greatly increases the computational cost of the model. To solve these problems, this paper proposes an attention module called self-supervised recalibration (SR) block, which introduces both global and local information through adaptive weighted fusion to generate a more refined attention mask. In particular, a special "Squeeze-Excitation" (SE) unit is designed in the SR block to further process the generated intermediate masks, both for nonlinearizations of the features and for constraint of the resulting computation by controlling the number of channels. Furthermore, we combine the most commonly used ResNet-50 to construct the instantiation model of the SR block, and verify its effectiveness on multiple Re-ID datasets, especially the mean Average Precision (mAP) on the Occluded-Duke dataset exceeds the state-of-the-art (SOTA) algorithm by 4.49%. [ABSTRACT FROM AUTHOR]

The idea of the person re-identification (Re-ID) task is to find the person depicted in the query image among other images obtained from different cameras. Algorithms solving this task have important practical applications, such as illegal action prevention and searching for missing persons through a smart city's video surveillance. In most of the papers devoted to the problem under consideration, the authors propose complex algorithms to achieve a better quality of person Re-ID. Some of these methods cannot be used in practice due to technical limitations. In this paper, we propose several approaches that can be used in almost all popular modern re-identification algorithms to improve the quality of the problem being solved and do not practically increase the computational complexity of algorithms. In real-world data, bad images can be fed into the input of the Re-ID algorithm; therefore, the new Filter Module is proposed in this paper, designed to pre-filter input data before feeding the data to the main re-identification algorithm. The Filter Module improves the quality of the baseline by 2.6 % according to the R a n k 1 metric and 3.4 % according to the m A P metric on the Market-1501 dataset. Furthermore, in this paper, a fully automated data collection strategy from surveillance cameras for self-supervised pre-training is proposed in order to increase the generality of neural networks on real-world data. The use of self-supervised pre-training on the data collected using the proposed strategy improves the quality of cross-domain upper-body Re-ID on the DukeMTMC-reID dataset by 1.0 % according to the R a n k 1 and m A P metrics. [ABSTRACT FROM AUTHOR]

This paper delves into the problem of direct position determination (DPD) for non-Gaussian sources. Existing DPD algorithms are hindered by their high computational complexity from exhaustive grid searches and a disregard for the received signal characteristics by multiple nested arrays (MNAs). To address these issues, the paper proposes a novel DPD algorithm for non-Gaussian sources with MNAs: the Discrete Fourier Transform (DFT) and Taylor compensation algorithm. Initially, the fourth-order cumulant matrix of the received signal is computed, and the vectorizing method is applied. Subsequently, a computationally efficient DPD cost function is proposed by leveraging a normalized DFT matrix to reduce complexity. Finally, first-order Taylor compensation is utilized to enhance the accuracy of the localization results. The superiority of the proposed algorithm is demonstrated through numerical simulation results. [ABSTRACT FROM AUTHOR]

Background: Channel selection has become the pivotal issue a ecting the widespread application of non-invasive brain-computer interface systems in the real world. However, constructing suitable multi-objective problem models alongside e ective search strategies stands out as a critical factor that impacts the performance of multi-objective channel selection algorithms. This paper presents a two-stage sparse multi-objective evolutionary algorithm (TS-MOEA) to address channel selection problems in brain-computer interface systems. Methods: In TS-MOEA, a two-stage framework, which consists of the early and late stages, is adopted to prevent the algorithm from stagnating. Furthermore, The two stages concentrate on di erent multi-objective problem models, thereby balancing convergence and population diversity in TS-MOEA. Inspired by the sparsity of the correlation matrix of channels, a sparse initialization operator, which uses a domain-knowledge-based score assignment strategy for decision variables, is introduced to generate the initial population. Moreover, a Score-based mutation operator is utilized to enhance the search efficiency of TS-MOEA. Results: The performance of TS-MOEA and five other state-of-the-art multi-objective algorithms has been evaluated using a 62-channel EEG-based brain-computer interface system for fatigue detection tasks, and the results demonstrated the e ectiveness of TS-MOEA. Conclusion: The proposed two-stage framework can help TS-MOEA escape stagnation and facilitate a balance between diversity and convergence. Integrating the sparsity of the correlation matrix of channels and the problem-domain knowledge can e ectively reduce the computational complexity of TS-MOEA while enhancing its optimization efficiency. [ABSTRACT FROM AUTHOR]

P- and S-wave separation plays an important role in elastic reverse-time migration. It can reduce the artifacts caused by crosstalk between different modes and improve image quality. In addition, P- and Swave separation can also be used to better understand and distinguish wave types in complex media. At present, the methods for separating wave modes in anisotropic media mainly include spatial nonstationary filtering, low-rank approximation, and vector Poisson equation. Most of these methods require multiple Fourier transforms or the calculation of large matrices, which require high computational costs for problems with large scale. In this paper, an efficient method is proposed to separate the wave mode for anisotropic media by using a scalar anisotropic Poisson operator in the spatial domain. For 2D problems, the computational complexity required by this method is 1/2 of the methods based on solving a vector Poisson equation. Therefore, compared with existing methods based on pseudo-Helmholtz decomposition operators, this method can significantly reduce the computational cost. Numerical examples also show that the P and S waves decomposed by this method not only have the correct amplitude and phase relative to the input wavefield but also can reduce the computational complexity significantly. [ABSTRACT FROM AUTHOR]

Automatic Container Code Recognition (ACCR) is critical for enhancing the efficiency of container terminals. However, existing ACCR methods frequently fail to achieve satisfactory performance in complex environments at port gates. In this paper, we propose an approach for accurate, fast, and compact container code recognition by utilizing YOLOv4 for container region localization and Deeplabv3+ for character recognition. To enhance the recognition speed and accuracy of YOLOv4 and Deeplabv3+, and to facilitate their deployment at gate entrances, we introduce several improvements. First, we optimize the feature-extraction process of YOLOv4 and Deeplabv3+ to reduce their computational complexity. Second, we enhance the multi-scale recognition and loss functions of YOLOv4 to improve the accuracy and speed of container region localization. Furthermore, we adjust the dilated convolution rates of the ASPP module in Deeplabv3+. Finally, we replace two upsampling structures in the decoder of Deeplabv3+ with transposed convolution upsampling and sub-pixel convolution upsampling. Experimental results on our custom dataset demonstrate that our proposed method, C-YOLOv4, achieves a container region localization accuracy of 99.76% at a speed of 56.7 frames per second (FPS), while C-Deeplabv3+ achieves an average pixel classification accuracy (MPA) of 99.88% and an FPS of 11.4. The overall recognition success rate and recognition speed of our approach are 99.51% and 2.3 ms per frame, respectively. Moreover, C-YOLOv4 and C-Deeplabv3+ outperform existing methods in complex scenarios. [ABSTRACT FROM AUTHOR]

In the realm of smart communication systems, where the ubiquity of 5G/6G networks and IoT applications demands robust data confidentiality, the cryptographic integrity of block and stream cipher mechanisms plays a pivotal role. This paper focuses on the enhancement of cryptographic strength in these systems through an innovative approach to generating substitution boxes (S-boxes), which are integral in achieving confusion and diffusion properties in substitution–permutation networks. These properties are critical in thwarting statistical, differential, linear, and other forms of cryptanalysis, and are equally vital in pseudorandom number generation and cryptographic hashing algorithms. The paper addresses the challenge of rapidly producing random S-boxes with desired cryptographic attributes, a task notably arduous given the complexity of existing generation algorithms. We delve into the hill climbing algorithm, exploring various cost functions and their impact on computational complexity for generating S-boxes with a target nonlinearity of 104. Our contribution lies in proposing a new cost function that markedly reduces the generation complexity, bringing down the iteration count to under 50,000 for achieving the desired S-box. This advancement is particularly significant in the context of smart communication environments, where the balance between security and performance is paramount. [ABSTRACT FROM AUTHOR]

Large-scale particle swarm optimization (PSO) has long been a hot topic due to the following reasons: Swarm diversity preservation is still challenging for current PSO variants for large-scale optimization problems, resulting in difficulties for PSO in balancing its exploration and exploitation. Furthermore, current PSO variants for large-scale optimization problems often introduce additional operators to improve their ability in diversity preservation, leading to increased algorithm complexity. To address these issues, this paper proposes a dual-competition-based particle update strategy (DCS), which selects the particles to be updated and corresponding exemplars with two rounds of random pairing competitions, which can straightforwardly benefit swarm diversity preservation. Furthermore, DCS confirms the primary and secondary exemplars based on the fitness sorting operation for exploitation and exploration, respectively, leading to a dual-competition-based swarm optimizer. Thanks to the proposed DCS, on the one hand, the proposed algorithm is able to protect more than half of the particles from being updated to benefit diversity preservation at the swarm level. On the other hand, DCS provides an efficient exploration and exploitation exemplar selection mechanism, which is beneficial for balancing exploration and exploitation at the particle update level. Additionally, this paper analyzes the stability conditions and computational complexity of the proposed algorithm. In the experimental section, based on seven state-of-the-art algorithms and a recently proposed large-scale benchmark suite, this paper verifies the competitiveness of the proposed algorithm in large-scale optimization problems. [ABSTRACT FROM AUTHOR]

Visual simultaneous localization and mapping (VSLAM) enhances the navigation of autonomous agents in unfamiliar environments by progressively constructing maps and estimating poses. However, conventional VSLAM pipelines often exhibited degraded performance in dynamic environments featuring mobile objects. Recent research in deep learning led to notable progress in semantic segmentation, which involves assigning semantic labels to image pixels. The integration of semantic segmentation into VSLAM can effectively differentiate between static and dynamic elements in intricate scenes. This paper provided a comprehensive comparative review on leveraging semantic segmentation to improve major components of VSLAM, including visual odometry, loop closure detection, and environmental mapping. Key principles and methods for both traditional VSLAM and deep semantic segmentation were introduced. This paper presented an overview and comparative analysis of the technical implementations of semantic integration across various modules of the VSLAM pipeline. Furthermore, it examined the features and potential use cases associated with the fusion of VSLAM and semantics. It was found that the existing VSLAM model continued to face challenges related to computational complexity. Promising future research directions were identified, including efficient model design, multimodal fusion, online adaptation, dynamic scene reconstruction, and end-to-end joint optimization. This review shed light on the emerging paradigm of semantic VSLAM and how deep learning-enabled semantic reasoning could unlock new capabilities for autonomous intelligent systems to operate reliably in the real world. [ABSTRACT FROM AUTHOR]

The balance between accuracy and computational complexity is currently a focal point of research in dynamical system modeling. From the perspective of model reduction, this paper addresses the mode selection strategy in Dynamic Mode Decomposition (DMD) by integrating an embedded fractal theory based on fractal dimension (FD). The existing model selection methods lack interpretability and exhibit arbitrariness in choosing mode dimension truncation levels. To address these issues, this paper analyzes the geometric features of modes for the dimensional characteristics of dynamical systems. By calculating the box counting dimension (BCD) of modes and the correlation dimension (CD) and embedding dimension (ED) of the original dynamical system, it achieves guidance on the importance ranking of modes and the truncation order of modes in DMD. To validate the practicality of this method, it is applied to the reduction applications on the reconstruction of the velocity field of cylinder wake flow and the force field of compressor blades. Theoretical results demonstrate that the proposed selection technique can effectively characterize the primary dynamic features of the original dynamical systems. By employing a loss function to measure the accuracy of the reconstruction models, the computed results show that the overall errors of the reconstruction models are below 5%. These results indicate that this method, based on fractal theory, ensures the model's accuracy and significantly reduces the complexity of subsequent computations, exhibiting strong interpretability and practicality. [ABSTRACT FROM AUTHOR]

This paper proposes a multi-perspective adaptive examination cheating behavior detection method to meet the demand for automated monitoring throughout the entire process in paperless online exams. Unlike current dual-perspective cheating behavior detection methods, we expand the monitoring field of view by using three cameras with different perspectives: the overhead perspective, the horizontal perspective, and the face perspective. This effectively covers areas where cheating may occur. An adaptive cheating behavior detection system based on three perspectives is proposed, including a gaze direction recognition model based on Swin Transformer, a cheating tool detection model based on Lightweight-YOLOv5-Coordinate Attention, and a cheating behavior determination model based on Multilayer Perceptron. To reduce computational complexity and ensure efficient processing while expanding the monitoring field of view, the system uses the results of the gaze direction recognition model to adaptively select the cheating behavior detection model from different perspectives, reducing the three-perspective system to dual-perspective. In online simulation tests, our method achieves cheating behavior determination at 35 frames per second, with an average recognition rate of 95%. It has good real-time performance, accuracy, and a large monitoring range. [ABSTRACT FROM AUTHOR]

To model fuzzy numbers with the confidence degree and better account for information uncertainty, Zadeh came up with the notion of Z-numbers, which can effectively combine the objective information of things with subjective human interpretation of perceptive information, thereby improving the human comprehension of natural language. Although many numbers are in fact Z-numbers, their higher computational complexity often prevents their recognition as such. In order to reduce computational complexity, this paper reviews the development and research direction of Z-numbers and deduces the operational rules for symmetric triangular Z-numbers. We first transform them into classical fuzzy numbers. Using linear programming, the extension principle of Zadeh, the convolution formula, and fuzzy number algorithms, we determine the operational rules for the basic operations of symmetric triangular Z-numbers, which are number-multiplication, addition, subtraction, multiplication, power, and division. Our operational rules reduce the complexity of calculation, improve computational efficiency, and effectively reduce the information difference while being applicable to other complex operations. This paper innovatively combines Z-numbers with classical fuzzy numbers in Z-number operations, and as such represents a continuation and innovation of the research on the operational laws of Z-numbers. [ABSTRACT FROM AUTHOR]

Object detection plays a crucial role in autonomous driving assistance systems. It requires high accuracy for prediction, a small size for deployment on mobile devices, and real-time inference speed to ensure safety. In this paper, we present a compact and efficient algorithm called YOLOX with United Attention Head (UAH-YOLOX) for detection in autonomous driving scenarios. By replacing the backbone network with GhostNet for feature extraction, the model reduces the number of parameters and computational complexity. By adding a united attention head before the YOLO head, the model effectively detects the scale, position, and contour features of targets. In particular, an attention module called Spatial Self-Attention is designed to extract spatial location information, demonstrating great potential in detection. In our network, the IOU Loss (Intersection of Union) has been replaced with CIOU Loss (Complete Intersection of Union). Further experiments demonstrate the effectiveness of our proposed methods on the BDD100k dataset and the Caltech Pedestrian dataset. UAH-YOLOX achieves state-of-the-art results by improving the detection accuracy of the BDD100k dataset by 1.70% and increasing processing speed by 3.37 frames per second (FPS). Visualization provides specific examples in various scenarios. [ABSTRACT FROM AUTHOR]

Automotive radar is one of the key sensors for intelligent driving. Radar image sequences contain abundant spatial and temporal information, enabling target classification. For existing radar spatiotemporal classifiers, multi-view radar images are usually employed to enhance the information of the target and 3D convolution is employed for spatiotemporal feature extraction. These models consume significant hardware resources and are not applicable to real-time applications. In this paper, RadarTCN, a novel lightweight network, is proposed that achieves high-accuracy online target classification using single-view radar image sequences only. In RadarTCN, 2D convolution and 3D-TCN are employed to extract spatiotemporal features sequentially. To reduce data dimensionality and computational complexity, a multi-layer max pooling down-sampling method is designed in a 2D convolution module. Meanwhile, the 3D-TCN module is improved through residual pruning and causal convolution is introduced for leveraging the performance of online target classification. The experimental results demonstrate that RadarTCN can achieve high-precision online target recognition for both range-angle and range-Doppler map sequences. Compared to the reference models on the CARRADA dataset, RadarTCN exhibits better classification performance, with fewer parameters and lower computational complexity. [ABSTRACT FROM AUTHOR]

The detection of road damage is highly important for traffic safety and road maintenance. Conventional detection approaches frequently require significant time and expenditure, the accuracy of detection cannot be guaranteed, and they are prone to misdetection or omission problems. Therefore, this paper introduces an enhanced version of the You Only Look Once version 8 (YOLOv8) road damage detection algorithm called RDD-YOLO. First, the simple attention mechanism (SimAM) is integrated into the backbone, which successfully improves the model's focus on crucial details within the input image, enabling the model to capture features of road damage more accurately, thus enhancing the model's precision. Second, the neck structure is optimized by replacing traditional convolution modules with GhostConv. This reduces redundant information, lowers the number of parameters, and decreases computational complexity while maintaining the model's excellent performance in damage recognition. Last, the upsampling algorithm in the neck is improved by replacing the nearest interpolation with more accurate bilinear interpolation. This enhances the model's capacity to maintain visual details, providing clearer and more accurate outputs for road damage detection tasks. Experimental findings on the RDD2022 dataset show that the proposed RDD-YOLO model achieves an mAP50 and mAP50-95 of 62.5% and 36.4% on the validation set, respectively. Compared to baseline, this represents an improvement of 2.5% and 5.2%. The F1 score on the test set reaches 69.6%, a 2.8% improvement over the baseline. The proposed method can accurately locate and detect road damage, save labor and material resources, and offer guidance for the assessment and upkeep of road damage. [ABSTRACT FROM AUTHOR]

This paper presents a downlink channel estimation method intended for a Narrowband Internet of Things (NB-IoT) access link. Due to its low computational complexity, this method is well suited for energy-efficient IoT devices, still providing acceptable reception quality in terms of signal-to-noise (SNR) performance. This paper describes the physical layer of NB-IoT within the scope of channel estimation, and also reviews existing channel estimation methods for OFDM signals. The proposed method, based on linear interpolation of channel coefficients, is described as a three-step procedure. Next, indicators of channel quality assessment, which may be determined without prior knowledge about the transmitted signal, are defined. Two variants of channel estimation, differing in the frequency domain processing, are evaluated to assess the significance of frequency selectivity in an NB-IoT downlink. The chosen method is compared with another method implemented in MATLAB LTE ToolboxTM. An analysis of the computation time is conducted, subsequently demonstrating the definite advantage of the proposed method. [ABSTRACT FROM AUTHOR]

Image stitching is a fundamental pillar of computer vision, and its effectiveness hinges significantly on the quality of the feature descriptors. However, the existing feature descriptors face several challenges, including inadequate robustness to noise or rotational transformations and limited adaptability during hardware deployment. To address these limitations, this paper proposes a set of feature descriptors for image stitching named Lightweight Multi-Feature Descriptors (LMFD). Based on the extensive extraction of gradients, means, and global information surrounding the feature points, feature descriptors are generated through various combinations to enhance the image stitching process. This endows the algorithm with formidable rotational invariance and noise resistance, thereby improving its accuracy and reliability. Furthermore, the feature descriptors take the form of binary matrices consisting of 0s and 1s, not only facilitating more efficient hardware deployment but also enhancing computational efficiency. The utilization of binary matrices significantly reduces the computational complexity of the algorithm while preserving its efficacy. To validate the effectiveness of LMFD, rigorous experimentation was conducted on the Hpatches and 2D-HeLa datasets. The results demonstrate that LMFD outperforms state-of-the-art image matching algorithms in terms of accuracy. This empirical evidence solidifies the superiority of LMFD and substantiates its potential for practical applications in various domains. [ABSTRACT FROM AUTHOR]

Currently, in most traditional VSLAM (visual SLAM) systems, static assumptions result in a low accuracy in dynamic environments, or result in a new and higher level of accuracy but at the cost of sacrificing the real–time property. In highly dynamic scenes, balancing a high accuracy and a low computational cost has become a pivotal requirement for VSLAM systems. This paper proposes a new VSLAM system, balancing the competitive demands between positioning accuracy and computational complexity and thereby further improving the overall system properties. From the perspective of accuracy, the system applies an improved lightweight target detection network to quickly detect dynamic feature points while extracting feature points at the front end of the system, and only feature points of static targets are applied for frame matching. Meanwhile, the attention mechanism is integrated into the target detection network to continuously and accurately capture dynamic factors to cope with more complex dynamic environments. From the perspective of computational expense, the lightweight network Ghostnet module is applied as the backbone network of the target detection network YOLOv5s, significantly reducing the number of model parameters and improving the overall inference speed of the algorithm. Experimental results on the TUM dynamic dataset indicate that in contrast with the ORB–SLAM3 system, the pose estimation accuracy of the system improved by 84.04%. In contrast with dynamic SLAM systems such as DS–SLAM and DVO SLAM, the system has a significantly improved positioning accuracy. In contrast with other VSLAM algorithms based on deep learning, the system has superior real–time properties while maintaining a similar accuracy index. [ABSTRACT FROM AUTHOR]

Based on the unwinding problem caused by the dual valued property of the quaternion description method, this paper designs an anti-unwinding sliding mode adaptive attitude tracking control with external disturbances and inertia matrix uncertainty. The sliding mode surface used in this paper contains two equilibrium points and adopts an indirect method, which greatly reduces the computational complexity. The stability and anti-unwinding performance have been proven. The simulation results have verified the effectiveness of the control method and we have compared it with the general linear sliding mode. The results show that the control method proposed in this paper is more stable, has higher convergence accuracy and has anti-unwinding performance. [ABSTRACT FROM AUTHOR]

To address the need for massive connections in Internet-of-Vehicle communications, local wireless networks utilize non-orthogonal multiple access (NOMA). Scholars have introduced deep reinforcement learning networks for user grouping and power allocation to reduce computational complexity. However, the traditional algorithm based on DQN (Deep Q-Network) still exhibits slow convergence speed and low training stability, while the uniform sampling method in the sample playback process suffers from low sampling efficiency. In order to address these issues, this paper proposes a user grouping and power allocation method for NOMA systems based on Prioritized Dueling DQN-DDPG joint optimization. Firstly, the paper introduces the user grouping network based on Dueling DQN, which considers both the state value and action value in the entire connection layer. The two values compete with each other, are summed up, and re-evaluated. The network significantly improves training stability and increases the convergence speed. Secondly, in this paper, a depth deterministic strategy gradient (DDPG) algorithm with symmetric properties is used. This algorithm works well for continuous action spaces and avoids the power quantization error because of the continuity of power value in the power allocation stage. Finally, the priority sampling based on TD-error (Temporal-difference error) is combined with the Dueling DQN network and DDPG network to ensure random sampling and improve the replay probability of important samples. Simulation results show that the proposed priority-based Dueling DQN-DDPG algorithm significantly improves the convergence speed of sample training. The research results of this paper provide a solid foundation for the following research content, which focuses on NOMA system resource allocation under the mobile user state. [ABSTRACT FROM AUTHOR]

Nowadays, data-driven fuzzy inference systems (FIS) have become popular to solve different vague, imprecise, and uncertain problems in various application domains. However, plenty of authors have identified different challenges and issues of FIS development because of its complexity that also influences FIS quality attributes. Still, there is no common agreement on a systematic view of these complexity issues and their relationship to quality attributes. In this paper, we present a systematic literature review of 1340 scientific papers published between 1991 and 2019 on the topic of FIS complexity issues. The obtained results were systematized and classified according to the complexity issues as computational complexity, complexity of fuzzy rules, complexity of membership functions, data complexity, and knowledge representation complexity. Further, the current research was extended by extracting FIS quality attributes related to the found complexity issues. The key, but not all, FIS quality attributes found are performance, accuracy, efficiency, and interpretability. [ABSTRACT FROM AUTHOR]