PC端与移动端界面布局相关性评价方法研究

目的分析与评价同款软件在PC端界面与移动端界面布局的相关性。方法分析软件产品的界面设计结构特征及布局描述方法,确定描述界面布局的关键指标,对这些指标进行权重系数的分析计算,并将指标量化,通过相关度分析将两个终端界面量化后的各指标做相关系数的计算。结论结合每个指标的权重值,得出两个终端界面布局的相关程度。     

基于粗糙集的一体化保障技术属性约简问题研究

一体化保障技术是目前提高复杂武器系统测试和保障能力的研究重点,为解决一体化保障技术中存在的指标冗余问题,结合粗糙集相关理论,提出了基于属性重要性和属性间影响度的约简算法;通过在某型一体化保障设备的柴油发电机子模块中应用该算法,在精简测试指标的同时,保证了较高的测试准确性,缩短了测试时间,验证并说明该理论可以有效地解决一体化保障技术中的指标冗余问题。     

An Influence Maximization Algorithm Based on Improved K-Shell in Temporal Social Networks

Influence maximization of temporal social networks (IMT) is a problem that aims to find the most influential set of nodes in the temporal network so that their information can be the most widely spread. To solve the IMT problem, we propose an influence maximization algorithm based on an improved K-shell method, namely improved K-shell in temporal social networks (KT). The algorithm takes into account the global and local structures of temporal social networks. First, to obtain the kernel value Ks of each node, in the global scope, it layers the network according to the temporal characteristic of nodes by improving the K-shell method. Then, in the local scope, the calculation method of comprehensive degree is proposed to weigh the influence of nodes. Finally, the node with the highest comprehensive degree in each core layer is selected as the seed. However, the seed selection strategy of KT can easily lose some influential nodes. Thus, by optimizing the seed selection strategy, this paper proposes an efficient heuristic algorithm called improved K-shell in temporal social networks for influence maximization (KTIM). According to the hierarchical distribution of cores, the algorithm adds nodes near the central core to the candidate seed set. It then searches for seeds in the candidate seed set according to the comprehensive degree. Experiments show that KTIM is close to the best performing improved method for influence maximization of temporal graph (IMIT) algorithm in terms of effectiveness, but runs at least an order of magnitude faster than it. Therefore, considering the effectiveness and efficiency simultaneously in temporal social networks, the KTIM algorithm works better than other baseline algorithms.     

Generalized linear complementarity in a problem ofn-person games

In this paper, we introduce a generalization of the polymatrix game (a nonzero sum noncooperativen-person game) considered by Howson and relate the problem of computing an equilibrium set of strategies for such a game to the generalized linear complementarity problem of Cottle and Dantzig. For an even more general version of the game we prove the existence of an-equilibrium set of strategies. We also present a result on the stability of the equilibria based on degree theory.     

双自由度后坐保险机构敏感因子对比

目前国内对双自由度后坐保险机构的研究大多集中于对其动态特性的分析和仿真,对机构运动影响敏感因子的分析很少。借助计算机仿真,运用正交试验设计方法对双自由度后坐保险机构敏感因子进行分析,确定各敏感因子对机构影响程度的主次顺序以及主要敏感因子。结果表明上质量块质量对其运动特性影响最大并为主要敏感因子,然后依次是惯性簧刚度,惯性簧长度和下质量块质量的影响。     

基于集对分析的保障能力薄弱环节改进模型研究

确定保障能力薄弱环节对提高部队保障能力至关重要,目前保障能力薄弱环节确定有指标评估得分法和权重法两种方法,两种方法均存在一定的片面性。针对存在的问题,提出一种基于指标裕度空间和权重的求指标薄弱度的方法查找、确定保障能力薄弱环节,并且将集对分析的思想应用到指标优化和指标裕度空间的分析求取上,使指标薄弱度更加精确。最后结合某基层一级保障单位进行实例,运用Matlab软件仿真模型,进行保障能力指标薄弱度分析,并与目前存在的两种方法对比分析,实践证明所提出的方法更适用于保障能力薄弱环节的确定。     

灰色理论在古陶瓷断代中的应用

利用模式识别方法可以推测古陶瓷出产年代。将古陶瓷中各化学成分的含量组成一个向量,并与该向量的灰色模型GM(1, 1)参数构成新向量,用于描述古陶瓷样品。以灰色关联度为距离定义,使用近邻法对古陶瓷样品年代进行预测,其留一法预测精度达79.55%。实验结果验证了灰色理论可以用于古陶瓷断代。     

基于最大隶属度的区间概率灰色随机多准则决策方法

定义了一种灰色隶属函数.针对概率为区间数、准则值为区间灰数的灰色随机多准则决策问题,提出一种基于最大隶属度的决策方法.首先,运用区间数可能度排序向量将区间概率转化为点概率,并将其转化为无风险决策问题;然后,计算各方案在负理想方案到正理想方案上的灰色隶属度,并计算各方案准则值的相对灰度,进而根据灰色隶属度和相对灰度大小对方案进行排序;最后,通过算例验证了该方法的可行性和有效性.     

Adaptive beam search lookahead algorithms for the circular packing problem

This paper addresses the circular packing problem (CPP), which consists in packing n circles C_i, each of known radius r_i, i∈N={1, …, n}, into the smallest containing circle C. The objective is to determine the radius r of C as well as the coordinates (x_i, y_i) of the center of C_i, i∈N. CPP is solved using two adaptive algorithms that adopt a binary search to determine r, and a beam search to check the feasibility of packing n circles into C when the radius is fixed at r. A node of level ?, ?=1, …, n, of the beam search tree corresponds to a partial packing of ? circles of N into C. The potential of each node of the tree is assessed using a lookahead strategy that, starting with the partial packing of the current node, assigns each unpacked circle to its maximum hole degree position. The beam search stops either when the lookahead strategy identifies a feasible packing or when it has fathomed all nodes. The computational tests on a set of benchmark instances show the effectiveness of the proposed adaptive algorithms.     

基于样本块的破损唐卡图像修复算法的改进

基于样本块的修复算法由于能同时有效地修复图像的受损纹理和结构的优点被引入到唐卡图像的数字化保护中,而且它对特定破损唐卡图像修复效果良好,但是由于优先权计算和最佳样本块不唯一等问题的影响,算法对其他类唐卡图像修复效果不佳。针对此算法的不足,对信任度计算方法和等照线计算方法进行了改进,解决了最佳样本块不唯一的问题。实验结果证明,改进后的算法不仅能够得到令人满意的修复结果而且能够提高修复效率。