Search

In the past decade, the diversification of steganographic techniques has posed significant threats to information security, necessitating effective countermeasures. Current defenses, mainly reliant on steganalysis, struggle with detection accuracy. While "image vaccines" have been proposed, they often target specific methodologies. This paper introduces a universal steganographic vaccine to enhance steganalysis accuracy. Our symmetric approach integrates with existing methods to protect images before online dissemination using the Contrast Limited Adaptive Histogram Equalization (CLAHE) algorithm. Experimental results show significant accuracy improvements across traditional and deep learning-based steganalysis, especially at medium-to-high payloads. Specifically, for payloads of 0.1–0.5 bpp, the original detection error rate was reduced from 0.3429 to 0.2346, achieving an overall average reduction of 31.57% for traditional algorithms, while the detection success rate of deep learning-based algorithms can reach 100%. Overall, integrating CLAHE as a universal vaccine significantly advances steganalysis. [ABSTRACT FROM AUTHOR]

The proliferation of IoT using heterogeneous wireless technologies within the unlicensed spectrum has intensified cross-technology interference (CTI) in wireless local area networks (WLANs). As WLANs increasingly adopt time-triggered transmission methods to support real-time services, this interference affects throughput, packet loss, and latency. This paper presents a CTI-aware rate adaptation framework designed to mitigate interference in WLANs without direct coordination with heterogeneous wireless devices. The framework includes a CTI identification model and CTI-aware rate selection algorithms. Leveraging short-time Fourier transform, the identification model captures the time–frequency–power characteristics of CTI signals, enabling the estimation of the average power of various heterogeneous wireless technologies employed by interfering devices. The rate selection algorithms predict CTI occurrence times and adjust the transmission rate accordingly, enhancing the performance of existing explicit and implicit interference mitigation methods. Experimental results demonstrated that the lightweight CTI identification model accurately estimated the average power of each type with an error margin of ±1.414 dBm, achieving this in under 1 ms on the target hardware. Additionally, applying the proposed framework to explicit interference mitigation enhanced goodput by 20.67%, reduced packet error rate by 2.38%, and decreased the probability of packets exceeding 1 ms latency by 0.932% compared to conventional methods. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Beijing University of Technology is the property of Journal of Beijing University of Technology, Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper presents an improved mm-wave communication system by incorporating Artificial Bee Colony (ABC) algorithm for feature vector selection and using the firefly algorithm for hyperparameter tuning. The proposed system achieves better performance compared to existing systems, as evidenced by the lower Bit Error Rate (BER), higher throughput, and improved classification metrics. The ABC algorithm enhances feature vector selection, enabling the system to effectively identify and utilize relevant features. The firefly algorithm optimizes the system's parameters, leading to enhanced communication throughput. Experimental results demonstrate the superiority of the proposed system, highlighting the importance of hyperparameter tuning and swarm intelligence algorithms in mm-wave communication. Experiment results demonstrate the superiority of the proposed system in terms of both qualitative and quantitative parameters. For qualitative parameters analysis, the proposed work has been evaluated in terms of throughput and BER, where the proposed system outperforms by increment in throughput with 10.31% and lower BER over existing system. In terms of quantitative analysis, the proposed algorithm outperforms with the accuracy of 92.03%, precision of 96.30%, Recall of 98.96% and F-measure of 97.61% in comparison to existing work. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel keyframe extraction extraction method based on the gray wolf optimization (GWO) algorithm, addressing the challenge of information loss in traditional methods due to redundant and similar frames. The proposed method GWOKConvLSTM prioritizes speed, accuracy, and compression efficiency while preserving semantic information. Inspired by wolf behavior, we construct a fitness function that minimizes reconstruction error and achieves optimal compression ratios below 8%. Compared to traditional methods, our GWO method achieves the lowest reconstruction error for a given compression rate, providing a concise and visually coherent summary of keyframes while maintaining consistency across similar motions. Additionally, we propose a template-based method for video classification tasks, achieving the highest accuracy when combined with pre-trained CNNs and ConvLSTM. Our method effectively prevents dynamic background noise from affecting keyframe selection, leading to significantly improve video classification performance using deep neural networks. [ABSTRACT FROM AUTHOR]

We propose two decoding algorithms for quasi-cyclic LDPC codes (QC-LDPC) and implement the more efficient one in this paper. These algorithms depend on the split row for the layered decoding method applied to the Min-Sum (MS) algorithm. We designate the first algorithm "Split-Row Layered Min-Sum" (SRLMS), and the second algorithm "Split-Row Threshold Layered Min-Sum" (SRTLMS). A threshold message passes from one partition to another in SRTLMS, minimizing the gap from the MS and achieving a binary error rate of 3 × 10−5 with Imax = 4 as the maximum number of iterations, resulting in a decrease of 0.25 dB. The simulation's findings indicate that the SRTLMS is the most efficient variant decoding algorithm for LDPC codes, thanks to its compromise between performance and complexity. This paper presents the two invented algorithms and a comprehensive study of the co-design and implementation of the SRTLMS algorithm. We executed the implementation on a Xilinx Kintex-7 XC7K160 FPGA, achieving a maximum operating frequency of 101 MHz and a throughput of 606 Mbps. [ABSTRACT FROM AUTHOR]

Many algorithms have been proposed to learn local graphical structures around target variables of interest from observational data, focusing on two sets of variables. The first one, called Parent–Children (PC) set, contains all the variables that are direct causes or consequences of the target while the second one, known as Markov boundary (MB), is the minimal set of variables with optimal prediction performances of the target. In this paper we introduce two novel algorithms for the PC and MB discovery tasks with rigorous guarantees on the Family-Wise Error Rate (FWER), that is, the probability of reporting any false positive in output. Our algorithms use Rademacher averages, a key concept from statistical learning theory, to properly account for the multiple-hypothesis testing problem arising in such tasks. Our evaluation on simulated data shows that our algorithms properly control for the FWER, while widely used algorithms do not provide guarantees on false discoveries even when correcting for multiple-hypothesis testing. Our experiments also show that our algorithms identify meaningful relations in real-world data. [ABSTRACT FROM AUTHOR]

