Search

ABSTRACT In practical sensor networks, sensor nodes may operate with different sampling periods and initial sampling time instants, and their observations may also be nonuniform. Unfortunately, the research on distributed state estimation problems over such asynchronous sensor networks is very limited. Thus, this article focuses on the distributed consensus filtering problem over sensor networks with asynchronous measurements. First, the asynchronous measurement from each sensor is synchronized by the continuous‐time state evolution equation to a unified filtering fusion time instant within a given filtering period. After measurement synchronization, the statistical characteristics of measurement noise change. The cross‐correlations between the converted measurement noises are analyzed, as well as one‐step correlations between the converted measurement noises and the process noise. Second, an optimal asynchronous distributed consensus filter is designed based on synchronization measurements under the criterion of minimum mean‐square error with the above correlations between various types of noises taken into account. Meanwhile, a suboptimal distributed consensus filtering algorithm is further proposed to reduce computational complexity. Finally, based on the Lyapunov function method, the stability of the estimation error is theoretically demonstrated with an appropriate selection of consensus filtering gain and validated through simulations. [ABSTRACT FROM AUTHOR]

In many engineering applications, missing data during system identification can hinder the performance of the identified model. In this paper, a novel two‐stage nonparametric framework is proposed for missing data imputation, uncertainty quantification, and its integration in system identification with reduced computational complexity. The framework does not require functional forms for both the imputation model and the identified mathematical model. Moreover, through the construction of a single imputation model, analytical expressions of predictive distributions can be given for missing entries across all missingness patterns. Furthermore, analytical expressions of the expectation and variance of distribution are provided to impute missing values and quantify uncertainty, respectively. This uncertainty is incorporated into a single mathematical model by mitigating the influence of samples with imputations during training and testing. The framework is applied to three applications, including a simulated example and two real applications on structural health monitoring and seismic attenuation modeling. Results reveal a minimum reduction of 21% in root mean squared error values, compared to those achieved by directly removing incomplete samples. [ABSTRACT FROM AUTHOR]

In this letter, a novel integrated sensing and communication (ISAC) scenario with wireless power transfer (ISAC‐WPT) is investigated. In this new setup, an access point simultaneously employs communication and sensing beams to serve a communication user, detect an RFID tag, and power an energy receiver. The objective is to design the sensing and communication beams to minimize the total transmit power while satisfying the requirements of tag detection, communication, and energy harvesting. To address the corresponding non‐convex problem, the constraints are reformulated into convex second‐order cone constraints, thereby obtaining the globally optimal solution. To further reduce computational complexity, zero‐forcing is employed to design the beamforming vectors, followed by solving a convex optimization problem to determine the optimal power allocation between sensing and communication beams. The simulation results demonstrate the effectiveness of the proposed beamforming designs, highlighting the potential of ISAC‐WPT Backscatter RFID systems. [ABSTRACT FROM AUTHOR]

Large pre‐trained models (PTMs) have shown their powerful ability in multiple natural language processing tasks. However, using them in practical application remains a challenge due to the significant computational cost and memory requirements. In order to achieve the balance of computational cost and accuracy, MLP architecture can be used as an alternative to the self‐attention module, such as pNLP‐Mixer and Hyper‐Mixer. Experiments indicate that, MLP‐based models can attain competitive performance with low cost. They maintain the balance of computation cost and accuracy successfully, yet, this is at the expense of not being able to capture short‐range dependencies. In this paper, a novel MLP‐based model, termed TS‐Mixer, is proposed which can capture local dependencies by shifting operation. Compared with other MLP‐based models, the parameters of TS‐Mixer are decoupled from the sequence length, hence it has a smaller model size in long sequence tasks. In addition, TS‐Mixer has linear computational complexity, therefore it can be used as a lightweight alternative to the self‐attention model. Experiments show that the TS‐Mixer outperforms other MLP‐based models, which achieves higher accuracy with fewer parameters in multiple downstream tasks. Notably, compared with pre‐trained models, TS‐Mixer can reach more than 90% of their accuracy with 1% or even one thousandth of the parameters (0.174 ~ 1.2 M). These results demonstrate that TS‐Mixer can achieve a better balance between the computing resources and accuracy. Code is available at: https://github.com/wyl-privacy-project/TS-Mixer. [ABSTRACT FROM AUTHOR]

Summary: Wireless sensor networks consist of several autonomous nodes that are outfitted with sensors, radio, processors, memory storage, and power sources. These nodes track, sense, and send data using radio. While establishing a network, the two most essential characteristics are coverage and connectivity. For better connectivity and a longer network life, it's important to make the coverage area as big as possible with the fewest number of sensor nodes. The goal of this research is to make a connected sensor network that uses less energy and can be used in situations where the sensors need to be placed in the best way to make the network last as long as possible. The probabilistic sensing model is used, and improved network lifetime is the goal of the research work by using problem‐specific intelligent optimization techniques like BAT, ACO, and JOA to maximize the coverage area with respect to energy and points of interest. This work introduces a novel approach that optimizes both coverage and connectivity. The modified binary bat algorithm overcomes computational complexities and local optima observed in existing methods. Uniquely, it models the three states of each sensor node and includes innovative features like a greedy initialization and a weighted cost function for improving network efficiency. After investigation, it was analyzed that the proposed solution significantly improves network lifetime by over 10% to 12% compared to existing methods like JOA and ACO. The proposed approach converges faster and performs more efficiently. [ABSTRACT FROM AUTHOR]

