期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
“抢道标志线”最佳划线法与“切入差”值的计算 被引量:2
1
作者 纪和江 《山东体育学院学报》 北大核心 2005年第3期109-111,共3页
对于“抢道标志线”的划线,目前普遍采用的方法是“等半径划线法”。以“等半经划线法”为计算依据得到的“切入差”值,隐含着一定的误差,这种误差为负差,即第一分道以外的各分道的跑程距离对比第一分道的跑程距离(标准距离)相对缩短,... 对于“抢道标志线”的划线,目前普遍采用的方法是“等半径划线法”。以“等半经划线法”为计算依据得到的“切入差”值,隐含着一定的误差,这种误差为负差,即第一分道以外的各分道的跑程距离对比第一分道的跑程距离(标准距离)相对缩短,有悖于公平竞争的竞赛精神。提出修正误差的三点意见,并认定了最佳修改方案,提供了该方案下的“切入差”值以及对该值的计算方法,期望新方法能够成为《国际田联手册》的新条款而为世人所用。 展开更多
关键词 田径 抢道标志线切入差 误差 新方法 计算划线
下载PDF
Application of the Sediment Mathematical Modelling on Planned Project of Lingdingyang Bay 被引量:6
2
作者 李大鸣 李冰绯 张红萍 《Transactions of Tianjin University》 EI CAS 2002年第4期285-290,共6页
Based on the combined hydraulic calculation for the eastern network region at the Pearl River estuary and several outlets to the Lingdingyang Bay, the sediment calculation modelling was introduced in the establishment... Based on the combined hydraulic calculation for the eastern network region at the Pearl River estuary and several outlets to the Lingdingyang Bay, the sediment calculation modelling was introduced in the establishment of the sediment mathematical model for Lingdingyang Bay and the eastern region with one and two dimensional flow calculation. Model adjustment and verification were performed in conjunction with field data. The simulated results coincide well with measured data.In addition the model is applied to predict the shore-line planning scheme of Lingdingyang Bay.The theoretical criterion is provided for the shore line plan in the model.And a new mathematical simulated method is put out to research the planning engineering concerned with one-dimensional net rivers and two-dimensional estuary. 展开更多
关键词 sediment mathematical model one and two-dimensional flow calculation Lingdingyang bay shore-line plan
下载PDF
An Approach to Formulation of FNLP with Complex Piecewise Linear Membership Functions 被引量:1
3
作者 闻博 李宏光 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2014年第4期411-417,共7页
Traditionally, extra binary variables are demanded to formulate a fuzzy nonlinear programming(FNLP) problem with piecewise linear membership functions(PLMFs). However, this kind of methodology usually suffers increasi... Traditionally, extra binary variables are demanded to formulate a fuzzy nonlinear programming(FNLP) problem with piecewise linear membership functions(PLMFs). However, this kind of methodology usually suffers increasing computational burden associated with formulation and solution, particularly in the face of complex PLMFs. Motivated by these challenges, this contribution introduces a novel approach free of additional binary variables to formulate FNLP with complex PLMFs, leading to superior performance in reducing computational complexity as well as simplifying formulation. A depth discussion about the approach is conducted in this paper, along with a numerical case study to demonstrate its potential benefits. 展开更多
关键词 fuzzy nonlinear programming piecewise linear membership functions MODELING
下载PDF
Intelligent computing budget allocation for on-road tra jectory planning based on candidate curves
4
作者 Xiao-xin FU Yong-heng JIANG +2 位作者 De-xian HUANG Jing-chun WANG Kai-sheng HUANG 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2016年第6期553-565,共13页
In this paper, on-road trajectory planning is solved by introducing intelligent computing budget allocation(ICBA) into a candidate-curve-based planning algorithm, namely, ordinal-optimization-based differential evolut... In this paper, on-road trajectory planning is solved by introducing intelligent computing budget allocation(ICBA) into a candidate-curve-based planning algorithm, namely, ordinal-optimization-based differential evolution(OODE). The proposed algorithm is named IOODE with ‘I' representing ICBA. OODE plans the trajectory in two parts: trajectory curve and acceleration profile. The best trajectory curve is picked from a set of candidate curves, where each curve is evaluated by solving a subproblem with the differential evolution(DE) algorithm. The more iterations DE performs, the more accurate the evaluation will become. Thus, we intelligently allocate the iterations to individual curves so as to reduce the total number of iterations performed. Meanwhile, the selected best curve is ensured to be one of the truly top curves with a high enough probability. Simulation results show that IOODE is 20% faster than OODE while maintaining the same performance in terms of solution quality. The computing budget allocation framework presented in this paper can also be used to enhance the efficiency of other candidate-curve-based planning methods. 展开更多
关键词 Intelligent computing budget allocation Trajectory planning On-road planning Intelligent vehicles Ordinal optimization
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部