Orthogonal time frequency selectivity is considered one of the most promising advanced waveforms for high-mobility conditions in beyond-fifth-generation networks. A high peak-to-average power ratio in orthogonal time frequency introduces nonlinearity and degrades the power amplifier performance. In this work, we propose a novel automatic amplitude reduction neural network algorithm combined with partial transmission sequence and selective mapping methods using the Vendermonde matrix for generating phase sequences. In a conventional selective mapping methods or partial transmission sequence, selecting an optimal phase increases the complexity, which is overcome via Vendermonde matrix in a proposed framework. The minimization of the peak-to-average power ratio is obtained at the double-stage process: in the first stage, the threshold amplitude is set, and the amplitude exceeding the threshold is reduced by using an automatic amplitude reduction neural network and then the partial transmission scheme or selective mapping methods. The simulation results reveal that, compared with the conventional algorithms, the proposed algorithms yield a significant peak average-to-power ratio, bit error rate, and power spectrum density performance. [ABSTRACT FROM AUTHOR]

This study introduces a cutting-edge image encryption algorithm aimed at elevating security standards. The Pan-Tompkins Algorithm (PTA) for key generation is proposed for the first time in this study. Additionally, employing steganography through the Least Significant Bit (LSB) method for embedding keys within the encrypted image enhances secure key distribution, thereby fortifying the encryption process. On the other hand, the integration of advanced algorithms, such as Zigzag scanning, the Affine Image Encryption Algorithm (AA), and the Vigenere Image Encryption Algorithm (VA), constitutes the fundamental innovation of the proposed image encryption algorithm. The proposed algorithm is named PanAAVA:Affine Algorithm and Vigenere Algorithm Encryption with PTA-Based Key Generation. The PanAAVA algorithm ensures unparalleled security by encrypting the positions and values of pixels using AA and VA. Notably, using PTA for key generation marks a distinctive and new key generation method feature of the algorithm. To assess the effectiveness of the PanAAVA, a comprehensive comparative analysis is conducted against well-established encryption methodologies, including Lena, Baboon, Airplane, and Pepper. The PanAAVA demonstrates exceptional proficiency in histogram analysis. The PanAAVA demonstrates a Unified Average Changing Intensity (UACI) of 33.4044%. Additionally, the Number of Pixels Change Rate (NPCR) is measured at 99.7442%, showcasing the algorithm's effectiveness in inducing significant pixel changes. The proposed algorithm's Mean Square Error (MSE) is calculated at 3.20679E5%. The proposed algorithm's Peak Signal to Noise Ratio (PSNR) is recorded at 9.512475. The Key Space Size of the proposed algorithm is measured at 2209. Regarding correlation analysis, the PanAAVA achieves a high correlation score of 7.9996. The proposed algorithm successfully passes the National Institute of Standards and Technology (NIST) analysis, demonstrating a remarkably strong correlation close to 0 and a Structural Similarity Index Measure (SSIM) of 0.9977. Furthermore, regarding quantum communication, the proposed algorithm maintains stable key rates of 47.5 ± 0.8 kHz during the day and 50.9 ± 0.7 kHz at night. Additionally, PanAAVA achieves low Quantum Bit Error Rate (QBER) values of 4.77 ± 0.02, ensuring reliable and secure communication. The PanAAVA also demonstrates robust asymmetries at 49.81 ± 0.02 and 50.14 ± 0.03 for a crystal length of 20 mm. highlighting PanAAVA's adaptability and effectiveness in different scenarios. PanAAVA outperforms other encryption algorithms concerning performance measurements and comparisons. In conclusion, the PanAAVA emerges as a beacon of superior security capabilities and innovation in image encryption, showcasing the potential to redefine standards in the field. [ABSTRACT FROM AUTHOR]

As computer graphics technology continues to advance, Collision Detection (CD) has emerged as a critical element in fields such as virtual reality, computer graphics, and interactive simulations. CD is indispensable for ensuring the fidelity of physical interactions and the realism of virtual environments, particularly within complex scenarios like virtual assembly, where both high precision and real-time responsiveness are imperative. Despite ongoing developments, current CD techniques often fall short in meeting these stringent requirements, resulting in inefficiencies and inaccuracies that impede the overall performance of virtual assembly systems. To address these limitations, this study introduces a novel algorithm that leverages the capabilities of a Backpropagation Neural Network (BPNN) to optimize the structural composition of the Hybrid Bounding Volume Tree (HBVT). Through this optimization, the research proposes a refined Hybrid Hierarchical Bounding Box (HHBB) framework, which is specifically designed to enhance the computational efficiency and precision of CD processes. The HHBB framework strategically reduces the complexity of collision detection computations, thereby enabling more rapid and accurate responses to collision events. Extensive experimental validation within virtual assembly environments reveals that the proposed algorithm markedly improves the performance of CD, particularly in handling complex models. The optimized HBVT architecture not only accelerates the speed of collision detection but also significantly diminishes error rates, presenting a robust and scalable solution for real-time applications in intricate virtual systems. These findings suggest that the proposed approach offers a substantial advancement in CD technology, with broad implications for its application in virtual reality, computer graphics, and related fields. [ABSTRACT FROM AUTHOR]

In this paper, the proficiency of nonlinearity compensation studied on the polarization division multiplexing 0.3 return-to-zero quadrature phase-shift keying (PDM-0.3RZ-QAM) coherent optical system. The considerable nonlinear effect is the self-phase modulation (SPM) in the presence of chromatic dispersion. The nonlinearity mitigation technique based on the digital backpropagation (DBP) algorithm is implemented on the receiver side. The performance of the system was investigated in different terms as the optical signal-noise ratio, bit error rate, and the maximum transmission distance. The results demonstrated that the penalties were decreased by 3 dB. The maximum achievable distance was extended to 2000 km. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Chongqing University of Posts & Telecommunications (Natural Science Edition) is the property of Chongqing University of Posts & Telecommunications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

