A personalized trustworthy service selection method is proposed to fully express the features of trust, emphasize the importance of user preference and improve the trustworthiness of service selection. The trustworthi...A personalized trustworthy service selection method is proposed to fully express the features of trust, emphasize the importance of user preference and improve the trustworthiness of service selection. The trustworthiness of web service is defined as customized multi-dimensional trust metrics and the user preference is embodied in the weight of each trust metric. A service selection method combining AHP （analytic hierarchy process） and PROMETHEE （preference ranking organization method for enrichment evaluations） is proposed. AHP is used to determine the weights of trust metrics according to users＇ preferences. Hierarchy and pairwise comparison matrices are constructed. The weights of trust metrics are derived from the highest eigenvalue and eigenvector of the matrix. to obtain the final rank of candidate services. The preference functions are defined according to the inherent characteristics of the trust metrics and net outranking flows are calculated. Experimental results show that the proposed method can effectively express users＇ personalized preferences for trust metrics, and the trustworthiness of service ranking and selection is efficiently improved.展开更多
A trust region method combining with nonmonotone technique is proposed tor solving symmetric nonlinear equations. The global convergence of the given method will be established under suitable conditions. Numerical res...A trust region method combining with nonmonotone technique is proposed tor solving symmetric nonlinear equations. The global convergence of the given method will be established under suitable conditions. Numerical results show that the method is interesting for the given problems.展开更多
A trust region method is proposed to solve the problem of microwave tomography,which is very difficult to be solved for its ill-posedness and nonlinearity. Compared with the Levenberg-Marquardt method, this method int...A trust region method is proposed to solve the problem of microwave tomography,which is very difficult to be solved for its ill-posedness and nonlinearity. Compared with the Levenberg-Marquardt method, this method introduces more a priori knowledge and might obtain better results, though the two methods are equal in some cases.展开更多
A new trust region algorithm for solving convex LC 1 optimization problem is presented.It is proved that the algorithm is globally convergent and the rate of convergence is superlinear under some reasonable assum...A new trust region algorithm for solving convex LC 1 optimization problem is presented.It is proved that the algorithm is globally convergent and the rate of convergence is superlinear under some reasonable assumptions.展开更多
Trust region methods are powerful and effective optimization methods. The conic model method is a new type of method with more information available at each iteration than standard quadratic-based methods. The adva...Trust region methods are powerful and effective optimization methods. The conic model method is a new type of method with more information available at each iteration than standard quadratic-based methods. The advantages of the above two methods can be combined to form a more powerful method for constrained optimization. The trust region subproblem of our method is to minimize a conic function subject to the linearized constraints and trust region bound. At the same time, the new algorithm still possesses robust global properties. The global convergence of the new algorithm under standard conditions is established.展开更多
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.展开更多
The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we ...The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we combine a popular nonmonotone technique with an adaptive trust region algorithm. The new ratio to adjusting the next trust region radius is different from the ratio in the traditional trust region methods. Under some appropriate conditions, we show that the new algorithm has good global convergence and superlinear convergence.展开更多
In this paper we present a nonmonotone trust region method for nonlinear least squares problems with zero-residual and prove its convergence properties. The extensive numerical results are reported which show that the...In this paper we present a nonmonotone trust region method for nonlinear least squares problems with zero-residual and prove its convergence properties. The extensive numerical results are reported which show that the nonmonotone trust region method is generally superior to the usual trust region method.展开更多
In this paper, a projected gradient trust region algorithm for solving nonlinear equality systems with convex constraints is considered. The global convergence results are developed in a very general setting of comput...In this paper, a projected gradient trust region algorithm for solving nonlinear equality systems with convex constraints is considered. The global convergence results are developed in a very general setting of computing trial directions by this method combining with the line search technique. Close to the solution set this method is locally Q-superlinearly convergent under an error bound assumption which is much weaker than the standard nonsingularity condition.展开更多
A class of trust region methods for solving linear inequality constrained problems is proposed in this paper. It is shown that the algorithm is of global convergence.The algorithm uses a version of the two-sided proje...A class of trust region methods for solving linear inequality constrained problems is proposed in this paper. It is shown that the algorithm is of global convergence.The algorithm uses a version of the two-sided projection and the strategy of the unconstrained trust region methods. It keeps the good convergence properties of the unconstrained case and has the merits of the projection method. In some sense, our algorithm can be regarded as an extension and improvement of the projected type algorithm.展开更多
In this paper, we propose and analyze a non-monotone trust region method with non-monotone line search strategy for unconstrained optimization problems. Unlike the traditional non-monotone trust region method, our alg...In this paper, we propose and analyze a non-monotone trust region method with non-monotone line search strategy for unconstrained optimization problems. Unlike the traditional non-monotone trust region method, our algorithm utilizes non-monotone Wolfe line search to get the next point if a trial step is not adopted. Thus, it can reduce the number of solving sub-problems. Theoretical analysis shows that the new proposed method has a global convergence under some mild conditions.展开更多
The secant methods discussed by Fontecilla (in 1988) are considerably revised through employing a trust region multiplier strategy and introducing a nondifferentiable merit function. In this paper the secant methods a...The secant methods discussed by Fontecilla (in 1988) are considerably revised through employing a trust region multiplier strategy and introducing a nondifferentiable merit function. In this paper the secant methods are also improved by adding a dogleg typed movement which allows to overcome a phenomena similar to the Maratos effect. Furthermore, these algorithms are analyzed and global convergence theorems as well as local superlinear convergence rate are proved.展开更多
分布式云存储技术为数量日益庞大的机载软件提供了新的分发与存储方式,这意味着航空公司失去了对软件的直接控制,因此机载软件安全成为了航空公司十分关注的问题。为了提高云存储环境下机载软件的安全性,提出了一种基于可信隐式第三方(T...分布式云存储技术为数量日益庞大的机载软件提供了新的分发与存储方式,这意味着航空公司失去了对软件的直接控制,因此机载软件安全成为了航空公司十分关注的问题。为了提高云存储环境下机载软件的安全性,提出了一种基于可信隐式第三方(Trusted Implicit Third Party,TITP)的机载软件审计方法对云上机载软件进行监控与管理,以确保机载软件的完整性。此外,由部署在云端的可信硬件代替用户进行审计工作,解决了可公开验证审计机制中第三方审计者不完全可信的问题,并以日志的方式记录审计结果以供用户查询。运用可信硬件进行完整性验证不仅降低了用户计算成本,而且缩短了用户在线时间。与其他可信隐式第三方审计方法进行实验对比,所提方法在审计计算过程中节省了10%的时间消耗。展开更多
基金The National Natural Science Foundation of China(No.60973149)the Open Funds of State Key Laboratory of Computer Science of the Chinese Academy of Sciences(No.SYSKF1110)+1 种基金the Doctoral Fund of Ministry of Education of China(No.20100092110022)the College Industrialization Project of Jiangsu Province(No.JHB2011-3)
文摘A personalized trustworthy service selection method is proposed to fully express the features of trust, emphasize the importance of user preference and improve the trustworthiness of service selection. The trustworthiness of web service is defined as customized multi-dimensional trust metrics and the user preference is embodied in the weight of each trust metric. A service selection method combining AHP （analytic hierarchy process） and PROMETHEE （preference ranking organization method for enrichment evaluations） is proposed. AHP is used to determine the weights of trust metrics according to users＇ preferences. Hierarchy and pairwise comparison matrices are constructed. The weights of trust metrics are derived from the highest eigenvalue and eigenvector of the matrix. to obtain the final rank of candidate services. The preference functions are defined according to the inherent characteristics of the trust metrics and net outranking flows are calculated. Experimental results show that the proposed method can effectively express users＇ personalized preferences for trust metrics, and the trustworthiness of service ranking and selection is efficiently improved.
基金Supported by SF of Guangxi University(X061041)Supported by NSF of China(10761001)
文摘A trust region method combining with nonmonotone technique is proposed tor solving symmetric nonlinear equations. The global convergence of the given method will be established under suitable conditions. Numerical results show that the method is interesting for the given problems.
文摘A trust region method is proposed to solve the problem of microwave tomography,which is very difficult to be solved for its ill-posedness and nonlinearity. Compared with the Levenberg-Marquardt method, this method introduces more a priori knowledge and might obtain better results, though the two methods are equal in some cases.
基金Supported by the National Natural Science Foundation of P.R.China(1 9971 0 0 2 ) and the Subject ofBeijing Educational Committ
文摘A new trust region algorithm for solving convex LC 1 optimization problem is presented.It is proved that the algorithm is globally convergent and the rate of convergence is superlinear under some reasonable assumptions.
文摘Trust region methods are powerful and effective optimization methods. The conic model method is a new type of method with more information available at each iteration than standard quadratic-based methods. The advantages of the above two methods can be combined to form a more powerful method for constrained optimization. The trust region subproblem of our method is to minimize a conic function subject to the linearized constraints and trust region bound. At the same time, the new algorithm still possesses robust global properties. The global convergence of the new algorithm under standard conditions is established.
基金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.
文摘The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we combine a popular nonmonotone technique with an adaptive trust region algorithm. The new ratio to adjusting the next trust region radius is different from the ratio in the traditional trust region methods. Under some appropriate conditions, we show that the new algorithm has good global convergence and superlinear convergence.
基金State Major Key Project for Basic ResearchesDecision Making and Information System Laboratory+1 种基金 Academy of Science of China Natural Science Foundation of Tsinghua University.
文摘In this paper we present a nonmonotone trust region method for nonlinear least squares problems with zero-residual and prove its convergence properties. The extensive numerical results are reported which show that the nonmonotone trust region method is generally superior to the usual trust region method.
基金Supported by the National Natural Science Foundation of China （10231060）, the Special Research Found of Doctoral Program of Higher Education of China（200d0319003 ）, the Research Project of Xuzhou Institute of Technology（ XKY200622）.
基金Supported by the National Natural Science Foundation of China (10871130)the Research Fund for the Doctoral Program of Higher Education of China (20093127110005)the Scientific Computing Key Laboratory of Shanghai Universities
文摘In this paper, a projected gradient trust region algorithm for solving nonlinear equality systems with convex constraints is considered. The global convergence results are developed in a very general setting of computing trial directions by this method combining with the line search technique. Close to the solution set this method is locally Q-superlinearly convergent under an error bound assumption which is much weaker than the standard nonsingularity condition.
文摘A class of trust region methods for solving linear inequality constrained problems is proposed in this paper. It is shown that the algorithm is of global convergence.The algorithm uses a version of the two-sided projection and the strategy of the unconstrained trust region methods. It keeps the good convergence properties of the unconstrained case and has the merits of the projection method. In some sense, our algorithm can be regarded as an extension and improvement of the projected type algorithm.
文摘In this paper, we propose and analyze a non-monotone trust region method with non-monotone line search strategy for unconstrained optimization problems. Unlike the traditional non-monotone trust region method, our algorithm utilizes non-monotone Wolfe line search to get the next point if a trial step is not adopted. Thus, it can reduce the number of solving sub-problems. Theoretical analysis shows that the new proposed method has a global convergence under some mild conditions.
基金Supported by Science and Technology Foundation of Shanghai Higher Education
文摘The secant methods discussed by Fontecilla (in 1988) are considerably revised through employing a trust region multiplier strategy and introducing a nondifferentiable merit function. In this paper the secant methods are also improved by adding a dogleg typed movement which allows to overcome a phenomena similar to the Maratos effect. Furthermore, these algorithms are analyzed and global convergence theorems as well as local superlinear convergence rate are proved.
文摘分布式云存储技术为数量日益庞大的机载软件提供了新的分发与存储方式,这意味着航空公司失去了对软件的直接控制,因此机载软件安全成为了航空公司十分关注的问题。为了提高云存储环境下机载软件的安全性,提出了一种基于可信隐式第三方(Trusted Implicit Third Party,TITP)的机载软件审计方法对云上机载软件进行监控与管理,以确保机载软件的完整性。此外,由部署在云端的可信硬件代替用户进行审计工作,解决了可公开验证审计机制中第三方审计者不完全可信的问题,并以日志的方式记录审计结果以供用户查询。运用可信硬件进行完整性验证不仅降低了用户计算成本,而且缩短了用户在线时间。与其他可信隐式第三方审计方法进行实验对比,所提方法在审计计算过程中节省了10%的时间消耗。
