Firstly, a multilevel trust algorithm for MANET (mobile ad hoe networks) is presented in this paper and the trust level is defined as a three-tuple type in this multilevel trust algorithm. The paper introduces the m...Firstly, a multilevel trust algorithm for MANET (mobile ad hoe networks) is presented in this paper and the trust level is defined as a three-tuple type in this multilevel trust algorithm. The paper introduces the multilevel trust into MANET, thereby controlling restricted classified information flows among nodes that have different trust levels. Secondly, the infrastructure of MANET that suit to our multi-level trust is presented, Some conclusions are given at lastly.展开更多
In this paper,a new trust region algorithm for unconstrained LC^1 optimization problems is given.Compare with those existing trust regiion methods,this algorithm has a different feature:it obtains a stepsize at each i...In this paper,a new trust region algorithm for unconstrained LC^1 optimization problems is given.Compare with those existing trust regiion methods,this algorithm has a different feature:it obtains a stepsize at each iteration not by soloving a quadratic subproblem with a trust region bound,but by solving a system of linear equations.Thus it reduces computational complexity and improves computation efficlency,It is proven that this algorithm is globally convergent and locally superlinear under some conditions.展开更多
In this paper, we present a new line search and trust region algorithm for unconstrained optimization problems. The trust region center locates at somewhere in the negative gradient direction with the current best ite...In this paper, we present a new line search and trust region algorithm for unconstrained optimization problems. The trust region center locates at somewhere in the negative gradient direction with the current best iterative point being on the boundary. By doing these, the trust region subproblems are constructed at a new way different with the traditional ones. Then, we test the efficiency of the new line search and trust region algorithm on some standard benchmarking. The computational results reveal that, for most test problems, the number of function and gradient calculations are reduced significantly.展开更多
The trust in distributed environment is uncertain, which is variation for various factors. This paper introduces TDTM, a model for time-based dynamic trust. Every entity in the distribute environment is endowed with a...The trust in distributed environment is uncertain, which is variation for various factors. This paper introduces TDTM, a model for time-based dynamic trust. Every entity in the distribute environment is endowed with a trust-vector, which figures the trust intensity between this entity and the others. The trust intensity is dynamic due to the time and the inter-operation between two entities, a method is proposed to quantify this change based on the mind of ant colony algorithm and then an algorithm for the transfer of trust relation is also proposed. Furthermore, this paper analyses the influence to the trust intensity among all entities that is aroused by the change of trust intensity between the two entities, and presents an algorithm to resolve the problem. Finally, we show the process of the trusts' change that is aroused by the time's lapse and the inter-operation through an instance.展开更多
In the open network environment, malicious attacks to the trust model have become increasingly serious. Compared with single node attacks, collusion attacks do more harm to the trust model. To solve this problem, a co...In the open network environment, malicious attacks to the trust model have become increasingly serious. Compared with single node attacks, collusion attacks do more harm to the trust model. To solve this problem, a collusion detector based on the GN algorithm for the trust evaluation model is proposed in the open Internet environment. By analyzing the behavioral characteristics of collusion groups, the concept of flatting is defined and the G-N community mining algorithm is used to divide suspicious communities. On this basis, a collusion community detector method is proposed based on the breaking strength of suspicious communities. Simulation results show that the model has high recognition accuracy in identifying collusion nodes, so as to effectively defend against malicious attacks of collusion nodes.展开更多
A trust region algorithm for equality constrained optimization is given in this paper.The algorithm does not enforce strict monotonicity of the merit function for every iteration.Global convergence of the algorithm i...A trust region algorithm for equality constrained optimization is given in this paper.The algorithm does not enforce strict monotonicity of the merit function for every iteration.Global convergence of the algorithm is proved under the same conditions of usual trust region method.展开更多
学历、学位造假是目前就业市场的一种乱象,传统的学历学位认证系统则存在数据易被篡改、易丢失等风险.为此,本文结合区块链技术设计了一个可溯源、可监管的学位学历认证管理框架.为了解决传统区块链系统共识时存在认证时间过长、资源消...学历、学位造假是目前就业市场的一种乱象,传统的学历学位认证系统则存在数据易被篡改、易丢失等风险.为此,本文结合区块链技术设计了一个可溯源、可监管的学位学历认证管理框架.为了解决传统区块链系统共识时存在认证时间过长、资源消耗过大的问题,提出了一种新型基于信任的低能耗权益证明算法ToS(trust of stake).以此为契机,使用以太坊框架开发了一款基于ToS底层共识的学位学历认证管理系统,实现了学位信息录入、查询、认证和撤销等主要功能.实验结果表明:该系统能够确保信息的可认证和可溯源管理,具备执行效率高、能耗低、不易受篡改和攻击等优点.展开更多
为求解黎曼流形上的大规模可分离问题,Kasai等人在(Advances of the neural information processing systems, 31, 2018)中提出了使用非精确梯度和非精确Hessian的黎曼信赖域算法,并给出了该算法的迭代复杂度(只有证明思路,没有具体证明...为求解黎曼流形上的大规模可分离问题,Kasai等人在(Advances of the neural information processing systems, 31, 2018)中提出了使用非精确梯度和非精确Hessian的黎曼信赖域算法,并给出了该算法的迭代复杂度(只有证明思路,没有具体证明)。我们指出在该文献的假设条件下,按照其思路不能证明出相应的结果。本文提出了不同的参数假设,并证明了算法具有类似的迭代复杂度。展开更多
基金Supported by the National Natural Science Foun-dation of China (60372107) Doctoral Innovative Foundation ofJiangsu Province(46666001) .
文摘Firstly, a multilevel trust algorithm for MANET (mobile ad hoe networks) is presented in this paper and the trust level is defined as a three-tuple type in this multilevel trust algorithm. The paper introduces the multilevel trust into MANET, thereby controlling restricted classified information flows among nodes that have different trust levels. Secondly, the infrastructure of MANET that suit to our multi-level trust is presented, Some conclusions are given at lastly.
文摘In this paper,a new trust region algorithm for unconstrained LC^1 optimization problems is given.Compare with those existing trust regiion methods,this algorithm has a different feature:it obtains a stepsize at each iteration not by soloving a quadratic subproblem with a trust region bound,but by solving a system of linear equations.Thus it reduces computational complexity and improves computation efficlency,It is proven that this algorithm is globally convergent and locally superlinear under some conditions.
文摘In this paper, we present a new line search and trust region algorithm for unconstrained optimization problems. The trust region center locates at somewhere in the negative gradient direction with the current best iterative point being on the boundary. By doing these, the trust region subproblems are constructed at a new way different with the traditional ones. Then, we test the efficiency of the new line search and trust region algorithm on some standard benchmarking. The computational results reveal that, for most test problems, the number of function and gradient calculations are reduced significantly.
基金Supported by the National Natural Science Foun-dation of China (60403027) Natural Science Foundation of HubeiProvince (2005ABA258) Open Foundation of State Key Labora-tory of Software Engineering (SKLSE05-07)
文摘The trust in distributed environment is uncertain, which is variation for various factors. This paper introduces TDTM, a model for time-based dynamic trust. Every entity in the distribute environment is endowed with a trust-vector, which figures the trust intensity between this entity and the others. The trust intensity is dynamic due to the time and the inter-operation between two entities, a method is proposed to quantify this change based on the mind of ant colony algorithm and then an algorithm for the transfer of trust relation is also proposed. Furthermore, this paper analyses the influence to the trust intensity among all entities that is aroused by the change of trust intensity between the two entities, and presents an algorithm to resolve the problem. Finally, we show the process of the trusts' change that is aroused by the time's lapse and the inter-operation through an instance.
基金supported by the National Natural Science Foundation of China(6140224161572260+3 种基金613730176157226161472192)the Scientific&Technological Support Project of Jiangsu Province(BE2015702)
文摘In the open network environment, malicious attacks to the trust model have become increasingly serious. Compared with single node attacks, collusion attacks do more harm to the trust model. To solve this problem, a collusion detector based on the GN algorithm for the trust evaluation model is proposed in the open Internet environment. By analyzing the behavioral characteristics of collusion groups, the concept of flatting is defined and the G-N community mining algorithm is used to divide suspicious communities. On this basis, a collusion community detector method is proposed based on the breaking strength of suspicious communities. Simulation results show that the model has high recognition accuracy in identifying collusion nodes, so as to effectively defend against malicious attacks of collusion nodes.
文摘A trust region algorithm for equality constrained optimization is given in this paper.The algorithm does not enforce strict monotonicity of the merit function for every iteration.Global convergence of the algorithm is proved under the same conditions of usual trust region method.
文摘学历、学位造假是目前就业市场的一种乱象,传统的学历学位认证系统则存在数据易被篡改、易丢失等风险.为此,本文结合区块链技术设计了一个可溯源、可监管的学位学历认证管理框架.为了解决传统区块链系统共识时存在认证时间过长、资源消耗过大的问题,提出了一种新型基于信任的低能耗权益证明算法ToS(trust of stake).以此为契机,使用以太坊框架开发了一款基于ToS底层共识的学位学历认证管理系统,实现了学位信息录入、查询、认证和撤销等主要功能.实验结果表明:该系统能够确保信息的可认证和可溯源管理,具备执行效率高、能耗低、不易受篡改和攻击等优点.
文摘为求解黎曼流形上的大规模可分离问题,Kasai等人在(Advances of the neural information processing systems, 31, 2018)中提出了使用非精确梯度和非精确Hessian的黎曼信赖域算法,并给出了该算法的迭代复杂度(只有证明思路,没有具体证明)。我们指出在该文献的假设条件下,按照其思路不能证明出相应的结果。本文提出了不同的参数假设,并证明了算法具有类似的迭代复杂度。