查询词典 reduce a penalty

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，对于其他的条件转移指令采用动态预测机制来预测其方向。

At the early iteratives, the mutation rate is bigger and the aim is to make particles to explore smaller and isolate region and to avoid the algorithm trapping to the local optimum. While the algorithm runs, the mutation rate will be decreased to reduce the disturbing to the particles. IPSO adopts a new method that congregates some neighboring individuals to form multiple sub-populations in order to lead particles to explore new search space. Additionally, our algorithm incorporates a mechanism with a simple and easy penalty function based on the largest distance between the particle and the boundary of the feasible region to handle constraint.

IPSO采用了一种新型的变异策略，变异概率随着算法的运行是动态变化的：在算法运行初期，变异概率大，其目的是使算法不但能够探测到目标空间中的孤立区域，而且避免搜索陷入局部极值；在算法运行后期，变异概率逐渐变小，以减少对粒子的扰动；算法通过将部分具有邻近距离的粒子聚集成核形成多子群引导种群中粒子的飞行；采用一个简单的基于粒子与可行域边界最远距离的罚函数处理约束的机制，使得算法高效实现。

He is going to appeal to a higher court to reduce his death penalty to life imprisonment.

他打算上诉请求将死刑减为无期徒刑。

According to this phenomenon, this paper established game model for passerby and traffic officer by means of the basic principles of game theory. Two methods including pure strategy and mixed strategy will be introduced here. Based on the analysis, this paper found that there was no Nash equilibrium on pure strategy. And strengthening management on the traffic officer will reduce the probability of passerby running a red light. Furthermore, even though strengthening the penalty of the illegal passerby will make effect in short time. However, in the longtime, the phenomenon will go on and the traffic officer will be lazier at reverse.

针对这一现象，本文利用博弈论的基本原理，建立行人和交警的博弈模型，通过纯策略与混合策略这两种方法对行人和交警的博弈进行分析，结果发现行人和交警之间的博弈不存在纯策略纳什均衡，而在混合策略下，得出了只有加大对交警的监管力度才可以降低行人闯红灯的发生率，相反即使加大对闯红灯的行人的处罚力度，短期内的确可以起到一定的效果，但是就长期而言，闯红灯现象发生依旧频繁，而且使得交警更加的懒惰，达到适得其反的效果。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。