AbstractReal networks often have severe degree heterogeneity, with maximum, average, and minimum node degrees differing significantly. This article examines the impact of degree heterogeneity on statistical limits of network data analysis. Introducing the heterogeneity distribution (HD) under a degree-corrected mixed membership model, we show that the optimal rate of mixed membership estimation is an explicit functional of the HD. This result confirms that severe degree heterogeneity decelerates the error rate, even when the overall sparsity remains unchanged. To obtain a rate-optimal method, we modify an existing spectral algorithm, Mixed-SCORE, by adding a pre-PCA normalization step. This step normalizes the adjacency matrix by a diagonal matrix consisting of the bth power of node degrees, for some b∈R . We discover that b = 1/2 is universally favorable. The resulting spectral algorithm is rate-optimal for networks with arbitrary degree heterogeneity. A technical component in our proofs is entry-wise eigenvector analysis of the normalized graph Laplacian. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work. [ABSTRACT FROM AUTHOR]

The unauthorized replication and distribution of digital images pose significant challenges to copyright protection. While existing solutions incorporate blockchain-based techniques such as perceptual hashing and digital watermarking, they lack large-scale experimental validation and a dedicated blockchain consensus protocol for image copyright management. This paper introduces DRPChain, a novel digital image copyright management system that addresses these issues. DRPChain employs an efficient cropping-resistant robust image hashing algorithm to defend against 14 common image attacks, demonstrating an 85% success rate in watermark extraction, 10% higher than the original scheme. Moreover, the paper designs the K-Raft consensus algorithm tailored for image copyright protection. Comparative experiments with Raft and benchmarking against PoW and PBFT algorithms show that K-Raft reduces block error rates by 2%, improves efficiency by 300ms compared to Raft, and exhibits superior efficiency,decentralization, and throughput compared to PoW and PBFT. These advantages make K-Raft more suitable for digital image copyright protection. This research contributes valuable insights into using blockchain technology for digital copyright protection, providing a solid foundation for future exploration. [ABSTRACT FROM AUTHOR]

AbstractMost existing classification methods aim to minimize the overall misclassification error rate. However, in applications such as loan default prediction, different types of errors can have varying consequences. To address this asymmetry issue, two popular paradigms have been developed: the Neyman-Pearson (NP) paradigm and the cost-sensitive (CS) paradigm. Previous studies on the NP paradigm have primarily focused on the binary case, while the multi-class NP problem poses a greater challenge due to its unknown feasibility. In this work, we tackle the multi-class NP problem by establishing a connection with the CS problem via strong duality and propose two algorithms. We extend the concept of NP oracle inequalities, crucial in binary classifications, to NP oracle properties in the multi-class context. Our algorithms satisfy these NP oracle properties under certain conditions. Furthermore, we develop practical algorithms to assess the feasibility and strong duality in multi-class NP problems, which can offer practitioners the landscape of a multi-class NP problem with various target error levels. Simulations and real data studies validate the effectiveness of our algorithms. To our knowledge, this is the first study to address the multi-class NP problem with theoretical guarantees. The proposed algorithms have been implemented in the R package npcs, which is available on CRAN. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work. [ABSTRACT FROM AUTHOR]

With the advancement of radar technology toward multifunctionality and cognitive capabilities, traditional radar countermeasures are no longer sufficient to meet the demands of countering the advanced multifunctional radar (MFR) systems. Rapid and accurate generation of the optimal jamming strategy is one of the key technologies for efficiently completing radar countermeasures. To enhance the efficiency and accuracy of jamming policy generation, an efficient jamming policy generation method based on multi-timescale ensemble Q-learning (MTEQL) is proposed in this paper. First, the task of generating jamming strategies is framed as a Markov decision process (MDP) by constructing a countermeasure scenario between the jammer and radar, while analyzing the principle radar operation mode transitions. Then, multiple structure-dependent Markov environments are created based on the real-world adversarial interactions between jammers and radars. Q-learning algorithms are executed concurrently in these environments, and their results are merged through an adaptive weighting mechanism that utilizes the Jensen–Shannon divergence (JSD). Ultimately, a low-complexity and near-optimal jamming policy is derived. Simulation results indicate that the proposed method has superior jamming policy generation performance compared with the Q-learning algorithm, in terms of the short jamming decision-making time and low average strategy error rate. [ABSTRACT FROM AUTHOR]

Peak-to-average power ratio (PAPR) in orthogonal time frequency space (OTFS) is vital for optimizing signal efficiency, minimizing distortion, and enhancing the performance of a beyond fifth-generation (B5G) system. The paper focuses on lowering the PAPR while retaining the bit error rate (BER) and power spectral density (PSD) for 64 and 256 sub-carriers. The PAPR is minimized by using a fractal optimization process known as selective mapping (SLM) and partial transmission sequence (PTS) at the transmitting block of the OTFS framework. The combination of SLM and PTS reduces peak power by selectively modifying the phase of transmitted symbols. SLM generates multiple versions of the signal, while PTS allocates power to these versions optimally, collectively mitigating amplitude peaks and minimizing PAPR. According to the simulation results, the suggested SLM+PTS works better than the traditional SLM and PTS, achieving low spectrum leakage and PAPR improvements of 5.5 dB and 4.9 dB as well as SNR gains of 2.4 dB and 2.1 dB. In the future, SLM+PTS may work on lowering PAPR by making computers faster, researching adaptive algorithms, and combining machine learning methods for real-time optimization in various communication settings. Complex modeling, including fractal-based SLM and PTS approaches, provides a detailed understanding of waveform behavior and interference patterns, enabling more accurate and effective hybrid PAPR reduction techniques. This combination enhances the ability to manage to mitigate non-linear distortion across various sub-carriers, crucial for the performance and efficiency of 6G OTFS modulation. [ABSTRACT FROM AUTHOR]

