基于反应扩散方程的水平集结构拓扑优化方法与实现

为实现更加先进的拓扑优化算法,研究采用反应扩散方程的水平集结构拓扑优化方法,通过理论推导给出算法中的参数选择建议.该方法允许在拓扑优化过程中生成新的孔洞,初始结构无须包含孔洞,不需要重新初始化步骤,从而可提高算法的收敛性.针对传统拓扑优化中主要采用体积约束、以柔度最小为目标和体积保留率设定存在一定主观性的问题,探究不同体积保留率下的结构应力水平的变化规律,结果显示可以依据结构最大应力水平与体积保留率的变化规律确定最优体积保留率.     

面向案例消耗推理的应急物资预测

面向案例推理（Case-Based Reasoning,CBR）的应急物资需求预测中,针对老旧案例影响推理结果精确度的问题进行了研究,给出了一种基于消耗策略的案例推理的应急物资预测方法。通过粗糙集属性依赖度的计算确定了案例属性之间的权重系数;针对地震应急数据特征提出了一种消耗策略的定义,确定消耗函数、消耗参数和消耗区间参数,采用消耗策略对各案例间的相似度进行优化调整,减小老旧案例的权重,进而不同程度地削弱老旧案例对案例匹配结果的影响,再从案例库中检索到与目标案例匹配的最佳源案例,从而决策出目标案例的处理方案;通过进行地震实例分析,验证了参数调节后的案例消耗推理的预测结果精度更高。该方法在应急救援的物资预测中有一定的借鉴意义。     

不完备系统多准则决策的云PDR方法

针对多准则决策问题的意义以及经典粗糙集方法在不完备系统方案排序问题中的不足,在前人基于概率优势关系(PDR)排序方法的基础上,结合云理论提出了基于云概率优势关系的不完备系统多准则决策方法,即云PDR排序法。将期望、熵、超熵等参数引入PDR方法,充分考虑了决策的模糊性、波动性和随机性,评价过程和结果更加客观全面。以煤炭资源型城市为例进行应用研究,获得其中各城市发展水平及其波动情况的排序,并通过与其他方法结果的比较验证了本文方法的优势与有效性。     

流计算模式下概率粗糙集三支决策的快速计算

概率粗糙集三支决策是不确定问题求解的一种重要理论,流计算模式是一种新型的动态内存计算形式,实施流计算模式下三支决策的快速动态计算是一项具有挑战性的新议题。本研究以流计算模式中的两个核心计算步骤即动态增量与动态减量作为研究对象,提出了一种流计算模式下概率粗糙集三支决策域的快速动态学习方法。首先对流计算模式中三支决策动态增量和动态减量的不同变化情况进行了数据建模。然后基于不同数据变化情况分别讨论了数据增量与数据减量时三支决策域的变化推理,并且基于上述理论给出了流计算模式下的三支决策动态增减学习算法。该算法能够以更低的时间复杂度获得与经典三支决策算法相同决策效果。最后通过八种UCI数据集的实验证明了流计算模式下三支决策动态增减学习算法在时间消耗上明显优于经典概率粗糙集三支决策算法,并且在不同阈值下具有稳定的决策效率。本研究表明了流计算模式下三支决策快速计算是可行的。     

Method to compute the reachability set of S3PR

This paper proposes a novel approach to computing the reachability set by using place invariants and strict minimal siphons for S³PR with specific resource places. First, the set of invariant markings is enumerated. Then a necessary and sufficient condition is developed to decide whether a marking is spurious by analyzing the relationship between the number of tokens in the corresponding places of any strict minimal siphon and their bounds. In addition, the spurious markings are calculated. Finally, the reachability set of the net is generated by removing all the spurious markings from the set of invariant markings. Experimental results show the efficiency of the proposed method.     

新颖的绕线拉紧装置

本文介绍一种新型适用的线圈绕制中的线材拉紧装置，并将其与传统的拉紧装置进行比较，得出各自的优缺点。     

Impact of transient chemistry on the corrosion potential of a steam turbine disc steel

The adoption of two-shifting in coal-fired power generation (switching from on-load to off-load conditions on a daily basis and off-load for the weekend) results in regular cycling of the solution chemistry of the condensed steam on the turbine discs. A first stage investigation has been made of the effect of such chemistry cycling on the corrosion potential of the disc steel. The corrosion potential is typically about +0.05 V (SCE) in off-load chemistry (aerated pure water) and below −0.6 V (SCE) in on-load chemistry (deaerated solution containing chloride or chloride and sulphate anions). The critical observation was the sluggish response of the corrosion potential upon restoration of deaerated on-load conditions with the implication of a likely increase in pit and stress corrosion crack development.     

Perfect secret sharing scheme based on vertex domination set

Due to the fast development in data communication systems and computer networks in recent years, the necessity to protect the secret data has become extremely imperative. Several methods have been proposed to protect the secret data; one of them is the secret sharing scheme. It is a method of distributing a secret K among a finite set of participants, in such a way that only predefined subset of participant is enabled to reconstruct a secret from their shares. A secret sharing scheme realizing uniform access structure described by a graph has received a considerable attention. In this scheme, each vertex represents a participant and each edge represents a minimum authorized subset. In this paper, an independent dominating set of vertices in a graph G is introduced and applied as a novel idea to construct a secret sharing scheme such that the vertices of the graph represent the participants and the dominating set of vertices in G represents the minimal authorized set. While most of the previous schemes were based on the principle of adjacent vertices, the proposed scheme is based upon the principle of non-adjacent vertices. We prove that the scheme is perfect, and the lower bound of the information rate of this new construction is improved when compared to some well-known previous constructions. We include an experiment involving security threats to demonstrate the effectiveness of the proposed scheme.