用标准件对梯度磁场定标

就标准厚度卡片在霍尔传感器的定标方面的应用作了有益的探讨。在纵向测量微小长度时,霍尔片处于磁场边缘位置,其对磁场的梯度更大,即灵敏度更高,且靠中心位置的线性更好。     

Skyrmion transport driven by pure voltage generated strain gradient

The magnetic skyrmion transport driven by pure voltage-induced strain gradient is proposed and studied via micromagnetic simulation. Through combining the skyrmion with multiferroic heterojunction, a voltage-induced uniaxial strain gradient is adjusted to move skyrmions. In the system, a pair of short-circuited trapezoidal top electrodes can generate the symmetric strain. Due to the symmetry of strain, the magnetic skyrmion can be driven with a linear motion in the middle of the nanostrip without deviation. We calculate the strain distribution generated by the trapezoidal top electrodes pair, and further investigate the influence of the strain intensity as well as the strain gradient on the skyrmion velocity. Our findings provide a stable and low-energy regulation method for skyrmion transport.     

Invariant discrete flows

In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself.     

一阶最优性条件研究

本对由Botsko的关于多变量函数取极值的一阶导数检验条件定理^[1]进行了分析研究，给出了更实用而简捷的差别条件。最后，举出若干例子予以说明。     

Numerical solutions of the shallow water equations with discontinuous bed topography

A simple scheme is developed for treatment of vertical bed topography in shallow water flows. The effect of the vertical step on flows is modelled with the shallow water equations including local energy loss terms. The bed elevation is denoted with z_b^‐ for the left and z_b⁺ for the right values at each grid point, hence exactly representing a discontinuity in the bed topography. The surface gradient method (SGM) is generalized to reconstruct water depths at cell interfaces involving a vertical step so that the fluxes at the cell interfaces can accurately be calculated with a Riemann solver. The scheme is verified by predicting a surge crossing a step, a tidal flow over a step and dam‐break flows on wet/dry beds. The results have shown good agreements compared with analytical solutions and available experimental data. The scheme is efficient, robust, and may be used for practical flow calculations. Copyright © 2002 John Wiley & Sons, Ltd.     

A stochastic algorithm using one sample point per iteration and diminishing stepsizes

A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex _i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx ₁,x ₂,...generated by the algorithm is bounded, then all of its accumulation points are stationary.     

Momentum transport and torque scaling in Taylor-Couette flow from an analogy with turbulent convection

We generalize an analogy between rotating and stratified shear flows. This analogy is summarized in Table 1. We use this analogy in the unstable case (centrifugally unstable flow vs. convection) to compute the torque in Taylor-Couette configuration, as a function of the Reynolds number. At low Reynolds numbers, when most of the dissipation comes from the mean flow, we predict that the non-dimensional torque G = T/ν² L, where L is the cylinder length, scales with Reynolds number R and gap width η, G = 1.46η^3/2(1 - η)^-7/4 R ^3/2. At larger Reynolds number, velocity fluctuations become non-negligible in the dissipation. In these regimes, there is no exact power law dependence the torque versus Reynolds. Instead, we obtain logarithmic corrections to the classical ultra-hard (exponent 2) regimes: G = 0.50 . These predictions are found to be in excellent agreement with avail-able experimental data. Predictions for scaling of velocity fluctuations are also provided. Received 7 June 2001 and Received in final form 7 December 2001     

线性分式规划最优解集的求法

本文使用多面集的表示定理，导出了线性分式规划最优解集的结构，并给出确定全部最优解的计算步骤。     

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.     

一个线性约束优化问题的广义梯度投影法

本文对线性约束优化问题提出了一个新的广义梯度投影法，该算法采用了非精确线性搜索，并在每次迭代运算中结合了广义投影矩阵和变尺度方法的思想确定其搜索方向．在通常的假设条件下，证明了该算法的整体收敛性和超线性收敛速度．