查询词典 lexicographic order

LexMiner utilizes the lexicographic features and lexicographic comparisons to further speed up the kernel operation of mining algorithms.

LexMiner 进一步利用项目集的字典序特性与字典式比较以加速探勘演算法中的核心运算—寻找交易纪录中包含之可能频繁项目集。

However, in other locales, the order of characters in the character set may differ from the lexicographic character order.

然而，在其他地区文化中，字符在字符集上的次序可能与其在字典上的次序有所不同。

In the "C" locale, the order of the characters in the character set is the same as the lexicographic order of the characters.

在 "C"中所使用的地区文化中，字符在字符集ASCII 字符集）上的次序与字符在字典上的次序是相同的。

A concurrency control framework for replicated CSCW was presented based on the above analysis. To support the framework,a new total order, the lexicographic total order, for operation execution was defined.

采用向量时间方法，在规定操作执行次序方面定义一种新的字典全序，并设计了通用失序纠正策略。

When an order is form in position machine, the needed breeds and quantity of cigarette will be established and thesequence and time of cigarette sorting in an order will be also established, so before sorting an order, the order'length can be compute, but before sorting an order, the order's space is existenced as a virtual space, thus supposed a virtual space which loaded finished cigarette and order when virtual space arrive the corresponding sorter, plc control the time parameter and activated the sorting, and the sorter sorting cigarette to virtual space, an order accomplished.

对件烟行走时间进行了建模并提出了一种烟草自动分拣算法，当订单在上位机生成后，所需烟品种及数量随之确定，因此订单中所要分拣的烟分拣的次序及分拣的时刻也就可以确定，所以在订单分拣之前，订单的长度是可以计算出来的，而在未真正分拣之前，订单的长度是一个&虚拟存在的空间&，应用逆向推理的过程可假设一个装成品烟和订单的&虚拟空间&，当&虚拟空间&到达对应的分拣机位置时，通过plc对订单中件烟时间参数的控制，分拣机自动分拣件烟至&虚拟空间&完成订单分拣，该算法实现方便并能节约大量的硬件成本，对其他一些物流分拣行业也具有一定的推广价值。

By using this algorithm, all permutations can be systematically generated in lexicographic order.

藉由此演算法，我们可以依字母大小序地系统化产生所有的n项目排。

The filenames starting with decimal digits are sorted in lexicographic order and used as additional configuration files.

档名以数字开头的档案按照字典方法排序后，依额外设定档处理。

Some lexicographic path order.

一些字典路径。

By using these "ranking" and "unranking" algorithms, any permutation that is positioned in lexicographic order, away from a given permutation by any specific distance, can be generated. This significant benefit is the main difference between the proposed method and previously published alternatives.

藉由此个演算法，我们可以产生一个n项目的排任意距，依字母大小序而言，的另一个排；此特点是我们的方法与其它研究最同的地方。

The contributions are listed as follows:(1) a single-pass closed frequent itemsets mining process based on reverse lexicographic order FP-tree is introduced for mining classification association rules, which uses a kind of mixed item-ordering searching policy to satisfy the single-pass requirement of data streams and uses the bitmap technology to improve the efficiency;(2) the concept of self-support for filtering rules is proposed to improve the precision.

主要贡献在于：1提出了一种基于逆文法顺序FP-Tree的频繁闭项集单遍挖掘过程，用于挖掘类关联规则，该过程采用了一种混合项顺序搜索策略以满足数据流挖掘的单遍性需求，并采用位图技术提高效率：2提出了"自支持度"概念，用于筛选规则以提高算法分类精度。

"Bird Man's Diary, Butting on the Love Island", Changsha, China

2008年"鸟人日记，顶在爱情岛"，中国长沙

As long as they were in the service of a family of wizards, their magic would remain dormant.

只要他们一天为家庭服务，他们的法力就潜藏不动。