Deep learning (DL) has proven to be one of the most pivotal components of machine learning given its notable performance in a variety of application domains. Neural networks (NNs) for DL are tailored to specific application domains by varying in their topology and activation nodes. Nevertheless, the major operation type (with the largest computational complexity) is commonly multiply‐accumulate operation irrespective of their topology. Recent trends in DL highlight the evolution of NNs such that they become deeper and larger, and thus their prohibitive computational complexity. To cope with the consequent prohibitive latency for computation, 1) general‐purpose hardware, e.g., central processing units and graphics processing units, has been redesigned, and 2) various DL accelerators have been newly introduced, e.g., neural processing units, and computing‐in‐memory units for deep NN‐based DL, and neuromorphic processors for spiking NN‐based DL. In this review, these accelerators and their pros and cons are overviewed with particular focus on their performance and memory bandwidth. [ABSTRACT FROM AUTHOR]

Parameterized complexity, introduced to efficiently solve NP‐hard problems for small values of a fixed parameter, has been recently used as a tool to speed up algorithms for tractable problems. Following this line of research, we design algorithms parameterized by neighborhood diversity (nd$$ \mathsf{nd} $$) for several graph theoretic problems in P$$ P $$: Maximumb$$ b $$‐Matching, Triangle Counting and Listing, Girth, Global Minimum Vertex Cut, and Perfect Graphs Recognition. Such problems are known to admit algorithms parameterized by modular‐width (mw$$ \mathsf{mw} $$) and consequently—as nd$$ \mathsf{nd} $$ is a special case of mw$$ \mathsf{mw} $$—by nd$$ \mathsf{nd} $$. However, the proposed novel algorithms allow for improving the computational complexity from time O(f(mw)·n+m)$$ O\left(f\left(\mathsf{mw}\right)\cdotp n+m\right) $$—where n$$ n $$ and m$$ m $$ denote, respectively, the number of vertices and edges in the input graph—to time O(g(nd)+n+m)$$ O\left(g\left(\mathsf{nd}\right)+n+m\right) $$ which is only additive in the size of the input. Then we consider some classical NP‐hard problems (Maximum independent set, Maximum clique, and Minimum dominating set) and show that for several classes of hereditary graphs, they admit linear time algorithms for sufficiently small—nonnecessarily constant—values of the neighborhood diversity parameter. [ABSTRACT FROM AUTHOR]

Image processing often requires filtering, which can be effectively performed by using B‐spline surface approximation. This article presents a fast method of approximating data in rectangular (image) form using such surfaces. The method considers dynamic changes of data by representing rows and columns in chordal parameterized form. To improve performance, after parametrization, lines are uniformly resampled using linear interpolation. It allows using the same basis functions with uniform parameterization for approximation of all processed lines. After approximation, reconstruction of original parameterization is required, but its computational complexity is also linear. [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]

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

Lossless image compression techniques shrink the image size to improve the transmission efficiency and reduce the occupied storage space while ensuring the quality of the image is lossless. Among them, the LOCO‐I/JPEG‐LS algorithm benefits high lossless compression ratio and low computational complexity and thus is widely used for various real‐time applications. However, due to the problems of the context dependency in the LOCO‐I, the parallelism in the algorithm is greatly constrained, which significantly limits the throughput and the real‐time performance of hardware implementations. Existing designs achieve more parallelism by using a lot of hardware costs or straightforward chunking with losing compression ratio. In order to trade off the parallelism and the compression ratio, this paper proposes a chunk‐oriented error modeling scheme for LOCO‐I, which enables parallelism in both compression and decompression and achieves a better compression ratio in chunks. Based on the optimized algorithm, a high‐throughput flexible lossless compression and decompression architecture (HFCD) is proposed, which achieves higher pixel per clock (PPC) with less hardware cost. Additionally, HFCD introduces a parameter sharing mechanism to enable random access of image chunks to improve the flexibility for decompression. Experimental results show that, compared with state‐of‐the‐art works, HFCD achieves 3.02–13.50 times improvement for the PPC of compression. For decompression, benefiting from our optimizations, HFCD achieves 22.4 times speedup compared to the software solution. [ABSTRACT FROM AUTHOR]

