The thesis , in the probability analysis and computation , considers the failure history of space frames and trusses , adopts the bound criterion and algorithms on the base of system ' s critical strength , and introduces the soft self - adaptation control bound into the identification of dominant failure modes ; at the same time , with the incremental load method and differential equalized recursive method , computes the limit - state function of failure mode and probability index precisely under no leaking the dominant failure modes 文中在可靠性分析和计算部分,考虑空间刚桁架结构系统的失效演化历程,采用基于系统临界强度的约界准则和约界算法,将柔性自适应控制边界引入失效模式识别过程;同时,用荷载增量法和微分等价递归算法相结合,确保在严格不遗漏主要失效模式的情况下,快速准确地求解失效模式的极限状态方程和可靠度指标。
Compared with the recursive method based on the relationships between vertices and planes , our method for computer interpretation of line drawings based on the relationships of vertices and straight lines has the advantage that it is easier to obtained the three - dimensional structure of a line drawing from its two - dimensional structure 相对于基于点与平面的相对位置关系解释线框图,基于点与直线的相对位置关系解释线框图具有容易从线框图的平面结构推出其空间结果的优点。
( 3 ) adaptive sample algorithm such as predicted covariance threshold method , pre - establish sample interval method , and recursive method have been researched . we especially analyze the advantage and disadvantage of predicted covariance threshold method and pre - establish sample interval method , and present an improved pre - establish sample interval method 分析了当前常用的预测协方差门限法,预先定义采样间隔法以及递推法,特别分析了预测协方差门限法和预先定义采样间隔法的优缺点后,综合两者的优点提出了改进的预先定义采样间隔法。
The main content includes : in assembling analysis , three - line - one - row matrixes are obtained by getting the length , width and height of packing cases . any given packing cases are assembled by using pedigree assembling analysis , thus , we can obtain the number of the sorts and the length , width and height of each sort ; in loading a container , the input is any four kinds of them that are just sorted . the chanced packing cases are loaded by using tier up tier principle , side method and recursive method so that we can obtain higher space occupation ; in diagrammatic representation , the result of loading a container is shown in the screen by using simple one - dimension and tow - dimension diagrams 本文围绕这一主题进行了深入的理论和实践研究,具体内容有:在聚类分析中,利用谱系聚类分析原理,提取包装箱的长宽高作为三行一列矩阵,对给定的任意尺寸的包装箱进行聚类分析,聚类后,得到聚类的个数和各类的长宽高;在方案生成中,选取了聚类后其中的任意四种作为方案生成的输入,利用层叠原理,边际方法,递归原理对选取的包装箱进行装箱,以达到占有率较高的目的;在图形显示里,对方案生成结果作了一个简单的一维和二维的示意图。
Using the theories of probability , algebra and number theory comprehensively , we investigate a class of boolean functions with three - valued walsh spectrum in the first part of this dissertation : the properties of the extended semi - bent functions , which are constructed from any two bent functions , are studied , followed by the structure characteristics of the boolean functions satisfying propagation criterion with respect to all but two vectors ; the definition and cryptographic properties of k - order quasi - bent functions are proposed whose walsh spectrum takes on only three values . some sufficient and necessary conditions are offered to decide whether a boolean function is a k - order quasi - bent function ; a special method is presented to construct the k - order quasi - bent functions , whose cryptographic properties are explored by the matrix method , which is different from the method of walsh spectrum and that of autocorrelation of boolean functions ; the application of this kind of boolean functions in the fields of stream cipher , communications and block ciphers is discussed , which shows the great importance of the fc - order quasi - bent functions ; some methodology are proposed to construct the k - order quasi - bent functions , including the complete construction by using the characteristic matrices of boolean functions , and the recursive method by two known k - order quasi - bent functions we further extend our investigation to the ring zp , where p is a prime , and the similar results are presented as far as the p - valued quasi - generalized - bent functions are considered 本文首先综合运用概率论、代数学、数论等基础学科的理论知识,并以频谱理论作为主要研究工具,对一类谱值分布相对均匀的函数? ?广半bent函数、 k阶拟bent函数和p值k阶拟广义bent函数进行了系统、深入的研究,给出了广半bent函数定义,并探讨了广半bent函数的密码学性质;给出了k阶拟bent函数和p值k阶拟广义bent函数的定义及等价判别条件;讨论了k阶拟bent函数和p值k阶拟广义bent函数与部分bent函数和p值广义部分bent函数的关系,探讨了它们的密码学性质;给出了k阶拟bent函数和p值k阶拟广义bent函数的典型构造方法,并将对k阶拟bent函数的密码性质的研究转化到对一类特殊的矩阵的研究上;利用布尔函数的特征矩阵原则上给出了k阶拟bent函数的一种完全构造方法,还给出了从已有的p值k阶拟广义bent函数出发,递归构造变元个数更多的p值k阶拟广义bent函数的方法;初步探讨了k阶拟bent函数在序列密码、分组密码以及通信中的应用;给出了一类布尔函数walsh谱的分解式,并利用这类布尔函数的walsh谱分解式给出了一类近似稳定的布尔函数的构造,特殊情形下为k阶拟bent函数;利用代数数论的知识考察了p值k阶拟广义bent函数的谱特征,并给出了k阶拟广义bent函数与所有仿射函数的符合率特征等等。
By constructing martingale and using its properties , the paper gets lundberg inequality of the ultimate ruin probability and the general formulas . moreover , by using the recursive method , a lot of the theoretical problems are resolved , such as the distributions of the ruin time and the ruin lasting time , the ruin probability in finite time , the ultimate ruin probability . furthermore , in this paper , the distributions of the surplus and the maximum surplus before ruin , the distribution of deficit at ruin , the joint distribution of surplus before and at ruin and the maximum surplus before ruin are obtained 通过构造鞅并使用鞅的有关性质,得到了最终破产概率所满足的lundberg不等式及其一般公式,并利用递推方法对该模型作了比较全面地探讨,得到了破产时刻的分布、破产持续时间的分布、有限时间内的破产概率、最终破产概率;得到了破产前盈余的分布、破产前最大盈余的分布、破产时赤字的分布,以及三者的联合分布。
The innovation in this thesis is that a new recursive method of computer interpretation of line drawings is put forward to based on a new way of thinking of the correlative positions between vertices and lines and the constraints between vertices and lines on a planar object . some experiments are implemented 本文主要创新点为:提出了基于点与直线的相对位置关系解释线框图的新思路,给出了相关的约束关系式,在此基础上提出了递归解释线框图的新方法,具体算例证明了该方法是可行的和有效的。