期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到6,658篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Seismic Data Reconstruction and Noise Suppression Based on an Improved Weighted Fast Projection onto Convex Sets Algorithm 认领 引用
1
作者 Cheng Gao-peng Zhang Hua +3 位作者 Li Hong-xing Song Yu Yue Ming Zhang Kai-dong 《Applied Geophysics》 SCIE CSCD 2026年第1期336-351,433,434,共16页
In eld seismic data acquisition,seismic traces are often aected by substantial data gaps and strong noise interference due to environmental and instrumental factors,thus degrading the resolution and signalto-noise rat... In eld seismic data acquisition,seismic traces are often aected by substantial data gaps and strong noise interference due to environmental and instrumental factors,thus degrading the resolution and signalto-noise ratio(SNR)of the seismic profiles.Effective seismic data reconstruction and noise suppression techniques are therefore essential to recover missing signals and improve data quality.In this study,a fast projection onto convex sets(FPOCS)algorithm is proposed by incorporating an inertial parameter that involves a linear combination of the two preceding iterations based on the traditional projection onto convex sets(POCS)algorithm.Then,a weighting factor is introduced to achieve simultaneous data reconstruction and noise suppression using the weighted fast projection onto convex sets(WFPOCS)algorithm.To further suppress residual random noise in the updated solution,an optimization strategy is adopted by swapping the order of the iterative hard thresholding operator and the projection operator.The nal algorithm,termed the improved weighted fast projection onto convex sets(IWFPOCS),achieves high-efciency reconstruction and effective noise suppression.Compared with WFPOCS,the proposed method maintains fast reconstruction speed while demonstrating superior denoising performance on irregularly missing and noisy datasets.Field data experiments conrm that the proposed method signicantly improves the SNR and resolution of seismic data,oering strong practical potential for subsequent processing and interpretation. 展开更多
关键词 Seismic data reconstruction Fast projection onto convex set algorithm Curvelet transform Weighted fast projection onto convex set algorithm Noise suppression
暂未订购 下载PDF
A fast algorithm for solving the scattering problem from an open rectangular cavity 认领 引用
2
作者 HAN Shangqi LI Yuan 《黑龙江大学自然科学学报》 CAS 2026年第1期31-41,共11页
This paper presents a fast algorithm for solving the scattering problem from an open rectangular cavity embedded in the ground plane.The computational region is chosen as the union of two rectangular regions:one is a ... This paper presents a fast algorithm for solving the scattering problem from an open rectangular cavity embedded in the ground plane.The computational region is chosen as the union of two rectangular regions:one is a region above the ground,the other one is a region containing the cavity.The finite difference scheme is constructed in each region.An intermediate layer of the mesh is shared by both regions,which is the key of the algorithm.A cyclic reduction method is employed to solve the difference equation in the region above the ground.Then the numerical solution on the cavity aperture can be obtained.The numerical experiments are provided to verify the feasibility of the proposed algorithm. 展开更多
关键词 scattering problem cavity Helmholtz equation fast algorithm difference equation cyclic reduction method
暂未订购 下载PDF
Improving the interpretation of undrained shear strength from piezocone penetration tests by integrating soil physical properties using a hybrid meta-heuristic algorithm 认领 引用 被引量：1
3
作者 Meng Wu Zening Zhao Guojun Cai 《Journal of Rock Mechanics and Geotechnical Engineering》 SCIE CSCD 2025年第5期3180-3197,共18页
Conventional empirical equations for estimating undrained shear strength(su)from piezocone penetration test(CPTu)data,without incorporating soil physical properties,often lack the accuracy and robustness required f... Conventional empirical equations for estimating undrained shear strength(su)from piezocone penetration test(CPTu)data,without incorporating soil physical properties,often lack the accuracy and robustness required for geotechnical site investigations.This study introduces a hybrid virus colony search(VCS)algorithm that integrates the standard VCS algorithm with a mutation-based search mechanism to develop high-performance XGBoost learning models to address this limitation.A dataset of 372 seismic CPTu and corresponding soil physical properties data from 26 geotechnical projects in JiangsuProvince,China,was collected for model development.Comparative evaluations demonstrate that the proposed hybrid VCS-XGBoost model exhibits superior performance compared to standard meta-heuristic algorithm-based XGBoost models.The results highlight that the consideration of soil physical properties significantly improves the predictive accuracy of su,emphasizing the importance of considering additional soil information beyond CPTu data for accurate suestimation. 展开更多
关键词 Undrained shear strength Piezocone penetration test Extreme gradient boosting Meta-heuristic algorithm
暂未订购 下载PDF
Mechanical modeling of wafer probe testing based on nanoindentation inverse identification 认领 引用
4
作者 Dongyang Hou Ting Lv +3 位作者 Yuhang Ouyang Shunyong Jiang Fang Dong Sheng Liu 《Acta Mechanica Sinica》 SCIE EI CAS CSCD 2026年第7期330-343,共14页
Wafer probe testing is essential for evaluating the reliability of microelectronic devices.As device dimensions continue to shrink,the mechanical stress at the probe tip increases the risk of failure occurring in the ... Wafer probe testing is essential for evaluating the reliability of microelectronic devices.As device dimensions continue to shrink,the mechanical stress at the probe tip increases the risk of failure occurring in the brittle dielectric layer.Existing studies usually simplify the plastic behavior of bond pads in finite element(FE)models,making it difficult to accurately predict the stress in the dielectric layer.In this study,the FE model for wafer probe testing was improved by implanting the true plastic properties of Al-(4 wt.%)Cu bond pads obtained from nanoindentation inverse identification.Specifically,a MATLAB and ABAQUS co-simulation method is employed to inversely obtain the plastic properties of Al-(4 wt.%)Cu bond pads from the nanoindentation load-displacement curve.By comparing different gradient-based optimization algorithms,the Levenberg-Marquardt(LM)algorithm was found to be the most suitable for balancing computational efficiency and accuracy in inverse identification.Moreover,a hybrid optimization strategy combining Gauss-Newton and LM algorithms is proposed to mitigate sensitivity to initial values.The results show that the improved model of wafer probe testing achieves high accuracy in stress prediction.This study provides a high-fidelity approach for mechanical reliability assessment of wafer probe testing. 展开更多
关键词 Wafer probe testing Nanoindentation Inverse analysis Optimization algorithm Finite element simulation
暂未订购 下载PDF
Multistrategy Improved Aquila Optimizer for Test Case Prioritization 认领 引用
5
作者 Jiali Chen Jiheng Zhang +3 位作者 Xiaojie Chen Chong Zeng Honghui Yi Heming Jia 《Computers, Materials & Continua》 SCIE EI 2026年第8期2328-2362,共35页
Traditional heuristic algorithms often fall into local optima and converge slowly when test case prioritization is addressed in regression testing,making them inadequate for complex real-world scenarios.The Aquila opt... Traditional heuristic algorithms often fall into local optima and converge slowly when test case prioritization is addressed in regression testing,making them inadequate for complex real-world scenarios.The Aquila optimizer,a novel metaheuristic algorithm,demonstrates strong global exploration capability but still faces limitations,including insufficient exploitation capability and slow convergence.To overcome these challenges,a multi-strategy improved chaotic Cauchy inverse cumulative distribution Aquila optimizer for test case prioritization is proposed.First,a logistic–sine–cosine composite chaotic mapping is introduced during the initialization phase of the Aquila optimizer to increase population diversity.Second,the mutated random walk strategy is used to improve global exploration,further enhancing the global search ability of the Aquila optimizer.Moreover,during the narrowed exploration and narrowed exploitation phases,the Cauchy inverse cumulative distribution flight replaces the Lévy flight strategy to reallocate individual positions,strengthening individuals’optimization capability and preventing the algorithm from becoming trapped in local optima.Finally,in the later iteration stage,the specular reflection learning strategy is used to perturb the optimal individual positions and improve the Aquila optimizer’s convergence accuracy and comprehensive optimization performance.Five Java projects were selected from the Defects4J benchmark datasets to conduct comparative experiments with the Aquila optimizer and seven other metaheuristic algorithms.The results demonstrate the effectiveness and superiority of the improved algorithm in test case prioritization.It achieves average improvements of approximately 4.96%in the average percentage of fault detection,3.82%in the average percentage of block coverage,and 5.64%in the average percentage of decision coverage,enabling faster coverage of code blocks and branches.The results provide an efficient priority sorting solution for complex regression testing scenarios. 展开更多
关键词 Heuristic algorithm search-based software engineering(SBSE) Aquila optimizer(AO) test case prioritization(TCP) average percentage of fault detection(APFD) average percentage of block coverage(APBC) average percentage of decision coverage(APDC)
暂未订购 下载PDF
Fast beam migration capable of dealing with intersecting events 认领 引用
6
作者 Zhi-Miao Chang Fu-Xing Han +4 位作者 Zheng-Hui Gao Zhang-Qing Sun Shou-Dong Huo Gang Li Ming Zhang 《Petroleum Science》 SCIE EI CAS CSCD 2026年第1期190-204,共15页
Fast beam migration(FBM),characterized by its super-high efficiency in velocity model building,consists of three main steps:beam forming,beam propagation,and image forming.The super-high efficiency is achieved by beam... Fast beam migration(FBM),characterized by its super-high efficiency in velocity model building,consists of three main steps:beam forming,beam propagation,and image forming.The super-high efficiency is achieved by beam forming,as it needs only to be performed once for one dataset and is independent of velocity,and the other two steps take relatively little time.However,compared to the beam-propagation and image-forming steps,the beam-forming step is still quite time-consuming owing to the high-dimensional computing problem of estimating the source and receiver slope orientation of a beam.Furthermore,previous methods for estimating the source and receiver slope orientation of a beam struggled to deal with intersecting events,leading to poor imaging results for complex subsurface structures,such as unconformities or faults,where events often intersect.We propose the use of a three-step multimodal optimization method based on the neighborhood crowding differential evolution(NCDE)algorithm to estimate the source and receiver slope orientation of a beam during the beam-forming step,which can quickly and accurately obtain slope orientations when events intersect.We first test the three-step multimodal optimization algorithm on a 3D super-gather and provide the parameter criteria.We then apply the FBM based on the three-step multimodal optimization algorithm to the Marmousi 2 and 3D SEG/EAGE salt models.Both results demonstrate that the proposed method can image intersecting events well and that the imaging quality of complex zones is improved.We also apply the proposed method to a 2D offshore seismic dataset containing abundant intersecting events,which validates the practicality of the proposed method. 展开更多
关键词 Fast beam migration(FBM) Intersecting events Multimodal optimization method Neighborhood crowding differential evolution(NCDE)algorithm High-dimensional computing problem
暂未订购 下载PDF
结合车辆追踪技术与FastDTW算法的桥梁动态称重方法 认领 引用
7
作者 靳阳 杨干 +4 位作者 陈鹏涛 王涛 陈适之 王红霞 韩万水 《中国公路学报》 EI CAS CSCD 北大核心 2026年第6期267-281,共15页
传统桥梁动态称重算法往往假设车辆匀速直线行驶,且默认上下桥时刻已知。然而,在实际工程中,车辆行驶特征复杂,上下桥时刻也难以从监测数据精确获取。为解决这些难题,提出一种融合计算机视觉技术与快速动态时间规整(FastDTW)算法的桥梁... 传统桥梁动态称重算法往往假设车辆匀速直线行驶,且默认上下桥时刻已知。然而,在实际工程中,车辆行驶特征复杂,上下桥时刻也难以从监测数据精确获取。为解决这些难题,提出一种融合计算机视觉技术与快速动态时间规整(FastDTW)算法的桥梁动态称重方法。该方法能充分考虑车辆真实行驶特性,即便上下桥时间存在偏差,仍可实现精准称重。在具体操作流程上,先利用计算机视觉技术识别、追踪车辆,获取其时空信息;接着结合车辆重量统计数据,初始化车辆荷载,为后续迭代求解真实车辆荷载提供原始数据。然后,借助FastDTW算法关联桥梁响应的计算与实测时程曲线,通过不断迭代调整轴距、轴重信息,使两者逐步逼近,进而得到准确的车辆轴距和轴重。经模拟计算与模型试验验证,该方法在考虑车辆加减速、变道等行驶特征时,轴距、轴重识别平均相对误差仅为2.83%和2.67%,最大相对误差分别为5.60%和5.84%,总重最大相对误差为4.28%。此外,在实桥试验验证中,最大轴距、最大轴重识别相对误差分别为10.03%和6.16%,最大总重识别相对误差为5.72%。这充分展现出该算法的准确性与适用性,应用前景十分广阔。 展开更多
关键词 桥梁工程 桥梁动态称重 计算机视觉技术 动态时间规整算法 车辆行驶特征
暂未订购 下载PDF
Joint Access Node Selection and Fast Routing Optimization for LEO Satellite Networks 认领 引用
8
作者 Zhang Yifan Dong Tao +2 位作者 Liu Zhihui Di Hang Zhou Jianming 《China Communications》 SCIE EI CSCD 2026年第6期146-164,共19页
The low Earth orbit(LEO)satellite networks play an important role in the future communication networks.However,under the end-to-end(E2E)transmission background,inter-satellite routing has been widely studied,but the i... The low Earth orbit(LEO)satellite networks play an important role in the future communication networks.However,under the end-to-end(E2E)transmission background,inter-satellite routing has been widely studied,but the influence of ground-satellite links(GSL)on routing has received less attention.In this paper,a fast E2E satellite routing algorithm based on access node selection is proposed.Firstly,the delay of four path modes generated by users accessing the network from different satellites is analyzed,and the influence of delay on E2E routing performance is presented.Then,jointly considering routing delay and node load,an access node selection strategy is proposed by using the shortest E2E delay to determine the access source and destination node within satellites.Finally,an optimization domain is divided from the network topology by using the shortest delay path based on hops constraints.And a routing optimization algorithm based on Q-learning has been proposed in the optimization domain,realizing high computational speed and stable results.The simulation results show that the access node selection strategy can decrease E2E delay by up to 10 ms and enhance the performance of node load balancing.And the routing optimization algorithm can reduce the average computation time. 展开更多
关键词 access selection fast routing LEO satellite networks load balancing routing algorithm
暂未订购 下载PDF
Improvement and performance of parallel multilevel fast multipole algorithm 认领 引用 被引量：16
9
作者 Zhanhe Liu Peilin Huang +1 位作者 Zhe Wu Xu Gao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2011年第1期164-169,共6页
The method of establishing data structures plays an important role in the efficiency of parallel multilevel fast multipole algorithm（PMLFMA）.Considering the main complements of multilevel fast multipole algorithm（M... The method of establishing data structures plays an important role in the efficiency of parallel multilevel fast multipole algorithm（PMLFMA）.Considering the main complements of multilevel fast multipole algorithm（MLFMA） memory,a new parallelization strategy and a modified data octree construction scheme are proposed to further reduce communication in order to improve parallel efficiency.For far interaction,a new scheme called dynamic memory allocation is developed.To analyze the workload balancing performance of a parallel implementation,the original concept of workload balancing factor is introduced and verified by numerical examples.Numerical results show that the above measures improve the parallel efficiency and are suitable for the analysis of electrical large-scale scattering objects. 展开更多
关键词 multilevel fast multipole algorithm（MLFMA） electromagnetic scattering parallelization radar cross section（RCS）.
暂未订购 下载PDF
Fast period estimation of X-ray pulsar signals using an improved fast folding algorithm 认领 引用 被引量：2
10
作者 Minzhang SONG Yidi WANG +4 位作者 Wei ZHENG Liansheng LI Yusong WANG Xiaowei HU Yulong WU 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2023年第10期309-316,共8页
An accurate period is important to recover the pulse profile from a recorded photon event series of an X-ray pulsar and to estimate the pulse time of arrival,which is the measurement of X-ray pulsar navigation.Epoch f... An accurate period is important to recover the pulse profile from a recorded photon event series of an X-ray pulsar and to estimate the pulse time of arrival,which is the measurement of X-ray pulsar navigation.Epoch folding is a classical period estimation method in the time domain;however,its computational complexity grows as the number of trail periods increases.In order to reduce the computational complexity,this paper improves the fast folding algorithm through segment correlation and amplitude accumulation,which is based on the post-order traversal of a binary tree.Compared with epoch folding,the improved fast folding algorithm can achieve a similar accuracy at the cost of a lower computational burden.Compared with the original fast folding algorithm,the improved algorithm can be applied to detectors with a much smaller effective area.The performance of the method is investigated by simulation data and observation data from the Neutron star Interior Composition Explorer(NICER). 展开更多
关键词 Epoch folding Fast folding algorithm Pulsar spin period Phase estimation X-ray pulsar
暂未订购 下载PDF
Fast algorithm for constructing neighbor-joining phylogenetic trees 认领 引用 被引量：4
11
作者 陈宁涛 王能超 施保昌 《Journal of Southeast University(English Edition)》 EI CAS 2006年第2期176-179,共4页
To improve the performance of Saitou and Nei＇s algorithm （SN） and Studier and Keppler＇s improved algorithm （SK） for constructing neighbor-joining phylogenetic trees and reduce the time complexity of the computat... To improve the performance of Saitou and Nei＇s algorithm （SN） and Studier and Keppler＇s improved algorithm （SK） for constructing neighbor-joining phylogenetic trees and reduce the time complexity of the computation, a fast algorithm is proposed. The proposed algorithm includes three techniques. First, a linear array A[N] is introduced to store the sum of every row of the distance matrix （the same as SK）, which can eliminate many repeated computations. Secondly, the value of A [i] is computed only once at the beginning of the algorithm, and is updated by three elements in the iteration. Thirdly, a very compact formula for the sum of all the branch lengths of operational taxonomic units （OTUs） i and j is designed, and the correctness of the formula is proved. The experimental results show that the proposed algorithm is from tens to hundreds times faster than SN and roughly two times faster than SK when N increases, constructing a tree with 2 000 OTUs in 3 min on a current desktop computer. To earn the time with the cost of the space and reduce the computations in the innermost loop are the basic solutions for algorithms with many loops. 展开更多
关键词 phylogenetic tree neighbor-joining method fast algorithm progressive multiple alignment
暂未订购 下载PDF
An adaptive reanalysis method for genetic algorithm with application to fast truss optimization 认领 引用 被引量：3
12
作者 Tao Xu Wenjie Zuo +2 位作者 Tianshuang Xu Guangcai Song Ruichuan Li 《Acta Mechanica Sinica》 SCIE EI CAS 2010年第2期225-234,共10页
Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the de... Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the design process, the authors present an adaptive reanalysis method for GA and its applications in the optimal design of trusses. This reanalysis technique is primarily derived from the Kirsch＇s combined approximations method. An iteration scheme is adopted to adaptively determine the number of basis vectors at every generation. In order to illustrate this method, three classical examples of optimal truss design are used to validate the proposed reanalysis-based design procedure. The presented numerical results demonstrate that the adaptive reanalysis technique affects very slightly the accuracy of the optimal solutions and does accelerate the design process, especially for large-scale structures. 展开更多
关键词 Truss structure Adaptive reanalysis ·Genetic algorithm ·Fast optimization
暂未订购 下载PDF
Fast recursive algorithm for two-dimensional Tsallis entropy thresholding method 认领 引用 被引量：2
13
作者 Tang Yinggan Di Qiuyan Guan Xinping 《Journal of Systems Engineering and Electronics》 SCIE EI 2009年第3期619-624,共6页
Recently,a two-dimensional(2-D)Tsallis entropy thresholding method has been proposed as a new method for image segmentation.But the computation complexity of 2-D Tsallis entropy is very large and becomes an obstacle t... Recently,a two-dimensional(2-D)Tsallis entropy thresholding method has been proposed as a new method for image segmentation.But the computation complexity of 2-D Tsallis entropy is very large and becomes an obstacle to real time image processing systems.A fast recursive algorithm for 2-D Tsallis entropy thresholding is proposed.The key variables involved in calculating 2-D Tsallis entropy are written in recursive form.Thus,many repeating calculations are avoided and the computation complexity reduces to O(L2)from O(L4).The effectiveness of the proposed algorithm is illustrated by experimental results. 展开更多
关键词 image segmentation thresholding Tsallis entropy fast recursive algorithm
暂未订购 下载PDF
Application of the extended Fourier amplitude sensitivity testing(FAST)method to inflated,axial stretched,and residually stressed cylinders 认领 引用 被引量：2
14
作者 H.ASGHARI H.TOPOL +1 位作者 B.MARKERT J.MERODIO 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI CSCD 2023年第12期2139-2162,共24页
This paper is dedicated to applying the Fourier amplitude sensitivity test(FAST)method to the problem of mixed extension and inflation of a circular cylindrical tube in the presence of residual stresses.The metafuncti... This paper is dedicated to applying the Fourier amplitude sensitivity test(FAST)method to the problem of mixed extension and inflation of a circular cylindrical tube in the presence of residual stresses.The metafunctions and the Ishigami function are considered in the sensitivity analysis(SA).The effects of the input variables on the output variables are investigated,and the most important parameters of the system under the applied pressure and axial force such as the axial stretch and the azimuthal stretch are determined. 展开更多
关键词 sensitivity analysis(SA) Fourier amplitude sensitivity test(FAST)method cylindrical inflation nonlinear elasticity
暂未订购 下载PDF
Efficient analysis of dielectric radomes using multilevel fast multipole algorithm with CRWG basis 认领 引用 被引量：2
15
作者 Que Xiaofeng Nie Zaiping Hu Jun 《Journal of Systems Engineering and Electronics》 SCIE EI 2008年第1期81-87,共7页
A full-wave analysis of the electromagnetic problem of a three-dimensional(3-D)antenna radiating through a 3-D dielectric radome is preserued.The problem is formulated using the Poggio-Miller-Chang-Harrington-Wu(PMCHW... A full-wave analysis of the electromagnetic problem of a three-dimensional(3-D)antenna radiating through a 3-D dielectric radome is preserued.The problem is formulated using the Poggio-Miller-Chang-Harrington-Wu(PMCHW)approach for homogeneous dielectric objects and the electric field integral equation for conducting objects.The integral equations are discretized by the method of moment(MoM),in which the conducting and dielectric surface/interfaces are represented by curvilinear triangular patches and the unknown equivalent electric and magnetic currents are expanded using curvilinear RWG basis functions.The resultant matrix equation is then solved by the multilevel fast multipole algorithm(MLFMA)and fast far-field approximation(FAFFA)is used to further accelerate the computation.The radiation patterns of dipole arrays in the presence of radomes are presented.The numerical results demonstrate the accuracy and versatility of this method. 展开更多
关键词 multilevel fast multipole algorithm antenna radome curvilinear RWG basis PMCHW formulation fast far-field approximation.
暂未订购 下载PDF
Efficient Protocol-Proving Algorithm Based on Improved Authentication Tests 认领 引用 被引量：1
16
作者 李谢华 杨树堂 +1 位作者 李建华 诸鸿文 《Journal of Shanghai Jiaotong university(Science)》 EI 2007年第1期9-17,共9页
A new efficient protocol-proving algorithm was proposed for verifying security protocols. This algorithm is based on the improved authentication tests model, which enhances the original model by formalizing the messag... A new efficient protocol-proving algorithm was proposed for verifying security protocols. This algorithm is based on the improved authentication tests model, which enhances the original model by formalizing the message reply attack. With exact causal dependency relations between messages in this model, the protocol-proving algorithm can avoid the state explosion caused by asynchronous. In order to get the straight proof of security protocols, three authentication theorems are exploited for evaluating the agreement and distinction properties. When the algorithm terminates, it outputs either the proof results or the potential flaws of the security protocol. The experiment shows that the protocol-proving algorithm can detect the type flaw attack on Neuman-Stubblebine protocol, and prove the correctness of NSL protocol by exploring only 10 states. 展开更多
关键词 protocol-proving algorithm improved authentication tests Neuman-Stubblebine protocol NSL protocol
暂未订购 下载PDF
General and efficient parallel approach of finite element-boundary integral-multilevel fast multipole algorithm 认领 引用 被引量：3
17
作者 Pan Xiaomin Sheng Xinqing 《Journal of Systems Engineering and Electronics》 SCIE EI 2008年第2期207-212,共6页
A general and efficient parallel approach is proposed for the first time to parallelize the hybrid finiteelement-boundary-integral-multi-level fast multipole algorithm(FE-BI-MLFMA).Among many algorithms of FE-BI-MLFMA... A general and efficient parallel approach is proposed for the first time to parallelize the hybrid finiteelement-boundary-integral-multi-level fast multipole algorithm(FE-BI-MLFMA).Among many algorithms of FE-BI-MLFMA,the decomposition algorithm(DA)is chosen as a basis for the parallelization of FE-BI-MLFMA because of its distinct numerical characteristics suitable for parallelization.On the basis of the DA,the parallelization of FE-BI-MLFMA is carried out by employing the parallelized multi-frontal method for the matrix from the finiteelement method and the parallelized MLFMA for the matrix from the boundary integral method respectively.The programming and numerical experiments of the proposed parallel approach are carried out in the high perfor-mance computing platform CEMS-Liuhui.Numerical experiments demonstrate that FE-BI-MLFMA is efficiently parallelized and its computational capacity is greatly improved without losing accuracy,efficiency,and generality. 展开更多
关键词 finite element-boundary integral-multilevel fast multipole algorithm parallelization.
暂未订购 下载PDF
基于自适应阈值的型钢精确角点FAST检测算法 认领 引用 被引量：3
18
作者 包家汉 孙德尚 +1 位作者 黄建中 胡政 《上海交通大学学报》 EI CAS CSCD 北大核心 2025年第5期691-702,共12页
基于机器视觉的在线型钢平直度检测中,对型钢图像关键角点快速、准确地提取是实现精确检测的关键技术问题.针对加速分割检验特征提取(FAST)算法需要人工设定角点筛选阈值和角点提取存在大量伪角点的问题,提出一种自适应阈值生成及校正策... 基于机器视觉的在线型钢平直度检测中,对型钢图像关键角点快速、准确地提取是实现精确检测的关键技术问题.针对加速分割检验特征提取(FAST)算法需要人工设定角点筛选阈值和角点提取存在大量伪角点的问题,提出一种自适应阈值生成及校正策略,能够在自动获取初始阈值的基础上,根据角点数是否达到初始角点集要求对阈值实时校正直至达到适当值,以减少关键角点遗漏.在采用FAST提取角点的基础上,利用最小核心值相似区域(SUSAN)算法剔除伪角点,以保证关键角点提取的有效性.试验证明,这种基于自适应阈值的FAST角点检测算法(FAST-A),在检测环境和对象特性发生变化时,仍然可以准确、快速地检测到型钢关键角点,在为型钢平直度检测实时提供精确角点的基础上,提高角点提取的自适应性. 展开更多
关键词 型钢 角点检测 加速分割检验特征提取算法 最小核心值相似区域算法 自适应阈值
暂未订购 下载PDF
A fast MPC algorithm for reducing computation burden of MIMO 认领 引用 被引量：1
19
作者 祁荣宾 梅华 +1 位作者 陈超 钱锋 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2015年第12期2087-2091,共5页
The computation burden in the model-based predictive control algorithm is heavy when solving QR optimization with a limited sampling step, especially for a complicated system with large dimension. A fast algorithm is ... The computation burden in the model-based predictive control algorithm is heavy when solving QR optimization with a limited sampling step, especially for a complicated system with large dimension. A fast algorithm is proposed in this paper to solve this problem, in which real-time values are modulated to bit streams to simplify the multiplication. In addition, manipulated variables in the prediction horizon are deduced to the current control horizon approximately by a recursive relation to decrease the dimension of QR optimization. The simulation results demonstrate the feasibility of this fast algorithm for MIMO systems. 展开更多
关键词 Fast MPC algorithm Computation burden One-bit operation Dimension reduction
暂未订购 下载PDF
A hybrid algorithm based on ILP and genetic algorithm for time-aware test case prioritization 认领 引用 被引量：1
20
作者 Sun Jiaze Wang Gang 《Journal of Southeast University(English Edition)》 EI CAS 2018年第1期28-35,共8页
To solve the problem of time-awarc test case prioritization,a hybrid algorithm composed of integer linear programming and the genetic algorithm(ILP-GA)is proposed.First,the test case suite which cm maximize the number... To solve the problem of time-awarc test case prioritization,a hybrid algorithm composed of integer linear programming and the genetic algorithm(ILP-GA)is proposed.First,the test case suite which cm maximize the number of covered program entities a d satisfy time constraints is selected by integer linea progamming.Secondly,the individual is encoded according to the cover matrices of entities,and the coverage rate of program entities is used as the fitness function and the genetic algorithm is used to prioritize the selected test cases.Five typical open source projects are selected as benchmark programs.Branch and method are selected as program entities,and time constraint percentages a e 25%and 75%.The experimental results show that the ILP-GA convergence has faster speed and better stability than ILP-additional and IP-total in most cases,which contributes to the detection of software defects as early as possible and reduces the software testing costs. 展开更多
关键词 test case prioritization integer linear programming(I LP) genetic algorithm time constraint
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