期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
论室内微角透视影点法的绘制方法
1
作者 张贤波 《城市建筑》 2015年第5期271-272,共2页
微角透视是一种室内设计手绘表现常用的透视方法,因为它比一点透视灵活自由,而比两点透视更全面地反映空间的特点。微角透视的常规画法主要有几何法、量点法与近似画法。几何法与量点法中其中有一个灭点往往超出画面很远,给绘图带来... 微角透视是一种室内设计手绘表现常用的透视方法,因为它比一点透视灵活自由,而比两点透视更全面地反映空间的特点。微角透视的常规画法主要有几何法、量点法与近似画法。几何法与量点法中其中有一个灭点往往超出画面很远,给绘图带来了困难。近似画法与真实的情况却不是完全一致,影点法基本可以在画面内完成,而且与真实的透视结果保持一致。 展开更多
关键词 透视 微角透视 几何 影点法
下载PDF
Influential Node Ranking and Invulnerability of Air Traffic Cyber Physical System 被引量:6
2
作者 WANG Xinglong HE Min 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2021年第2期288-297,共10页
To ensure flight safety,the complex network method is used to study the influence and invulnerability of air traffic cyber physical system(CPS)nodes.According to the rules of air traffic management,the logical couplin... To ensure flight safety,the complex network method is used to study the influence and invulnerability of air traffic cyber physical system(CPS)nodes.According to the rules of air traffic management,the logical coupling relationship between routes and sectors is analyzed,an air traffic CPS network model is constructed,and the indicators of node influence and invulnerability are established.The K-shell algorithm is improved to identify node influence,and the invulnerability is analyzed under random and selective attacks.Taking Airspace in Eastern China as an example,its influential nodes are sorted by degree,namely,K-shell,the improved K-shell(IKS)and betweenness centrality.The invulnerability of air traffic CPS under different attacks is analyzed.Results show that IKS can effectively identify the influential nodes in the air traffic CPS network,and IKS and betweenness centrality are the two key indicators that affect the invulnerability of air traffic CPS. 展开更多
关键词 complex network air traffic cyber physical system improved K-shell algorithm influential node ranking INVULNERABILITY
下载PDF
A NEWε-GENERALIZED PROJECTION METHOD OF STRONGLY SUB-FEASIBLE DIRECTIONS FOR INEQUALITY CONSTRAINED OPTIMIZATION 被引量:3
3
作者 Jinbao JIAN Guodong MA Chuanhao GUO 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2011年第3期604-618,共15页
In this paper, the nonlinear optimization problems with inequality constraints are discussed. Combining the ideas of the strongly sub-feasible directions method and the s-generalized projection technique, a new algori... In this paper, the nonlinear optimization problems with inequality constraints are discussed. Combining the ideas of the strongly sub-feasible directions method and the s-generalized projection technique, a new algorithm starting with an arbitrary initial iteration point for the discussed problems is presented. At each iteration, the search direction is generated by a new s-generalized projection explicit formula, and the step length is yielded by a new Armijo line search. Under some necessary assumptions, not only the algorithm possesses global and strong convergence, but also the iterative points always get into the feasible set after finite iterations. Finally, some preliminary numerical results are reported. 展开更多
关键词 E-generalized projection global and strong convergence inequality constraints method of strongly sub-feasible directions optimization.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部