无线供能及移动边缘计算技术的整合为下一代无线通信网的实现提供了技术支持。然而,用户数量的激增将对诸如系统响应时效性和超低延时等需求的实现提出了新的挑战。因此,如何设计迭代次数少、收敛速度快、灵活性强的实时计算卸载策略成...无线供能及移动边缘计算技术的整合为下一代无线通信网的实现提供了技术支持。然而,用户数量的激增将对诸如系统响应时效性和超低延时等需求的实现提出了新的挑战。因此,如何设计迭代次数少、收敛速度快、灵活性强的实时计算卸载策略成了研究的新热点。文章梳理了无线供能移动边缘计算(Wireless Powered Mobile Edge Computing,WP-MEC)系统在实现超低延时需求上面临的问题与挑战;总结了WP-MEC系统的网络模型及其计算卸载策略的研究概况;详细阐述了4种不同接入方式下的WP-MEC系统的计算卸载策略研究现状;对比分析了各类传统的数值优化方法及深度强化学习优化方法在实时计算卸载决策方面的优劣;对低复杂度高效计算卸载策略的发展进行总结与展望,提出了延时最小化计算卸载策略的3个关键研究方向。展开更多
Using difference quotient instead of derivative, the paper presents the solution method and procedure of the nonlinear least square estimation containing different classes of measurements. In the meantime, the paper s...Using difference quotient instead of derivative, the paper presents the solution method and procedure of the nonlinear least square estimation containing different classes of measurements. In the meantime, the paper shows several practical cases, which indicate the method is very valid and reliable.展开更多
Typical isolation models are studied and a New Application Security Isolation model called NASI is proposed, which is based on trusted computing technology and least privilege principle. This paper introduces the desi...Typical isolation models are studied and a New Application Security Isolation model called NASI is proposed, which is based on trusted computing technology and least privilege principle. This paper introduces the design ideas of NASI, gives out formal description and safety analysis for the model, and finally describes the implementation of prototype system based on NASI.展开更多
A discrete optimization problem for minimizing the sum of fabrication cost and steel material cost of sf^el frames under constraints based on Japanese seismic code is set up. Enhancements of the genetic algorithm for ...A discrete optimization problem for minimizing the sum of fabrication cost and steel material cost of sf^el frames under constraints based on Japanese seismic code is set up. Enhancements of the genetic algorithm for the above-mentioned problem are proposed, which are combined with a 1D （one-dimensional） search or a 2D （two-dimensional） search. After the proposed methods are described, they are applied to a five-story frame. A comparison with an exact solution obtained by a revised enumeration algorithm demonstrates the effectiveness of the proposed methods.展开更多
We improve the twin support vector machine(TWSVM)to be a novel nonparallel hyperplanes classifier,termed as ITSVM(improved twin support vector machine),for binary classification.By introducing the diferent Lagrangian ...We improve the twin support vector machine(TWSVM)to be a novel nonparallel hyperplanes classifier,termed as ITSVM(improved twin support vector machine),for binary classification.By introducing the diferent Lagrangian functions for the primal problems in the TWSVM,we get an improved dual formulation of TWSVM,then the resulted ITSVM algorithm overcomes the common drawbacks in the TWSVMs and inherits the essence of the standard SVMs.Firstly,ITSVM does not need to compute the large inverse matrices before training which is inevitable for the TWSVMs.Secondly,diferent from the TWSVMs,kernel trick can be applied directly to ITSVM for the nonlinear case,therefore nonlinear ITSVM is superior to nonlinear TWSVM theoretically.Thirdly,ITSVM can be solved efciently by the successive overrelaxation(SOR)technique or sequential minimization optimization(SMO)method,which makes it more suitable for large scale problems.We also prove that the standard SVM is the special case of ITSVM.Experimental results show the efciency of our method in both computation time and classification accuracy.展开更多
Minimum fluidization velocity of quartz sand and glass bead under different pressures of 0.5, 1.0, 1.5 and 2.0 MPa were investigated. The minimum fluidization velocity decreases with the increasing of pressure. The in...Minimum fluidization velocity of quartz sand and glass bead under different pressures of 0.5, 1.0, 1.5 and 2.0 MPa were investigated. The minimum fluidization velocity decreases with the increasing of pressure. The influence of pressure to the minimum fluidization velocities is stronger for larger particles than for smaller ones. Based on the test results and Ergun equation, an experience equation of minimum fluidization velocity is proposed and the calculation results are comparable to other researchers＇ results.展开更多
This paper investigates the equality-constrained minimization of polynomial functions. Let R be the field of real numbers, and R[x1,..., xn] the ring of polynomials over R in variables x1,..., xn. For an f ∈ R[x1,......This paper investigates the equality-constrained minimization of polynomial functions. Let R be the field of real numbers, and R[x1,..., xn] the ring of polynomials over R in variables x1,..., xn. For an f ∈ R[x1,..., xn] and a finite subset H of R[x1,..., xn], denote by V(f : H) the set {f( ˉα) | ˉα∈ Rn, and h( ˉα) =0, ? h ∈ H}. We provide an effective algorithm for computing a finite set U of non-zero univariate polynomials such that the infimum inf V(f : H) of V(f : H) is a root of some polynomial in U whenever inf V(f : H) = ±∞.The strategies of this paper are decomposing a finite set of polynomials into triangular chains of polynomials and computing the so-called revised resultants. With the aid of the computer algebraic system Maple, our algorithm has been made into a general program to treat the equality-constrained minimization of polynomials with rational coefficients.展开更多
In this paper, we develop a novel alternating linearization method for solving convex minimization whose objective function is the sum of two separable functions. The motivation of the paper is to extend the recent wo...In this paper, we develop a novel alternating linearization method for solving convex minimization whose objective function is the sum of two separable functions. The motivation of the paper is to extend the recent work Goldfarb et al.(2013) to cope with more generic convex minimization. For the proposed method,both the separable objective functions and the auxiliary penalty terms are linearized. Provided that the separable objective functions belong to C1,1(Rn), we prove the O(1/?) arithmetical complexity of the new method. Some preliminary numerical simulations involving image processing and compressive sensing are conducted.展开更多
In this paper,a randomized Cayley-Hamilton theorem based method(abbreviated by RCH method) for computing the minimal polynomial of a polynomial matrix is presented.It determines the coefficient polynomials term by ter...In this paper,a randomized Cayley-Hamilton theorem based method(abbreviated by RCH method) for computing the minimal polynomial of a polynomial matrix is presented.It determines the coefficient polynomials term by term from lower to higher degree.By using a random vector and randomly shifting,it requires no condition on the input matrix and works with probability one.In the case that coefficients of entries of the given polynomial matrix are all integers and that the algorithm is performed in exact computation,by using the modular technique,a parallelized version of the RCH method is also given.Comparisons with other algorithms in both theoretical complexity analysis and computational tests are given to show its effectiveness.展开更多
Minimax programming problems involving generalized （p, r）-invex functions are consid- ered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the obje...Minimax programming problems involving generalized （p, r）-invex functions are consid- ered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the objective and constraint functions.展开更多
文摘无线供能及移动边缘计算技术的整合为下一代无线通信网的实现提供了技术支持。然而,用户数量的激增将对诸如系统响应时效性和超低延时等需求的实现提出了新的挑战。因此,如何设计迭代次数少、收敛速度快、灵活性强的实时计算卸载策略成了研究的新热点。文章梳理了无线供能移动边缘计算(Wireless Powered Mobile Edge Computing,WP-MEC)系统在实现超低延时需求上面临的问题与挑战;总结了WP-MEC系统的网络模型及其计算卸载策略的研究概况;详细阐述了4种不同接入方式下的WP-MEC系统的计算卸载策略研究现状;对比分析了各类传统的数值优化方法及深度强化学习优化方法在实时计算卸载决策方面的优劣;对低复杂度高效计算卸载策略的发展进行总结与展望,提出了延时最小化计算卸载策略的3个关键研究方向。
文摘Using difference quotient instead of derivative, the paper presents the solution method and procedure of the nonlinear least square estimation containing different classes of measurements. In the meantime, the paper shows several practical cases, which indicate the method is very valid and reliable.
文摘Typical isolation models are studied and a New Application Security Isolation model called NASI is proposed, which is based on trusted computing technology and least privilege principle. This paper introduces the design ideas of NASI, gives out formal description and safety analysis for the model, and finally describes the implementation of prototype system based on NASI.
文摘A discrete optimization problem for minimizing the sum of fabrication cost and steel material cost of sf^el frames under constraints based on Japanese seismic code is set up. Enhancements of the genetic algorithm for the above-mentioned problem are proposed, which are combined with a 1D （one-dimensional） search or a 2D （two-dimensional） search. After the proposed methods are described, they are applied to a five-story frame. A comparison with an exact solution obtained by a revised enumeration algorithm demonstrates the effectiveness of the proposed methods.
基金supported by National Natural Science Foundation of China(Grant Nos.11271361 and 70921061)the CAS/SAFEA International Partnership Program for Creative Research Teams,Major International(Regional)Joint Research Project(Grant No.71110107026)+1 种基金the Ministry of Water Resources Special Funds for Scientific Research on Public Causes(Grant No.201301094)Hong Kong Polytechnic University(Grant No.B-Q10D)
文摘We improve the twin support vector machine(TWSVM)to be a novel nonparallel hyperplanes classifier,termed as ITSVM(improved twin support vector machine),for binary classification.By introducing the diferent Lagrangian functions for the primal problems in the TWSVM,we get an improved dual formulation of TWSVM,then the resulted ITSVM algorithm overcomes the common drawbacks in the TWSVMs and inherits the essence of the standard SVMs.Firstly,ITSVM does not need to compute the large inverse matrices before training which is inevitable for the TWSVMs.Secondly,diferent from the TWSVMs,kernel trick can be applied directly to ITSVM for the nonlinear case,therefore nonlinear ITSVM is superior to nonlinear TWSVM theoretically.Thirdly,ITSVM can be solved efciently by the successive overrelaxation(SOR)technique or sequential minimization optimization(SMO)method,which makes it more suitable for large scale problems.We also prove that the standard SVM is the special case of ITSVM.Experimental results show the efciency of our method in both computation time and classification accuracy.
文摘Minimum fluidization velocity of quartz sand and glass bead under different pressures of 0.5, 1.0, 1.5 and 2.0 MPa were investigated. The minimum fluidization velocity decreases with the increasing of pressure. The influence of pressure to the minimum fluidization velocities is stronger for larger particles than for smaller ones. Based on the test results and Ergun equation, an experience equation of minimum fluidization velocity is proposed and the calculation results are comparable to other researchers＇ results.
基金supported by National Natural Science Foundation of China(Grant No.11161034)
文摘This paper investigates the equality-constrained minimization of polynomial functions. Let R be the field of real numbers, and R[x1,..., xn] the ring of polynomials over R in variables x1,..., xn. For an f ∈ R[x1,..., xn] and a finite subset H of R[x1,..., xn], denote by V(f : H) the set {f( ˉα) | ˉα∈ Rn, and h( ˉα) =0, ? h ∈ H}. We provide an effective algorithm for computing a finite set U of non-zero univariate polynomials such that the infimum inf V(f : H) of V(f : H) is a root of some polynomial in U whenever inf V(f : H) = ±∞.The strategies of this paper are decomposing a finite set of polynomials into triangular chains of polynomials and computing the so-called revised resultants. With the aid of the computer algebraic system Maple, our algorithm has been made into a general program to treat the equality-constrained minimization of polynomials with rational coefficients.
基金supported by National Natural Science Foundation of China(Grant Nos.11301055 and 11401315)Natural Science Foundation of Jiangsu Province(Grant No.BK2009397)the Fundamental Research Funds for the Central Universities(Grant No.ZYGX2013J103)
文摘In this paper, we develop a novel alternating linearization method for solving convex minimization whose objective function is the sum of two separable functions. The motivation of the paper is to extend the recent work Goldfarb et al.(2013) to cope with more generic convex minimization. For the proposed method,both the separable objective functions and the auxiliary penalty terms are linearized. Provided that the separable objective functions belong to C1,1(Rn), we prove the O(1/?) arithmetical complexity of the new method. Some preliminary numerical simulations involving image processing and compressive sensing are conducted.
基金supported by the National Natural Science Foundation of China under Grant No.11171051the Major Research plan of the National Natural Science Foundation of China under Grant No.91230103the Fundamental Research Funds for the Central Universities under Grant No.DUT14RC(3)023
文摘In this paper,a randomized Cayley-Hamilton theorem based method(abbreviated by RCH method) for computing the minimal polynomial of a polynomial matrix is presented.It determines the coefficient polynomials term by term from lower to higher degree.By using a random vector and randomly shifting,it requires no condition on the input matrix and works with probability one.In the case that coefficients of entries of the given polynomial matrix are all integers and that the algorithm is performed in exact computation,by using the modular technique,a parallelized version of the RCH method is also given.Comparisons with other algorithms in both theoretical complexity analysis and computational tests are given to show its effectiveness.
文摘Minimax programming problems involving generalized （p, r）-invex functions are consid- ered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the objective and constraint functions.
