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]

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]

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 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]

Multiple-input-multiple-output (MIMO) systems are of interest for meeting the expected demand for higher data rates and lower delays in future wireless packet data systems. In such systems, it is optimal to simultaneously transmit to multiple users compared with a single user in a single-input-single-output system. In addition, multicarrier systems are of interest to combat frequency-selective fading that is experienced over the larger bandwidth that these future broadband systems will use. The use of dirty paper coding further complicates the matter, because the order in which the users are encoded will affect the rates that they can achieve. A well-designed cross-layer scheduling algorithm must take into account the multiple dimensions of this resource-allocation problem and other quality-of-service (QoS) parameters to fully exploit the communications channel. The scheduling problem is often expressed in terms of optimizing some utility function. Unfortunately, the search space for this optimization problem is extremely large, which prohibits an optimal exhaustive search. To this end, we investigate the use of genetic algorithms to reduce the complexity of the scheduling. This paper builds upon prior work that implements scheduling via genetic algorithms in the context of single-carrier systems using zero-forcing beamforming (ZFB). In this paper, we investigate how the genetic algorithm can be adapted to account for the effect of encoding order on the scheduling and how the scheduling can be extended to a multicarrier system. In particular, we investigate the maximum throughput and proportionally fair scheduling criteria. We demonstrate that the performance of the genetic algorithm is near optimal compared with an exhaustive search at a greatly reduced computational complexity. Furthermore, in the case of a multicarrier orthogonal frequency-division multiplexing (OFDM) system, an increase in capacity is shown relative to the single-carrier case. [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]

Distracted driving is one of the major factors leading drivers to ignore potential road hazards. In response to the challenges of high computational complexity, limited generalization capacity, and suboptimal detection accuracy in existing deep learning-based detection algorithms, this paper introduces a novel approach called StarDL-YOLO (StarNet-detectlscd-yolo), which leverages an enhanced version of YOLOv8n. Initially, the StarNet integrated into the backbone of YOLOv8n significantly improves the feature extraction capability of the model with remarkable reduction in computational complexity. Subsequently, the Star Block is incorporated into the neck network, forming a C2f-Star module that offers lower computational cost. Additionally, shared convolution is introduced in the detection head to further reduce computational burden and parameter size. Finally, the Wise-Focaler-MPDIoU loss function is proposed to strengthen detection accuracy. The experimental results demonstrate that StarDL-YOLO significantly improves the efficiency of the distracted driving behavior detection, achieving an accuracy of 99.6% on the StateFarm dataset. Moreover, the parameter count of the model is minimized by 56.4%, and its computational load is decreased by 45.1%. Additionally, generalization experiments are performed on the 100-Driver dataset, revealing that the proposed scheme enhances generalization effectiveness compared to YOLOv8n. Therefore, this algorithm significantly reduces computational load while maintaining high reliability and generalization capability. [ABSTRACT FROM AUTHOR]

As artificial intelligence technology progresses, deep learning models are increasingly utilized for machine fault classification. However, a significant drawback of current state-of-the-art models is their high computational complexity, rendering them unsuitable for deployment in portable devices. This paper presents a compact fault diagnosis model that integrates a self-attention SqueezeNet architecture with a hybrid texture representation technique utilizing empirical mode decomposition (EMD) and a gammatone spectrogram (GS) filter. In the model, the dominant signal is first isolated from the audio fault signals by discarding lower intrinsic mode functions (IMFs) from EMD, and subsequently, the dominant signals are transformed into 2D texture maps using the GS filter. These generated texture maps feed as input into the modified self-attention SqueezeNet classifier, featuring reduced model width and depth, for training and validation. Different attention modules were tested in the paper, including the self-attention, channel attention, spatial attention, and convolutional block attention module (CBAM). The models were tested on the MIMII and ToyADMOS datasets. The experimental results demonstrated that the self-attention mechanism with SqueezeNet achieved an accuracy of 97% on the previously unseen MIMII and ToyADMOS datasets. Furthermore, the proposed model outperformed the SqueezeNet attention model with other attention mechanisms and state-of-the-art deep architectures, exhibiting a higher precision, recall, and F1-score. Lastly, t-SNE is applied to visualize the features of the self-attention SqueezeNet for different fault classes of both MIMII and ToyADMOS. [ABSTRACT FROM AUTHOR]

