队列

The second key idea is that the incoming audio for each connection is copied into a seperate queue for each of the other connections in a conference as it arrives, and the outgoing audio for each connection is created from the algebraic sum of the the incoming queues for that connection.

第二个关键的想法就是，在一个会议中，一个连接上有语音输入时，都会拷贝一份到其他连接为其分别准备的队列中，而连接上的语音输出则是那个连接所有输入语音队列的代数和。

In the algorithm, all kinds of packets are firstly classified into queues according to their own priorities. Then the buffer state is divided into three phases, including normal, congestion avoidance, and congestion according to their buffer usage ratio. The three phases are crossover each other because of their fuzziness. Then by combining the whole congestion control, with the part congestion control, the fuzzy algorithm is carried out.

它对所有到达的数据流按照一定的优先级进行分类，并把全局性缓冲区和各队列的局部性缓冲区按照正常、拥塞避免和拥塞的规则划分为3个具有交叉过渡域的几个阶段，然后采用整体和局部相结合的拥塞控制方法，实现了队列调度过程中的模糊性处理。

Adaptive weighted scheduling scheme to provide fair excess bandwidth allocation among service classes: Current fixed weighted scheduling in DiffServ can not respond to the changes of traffic load cither provide fair bandwidth to each flow in AF and BE services. This thesis proposes an adaptive scheduling scheme, which can be combined to any weighted scheduling algorithm.

支持多服务队列间带宽分配公平性的自适应加权调度机制：针对固定权值调度在网络负载发生变化时不能为各服务队列提供公平带宽分配的问题，本文提出了一种可与各种加权调度算法联合部署的加权调度机制。

The article finally ends talking about two queues volatile and dead letter queue.

文章最后结束谈论两个队列动荡和死信队列。

When you delete a queue, the deletion process takes up to 60 seconds.

当你删除了一个队列，这个删除队列的进程需要占用60秒的时间。

Based on the above-mentioned analysis, this paper improves the classical binary heapscheduling algorithm of data structure from the priority perspective of the queue. We call it"Heap+". This scheme enables the pipelining of the enqueue and dequeue operations toreach very parallelism. At the same time it has very availability of resources andexpandability. It is used in taxis operation of virtual starting time with very precision on thehigh-speed data link.

基于对队列调度算法的介绍和分析，本文从队列的优先级角度入手，对数据结构中经典的二进制堆调度算法进行了改进，使之能通过流水线操作达到高度的并行性，且具备很高的资源利用率和可扩展性，可用于高速链路上高精度虚拟开始时间的排序操作。

A task's svc hook method can use ACE_Task::getq to dequeue messages placed onto the message queue and process them concurrently. The getq method blocks until either a message is available on the message queue or the specified absolute timeout elapses. The blocking nature of getq allows the thread of a task to block and only wake up when there's work available on the message queue.

一个任务的svc挂钩可以使用ACE_Task：：getq来出队消息和并发处理他们。getq方法阻塞直到在队列上有一个消息可用或者制定的超时发生。getq允许线程在惹任务中阻塞，仅在消息队列中有工作可作才被唤醒。

A tasks svc hook method can use ACE_Task::getq to dequeue messages placed onto the message queue and process them concurrently. The getq method blocks until either a message is available on the message queue or the specified absolute timeout elapses. The blocking nature of getq allows the thread of a task to block and only wake up when theres work available on the message queue.

一个任务的svc挂钩可以使用ACE_Task：：getq来出队消息和并发处理他们。getq方法阻塞直到在队列上有一个消息可用或者制定的超时发生。getq允许线程在惹任务中阻塞，仅在消息队列中有工作可作才被唤醒。

Simulation results demonstrate that it can lead to the convergence of the queue length to the desired value quickly and maintain the oscillation small.

仿真结果表明该方法可以使队列长度快速收敛到设定值，同时使队列震荡最小，结果也表明在网络条件变化的情况下，该算法优于模糊控制和变结构控制。

The model can decide the head location, the end location and the length of any queue in traffic network real time.

该模型能实时确定路网中任意车流形成的排队队列的头部位置、尾部位置和队列长度。

In the United States, chronic alcoholism and hepatitis C are the most common ones.

在美国，慢性酒精中毒，肝炎是最常见的。

If you have any questions, you can contact me anytime.

如果有任何问题，你可以随时联系我。