Search

Flat bands in 2D twisted materials are key to the realization of correlation-related exotic phenomena. However, a flat band often was achieved in the large system with a very small twist angle, which enormously increases the computational and experimental complexity. In this work, we proposed group-V twisted bilayer materials, including P, As, and Sb in the β phase with large twist angles. The band structure of twisted bilayer materials up to 2524 atoms has been investigated by a deep learning method DeepH, which significantly reduces the computational time. Our results show that the bandgap and the flat bandwidth of twisted bilayer β-P, β-As, and β-Sb reduce gradually with the decreasing of twist angle, and the ultra-flat band with bandwidth approaching 0 eV is achieved. Interestingly, we found that a twist angle of 9.43° is sufficient to achieve the band flatness for β-As comparable to that of twist bilayer graphene at the magic angle of 1.08°. Moreover, we also find that the bandgap reduces with decreasing interlayer distance while the flat band is still preserved, which suggests interlayer distance as an effective routine to tune the bandgap of flat band systems. Our research provides a feasible platform for exploring physical phenomena related to flat bands in twisted layered 2D materials. [ABSTRACT FROM AUTHOR]

The dual-scrambling scheme that combines position transformation and bit-plane transformation is a popular image encryption scheme. However, such schemes need more key information, and the encryption and decryption processes are complicated. In addition, the existing quantum image dual-scrambling schemes mainly deal with square images. In this paper, we propose a hybrid scrambling encryption scheme for multi-mode quantum image representation (MQIR) images based on random permutation, in which the H × W quantum image is represented in MQIR. A random number generator factor s uniquely associates one of the random permutations of integers from 1 to a positive integer, so as to hybrid scramble both the pixel position and the binarized position of each pixel value. Meanwhile, the quantum circuits and some examples of scrambling are given. Furthermore, various analyses of the performance of this scheme were conducted, including effectiveness, key space, and computational complexity. By modifying the random generation factor to construct multiple binary grayscale images, the simulated results on the IBM Quantum Cloud platform demonstrate that the proposed quantum image encryption scheme is effective. In comparison to existing quantum image dual scrambling schemes, it is both simple and effective, offering a large key space, lower computational complexity, and applicability to non-square quantum images. [ABSTRACT FROM AUTHOR]

In this paper, a new mixed integer programming (MIP) formulation is developed for balancing and scheduling of mixed model assembly lines with disjunctive precedence constraints among assembly tasks. To represent alternative precedence relations, AND/OR assembly graph was adopted. In case of alternative precedence relations, for each product multiple assembly plans exist, which can be represented by a set of alternative precedence subgraphs and only one of such subgraphs should be selected for each product. As the number of subgraphs exponentially increases with the number of disjunctive relations among the tasks, the computational complexity of simultaneous balancing and scheduling along with the assembly subgraph selection increases with the number of alternative precedence relations. Unlike the other MIP approaches known from the literature, the new model does not need the alternative assembly subgraphs to be to explicitly enumerated as input data and then used for indexing the variables. Instead, a new disjunctive precedence selection and task assignment variable and new constraints are introduced to optimally choose one relation for each subset of alternative precedence relations. The optimal solutions for computational examples of balancing and scheduling problems illustrate a superior performance of the new modelling approach. [ABSTRACT FROM AUTHOR]

The purpose of long-term forecasting is to meet the needs of practical applications, such as the prediction of the development trend of infectious diseases and the planning of electricity consumption. In this paper, we study the long-term forecasting of time series. Studies have shown that previous Transformer-based models have the potential to improve prediction capabilities, but there are also some problems, such as the lack of location information and the slow training speed. To solve these problems, we designed an efficient Transformer-based model called AD-Autoformer, which is specifically designed for long-term series prediction. By introducing position embedding, the model can better understand the patterns and relationships in the sequence, to improve the performance and generalization ability of the model when processing sequence data, and the self-attention distilling mechanism realizes the compression and acceleration of the model by halving the cascading layer input to highlight the dominant attention. This method significantly reduces the computational complexity of the model and improves the training speed of the model while maintaining the performance of the model. Experimental results on five large datasets show that the proposed AD-Autoformer model has different degrees of improvement in MSE and MAE indicators compared with other benchmark methods. [ABSTRACT FROM AUTHOR]

The implementation of turn restrictions represents a critical research challenge in chiplet-based systems, with the objective of achieving deadlock-free communication. Nevertheless, existing methodologies encounter difficulties in terms of computational complexity, which impedes the design process. Moreover, as the scale of the problem increases, the cost of addressing it becomes increasingly untenable. In this paper, we introduce the efficient turn restrictions setting (ETRS) method to reduce the computational cost of implementing turn restrictions for boundary routers in chiplet-based systems. In stage 1, we present a symmetry-based preprocessing algorithm (SBPA). SBPA exploits the symmetry inherent in chiplet topologies by generating multiple sets of identical modes, ensuring that scenarios with the same objective function value are calculated only once per iteration. In stage 2, a heuristic selection algorithm (HSA) for turn restrictions based on NSGA-II is proposed as a means of searching for approximately optimal solutions and of solving the problem quickly. In stage 3, different filtering criteria are introduced to evaluate the Pareto fronts of HSA for making decisions on the placement of boundary routers and their turn restrictions. Evaluation results reveal that the proposed ETRS method surpasses existing solutions in terms of computation efficiency. Moreover, it delivers satisfactory optimal objective values. [ABSTRACT FROM AUTHOR]

In this paper, we study Horn formulas from the perspective of read-once resolution refutations (RORs). A Horn formula is a Boolean formula in conjunctive normal form (CNF), in which each clause contains at most one positive literal. Horn formulas are used in a number of domains, including program verification, logic programming, and econometrics. In particular, deduction in ProLog is based on unification. Unification is based on resolution and instantiation. Resolution is a system used to prove the infeasibility of Boolean formulas. It is important to note that resolution is both sound and complete. However, resolution is inefficient in the following sense: There exist CNF formulas with resolution refutations whose lengths are bounded below by an exponential function of the input size. At the same time, these formulas admit shorter (polynomially bounded) proofs of infeasibility in other proof systems, such as Frege Systems. Despite this inefficiency, resolution is simple and easy to implement and hence used in a wide variety of theorem provers. In this paper, we study two variants of resolution. These are read-once resolution (ROR) and read-once unit resolution (UROR). Both ROR and UROR are sound. However, they are incomplete since there exist infeasible Boolean formulas which do not have either an ROR or a UROR. In this paper, we look at the problems of determining if a Horn formula has an ROR or a UROR. We also examine the problem of finding the optimal length ROR of a Horn formula from both the computational complexity and the approximation perspectives. Finally, we analyze the copy complexity of Horn formulas with respect to URORs. [ABSTRACT FROM AUTHOR]