Most image quality assessment (IQA) algorithms based on sparse representation primarily focus on amplitude information, often overlooking the structural composition of images. However, structural composition is closely linked to perceived image quality, a connection that existing methods do not adequately address. To fill this gap, this paper proposes a novel distorted-image quality assessment algorithm based on a sparse structure and subjective perception (IQA-SSSP). This algorithm evaluates the quality of distorted images by measuring the sparse structure similarity between a reference and distorted images. The proposed method has several advantages. First, the sparse structure algorithm operates with reduced computational complexity, leading to faster processing speeds, which makes it suitable for practical applications. Additionally, it efficiently handles large-scale data, further enhancing the assessment process. Experimental results validate the effectiveness of the algorithm, showing that it achieves a high correlation with human visual perception, as reflected in both objective and subjective evaluations. Specifically, the algorithm yielded a Pearson correlation coefficient of 0.929 and a mean squared error of 8.003, demonstrating its robustness and efficiency. By addressing the limitations of existing IQA methods and introducing a more holistic approach, this paper offers new perspectives on IQA. The proposed algorithm not only provides reliable quality assessment results but also closely aligns with human visual experience, thereby enhancing both the objectivity and accuracy of image quality evaluations. This research offers significant theoretical support for the advancement of sparse representation in IQA. [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]

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]

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]

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]

Currently, image recognition based on deep neural networks has become the mainstream direction of research; therefore, significant progress has been made in its application in the field of tea detection. Many deep models exhibit high recognition rates in tea leaves detection. However, deploying these models directly on tea-picking equipment in natural environments is impractical; the extremely high parameters and computational complexity of these models make it challenging to perform real-time tea leaves detection. Meanwhile, lightweight models struggle to achieve competitive detection accuracy; therefore, this paper addresses the issue of computational resource constraints in remote mountain areas and proposes Reconstructed Feature and Dual Distillation (RFDD) to enhance the detection capability of lightweight models for tea leaves. In our method, the Reconstructed Feature selectively masks the feature of the student model based on the spatial attention map of the teacher model; it utilizes a generation block to force the student model to generate the teacher's full feature. The Dual Distillation comprises Decoupled Distillation and Global Distillation. Decoupled Distillation divides the reconstructed feature into foreground and background features based on the Ground-Truth. This compels the student model to allocate different attention to foreground and background, focusing on their critical pixels and channels. However, Decoupled Distillation leads to the loss of relation knowledge between foreground and background pixels. Therefore, we further perform Global Distillation to extract this lost knowledge. Since RFDD only requires loss calculation on feature map, it can be easily applied to various detectors. We conducted experiments on detectors with different frameworks, using a tea dataset collected at the Huangshan Houkui Tea Plantation. The experimental results indicate that, under the guidance of RFDD, the student detectors have achieved performance improvements to varying degrees. For instance, a one-stage detector like RetinaNet (ResNet-50) experienced a 3.14% increase in Average Precision (AP) after RFDD guidance. Similarly, a two-stage model like Faster RCNN (ResNet-50) obtained a 3.53% improvement in AP. This offers promising prospects for lightweight models to efficiently perform real-time tea leaves detection tasks. [ABSTRACT FROM AUTHOR]

This paper presents a decoupled modal reduction method for the steady-state vibration analysis of vibro-acoustic systems characterized by non-classical damping. The proposed approach initially reduces the order of the coupled governing equations of the vibro-acoustic system through the utilization of non-coupled modes, subsequently employing the complex mode superposition technique to address non-classical damping effects. By leveraging non-coupled modes, this method circumvents the need to solve for coupled modes as required in traditional modal reduction techniques, thereby diminishing both computational complexity and cost. Furthermore, the complex mode superposition method facilitates the decoupling of coupled governing equations with non-classical damping, enhancing computational efficiency. Numerical examples validate both the accuracy and effectiveness of this methodology. Given that modal decomposition is independent of frequency, an analysis of computational efficiency across various stages further substantiates that this method offers significant advantages in terms of efficiency for computational challenges encountered over a broad frequency range. [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]