Background Purpose Methods Results Conclusions Low‐dose computed tomography (LDCT) can mitigate potential health risks to the public. However, the severe noise and artifacts in LDCT images can impede subsequent clinical diagnosis and analysis. Convolutional neural networks (CNNs) and Transformers stand out as the two most popular backbones in LDCT denoising. Nonetheless, CNNs suffer from a lack of long‐range modeling capabilities, while Transformers are hindered by high computational complexity.In this study, our main goal is to develop a simple and efficient model that can both focus on local spatial context and model long‐range dependencies with linear computational complexity for LDCT denoising.In this study, we make the first attempt to apply the State Space Model to LDCT denoising and propose a novel LDCT denoising model named Visual Mamba Encoder‐Decoder Network (ViMEDnet). To efficiently and effectively capture both the local and global features, we propose the Mixed State Space Module (MSSM), where the depth‐wise convolution, max‐pooling, and 2D Selective Scan Module (2DSSM) are coupled together through a partial channel splitting mechanism. 2DSSM is capable of capturing global information with linear computational complexity, while convolution and max‐pooling can effectively learn local signals to facilitate detail restoration. Furthermore, the network uses a weighted gradient‐sensitive hybrid loss function to facilitate the preservation of image details, improving the overall denoising performance.The performance of our proposed ViMEDnet is compared to five state‐of‐the‐art LDCT denoising methods, including an iterative algorithm, two CNN‐based methods, and two Transformer‐based methods. The comparative experimental results demonstrate that the proposed ViMEDnet can achieve better visual quality and quantitative assessment outcomes. In visual evaluation, ViMEDnet effectively removes noise and artifacts, while exhibiting superior performance in restoring fine structures and low‐contrast structural edges, resulting in minimal deviation of denoised images from NDCT. In quantitative assessment, ViMEDnet obtains the lowest RMSE and the highest PSNR, SSIM, and FSIM scores, further substantiating the superiority of ViMEDnet.The proposed ViMEDnet possesses excellent LDCT denoising performance and provides a new alternative to LDCT denoising models beyond the existing CNN and Transformer options. [ABSTRACT FROM AUTHOR]

The wide‐angle electromagnetic scattering problems can be rapidly solved by using the method of moments in conjunction with compressive sensing theory. The method mainly has two computational parts: measurement and recovery. To further enhance the performance, an improved orthogonal matching pursuit algorithm with a randomised atom selection process is proposed, significantly reducing the computational complexity of the recovery part. Additionally, a restart mechanism is designed to eliminate possible errors that might occur during the random process, ensuring the accuracy of recovery results. Numerical experiments with objects of different shapes validate the effectiveness and efficiency of the proposed scheme. [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]

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]

The primary focus of this research paper is to explore the realm of dynamic learning in sampled‐data strict‐feedback nonlinear systems (SFNSs) by leveraging the capabilities of radial basis function (RBF) neural networks (NNs) under the framework of adaptive control. First, the exact discrete‐time model of the continuous‐time system is expressed as an Euler strict‐feedback model with a sampling approximation error. We provide the consistency condition that establishes the relationship between the exact model and the Euler model with meticulous detail. Meanwhile, a novel lemma is derived to show the stability condition of a digital first‐order filter. To address the non‐causality issues of SFNSs with sampling approximation error and the input data dimension explosion of NNs, the auxiliary digital first‐order filter and backstepping technology are combined to propose an adaptive neural dynamic surface control (ANDSC) scheme. Such a scheme avoids the n$$ n $$‐step time delays associated with the existing NN updating laws derived by the common n$$ n $$‐step predictor technology. A rigorous recursion method is employed to provide a comprehensive verification of the stability, guaranteeing its overall performance and dependability. Following that, the NN weight error systems are systematically decomposed into a sequence of linear time‐varying subsystems, allowing for a more detailed analysis and understanding. In order to ensure the recurrent nature of the input variables, a recursive design is employed, thereby satisfying the partial persistent excitation condition specifically designed for the RBF NNs. Meanwhile, it can verify that the NN estimated weights converge to their ideal values. Compared with the common n$$ n $$‐step predictor technology, there is no need to redesign the learning rules due to the designed NN weight updating laws without time delays. Subsequently, after capturing and storing the convergence weights, a novel neural learning dynamic surface control (NLDSC) scheme is specifically formulated by leveraging the acquired knowledge. The introduced methodology reduces computational complexity and facilitates practical implementation. Finally, empirical evidence obtained from simulation experiments validates the efficacy and viability of the proposed methodology. [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]

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]

Compared with the traditional two‐step localization methods, the direct position determination (DPD) method is more robust at low signal‐to‐noise ratio. However, to guarantee the optimal location result, the computational complexity of DPD with grid search is too high, especially for moving targets. Therefore, a new DPD method is proposed for moving targets with low computational complexity. First, using a proposed cost function, the position information is obtained from the received array signals directly, which enhances the accuracy of localization. Second, utilizing the method of successional difference the velocity is extracted, which avoid the multi‐dimensional grid search and reduces the computational complexity. Simulation results demonstrate that the proposed method reduces the computational complexity greatly and outperforms the conventional methods. [ABSTRACT FROM AUTHOR]

The Network Function Virtualization (NFV) technology has emerged to turn hardware‐based network functions into software‐based virtual entities. In NFV‐enabled multicast services, the data flow should be passed through a series of Virtual Network Functions (VNFs) before reaching destinations. In the problem of NFV‐enabled multicast service embedding, not only the VNFs must be deployed, but also the traffic forwarding topology must be constructed. As the exact solution of this problem suffers from high computational complexity, the heuristic or approximation approaches are used in practice. However, as a way to control the trade off between complexity and efficiency, using multistage solutions is offered in literature. In this article, some two‐stage approaches for embedding NFV‐enabled multicast services are introduced, and they are compared through analysis and simulation. Specifically, a new low‐complexity approach based on the Auxiliary VNF Graph (AVG) is proposed to determine the sub‐optimal locations for VNF placement and to construct the NFV‐based multicast routing tree. The comparative analysis shows that the proposal has acceptable performance while reducing the computational complexity significantly. [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]