Featured Application: (1) The concept of trip assignment probability was used to simulate passenger behavior of selecting different HSR stations in a zone, unlike the existing all-or-nothing-based optimal strategy algorithm. (2) By optimizing the trip assignment probability using a backpropagation-based algorithm, the accuracy and time efficiency of long-term HSR demand forecasting were improved compared with the existing calibration process using a trial-and-error approach. (3) The estimation accuracy of the backpropagation-based algorithm was especially superior when applied to an area with multiple accessible HSR stations, such as the Seoul metropolitan area, as well as non-metropolitan areas with a single accessible HSR station. In Korea, decisions for high-speed railway (HSR) construction are made based on long-term demand forecasting. A calibration process that simulates current trip patterns is an important step in long-term demand forecasting. However, a trial-and-error approach based on iterative parameter adjustment is used for calibration, resulting in time inefficiency. In addition, the all-or-nothing-based optimal strategy algorithm (OSA) used in HSR trip assignment has limited accuracy because it assigns all trips from a zone with multiple accessible stations to only one station. Therefore, this study aimed to develop a backpropagation-based algorithm to optimize trip assignment probability from a zone to multiple accessible HSR stations. In this algorithm, the difference between the estimated volume calculated from the trip assignment probability and observed volumes was defined as loss, and the trip assignment probability was optimized by repeatedly updating in the direction of the reduced loss. The error rate of the backpropagation-based algorithm was compared with that of the OSA using KTDB data; the backpropagation-based algorithm had lower errors than the OSA for most major HSR stations. It was especially superior when applied to areas with multiple HSR stations, such as the Seoul metropolitan area. This algorithm will improve the accuracy and time efficiency of long-term HSR demand forecasting. [ABSTRACT FROM AUTHOR]

Achieving cyber-security has grown increasingly tricky because of the rising concern for internet connectivity and the significant growth in software-related applications. It also needs a robust defense system to defend itself from multiple cyberattacks. Therefore, there is a need to generate a method for detecting and classifying cyber-attacks. The developed model can be integrated into three phases: pre-processing, feature selection, and classification. Initially, the min-max normalization of original data was performed to eliminate the impact of maximum or minimum values on the overall characteristics. After that, synthetic minority oversampling techniques (SMOTEs) were developed to reduce the number of minority attacks. The significant features were selected using a Hybrid Genetic Fire Hawk Optimizer (HGFHO). An optimized residual dense-assisted multi-attention transformer (Op-ReDMAT) model was introduced to classify selected features accurately. The proposed model's performance was evaluated using the UNSW-NB15 and CICIDS2017 datasets. A performance analysis was carried out to demonstrate the effectiveness of the proposed model. The experimental results showed that the UNSW-NB15 dataset attained a higher precision, accuracy, F1-score, error rate, and recall of 97.2%, 98.82%, 97.8%, 2.58, and 98.5%, respectively. On the other hand, the CICIDS 2017 achieved a higher precision, accuracy, F1-score, and recall of 98.6%, 99.12%, 98.8%, and 98.2%, respectively. [ABSTRACT FROM AUTHOR]

5G New networking applications need the development of mobile data networks. The edge networks enabled by 5G technology will be able to collect, analyze, and act on more data, enabling the emergence of an intelligent internet that connects everything. To satisfy the needs of this new paradigm, access points and network nodes need to be outfitted with high-performance networking, processing power, and storage. Modern coding and encryption technology are required for 5G's success because of the importance of security and dependability in expanding communication. Chaos sequence complexity simulations using polarization nodes and chaotic classifications are used in this research to improve transmission efficiency and congeniality. Codes and chaotic sequences are intertwined in the polarization pieces preserved in time. Errors in both the set and encoded forms might occur simultaneously. Decrypting the bits without chaotic patterns is easier for eavesdroppers don't have access to the frozen pieces. Chaotic sequences may be generated using chain state information for added security. Decryption complexity is increased because of the chain effects of late feedback for eavesdroppers. Conceptual analyses and simulation findings demonstrate the proposed improved chaotic sequence complexity algorithm explores high levels of security and reliability without an error rate. The proposed algorithm increases in Key Space, Sensitivity, and data entropy by 46.21%, 50.25%, and 46.45% respectively. [ABSTRACT FROM AUTHOR]

The usage of digital devices has increased across the world due to global digitalization. The global digitalization concept arises due to the easy accessibility of the internet around the world. One of the important data that contributes a large amount to the internet is the image data. Images are used in various fields for advertising the products, expressing the individual's point of view, describing the diseases in the medical field, etc. Hence a large number of images need to be transformed into digital images to exchange them in the digital images. The process of converting a normal image into a digital image and then extracting information from it is known as image processing. The existing techniques for image processing exhibit issues like high error rates and poor image processing performance. To overcome these issues, this paper proposes an Attention Long Short-term Domain Adversarial Crossover Orchard (ALSDA-CO) algorithm. The proposed method is highly effective in image processing approach and extracted varied class labels clearly that are not visible effectively. The weight functions of each image are trained effectively and optimize the hyperparameters with best solution. To evaluate the performance of this algorithm, the Fruits 100 dataset is used. The proposed algorithm showed better performance than the existing methods such as pre-trained CNN, LS-SVM, MobileNetV2-LSTM, and DCNN in terms of all the performance measures used. The proposed algorithm attained 98.5% accuracy, 98.9% recall, 98.7% precision, and 98.5% F1 score in image processing. Compared to existing approaches the attained range of accuracy outperformed 1.1% of proposed method than existing approaches. The proposed algorithm also exhibited a reduced error rate and enhanced image processing. [ABSTRACT FROM AUTHOR]