In the path version of the Travelling Salesman Problem (Path-TSP), a salesman is looking for the shortest Hamiltonian path through a set of n cities. The salesman has to start his journey at a given city s , visit every city exactly once, and finally end his trip at another given city t. In this paper we show that a special case of the Path-TSP with a Demidenko distance matrix is solvable in polynomial time. Demidenko distance matrices fulfill a particular condition abstracted from the convex Euclidian special case by Demidenko (1979) as an extension of an earlier work of Kalmanson (1975). We identify a number of crucial combinatorial properties of the optimal solution and design a dynamic programming approach with time complexity O (n 6). [ABSTRACT FROM AUTHOR]

In the emergency rescue and disposal of social public emergencies, supply transportation effectively provides a strong supply foundation and realistic conditions. The trajectory tracking control of emergency supplies transportation robot is the key technology to ensure the timeliness of transportation. In this article, the emergency supplies transportation robot is taken as the research object, based on Koopman operator theory, combined with radial basis function (RBF) neural network disturbance observer and adaptive prediction horizon event‐triggered model predictive control (APET‐MPC) algorithm to investigate the purely data‐driven trajectory tracking control problem of emergency supplies transportation robot when the model parameters and models are unknown. Firstly, the Koopman operator is used to establish a high‐dimensional linear model of the robot. Secondly, the RBF neural network disturbance observer is designed to estimate the disturbance during the robot operation and compensate it to the controller. Thirdly, APET‐MPC is used to optimize the trajectory tracking control of the emergency supplies transportation robot to reduce computational complexity. Finally, the performance of the proposed trajectory tracking controller is verified by Carsim/ Simulink joint simulation. The simulation results show that the model established by Koopman operator theory can achieve the high accuracy approximation of the robot. Compared with the MPC trajectory tracking controller, the APET‐MPC trajectory tracking controller based on RBF neural network disturbance observer (RBF‐APET‐MPC) improves the tracking accuracy of the robot and reduces the total triggering times of the system by more than 50%. [ABSTRACT FROM AUTHOR]

Summary: Localization algorithms are essential for tracking, fault tolerance, and adding location context to Internet of Things (IoT) networks. Among the various range‐free techniques, DV‐Hop stands out for its lower computational complexity. Despite efforts to minimize manufacturing costs for sensors, they often find themselves deployed in remote and hard‐to‐access locations, making battery replacement a challenging prospect. These sensors can be utilized in a hostile environment, such as a field of battle, fires, floods, and earthquakes. In these types of scenarios, the sensors can become dead and stop communicating with each other. Hence, there is a critical need to improve algorithms that can tolerate and detect faults in network nodes. The faults of the sensor can lower the quality of the algorithm if they are not replaced. In such situations, we need to distribute supplementary target nodes to replace faulty nodes. This paper presented an improved DV‐Hop based method for localization of additional target nodes using grey wolf optimization (GWO). The proposed method will only localize the position of target nodes and minimizes the localization time, which makes the system more energy efficient. Simulation results conclude that the proposed GWO‐based DV‐Hop localization performed well as compared with traditional DV‐hop, genetic DV‐Hop, and Adaptive genetic DV‐hop. [ABSTRACT FROM AUTHOR]

Summary: Power system monitoring relies on the reliability of state estimation (SE) results. SE plays a dominant role in data debugging if sufficient data is available. Criticality analysis (CA) integrates SE as a module in which measurements—taken one‐by‐one or in groups (tuples) of minimal cardinality—are designated crucial. The combinatorial nature of extensive CA (not restricted to identifying low‐cardinality critical tuples) characterizes its computational complexity and imposes challenging limits to go beyond. In simple terms, these limits are established by the number of measurements to be combined, the cardinality of tuples, and the computing time required to check the criticality condition. This paper proposes an innovative computational solution to expand CA limits found to date in the literature. A framework with multi‐threads designed cleverly on a graphics processing unit (GPU) parallel processing environment is built. The conceived architecture favors evaluating massive measurement combinations of diverse cardinality in extensive CA. Numerical results reveal significant speed‐ups with the proposed approach, contrasting with those reported in research efforts published so far. [ABSTRACT FROM AUTHOR]

The Bayesian optimization algorithm uses Bayesian networks as the probability model of its solution space. Although the research on this algorithm has steadily developed, there are still some problems in its application process, such as excessive computational complexity. To solve various problems in Bayesian algorithm, reduce its computational complexity, and enable it to better achieve image segmentation. The study chooses to improve the Bayesian algorithm on the basis of immune algorithm, and solves the problem of computational complexity by reducing the number of Bayesian network construction times, thereby improving the individual fitness of the population. Through simulation experiments, it has been shown that the average number of times the improved Bayesian algorithm reaches the optimal value is 30, which is higher than the traditional algorithm's 20 times. Its excellent optimization ability searches for the optimal threshold to complete image segmentation. The improved Bayesian optimization algorithm based on immune algorithm can effectively reduce computational complexity, shorten computational time, and improve convergence. And applying Bayesian algorithm to image segmentation has broadened the application field of the algorithm and found new exploration directions for image segmentation. [ABSTRACT FROM AUTHOR]

Model order reduction technique provides an effective way to reduce computational complexity in large-scale circuit simulations. This paper proposes a new model order reduction method for delay circuit systems based on Hermite expansion technique. The presented method consists of three steps i.e., first the delay elements are approximated using the recursive relation of Hermite polynomials, then in the second step, the reduced order is estimated for the delay circuit system using a delay truncation in the Hermite domain and in the third step, a multi-order Arnoldi process is computed for obtaining the projection matrix. In the following, the reduced order delay circuit model is obtained by the projection matrix. Moment matching and passivity properties of the reduced circuit system are also analyzed. Two circuit examples with delay components are performed to verify the effectiveness of the proposed MOR approach. [ABSTRACT FROM AUTHOR]