This study proposes novel sales forecasting approaches that merge deep learning methods in a hybrid model. Long short‐term memory (LSTM) is adopted for modeling the temporal characteristics of the data, whereas the convolutional neural network (CNN) focuses on identifying and extracting relevant exogenous information. We propose stacked (S‐CNN‐LSTM) and parallel (P‐CNN‐LSTM) hybrid architectures to understand complex time series data with varying seasonal patterns and multiple products correlations. The performance drivers of both architectures were empirically tested with a real‐world multivariate retail dataset and outperformed when compared with simple neural network architectures and standard autoregressive methods for short and long‐term forecasting horizons. When compared with traditional predictive approaches, the proposed hybrid models reduce the computational complexity while providing flexibility and robustness. [ABSTRACT FROM AUTHOR]

Summary: This paper studies the universally optimal designs for estimating total effects under crossover models with partial interactions. We provide necessary and sufficient conditions for a symmetric design to be universally optimal, based on which algorithms can be used to derive optimal symmetric designs under any form of the within‐block covariance matrix. To cope with the computational complexity of algorithms when the experimental scale is too large, we provide the analytical form of optimal designs under the type‐H covariance matrix. We find that for a fixed number of treatments, say t$$ t $$, the number of distinct treatments appearing in the support sequences increases with the increase of the number of periods, k$$ k $$, until k≥t2$$ k\ge {t}^2 $$, in which case all t$$ t $$ treatments appear. The optimal design can be constructed from up to two representative sequences, within which each treatment appears in consecutive periods with equal or almost equal numbers of replications. [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]

Accurate dynamic models that update in real‐time are vital for industrial robots to adapt flexibly and robustly to evolving environments and tasks, enabling precise model‐based control, motion planning and disturbance estimation. However, the identification of a dynamic robot model involves multiple challenges. First, existing friction models cannot accurately characterize torque variance during prolonged robot operations. Second, traditional offline identification methods such as the least squares (LS) method, suffer from over‐fitting when the inertia parameters are unknown a priori. Furthermore, existing online identification approaches, such as sliding LS, fail to meet the accuracy and real‐time requirements of industrial robots. To address these challenges, this article proposes a two‐stage Bayesian framework for rapid offline identification and online updating of industrial robot dynamics. In the offline stage, we developed a recursive sparse Bayesian learning (RSBL) method to select the dominant parameters and discover a thermal‐related nonlinear dynamic friction model from data, which was then used to find a sparser and simpler inertia model. The obtained friction and inertia models were used as prior knowledge for online updating. The RSBL method significantly reduces the computational complexity and runtime, while it also accelerates online model updating. Experimental results for a 6‐DOF medium‐load robot validate dual offline improvements in prediction accuracy and model sparsity, along with higher online prediction accuracy and shorter computational time. [ABSTRACT FROM AUTHOR]

Generalized Autoregressive Conditional Heteroscedasticity (GARCH) model and its variations have been widely adopted in the study of financial volatilities, while the extension of GARCH‐type models to high‐dimensional data is always difficult because of over‐parameterization and computational complexity. In this article, we propose a multi‐variate GARCH‐type model that can simplify the parameterization by utilizing the network structure that can be appropriately specified for certain types of high‐dimensional data. The asymmetry in the dynamics of volatilities is also considered as our model adopts a threshold structure. To enable our model to handle data with extremely high dimension, we investigate the near‐epoch dependence (NED) of our model, and the asymptotic properties of our quasi‐maximum‐likelihood‐estimator (QMLE) are derived from the limit theorems for NED random fields. Simulations are conducted to test our theoretical results. At last we fit our model to log‐returns of four groups of stocks and the results indicate that bad news is not necessarily more influential on volatility if the network effects are considered. [ABSTRACT FROM AUTHOR]

This paper discusses the issue of passivity analysis of the neutral‐type Cohen–Grossberg neural networks (NTCGNNs) with distributed, transmission, and neutral time‐varying delays. A new method based on the system solutions was proposed to analyze passivity. It is important to note that this paper focuses solely on introducing the proposed method and does not provide a comprehensive analysis of NTCGNNs. This method does not require for the construction of Lyapunov–Krasovskii functional (LKF) or model transformation, thus reducing computational effort and complexity. By using this new way and the inequality technique, a passivity criterion for NTCGNNs with multiple time‐varying delays is derived. The applicability of the derived criterion was demonstrated through a numerical example. [ABSTRACT FROM AUTHOR]

Combinatorial optimization (CO) has a broad range of applications in various fields, including operations research, computer science, and artificial intelligence. However, many of these problems are classified as nondeterministic polynomial‐time (NP)‐complete or NP‐hard problems, which are known for their computational complexity and cannot be solved in polynomial time on traditional digital computers. To address this challenge, continuous‐time Ising machine solvers have been developed, utilizing different physical principles to map CO problems to ground state finding. However, most Ising machine prototypes operate at speeds comparable to digital hardware and rely on binarizing node states, resulting in increased system complexity and further limiting operating speed. To tackle these issues, a novel device‐algorithm co‐design method is proposed for fast sub‐optimal solution finding with low hardware complexity. On the device side, a piezoelectric lithium niobate (LiNbO3) microelectromechanical system (MEMS) oscillator network‐based Ising machine without second‐harmonic injection locking (SHIL) is devised to solve Max‐cut and graph coloring problems. The LiNbO3 oscillator operates at speeds greater than 9 GHz, making it one of the fastest oscillatory Ising machines. System‐wise, an innovative grouping method is used that achieves a performance guarantee of 0.878 for Max‐cut and 0.658 for graph coloring problems, which is comparable to Ising machines that utilize binarization. [ABSTRACT FROM AUTHOR]

