集合 1.(聚集) gather; assemble; muster; call together 紧急集合 emergency muster; 集合在一起 assemble together; 集合 ! (口令) fall in! 学生在学校礼堂集合。 the pupils assembled in the school hall. 我们七点三刻在饭店门口集合。 we'll gather at the gate of the hotel at a quarter to eight.2.[数学] [自动化] [计算机] assemblage; set; collection; rendezvous; ensemble; aggregation; 集合城市 conurbation; 集合地点 assembling place; 集合点 meeting point; 集合函数 set function; 集合号 bugle call for fall-in; assembly; 集合体 aggregate; plural; complex
Matrix characterization of relations in finite sets 有限集合上关系的矩阵描述
When the domain / is finite , j is infinite , sufficient and necessary conditions for existences of an attainable solution and a minimal solution are obtained 当论域i为有限集合, j为无限集合时,给出了存在可达解以及存在极小解的充要条件。
The title attribute can be one of a finite set of possible values - mr , ms , and mrs - so you intend to implement a Title属性是由可能值mr 、 ms和mrs组成的有限集合中的一个值,所以准备用typesafe enumeration (类型安全的枚举)设计模式来实现一个
The checking method for the associative law of finite groups is discussed by programme . in the same time , the checking of dosure law , unit element and mverse element , is added into the program , so that it can check whethe a finite set is a group for the giving binary operation 用编程的方法讨论了群论中结合律的检查,同时把闭合律、单位元、逆元的检查也添进程序中,使得该程序能检查一个有限集合对所给二元运算是否成一个群
According to the partition of set and the definition of covering , this article which takes advantages of the admissible and repelling law and the set theories indicates the relationship of partition and equality , special - covering and admission and the accounting formula of partition numerals and special - covering numerals 本文根据集合的划分与覆盖的定义,利用容斥定理和集合理论,给出了有限集合上的划分与等价关系、完全覆盖与相容关系的关系,以及有限集合上的划分数和完全覆盖数的计算公式。
A block design is a triple d = ( x , b , i ) , where x is a finite set ( the point set ) of order v , b is the block set and / is the incidence relation between x and b . for the given block design d , if all the blocks from x , which have the same type of the blocks in b , can be partitioned into some bi , such that each ( x , bi , i ) is a block design with the same parameters and the same type as d , then { ( x , bi , i ) } i is called as large set of d - design of order v . on the other side , let | x | = v , | y | = v + 1 , and x y , if all the blocks of the same type from y can be partitioned into some bx , such that each ( y { x } , bx , i } is a block design of order v for any element x y with the same parameters and the same type as d , then { ( y { x } , bx , i ) } x is called an overlarge set of d - design of order v . in this thesis , we discuss the existence problem about some types of large sets and overlarge sets 一个区组设计是由两个有限集合x , b及它们之间的关联关系i组成的,记为d = ( x , b , i ) ,其中x为v元集, b为区组集,对于指定的设计d ,若x上与d相应的全部构形可分拆为若干个b _ i ,使得每个( x , b _ i , i )皆为一个与d同参数同类型设计,则称这些b _ i构成一个v阶d -设计的大集。若v元集x是v + 1元集y的一个子集,而y上与d相应的全部指定构形可分拆为若干个b _ x ,使得每个b _ x恰是y { x }上的一个与d同参数同类型的设计(其中x y ) ,则称这些b _ x构成一个v阶d -设计的超大集。本文中讨论了一些区组设计的大集及超大集。