The parallel mechanism exhibits high stiffness and excellent dynamic response, making it ideal for high-precision applications. In our early work, a novel 6-DOF redundant parallel posture mechanism with four limbs for solar wing docking has been proposed; each limb consists of three links and four joints. This paper primarily focuses on optimization design of the mechanism. The calculation of workspace volume reveals that factors influencing the range of posture adjustment include dynamic platform parameters, static platform parameters, the drive trajectory of each kinematic pair, and the angles between each kinematic pair. A sensitivity analysis was conducted to examine the impact of each parameter on the range of posture adjustment. To reduce computational complexity and improve analysis efficiency, a combined approach of single-factor analysis and response surface methodology (RSM) is used in the paper. Single-factor analysis is utilized to evaluate the effect of each parameter on the posture adjustment range. Based on these results, RSM is used to establish a regression model for parameters; thereby, the optimal parameter combination for the mechanism is determined. The regression coefficient R2 = 0.9374 attests to the validity of the proposed model. Finally, a comparison of the posture adjustment range before and after optimization is presented, providing a foundation for the practical application of the redundant parallel mechanism. This paper introduces a novel structural design concept aimed at resolving the conflict between heavy loads and compact sizes in redundant parallel mechanisms while providing valuable insights for miniaturized design. [ABSTRACT FROM AUTHOR]

In response to the challenges of small-size defects and low recognition rates in Printed Circuit Boards (PCBs), as well as the need for lightweight detection models that can be embedded in portable devices, this paper proposes an improved defect detection method based on a lightweight shared convolutional head using YOLOv8n. Firstly, the Spatial and Channel reconstruction Convolution (SCConv) is embedded into the Cross Stage Partial with Convolutional Layer Fusion (C2f) structure of the backbone network, which reduces redundant computations and enhances the model's learning capacity. Secondly, an adaptive feature selection module is integrated to improve the network's ability to recognize small targets. Subsequently, a Shared Lightweight Convolutional Detection (SLCD) Head replaces the original Decoupled Head, reducing the model's computational complexity while increasing detection accuracy. Finally, the Weighted Intersection over Union (WIoU) loss function is introduced to provide more precise evaluation results and improve generalization capability. Comparative experiments conducted on a public PCB dataset demonstrate that the improved algorithm achieves a mean Average Precision (mAP) of 98.6% and an accuracy of 99.8%, representing improvements of 3.8% and 3.1%, respectively, over the original model. The model size is 4.1 M, and its FPS is 144.1, meeting the requirements for real-time and lightweight portable deployment. [ABSTRACT FROM AUTHOR]

Aiming to provide solutions for problems proposed by the inaccurate segmentation of long objects and information loss of small objects in real-time semantic segmentation algorithms, this paper proposes a lightweight multi-branch real-time semantic segmentation network based on BiseNetV2. The new auxiliary branch makes full use of spatial details and context information to cover the long object in the field of view. Meanwhile, in order to ensure the inference speed of the model, the asymmetric convolution is used in each stage of the auxiliary branch to design a structure with low computational complexity. In the multi-branch fusion stage, the alignment-and-fusion module is designed to provide guidance information for deep and shallow feature mapping, so as to make up for the problem of feature misalignment in the fusion of information at different scales, and thus reduce the loss of small target information. In order to further improve the model's awareness of key information, a global context module is designed to capture the most important features in the input data. The proposed network uses an NVIDIA GeForce RTX 3080 Laptop GPU experiment on the road street view Cityscapes and CamVid datasets, with the average simultaneously occurring ratios reaching 77.1% and 77.4%, respectively, and the running speeds reaching 127 frames/s and 112 frames/s, respectively. The experimental results show that the proposed algorithm can achieve a real-time segmentation and improve the accuracy significantly, showing good semantic segmentation performance. [ABSTRACT FROM AUTHOR]