Current literature on joint optimization of intersection signal timing and connected automated vehicle (CAV) trajectory mostly focuses on vehicular movements paying no or little attention to pedestrians. This paper presents a methodology to safely incorporate pedestrians into signalized intersections with CAVs and connected human‐driven vehicles (CHVs). The movements of vehicles are controlled using both traffic lights and mobile CAV controllers during our newly introduced "white phase." CAVs navigate platoons of CHVs through the intersection when the white phases are active. In addition to optimizing CAV trajectories, the model optimally selects the status of the traffic light signal among white and green indications for vehicular and walk and do‐not‐walk intervals for pedestrian movements. A receding horizon‐based methodology is used to capture the stochastic nature of the problem and to reduce computational complexity. The case study results show the successful operation of fleets consisting of pedestrians, CAVs, and CHVs with various demand levels through isolated intersections. The results also show that increasing the CAV market penetration rate (MPR) can decrease average intersection delay by up to 27%. Moreover, the average pedestrian, CHV, and CAV delays decrease as the CAV MPR increases and reach their minimum values with a fully CAV fleet. In addition, the presence of the white phase can decrease the intersection average delay by up to 14.7%. [ABSTRACT FROM AUTHOR]

Dynamic fault tree (DFT) is a reliable method for modeling complex systems with dynamic characteristics. However, evaluating the reliability of such systems can be complex. The sequential binary decision diagram (SBDD) method simplifies this process by reducing computational complexity. This study investigates factors influencing SBDD size and proposes a new method, the complete priority ordering method, for ordering basic events in SBDDs. Results demonstrate the method's effectiveness in comparison to existing approaches. [ABSTRACT FROM AUTHOR]

Despite the increased brilliance of the new generation synchrotron sources, there is still a challenge with high‐resolution scanning of very thick and absorbing samples, such as a whole mouse brain stained with heavy elements, and, extending further, brains of primates. Samples are typically cut into smaller parts, to ensure a sufficient X‐ray transmission, and scanned separately. Compared with the standard tomography setup where the sample would be cut into many pillars, the laminographic geometry operates with slab‐shaped sections significantly reducing the number of sample parts to be prepared, the cutting damage and data stitching problems. In this work, a laminography pipeline for imaging large samples (>1 cm) at micrometre resolution is presented. The implementation includes a low‐cost instrument setup installed at the 2‐BM micro‐CT beamline of the Advanced Photon Source. Additionally, sample mounting, scanning techniques, data stitching procedures, a fast reconstruction algorithm with low computational complexity, and accelerated reconstruction on multi‐GPU systems for processing large‐scale datasets are presented. The applicability of the whole laminography pipeline was demonstrated by imaging four sequential slabs throughout an entire mouse brain sample stained with osmium, in total generating approximately 12 TB of raw data for reconstruction. [ABSTRACT FROM AUTHOR]

This paper introduces a novel multi‐variate volatility model that can accommodate appropriately defined network structures based on low‐frequency and high‐frequency data. The model offers substantial reductions in the number of unknown parameters and computational complexity. The model formulation, along with iterative multi‐step‐ahead forecasting and targeting parameterization are discussed. Quasi‐likelihood functions for parameter estimation are proposed and their asymptotic properties are established. A series of simulation studies are carried out to assess the performance of parameter estimation in finite samples. Furthermore, a real data analysis demonstrates that the proposed model outperforms the existing volatility models in prediction of future variances of daily return and realized measures. [ABSTRACT FROM AUTHOR]

The assessment and diagnosis of controller performance for model‐based closed‐loop control systems has received considerable attention in recent years. A recognized factor dilapidating the controller performance is mismatching the true dynamical model of the plant and the mathematic model employed in the controller. In order to reduce the heavy effort to re‐identify the entire model, a large amount of recent works have been focusing on locating the mismatch. To further improve the mathematic model as well as controller performance, in this article, we provide a novel prediction‐based plant‐model mismatch quantification approach, which belongs to the class of moment match methodology. In particular, two cases of output prediction are considered: one‐step ahead prediction and multistep ahead prediction. Compared with existing efforts along the same line of mismatch quantification, when using the one‐step ahead prediction, our method shows an advantage of light computational complexity. On the other hand, when utilizing multistep predictions, it shows better convergence and robustness than the former, especially in the case of structural mismatches, and the long‐term prediction capability of the model is employed. With both predictions and consideration of the existence of unknown noise models in practice, we show that the plant‐model mismatch and unknown parameters of noise models can be quantified as the solution of a minimization issue that penalizes the discrepancy between the sample of plant outputs and the predictions calculated by considering the plant‐model mismatch and noise model parameters. Several examples are provided to demonstrate the effectiveness of the proposed methods, respectively. [ABSTRACT FROM AUTHOR]