Background: To describe the algorithm and investigate the efficacy of a novel systematic review automation tool "the Deduplicator" to remove duplicate records from a multi-database systematic review search. Methods: We constructed and tested the efficacy of the Deduplicator tool by using 10 previous Cochrane systematic review search results to compare the Deduplicator's 'balanced' algorithm to a semi-manual EndNote method. Two researchers each performed deduplication on the 10 libraries of search results. For five of those libraries, one researcher used the Deduplicator, while the other performed semi-manual deduplication with EndNote. They then switched methods for the remaining five libraries. In addition to this analysis, comparison between the three different Deduplicator algorithms ('balanced', 'focused' and 'relaxed') was performed on two datasets of previously deduplicated search results. Results: Before deduplication, the mean library size for the 10 systematic reviews was 1962 records. When using the Deduplicator, the mean time to deduplicate was 5 min per 1000 records compared to 15 min with EndNote. The mean error rate with Deduplicator was 1.8 errors per 1000 records in comparison to 3.1 with EndNote. Evaluation of the different Deduplicator algorithms found that the 'balanced' algorithm had the highest mean F1 score of 0.9647. The 'focused' algorithm had the highest mean accuracy of 0.9798 and the highest recall of 0.9757. The 'relaxed' algorithm had the highest mean precision of 0.9896. Conclusions: This demonstrates that using the Deduplicator for duplicate record detection reduces the time taken to deduplicate, while maintaining or improving accuracy compared to using a semi-manual EndNote method. However, further research should be performed comparing more deduplication methods to establish relative performance of the Deduplicator against other deduplication methods. [ABSTRACT FROM AUTHOR]

Image encryption is an indispensable technique in the realm of information security, serving as a pivotal mechanism to safeguard visual data against unauthorized access and potential breaches. This study scrutinizes the effectiveness of merging columnar transposition with the Hill Cipher methodologies, unveiling specific metrics from a curated set of sample images. Notably, employing column transposition with the key "JAYA" and the Hill Cipher with the key "UDINUSSMG," the encrypted images underwent rigorous evaluation. 'Lena.png' demonstrated an MSE of 513.32 with a PSNR of 7.89 dB, while 'Peppers.png' and 'Baboon.png' recorded MSE values of 466.67 and 423.92, respectively, with corresponding PSNR figures of 7.12 dB and 7.31 dB. Across all samples, a consistent BER of 50.00% indicated uniform error propagation, while entropy values settled uniformly at 7.9999, highlighting consistent data complexity. While the findings underscore a consistent error rate and complexity, there's a compelling need for further refinement to enhance image quality and security. Moreover, the study proposes future research avenues exploring a three-layer super encryption paradigm, amalgamating columnar transposition, Hill Cipher, and other robust algorithms. This approach aims to fortify encryption methodologies against evolving threats and challenges in data protection, offering heightened resilience and efficacy in safeguarding sensitive information. [ABSTRACT FROM AUTHOR]

We placed 85,000 retail trades in six retail brokerage accounts from December 2021 to June 2022 to validate the Boehmer et al. algorithm, which uses subpenny trade prices to identify and sign retail trades. The algorithm identifies 35% of our trades as retail, incorrectly signs 28% of identified trades, and yields uninformative order imbalance measures for 30% of stocks. We modify the algorithm by signing trades using the quoted spread midpoints. The quote midpoint method does not affect identification rates but reduces the signing error rates to 5% and provides informative order imbalance measures for all stocks. [ABSTRACT FROM AUTHOR]

Aiming at the problem of matching ambiguity and low disparity accuracy at the object boundary in stereo matching, a novel stereo matching algorithm with cost volume collaborative filtering is proposed. Firstly, for each pixel, two support windows are built, namely a local cross- support window as well as a global support window for the whole image. Secondly, a new adaptive weighted guide filter with a cross-support window as a kernel window is derived, and it is used to locally filter the cost volume. In addition, a minimum spanning tree is constructed in the whole image window, and then the minimum spanning tree filter is used to globally filter the cost volume. The collaborative filtering of cost volume is realized by fusing the filtering results of the local filter and global filter, so that each pixel can not only receive the support of the neighboring pixels in the local adaptive window, but can also receive the effective support of other pixels in the whole image, thus effectively eliminating the matching ambiguity in different texture regions while maintaining the disparity edges. The experimental results show that the average matching error rate of our method on the Middlebury stereo images is 3.17%. Compared with the other state-of-the-art methods, our method has higher robustness and matching accuracy, the generated disparity maps are smoother, and the disparity edges are better preserved. [ABSTRACT FROM AUTHOR]

The Face Anti-Spoofing (FAS) methods plays a very important role in ensuring the security of face recognition systems. The existing FAS methods perform well in short-distance scenarios, e.g., phone unlocking, face payment, etc. However, it is still challenging to improve the generalization of FAS in long-distance scenarios (e.g., surveillance) due to the varying image quality. In order to address the lack of low-quality images in real scenarios, we build a Low-Quality Face Anti-Spoofing Dataset (LQFA-D) by using Hikvision's surveillance cameras. In order to deploy the model on an edge device with limited computation, we propose a lightweight FAS network based on MobileFaceNet, in which the Coordinate Attention (CA) attention model is introduced to capture the important spatial information. Then, we propose a multi-scale FAS framework for low-quality images to explore multi-scale features, which includes three multi-scale models. The experimental results of the LQFA-D show that the Average Classification Error Rate (ACER) and detection time of the proposed method are 1.39% and 45 ms per image for the low-quality images, respectively. It demonstrates the effectiveness of the proposed method in this paper. [ABSTRACT FROM AUTHOR]