Construction waste detection under complex scenarios poses significant challenges due to low detection accuracy, high computational complexity, and large parameter volume in existing models. These challenges are critical as accurate and efficient detection is essential for effective waste management in the construction industry, which is increasingly focused on sustainability and resource optimization. This paper aims to address the low accuracy of detection, high computational complexity, and large parameter volume in the models of construction waste detection under complex scenarios. For this purpose, an improved YOLOv8-based algorithm called FE-YOLO is proposed in this paper. This algorithm replaces the C2f module in the backbone with the Faster_C2f module and integrates the ECA attention mechanism into the bottleneck layer. Also, a custom multi-class construction waste dataset is created for evaluation. FE-YOLO achieves an mAP@50 of 92.7% on this dataset, up by 3% compared to YOLOv8n. Meanwhile, the parameter count and floating-point operations are scaled down by 12% and 13%, respectively. Finally, a test is conducted on a publicly available construction waste dataset. The test results demonstrate the excellent performance of this algorithm in generalization and robustness. [ABSTRACT FROM AUTHOR]

Synthetic aperture radar (SAR) inter-pulse parameter agility technology involves dynamically adjusting parameters such as the pulse width, chirp rate, carrier frequency, and pulse repetition interval within a certain range; this effectively increases the complexity and uncertainty of radar waveforms, thereby countering active deceptive interference signals from multiple dimensions. With the development of active deceptive interference technology, single-parameter agility can no longer meet the requirements, making multi-parameter joint agility one of the main research directions. However, inter-pulse carrier frequency agility can cause azimuth Doppler chirp rate variation, making azimuth compression difficult and compensation computationally intensive, thus hindering imaging. Additionally, pulse repetition interval (PRI) agility leads to non-uniform azimuth sampling, severely deteriorating image quality. To address these issues, this paper proposes a multi-parameter agile SAR imaging scheme based on traditional frequency domain imaging algorithms. This scheme can handle joint agility of pulse width, chirp rate polarity, carrier frequency, and PRI, with relatively low computational complexity, making it feasible for engineering implementation. By inverting SAR images, the echoes with multi-parameter joint agility are obtained, and active deceptive interference signals are added for processing. The interference-suppressed imaging results verify the effectiveness of the proposed method. Furthermore, simulation results of point targets with multiple parameters under the proposed processing algorithm show that the peak sidelobe ratio (PSLR) and integrated sidelobe ratio (ISLR) are improved by 12 dB and 10 dB, respectively, compared to the traditional fixed waveform scheme. [ABSTRACT FROM AUTHOR]

Unmanned logistics vehicle (ULV) realize the automation and intelligence of cargo transportation, which improves the efficiency, cost-effectiveness and safety of logistics and distribution, while the trajectory tracking control of ULV is the key technology to ensure their safe and efficient delivery of goods. In order to solve the trajectory tracking problem of ULV in the process of delivering goods, this paper proposes a model predictive control (MPC) method based on event-triggered and fuzzy adaptive optimization parameters. Firstly, the dynamics model of the ULV is established. Secondly, an event-triggered mechanism is introduced to establish ET-MPC, while a disturbance observer is designed considering the external disturbance and the controller calculation discarding the nonlinear term. Thirdly, the advantages of fuzzy control and MPC algorithms are integrated, and the four important parameters in the MPC controller are adaptively optimized by fuzzy control, and the improved MPC control strategy is designed. Finally, the CarSim-Matlab/Simulink co-simulation platform and the experimental vehicle platform are constructed to verify the effectiveness of the improved MPC trajectory tracking controller proposed in this paper. The results show that the improved MPC control strategy can reduce the computation time of the controller, and the total number of triggering times of the controller is reduced by 46.44% compared with the classical MPC, which reduces the computational complexity of the controller and improves the accuracy and smoothness of the trajectory tracking of the ULV. [ABSTRACT FROM AUTHOR]

