系统功能的同异反综合判别法

本在讨论系统信息的整体性原理的基础上，给出了系统功能的同异反分析法及同异反状态的量化确定方法，并通过实例说明了它的实践过程及实际意义。     

基于SPA的学生成绩态势分析

SPA中的同异反态势排序可以根据需要作不同层次的展开。当把学生成绩作优、良、中、差四档次划分时,可对照同异反态势排序的一种展开来研究学生成绩中蕴含的信息。     

同异反动态关联分析方法

在B型关联分析基础上给出了同异反同一度和综合同一度的概念,论证了同异反动态关联分析的性质及其求解方法。为研究事物的发展态势提供了一种动态分析方法     

同异反灰色相关分析法中同异反趋势划分方法的改进

为了优化同异反(Identical-Discrepant-Contrary,简称IDC)灰色相关分析中同异反趋势划分方法,提高同异反趋势划分结果的精度,文章在分析两种传统划分方法存在不足的基础上,对其进行改进,提出了均分迭代划分法和回归系数比值划分法,并结合土壤中有机质含量和砷含量相关性的实例,对改进后的两种方法进行数值模拟.结果表明:改进后的两种划分方法得到结果的可靠度均较高,采用均分迭代划分法得到结果的可靠度为70%,采用回归系数比值划分法得到结果的可靠度为55%,略低于前者,这是因为土壤有机质含量中存在"异常"数据,对回归系数影响较大,降低了回归系数比值划分结果的精度.     

工业企业经济和环境综合效益的集对分析

应用集对分析中的同异反态势排序法进行了重点工业污染源资源消耗和排污状况分析.实例分析表明,该方法和评价模型具有简单实用的特点.     

基于集对分析的市场比较法的应用研究

利用集对分析法将待估房地产与交易实例形成对子,从不同的侧面刻画两个集合的相互关系.用集对分析的同异反联系度确定可比实例与待估对象的相似程度,最终求取比准价格.通过实证分析验证了模型应用的可行性.基于集对分析的市场比较法,具有计算简单、准确、可靠等特点,具有一定的推广和应用价值.     

塔机作业安全态势分析及趋势预测

为分析塔式起重机作业安全态势并预测其发展趋势,针对塔机作业安全复杂性与不确定性特点,运用集对分析理论,提出塔机作业安全五元联系数分析方法.首先,分析影响塔机作业安全的人员、机械、环境、管理四类因素,建立塔机作业安全分析指标体系;其次,拓展集对分析同异反联系数,引入塔机作业安全五元联系数;然后,运用态势函数静态分析塔机作业安全态势,采用全偏联系数动态预测塔机作业安全发展趋势;最后,以湖北省某建筑企业施工现场2号塔机作业为例,进行安全态势分析及发展趋势预测.结果表明:塔机作业综合安全等级为中等水平,呈正向发展趋势,研究结果能为塔机作业安全管理提供决策支持.     

基于SPA的同异反分析在蒙古族高血压与吸烟关系中的应用

利用集对分析理论中的同异反分析技术,分析一个随机抽取的蒙古族样本人群以研究蒙古族人高血压与吸烟的关系,结果发现长期和过量吸烟不利于血压正常,但短期和少量吸烟与血压关系不明晰的结论,说明吸烟有害健康有一个量变到质变的过程,平时吸烟对健康的危害具有潜伏性和累积性,平时要学会拒绝吸烟.     

洪灾综合风险分析方法讨论(Ⅰ)——基于集对分析理论

随着社会经济的发展及人们对洪水灾害认识的深入,洪灾风险的研究从单一风险转向综合风险,将是防洪减灾理论发展的必然趋势.根据洪灾风险的特性,引入信息的整体性原理,并应用集对分析理论对洪灾风险系统进行确定不确定分析,首次提出了洪灾系统风险的同异反分析方法.该方法将干旱、洪涝及其风险信息综合体现在洪水灾害系统的联系度中,从而为进一步开展详尽的综合风险分析奠定了理论基础.     

不确定性信息处理的集对论思想与方法

集对论从主体与客体联系层次上较好地实现了不确定性信息的整体处理,集对论的同异反集合和联系数等概念弥补了模糊集合论的缺陷。本文从概念上探讨了集对论的基本原理和思想方法,并与模糊集合论做了对比分析,认为集对论体现了认识过程中的辩证思维,因而具有更强的方法论意义。     

Recursive merge sort with erroneous comparisons

In this paper, we analyze the recursive merge sort algorithm and quantify the deviation of the output from the correct sorted order if the outcomes of one or more comparisons are in error. The disorder in the output sequence is quantified by four measures: the number of runs, the smallest number of integers that need to be removed to leave the sequence sorted, the number of inversions, and the smallest number of successive exchanges needed to sort the sequence. For input sequences whose length is large compared to the number of errors, a comparison is made between the robustness to errors of bubble sort, straight insertion sort, and recursive merge sort.     

Design of the federal express large package sort facility

In this paper, two mixed integer programming models, the Aggregate Bin Assignment Model (ABAM) and Aggregate Rack Assignment Model (ARAM), are developed for the analysis of possible large package sort facility designs for Federal Express Corporation. Applying the ABAM and RAM algorithm on the current topological design of the sort facility reduces the number of forklifts and total forklift travel time for accomplishing the sort by about 20%. Tests on 16 other configurations proposed by Federal Express indicated that savings of 33% with respect to the number of forklifts required and over 50% in the total forklift travel time when compared to the existing operations can be achieved.     

