期刊文献+

二次检索

题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到9篇文章
< 1 >
每页显示 20 50 100
城市轨道交通客流预测算法研究 被引量:3
1
作者 秦利南 董路熙 《交通工程》 2021年第1期40-47,共8页
城市轨道交通客流预测是客运组织的基础,预测结果可为运营管理提供决策依据.针对城市轨道交通客流量预测问题,提出了一种ARMA-RBF组合客流预测算法:首先根据变点算法,通过对客流数据构成的时间序列处理得到变点集;然后基于小波变化对变... 城市轨道交通客流预测是客运组织的基础,预测结果可为运营管理提供决策依据.针对城市轨道交通客流量预测问题,提出了一种ARMA-RBF组合客流预测算法:首先根据变点算法,通过对客流数据构成的时间序列处理得到变点集;然后基于小波变化对变点集进行去噪处理;最后利用ARMA-RBF算法对城市轨道客流进行预测.以北京地铁4号线新街口、平安里、西四地铁站进出客流数据进行方法验证,结果表明,相较于单独的ARMA算法或RBF神经网络算法,ARMA-RBF组合客流预测算法可提高城市轨道交通进站客流预测的精度. 展开更多
关键词 轨道交通 变点算法 小波去噪 ARMA-RBF组合预测算法
下载PDF
一种基于改进ORB的无人机影像特征匹配方法
2
作者 唐迪 甘淑 袁希平 《测绘工程》 2024年第6期33-40,共8页
针对高原山区区域的无人机影像受到地形起伏,纹理信息不突出的影响,导致ORB算法的匹配正确率偏低且不稳定的问题,文中提出适应高原山区区域的无人机影像特征匹配的改进算法。该方法集成了ORB算法、小波影像金字塔、BRISK关键点描述符、... 针对高原山区区域的无人机影像受到地形起伏,纹理信息不突出的影响,导致ORB算法的匹配正确率偏低且不稳定的问题,文中提出适应高原山区区域的无人机影像特征匹配的改进算法。该方法集成了ORB算法、小波影像金字塔、BRISK关键点描述符、GMS算法和随机抽样一致算法(RANSAC)模型约束改进的方法。首先将ORB算法中的高斯金字塔替换为小波影像金字塔并进行特征点检测;然后,结合BRISK描述符生成适合影像特征的二进制描述符;其次使用暴力匹配算法和GMS算法,对特征点进行第一次约束优化提取;最后利用RANSAC算法对匹配点对进行第二次约束优化提取。试验结果表明,文中算法在高原山区区域无人机影像特征匹配的实验中,匹配正确率和匹配耗时均有着显著的优势。相较于传统ORB算法,文中算法的匹配正确率和匹配耗时有较大提升。 展开更多
关键词 无人机影像 特征提取 小波图像金字塔 二进制鲁棒不特征描述算法 基于网络的运动统计算法
下载PDF
Comparison of two kinds of approximate proximal point algorithms for monotone variational inequalities
3
作者 陶敏 《Journal of Southeast University(English Edition)》 EI CAS 2008年第4期537-540,共4页
This paper proposes two kinds of approximate proximal point algorithms (APPA) for monotone variational inequalities, both of which can be viewed as two extended versions of Solodov and Svaiter's APPA in the paper ... This paper proposes two kinds of approximate proximal point algorithms (APPA) for monotone variational inequalities, both of which can be viewed as two extended versions of Solodov and Svaiter's APPA in the paper "Error bounds for proximal point subproblems and associated inexact proximal point algorithms" published in 2000. They are both prediction- correction methods which use the same inexactness restriction; the only difference is that they use different search directions in the correction steps. This paper also chooses an optimal step size in the two versions of the APPA to improve the profit at each iteration. Analysis also shows that the two APPAs are globally convergent under appropriate assumptions, and we can expect algorithm 2 to get more progress in every iteration than algorithm 1. Numerical experiments indicate that algorithm 2 is more efficient than algorithm 1 with the same correction step size, 展开更多
关键词 monotone variational inequality approximate proximate point algorithm inexactness criterion
下载PDF
面向电力市场的用户端需求侧响应研究 被引量:3
4
作者 钟桦 吕征宇 +2 位作者 陈春逸 黄宇鹏 周波 《计算机与数字工程》 2019年第8期2102-2107,共6页
随着智能电网技术的飞速发展,未来电力市场将转变为自由市场,智能电网用户不再只是传统的电能消费者,还可以通过分布式能源并网出售电能,参与实时电价主导的自由电力市场交易。论文以未来智能电网中集发、用、储、售一体化的智能用户端... 随着智能电网技术的飞速发展,未来电力市场将转变为自由市场,智能电网用户不再只是传统的电能消费者,还可以通过分布式能源并网出售电能,参与实时电价主导的自由电力市场交易。论文以未来智能电网中集发、用、储、售一体化的智能用户端为研究对象,建立包含常规电力需求模型、储能模型、电动汽车模型、家用分布式可再生能源发电模型在内的需求侧响应模型,以智能用户端用电成本为优化目标,采用多起始点变邻域下降算法动态求解智能用户端响应实时电价的售用电策略,数值仿真计算结果验证了所建立模型的合理性及所采用的智能优化算法的有效性。 展开更多
关键词 智能电网 电力市场 实时电价 需求侧响应 多起始邻域下降算法
下载PDF
A predictor-corrector interior-point algorithmfor monotone variational inequality problems 被引量:2
5
作者 梁昔明 钱积新 《Journal of Zhejiang University Science》 CSCD 2002年第3期321-325,共5页
Mehrotra's recent suggestion of a predictor corrector variant of primal dual interior point method for linear programming is currently the interior point method of choice for linear programming. In this work t... Mehrotra's recent suggestion of a predictor corrector variant of primal dual interior point method for linear programming is currently the interior point method of choice for linear programming. In this work the authors give a predictor corrector interior point algorithm for monotone variational inequality problems. The algorithm was proved to be equivalent to a level 1 perturbed composite Newton method. Computations in the algorithm do not require the initial iteration to be feasible. Numerical results of experiments are presented. 展开更多
关键词 Variational inequality problems(VIP) Predictor corrector interior point algorithm Numerical experiments
下载PDF
Comparison of two approximal proximal point algorithms for monotone variational inequalities 被引量:1
6
作者 TAO Min 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2007年第6期969-977,共9页
Proximal point algorithms (PPA) are attractive methods for solving monotone variational inequalities (MVI). Since solving the sub-problem exactly in each iteration is costly or sometimes impossible, various approx... Proximal point algorithms (PPA) are attractive methods for solving monotone variational inequalities (MVI). Since solving the sub-problem exactly in each iteration is costly or sometimes impossible, various approximate versions ofPPA (APPA) are developed for practical applications. In this paper, we compare two APPA methods, both of which can be viewed as prediction-correction methods. The only difference is that they use different search directions in the correction-step. By extending the general forward-backward splitting methods, we obtain Algorithm Ⅰ; in the same way, Algorithm Ⅱ is proposed by spreading the general extra-gradient methods. Our analysis explains theoretically why Algorithm Ⅱ usually outperforms Algorithm Ⅰ. For computation practice, we consider a class of MVI with a special structure, and choose the extending Algorithm Ⅱ to implement, which is inspired by the idea of Gauss-Seidel iteration method making full use of information about the latest iteration. And in particular, self-adaptive techniques are adopted to adjust relevant parameters for faster convergence. Finally, some numerical experiments are reported on the separated MVI. Numerical results showed that the extending Algorithm II is feasible and easy to implement with relatively low computation load. 展开更多
关键词 Projection and contraction methods Proximal point algorithm (PPA) Approximate PPA (APPA) Monotone variational inequality (MVI) Prediction and correction
下载PDF
动态场景下仓储机器人的视觉定位与建图 被引量:1
7
作者 徐兴 刘琼 黄开坤 《导航定位学报》 CSCD 2023年第6期110-118,共9页
针对目前大多数室内仓储机器人的视觉定位与建图算法(SLAM)是假设机器人处在静态的环境,但是当场景中出现移动的物体时,机器人自身定位的准确性和稳定性易受到巨大影响,而其他室内定位技术比如超宽带、蓝牙等必须在无线信号覆盖的条件... 针对目前大多数室内仓储机器人的视觉定位与建图算法(SLAM)是假设机器人处在静态的环境,但是当场景中出现移动的物体时,机器人自身定位的准确性和稳定性易受到巨大影响,而其他室内定位技术比如超宽带、蓝牙等必须在无线信号覆盖的条件下工作的问题,提出一种面向室内仓储机器人在动态场景下的视觉SLAM算法:在基于旋转不变特征点的定位与建图改进算法(ORB-SLAM2)基础上,用几何对应神经网络(GCNv2)来替换基于图像金字塔的特征点提取算法;添加目标检测(YOLOv4)的语义线程,并且使用光流法来追踪特征点;然后通过运动一致性检测来识别图像中潜在的动态物体;最后剔除动态特征点后进行位姿估计。实验结果表明,在高度动态的室内场景下,提出的算法相对于ORB-SLAM2算法的绝对轨迹误差可减小95.56%~98.21%,能够有效解决ORB-SLAM2在动态场景下定位不准确的问题。 展开更多
关键词 仓储机器人 动态场景 几何对应神经网络(GCNv2) 目标检测 基于旋转不特征的定位与建图改进算法(ORB-SLAM2)
下载PDF
Real-Code Genetic Algorithm for Ground State Energies of Hydrogenic Donors in GaAs-(Ga,Al)As Quantum Dots
8
作者 YAN Hai-Qing TANG Chen +1 位作者 LIU Ming ZHANG Hao 《Communications in Theoretical Physics》 SCIE CAS CSCD 2005年第4X期727-730,共4页
We present a global optimization method, called the real-code genetic algorithm (RGA), to the ground state energies. The proposed method does not require partial derivatives with respect to each variational parameter ... We present a global optimization method, called the real-code genetic algorithm (RGA), to the ground state energies. The proposed method does not require partial derivatives with respect to each variational parameter or solving an eigenequation, so the present method overcomes the major difficulties of the variational method. RGAs also do not require coding and encoding procedures, so the computation time and complexity are reduced. The ground state energies of hydrogenic donors in GaAs-(Ga,Al)As quantum dots have been calculated for a range of the radius of the quantum dot radii of practical interest. They are compared with those obtained by the variational method. The results obtained demonstrate the proposed method is simple, accurate, and easy implement. 展开更多
关键词 ground state energy quantum dots real-code genetic algorithms
下载PDF
A PROXIMAL POINT ALGORITHM FOR A SYSTEM OF GENERALIZED MIXED VARIATIONAL INEQUALITIES 被引量:3
9
作者 Bo WAN Xuegang ZHAN 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2012年第5期964-972,共9页
This paper introduces and considers a new system of generalized mixed variational inequal- ities in a Hilbert space, which includes many new and known systems of variational inequalities and generalized variational in... This paper introduces and considers a new system of generalized mixed variational inequal- ities in a Hilbert space, which includes many new and known systems of variational inequalities and generalized variational inequalities as special cases. By using the two concepts of η-subdifferential and η-proximal mappings of a proper function, the authors try to demonstrate that the system of generalized mixed variational inequalities is equivalence with a fixed point problem. By applying the equivalence, a new and innovative η-proximal point algorithm for finding approximate solutions of the system of generalized mixed variational inequalities will be suggested and analyzed. The authors also study the convergence analysis of the new iterative method under much weaker conditions. The results can be viewed as a refinement and improvement of the previously known results for variational inequalities. 展开更多
关键词 Lipschitz continuity proximal point algorithms relaxed (γ τ)-cocoercivity system ofgeneralized mixed variational inequalities.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部