Crystallization is important to the pharmaceutical, the chemical, and the materials fields, where the morphology of crystals is one of the key factors affecting the quality of crystallization. High-throughput screening based on microfluidic droplets is a potent technique to accelerate the discovery and development of new crystal morphologies with active pharmaceutical ingredients. However, massive crystal morphologies' datum needs to be identified completely and accurately, which is time-consuming and labor-intensive. Therefore, effective morphologies' detection and small-target tracking are essential for high-efficiency experiments. In this paper, a new improved algorithm YOLOv8 (YOLO-PBESW) for detecting indomethacin crystals with different morphologies is proposed. We enhanced its capability in detecting small targets through the integration of a high-resolution feature layer P2, and the adoption of a BiFPN structure. Additionally, in this paper, adding the EMA mechanism before the P2 detection head was implemented to improve network attention towards global features. Furthermore, we utilized SimSPPF to replace SPPF to mitigate computational costs and reduce inference time. Lastly, the CIoU loss function was substituted with WIoUv3 to improve detection performance. The experimental findings indicate that the enhanced YOLOv8 model attained advancements, achieving AP metrics of 93.3%, 77.6%, 80.2%, and 99.5% for crystal wire, crystal rod, crystal sheet, and jelly-like phases, respectively. The model also achieved a precision of 85.2%, a recall of 83.8%, and an F1 score of 84.5%, with a mAP of 87.6%. In terms of computational efficiency, the model's dimensions and operational efficiency are reported as 5.46 MB, and it took 12.89 ms to process each image with a speed of 77.52 FPS. Compared with state-of-the-art lightweight small object detection models such as the FFCA-YOLO series, our proposed YOLO-PBESW model achieved improvements in detecting indomethacin crystal morphologies, particularly for crystal sheets and crystal rods. The model demonstrated AP values that exceeded L-FFCA-YOLO by 7.4% for crystal sheets and 3.9% for crystal rods, while also delivering a superior F1-score. Furthermore, YOLO-PBESW maintained a lower computational complexity, with parameters of only 11.8 GFLOPs and 2.65 M, and achieved a higher FPS. These outcomes collectively demonstrate that our method achieved a balance between precision and computational speed. [ABSTRACT FROM AUTHOR]

Private Set Intersection (PSI) is a cryptographic method in secure multi-party computation that allows entities to identify common elements in their datasets 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 the Internet of Things and mobile scenarios where device limitations restrict computational types. Traditional PSI protocols are inefficient here, as computational and communication complexities correlate with the size of larger datasets. Thus, adapting PSI protocols to these imbalances is crucial. This paper explores unbalanced PSI 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. It introduces three innovative solutions for unbalanced PSI: an unbalanced PSI protocol based on the Cuckoo filter, an unbalanced PSI protocol based on single-cloud assistance, and an unbalanced PSI protocol based on dual-cloud assistance, with each subsequent solution addressing the shortcomings of the previous one. Depending on performance and security needs, different protocols can be employed for applications such as private contact discovery. [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 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]

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]

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]

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 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]

The conjugate gradient method plays a very important role in several fields, to solve problems of large sizes. To improve the efficiency of this method, a lot of works have been done; in this paper we propose a new modification of PRP method to solve a large scale unconstrained optimization problems in relation with strong Wolf Powell Line Search property, when the latter was used under some conditions, a global convergence result was proved. In comparison with other known methods the efficiency of this method proved that it is better in the number of iterations and in time on 90 proposed problems by use of Matlab. [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]

This paper investigates the direction‐of‐arrival (DOA) estimation of electromagnetic pulse (EMP) sources in modern radar system and proposes a novel EMP DOA estimation method. The method is based on energy distribution and improves the low accuracy and high computational complexity of the conventional estimation method. According to the characteristics of the EMP signal, the frequency point where 90% of the signal energy is concentrated is considered as the critical frequency point. Before this point, differently sized frequency sub‐blocks are determined depending on the energy. After the critical frequency point, identically sized frequency sub‐blocks are chosen at equal frequency intervals for processing. The proposed method is compared with the representative EMP DOA estimation methods. Simulation experiments are carried out to validate the effectiveness of the proposed method. The results illustrate that the computational complexity is significantly reduced while the accuracy is improved compared to the conventional 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]

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]

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]

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]