With the rise of open data, identifiability of individuals based on 3D renderings obtained from routine structural magnetic resonance imaging (MRI) scans of the head has become a growing privacy concern. To protect subject privacy, several algorithms have been developed to de‐identify imaging data using blurring, defacing or refacing. Completely removing facial structures provides the best re‐identification protection but can significantly impact post‐processing steps, like brain morphometry. As an alternative, refacing methods that replace individual facial structures with generic templates have a lower effect on the geometry and intensity distribution of original scans, and are able to provide more consistent post‐processing results by the price of higher re‐identification risk and computational complexity. In the current study, we propose a novel method for anonymized face generation for defaced 3D T1‐weighted scans based on a 3D conditional generative adversarial network. To evaluate the performance of the proposed de‐identification tool, a comparative study was conducted between several existing defacing and refacing tools, with two different segmentation algorithms (FAST and Morphobox). The aim was to evaluate (i) impact on brain morphometry reproducibility, (ii) re‐identification risk, (iii) balance between (i) and (ii), and (iv) the processing time. The proposed method takes 9 s for face generation and is suitable for recovering consistent post‐processing results after defacing. [ABSTRACT FROM AUTHOR]

The gated structure of the long short‐term memory (LSTM) alleviates the defects of gradient disappearance and explosion in the recurrent neural network (RNN). It has received widespread attention in sequence learning such as text analysis. Although LSTM has good performance in handling remote dependencies, information loss often occurs in long‐distance transmission. We propose a new model called ELSTM based on the computational complexity and gradient dispersion in the traditional LSTM model. This model simplifies the input gate of LSTM, reduces some time complexity by reducing some components, and improves the output gate. By introducing the exponential linear unit activation layer, the problem of gradient dispersion is alleviated. Comparing the new model with multiple existing models, when predicting language sequences, the time used by the model has been greatly reduced, and the language confusion has been reduced, showing good performance. [ABSTRACT FROM AUTHOR]

Predicting the remaining useful life (RUL) of an engine is one of the key tasks of Prognostics and health management (PHM). Modern mechanical equipment typically operates in complex operating conditions and fault modes, leading to dispersed distribution of sensor data and challenges for feature extraction. To improve the accuracy of predicting the RUL under the complex scenarios, this paper proposes a multi‐scale convolutional network (CNN) and bidirectional gated recurrent unit (MSC‐BiGRU) mode under a dual path framework with temporal attention. Specifically, the multi‐scale CNN in the first path is to learn complex features, and Swish Activation function is used to improve the prediction ability of the network; the bidirectional gated recurrent unit (BiGRU) in the second path can handle both forward and backward time series, and adaptively capture the importance of outputs at different times using temporal attention, enhancing the model's feature extraction ability in the temporal dimension. A feature fusion mechanism is developed to connect two paths in parallel, overcoming the overfitting and high computational complexity in deep complex models. We verify the effectiveness of the proposed method using a simulated turbofan engine dataset, especially on datasets FD002 and FD004 under complex operating conditions and fault modes, the RMSE values were reduced by 17.37% and 9.97%, respectively, compared to the BiGRU‐TSAM. [ABSTRACT FROM AUTHOR]

Machine learned fault detection approaches are being increasingly used for fault detection in distribution grid. However, the performance of the models can be improved by customizing the models. In this regard, a customised artificial neural network (CANN) for fault detection in a distribution grid is proposed in this paper. The proposed work develops a CANN that combines the "up‐pyramid" and "down‐pyramid" model of ANN into a "custom‐pyramid" model. As a result, the same model can be used both for determining the types of fault as well as its location. The data needed to train the model has been taken from a reconfigured IEEE‐33 bus distribution system developed in Typhoon HIL real‐time simulator. Spectral‐kurtosis is utilized for extraction of features of the faulted transient signals which are used as input data to develop the CANN. The result showcases that the reduction of input features reduces computational complexity without compromising its accuracy. The proposed model classifies fault location with an accuracy of 95.43%. The proposed method also identifies fault type with an accuracy of 96.08%. Several test cases have been developed to test the method. The method proved to be able to perform in most of the cases. [ABSTRACT FROM AUTHOR]

To address the issue of low efficiency caused by the repeated use of quantum attack resistant static identity authentication methods in a satellite integrated smart grid, this paper proposes a quantum attack resistant continuous identity authentication protocol. First, in the initial authentication stage, in order to reduce computational complexity, the key encryption mechanism in the CRYSTALS‐Kyber algorithm was improved and combined with the NTRU message recovery digital signature scheme to construct a lattice based explicit AKE (Kyber NTRU. AKE), which achieved mutual authentication and negotiated shared tokens. Second, in the continuous authentication stage, incorporating quantum attack resistant tokens into the current algorithm to improve authentication efficiency. The formal analysis results indicate that compared to the weakly forward secure Kyber.AKE in the CRYSTALS‐Kyber algorithm, Kyber‐NTRU.AKE achieves complete forward secrecy, while the non‐formal analysis results demonstrate the security of the continuous authentication phase. Through theoretical analysis and efficiency comparison with Cyber.AKE, the analysis shows that the Cyber‐NTRU.AKE has higher computational and communication efficiency than Cyber.AKE. [ABSTRACT FROM AUTHOR]