Speech enhancement performance has improved significantly with the introduction of deep learning models, especially methods based on the Long–Short-Term Memory architecture. However, these methods face challenges such as high computational complexity and redundancy of input features. To address these issues, we propose a U-Net-based approach that utilizes an encoder/decoder to extract more concise features, thereby enhancing single-channel speech performance and reducing computation complexity. The proposed method includes a Cross-Swin-Transformer block and a masked bottleneck module, which down-samples features while preserving the detailed representation through skip connections and carefully designed blocks. The bottleneck module extracts coarse representations of hidden features as masks. We evaluated our method against other U-Net-based approaches on VCTK and DNS corpora using CBAK, eSTOI, PESQ, STOI, and SI-SDR metrics. The results demonstrate that the proposed method achieves promising performance while significantly reducing computational complexity. [ABSTRACT FROM AUTHOR]

Electronic equipment used on a daily basis now frequently includes active noise cancellation. The adaptive filters, which are positioned within, are essential for noise cancellation. An essential component to take into account for the overall performance is the structural and computational complexity of the filter. The filter's structure has an impact on this. The amount of taps determines the structure. Active noise cancellation filters often have set tap lengths and are lengthy, which causes sluggish convergence and delay. As a result, a trade-off between the filter's length and convergence is required. This is conceivable if there is a flexible filter with a tap length that adapts to the environment while still ensuring acceptable convergence. This study proposes a novel Minimum Mean M-estimate method with changeable tap length and uses a sub-band adaptive filtering technique to shorten the filter's length. In order to maximize the filter's efficiency, the advantages of three approaches are specifically merged in this work. They are the proposed algorithm, the proposed method's variable tap length variant, and the sub-band adaptive filtering. The simulation's findings and recommendations are supported. [ABSTRACT FROM AUTHOR]

In this paper, a sparse smooth twin support vector regression (Sparse‐STSVR) model for power amplifier (PA) behavioral modeling is obtained by pruning the kernel matrix based on Cholesky decomposition. Based on the primal smooth twin support vector regression (STSVR) model, the Nystrom approximate matrix of the kernel matrix is found to replace the original kernel matrix, thus simplifying the Newton iterative parameter extraction process of the primal STSVR model and accelerating the convergence of the algorithm. In addition, the new rank approximation kernel matrix has the characteristic of sparse parameters, which further reduces the computational complexity of the feedforward link of the digital predistorter. The 100 MHz 5G New Radio (NR) signal is used for verify the effect of PA modeling and digital predistortion (DPD) experiment. The results show that the proposed method can improve the normalized mean square error (NMSE) by about 2 ~ 3 dB with fewer coefficients compared with the previously proposed machine learning model, and the predistortion linearization effect improves by nearly 3 dB on the adjacent channel power ratio (ACPR), which achieves a good trade‐off between model performance and computational complexity. © 2024 Institute of Electrical Engineers of Japan and Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

Lunar missions are currently experiencing a significant surge in popularity, presenting expansive opportunities for further exploration and development. To thoroughly explore the design margins and potential of lunar landers, and to foster the development of overall designs driven by comprehensive performance objectives, it is crucial to conduct optimization design considering the coupling between key disciplines such as trajectory and propulsion. Considering the significant increase in computational complexity caused by conducting trajectory/propulsion integrated design optimization, the analytical target cascading method is employed to hierarchically decompose and coordinate optimization of the complex systems. This article presents a phased soft-landing strategy on the manned lunar lander propelled by hybrid rocket motors, utilizing powered explicit guidance and Apollo powered descent guidance, and proceeds with the trajectory/propulsion integrated design optimization involving diverse grain shapes and feed systems. This optimization process is separately undertaken utilizing multidisciplinary feasible method and analytical target cascading method. The analysis reveals that integrating trajectory and propulsion considerations into the optimization process facilitates a 5 % reduction in the overall mass relative to optimizations constrained solely by velocity increment and lack comprehensive trajectory design considerations. This highlights the profound impact of trajectory requirements on propulsion system design and the advantages of powered explicit guidance laws in minimizing fuel consumption. Crucially, the use of analytical target cascading achieves the better optimization results, and significantly reduces subsystem evaluation times, enhancing operational efficiency by 48 %, demonstrating the advantage in handling complex, large-scale systems. On another level, with different β values, the Mean Relative Error of the target values for the three schemes obtained by the analytical target cascading method is 0.0016, indicating good stability and strong robustness. The practical exploration in this article provides methods and frameworks for high-performance optimization design of complex aerospace mission profiles in the future. • The trajectory/propulsion integrated design optimization is conducted. • The two-phase guidance strategy for lunar lander descent is proposed. • Based on the strategy, the analytical target cascading-decomposed framework is set. • The influence of trajectory and propulsion coupling on overall design is revealed. • The optimization effectiveness, convergence rate, and robustness of the ATC is shown. [ABSTRACT FROM AUTHOR]

Hand pose estimation is a fundamental task in computer vision with applications in virtual reality, gesture recognition, autonomous driving, and virtual surgery. Keypoint detection often relies on deep learning methods and high-resolution feature map representations to achieve accurate detection. The HRNet framework serves as the basis, but it presents challenges in terms of extensive parameter count and demanding computational complexity due to high-resolution representations. To mitigate these challenges, we propose a lightweight keypoint detection network called LGCANet (Lightweight Ghost-Coordinate Attention Network). This network primarily consists of a lightweight feature extraction head for initial feature extraction and multiple lightweight foundational network modules called GCAblocks. GCAblocks introduce linear transformations to generate redundant feature maps while concurrently considering inter-channel relationships and long-range positional information using a coordinate attention mechanism. Validation on the RHD dataset and the COCO-WholeBody-Hand dataset shows that LGCANet reduces the number of parameters by 65.9% and GFLOPs by 72.6% while preserving the accuracy and improves the detection speed. [ABSTRACT FROM AUTHOR]

This article presents a self-adjustable branch-and-bound algorithm for globally solving a class of linear multiplicative programming problems (LMP). In this algorithm, a self-adjustable branching rule is introduced and it can continuously update the upper bound for the optimal value of LMP by selecting suitable branching point under certain conditions, which differs from the standard bisection rule. The proposed algorithm further integrates the linear relaxation program and the self-adjustable branching rule. The dependability and robustness of the proposed algorithm are demonstrated by establishing the global convergence. Furthermore, the computational complexity of the proposed algorithm is estimated. Finally, numerical results validate the effectiveness of the self-adjustable branching rule and demonstrate the feasibility of the proposed algorithm. [ABSTRACT FROM AUTHOR]