Smartphone-based biometric authentication has been widely used in various applications. Among several biometric characteristics, fingerphoto biometrics captured from smartphones are gaining popularity owing to their usability, scalability across different smartphones, and reliable verification. However, fingerphoto verification systems are vulnerable to both direct and indirect attacks. In this work, we propose a novel method to generate morphing attacks on fingerphoto biometrics captured using smartphones. We introduce three different image-level fingerphoto morphing attack generation algorithms that can generate high-quality fingerphoto morphing images with minimum distortions. Extensive experiments were conducted on two datasets captured using different smartphones under various environmental conditions. The results demonstrate that the proposed morphing algorithms are highly vulnerable to commercial off-the-shelf and block-directional fingerprint verification systems. To effectively detect morphing attacks on fingerphoto biometrics, we propose the use of fingerphoto morphing attack detection algorithms that utilize both handcrafted and deep features. However, our detection results showed a high error rate in accurately detecting these types of attacks. [ABSTRACT FROM AUTHOR]

Fractional delay-Doppler (DD) channel estimation in orthogonal time–frequency space (OTFS) systems poses a significant challenge considering the severe effects of inter-path interference (IPI). To this end, several algorithms have been extensively explored in the literature for accurate low-complexity channel estimation in both integer and fractional DD scenarios. In this work, we develop a variant of the state-of-the-art delay-Doppler inter-path interference cancellation (DDIPIC) algorithm that progressively cancels the IPI as estimates are obtained. The key advantage of the proposed approach is that it requires only a final refinement procedure reducing the complexity of the algorithm. Specifically, the time difference in latency between the proposed approach and the DDIPIC algorithm is almost proportional to the square of the number of estimated paths. Numerical results show that the proposed algorithm outperforms the other channel estimation schemes achieving lower normalized mean square error (NMSE) and bit error rate (BER). [ABSTRACT FROM AUTHOR]

The format of multi -view plus depth (MVD) is introduced in 3D-HEVC for improving coding efficiency. However, as the number of viewpoints increases, the computational complexity increases dramatically. To overcome this issue, a method based on RD-cost Bayesian Decision (RDBD) for 3D -HEVC fast depth map inter coding is proposed in this paper, including coding unit (CU) early termination and SKIP/DIS decision. First, an offline training model with the minimum risk Bayesian decision rule is used to predict optimal CU size in depth map. Then, a minimum error rate Bayesian decision rule is proposed to determine whether SKIP or DIS is the best mode and ignores the rate distortion optimization (RDO) process of other modes. Experimental results show that, with the proposed algorithm, 45. 7% depth map encoding time saving is achieved compared to the original 3D-HEVC, and outperforms state-of-the-art fast inter coding methods for 3D-HEVC. [ABSTRACT FROM AUTHOR]

Long reads generated by third-generation sequencing (3GS) technologies are involved in many biological analyses and play a vital role due to their ultra-long read length. However, the high error rate affects the downstream process. DeepCorr, a novel error correction algorithm for data from both PacBio and ONT platforms based on deep learning is proposed. The core algorithm adopts a recurrent neural network to capture the long-term dependencies in the long reads to convert the problem of long-read error correction to a multi-classification task. It first aligns the high-precision short reads to long reads to generate the corresponding feature vectors and labels, then feeds these vectors to the neural network, and finally trains the model for prediction and error correction. DeepCorr produces untrimmed corrected long reads and improves the alignment identity while maintaining the length advantage. It can capture and make full use of the dependencies to polish those bases that are not aligned by any short read. DeepCorr achieves better performance than that of the state-of-the-art error correction methods on real-world PacBio and ONT benchmark data sets and consumes fewer computing resources. It is a comprehensive deep learning-based tool that enables one to correct long reads accurately. [ABSTRACT FROM AUTHOR]

To enhance the performance and reliability of the face recognition algorithm that is based on deep learning technology, this study utilizes a density-based noise-applied spatial clustering algorithm to cluster a large-scale face image dataset, resulting in a self-constructed dataset. A deep separable center differential convolutional network algorithm is utilized for face recognition. The impact of convolutional parameters on the algorithm's performance is verified through experiments with ablated convolutional parameters. The study found that the density-based noise-applied spatial clustering algorithm resulted in time savings of 43.66% and 51.22% compared to the K-means clustering algorithm and the hierarchical clustering algorithm, respectively, when analyzing 8000 images. Additionally, the depth-separable center difference convolutional network algorithm had a lower average classification error rate compared to the other two algorithms, with reductions of 2.49% and 17.01%, respectively. The depth-separable center difference convolutional network technique is an advanced method for identifying the faces of people of different races, according to the experimental investigation. It can provide efficient and accurate services for the face recognition needs of various races. [ABSTRACT FROM AUTHOR]

The unstoppable trend of globalization has made the integration of voice recognition with science and technology increasingly close, and has called for the emergence of more powerful oral voice recognition systems. At present, most speech recognition research uses Hidden Markov Model-Gaussian Mixture Modell (HMM-GMM) and onnectionist Temporal Classification (CTC) end-to-end method, which has obvious limitations. Therefore, based on neural network, this paper introduces deep neural network posterior probability algorithm into speech recognition system, and constructs the spoken speech recognition system based on deep neural network posterior probability algorithm. The design principle of the constructed speech system is discussed and the performance analysis and effectiveness evaluation are carried out. The experimental results show that the performance of the neural network-based speech recognition system constructed in this paper has made a breakthrough compared with the traditional technology, and the Character Error Rate (CER) is only 4.6%, and the End-to-End Latency and Equal Error Rate (EER) have reached a low level. This study points out the future development direction of speech recognition and provides the impetus to promote its further development [ABSTRACT FROM AUTHOR]

Given the prevalent issues surrounding accuracy and efficiency in contemporary stereo matching algorithms, this research introduces an innovative image segmentation based approach. The proposed methodology integrates residual and Swim Transformer modules into the established 3D Unet framework, yielding the Res-Swim-UNet image segmentation model. The algorithm estimates the disparateness of segmented outputs by employing regression techniques, culminating in a comprehensive disparity map. Experimental findings underscore the superiority of the proposed algorithm across all evaluated metrics. Specifically, the proposed network demonstrates marked improvements, with IoU and mPA enhancements of 2.9% and 162%, respectively. Notably, the average matching error rate of the algorithm registers at 2.02%, underscoring its efficacy in achieving precise stereoscopic matching. Moreover, the model’s enhanced generalization capability and robustness underscore its potential for widespread applicability. [ABSTRACT FROM AUTHOR]

