Adaptive Hierarchical Collocation Method for Solving Fractional Population Diffusion Model by Linqiang Yang, Yafei Liu, Hongmei Ma, Xue Liu, Shuli Mei

“…The algorithm’s complexity analysis illustrates the concise function’s efficiency advantage over the original expression when solving time-fractional PDEs. …”
Get full text

A Heuristic Algorithm for Solving Triangle Packing Problem by Ruimin Wang, Yuqiang Luo, Jianqiang Dong, Shuai Liu, Xiaozhuo Qi

“…It is demonstrated that the proposed algorithm is highly efficient, and by the time complexity analysis and the analogue experiment result is found.…”
Get full text

A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles by Ruimin Wang, Xiaozhuo Qi, Yuqiang Luo, Jianqiang Dong

“…Some new concepts are put forward such as side-clinging action, and an approximation algorithm for solving the addressed problem is designed. Time complexity analysis and the calculation results indicate that the proposed method is a polynomial time algorithm, which provides the possibility to solve the packing problem of arbitrary triangles.…”
Get full text

Optimization design and simplified decoding for short frame CCPM by Xiao-jie DAI, Ya-feng ZHAN

“…Considering the demand of burst communications,optimization and simplified decoding for coded GMSK sys-tem in short frame was focused on to give an optimum proposal of C²PPM system.Simplified demodulator,optimized generation polynomial of the convolution code and matched interleavers were discussed.Simulation results show that for coded GMSK system under AWGN,the performance is better than individual convolution code.Especially when BER is 1×10^-5,it performs better than Turbo code and LDPC code with the same frame length,and there is no error floor occur-ring.Finally,complexity analysis shows that the coded GMSK system has lower implementation complexity in compari-son with the commonly used convolution code,Turbo code and LDPC code.…”
Get full text

Blockchain-based result-traceable searchable encryption scheme by Xinyao WENG, Lin YOU, Tingting LAN

“…In a searchable encryption scheme,whether it is a cloud server or a user,it may be deceptive.In order to solve the security problem,the definition of fairness security was given and a new searchable encryption scheme based on blockchain was proposed.Through the third-party trusted authority to verify the consistency of data during data transmission,the complete verification results were recorded on the blockchain to prevent tampering,and it could make all the related entities to reach the consistent security consensus and achieve the fairness security.The security and complexity analysis show that the proposed searchable encryption scheme was feasible.If it is combined with a searchable encryption scheme with its searched results verifiable,the proposed scheme can be effectively improved to be a blockchain-based searchable encryption scheme with its searched results verifiable and its security will be more strengthened.…”
Get full text

The Blockchain Trilemma: A Formal Proof of the Inherent Trade-Offs Among Decentralization, Security, and Scalability by Souhail Mssassi, Anas Abou El Kalam

“…Our analysis includes a proof by contradiction and computational complexity analysis. This work aims to deepen the understanding of the fundamental limitations of blockchain technology, offering insights for future innovations and helping navigate the inevitable trade-offs.…”
Get full text

A Novel SLM Scheme for PAPR Reduction in OFDM Systems by Tian-Ming Ma, Yu-Song Shi, Ying-Guan Wang

“…The novel scheme requires only one IFFT and gets more candidate transmission signals throughout the entire process. The complexity analysis and simulation results show that this algorithm can dramatically reduce computational complexity comparing with the conventional SLM scheme as in Hill et al., 2000; Yang et al., 2009; Wang and Ouyang, 2005; Li et al., 2010; and Heo et al., 2007 under the similar PAPR reduction performance.…”
Get full text

Fitness centrality: a non-linear centrality measure for complex networks by Vito D P Servedio, Alessandro Bellina, Emanuele Calò, Giordano De Marzo

“…By broadening the scope of economic complexity analysis to diverse network structures, this work expands the applicability and robustness of EFC in complexity science.…”
Get full text

An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem by Weizhen Rao, Feng Liu, Shengbin Wang

“…We present a mixed integer programming model for the FCVRP, and fuel consumption is measured through the degree of road gradient. Complexity analysis of FCVRP is presented through analogy with the capacitated VRP. …”
Get full text

A Bionic Social Learning Strategy Pigeon-Inspired Optimization for Multi-Unmanned Aerial Vehicle Cooperative Path Planning by Yankai Shen, Xinan Liu, Xiao Ma, Hong Du, Long Xin

“…The paper also proves the algorithm’s convergence and provides complexity analysis. Comparison experiments demonstrate that the proposed method searches for the optimal solution while guaranteeing fast convergence. …”
Get full text

Novel and Efficient Randomized Algorithms for Feature Selection by Zigeng Wang, Xia Xiao, Sanguthevar Rajasekaran

