基于置换群的可逆逻辑门网络级联

n输入n输出可逆逻辑门的级联构成一个群,它与对称群Sτ同构。本文研究了生成Toffoli门集合的可逆逻辑门数的特点,证明了任意置换Sn可以由n-轮换δ和一个置换τ=（ij,ik）生成,同时证明了相邻2一轮换可由至多两个NOT门在不增加额外信息位的情况下生成。最后提出了一个基于上述理论的可逆逻辑门网络级联算法,并通过实例验证了该算法的正确性。     

一类边传递图

令G=（α,β｜α^n=β^2=1,α^β=α^r）,r＆^2≡1（modn），是图Г的一个自同构群。目的是研究关于G一边传递图的性质．运用置换群和代数图论的相关理论，获得了这类图的完全分类，它们是一些互不相交的圈和完全二部图的并。     

Which way is the bookstore? A closer look at the judgments of relative directions task

We present a detailed analysis of a widely used assay in human spatial cognition, the judgments of relative direction (JRD) task. We conducted three experiments involving virtual navigation interspersed with the JRD task, and included confidence judgments and map drawing as additional metrics. We also present a technique for assessing the similarity of the cognitive representations underlying performance on the JRD and map-drawing tasks. Our results support the construct validity of the JRD task and its connection to allocentric representation. Additionally, we found that chance performance on the JRD task depends on the distribution of the angles of participants’ responses, rather than being constant and 90 degrees. Accordingly, we present a method for better determining chance performance.     

基于混沌序列加权抽样和排序变换的图像置乱

为增强网络中传输的数字图像信息的安全性,对一类典型的基于混沌排序图像置乱算法——Ye算法进行了研究,给出应用间隔抽样混沌序列置乱图像可以提高混沌排序置乱算法置乱度这一性质,并依据近似熵理论给出其提升的依据.为增加图像置乱算法的密钥空间,结合Shannon加权保密思想,设计了基于加权抽样混沌序列排序图像置乱算法.结果表明,该方法密钥空间大,置乱强度高,抗重构攻击.     

Applying fuzzy bi-dimensional scenario-based model to the assessment of Mars mission architecture scenarios

Sending man to Mars has been a long-held dream of humankind. NASA plans human planetary explorations using approaches that are technically feasible, have reasonable risks and have relatively low costs. This study presents a novel Multi-Attribute Decision Making (MADM) model for evaluating a range of potential mission scenarios for the human exploration of Mars. The three alternatives identified by the Mission Operations Directorate (MOD) at the Johnson Space Center (JSC) include split mission, combo lander and dual scenarios. The proposed framework subsumes the following key methods: first, the conjunction method is used to minimize the number of alternative mission scenarios; second, the Fuzzy Risk Failure Mode and Effects Analysis (RFMEA) is used to analyze the potential failure of the alternative scenarios; third, the fuzzy group Real Option Analysis (ROA) is used to estimate the expected costs and benefits of the alternative scenarios; and fourth, the fuzzy group permutation approach is used to select the optimal mission scenario. We present the results of a case study at NASA’s Johnson Space center to demonstrate: (1) the complexity of mission scenario selection involving subjective and objective judgments provided by multiple space exploration experts; and (2) a systematic and structured method for aggregating quantitative and qualitative data concerning a large number of competing and conflicting mission events.     

基于ACMPE、ISSL-Isomap和GWO-SVM的行星齿轮箱故障诊断

针对从行星齿轮箱非线性、非平稳振动信号特征提取困难的问题,提出了一种基于自适应复合多尺度排列熵(ACMPE)、改进监督型自组织增量学习神经网络界标点等度规映射(ISSL-Isomap)和灰狼群优化支持向量机(GWO-SVM)相结合的行星齿轮箱故障诊断方法。利用ACMPE从复杂域提取振动信号的故障特征,构建高维故障特征集;采用ISSL-Isomap方法对高维故障特征集进行维数约简,提取出低维、敏感故障特征;应用GWO -SVM分类器对低维故障特征进行模式识别,判断故障类型。行星齿轮箱故障诊断实验结果分析表明:与多尺度排列熵(MPE)、复合多尺度排列熵(CMPE)等特征提取方法相比,ACMPE方法在分类效果和识别精度上更具优势;与局部切空间排列(LTSA)、等度规映射(Isomap)、加权Isomap(W-Isomap)、监督Isomap(S-Isomap)和监督型自组织增量学习神经网络界标点Isomap(SSL-Isomap)等降维方法进行比较,ISSL-Isomap方法降维效果最佳;所提方法的故障识别率达到100%,具有一定优越性。      

基于排列组合熵的铝合金腐蚀灰度特征提取方法

针对铝合金试件腐蚀图像包含的大量腐蚀信息,提出了利用排列组合熵提取其灰度图特征参数的方法。该方法具有计算快速简鹇,抗噪能力较强,只需较短的序列长度就能估计出较稳定的系统特征值的特点。计算结果表明,基于排列组合熵的特征提取方法可以有效地提取各时间段内试件的灰度图在2个方向上的特征参数,熵值随着腐蚀时间的增加而规律性地增加,并可以作为评价腐蚀程度的一个重要特征参数。计算结果也验证了排列组合熵具有较好的抗噪性能。     

一种求解同顺序Flowshop排序问题的新的启发式算法

在生产调度中经常遇到工件排序问题,这类问题大多属于NP类问题.对此,目前无论在理论上还是在实际应用中,都尚未找到令人满意的一般求解方法.针对NP类问题中的一类--同顺序Flowshop排序问题,进行了广泛而深入的调查和比较研究,在此基础上,提出了一种新的启发式算法(简称为WSH法),并通过大量的数据实验将该算法与目前已知较好的几种算法进行了比较.结果表明,WSH法结构简单,计算效率高,是求解中、小规模问题的较好算法.     

分"档”直接插入排序算法研究

提出了一种由分"档”、整体置换和局部直接插入排序所组成的新排序算法--分"档”直接插入排序法.算法分析和实验结果都表明:在待排序数据非极不均匀分布的情况下,分"档”直接插入排序算法的时间复杂度可达到O(n),而附加存储空间开销却仅仅[(n+1)/2],同时排序速率明显优于QuickSort、HeapSort按字节桶分配链接排序、ProportionSplit Sort等算法.