The purpose of this work is to explore the decrease of total used power in cell‐free millimetre‐wave (mm‐Wave) massive multiple‐input multiple‐output (MIMO) systems, which can be regarded an essential technology for future wireless generations to improve system performance. One of the most important strategies for reducing total power consumption is to activate and deactivate radio frequency (RF) chains at each access point (AP) in the coverage region. Nonetheless, the optimization issue for this methodology is NP‐hard, and an exhaustive search method may be used to determine the ideal number of RF chains at each AP in the cell‐free network. Unfortunately, the exhaustive searching approach is prohibitively complicated, indicating that it is unworkable when there are a significant number of APs in the service region. Furthermore, present RF chain selection approaches prioritize decreasing consumed power and complexity at the price of system performance in terms of total possible rate. This research solves this issue by introducing a unique RF chain selection approach that combines Hungarian and genetic algorithms. The fact that the genetic algorithm (GA) can readily determine the ideal number of active RF chains, yet this technique generally entails significant complexity in large‐scale cell‐free networks, prompted this notion. As a result, the Hungarian method is used early in the GA to overcome the complexity problem while still retaining system performance. In addition, the suggested system employs a semi‐centralized hybrid beamforming architecture in which all analogue combiners for all APs are operated at a central processing unit using channel state information. In addition, each AP has a fully linked phase shifters network and restricted RF chains connecting to its antennas. Finally, simulation findings reveal that, when compared to state‐of‐the‐art techniques, the suggested approach achieves the maximum attainable rate and overall energy efficiency with a tolerable computational complexity. [ABSTRACT FROM AUTHOR]

This paper proposes a new algorithm based on sensitivity analysis and the Wolfe method to solve a sequence of parametric quadratic programming (QP) problems such as those that arise in quadratic model predictive control (QMPC). The Wolfe method, based on Karush–Kuhn–Tucker conditions, has been used to convert parametric QP problems to parametric linear programming (LP) problems, and then the sensitivity analysis is applied to solve the sequence of the parametric LP problems. This strategy obtains sensitivity analysis‐based QMPC (SA‐QMPC) algorithm. It is proved that the computational complexity of SA‐QMPC is O(Nn2)$O(Nn^2)$ for a region of the initial conditions and O(N2n2)$O(N^2n^2)$ for sufficiently small sampling time and all initial conditions, where N$N$ and n$n$ are the horizon time and dimension of the state vector, respectively. Numerical results indicate the potential and properties of the proposed algorithm. [ABSTRACT FROM AUTHOR]

We investigate multitask learning in the context of multivariate linear regression with high dimensional covariates and heavy‐tailed noise, while under the constraint of limited memory. To tackle the computational complexity arising from the non‐smoothness of the quantile loss, we reformulate it as an equivalent least squares loss, which yields robust solutions even in the presence of heavy‐tailed noise. We incorporate a group lasso penalty into the quantile loss to produce sparse solutions, and an accelerated proximal sub‐gradient descent algorithm to speed up the computation while ensuring explicit forms for penalized solutions at each iteration. The proposed algorithm is general and can be applied to similar optimization problems. Moreover, we introduce a communication‐efficient distributed algorithm that guarantees optimal convergence rates after finite communication rounds in cases where computing resources such as memory are insufficient. We also study the theoretical properties of the resultant estimate and relax the widely used model selection consistency assumption on the initial estimate. We demonstrate the effectiveness of our proposal through extensive numerical studies. [ABSTRACT FROM AUTHOR]

Summary: Most of the existing adaptive filter algorithms pay more attention to improving performance while ignoring the computational complexity and the impact of the impulsive environment. When encountering the impulsive noise environments, the performance of traditional nonlinear adaptive filter may be significantly reduced and usually needs high computational cost. Therefore, this article proposes a hyperbolic tangent Leclerc robust nonlinear adaptive filter based on the low complexity decomposable Volterra model (HTLNAF‐DVM). The filter is implemented by imposing a rank‐one structure on the full Volterra model to get a product of linear filters, and employs a hyperbolic tangent Leclerc function as a robust norm to effectively improve the robustness against the impulsive noise. In addition, we give the theoretical analyses of the steady‐state mean‐square performance of the proposed HTLNAF‐DVM. Finally, the simulation results prove that the proposed HTLNAF‐DVM algorithm has better performance than the existing algorithms and fit well with the theory. [ABSTRACT FROM AUTHOR]

A conventional codec aims to increase the compression efficiency for transmission and storage while maintaining video quality. However, as the number of platforms using machine vision rapidly increases, a codec that increases the compression efficiency and maintains the accuracy of machine vision tasks must be devised. Hence, the Moving Picture Experts Group created a standardization process for video coding for machines (VCM) to reduce bitrates while maintaining the accuracy of machine vision tasks. In particular, in‐loop filters have been developed for improving the subjective quality and machine vision task accuracy. However, the high computational complexity of in‐loop filters limits the development of a high‐performance VCM architecture. We analyze the effect of an in‐loop filter on the VCM performance and propose a suboptimal VCM method based on the selective activation of in‐loop filters. The proposed method reduces the computation time for video coding by approximately 5% when using the enhanced compression model and 2% when employing a Versatile Video Coding test model while maintaining the machine vision accuracy and compression efficiency of the VCM architecture. [ABSTRACT FROM AUTHOR]

