非线性非完整约束空间准坐标表示的系统的基本动力学方程

用与准坐标表示的一阶非线性非完整约束超曲面的基矢量共线的量和米歇尔斯基方程点来作为一阶非线性非完整约束变质量系统的基本动力学方程．由此可导出用准坐标表示的各种形式的运动微分方程．和约登（Jourdain）原理相容．举了例子．     

An Analysis of Partially Clairvoyant Scheduling

Real-time scheduling problems confront two issues not addressed by traditional scheduling models, viz., parameter variability and the existence of complex relationships constraining the executions of jobs. Accordingly, modeling becomes crucial in the specification of scheduling problems in such systems. In this paper, we analyze scheduling algorithms in Partially Clairvoyant Real-time scheduling systems and present a new dual-based algorithm for the feasibility problem in the case of strict relative constraints. We also study the problem of online dispatching in Partially Clairvoyant systems and show that the complexity of dispatching is logarithmically related to the complexity of the schedulability problem.     

可行逐步二次规划方法解非线性方程组

We transform the system of nonlinear equations into a nonlinear programming problem, which is attacked by feasible sequential quadratic programming(FSQP) method.We do not employ standard least square approach.We divide the equations into two groups. One group, which contains the equations with zero residual,is treated as equality constraints. The square of other equations is regarded as objective function. Two groups are updated in every step.Therefore, the subproblem is updated at every step, which avoids the difficulty that it is required to lie in feasible region for FSQP.     

Validation tools for variable subset regression

Variable selection is applied frequently in QSAR research. Since the selection process influences the characteristics of the finally chosen model, thorough validation of the selection technique is very important. Here, a validation protocol is presented briefly and two of the tools which are part of this protocol are introduced in more detail. The first tool, which is based on permutation testing, allows to assess the inflation of internal figures of merit (such as the cross-validated prediction error). The other tool, based on noise addition, can be used to determine the complexity and with it the stability of models generated by variable selection. The obtained statistical information is important in deciding whether or not to trust the predictive abilities of a specific model. The graphical output of the validation tools is easily accessible and provides a reliable impression of model performance. Among others, the tools were employed to study the influence of leave-one-out and leave-multiple-out cross-validation on model characteristics. Here, it was confirmed that leave-multiple-out cross-validation yields more stable models. To study the performance of the entire validation protocol, it was applied to eight different QSAR data sets with default settings. In all cases internal and external model performance was good, indicating that the protocol serves its purpose quite well.     

The Gradient Projection Method with Exact Line Search

The gradient projection algorithm for function minimization is often implemented using an approximate local minimization along the projected negative gradient. On the other hand, for some difficult combinational optimization problems, where a starting guess may be far from a solution, it may be advantageous to perform a nonlocal (exact) line search. In this paper we show how to evaluate the piece-wise smooth projection associated with a constraint set described by bounds on the variables and a single linear equation. When the NP hard graph partitioning problem is formulated as a continuous quadratic programming problem, the constraints have this structure.     

An acquisition policy for a single item multi-supplier system with real-world constraints

This paper proposes an exact acquisition policy for solving the single-item multi-supplier problem with real-world constraints. Compared with the model of Rosenblatt et al. [Note. An acquisition policy for a single item multi-supplier system, Manage. Sci. 44 (1998) S96–S100], the proposed method has contributions in that the global optimal solutions can be obtained to indicate the best acquisition policy, and real-world constraints can easily be added as appropriate for real-world situations. In addition, the benefits of price-quantity discount (PQD) under conditions of the single item muti-supplier system are also considered in the paper.     

Tabu Search for Frequency Assignment in Mobile Radio Networks

The main goal of the Frequency Assignment Problem in mobile radio networks consists of assigning a limited number of frequencies to each radio cell in a cellular network while minimizing electromagnetic interference due to the reuse of frequencies. This problem, known to be NP-hard, is of great importance in practice since better solutions will allow a telecommunications operator to manage larger cellular networks. This paper presents a new Tabu Search algorithm for this application. The algorithm is tested on realistic and large problem instances and compared with other methods based on simulated annealing, constraint programming and graph coloring algorithms. Empirical evidence shows that the Tabu algorithm is very competitive by giving the best solutions to the tested instances.     

A Globally Convergent Sequential Quadratic Programming Algorithm for Mathematical Programs with Linear Complementarity Constraints

This paper presents a sequential quadratic programming algorithm for computing a stationary point of a mathematical program with linear complementarity constraints. The algorithm is based on a reformulation of the complementarity condition as a system of semismooth equations by means of Fischer-Burmeister functional, combined with a classical penalty function method for solving constrained optimization problems. Global convergence of the algorithm is established under appropriate assumptions. Some preliminary computational results are reported.