面向光伏发电的规则表预测模型

基于模式树提出了一种面向光伏发电的规则表模型.学习时,迭代地构建不同的模式树;对于每次迭代,树中对应于最优的路径被作为规则表中的规则.预测时,根据规则表,使用相应的线性回归模型进行预测.实验结果表明,较之于神经网络、模式树,该模型具有更好的可解释性,同时表现出更高的预测准确性.     

基于多元数据融合的主机安全态势评估模型研究

终端主机安全是当前网络安全管理的防御重点.针对国内主机安全态势评估模型在安全要素融合上面临的不足,提出了一种基于多元数据融合的主机安全态势评估模型.该模型借助粗糙集理论,可量化安全要素对终端主机安全的依赖度.实验表明,操作系统、重要文件、浏览器是终端主机安全的防御重点.     

新颖的绕线拉紧装置

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

基于变因素集和多语义粒度的用户满意度评价方法研究

文章提出了基于变因素集和多语义粒度的进行用户满意度评价的思想,采用模糊综合评价法构建了基于变因素集和多语义粒度的用户满意度评价模型,并给出了相应的应用实例.该方法充分考虑到用户的多样性,体现了以用户为中心的思想,使得评价的结果更加准确可靠.     

数控铣镗床滑枕下垂补偿系统

提出了可行的数控落地铣镗床下垂补偿方案，使数控机床滑枕伸出时由于自重弯曲产生的精度误差得以修正。     

基于集对分析的区域水资源承载力评价研究

在分析水资源承载力构成要素的基础上,遵循科学性、层次性、可操作性和目标导向性原则,构建了水资源承载力评价指标体系,并将组合赋权法和集对分析法相结合,对三江平原及各分区水资源承载力进行评价。结果表明:研究区整体水资源承载力处于"中等"水平;7个县市中,七台河市与穆棱市水资源承载力为Ⅱ级,处于"较好"水平,鸡西市、鹤岗市、双鸭山市、佳木斯市与依兰县处于"中等"水平。     

水轮发电机组的状态监测和故障诊断

水轮发电机组是水电厂的核心设备之一,其运行状态的稳定性与安全性直接关系到水电厂的安全。本文在分析水轮发电组振动机理、监测内容及典型故障的基础上,对水轮发电组的状态监测和故障诊断系统进行了阐述。     

阔克塔勒水电站水轮发电机组安装要点分析

水电站机械设备复杂,要求的安装精度较高,而水轮发电机组作为整个工程的核心,其安装质量直接关系到设备以后的运行效率。本文以阔克塔勒水电站水轮发电机组为例,对其安装步骤和工艺要点进行了说明,意在为类似工程提供参考。     

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.