“…We conduct theoretical computational complexity analysis and further explain our algorithms’ generic parallelizability. …”
Get full text

Joint beamforming design for distributed IRS assisted millimeter wave MU-MISO system by Zhongjie LI, Jiyuan XIONG, Wei GAO, Jinying WEI

“…A joint beamforming design scheme for distributed intelligent reflecting surface (IRS) assisted multi-user communication was proposed to solve the reliable communication problem in the downlink of millimeter-wave multi user-multiple input single output (MU-MISO) system in non line of sight scenarios.Considering the power and constant-mode constraints, the active beamforming of the base station and passive beamforming of multiple IRS were modeled as a joint non-convex optimization problem with the objective of user weighting and sum rate maximization.A closed-form fractional programming technique was used to decouple this joint optimization problem into an easily solvable equivalent problem.A non-convex block coordinate descent algorithm was used to alternately optimize the active beamforming and passive beamforming matrices according to the prox-linear rule and the distributed successive convex approximation rule.The convergence proof and complexity analysis of the proposed algorithm were also given.The simulation results demonstrate that the algorithm can converge fast, and can effectively improve the system transmission rate with reduced complexity compared with the two baseline algorithms.…”
Get full text

Improved Clonal Selection Algorithm Based on Biological Forgetting Mechanism by Chao Yang, Bing-qiu Chen, Lin Jia, Hai-yang Wen

“…Compared with the existing clonal selection and genetic algorithms, the experiment and time complexity analysis show that the algorithm has good optimization efficiency and stability.…”
Get full text

Identifying vital spreaders in large-scale networks based on neighbor multilayer contributions by Weiwei Zhu, Xuchen Meng, Jiaye Sheng, Dayong Zhang

“…These tests demonstrated the effectiveness of our proposed algorithm in identifying influential spreaders accurately.DiscussionFurthermore, computational complexity analysis indicates that our algorithm consumes less time compared to existing methods, suggesting it can be efficiently applied to large-scale networks.…”
Get full text

λ-Augmented Tree for Robust Data Collection in Advanced Metering Infrastructure by Joseph Kamto, Lijun Qian, Wei Li, Zhu Han

“…Detailed algorithms to create such AMI tree and related theoretical and complexity analysis are provided with insightful simulation results: sufficient redundancy is provided to alleviate data loss at the cost of signaling overhead. …”
Get full text

Recognizing Boundaries in Wireless Sensor Networks Based on Local Connectivity Information by Baoqi Huang, Wei Wu, Guanglai Gao, Tao Zhang

“…In addition, a message complexity analysis confirms the energy efficiency of the proposed algorithm. …”
Get full text

A hybrid machine learning model for intrusion detection in wireless sensor networks leveraging data balancing and dimensionality reduction by Md. Alamin Talukder, Majdi Khalid, Nasrin Sultana

“…This hybrid approach addresses class imbalance and high-dimensionality challenges, providing scalable and robust intrusion detection. Complexity analysis reveals that the proposed model reduces training and prediction times, making it suitable for real-time applications.…”
Get full text

Recent progress in the security evaluation of multivariate public‐key cryptography by Yasuhiko Ikematsu, Shuhei Nakamura, Tsuyoshi Takagi

“…In particular, the authors provide a detailed description of the complexity analysis for solving the bi‐graded polynomial systems studied independently by Nakamura et al. and Smith‐Tone et al., and then expound the rectangular MinRank attack against Rainbow proposed by Beullens.…”
Get full text

Is human-like decision making explainable? Towards an explainable artificial intelligence for autonomous vehicles by Jiming Xie, Yan Zhang, Yaqin Qin, Bijun Wang, Shuai Dong, Ke Li, Yulan Xia

“…In the second stage, we draw inspiration from the field of brain-like trusted AI to construct a robust, in-depth, and unbiased evaluation and interpretability framework involving three dimensions: Permutation Importance (PI) analysis, Partial Dependence Plot (PDP) analysis, and model complexity analysis. An empirical investigation using real driving trajectory data from Kunming, China, confirms the ability of our approach to predict potential driving decisions with high accuracy while providing the rationale implicit AV decisions. …”
Get full text

Central DOA Estimation Method for Exponential-Type Coherent Distributed Source Based on Fourth-Order Cumulant by Hao Li, Weijia Cui, Bin Ba, Haiyun Xu, Yankui Zhang

“…The accuracy and DOF of the proposed algorithm are higher than those of the distributed signal parameter estimator (DSPE) algorithm and least-squares estimation signal parameters via rotational invariance techniques (LS-ESPRIT) algorithm when the array elements are the same. Complexity analysis and numerical simulations are provided to demonstrate the superiority of the proposed method.…”
Get full text