1) norm order
范数排序
2) von neumann sort
范诺曼排序
3) sequential norms
序列范数
1.
We discuss strongly exposed property and exposed property of vector-valued Banach sequence spaces ss(E) equipped with sequential norms and give their criteria.
刻划了赋序列范数的矢值B anach序列空间ss(E)的强暴露性和暴露性,给出了它们的判据。
2.
Vector valued sequence spaces ss(E) with the sequential norms are generalization of Banach sequence spaces lp(E),the discussion on the geometric properties of ss(E) is important in the theory of the Banach spaces.
赋序列范数的矢值序列空间ss(E)是Banach序列空间lp(E)的推广,其几何性质的讨论是Banach空间理论的重要组成部分。
4) radix sorting
基数排序
1.
The positive region based on radix sorting is used to get the positive region condition attributes set of decision attributes and the condition attribute set which excludes one of the condition attributes of decision attribute positive region.
采用基数排序思想计算正区域,分别得到决策属性正区域的条件属性集和除决策属性正区域的一个条件属性之外的条件属性集,并且计算这2种属性集的基数之差,以判断该条件属性是否是核属性,依次判断所有条件属性,从而快速获得所需要的核。
2.
By profound exploration on radix sorting algorithm and using of its ideas as “distribution” and “collection”, together with the binary data s feature——Bit Sectional Sorting, a kind of non-comparative sorting algorithm has been developed.
利用基数排序算法“分配”、“收集”的思想 ,以及二进制数据按位存贮的特征 ,改进出一种非比较排序算法———按位分段排序算法 ,并通过对该算法时间复杂度和空间复杂度的分析 ,体现其明显的优越
3.
Correctness of a classic sorting algorithm of linear time complexity and realization of radix sorting were proved and the time complexity of it was analyzed from the viewpoint of the "big-O notation".
采用“大O表示法”客观地分析了基数排序算法的时间复杂度,给出了基数排序算法的实现和正确性的证明,并与比较排序算法作了横向的运行时间的对比。
5) radix sort
基数排序
1.
The essay analyzes the marshalling requirement of shunting plan for train detaching and attaching,and puts forward the problem of shunting trip plan could be solved by using radix sort algorithm,so the shunting mathematicization could be reached,and the sort based on trainset serial had been realized on the CIPS of Chengdu Norther marshalling station.
分析摘挂列车调车计划的编制要求,把调车钩计划的问题应用基数排序算法进行解决,使调车问题数学化,采用按车组序列化排序,并实际应用在成都北编组站综合集成自动化系统(CIPS)中。
2.
In this paper,radix sort using distributing counting sort method is put forward.
提出了一种基于分布计数的基数排序方法,给出该算法定义、算法描述、算法正确性证明和算法分析;讨论了基于该排序算法几个关键问题的解决方法。
3.
A new practical "in-place" sorting algorithm,called super quick sort,is obtained by merging some characteristics of radix sort and quick sort.
快速排序算法结构简单,平均性能较佳;基数排序性能较稳定。
6) sorting index
排序指数
1.
This thesis discusses a method to determine the weight value of influencing factors of towing security,and introduces the application of sorting index for the degree of importance,meanwhile discusses the method of variable weight synthesizing decision using in ship towing.
运用重要度排序指数法对拖航安全性影响因素的权重进行评价,对变权综合决策方法在舰船拖带中的应用进行了探讨。
补充资料：Luxemburg范数
Luxemburg范数
Luxemburg nonn
L峨曰血叱范数〔I一血叱~;J如盆c服6yP住肋p-Ma] 函数 ，‘x!.(M，一、{*:*>o，丁、(，一’x(:))‘:‘1}， G这里M(u)是关于正的u递增的偶凸函数， 怒“一’M(u)一忽u(M(u))一，一0，对“>0，M(“)>0，且G是R”中的有界集.此范数的性质曾由W.A.J.h以油比飞〔11作了研究.L~b鸣范数等价于O正ez范数(见0口厄空间(C旧允2 sP创芜))，且 I{x}I(，)簇1 lx}I，蕊2 11 x 11(、).如果函数M(u)和N(u)是互补(或互为对偶)的(见O市口类(Or比zc地”‘、则 ，，·，，(一sun{)·(!，，‘!，“!:，，，，，《一‘，}·如果z‘(t)是可测子集E CG的特征函数，则 !l:二11‘M、-一下尖二一. ““启”‘川M一’(l/n篮‘E)’
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条