Targeting the issues of slow speed and inadequate precision of optimal solution calculation for multi-user detection in complex noise environments, this paper proposes a multi-user detection algorithm based on a Hybrid Cheetah Optimizer (HCO). The algorithm first optimizes the control parameters and individual update mechanism of the Cheetah Optimizer (CO) algorithm using a nonlinear strategy to improve the uniformity and discretization of the individual search range, and then dynamically introduces a differential evolutionary algorithm into the improved selection mechanism of the CO algorithm, which is utilized to fine-tune the solution space and maintain the local diversity during the fast search process. Simulation results demonstrate that this detection algorithm not only realizes fast convergence with a very low bit error rate (BER) at eight iterations but also has obvious advantages in terms of noise immunity, resistance to far and near effects, communication capacity, etc., which greatly improves the speed and accuracy of optimal position solving for multi-user detection and can achieve the purpose of accurate solving in complex environments. [ABSTRACT FROM AUTHOR]

In iris biometric recognition systems, protecting the storage and transmission of iris templates is crucial, and template protection techniques are pivotal for ensuring their security. A prevalent approach involves using indexing methods as an effective algorithm for iris template protection, leveraging the index or rank of the extracted iris code to generate a secure iris template. Meantime, many privacy threats to biometric data have emerged, necessitating heightened protection measures. Specifically, protecting the privacy of iris data is imperative within the context of iris template protection during recognition processes. As stipulated by the international standard ISO/IEC 30136, effective iris template protection must concurrently meet the criteria of irreversibility, revocability, and unlinkability. Nevertheless, existing indexing methods on iris template protection faced the formidable challenge of simultaneously fulfilling these three privacy requirements while maintaining the efficacy of iris recognition. This paper introduces a standard ranking (standardR) algorithm, named standardR, designed to enhance the security of iris templates by transforming each iris template into an irreversible representation. The experimental results on the benchmarked Casia-Iris-interval dataset, along with two additional iris datasets MMU1 and UBRIS 1, demonstrate the efficacy of the proposed algorithm. The proposed standardR algorithm achieves an equal error rate (EER) of 0.1695% and an area under the curve of 0.93011% with the Casia-Iris-Interval dataset. Furthermore, the algorithm maintains efficient recognition with a reduced iris code length of 1280 bits, a time complexity of O(n log n), and satisfies the biometric template protection (BTP) requirements in irreversibility, unlinkability, and renewability. [ABSTRACT FROM AUTHOR]

Aiming at the existing UAV fire detection system with low small target detection accuracy, a high leakage rate, and a slow rate, an improved YOLOv5 UAV flame detection algorithm is proposed. First, the anchor box clustering is optimized using the K-mean++algorithm to reduce the classification error rate. Second, the original backbone network is enhanced with the CBAM attention mechanism, which scans the whole globe to obtain the target area with a high weighting proportion and needs to be focused on. Replace the PANet network with the BiFPN network in the neck and introduce jump connections when performing feature fusion, which can better retain the semantic information of high-level and low-level features. Finally, the α-IoU loss function is added to achieve the regression accuracy of different levels of the bounding box by modulating α, which improves the detection accuracy of small datasets and the robustness to noise. According to the experimental results, using a randomly segmented dataset, the modified YOLOv5 algorithm obtains a mAP value of 80.2%, which is 6.7% higher than the original YOLOv5 method, while maintaining an FPS of 64 frames per second. The method helps to improve the accuracy of UAVs for fire monitoring, and the performance is better than the existing flame detection algorithms, which meet the requirements of practical applications. [ABSTRACT FROM AUTHOR]

Communication services that are dependable are crucial, particularly during emergencies when the regular infrastructure for communication may be disrupted or nonexistent. In such situations, device-to-device (D2D) communication can be a helpful choice since it allows user equipment (UE) that is close to one another to connect directly, bypassing the cellular network infrastructure. The primary focus of this thesis is the application of D2D communication in a decentralized emergency scenario with a damaged eNodeB. The main objective is to find an appropriate strategy for finding and selecting D2D couples by simulating several methods in MATLAB. This study compares three D2D pair selection algorithms: distance-based, Signal-to-Interference and Noise Ratio (SINR)-based, and data rate-based distance-based. The simulation results show that the data rate-based strategy is the most effective method for selecting D2D couples in emergency scenarios. In contrast to algorithms that rely on distance and SINR, this one reduces the chance of an outage by 20%. Bit error rate (BER), capacity, spectral efficiency, and energy efficiency are the three types of links that are assessed: direct links, relay links, and UE relay links. The results show that, with the lowest BER and maximum data throughput, the direct link is the most reliable and efficient communication option. However, the relay connection and the UE relay link show better overall spectral efficiency in comparison to the direct link, indicating their ability to transport more data per unit of bandwidth. The option that consumes the least energy among the three is the direct link. The study demonstrates the great potential of D2D communication in emergency scenarios where conventional communication infrastructure may not be available. The direct link is the most dependable and effective alternative for communication, according to the data, although the UE link can still function effectively in the event that the direct link is compromised. The data rate-based method is a useful strategy for finding and choosing D2D partners. The results of this study can direct the development of D2D emergency communication solutions in 5G networks. [ABSTRACT FROM AUTHOR]

