具有遗传性疾病和性状的遗传位点分析

随着信息技术的进步和发展,现代生物学越来越多地将这些技术用于大规模生物数据的收集、分析、挖掘等过程.大量计算机技术,特别是统计方法被用来进行复杂疾病的分析.大量研究表明,人体的许多表型性状差异以及对药物和疾病的易感性等都可能与某些位点相关联,或和包含有多个位点的基因相关联.因此,定位与性状或疾病相关联的位点在染色体或基因中的位置,能帮助研究人员了解性状和一些疾病的遗传机理,也能使人们对致病位点加以干预,防止一些遗传病的发生.利用随机森林方法、Bootstrap重抽样、logistic回归等大数据分析方法,意在解决优化生物学位点关联性分析中单一致病位点识别、多位点相互作用和多性状位点关联性分析等子问题.     

Permutations via linear translators

We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first characterize some functions having linear translators, based on which several families of permutations are then derived. Extending the results of [9], we give in several cases the compositional inverse of these permutations. The connection with complete permutations is also utilized to provide further infinite classes of permutations. Moreover, we propose new tools to study permutations of the form $x\mapsto x+{(x^{p^m}-x+\delta )}^s$ and a few infinite classes of permutations of this form are proposed.     

Failure of n‐uniqueness: a family of examples

In this paper, the connections between model theory and the theory of infinite permutation groups (see 11 ) are used to study the n‐existence and the n‐uniqueness for n‐amalgamation problems of stable theories. We show that, for any n ? 2, there exists a stable theory having (k + 1)‐existence and k‐uniqueness, for every k ? n, but has neither (n + 2)‐existence nor (n + 1)‐uniqueness. In particular, this generalizes the example, for n = 2, due to Hrushovski given in 3 . © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

一类基于m-序列的正形置换的构造与计数

正形置换在密码学中有着广泛的应用,利用m-序列的"三项式特性",给出了一个构造n元正形置换的新方法,该方法既不同于已有的由n-2元构造n元正形置换,也不同于基于正交拉丁方的由n元构造n+1元正形置换的方法.     

Six-flows on almost balanced signed graphs

In 1983, Bouchet conjectured that every flow-admissible signed graph admits a nowhere-zero 6-flow. By Seymour's 6-flow theorem, Bouchet's conjecture holds for signed graphs with all edges positive. Recently, Rollová et al proved that every flow-admissible signed cubic graph with two negative edges admits a nowhere-zero 7-flow, and admits a nowhere-zero 6-flow if its underlying graph either contains a bridge, or is 3-edge-colorable, or is critical. In this paper, we improve and extend these results, and confirm Bouchet's conjecture for signed graphs with frustration number at most two, where the frustration number of a signed graph is the smallest number of vertices whose deletion leaves a balanced signed graph.     

模糊置换流水车间调度的多目标模型

为了求解同时考虑模糊加工时间和模糊交货期的多目标置换流水车间调度问题,提出一种模糊多目标调度模型。针对目标之一的最大化满意度,考虑决策者偏好,建立基于悲观准则的偏好满意度模型,并在此基础上,兼顾考虑可信度,对满意度模型进行改进;针对Pareto最优解的选取,引入模糊集理论和概率论,运用面积补偿法将最大模糊完工时间去模糊化,便于可行解之间进行比较。最后,采用随机系列算例以及典型算例进行优化计算,计算结果验证了模型的有效性。     

One-body and Two-body Fractional Parentage Coefficients for Spinor Bose-Einstein Condensation

A very effective tool, namely, the analytical expression of the fractional parentage coefficients (FPC), is introduced in this paper to deal with the total spin states of N-body spinor bosonic systems, where N is supposed to be large and the spin of each boson is one. In particular, the analytical forms of the one-body and two-body FPC for the total spin states with {N} and {N−1,1} permutation symmetries have been derived. These coefficients facilitate greatly the calculation of related matrix elements, and they can be used even in the case of N→∞. They appear as a powerful tool for the establishment of an improved theory of spinor Bose-Einstein condensation, where the eigenstates have the total spin S and its Z-component being both conserved.     

The Uniformly 3-Homogeneous Subsets of PGL(2, q)

We use the character-table of PGL(2, q) to determine the subsets of that group acting uniformly 3-homogeneously on the projective line.     

Covering arrays of higher strength from permutation vectors

A covering array CA(N;t,k,v) is an N × k array such that every N × t sub‐array contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. We introduce a combinatorial technique for their construction, focussing on covering arrays of strength 3 and 4. With a computer search, covering arrays with improved parameters have been found. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 202–213, 2006     

A Generalization about Congruent Pairs on a Set

ＡＧｅｎｅｒａｌｉｚａｔｉｏｎａｂｏｕｔＣｏｎｇｒｕｅｎｔＰａｉｒｓｏｎａＳｅｔＨｕａｎｇＪｕｎｍｉｎ（黄骏敏）（ＳｈａｎｇｈａｉＪｉａｏｔｏｎｇＵｎｉｖｅｒｓｉｔｙ）Ａｂｓｔｒａｃｔ：Ｉｎｔｈｉｓｐａｐｅｒ，ｗｅｃａｎｃｅｌｔｈｅｃｏｎｄｉｔｉｏｎ...