其他更改主要针对将可用内存划分出一些必要的缓存，例如包缓存和编目缓存，或者调整短事务的设置(日志记录和排序)。
The other changes are primarily due to dividing up the available memory for necessary caches like the package and catalog cache or adjusting the Settings for short transactions (logging and sorting).
Artist：包括常用名的特性和用于排序的名称(例如，“TheRoots”可以按“Roots, The”来排序)，以及艺术家专辑的rdf包。
Artist: includes properties for the common name, and the name to be used for sorting (for example, "the Roots" could be sorted as "Roots, the"), as well as an RDF bag of the artists' albums.
答案很简单，我走，是因为我身上带赃，就是原来的那副牌，第三把牌我已经把我朋友带来的那副排序好的牌跟在打的那副调了包。
The answer is very simple, I go, because my body with him, is that the original CARDS, third CARDS I have put my friend brought the sort CARDS in play with the transfer of packets.
可以使用此工具包创建项目，创建和跟踪问题，指定问题所有者，使用布尔搜索对问题进行查询和排序。
You can use this kit to create projects, create and track issues, assign issue owners, and query and sort issues using a Boolean search.
为了对失序数据包进行重排序，应用程序需要预留一个适当的缓冲区以存储期望包到达之前的数据包。
To rearrange the out of order packets, the application software must reserve a buffer to store the packets before the expected packet arrives.
许多研究表明，在高并行度和不同链接速率的无线网和卫星网中都存在包的重排序。
Numerous studies have shown that packet reordering is common, especially at wireless and Satellite networks where there are high degree of parallelism and different link speeds.
颤抖缓冲的目标就是将它们缓冲到足够长（不跨越必须的）并对这些包进行重排序，然后才送给进行解码。
The purpose of a jitter buffer is to reorder packets and buffer them long enough (but no longer than necessary) so they can be sent to be decoded.
没有要求一个特定的排序的数据在OBJ，所以每个造型包写以自己的方式。
There is no requirement for a specific ordering of the data inside the OBJ, so each modelling package writes it in its own way.
这些白皮书排序通过业务侧的授权和如何解释map工具包提供了详细的报告。
These white papers sort through the business side of licensing and how to interpret the detailed reports the MAP Toolkit provides.
本文提出了基于帧的近似排序包调度新算法(FASFQ)。
A novel scheduling algorithm called FASFQ (frame based approximate sorting fair queueing) is proposed, in which the conventional packet sorting is substituted with frame sorting.
本文提出了基于帧的近似排序包调度新算法(FASFQ)。
A novel scheduling algorithm called FASFQ (frame based approximate sorting fair queueing) is proposed, in which the conventional packet sorting is substituted with frame sorting.
应用推荐