期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到253,605篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
UAV trajectory planning based on improved bidirectional RRT algorithm 认领 引用 被引量：2
1
作者 WANG Mengqiao LIU Erlin 《Journal of Measurement Science and Instrumentation》 CAS CSCD 2025年第4期578-587,共10页
In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional R... In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional RRT algorithm used for unmanned aerial vehicle(UAV)path planning in complex environments,an improved bidirectional RRT algorithm was proposed.The algorithm firstly adopted a goal-oriented strategy to guide the sampling points towards the target point,and then the artificial potential field acted on the random tree nodes to avoid collision with obstacles and reduced the length of the search path,and the random tree node growth also combined the UAV’s own flight constraints,and by combining the triangulation method to remove the redundant node strategy and the third-order B-spline curve for the smoothing of the trajectory,the planned path was better.The planned paths were more optimized.Finally,the simulation experiments in complex and dynamic environments showed that the algorithm effectively improved the speed of trajectory planning and shortened the length of the trajectory,and could generate a safe,smooth and fast trajectory in complex environments,which could be applied to online trajectory planning. 展开更多
关键词 complex environment bidirectional RRT algorithm target orientation strategy artificial potential field method triangular inequality cut cubic B-spline online trajectory planning
暂未订购 下载PDF
An Analysis of the Bidirectional Shaping Mechanism Between Short-Video Algorithms and Film Narrative Driven by the Attention Economy 认领 引用
2
作者 Zhaoyang Dong Shibo Zhang 《Proceedings of Business and Economic Studies》 2025年第5期32-38,共7页
This study examines the bidirectional shaping mechanism between short-video algorithms and film narratives within the attention economy.It investigates how algorithmic logic influences cinematic storytelling and how f... This study examines the bidirectional shaping mechanism between short-video algorithms and film narratives within the attention economy.It investigates how algorithmic logic influences cinematic storytelling and how films,in turn,contribute to the aesthetic enhancement of short-video content.Drawing on Communication Accommodation Theory and Berry’s Acculturation Theory,along with case analyses and industry data,this research demonstrates that algorithms push films toward high-stimulus,fast-paced narrative patterns—characterized by increased shot density and structural fragmentation—to capture and retain viewer attention.Conversely,films counter this influence by supplying narratively deep and artistically refined content that elevates short-video aesthetics and encourages critical audience engagement.This dynamic reflects a process of mutual adaptation rather than one-sided dominance.The study concludes that such interaction signifies a broader restructuring of cultural production logic,facilitating cross-media convergence while simultaneously posing risks to cultural diversity due to the prioritization of high-traffic content.Balancing this relationship will require policy support,algorithmic transparency,and strengthened industry self-regulation to preserve artistic integrity and cultural ecosystem diversity. 展开更多
关键词 Short-video algorithm Film narrative Bidirectional shaping Cultural production logic Attention economy
暂未订购 下载PDF
Design and Implementation of Bidirectional Dijkstra Algorithm 认领 引用 被引量：7
3
作者 付梦印 李杰 周培德 《Journal of Beijing Institute of Technology》 EI CAS 2003年第4期366-370,共5页
Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The alg... Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The algorithm takes advantage of the adjacent link and the mechanism of bidirectional search, that is, the algorithm processes the positive search from start point to destination point and the negative search from destination point to start point at the same time. Finally, combining with the practical application of route-planning algorithm in embedded real-time vehicle navigation system (ERTVNS), one example of its practical applications is given, analysis in theory and the experimental results show that compared with the Dijkstra algorithm, the new algorithm can reduce time complexity, and guarantee the searching precision, it satisfies the needs of ERTVNS. 展开更多
关键词 vehicle navigation system route-planning the shortest path Dijkstra algorithm bidirectional Dijkstra algorithm
暂未订购 下载PDF
Improved Bidirectional JPS Algorithm for Mobile Robot Path Planning in Complex Environments 认领 引用
4
作者 Zhaohui An Changyong Li +1 位作者 Yong Han Mengru Niu 《Computers, Materials & Continua》 SCIE EI 2025年第4期1347-1366,共20页
This paper introduces an Improved Bidirectional Jump Point Search(I-BJPS)algorithm to address the challenges of the traditional Jump Point Search(JPS)in mobile robot path planning.These challenges include excessive no... This paper introduces an Improved Bidirectional Jump Point Search(I-BJPS)algorithm to address the challenges of the traditional Jump Point Search(JPS)in mobile robot path planning.These challenges include excessive node expansions,frequent path inflexion points,slower search times,and a high number of jump points in complex environments with large areas and dense obstacles.Firstly,we improve the heuristic functions in both forward and reverse directions to minimize expansion nodes and search time.We also introduce a node optimization strategy to reduce non-essential nodes so that the path length is optimized.Secondly,we employ a second-order Bezier Curve to smooth turning points,making generated paths more suitable for mobile robot motion requirements.Then,we integrate the Dynamic Window Approach(DWA)to improve path planning safety.Finally,the simulation results demonstrate that the I-BJPS algorithm significantly outperforms both the original unidirectional JPS algorithm and the bidirectional JPS algorithm in terms of search time,the number of path inflexion points,and overall path length,the advantages of the I-BJPS algorithm are particularly pronounced in complex environments.Experimental results from real-world scenarios indicate that the proposed algorithm can efficiently and rapidly generate an optimal path that is safe,collision-free,and well-suited to the robot’s locomotion requirements. 展开更多
关键词 Bidirectional jump search heuristic function bezier curve dynamic window method path planning
暂未订购 下载PDF
Direct P-code acquisition algorithm based on bidirectional overlap technique 认领 引用 被引量：3
5
作者 Ying Xu Lijuan Xu +1 位作者 Hong Yuan Ruidan Luo 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2014年第4期538-546,共9页
According to the signal-to-noise ratio （SNR） loss of average algorithms in direct P-code acquisition method, this paper analyzes the SNR performance of the overlap average algorithm quantitatively, and derives the r... According to the signal-to-noise ratio （SNR） loss of average algorithms in direct P-code acquisition method, this paper analyzes the SNR performance of the overlap average algorithm quantitatively, and derives the relationship of SNR loss with overlap shift value and initial average phase difference in the overlap average algorithm. On this basis, the bidirectional overlap average algorithm based on optimal correlation SNR is proposed. The algorithm maintains SNR consistent in the entire initial average phase difference space, and has a better SNR performance than the overlap average algorithm. The effectiveness of the algorithm is verified by both theoretical analysis and simulation results. The SNR performance of the bidirectional overlap average algorithm is 5 dB better than that of the direct average algorithm, and 2 dB better than that of the overlap average algorithm, which provides the support for direct P-code acquisition in low SNR. 展开更多
关键词 P-code direct acquisition direct average algorithm,bidirectional overlap algorithm.
暂未订购 下载PDF
A real-time prediction method for tunnel boring machine cutter-head torque using bidirectional long short-term memory networks optimized by multi-algorithm 认领 引用 被引量：15
6
作者 Xing Huang Quantai Zhang +4 位作者 Quansheng Liu Xuewei Liu Bin Liu Junjie Wang Xin Yin 《Journal of Rock Mechanics and Geotechnical Engineering》 SCIE CSCD 2022年第3期798-812,共15页
Based on data from the Jilin Water Diversion Tunnels from the Songhua River(China),an improved and real-time prediction method optimized by multi-algorithm for tunnel boring machine(TBM)cutter-head torque is presented... Based on data from the Jilin Water Diversion Tunnels from the Songhua River(China),an improved and real-time prediction method optimized by multi-algorithm for tunnel boring machine(TBM)cutter-head torque is presented.Firstly,a function excluding invalid and abnormal data is established to distinguish TBM operating state,and a feature selection method based on the SelectKBest algorithm is proposed.Accordingly,ten features that are most closely related to the cutter-head torque are selected as input variables,which,in descending order of influence,include the sum of motor torque,cutter-head power,sum of motor power,sum of motor current,advance rate,cutter-head pressure,total thrust force,penetration rate,cutter-head rotational velocity,and field penetration index.Secondly,a real-time cutterhead torque prediction model’s structure is developed,based on the bidirectional long short-term memory(BLSTM)network integrating the dropout algorithm to prevent overfitting.Then,an algorithm to optimize hyperparameters of model based on Bayesian and cross-validation is proposed.Early stopping and checkpoint algorithms are integrated to optimize the training process.Finally,a BLSTMbased real-time cutter-head torque prediction model is developed,which fully utilizes the previous time-series tunneling information.The mean absolute percentage error(MAPE)of the model in the verification section is 7.3%,implying that the presented model is suitable for real-time cutter-head torque prediction.Furthermore,an incremental learning method based on the above base model is introduced to improve the adaptability of the model during the TBM tunneling.Comparison of the prediction performance between the base and incremental learning models in the same tunneling section shows that:(1)the MAPE of the predicted results of the BLSTM-based real-time cutter-head torque prediction model remains below 10%,and both the coefficient of determination(R2)and correlation coefficient(r)between measured and predicted values exceed 0.95;and(2)the incremental learning method is suitable for realtime cutter-head torque prediction and can effectively improve the prediction accuracy and generalization capacity of the model during the excavation process. 展开更多
关键词 Tunnel boring machine(TBM) Real-time cutter-head torque prediction Bidirectional long short-term memory (BLSTM) Bayesian optimization Multi-algorithm fusion optimization Incremental learning
暂未订购 下载PDF
Bidirectional Viterbi Decoding Algorithm for OvTDM 认领 引用
7
作者 Haocheng Wang Yafeng Wang 《China Communications》 SCIE CSCD 2020年第4期194-204,共11页
Overlapped time domain multiplexing(OvTDM)is an innovative encoding scheme that can obtain high spectral efficiency.However,the intentional inter-symbol interference(ISI)caused by OvTDM will make the decoding process ... Overlapped time domain multiplexing(OvTDM)is an innovative encoding scheme that can obtain high spectral efficiency.However,the intentional inter-symbol interference(ISI)caused by OvTDM will make the decoding process more complex.The computational complexity of maximum likelihood sequence detection increases exponentially with the growth of spectral efficiency in OvTDM.As a consequence of high complexity,the decoding effort for a given spectral efficiency may occasionally exceed the physical limitations of the decoder,leading inevitably to buffer overflows and information erasures.In this paper,we propose a bidirectional Viterbi algorithm(BVA)based on the bidirectional sequence decoding for OvTDM.With the BVA,the decoding operation starts simultaneously from the both ends of the corresponding trellis and stops at the middle of trellis.The simulation results show that compared with Viterbi algorithm(VA),the decoding time of BVA can be reduced by about half.And the memory space of two decoders in BVA are about half of that in VA,which means that the BVA has lower memory requirements for decoder.And the decoding performance of BVA is almost the same as VA. 展开更多
关键词 overlapped time domain multiplexing(OvTDM) Viterbi algorithm(VA) bidirectional Viterbi algorithm(BVA) decoding performance
暂未订购 下载PDF
Optimization of Truss Structures Using Nature-Inspired Algorithms with Frequency and Stress Constraints 认领 引用 被引量：1
8
作者 Sanjog Chhetri Sapkota Liborio Cavaleri +3 位作者 Ajaya Khatri Siddhi Pandey Satish Paudel Panagiotis G.Asteris 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第1期436-464,共29页
Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises stru... Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises structural weight under stress and frequency constraints.Two new algorithms,the Red Kite Optimization Algorithm(ROA)and Secretary Bird Optimization Algorithm(SBOA),are utilized on five benchmark trusses with 10,18,37,72,and 200-bar trusses.Both algorithms are evaluated against benchmarks in the literature.The results indicate that SBOA always reaches a lighter optimal.Designs with reducing structural weight ranging from 0.02%to 0.15%compared to ROA,and up to 6%–8%as compared to conventional algorithms.In addition,SBOA can achieve 15%–20%faster convergence speed and 10%–18%reduction in computational time with a smaller standard deviation over independent runs,which demonstrates its robustness and reliability.It is indicated that the adaptive exploration mechanism of SBOA,especially its Levy flight–based search strategy,can obviously improve optimization performance for low-and high-dimensional trusses.The research has implications in the context of promoting bio-inspired optimization techniques by demonstrating the viability of SBOA,a reliable model for large-scale structural design that provides significant enhancements in performance and convergence behavior. 展开更多
关键词 Optimization truss structures nature-inspired algorithms meta-heuristic algorithms red kite opti-mization algorithm secretary bird optimization algorithm
暂未订购 下载PDF
A Novel Hybrid Sine Cosine-Flower Pollination Algorithm for Optimized Feature Selection 认领 引用
9
作者 Sumbul Azeem Shazia Javed +3 位作者 Farheen Ibraheem Uzma Bashir Nazar Waheed Khursheed Aurangzeb 《Computers, Materials & Continua》 SCIE EI 2026年第5期1916-1930,共15页
Data serves as the foundation for training and testing machine learning and artificial intelligencemodels.The most fundamental part of data is its attributes or features.The feature set size changes from one dataset t... Data serves as the foundation for training and testing machine learning and artificial intelligencemodels.The most fundamental part of data is its attributes or features.The feature set size changes from one dataset to another.Only the relevant features contributemeaningfully to classificationaccuracy.The presence of irrelevant features reduces the system’s effectiveness.Classification performance often deteriorates on high-dimensional datasets due to the large search space.Thus,one of the significant obstacles affecting the performance of the learning process in the majority of machine learning and data mining techniques is the dimensionality of the datasets.Feature selection(FS)is an effective preprocessing step in classification tasks.The aim of applying FS is to exclude redundant and unrelated features while retaining the most informative ones to optimize classification capability and compress computational complexity.In this paper,a novel hybrid binary metaheuristic algorithm,termed hSC-FPA,is proposed by hybridizing the Flower Pollination Algorithm(FPA)and the Sine Cosine Algorithm(SCA).Hybridization controls the exploration capacity of SCA and the exploitation behavior of FPA to maintain a balanced search process.SCA guides the global search in the early iterations,while FPA’s local pollination refines promising solutions in later stages.A binary conversion mechanism using a threshold function is implemented to handle the discrete nature of the feature selection problem.The functionality of the proposed hSC-FPA is authenticated on fourteen standard datasets from the UCI repository using the K-Nearest Neighbors(K-NN)classifier.Experimental results are benchmarked against the standalone SCA and FPA algorithms.The hSC-FPA consistently achieves higher classification accuracy,selects a more compact feature subset,and demonstrates superior convergence behavior.These findings support the stability and outperformance of the hybrid feature selection method presented. 展开更多
关键词 Classification algorithms feature selection process flower pollination algorithm hybrid model metaheuristics multi-objective optimization search algorithm sine cosine algorithm
暂未订购 下载PDF
Program Construction Method for Sequential Statistics Class Algorithm Based on Bidirectional Scanning Induction 认领 引用
10
作者 ZUO Zhengkang WANG Yuekun +4 位作者 LIANG Zanyang SU Wei HUANG Qing WANG Yuan WANG Changjing 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2023年第6期483-492,共10页
The program construction process is based on rigorous mathematical reasoning,which leads to a fully correct algorithmic program via step-by-step refinement of the program specifications.The existing program constructi... The program construction process is based on rigorous mathematical reasoning,which leads to a fully correct algorithmic program via step-by-step refinement of the program specifications.The existing program construction methods'refinement process is partly based on individual subjective speculation and analysis,which lacks a precise guidance method.Meanwhile,efficiency factors have usually been ignored in the construction process,and most of the constructed abstract programs cannot be run directly by machines.In order to solve these problems,a novel program construction method for the sequence statistical class algorithms based on bidirectional scan induction is proposed in this paper.The method takes into account the efficiency factor and thus improves the Morgan's refinement calculus.Furthermore,this paper validates the method's feasibility using an efficiency-sensitive sequential statistics class algorithm as a program construction example.The method proposed in this paper realizes the correctness construction process from program specifications to efficient executable programs. 展开更多
关键词 program construction bidirectional scanning induction sequential statistics Morgan's refinement calculus
暂未订购 下载PDF
3D Model Encryption Algorithm by Parallel Bidirectional Diffusion and 1D Map with Sin and Logistic Coupling 认领 引用
11
作者 Yongsheng Hu 《Computer Systems Science & Engineering》 SCIE EI 2023年第11期1819-1838,共20页
3D models are essential in virtual reality,game development,architecture design,engineering drawing,medicine,and more.Compared to digital images,3D models can provide more realistic visual effects.In recent years,sign... 3D models are essential in virtual reality,game development,architecture design,engineering drawing,medicine,and more.Compared to digital images,3D models can provide more realistic visual effects.In recent years,significant progress has been made in the field of digital image encryption,and researchers have developed new algorithms that are more secure and efficient.However,there needs to be more research on 3D model encryption.This paper proposes a new 3D model encryption algorithm,called the 1D map with sin and logistic coupling(1D-MWSLC),because existing digital image encryption algorithms cannot be directly applied to 3D models.Firstly,this paper introduce 1D-MWSLC,which has a wider range of parameters compared to traditional 1D chaotic systems.When the parameter exceeds a specific range,the chaotic phenomenon does not weaken.Additionally,1D-MWSLC has two control parameters,which increases the cryptosystem’s parameter space.Next,1D-MWSLC generates keystreams for confusion and diffusion.In the confusion stage,this paper use random confusion,and the keystream generates an index matrix that confuses the integer and decimal parts of the 3D model simultaneously.In the diffusion stage,this paper use parallel bidirectional diffusion to simultaneously diffuse the integer parts of the three coordinates of the 3D model.Finally,this paper verify the proposed algorithm through statistical analysis,and experimental results demonstrate that the proposed 3D model encryption algorithm has robust security. 展开更多
关键词 Parallel bidirectional diffusion chaos theory 1D-MWSLC image encryption information security
暂未订购 下载PDF
A dynamic bidirectional heuristic trust path search algorithm 认领 引用 被引量：1
12
作者 Jiaying Che Xiangrong Tong Lei Yu 《CAAI Transactions on Intelligence Technology》 SCIE EI 2022年第3期340-353,共14页
Online social networks greatly promote peoples'online interaction,where trust plays a crucial role.Trust prediction with trust path search is widely used to help users find the trusted friends and obtain valid inf... Online social networks greatly promote peoples'online interaction,where trust plays a crucial role.Trust prediction with trust path search is widely used to help users find the trusted friends and obtain valid information.However,the shortcomings of accuracy and time still exist in some famous algorithms.Therefore,the dynamic bidirectional heuristic search(DBHS)algorithm is proposed in this paper to find the reliable trust path by studying the heuristic search.First,the trust value and path length are comprehensively considered to find the most trusted user.Specially,it constrains the traversal depth based on the‘small world’theory and obtains the acceptable path set by using the relaxation coefficientλto relax the depth of the shortest path.By this way,some longer path with the higher trust can be considered to improve the precision of algorithm.Then,an adjustment factor is designed based on the meet in the middle(MM)algorithm to assign search weights to two directions based on the size of the search tree expanded,so as to improve the problem of no priori when fixed parameters are used.Besides,the complexity of unidirectional trust path search can also be reduced by searching from two directions,which can reduce the depth and improve the efficiency of search.Finally,the predictive trust degree is outputted by the trust propagation function.Two public datasets are used to generate experimental results,which show that DBHS can quickly search and form reliable trust relationship,and it partly improves other algorithms. 展开更多
关键词 directions algorithm dynamic
暂未订购 下载PDF
Comment on“Association Between Androgenic Alopecia and Schizophrenia:A Bidirectional Mendelian Randomization Study” 认领 引用
13
作者 Bilal Ahmad Abdur Rehman +2 位作者 Noaman Khan Waheed Khan Munawara Zeb 《International Journal of Dermatology and Venereology》 CSCD 2026年第1期73-74,共2页
Dear Editor,We read with interest the study by Wu et al.,1 pub-lished in the International Journal of Dermatology and Venereology,titled“Association Between Androgenic Alopecia and Schizophrenia:A Bidirectional Mende... Dear Editor,We read with interest the study by Wu et al.,1 pub-lished in the International Journal of Dermatology and Venereology,titled“Association Between Androgenic Alopecia and Schizophrenia:A Bidirectional Mendelian Randomization Study.”The study presents a bidirectional Mendelian ran-domization(MR)analysis conducted to investigate the potential causal relationship between androgenic alope-cia(AGA)and schizophrenia,utilizing both forward and reverse MR approaches. 展开更多
关键词 androgenic alopecia bidirectional mendelian randomization study schizophrenia forward reverse mr approaches bidirectional mendelian randomization bidirectional mendelian study
Propagation Alongside Crossover:An Evolutionary Algorithm for Continuous Optimization and Feature Selection 认领 引用
14
作者 Najibeh Farzi-Veijouyeh Vahideh Sahargahi Neda Matin 《Journal of Bionic Engineering》 SCIE EI CSCD 2026年第2期1112-1175,共64页
Researchers continuously advance optimization algorithms,recognizing that no meta-heuristic can solve all problem types,as stated by the No Free Lunch theorem.This paper introduces the Propagation alongside Crossover(... Researchers continuously advance optimization algorithms,recognizing that no meta-heuristic can solve all problem types,as stated by the No Free Lunch theorem.This paper introduces the Propagation alongside Crossover(PAC)algorithm to address continuous optimization challenges.The primary goal of PAC is to structure the algorithmic phases in a manner that achieves a robust balance between exploration and exploitation through appropriately designed mechanisms at each stage.PAC simultaneously leverages the benefits of propagation,crossover,and mutation.Three independent operators are defined to generate new candidate solutions separately,and a novel selection strategy allows individuals produced by each operator,along with members of the current population,to independently enter the next generation.This design preserves population diversity,prevents all individuals from converging toward a single point,and enhances the algorithm’s ability to explore the solution space effectively.A key innovation of PAC is its three-mode propagation mechanism,which comprises local search,linear propagation toward the target point,and tear-drop shaped propagation toward the target point.Tear-drop propagation provides a precise and adaptive search around promising solutions,increasing diversity and preventing entrapment in local optima.The target point is typically set as the global optimum;however,when propagating the global optimum itself,a random point is used as the target to further enhance exploration and escape from local optima.The initial population is generated using chaotic mapping to ensure broad coverage of the search space.PAC was rigorously evaluated on 51 benchmark functions and three engineering problems,considering scalability,convergence,sensitivity,and computational efficiency.Comparative analyses with established optimization algorithms demonstrate PAC’s superior performance,as confirmed by Wilcoxon signed-rank and Friedman statistical tests.Furthermore,PAC was applied as a feature selection method on four diverse datasets,achieving substantial dimensionality reduction while outperforming comparative methods in classification accuracy.These results highlight PAC’s versatility,robustness,and practical effectiveness. 展开更多
关键词 Optimization algorithms Meta-heuristic algorithms Continuous optimization Propagation alongside crossover algorithm Intrusion detection
Low-complexity APSK demodulation algorithm based on K-means clustering in LEO satellite communication systems 认领 引用
15
作者 Guangfu Wu Xiangrui Meng +1 位作者 Changlin Chen Biqun Xiang 《Digital Communications and Networks》 SCIE EI CSCD 2026年第2期343-353,共11页
Amplitude Phase Shift Keying(APSK)is more suitable for the nonlinear channels of Low Earth Orbit(LEO)satellite communication systems compared to Quadrature Amplitude Modulation(QAM).To tackle challenges posed by Direc... Amplitude Phase Shift Keying(APSK)is more suitable for the nonlinear channels of Low Earth Orbit(LEO)satellite communication systems compared to Quadrature Amplitude Modulation(QAM).To tackle challenges posed by Direct Current(DC)interference and high demodulation complexity,we propose an APSK demodulation algorithm based on K-means clustering.Initially,static DC components are calculated and removed from the received APSK signals.Subsequently,the estimated APSK constellation points serve as initial centers for K-means clustering.These centers are refined through the K-means process and act as theoretical APSK constellation points for the Max-Log-MAP demodulation algorithm,effectively eliminating residual DC.We then introduce a low-complexity APSK demodulation algorithm that utilizes the symmetry of constellation points along with the Euclidean distance between DC-eliminated signals and these constellation points to minimize the set of constellation points.Simulation results indicate that for 32-APSK,our proposed demodulation submodule reduces computational complexity to approximately one-third that of the Max-Log-MAP algorithm while improving Bit Error Rate(BER)performance by about 0.23 dB.Furthermore,end-to-end simulation experiments conducted within LEO satellite communication systems demonstrate that our approach not only maintains this complexity advantage but also enhances BER performance by approximately 1.1 dB. 展开更多
关键词 DC elimination APSK demodulation LEO satellite communication K-means algorithm Max-Log-MAP algorithm
暂未订购 下载PDF
A Metaheuristic Football Optimization Algorithm Integrated with Large Language Models for Automated Seismic Time-Series Modeling 认领 引用
16
作者 Amal H.Alharbi Marwa M.Eid +2 位作者 Nima Khodadadi Ebrahim A.Mattar Sayed Elkenawy 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第5期947-987,共41页
Seismic time series forecasting remains challenging due to the nonlinearity,non-stationarity,and noise of earthquake data,and because deep learning models are sensitive to preprocessing and hyperparameter settings.Alt... Seismic time series forecasting remains challenging due to the nonlinearity,non-stationarity,and noise of earthquake data,and because deep learning models are sensitive to preprocessing and hyperparameter settings.Although recent studies have improved neural architectures and optimization techniques,preprocessing is often treated as a fixed or manually designed stage,with limited integration into model optimization.To address this,this paper proposes an integrated,data-driven modelling framework that combines guided preprocessing with systematic hyperparameter optimization for seismic prediction,specifically forecasting earthquake magnitude from seismic catalog time-series data,with experiments conducted on Canadian seismic records.The method uses a Large Language Model to guide data preparation and feature engineering,rather than fully automate them,and applies deep learning-based forecasting with the N-HITS architecture,optimized via metaheuristic-assisted feature selection and hyperparameter tuning.The Football Optimization Algorithm(FbOA),employed as a metaheuristic optimization strategy in this study,is evaluated and compared with several well-known optimizers under identical conditions.The results show significant performance gains,with FbOA achieving superior accuracy,robustness,and convergence compared to baseline and competing methods.Notably,error metrics are reduced(MSE 3.10×10-7,RMSE 5.57×103),with high performance indicators(r=0.982,R2=0.979,NSE=0.981,WI=0.985).These results highlight the value of integrating guided preprocessing with optimization and demonstrate a scalable framework for high-precision time-series prediction in geophysical and related domains. 展开更多
关键词 Seismic time-series forecasting large language models metaheuristic algorithms football optimization algorithm earthquake modeling
暂未订购 下载PDF
A Quantum-Inspired Algorithm for Clustering and Intrusion Detection 认领 引用
17
作者 Gang Xu Lefeng Wang +5 位作者 Yuwei Huang Yong Lu Xin Liu Weijie Tan Zongpeng Li Xiu-Bo Chen 《Computers, Materials & Continua》 SCIE EI 2026年第4期1180-1215,共36页
The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,convention... The Intrusion Detection System(IDS)is a security mechanism developed to observe network traffic and recognize suspicious or malicious activities.Clustering algorithms are often incorporated into IDS;however,conventional clustering-based methods face notable drawbacks,including poor scalability in handling high-dimensional datasets and a strong dependence of outcomes on initial conditions.To overcome the performance limitations of existing methods,this study proposes a novel quantum-inspired clustering algorithm that relies on a similarity coefficient-based quantum genetic algorithm(SC-QGA)and an improved quantum artificial bee colony algorithm hybrid K-means(IQABC-K).First,the SC-QGA algorithmis constructed based on quantum computing and integrates similarity coefficient theory to strengthen genetic diversity and feature extraction capabilities.For the subsequent clustering phase,the process based on the IQABC-K algorithm is enhanced with the core improvement of adaptive rotation gate and movement exploitation strategies to balance the exploration capabilities of global search and the exploitation capabilities of local search.Simultaneously,the acceleration of convergence toward the global optimum and a reduction in computational complexity are facilitated by means of the global optimum bootstrap strategy and a linear population reduction strategy.Through experimental evaluation with multiple algorithms and diverse performance metrics,the proposed algorithm confirms reliable accuracy on three datasets:KDD CUP99,NSL_KDD,and UNSW_NB15,achieving accuracy of 98.57%,98.81%,and 98.32%,respectively.These results affirm its potential as an effective solution for practical clustering applications. 展开更多
关键词 Intrusion detection clustering quantum artificial bee colony algorithm K-means quantum genetic algorithm
暂未订购 下载PDF
A Firefly Algorithm-Optimized CNN-BiLSTM Model for Automated Detection of Bone Cancer and Marrow Cell Abnormalities 认领 引用
18
作者 Ishaani Priyadarshini 《Computers, Materials & Continua》 SCIE EI 2026年第3期1510-1535,共26页
Early and accurate detection of bone cancer and marrow cell abnormalities is critical for timely intervention and improved patient outcomes.This paper proposes a novel hybrid deep learning framework that integrates a ... Early and accurate detection of bone cancer and marrow cell abnormalities is critical for timely intervention and improved patient outcomes.This paper proposes a novel hybrid deep learning framework that integrates a Convolutional Neural Network(CNN)with a Bidirectional Long Short-Term Memory(BiLSTM)architecture,optimized using the Firefly Optimization algorithm(FO).The proposed CNN-BiLSTM-FO model is tailored for structured biomedical data,capturing both local patterns and sequential dependencies in diagnostic features,while the Firefly Algorithm fine-tunes key hyperparameters to maximize predictive performance.The approach is evaluated on two benchmark biomedical datasets:one comprising diagnostic data for bone cancer detection and another for identifying marrow cell abnormalities.Experimental results demonstrate that the proposed method outperforms standard deep learning models,including CNN,LSTM,BiLSTM,and CNN-LSTM hybrids,significantly.The CNNBiLSTM-FO model achieves an accuracy of 98.55%for bone cancer detection and 96.04%for marrow abnormality classification.The paper also presents a detailed complexity analysis of the proposed algorithm and compares its performance across multiple evaluation metrics such as precision,recall,F1-score,and AUC.The results confirm the effectiveness of the firefly-based optimization strategy in improving classification accuracy and model robustness.This work introduces a scalable and accurate diagnostic solution that holds strong potential for integration into intelligent clinical decision-support systems. 展开更多
关键词 Firefly optimization algorithm(FO) marrow cell abnormalities bidirectional long short term memory(Bi-LSTM) temporal dependency modeling
暂未订购 下载PDF
PID Steering Control Method of Agricultural Robot Based on Fusion of Particle Swarm Optimization and Genetic Algorithm 认领 引用 被引量：4
19
作者 ZHAO Longlian ZHANG Jiachuang +2 位作者 LI Mei DONG Zhicheng LI Junhui 《农业机械学报》 EI CAS CSCD 北大核心 2026年第1期358-367,共10页
Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion... Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots. 展开更多
关键词 agricultural robot steering PID control particle swarm optimization algorithm genetic algorithm
暂未订购 下载PDF
Information Diffusion Models and Fuzzing Algorithms for a Privacy-Aware Data Transmission Scheduling in 6G Heterogeneous ad hoc Networks 认领 引用 被引量：1
20
作者 Borja Bordel Sánchez Ramón Alcarria Tomás Robles 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第2期1214-1234,共21页
In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic h... In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services. 展开更多
关键词 6G networks ad hoc networks privacy scheduling algorithms diffusion models fuzzing algorithms
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