In this study, a direct position tracking method for non‐circular (NC) signals using distributed passive arrays is proposed. First, we calculate the initial positions of sources using a direct position determination (DPD) approach; next, we transform the tracking into a compensation problem. The offsets of the adjacent time positions are calculated using a first‐order Taylor expansion. The fusion calculation of the noise subspace is performed according to the NC characteristics. Because the proposed method uses the signal information from the previous iteration, it can realize automatic data associations. Compared with traditional DPD and two‐step localization methods, our novel process has lower computational complexity and provides higher accuracy. Moreover, its performance is better than that of the traditional tracking methods. Numerous simulation results support the superiority of our proposed method. [ABSTRACT FROM AUTHOR]

In the equal maximum flow problem (EMFP), we aim for a maximum flow where we require the same flow value on all arcs in some given subsets of the arc set, so called homologous arc sets. In this article, we study the closely related almost equal maximum flow problems (AEMFP) where the flow values on arcs of one homologous arc set differ at most by the valuation of a so called deviation function Δ$$ \Delta $$. We prove that the integer AEMFP is in general 풩풫‐complete, and show that even the problem of finding a fractional maximum flow in the case of convex deviation functions is also 풩풫‐complete. This is in contrast to the EMFP, which is polynomial time solvable in the fractional case. Additionally, we provide inapproximability results for the integral AEMFP. For the (fractional) concave AEMFP we state a strongly polynomial algorithm for the linear and concave piecewise polynomial deviation function case for a fixed number of homologous sets using a parametric search approach. [ABSTRACT FROM AUTHOR]

In this paper, we introduce deep learning (DL)‐based backlight extraction methods for local dimming display. The main objective is to better handle the trade‐off between the displayed image quality and power consumption. To this end, we propose an enhanced power regularization. Moreover, we design a smaller model with reduced computational complexity and propose an efficient post‐processing for better generalization. Experimental results show that the proposed methods reduce power consumption while better maintaining the image quality than the selected benchmarks. [ABSTRACT FROM AUTHOR]

This paper proposes an image encryption algorithm based on combined 1D chaotic maps. First, a permutation technique was applied. It was then reorganized into 1D matrices along the rows and columns respectively, which were then shuffled by computing the substituted position indices to obtain the scrambled image. Subsequently, a method of confusion of the scrambled image was used through another generated data map, combined with random sub‐matrices for diffusion, then resulting in an encrypted image. Finally, the proposed cryptosystem was implemented in a single kernel platform developed using the Nios II Software Build Tools processor for Eclipse. A hardware architecture was designed using the Qsys‐built tool which is available in the Quartus II 13.0sp1 environment. The developed single‐core system was implemented using the Cyclone IV EP4CE6E22C8. Robustness evaluation of the cryptosystem was performed through security analysis tests such as histogram analysis, correlation coefficient, differential analysis, and key space analysis to prove that it is of good quality, efficient, fast, and successfully resisting brute force attacks. The hardware performance analysis was also carried out. Then the cryptosystem is compared with those in the literature both in the hardware and security performance aspects. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surface (RIS) can provide unprecedented spectral efficiency gains and excellent ability to manipulate electromagnetic waves. This article considered a RIS‐assisted multiuser multiple‐input multiple‐output (MIMO) downlink system, where the beamforming at the base station and RIS are jointly designed to maximize the sum‐rate. For the large dimension scenario and high‐rank beamforming matrix, the accurate deterministic approximations from random matrix theory are then utilized to simplify the RIS‐assisted MIMO systems. The asymptotical signal‐to‐interference‐plus‐noise ratio values obtained through random matrix theory is infinitely close to the theoretical limits calculated by accurately iteration. And the performance of the proposed algorithm computed via the sharing second‐order channel statistics matches that of the RIS algorithm with sharing full channel state information asymptotically. The deterministic approximations are instrumental to get improvement into the structure of the optimal beamforming and to reduce the implementation complexity in large‐scale MIMO system. Numerical simulations results are provided to evaluate and verify the accuracy of the asymptotic results obtained from the proposed algorithm in the finite system regime. With the complex operation process of large dimension matrix reducing to the deterministic approximations, a lower computational complexity can be obtained compared with other methods. [ABSTRACT FROM AUTHOR]

In this article, we present two resilient algorithms, the improved alternative hard c‐means (IAHCM) and the improved alternative fuzzy c‐means (IAFCM). We implement the Gaussian distance‐dependent function proposed by Zhang and Chen (D.‐Q. Zhang and Chen, 2004). In some cases, Zhang and Chen's metric distance does not account for the clustering centroid effect predicted by the large value. R* is employed in IAHCM and IAFCM to discover robust results while minimizing its sensitivity. Experiments are conducted using two‐and three‐dimensional data, including Diamond and Iris real‐world data. The results are based on demonstrating the robust simplicity and applicability of the offered algorithms. Similarly, computational complexity is assessed. [ABSTRACT FROM AUTHOR]