In this paper, a new trust region algorithm for unconstrained LC1 optimization problems is given. Compare with those existing trust regiion methods, this algorithm has a different feature: it obtains a stepsize at eac...In this paper, a new trust region algorithm for unconstrained LC1 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 efficiency. It is proven that this algorithm is globally convergent and locally superlinear under some conditions.展开更多
In this paper we present a filter-trust-region algorithm for solving LC1 unconstrained optimization problems which uses the second Dini upper directional derivative. We establish the global convergence of the algorith...In this paper we present a filter-trust-region algorithm for solving LC1 unconstrained optimization problems which uses the second Dini upper directional derivative. We establish the global convergence of the algorithm under reasonable assumptions.展开更多
This paper presents a scheme to perform QoS management and assure network security by using the trusted-router based on the Trust Management System.In this trusted-router,every IP packet is forwarded and queued by its...This paper presents a scheme to perform QoS management and assure network security by using the trusted-router based on the Trust Management System.In this trusted-router,every IP packet is forwarded and queued by its trust value,which is the quantification of the network's expectation for this packet's and its owner's behavior in the network.We outline the algorithms to calculate the trust value of the trusted-router and the IP packet.We also introduce the trust-based QoS management algorithm and the deployment of the trusted-routers which carry out this algorithm.The simulation results show that the least trusted IP packets will be dropped to save resources for those highly trusted IP packets.This will ecourage all the elements in the network to keep a good trust record.展开更多
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 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 is proposed for solving bilevel programming problems where the lower level programming problem is a strongly convex programming problem with linear constraints.This algorithm is based on a tru...A trust region algorithm is proposed for solving bilevel programming problems where the lower level programming problem is a strongly convex programming problem with linear constraints.This algorithm is based on a trust region algorithm for nonsmooth unconstrained optimization problems,and its global convergence is also proved.展开更多
In this work,synchronous cutting of concave and convex surfaces was achieved using the duplex helical method for the hypoid gear,and the problem of tooth surface error correction was studied.First,the mathematical mod...In this work,synchronous cutting of concave and convex surfaces was achieved using the duplex helical method for the hypoid gear,and the problem of tooth surface error correction was studied.First,the mathematical model of the hypoid gears machined by the duplex helical method was established.Second,the coordinates of discrete points on the tooth surface were obtained by measurement center,and the normal errors of the discrete points were calculated.Third,a tooth surface error correction model is established,and the tooth surface error was corrected using the Levenberg-Marquard algorithm with trust region strategy and least square method.Finally,grinding experiments were carried out on the machining parameters obtained by Levenberg-Marquard algorithm with trust region strategy,which had a better effect on tooth surface error correction than the least square method.After the tooth surface error is corrected,the maximum absolute error is reduced from 30.9μm before correction to 6.8μm,the root mean square of the concave error is reduced from 15.1 to 2.1μm,the root mean square of the convex error is reduced from 10.8 to 1.8μm,and the sum of squared errors of the concave and convex surfaces was reduced from 15471 to 358μm^(2).It is verified that the Levenberg-Marquard algorithm with trust region strategy has a good accuracy for the tooth surface error correction of hypoid gear machined by duplex helical method.展开更多
Provides information on a study which presented a trust region approach for solving nonlinear constrained optimization. Algorithm of the trust region approach; Information on the global convergence of the algorithm; N...Provides information on a study which presented a trust region approach for solving nonlinear constrained optimization. Algorithm of the trust region approach; Information on the global convergence of the algorithm; Numerical results of the study.展开更多
We propose a retrospective trust region algorithm with the trust region converging to zero for the unconstrained optimization problem. Unlike traditional trust region algo- rithms, the algorithm updates the trust regi...We propose a retrospective trust region algorithm with the trust region converging to zero for the unconstrained optimization problem. Unlike traditional trust region algo- rithms, the algorithm updates the trust region radius according to the retrospective ratio, which uses the most recent model information. We show that the algorithm preserves the global convergence of traditional trust region algorithms. The superlinear convergence is also proved under some suitable conditions.展开更多
In this paper, we present a new trust region algorithm for a nonlinear bilevel programming problem by solving a series of its linear or quadratic approximation subproblems. For the nonlinear bilevel programming proble...In this paper, we present a new trust region algorithm for a nonlinear bilevel programming problem by solving a series of its linear or quadratic approximation subproblems. For the nonlinear bilevel programming problem in which the lower level programming problem is a strongly convex programming problem with linear constraints, we show that each accumulation point of the iterative sequence produced by this algorithm is a stationary point of the bilevel programming problem.展开更多
This paper presents a novel trust model based on multiple decision factor theory （MDFT） and a trust routing algorithm based on MDFT to exactly evaluate routing node trust and establish a trustworthy routing path. MD...This paper presents a novel trust model based on multiple decision factor theory （MDFT） and a trust routing algorithm based on MDFT to exactly evaluate routing node trust and establish a trustworthy routing path. MDFT integrates four dimensional trust decision factors including behavior, state, recommend and node liveness to realize an exactly finer-grained trust evaluation. On the basis of MDFT, a trust routing algorithm is presented and validated in open shortest path first （OSPF） protocol. Simulation resuRs show that the algorithm can reflect the routing node trust accurately and has better dynamic response ability. Under the circumstance of existing deceptive nodes, the algorithm has better anti-deception performance and higher attack node detection rate than conventional algorithm.展开更多
Presents information on a study which analyzed an interior trust-region-based algorithm for linearly constrained minimization problems. Optimality conditions for the linearly constrained minimization problem presented...Presents information on a study which analyzed an interior trust-region-based algorithm for linearly constrained minimization problems. Optimality conditions for the linearly constrained minimization problem presented; Vectors for each updating step in the algorithm proposed; Establishment of the convergence properties of the proposed algorithm.展开更多
文摘In this paper, a new trust region algorithm for unconstrained LC1 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 efficiency. It is proven that this algorithm is globally convergent and locally superlinear under some conditions.
基金Supported by CERG: CityU 101005 of the Government of Hong Kong SAR, Chinathe National Natural ScienceFoundation of China, the Specialized Research Fund of Doctoral Program of Higher Education of China (Grant No.20040319003)the Natural Science Fund of Jiangsu Province of China (Grant No. BK2006214)
文摘In this paper we present a filter-trust-region algorithm for solving LC1 unconstrained optimization problems which uses the second Dini upper directional derivative. We establish the global convergence of the algorithm under reasonable assumptions.
基金supported by National Key Basic Research Program of China(973 Program)under Grant No.2007CB310704National Natural Science Foundation of China under Grant No.90718001,60973146
文摘This paper presents a scheme to perform QoS management and assure network security by using the trusted-router based on the Trust Management System.In this trusted-router,every IP packet is forwarded and queued by its trust value,which is the quantification of the network's expectation for this packet's and its owner's behavior in the network.We outline the algorithms to calculate the trust value of the trusted-router and the IP packet.We also introduce the trust-based QoS management algorithm and the deployment of the trusted-routers which carry out this algorithm.The simulation results show that the least trusted IP packets will be dropped to save resources for those highly trusted IP packets.This will ecourage all the elements in the network to keep a good trust record.
基金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.
基金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.
基金supported by the National Natural Science Foundation of China(Grant No.19731001)the Management.Decison and Infomation System Lab,Chinese Academy of Sciences.
文摘A trust region algorithm is proposed for solving bilevel programming problems where the lower level programming problem is a strongly convex programming problem with linear constraints.This algorithm is based on a trust region algorithm for nonsmooth unconstrained optimization problems,and its global convergence is also proved.
基金Projects(52075552,51575533,51805555,11662004)supported by the National Natural Science Foundation of China。
文摘In this work,synchronous cutting of concave and convex surfaces was achieved using the duplex helical method for the hypoid gear,and the problem of tooth surface error correction was studied.First,the mathematical model of the hypoid gears machined by the duplex helical method was established.Second,the coordinates of discrete points on the tooth surface were obtained by measurement center,and the normal errors of the discrete points were calculated.Third,a tooth surface error correction model is established,and the tooth surface error was corrected using the Levenberg-Marquard algorithm with trust region strategy and least square method.Finally,grinding experiments were carried out on the machining parameters obtained by Levenberg-Marquard algorithm with trust region strategy,which had a better effect on tooth surface error correction than the least square method.After the tooth surface error is corrected,the maximum absolute error is reduced from 30.9μm before correction to 6.8μm,the root mean square of the concave error is reduced from 15.1 to 2.1μm,the root mean square of the convex error is reduced from 10.8 to 1.8μm,and the sum of squared errors of the concave and convex surfaces was reduced from 15471 to 358μm^(2).It is verified that the Levenberg-Marquard algorithm with trust region strategy has a good accuracy for the tooth surface error correction of hypoid gear machined by duplex helical method.
基金Chinese NSF grants 19525101, 19731001, and by State key project 96-221-04-02-02. It is also partially supported by Hebei provi
文摘Provides information on a study which presented a trust region approach for solving nonlinear constrained optimization. Algorithm of the trust region approach; Information on the global convergence of the algorithm; Numerical results of the study.
文摘We propose a retrospective trust region algorithm with the trust region converging to zero for the unconstrained optimization problem. Unlike traditional trust region algo- rithms, the algorithm updates the trust region radius according to the retrospective ratio, which uses the most recent model information. We show that the algorithm preserves the global convergence of traditional trust region algorithms. The superlinear convergence is also proved under some suitable conditions.
基金Supported by the National Natural Science Foundation of China(No.11171348,11171252 and 71232011)
文摘In this paper, we present a new trust region algorithm for a nonlinear bilevel programming problem by solving a series of its linear or quadratic approximation subproblems. For the nonlinear bilevel programming problem in which the lower level programming problem is a strongly convex programming problem with linear constraints, we show that each accumulation point of the iterative sequence produced by this algorithm is a stationary point of the bilevel programming problem.
基金supported by the National Natural Science Foundation of China (61121061, 61161140320)The National Key Technology R&D Program (2012BAH38B02)
文摘This paper presents a novel trust model based on multiple decision factor theory （MDFT） and a trust routing algorithm based on MDFT to exactly evaluate routing node trust and establish a trustworthy routing path. MDFT integrates four dimensional trust decision factors including behavior, state, recommend and node liveness to realize an exactly finer-grained trust evaluation. On the basis of MDFT, a trust routing algorithm is presented and validated in open shortest path first （OSPF） protocol. Simulation resuRs show that the algorithm can reflect the routing node trust accurately and has better dynamic response ability. Under the circumstance of existing deceptive nodes, the algorithm has better anti-deception performance and higher attack node detection rate than conventional algorithm.
基金Research partially supported by the Faculty Research Grant RIG-35547 and ROG-34628 of the University of North Texas and in part by the Cornell Theory Center which receives major funding from the National Science Foundation and IBM Corporation with ad
文摘Presents information on a study which analyzed an interior trust-region-based algorithm for linearly constrained minimization problems. Optimality conditions for the linearly constrained minimization problem presented; Vectors for each updating step in the algorithm proposed; Establishment of the convergence properties of the proposed algorithm.
