基于信任网的推荐机制研究

针对信任和声誉模型中推荐机制存在一些的问题,结合主观逻辑,提出了基于信任网的推荐机制,给出信任网的基本定义,对信任网中推荐链的依赖关系进行形式化描述,给出相应的解决策略,并利用信任强度解决了主观逻辑中无法对恶意推荐实体进行惩罚的问题,提高推荐信息的精确度。模拟实验结果表明,基于信任网的推荐机制能在一定程度上减少访问到恶意实体的次数,并惩罚提供恶意推荐的实体。     

The theory and practice in the evolution of trusted computing

Trusted computing （TC） is an emerging tech- nology to enhance the security of various computing plat- forms by a dedicated secure chip （TPM/TCM）, which is widely accepted by both the industrial and academic world. This paper attempts to sketch the evolution of TC from the view of our theoretical and engineering work. In theory, we focus on protocol design and security analysis. We have proposed the first ECDAA protocol scheme based on q-SDH assumption, which highlights a new way to design direct anonymous attestation scheme. In technical evolu- tion, we discuss the key technologies of trust chain, trusted network connection and TC testing and evaluation. We break through several key technologies such as trusted boot, OS measurement and remote attestation, and imple- ment a TC system from TPM/TCM to network. We also design and implement a testing and evaluation system of TC platform, which is the first one put into practical application in China. Finally, with the rapid development of cloud computing and mobile applications, TC is moving toward some new directions, such as the trust in cloud and mobile environments, new TPM standard, and flexible trust execution environment trust establishment method.     

NONMONOTONIC TRUST REGION PROJECTED REDUCED HESSIAN ALGORITHM WITH TWO-PIECE UPDATE FOR CONSTRAINED OPTIMIZATION

This paper proposes a two-piece update of projected reduced Hessian algorithm with nonmonotonic trust region strategy for solving nonlinear equality constrained optimization problems. In order to deal with large problems, a two-piece update of twoside projected reduced Hessian is used to replace full Hessian matrix. By adopting the Fletcher's penalty function as the merit function, a nonmonotonic trust region strategy is suggested which does not require the merit function to reduce its value in every iteration. The two-piece update of projected reduced Hessian algorithm which switches to nonmonotonic trust region technique possesses global convergence while maintaining a two-step Q-superlinear local convergence rate under some reasonable conditions. Furthermore, one step Q-superlinear local convergence rate can be obtained if at least one of the update formulas is updated at each iteration by an alternative update rule. The numerical experiment results are reported to show the effectiveness of the propo     

分布式防火墙中的信任管理系统

介绍了信任管理系统的概念,阐述了KeyNote信任管理系统模型,并对KeyNote在分布式防火墙中的应用进行了研究,给出了一个分布式防火墙中信任管理系统模型,最后提出了进一步的研究方向。     

一个与信籁域搜索技术相结合的微粒群算法

微粒群优化算法(PSO)是一种有效的随机全局优化技术.文章针对利用微粒群优化算法进行多极值点的函数优化时,存在陷入局部极小点和搜索效率低的问题,把信籁域搜索技术引入到PSO算法中,提出了基于信籁域搜索的微粒群优化算法(TRPSO).该算法保持了PSO算法结构简单的特点,改善了PSO算法的全局寻优能力,提高了算法的收敛速度和计算精度.仿真计算结果表明,该算法的性能优于混沌微粒群优化算法(CPSO)和基本微粒群优化算法(PSO).     

企业网络与知识转移:跨国公司与产业集聚群的比较研究

基于网络理论,从企业网络的结构维度和关系维度,分析了网络特征对企业网络中知识转移产生的影响。并在此框架下,对比了跨国公司和产业集聚群两类企业网络中知识转移的不同。研究结果发现:企业网络的异质性和弱的联结强度不利于网络中知识转移;网络稳定性、强的联结强度和信任有利于网络中知识转移;跨围公司和产业集聚群在网络特征上的差异,导致了两者知识转移的不同。     

非光滑单值优化的信赖域算法

提供了求解非光滑单值优化问题的信赖域算法．基于线性规划的对偶理论,将目标函数的方向导数转化成线性规划,从而使信赖域子问题容易数值求解． 在合理的条件下,证明了算法的整体收敛性和局部超线性收敛速率．