branch curve

branch curve的基本解释

-

分支曲线

与branch curve相关的网络例句 [注：此内容来源于网络，仅供参考]

Based on a lot of experiment results, a conclusion is drawn: comparing with other factors, the performance of branch handling strategy is the key limits of processor to exploit the instruction level parallelism existed in nonscientific code, cache miss have severe effect on superscalar processor's performance when it runs scientific code. Second, in order to reduce the branch penalty and improve the performance of superscalar processor, a new branch handling strategy—a classification based hierarchical branch handling strategy, CHBHS is proposed. It first expands the traditional processor architecture to support multiple condition code, conditional execution and Mbranch instruction, as a result, compiler can reduce the number of static conditional branch when the code is generated. Then, CHBHS tries to use the best suitable mechanism to deal with different branch base on their different behavior. CHBHS can predict the target address of unconditional branch, subroutine call and conditional branch by buffering their target address in branch target buffer, a newly proposed high efficient return address stack is used to reduce the penalty of subroutine return instruction, a new Counter Register Stack is also proposed to reduce the penalty of loop-closing branch to zero, and dynamic branch predictor is incorporate with branch target buffer to predict the outcome of conditional branch.

基于上述结论，为了尽量消除转移指令对处理器开发指令级并行性能力的影响，进一步提高处理器性能，在详尽分析目前已存在的转移处理策略的特点与局限性的基础上，首次提出了一种新的转移处理策略即基于分类的层次转移处理策略CHBHS(Classification Based Hierarchical Branch Handling Strategy)，它首先通过扩展传统的体系结构，支持多条件码、条件式执行及多分支转移技术，以使编译程序在进行代码生成时可尽量少生成条件转移指令，从而减少静态条件转移指令的数目；其次，基于不同的转移指令的行为不同这一事实，提出了对不同的转移指令采用不同的机制进行处理的思想，即对无条件转移指令和函数调用指令以及条件转移指令的目标地址，采用转移目标缓冲器来预测，对于函数返回指令，采用所提出一种的高效返回地址栈来预测其目标地址，对于大多数循环控制转移指令，采用所提出的Counter Register Stack来将其所可能带来的损失减少为0，对于其他的条件转移指令采用动态预测机制来预测其方向。

In this paper, a region approximation idea that means using a "fat curve" with a width to approximate the offset curve is proposed, and a complete set of algorithms to approximate offset curve using disk Bézier curve are given and implemented. In the algorithms, the optimal and uniform approximate curve of the offset curve as the central curve of the Disk Bézier curve is found by using Remez method, and then the upper optimal and uniform approximation principle is proposed to compute the error radius function of the Disk Bézier curve. Thus, the whole Disk Bézier curve can be obtained. In the end of this paper, the approximate effect of the Disk Bézier curve is not only analyzed and assessed, but also some specific examples are provided.

提出用一条带宽度的"胖曲线"来逼近上述等距曲线的区域逼近思想，并建立与实现了圆域Bézier曲线等距逼近的整套算法，包括应用Remez方法求出等距曲线的最佳一致逼近曲线作为圆域Bézier曲线的中心曲线，提出上控最佳一致逼近的原理求出圆域Bézier曲线的误差半径函数，以及确定整条圆域Bézier曲线，最后还对该圆域Bézier逼近的效果做了分析和考核，并给出了一些具体实例。

This paper establishes cubic spline function, analyzes subsection curve function and curve slope and curvature, at last decides to place the curve especial points which can be obtain easement curve length and other line parameters, such as the ZH point (end of line and beginning of transition curve), the HY point (end of transition curve and beginning of circular curve), the QZ point, the YH point (end of circular curve and beginning of transition curve), the HZ point (end of transition curve and beginning of line).

针对公路平面线形的8种组合类型，其线形元素特征则由最基本的直线、圆曲线、缓和曲线组成的特点，解析三次样条函数模型，得分段曲线函数、曲线斜率、曲率，从而确定曲线特征点（直缓ZH点、缓圆HY点、曲中QZ点、圆缓YH点、缓直HZ点）位置，进而得到曲线缓和曲线长度及其他线形参数。

与branch curve相关的网络解释 [注：此内容来源于网络，仅供参考]

branch curve：分枝曲线

branch and bound method 分支限界法 | branch curve 分枝曲线 | branch cut 分支切割

branch curve：分枝线

枝;分枝;支路 branch | 分枝线 branch curve | 分枝切割 branch cuts

branch curve：分支曲线

branch current 分路电流 | branch curve 分支曲线 | branch cut 分支切割

branch of a curve：曲线的分枝

branch line 分枝线 | branch of a curve 曲线的分枝 | branch of function 函数的分枝

branch of a curve：曲线的分支

branch node 分支节点 | branch of a curve 曲线的分支 | branch of clivus 斜坡支