实二次域上理想类的zeta-函数在-1处的值

用连分数给出了实二次域理想类的zeta-函数-1处值的一个具体的计算公式.     

An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines

In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison with a widely used decomposition package.     

基于平均和峰值灰度加权的自动调光系统

介绍了在CCD高速电视测量仪系统中，利用电子快门和可变光阑有机结合，在运动控制卡控制下实现自动调光，扩大了调光的动态范围.采用了平均灰度和峰值灰度加权的办法来获取反馈信号，有效的解决不同背景下自调光系统的适应性.提出了基于二次函数的调光反馈量计算方法，提高了调光过程中的收敛速度，同时也保证了系统有较小的超调量.     

Generalized quasilinearization method for reaction-diffusion equations under nonlinear and nonlocal flux conditions

In this paper we consider an initial boundary value problem for a reaction-diffusion equation under nonlinear and nonlocal Robin type boundary condition. Assuming the existence of an ordered pair of upper and lower solutions we establish a generalized quasilinearization method for the problem under consideration whose characteristic feature consists in the construction of monotone sequences converging to the unique solution within the interval of upper and lower solutions, and whose convergence rate is quadratic. Thus this method provides an efficient iteration technique that produces not only improved approximations due to the monotonicity of its iterates, but yields also a measure of the convergence rate.     

Cochran's statistical theorem for outer inverses of matrices and matrix quadratic forms

We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.     

Quadratic Functionals with General Boundary Conditions

The purpose of this paper is to give the Reid ``Roundabout Theorem' for quadratic functionals with general boundary conditions. In particular, we describe the so-called coupled point and regularity condition introduced in [16] in terms of Riccati equation solutions. Accepted 27 February 1996     

Global Optimization of a Quadratic Functional with Quadratic Equality Constraints, Part 2

In this paper, we investigate a constrained optimization problem with a quadratic cost functional and two quadratic equality constraints. It is assumed that the cost functional is positive definite and that the constraints are both feasible and regular (but otherwise they are unrestricted quadratic functions). Thus, the existence of a global constrained minimum is assured. We develop a necessary and sufficient condition that completely characterizes the global minimum cost. Such a condition is of essential importance in iterative numerical methods for solving the constrained minimization problem, because it readily distinguishes between local minima and global minima and thus provides a stopping criterion for the computation. The result is similar to one obtained previously by the authors. In the previous result, we gave a characterization of the global minimum of a constrained quadratic minimization problem in which the cost functional was an arbitrary quadratic functional (as opposed to positive-definite here) and the constraints were at least positive-semidefinite quadratic functions (as opposed to essentially unrestricted here).     

A note on a polynomial time solvable case of the quadratic assignment problem

We identify a class of instances of the Koopmans–Beckmann form of the Quadratic Assignment Problem that are solvable in polynomial time. This class is characterized by a path structure in the flow data and a grid structure in the distance data. Chr18b, one of the test problems in the QAPLIB, is in this class even though this feature of it has not been noticed until now.