This study presents a new solution to address challenges encountered in additive manufacturing, specifically in the context of 3D printing, where failures can occur due to complications associated with the nozzle or filament. The proposed solution in this research involves using a time-domain feature extraction method that leverages sound and vibration patterns. By implementing sensors to capture these signals in a controlled and noise-free environment, and then utilizing a Multi-Layer Perceptron (MLP) model trained accurately to predict upcoming signals and vibrations, proactive anticipation of printing outcomes is facilitated, including potential failures. Simulation results obtained using MATLAB for the MLP showcase the effectiveness of this approach, demonstrating remarkably low error rates. Furthermore, through rigorous data validation, the proposed method's ability to accurately identify sound and vibration signals is confirmed. As a result, the likelihood of failures is significantly reduced, thereby preventing defects in the filament. The implications of this solution hold great promise in substantially enhancing the reliability and efficiency of additive manufacturing processes. [ABSTRACT FROM AUTHOR]

The global positioning system (GPS) trajectory data are extensively utilized in various fields, such as driving behavior analysis, vehicle navigation systems, and traffic management. GPS sensors installed in numerous driving recorders and smartphones facilitate data collection on a large-scale in a high-frequency manner. Therefore, map-matching algorithms are indispensable to identify the GPS trajectories on a road network. Although the local map-matching algorithm reduces computation time, it lacks sufficient accuracy. Conversely, the global map-matching algorithm enhances matching accuracy; however, the computations are time consuming in the case of large-scale data. Therefore, this study proposes a method to improve the accuracy of the local map-matching algorithm without affecting its efficiency. The proposed method first executes the incremental map-matching algorithm. It then identifies the mismatching links in the results based on the connectivity of the links. Finally, the shortest path algorithm and the longest common subsequence are used to correct these error links. An elderly driver's driving recorder data were used to conduct the experiment to compare the proposed method with four state-of-the-art map-matching algorithms in terms of accuracy and efficiency. The experimental results indicate that the proposed method can significantly increase the accuracy and efficiency of the map-matching process when considering high-frequency and large-scale data. Particularly, compared with the two-benchmark global map-matching algorithms, the proposed method can reduce the error rate of map-matching by nearly half, only consuming 18% and 58% of the computation time of the two global algorithms, respectively. [ABSTRACT FROM AUTHOR]

Energy consumption planning of an area is very important. It is essential to accurately predict the amount of short-term power required by an area using a highly effective prediction technique. The realvalue-genetics-algorithm (RVGA) is the most effective technique that is currently used. However, the RVGA has some drawbacks, including the fact that it gets caught in premature convergence even when the search is performed over long iterations. This study proposes a hybrid prediction algorithm which comprises the RVGA and the extended-Nelder-Mead (ENM) algorithm. The ENM was implemented to speed up the search for the best among all solutions produced by the RVGA. The RVGA was configured to run under small iterations, and the ENM was used to achieve convergence. Experiments were performed on historical datasets containing the monthly electricity demand of the Gorontalo area, a region in Indonesia. The performance of the hybrid algorithm was compared to the hybrid Genetic Algorithm-Particle Swarm Optimisation (GA-PSO) and Real Coded-Genetic Algorithm (RC-GA) energy demand models based on the mean-absolute-percentage-error (MAPE), mean-square-error (MSE), root-mean-square-error (RMSE), and mean-absolute-deviation (MAD) error rates. The results showed that the proposed hybrid algorithm's MAPE, MSE, RMSE, and MAD errors were 2.95 percent, 0.13 percent, 0.36 percent and 1.29 percent, respectively. Based on the accuracy measure obtained from this study, it implies that the RVGAENM hybrid is the best model for forecasting monthly electricity demand. [ABSTRACT FROM AUTHOR]

Road pavements are subject to various forms of degradation compromising their functionality with negative effects on safety. For assuring the highest quality, all the distresses have to be properly identified and quantified by road administrators. For increasing efficiency and reducing costs and times of surveys, several innovative methods to detect, classify and measure surface distresses were proposed, with variable results. In this context, the authors propose an algorithm for automated pothole detection through the processing of 3D data of pavement surfaces, acquired using an innovative high-performance equipment. The algorithm, derived from computer vision, is able of identifying potholes in road sections, assuring a reliable estimation of shape and severity, in terms not only of area, perimeter, but also depth, with practical benefits. The numerical results show the remarkable performance of the proposed algorithm, even compared to alternative traditional methodologies. In terms of Precision, Recall and F-Score, it assures mean values equal respectively to 89.75%, 92.95% 91.28%. Validation was also performed in terms of area error rate, with an average value of 5.15%, significantly lower than other approaches. Then, the algorithm represents a reliable alternative to traditional approaches and allows road administrators to derive data to optimize maintenance and road functionality. [ABSTRACT FROM AUTHOR]

D-band (110–170 GHz) has been regarded as a potential candidate for the future 6G wireless network because of its large available bandwidth. At present, the lack of electrical amplifiers operating in the high frequency band and the strong nonlinear effect, i.e., the D-band, are still important problems. Therefore, effective methods to mitigate the nonlinear issue resulting from the ROF link are indispensable, among of which machine learning is considered the most effective paradigm to model the nonlinear behavior due to its nonlinear active function and structure. In order to reduce the computation amount and burden, a novel deep learning neural network equalizer connected with typical mathematical frequency offset estimation (FOE) and carrier phase recovery (CPR) algorithms is proposed. We implement D-band 45 Gbaud PAM-4 and 20 Gbaud PAM-8 ROF transmission simulations, and the simulation results show that the real value neural network (RVNN) equalizer connected with the Viterbi-Viterbi algorithm exhibits better compensation ability for nonlinear impairment, especially when dealing with serious inter-symbol interference and nonlinear effects. In our experiment, we employ coherent detection to further improve the receiver sensitivity, so a complex baseband signal after down conversion at the receiver is inherently produced. In this scenario, the complex value neural network (CVNN) and RVNN equalizer connected with the Viterbi-Viterbi algorithm have better BER performance with an error rate lower than the HD-FEC threshold of 3.8 × 10−3. [ABSTRACT FROM AUTHOR]