Prefix and suffix transreversals on binary and ternary strings

The problem of sorting by a genome rearrangement event asks for the minimum number of that event required to sort the elements of a given permutation. In this paper, we study a variant of the rearrangement event called prefix and suffix transreversal. A transreversal is an operation which reverses the first block before exchanging two adjacent blocks in a permutation. A prefix (suffix) transreversal always reverses and moves a prefix (suffix) of the permutation to another location. Interestingly, we will apply transreversal not on permutations but on strings over an alphabet of fixed size. We determine the minimum number of prefix and suffix transreversals required to sort the binary and ternary strings, with polynomial time algorithms for these sorting problems.     

A Note on Average-Case Sorting

This note studies the average-case comparison-complexity of sorting n elements when there is a known distribution on inputs and the goal is to minimize the expected number of comparisons. We generalize Fredman’s algorithm which is a variant of insertion sort and provide a basically tight upper bound: If μ is a distribution on permutations on n elements, then one may sort inputs from μ with expected number of comparisons that is at most H(μ) + 2n, where H is the entropy function. The algorithm uses less comparisons for more probable inputs: For every permutation π, the algorithm sorts π by using at most \(\log _{2}(\frac {1}{\Pr _{\mu }(\pi )})+2n\) comparisons. A lower bound on the expected number of comparisons of H(μ) always holds, and a linear dependence on n is also required.     

The wear contact problem with partial slippage

A method of analysing the variation in the stress state and shape of wearable bodies, subjected to the action of an oscillating shear load with partial slippage of the surface in the contact area is proposed. The method is based on the introduction of two time scales: the time of a single cycle of variation in the shear load and the time corresponding to a specified number of cycles. To estimate the shape variation of the surface due to wear a linear relation between the wear rate and the contact pressure and velocity of relative slippage is used. Cases of complete or partial removal of the wear particles from the friction zone are considered. As an example, the kinetics of the variation in the stress state in the contact of an elastic indentor, having a flat base and rounded edges, with an elastic half-space of the same material, is investigated. Analytical expressions for calculating the asymptotic values of the stresses and shape of the worn surface are obtained.     

四元联系数在2型糖尿病住院患者抑郁发生影响因子分析中的应用

把四元联系数U=A+Bi+Cj+Dk中的各联系分量A、B、C、D依次对应于被调查的2型糖尿病住院患者中没有抑郁发生(正常)以及有轻度、中度和重度抑郁情况的发生率,依据四元联系数的系统态势对不同影响因子作出分类;为医务人员采用不同的心理关怀和健康指导提供决策依据.     

Exponential ergodicity for stochastic Burgers and 2D Navier-Stokes equations

It is shown that transition measures of the stochastic Navier-Stokes equation in 2D converge exponentially fast to the corresponding invariant measures in the distance of total variation. As a corollary we obtain the existence of spectral gap for a related semigroup obtained by a sort of ground state transformation. Analogous results are proved for the stochastic Burgers equation.     

Certain Partial Conservativeness Properties of Intuitionistic Set Theory with the Principle of Double Complement of Sets

The Zermelo–Fraenkel set theory with the underlying intuitionistic logic (for brevity, we refer to it as the intuitionistic Zermelo–Fraenkel set theory) in a two-sorted language (where the sort 0 is assigned to numbers and the sort 1, to sets) with the collection scheme used as the replacement scheme of axioms (the ZFI2C theory) is considered. Some partial conservativeness properties of the intuitionistic Zermelo–Fraenkel set theory with the principle of double complement of sets (DCS) with respect to a certain class of arithmetic formulas (the class all so-called AEN formulas) are proved. Namely, let T be one of the theories ZFI2C and ZFI2C + DCS. Then (1) the theory T+ECT is conservative over T with respect to the class of AEN formulas; (2) the theory T+ECT+M is conservative over T+M{su?} with respect to the class of AEN formulas. Here ECT stands for the extended Church’s thesis, Mis the strong Markov principle, and M{su?} is the weak Markov principle. The following partial conservativeness properties are also proved: (3) T+ECT+M is conservative over T with respect to the class of negative arithmetic formulas; (4) the classical theory ZF2 is conservative over ZFI2C with respect to the class of negative arithmetic formulas.     

On extremal sort sequences

A sort sequence S_n is a sequence of all unordered pairs of indices inI _n = {1, 2, ..., n}. With a sort sequenceS_n = (s₁ ,s₂ ,...,s_{( 2ⁿ )} )S_n = (s_1 ,s_2 ,...,s_{\left( {_2^n } \right)} ), one can associate a predictive sorting algorithm A(S_n). An execution of the algorithm performs pairwise comparisons of elements in the input setX in the order defined by the sort sequence S_n except that the comparisons whose outcomes can be inferred from the results of the preceding comparisons are not performed. A sort sequence is said to be extremal if it maximizes a given objective function. First we consider the extremal sort sequences with respect to the objective function ω(S_n) — the expected number of active predictions inS _n. We study ω-extremal sort sequences in terms of their prediction vectors. Then we consider the objective function Ω(S_n) — the minimum number of active predictions in S_n over all input orderings.     

Recharacterizing Eulerian: Intimations of new duality

Eulerian graphs are shown to be characterized by being connected with each edge in an odd number of circuits, as compared with the traditional characterization having each cutset contain an even number of edges. This result is proved in the general context of binary matroids, and the intriguing sort of duality present is analyzed using syntactical duality principles.