The paper main solve above two *** the paper a Chinese Trigram model of task adaptation ability are set up.A zerogram to trigram probability statistics information base of 1994 "People Daily" are built,it ma...
详细信息
The paper main solve above two *** the paper a Chinese Trigram model of task adaptation ability are set up.A zerogram to trigram probability statistics information base of 1994 "People Daily" are built,it made use of the success experience of HMM in speech recognition, and adopted Baum-Welch algorithm for optimum of the *** weigh stands for correlation statistic reliability of these *** probability statistics matrix smooth algorithm of the parameter space was carried on,in order to offset the matrix sparse data of statistic *** "People Daily" corpus statistic results are regard as the preliminary statistic *** the changing of application domain,then the recognition accuracy rate of the preliminary statistic results are declined,we adopted "PC World" as the corpus of the changing domain and carried on successive training,then second smooth of the preliminary statistic results and successive statistic results was look on as finally results.A trigram model of task adaptation is gotten. The experiment results show,this language model the workload of successive training befits,it can effectively reduce the perplexity of language model in task changing domain,it has a high language adaptation ability in the task changing domain.
In this paper, we investigate a smoothing-type algorithm for solving the symmetric cone linear program （（SCLP） for short） by making use of an augmented system of its optimality conditions. The algorithm only needs...
详细信息
In this paper, we investigate a smoothing-type algorithm for solving the symmetric cone linear program （（SCLP） for short） by making use of an augmented system of its optimality conditions. The algorithm only needs to solve one system of linear equations and to perform one line search at each iteration. It is proved that the algorithm is globally convergent without assuming any prior knowledge of feasibility/infeasibility of the problem. In particular, the algorithm may correctly detect solvability of （SCLP）. Furthermore, if （SCLP） has a solution, then the algorithm will generate a solution of （SCLP）, and if the problem is strongly infeasible, the algorithm will correctly detect infeasibility of （SCLP）.
There has been much interest in studying symmetric cone complementarity problems. In this paper, we study the circular cone complementarity problem (denoted by CCCP) which is a type of nonsymmetric cone complementarit...
详细信息
There has been much interest in studying symmetric cone complementarity problems. In this paper, we study the circular cone complementarity problem (denoted by CCCP) which is a type of nonsymmetric cone complementarity problem. We first construct two smoothing functions for the CCCP and show that they are all coercive and strong semismooth. Then we propose a smoothing algorithm to solve the CCCP. The proposed algorithm generates an infinite sequence such that the value of the merit function converges to zero. Moreover, we show that the iteration sequence must be bounded if the solution set of the CCCP is nonempty and bounded. At last, we prove that the proposed algorithm has local superlinear or quadratical convergence under some assumptions which are much weaker than Jacobian nonsingularity assumption. Some numerical results are reported which demonstrate that our algorithm is very effective for solving CCCPs.
We present a smoothing-type algorithm for solving the linear program (LP) by making use of an augmented system of its optimality conditions. The algorithm is shown to be globally convergent without requiring any assum...
详细信息
We present a smoothing-type algorithm for solving the linear program (LP) by making use of an augmented system of its optimality conditions. The algorithm is shown to be globally convergent without requiring any assumption. It only needs to solve one system of linear equations and to perform one line search at each iteration. In particular, if the LP has a solution (and hence it has a strictly complementary solution), then the algorithm will generate a strictly complementary solution of the LP;and if the LP is infeasible, then the algorithm will correctly detect infeasibility of the LP. To the best of our knowledge, this is the first smoothing-type algorithm for solving the LP having the above desired convergence features. (c) 2005 Elsevier Inc. All rights reserved.
In this paper, we introduce a one-parametric class of smoothing functions in the context of symmetric cones which contains two symmetric perturbed smoothing functions as special cases, and show that it is coercive und...
详细信息
In this paper, we introduce a one-parametric class of smoothing functions in the context of symmetric cones which contains two symmetric perturbed smoothing functions as special cases, and show that it is coercive under suitable assumptions. Based on this class of smoothing functions, a smoothing Newton algorithm is extended to solve the complementarity problems over symmetric cones, and it is proved that the proposed algorithm is globally and locally superlinearly convergent under suitable assumptions. The theory of Euclidean Jordan algebras is a basic tool which is extensively used in our analysis. Preliminary numerical results for randomly generated second-order cone programs and several practical second-order cone programs from the DIMACS library are reported.
By using the theory of Euclidean Jordan algebras,based on a new class of smoothing functions,the QiSun-Zhou's smoothing Newton algorithm is extended to solve linear programming over symmetric cones(SCLP).The algor...
详细信息
By using the theory of Euclidean Jordan algebras,based on a new class of smoothing functions,the QiSun-Zhou's smoothing Newton algorithm is extended to solve linear programming over symmetric cones(SCLP).The algorithm is globally convergent under suitable assumptions.
In passive tracking, the nonlinearity may cause computational complication and precision degradation. To solve this problem, a novel filtering-smoothing algorithm based on Square-Root Unscented Kalman Filter（SR-UKFS...
详细信息
In passive tracking, the nonlinearity may cause computational complication and precision degradation. To solve this problem, a novel filtering-smoothing algorithm based on Square-Root Unscented Kalman Filter（SR-UKFS） is proposed to track underwater target. In the SR-UKFS algorithm, the Square-Root Unscented Kalman Filter（SR-UKF） is used as forward-filtering algorithm to provide current location results, and the Rauch-Tung-Striebel（RTS） algorithm smoothes the previous state vector and covariance matrix using the current location results. Comparative analysis and validation are made on the tracking performances of SR-UKFS algorithm and SR-UKF algorithm, and the simulation results show that, under the same conditions, the SR-UKFS can more effectively improve the tracking precision than the SR-UKF algorithm. The SR-UKFS algorithm can reduce nearly 59% of the position error and nearly 54% of the velocity error.
There recently has been much interest in studying optimization problems over symmetric cones. In this paper, we first investigate a smoothing function in the context of symmetric cones and show that it is coercive und...
详细信息
There recently has been much interest in studying optimization problems over symmetric cones. In this paper, we first investigate a smoothing function in the context of symmetric cones and show that it is coercive under suitable assumptions. We then extend two generic frameworks of smoothing algorithms to solve the complementarity problems over symmetric cones, and prove the proposed algorithms are globally convergent under suitable assumptions. We also give a specific smoothing Newton algorithm which is globally and locally quadratically convergent under suitable assumptions. The theory of Euclidean Jordan algebras is a basic tool which is extensively used in our analysis. Preliminary numerical results for second-order cone complementarity problems are reported.
Model-based video coding has been adopted as a core experiment in ISO MPEG-4 standard. The clip-and-paste technique for putting video objects in line is an important tool to reduce the transmission rate. To assist the...
详细信息
Model-based video coding has been adopted as a core experiment in ISO MPEG-4 standard. The clip-and-paste technique for putting video objects in line is an important tool to reduce the transmission rate. To assist the clip-and-pasting method fitting into the 2-D model, we propose several smoothing algorithms for improving the quality of the reconstructed images. In this paper, the proposed smoothing algorithms can adjust deformations of zoom, tilt, and rotation object images. Luminance smoothing algorithm is also applied to compensate the light source variations. Simulation results show that the smoothing methods help to improve clip-and-paste images to achieve a satisfactory quality in visual perceptions.
The paper presents methods of on-line and off-line estimation of UAV position on the basis of measurements from its integrated navigation system. The navigation system installed on board UAV contains an INS and a GNSS...
详细信息
The paper presents methods of on-line and off-line estimation of UAV position on the basis of measurements from its integrated navigation system. The navigation system installed on board UAV contains an INS and a GNSS receiver. The UAV position, as well as its velocity and orientation are estimated with the use of smoothing algorithms. For off-line estimation, a fixed-interval smoothing algorithm has been applied. On-line estimation has been accomplished with the use of a fixed-lag smoothing algorithm. The paper includes chosen results of simulations demonstrating improvements of accuracy of UAV position estimation with the use of smoothing algorithms in comparison with the use of a Kalman filter.
暂无评论