D-S算法在粮情监控信息融合系统中的应用

本文通过多传感器对影响储藏粮食因子的检测,利用D-S融合算法,得到较为科学、合理的储藏粮食影响因素的判断,为在储藏粮食过程中采取适当的措施提供了强有力的依据,为进一步评估储粮品质打下基础。     

基于OSPF协议测试方法研究与应用

该论文介绍了OSPF协议的背景;对软件测试理论和软件测试方法进行研究;将两者相结合得出常见的测试方法,并且在此基础上总结了自己的一套测试方法。这些测试方法可以对支持OSPF协议的不同厂商的路由器进行针对性测试,从而判断路由器的OSPF协议是否正确。最后举例说明校园网OSPF协议的应用。     

Organizational Norm Congruency and Interpersonal Familiarity in E‐Mail: Examining Messages From Two Different Status Perspectives

Relying on SIDE theory, this 2 × 2 experimental design tested the effects of adherence to organizational norms and interpersonal familiarity in e‐mail messages from both superior and subordinate perspectives. Results reveal that using norm‐congruent e‐mail messages account for over 50% of the variance in both superior and subordinate attitudes toward the message and between 30% and 56% of the variance in perceptions of source credibility. Data from the superiors indicate that norm congruent e‐mail messages account for 14.4% of the variance in message compliance. Results from subordinates reveal an interaction effect that is consistent with SIDE‐based predictions. Subordinates believe superiors are most likely to comply with e‐mail requests from unfamiliar subordinates that are crafted in a manner congruent with organizational norms.     

Exploring Privacy Management on Facebook: Motivations and Perceived Consequences of Voluntary Disclosure

This study examined the perceived motivations and consequences of voluntary disclosure of Facebook active users using a survey administered to college students in a public‐speaking course. College‐age students who took the survey were motivated to use Facebook because they perceived their relationships improved with friends and family, although using Facebook could become negatively habit forming. The research suggests that users of Facebook use it more for disclosing to distant friends rather than to close friends, which is divergent from most early disclosure research that equates disclosure with intimacy. This research utilizes Communication Privacy Management Theory for the theoretical framework.     

Extending the two‐stage information systems continuance model: incorporating UTAUT predictors and the role of context

This study presents two extensions to the two‐stage expectation‐confirmation theory of information systems (IS) continuance. First, we expand the belief set from perceived usefulness in the original IS continuance model to include three additional predictors identified in the unified theory of acceptance and use of technology, namely effort expectancy, social influence and facilitating conditions. Second, we ground the IS continuance model in the context of transactional systems that involve transmission of personal and sensitive information and include trust as a key contextual belief in the model. To test the expanded IS continuance model, we conducted a longitudinal field study of 3159 Hong Kong citizens across two electronic government (e‐government) technologies that enable citizens' access to government services. In general, the results support the expanded model that provides a rich understanding of the changes in the pre‐usage beliefs and attitudes through the emergent constructs of disconfirmation and satisfaction, ultimately influencing IS continuance intention. Finally, we discuss the theoretical and practical implications of the expanded model.     

Combination framework of rendezvous algorithm for multi‐agent systems with limited sensing ranges

In this paper, we present a novel rendezvous algorithm framework ‐ the combination framework, which is named after the term convex combination in computational geometry. The convergence of the proposed algorithms is proved based on the novel tools from the recent results in graph theory and consensus study. It has been observed that the circumcenter algorithm can be considered as a special case of the combination framework. Moreover, the relevant analysis provides us a novel viewpoint on designing and the rendezvous rate of rendezvous algorithms for networked multi‐agent systems with limited sensing ranges. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

数字水印容量简化分析及模型优化

根据图像数字水印基本原理和水印信道的构造及生成方式,从信息论的角度,对基于高斯噪声信道的数字水印容量进行探索。针对高斯信源分布具有最大的不确定性、能够在所有的二阶随机分布中提供最大信息熵的特点,分析在高斯分布情况下的整个水印信道通信过程,并引入平均互信息理论,给出基于高斯的水印信道容量的最大通信速率。同时分析加性噪声信道下的容量问题,将高斯分布扩展到非高斯分布,优化容量计算表达式,利用Matlab软件工具给出非高斯信源水印容量与受限失真度的2D和3D关系仿真曲线,并结合实际给出结果分析。     

树突状细胞算法原理及其应用

描述树突状细胞的生物学机理,给出树突状细胞算法(DCA)的设计、实现及改进过程。介绍DCA在计算机网络、无线传感器网络、实时嵌入式系统和机器人学等方面的应用情况,对算法性能进行评价。基于标准数据集,将DCA与其他方法进行比较,分析DCA存在的问题,指出其下一步的研究方向。     

面向主体脆弱性的权限控制安全分析模型

在网络攻击过程中脆弱性存在于节点的部件主体上,针对该问题,将攻击描述细化到网络部件级,在原权限控制模型中增加对部件间权限、连接关系、属性的描述及脆弱性重写规则,构造NCVTG模型,提出复杂度为多项式时间的NCVTG模型图权限转移闭包生成算法用以评估网络的动态变化,给出当前脆弱性状态下的所有攻击路径。实验结果证明,该模型可对网络安全性进行综合分析,预测所有可能的攻击。     

基于交补集和Pignistic变换的证据组合方法

针对D-S证据组合公式及其改进公式的局限性,提出一种基于交补集权重和Pignistic概率变换的改进组合方法。基于交补集理论推导出新的基本概率分配函数,对交补集权重因子进行量化,得到基于交补集权重的证据组合公式,利用Pignistic概率变换法对已获得的各命题的信度值进行重新分配,以降低组合顺序对合成结果的影响,同时可获得更可靠的决策依据。实例分析结果表明,与其他改进方法相比,该组合方法在解决冲突证据、一票否决、鲁棒性、公平性和决策有效性等方面均有明显的优势。