This work establishes a framework for solving inverse boundary problems with the geodesic-based quadratic Wasserstein distance (W_{2}). A general form of the Fréchet gradient is systematically derived from the optimal transportation (OT) theory. In addition, a fast algorithm based on the new formulation of OT on \mathbb {S}^{1} is developed to solve the corresponding optimal transport problem. The computational complexity of the algorithm is reduced to O(N) from O(N^{3}) of the traditional method. Combining with the adjoint-state method, this framework provides a new computational approach for solving the challenging electrical impedance tomography problem. Numerical examples are presented to illustrate the effectiveness of our method. [ABSTRACT FROM AUTHOR]

Lattice metamaterials, a class of structures utilized for geometric lightweighting and enhancing structural integrity, feature interconnected elements arranged in specific patterns. These patterns confer unique properties beneficial for improving stiffness, damping, energy absorption, and strength across various applications. However, computational simulation of lattice structures for design and optimization presents significant challenges due to nonlinear and elastic/inelastic effects like instabilities, contacts, rate-dependence, and plasticity. Current methods heavily rely on finite element analysis (FEA), yet they entail high computational complexity and do not fully align with experimental observations. Moreover, additive manufacturing (AM) technologies introduce additional computational complexity due to process-induced anisotropic behaviors. This paper proposes a computational model to construct an effective descriptor by integrating metamaterial topological information with AM conditions. This descriptor serves as a surrogate for FEA models. Additionally, a database is established to correlate the descriptor with experimentally acquired mechanical responses of additively manufactured metamaterials. The bidirectional operation of the envisaged descriptor fulfills two objectives: informing the mechanical response of novel metamaterial models and guiding design and AM processes based on desired outcomes. Model validation demonstrates significant concurrence between predicted and experimental results, evidencing the model's capability to capture inherent nonlinearity in both design and process. [ABSTRACT FROM AUTHOR]

Point cloud semantic segmentation is a key step in 3D scene understanding and analysis. In recent years, deep learning-based point cloud semantic segmentation methods have received extensive attention from researchers. Multi-scale neighborhood feature learning methods are suitable for inhomogeneous density point clouds, but different scale branching feature learning increases the computational complexity and makes it difficult to accurately fuse different scale features to express local information. In this study, a point cloud semantic segmentation network based on RandLA-Net with multi-scale local feature aggregation and adaptive fusion is proposed. The designed structure can reduce computational complexity and accurately express local features. The mean intersection-over-union is improved by 1.1% on the SemanticKITTI data set with an inference speed of nine frames per second, while the mean intersection-over-union is improved by 0.9% on the S3DIS data set, compared with RandLA-Net. We also conduct ablation studies to validate the effectiveness of the proposed key structure. [ABSTRACT FROM AUTHOR]

