等价类

• 4 . based on the partition of equivalence classes , the resolving of linear equations and the calculation of the dual basis , three methodologies are proposed to determine the algebraic representations of coordinates of finite field elements with the elements themselves as the variable
  4 、基于等价类的划分、线性方程组的求解和标准基之对偶基的计算，提出了域元素分量代数表达式的三种求法。
• Unfortunately , as changes are made to the data sources , maintaining the quotient cube is non - trivial since the partitioning of the cube cells must also be updated . in this paper , the authors design incremental algorithms to update a quotient cube efficiently for both sum and median aggregate functions
  然而，当数据源发生改变的时候， quotient数据立方体很难进行维护，尤其是针对median这样的非分步型聚集函数，因为当插入新的元组时， quotient数据立方体中的等价类有的需要进行拆分，有的还需要重新生成。
• The software test , aim was elaborateed by the original , fundamental means and software test automation . the aim of software test chiefly is the fault discover in the software , in view of this target , the difference quiz means may be adoptd , in case white box testing ( logic is covered , way covers and so on ) and black box testing ( the meritorous service be able to be tested , regression testing , performance test . ,
  软件测试的目的主要是发现软件中的缺陷，针对这一目标，可以采用不同的测试方法，如白箱测试(逻辑覆盖，路径覆盖等)和黑箱测试(功能测试、回归测试，性能测试、等价类划分和边界值分析等方法) ，设计测试用例，保证测试成功即找出软件中的缺陷。
• Meta - information eliminates the redundant data in the level of equivalent class , and describe the intersection between every pair of condition class and decision class in the form of number . thus , compared with information system ( or subsystems ) , meta - information requires far less storage , and its data structure is more simple and compact . due to these properties , meta - information integration generally cost less than data integration , and the performance of methods based on meta - information is generally better than methods directly operating on original data
  元信息在等价类层面上删除了冗余数据，并以类矩阵简练地描述条件类与决策类的包含关系，这不仅使元信息集成和维护的代价可以大大低于原始数据的集成和维护，而且能够有效提高属性相对约简、规则获取等粗糙集方法的性能。
• A widely used method for checking real - time systems is , according to the real - time property to be checked , to use a proper bi - simulation equivalence relation to convert the infinite - timed state space to a finite equivalence class space . the algorithm needs only to explore the finite space to get a correct answer . in most cases , exhaustive exploration is very difficult because the equivalence class space increases explosively when the scale of the system increases . in this paper , an equivalence relation is introduced to check whether a concurrent system , which is composed of a finite set of real - time automata , satisfies a linear duration property . to avoid exhaustive exploration , this paper also introduces a compatibility relation between timed states ( configurations ) . based on these two relations , an algorithm is proposed to check whether a real - time automaton network satisfies a linear duration property . the cases study shows that under some conditions this algorithm has better efficiency than the tools in the literature
  一个被广泛用于验证实时系统的方法是根据被验证的实时性质,使用适当的双向模拟等价关系使无限的状态空间转化为有限的状态等价类空间.算法只需要在这个有限的等价类空间里搜索就可以得到正确答案.但是,这个等价类空间的规模一般随着系统规模的增大而产生爆炸性的增长,以至于在很多情况下,穷尽搜索这个空间是不现实的.该文引入了一个等价关系来验证一个由多个实时自动机通过共享变量组成的并发系统是否满足一个线性时段特性.同时，还引入了格局之间的兼容关系来避免对状态等价类空间的穷尽搜索.基于这两个关系,文章提出了一个算法来验证是否一个实时自动机网满足一个线性时段特性.实例研究显示,此算法在某些情况下比其他一些工具有更好的时间和空间效率
• Now there are 5 constructive methods have been found , through which all of the complementary sequences whose length is 2 ' 10s26 " can be constructed . it was proved in this paper that it can determine which equivalence class is constructible or not by the feature seque nce . based on the reseach and computer we have got all the equivalence complementary sequence class with length of not more than 40 , and found a new complementary sequences kernel with length of 20
  经分析发现当序列长度n 4时，可以根据特征序列来判断互补序列等价类空间大小，这对实际应用中互补序列的选取具有一定意义；此外本文证明了互补序列等价类的唯一性，即不同的等价类不能包含相同的序列；对互补序列的各种构造方法进行分析，发现通过每种构造方法构造出的互补序列其特征序列均具有某种特性，通过论证得出可以通过特征序列来判断互补序列是否是可构造的以及可以由哪种构造方法构造，并通过特征序列证实了长度为20的互补序列的核的存在性。
• We design a new algorithm - pmimd . the emphasis of the paper is to discuss the framework of the mpls network and the support for traffic engineering . i have learned several main topics about the traffic engineering based on mpls : how to map the data into lable ; how to map lable into fec . for the most important topicrhow to map traffic trunk into the actual topological network by lsp , i have designed a kind of adaptive traffic control mechanism called latc . the simulation expriments have proved the validity and the effect of latc
  本文还论述了mpls (多协议标签交换)网络的架构及其对流量工程的支持，研究了基于mpls流量工程要解决的几个主要问题：如何把数据包映射为转发等价类，如何把转发等价类映射为流量中继等，并对其中最重要的一个：通过lsp (标签交换路径)把流量中继映射到实际网络拓扑，提出了一种自适应流量控制机制? latc ；通过相应的仿真，验证了该机制实施的合理性和有效性。