Network intrusion detection systems -NIDS are significant in potentially analyzing cyber-security and accurately categorizing attacks in current networks. Given the present circumstances, selecting an appropriate combination of anomaly detection features holds greater significance within NIDS. Diverse optimization algorithms offer a better solution: correctly choosing a near-optimal variety of features to achieve an improved NIDS. The Bacterial Forage Optimization (BFO) algorithm is an intelligent swarm algorithm commonly used for optimization problems. This paper proposes NIDS with optimal feature selection using Bacterial Forage Optimization techniques to detect the anomaly in the IDS (BFOFSIDS). Besides, it established Machine Learning-based Network Intrusion Detection and offered better performance for detecting User Remote (U2R Remote-to-Local (R2L), Probe and Denialof-service (DoS) attacks. The proposed model aims to identify anomaly detection features for an intrusion detection system, thus achieving a promising performance. The proposed method expands the BFO-based optimal features selection techniques, enhancing the accuracy among two high-dimensional intrusion detection datasets, such as NSLKDD and UNSW-NB15. Experimental results demonstrate that the proposed model achieves an accuracy of 91.8% on the NSL-KDD dataset and 91% on the UNSW-NB15 dataset. Additionally, the BFOFSIDS model significantly reduces the average processing time, with values recorded at 13,756 ms for NSL-KDD and 13,748 ms for UNSW-NB15, outperforming state-of-the-art methods. The precision and F-score for BFOFSIDS are also notably higher, indicating its effectiveness in improving detection accuracy while minimizing computational complexity. [ABSTRACT FROM AUTHOR]

Medical image encryption has currently drawn particular attention because of the sensitive nature of medical data, the lack of efficient image encryption employing innovative encryption methods. To enhance the encryption of medical images, a number of encryption approaches were suggested and created. This research proposes a hyperchaotic map as well as a deep learning (DL) based selective medical image encryption technique. Initially, the 3D_Att_ResU-Net segments more sensitive region of interest (ROI) which is the brain tumours. The process continues with a hyperchaotic map for encrypting the ROI of plain medical image. On the other hand, the region of non interest (RONI) is compressed based on discrete cosine transform (DCT). The encrypting of ROI as well as compression of the background could provide the best possible balance between encryption performance and security. The samples for the simulation included a variety of common medical image types as well as a few normal images. The outcomes have been analysed using standard image cryptanalysis techniques. The findings demonstrated that cipher-images had uniformly distributed histogram, high information entropy, low correlation between neighbouring pixels, and good visual quality. The method has a large key space as well as low time complexity, yet it is sensitive to the plain image and the initial key. Interestingly, it has been found that the values of NPCR and UACI are higher than 99.75% and 36. 53%, respectively besides large key space registered as an order of 2339. The entropy of the Region of Interest (ROI) is roughly estimated to be 8, which is significantly represent a better security for the current system. The estimated encryption time required for the ROI of size 8.09 KB is 0.3s and to compress the RONI of size 73.81 is 1.02s while the total time required to encrypt whole image of size 81.9 is 2.4737s making it suitable for real time applications. The results depict that the current presented encryption scheme gives high security with less computational time and complexity. [ABSTRACT FROM AUTHOR]

Several studies have attempted to solve traveling salesman problems (TSPs) using various deep learning techniques. Among them, Transformer-based models show state-of-the-art performance even for large-scale Traveling Salesman Problems (TSPs). However, they are based on fully-connected attention models and suffer from large computational complexity and GPU memory usage. Our work is the first CNN-Transformer model based on a CNN embedding layer and partial self-attention for TSP. Our CNN-Transformer model is able to better learn spatial features from input data using a CNN embedding layer compared with the standard Transformer-based models. It also removes considerable redundancy in fully-connected attention models using the proposed partial self-attention. Experimental results show that the proposed CNN embedding layer and partial self-attention are very effective in improving performance and computational complexity. The proposed model exhibits the best performance in real-world datasets and outperforms other existing state-of-the-art (SOTA) Transformer-based models in various aspects. Our code is publicly available at https://github.com/cm8908/CNN_Transformer3. [ABSTRACT FROM AUTHOR]

Facial emotion recognition has become a complicated task due to individual variations in facial characteristics, as well as racial and cultural variances. Different psychological studies show that there are complex expressions other than basic emotions which are made up of two basic emotions like"Happily Disgusted", "Happily Surprised", "Sadly Surprised", etc. Compound emotion recognition is challenging due to very less publicly available compound emotion datasets which are imbalanced too. In this paper, we have proposed an LSwin-CBAM for the classification of compound emotions. To address the problem of the imbalanced dataset, the proposed model exploits the cutmix augmentation technique for data augmentation. It also incorporates the CBAM attention mechanism to emphasize the relevant features in an image and swin transformer with fewer swin transformer blocks which leads to less computational complexity in terms of trainable parameters and improves the overall classification accuracy as well. The experimental results of LSwin-CBAM on RAF-DB and EmotioNet datasets show that the proposed transformer-based network can well recognize compound emotions. [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]

Properly planned shared mobility services can be attractive even for who owns and drives a private vehicle, but would consider not owning it anymore if a cheaper, more sustainable, and accessible transport service is available. However, planning such services may become computationally intractable as demand and coverage widen, requiring different methods for optimizing them. This work contextualizes the computational challenges in defining station locations for shared mobility services; proves the NP‐hardness of optimizing the exact locations for shared mobility stations; proves the NP‐hardness of selecting street segments to have shared mobility stations; proposes mixed‐integer linear programming formulations for both problems; proposes and compares the performance of these formulations to two heuristics; and applies these formulations to the road network of the metropolitan region of São Paulo in Brazil. Results show the trade‐off between computational efforts and the precision of optimal solutions by choosing which problem to solve. [ABSTRACT FROM AUTHOR]

Approximate computing is a technique for optimising algorithms while taking into account both application quality of service and computational complexity. Video encoding is a computationally difficult operation, and the complexity is growing as new compression standards, such as Versatile Video Coding (VVC), emerge. Because it uses several new coding methods, the VVC standard delivers superior video compression. However, the human perceptual constraint presents a good chance for a new alternative form of computation, such as approximation computing, which allows for some acceptable level of inaccuracy in the output. In this paper, first, the VVC coding tools are analysed to determine the most computationally complex functions of various coding tools as the best candidates to perform approximate computing. Because addition is a frequent operation employed in all reletaed functions of various coding tools and no one would be feasible without an efficient adder circuit, correct approximate computing is done to the adder circuits of these chosen candidate functions. First, the LOA approximation adder is employed, which achieves 9.67x and 5x power and area reductions, respectively, as compared to the original VVC as the baseline, with no discernible influence on subjective quality. The AxMAP framework is then examined to build more effective approximate adders, which lowered the area and power consumption by 14.88% and 9.11%, respectively, over the LOA technique. [ABSTRACT FROM AUTHOR]

Active Speaker Detection (ASD) aims at identifying the active speaker among multiple speakers in a video scene. Previous ASD models often seek audio and visual features from long video clips with a complex 3D Convolutional Neural Network (CNN) architecture. However, models based on 3D CNNs can generate discriminative spatial-temporal features, but this comes at the expense of computational complexity, and they frequently face challenges in detecting active speakers in short video clips. This work proposes the Active Speaker Network (AS-Net) model, a simple yet effective ASD method tailored for detecting active speakers in relatively short video clips without relying on 3D CNNs. Instead, it incorporates the Temporal Shift Module (TSM) into 2D CNNs, facilitating the extraction of dense temporal visual features without the need for additional computations. Moreover, self-attention and cross-attention schemes are introduced to enhance long-term temporal audio-visual synchronization, thereby improving ASD performance. Experimental results demonstrate that AS-Net outperforms state-of-the-art 2D CNN-based methods on the AVA-ActiveSpeaker dataset and remains competitive with the methods utilizing more complex architectures. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks (WSNs) play a vital role in various applications, necessitating robust network security to protect sensitive data. Intrusion Detection Systems (IDSs) are crucial for preserving the integrity, availability, and confidentiality of WSNs by detecting and countering potential attacks. Despite significant research efforts, the existing IDS solutions still suffer from challenges related to detection accuracy and false alarms. To address these challenges, in this paper, we propose a Bayesian optimization-based Deep Learning (DL) model. However, the proposed optimized DL model, while showing promising results in enhancing security, encounters challenges such as data dependency, computational complexity, and the potential for overfitting. In the literature, researchers have employed Reinforcement Learning (RL) to address these issues. However, it also introduces its own concerns, including exploration, reward design, and prolonged training times. Consequently, to address these challenges, this paper proposes an Innovative Integrated RL-based Advanced DL Algorithm (IRADA) for attack detection in WSNs. IRADA leverages the convergence of DL and RL models to achieve superior intrusion detection performance. The performance analysis of IRADA reveals impressive results, including accuracy (99.50%), specificity (99.94%), sensitivity (99.48%), F1-Score (98.26%), Kappa statistics (99.42%), and area under the curve (99.38%). Additionally, we analyze IRADA's robustness against adversarial attacks, ensuring its applicability in real-world security scenarios. [ABSTRACT FROM AUTHOR]

Intelligent metasurfaces, as the next‐generation of metasurfaces, have emerged as a versatile artificial electromagnetic (EM) medium capable of adaptively manipulating wave‐matter interactions, especially in the construction of EM space integration and the analogy of wave‐based neural networks. However, current computational landscape for intelligent metasurfaces relies either on time‐consuming full‐wave numerical simulations with excessive computational complexity or on application‐limited physical models that are difficult to consider the coupling effects. Here, a universal graph neural network (GNN) framework is introduced, incorporating the elusive coupling effects inside metasurfaces, enabling rapid and precise characterization with arbitrary‐large size. This framework exhibits exceptional compatibility with physical models, thereby significantly expanding the realm of potential design scenarios. By harnessing the principles of diffraction theory and near‐to‐far transformation algorithms, highly accurate modeling of the scattered fields emanating from metasurfaces is achieved. Through microwave experiments on intelligent metasurfaces, the efficacy of GNN in real‐world scenarios is effectively demonstrated. The utilization of topological strategies to characterize intelligent metasurfaces marks a major leap toward the next‐generation metasurfaces, promising transformative advancements across various applications. [ABSTRACT FROM AUTHOR]

As one of the most important economic crops, grapes have attracted considerable attention due to their high yield, rich nutritional value, and various health benefits. Identifying grape bunches is crucial for maintaining the quality and quantity of grapes, as well as managing pests and diseases. In recent years, the combination of automated equipment with object detection technology has been instrumental in achieving this. However, existing lightweight object detection algorithms often sacrifice detection precision for processing speed, which may pose obstacles in practical applications. Therefore, this thesis proposes a lightweight detection method named YOLOv8s-grape, which incorporates several effective improvement points, including modified efficient channel attention (MECA), slim-neck, new spatial pyramid pooling fast (NSPPF), dynamic upsampler (DySample), and intersection over union with minimum point distance (MPDIoU). In the proposed method, MECA and NSPPF enhance the feature extraction capability of the backbone, enabling it to better capture crucial information. Slim-neck reduces redundant features, lowers computational complexity, and effectively reuses shallow features to obtain more detailed information, further improving detection precision. DySample achieves excellent performance while maintaining lower computational costs, thus demonstrating high practicality and rapid detection capability. MPDIoU enhances detection precision through faster convergence and more precise regression results. Experimental results show that compared to other methods, this approach performs better in the grapevine bunch detection dataset and grapevine bunch condition detection dataset, with mean average precision (mAP50-95) increasing by 2.4% and 2.6% compared to YOLOv8s, respectively. Meanwhile, the computational complexity and parameters of the method are also reduced, with a decrease of 2.3 Giga floating-point operations per second and 1.5 million parameters. Therefore, it can be concluded that the proposed method, which integrates these improvements, achieves lightweight and highprecision detection, demonstrating its effectiveness in identifying grape bunches and assessing biophysical anomalies. [ABSTRACT FROM AUTHOR]

The effective restoration of degraded remote sensing images is one of the major concerns as it directly affects imaging system performance. In recent years, investigators have developed innumerable systems and methods for remotely sensed hazy or blurred image restoration to enhance the system's performance. However, the existing remotely sensed image restoration system and methods still have untold limitations such as texture degradation, high computational complexity, preparative parametric tunning, more time consumption in restoration procedure, lesser accuracy, and many more. Hence, effective and fast restoration of the degraded remote sensing images with more accuracy is still a challenging problem, which requires enormous attention toward a novel image restoration approach. In this work, the researchers implement a remote sensing image restoration framework namely IMU-CNN, which is based on mask-upgraded cascade R-CNN and deep autoencoder. Our proposed IMU-CNN model performs hazy or blurred remotely sensed image restoration in a faster manner with improved accuracy, as well as saves time in the image restoration process, significantly. The outcome of the proposed image restoration framework is found improved and optimal and measured accuracy, precision, F1 score, and Recall is 99.59%, 97.24%, 97.69%, and 96.49%, respectively. Recently, researchers have conducted much investigation on remotely sensed image restoration systems by using various hybrid approaches. However, still, there is a need for further investigation in the future for building sophisticated and less computationally complex systems for effective remotely sensed image restoration in less time. [ABSTRACT FROM AUTHOR]

The challenge of ensuring reliability for high‐efficiency technology, multiple‐input‐multiple‐output orthogonal‐frequency‐division‐multiplexing (MIMO‐OFDM), in wireless frequency‐selective fading environments persists. In this article, the concept of spreading a symbol's energy is proposed as a viable solution to enhance transmission reliability for MIMO‐OFDM systems. And an energy‐spreading‐transform (EST)‐based MIMO‐OFDM transceiver is developed. Following the Inverse Fast Fourier Transform (IFFT) performed by the conventional MIMO‐OFDM transmitter, an orthogonal transformation called the EST is introduced. This transform spreads the energy of a symbol across the entire frequency domain and all time slots. The EST is coupled with the improved iterative detection algorithm named EST‐partial decision (PD)‐iterative‐interference‐cancellation (EST‐PD‐IIC) to maximize and leverage the potential diversity gain. Numerical simulation results demonstrate that the proposed scheme approaches the performance bound when signal‐to‐noise ratio (SNR) is about 21dB for 16‐ary quadrature amplitude modulation (16‐QAM). Complexity analysis illustrates that the computational complexity of the evolved EST‐PD‐IIC algorithm is lower than that of the famous vertically Bell laboratory layered space‐time detector (V‐BLAST) when the antenna array size is greater than 3×3$3\times 3$. In summary, the proposed scheme is practical for providing high‐quality communication in multi‐path fading environments and can even enable a reliable communication without channel encoding when Eb/N0 exceeds a threshold in 5G‐Advanced. [ABSTRACT FROM AUTHOR]

The Diffusion Peterlin Viscoelastic Fluid (DPVF) model describes the movement of specific incompressible polymeric fluids. In this paper, we introduce and evaluate a new low-complexity linear-time filter finite element (FE) method for the DPVF model. In order to avoid the value at time t = − Δ t , the proposed time filter method consists of three steps, including a post-processing step. Firstly, a first-order Euler backward nonlinear fully discrete mixed FE scheme is employed to compute the numerical solutions at time t 1 = Δ t. For n ≥ 1 , we obtain the intermediate values ( u ˜ h n + 1 , p ˜ h n + 1 , d ˜ h n + 1) in Step II using a fully implicit backward Euler scheme. At the same time level, we proceed with these intermediate values ( u ˜ h n + 1 , p ˜ h n + 1 , d ˜ h n + 1) using the linear time filters. The linear time filters step does not significantly increase computational complexity. However, it can enhance temporal convergence accuracy from first order to second order for backward Euler time filter (BE time filter), and from second order to three order for BDF2 time filter. We demonstrate the almost unconditional stability of the scheme. Error estimates for the time filter method are derived and presented. Several numerical experiments are conducted to validate the theoretical findings and showcase the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

We propose a novel and simple spectral method based on the semi-discrete Fourier transforms to discretize the fractional Laplacian (− Δ) α 2 . Numerical analysis and experiments are provided to study its performance. Our method has the same symbol | ξ | α as the fractional Laplacian (− Δ) α 2 at the discrete level, and thus it can be viewed as the exact discrete analogue of the fractional Laplacian. This unique feature distinguishes our method from other existing methods for the fractional Laplacian. Note that our method is different from the Fourier pseudospectral methods in the literature which are usually limited to periodic boundary conditions (see Remark 1.1). Numerical analysis shows that our method can achieve a spectral accuracy. The stability and convergence of our method in solving the fractional Poisson equations were analyzed. Our scheme yields a multilevel Toeplitz stiffness matrix, and thus fast algorithms can be developed for efficient matrix-vector multiplications. The computational complexity is O (2 N log ⁡ (2 N)) , and the memory storage is O (N) with N the total number of points. Extensive numerical experiments verify our analytical results and demonstrate the effectiveness of our method in solving various problems. [ABSTRACT FROM AUTHOR]

License plate recognition technology is of paramount importance in intelligent transportation. While ideal scenario license plate recognition technology has gradually matured, traditional methods still exhibit limitations in performance under unconstrained scenarios. Although network models based on the recurrent neural network structure address some shortcomings of traditional methods to a certain extent, they constraints in recognition speed. To address these issues, we introduce and implements ALP-Net, a novel structural model, aimed at enhancing the robustness and efficiency of license plate recognition in diverse and challenging scenarios. The model utilizes a fully convolutional structure and custom attention mechanism modules (GFE-Block, ALP-Attention) to ensure speed while significantly improving recognition for low-quality license plates. Introducing synthetic data and a dynamic random perturbation mechanism further enhances the model's generalization ability. We believe this model can elevate performance while maintaining a low computational complexity. Extensive experiments indicate that our approach outperforms state-of-the-art methods on the CCPD dataset and demonstrates robust generalization capabilities on the CLPD and CRPD datasets. The code and datasets can be available from https://github.com/HeYaoting666/ALP-Net. [ABSTRACT FROM AUTHOR]

Although widely used in industrial applications, strong nonlinearity and coupling, high computational complexity prevent high precision tracking control of manipulator. In this paper, to overcome the rely on system model and achieve prescribed convergence, a novel hybrid observer‐based model‐free adaptive high‐order fast terminal sliding model control scheme (HO‐MHTSMC) with prescribed performance is proposed for trajectory tracking control of robot manipulators in the existence of friction and external disturbance. The ultra‐local model is used to approximate the original complex system in a model free form in a short sliding time window, which avoid the accurate modeling of the manipulator system. To compensate for the lumped uncertainties, a hybrid observer based on adaptive time‐delay estimation and adaptive second order sliding mode observer (SOSM) is proposed to achieve finite‐time observation and zero estimation error. Besides, a transformation using prescribed performance function is applied to the system to ensure the transient and steady‐state performance of the trajectory tracking in joint space. Furthermore, a high‐order fast terminal sliding mode control algorithm with backstepping control strategy is used to stabilize the whole system and reduce the chattering problem in conventional sliding mode control. The stability analysis of the system is provided by Lyapunov theorem. Finally, numerical study and co‐simulations show that the proposed control scheme has better performance in tracking accuracy and robustness compared with conventional control schemes. [ABSTRACT FROM AUTHOR]

Ocean observation has advanced rapidly in recent decades due to its crucial role in resource exploration and scientific research, with the Doppler factor being widely utilized. However, the precision of Doppler estimation is frequently constrained by frequency resolution. Traditional frequency estimation methods using single-tone signals face considerable challenges with low accuracy and poor robustness. In response, this paper introduces a novel Doppler-sensitive Acoustic Frequency Comb (AFC) for estimating the Doppler factor, enabling multiple measurements with a single transmission and reception of the signal. The proposed Combined Uneven Uncertainty (CUU) method based on AFC achieves a bias of less than 1.1x10-5, significantly surpassing the optimal result of 3.2x10-5 attained by other frequency estimation methods in the absence of noise. Compared to traditional single-tonemethods, the AFC approach improves spectral leakage performance and enhances estimation accuracy without increasing computational complexity. Experimental results demonstrate that the CUU method realizes a difference performance of less than 3.4x10-6, notably lower than that of 3.2x10-5 induced by coherent spectral leakage in fast Fourier Transform (FFT). [ABSTRACT FROM AUTHOR]

The Karhunen-Loève transform (KLT) stands as a well-established discrete transform, demonstrating optimal characteristics in data decorrelation and dimensionality reduction. Its ability to condense energy compression into a select few main components has rendered it instrumental in various applications within image compression frameworks. However, computing the KLT depends on the covariance matrix of the input data, which makes it difficult to develop fast algorithms for its implementation. Approximations for the KLT, utilizing specific rounding functions, have been introduced to reduce its computational complexity. Therefore, our paper introduces a category of low-complexity, data-independent KLT approximations, employing a range of round-off functions. The design methodology of the approximate transform is defined for any block-length N , but emphasis is given to transforms of N = 8 due to its wide use in image and video compression. The proposed transforms perform well when compared to the exact KLT and approximations considering classical performance measures. For particular scenarios, our proposed transforms demonstrated superior performance when compared to KLT approximations documented in the literature. We also developed fast algorithms for the proposed transforms, further reducing the arithmetic cost associated with their implementation. Evaluation of field programmable gate array (FPGA) hardware implementation metrics was conducted. Practical applications in image encoding showed the relevance of the proposed transforms. In fact, we showed that one of the proposed transforms outperformed the exact KLT given certain compression ratios. [ABSTRACT FROM AUTHOR]

Printed circuit boards (PCBs) play a critical role in electronic products. Ensuring these products’ long-term reliability and consistent performance requires effective PCB defect detection. Although existing deep learning models for PCB defect detection are not highly accurate, they often neglect capability considerations. This paper introduces a precise, fast, and lightweight defect detection model, CCG-YOLO, based on an enhanced YOLOv5 model to address this issue. The enhancements in CCG-YOLO can be summarized as follows: (1) Improved Backbone network: The feature extraction ability of the Backbone network is enhanced by introducing a C3HB module, which fosters spatial interaction capabilities. (2) Lightweight feature fusion network: A lightweight convolution structure called Ghost-Shuffle Convolution is incorporated in the feature fusion network, remarkably reducing model parameters while maintaining performance. (3) Efficient residual networking: To enhance model performance further, a CNeB module is introduced based on the ConvNeXt network, which replaces the C3 module in the Neck. CNeB improves model detection accuracy and reduces the number of model parameters. The combination of these enhancements results in impressive performance. CCG-YOLO achieves mean average precision (mAP@0.5) of 99.5% and 88.75% in mAP@0.5:0.95 on the TDD-Net public dataset. Compared with the original YOLOv5s algorithm, CCG-YOLO offers a 4.24% improvement in mAP@0.5:0.95, a 1MB reduction in model size, a 0.472M decrease in the number of parameters, a 0.6G floating point operation reduction in computational complexity, and a 120 frames per second real-time inference speed. These experimental results underscore that the proposed model excels in accuracy and speed and has a compact size for PCB defect detection. Moreover, CCG-YOLO is easily deployable on low-end devices, making it well-suited for meeting the real-time requirements of industrial defect detection. [ABSTRACT FROM AUTHOR]

Sparse identification of nonlinear dynamics is a popular approach to system identification. In this approach system identification is reformulated as a sparse regression problem, and the use of a good sparse regression method is crucial. Sparse Bayesian learning based on collaborative neurodynamic optimization is a recent method that consistently produces high-quality solutions. In this article, we extensively assess how this method performs for ordinary differential equation identification. We find that it works very well compared with sparse regression algorithms currently used for this task in terms of the tradeoff between the approximation accuracy and the complexity of the identified system. We also propose a way to substantially reduce the computational complexity of this algorithm compared with its original implementation, thus making it even more practical. [ABSTRACT FROM AUTHOR]

Parametric timed automata (PTA) have been introduced by Alur, Henzinger, and Vardi as an extension of timed automata in which clocks can be compared against parameters. The reachability problem asks for the existence of an assignment of the parameters to the non-negative integers such that reachability holds in the underlying timed automaton. The reachability problem for PTA is long known to be undecidable, already over three parametric clocks. A few years ago, Bundala and Ouaknine proved that for PTA over two parametric clocks and one parameter the reachability problem is decidable and also showed a lower bound for the complexity class PSPACENEXP. Our main result is that the reachability problem for two-parametric timed automata with one parameter is EXPSPACE-complete. Our contribution is two-fold. For the EXPSPACE lower bound, inspired by [13-14], we make use of deep results from complexity theory, namely a serializability characterization of EXPSPACE (in turn based on Barrington's Theorem) and a logspace translation of numbers in Chinese remainder representation to binary representation due to Chiu, Davida, and Litow. It is shown that with small PTA over two parametric clocks and one parameter one can simulate serializability computations. For the EXPSPACE upper bound, we first give a careful exponential time reduction from PTA over two parametric clocks and one parameter to a (slight subclass of) parametric one-counter automata over one parameter based on a minor adjustment of a construction due to Bundala and Ouaknine. For solving the reachability problem for parametric one-counter automata with one parameter, we provide a series of techniques to partition a fictitious run into several carefully chosen subruns that allow us to prove that it is sufficient to consider a parameter value of exponential magnitude only. This allows us to show a doubly-exponential upper bound on the value of the only parameter of a PTA over two parametric clocks and one parameter. We hope that extensions of our techniques lead to finally establishing decidability of the long-standing open problem of reachability in parametric timed automata with two parametric clocks (and arbitrarily many parameters) and, if decidability holds, determinining its precise computational complexity. [ABSTRACT FROM AUTHOR]

NeRF is a deep learning model aimed at modeling three-dimensional implicit spaces, and it holds significant value in the representation and rendering of 3D scenes. However, due to the complex training process, substantial computational resources, and time requirements, the usability and practicality of the NeRF algorithm are somewhat limited. Addressing the pain points of NeRF optimization has become a hot topic in the field of computer vision. This paper aimed to provide a comprehensive review of the optimization and application of NeRF. Firstly, it delved into the basic principles of NeRF and outlined the current optimization status from the perspectives of rendering quality, computational complexity, and pose. Secondly, it enumerated the application scenarios of NeRF to provide references for future, more efficient and practical algorithmic optimizations. Finally, it summarized the strengths and limitations of NeRF and proposed potential future directions tailored to harness the tremendous potential of NeRF in 3D rendering, scene synthesis, and beyond. [ABSTRACT FROM AUTHOR]

This study focuses on the fast finite‐time synchronization control problem for nonlinear telerobotics system with asymmetric time‐vary delays and uncertainties. A finite‐time prescribed performance function is incorporated into the backstepping control framework such that the synchronization error will remain within a predefined funnel boundary. To increase the rate of convergence, the selected error transformation function is a arctangent function. The utilization of dynamic surface control method aims to decrease computational complexity by mitigating the need for repetitive differentiation of virtual signals in the conventional backstepping algorithm. In the meantime, the non‐power approximate signals of fuzzy neural network algorithms are utilized to replace the system uncertainties, effectively addressing the passivity issue associated with time‐delayed channels. Both theoretical analysis and experimental results are present to verify that the synchronization error can converge to a small neighborhood around zero in the fast finite time and the closed‐loop system remains stable. [ABSTRACT FROM AUTHOR]

Over the past few years, global use of Online Social Networks (OSNs) has increased. The rising use of OSN makes protecting users' privacy from OSN attacks difficult. Finally, it affects the basic commitment to protect OSN users from such invasions. The lack of a distributed, dynamic, and artificial intelligence (AI)-based privacy-preserving strategy for performance trade-offs is a research challenge. We propose the Distributed Privacy Preservation (DPP) for OSN using Artificial Intelligence (DPP-OSN-AI) to reduce Information Loss (IL) and improve privacy preservation from different OSN threats. DPP-OSN-AI uses AI to design privacy notions in distributed OSNs. DPP-OSN-AI consists of AI-based clustering, l-diversity, and t-closeness phases to achieve the DPP for OSN. The AI-based clustering is proposed for dynamic and optimal clustering of OSN users to ensure personalized k-anonymization to protect from AI-based threats. First, the optimal number of clusters is discovered dynamically with simple computations, and then the Whale Optimization Algorithm is designed to optimally place the OSN users across the clusters such that it helps to protect them from AI-based threats. Because k-anonymized OSN clusters are insufficient to handle all privacy concerns in a distributed OSN environment, we systematically applied the l-diversity privacy idea followed by the t-closeness to it, resulting in higher DPP and lower IL. The DPP-OSN-AI model is assessed for IL Efficiency (ILE), Degree of Anonymization (DoA,) and computational complexity using publically accessible OSN datasets. Compared to state-of-the-art, DPP-OSN-AI model DoA is 15.57% higher, ILE is 17.85% higher, and computational complexity is 3.61% lower. [ABSTRACT FROM AUTHOR]