Modified Burzynski criterion with non-associated flow rule for anisotropic asymmetric metals in plane stress problems

The Burzynski criterion is developed for anisotropic asymmetric metals with the non-associated flow rule (NAFR) for plane stress problems. The presented pressure depending on the yield criterion can be calibrated with ten experimental data, i.e., the tensile yield stresses at 0°, 45°, and 90°, the compressive yield stresses at 0°, 15°, 30°, 45°, 75°, and 90° from the rolling direction, and the biaxial tensile yield stress. The corresponding pressure independent plastic potential function can be calibrated with six experimental data, i.e., the tensile R-values at 0°, 15°, 45°, 75°, and 90° from the rolling direction and the tensile biaxial R-value. The downhill simplex method is used to solve these ten and six high nonlinear equations for the yield and plastic potential functions, re- spectively. The results show that the presented new criterion is appropriate for anisotropic asymmetric metals.     

关于高维单形体积的不等式

给出了高维单形与界面有关的体积不等式和与二面角有关的体积不等式,进而建立正则单形的有别于定义式的体积公式.     

线性规划全方位变化的灵敏度分析

本文对变量目标函数系数、变量约束系数向量以及约束右端项向量同时变化进行灵敏度分析。不仅对变化后可能出现的各种情况进行分析处理,尤其在对偶可行性和可行性都不满足时,利用联合算法进行处理,并通过算例加以说明。     

An algorithm for three-dimensional Voronoi S-network

The paper presents an algorithm for calculating the three-dimensional Voronoi-Delaunay tessellation for an ensemble of spheres of different radii (additively-weighted Voronoi diagram). Data structure and output of the algorithm is oriented toward the exploration of the voids between the spheres. The main geometric construct that we develop is the Voronoi S-network (the network of vertices and edges of the Voronoi regions determined in relation to the surfaces of the spheres). General scheme of the algorithm and the key points of its realization are discussed. The principle of the algorithm is that for each determined site of the network we find its neighbor sites. Thus, starting from a known site of the network, we sequentially find the whole network. The starting site of the network is easily determined based on certain considerations. Geometric properties of ensembles of spheres of different radii are discussed, the conditions of applicability and limitations of the algorithm are indicated. The algorithm is capable of working with a wide variety of physical models, which may be represented as sets of spheres, including computer models of complex molecular systems. Emphasis was placed on the issue of increasing the efficiency of algorithm to work with large models (tens of thousands of atoms). It was demonstrated that the experimental CPU time increases linearly with the number of atoms in the system, O(n).     

简化超球体SRUKF的GPS/MIMU组合姿态估计

针对加速度计、磁强计易受机动加速度和周围环境影响的问题,提出了一种单基线GPS/MIMU组合姿态估计方法。该方法利用单基线GPS天线代替磁强计提供航向信息,并利用GPS的速度信息对加速度计输出的机动加速度分量进行补偿,构成单基线GPS/MIMU组合姿态确定单元。同时考虑实时性要求,在SRUKF的基础上,引入加性非扩展形式和超球体单形采样,提出了简化超球体平方根UKF算法,通过减少状态维数和采样点的数量,降低算法计算量。建立加性噪声下的单基线GPS/MIMU姿态模型,并采用简化超球体平方根UKF算法进行姿态估计。实验结果表明,单基线GPS的速度信息可以有效提高加速度计对水平倾角的确定精度,姿态估计算法收敛后的最大误差小于0.8°,估计精度与UKF相当,且执行时间仅是UKF的42%。     

Solving a multiobjective traveling salesman problem by dynamic programming

In this paper Klötzler's method of multiobjective dynamic programming is applied to the solution of a two-dimensional traveling salesman problem. In this way Bellman's and Held/Karp's dynamic programming approach to one-dimensional traveling salesman problems is extended to the multiobjective case.     

二分单纯形算法中子规划问题的进一步研究

本对二分单纯形算法的子规划问题作进一步研究,提出一个新的子规划问题来改善问题的不可行性,并确定了相应的主元旋转规则,并编制了相应于新子规划的新二分算法,并对94个线性规划问题进行了数值实验,实验结果表明,新二分算法是一种改进的二分算法。     

线性规划两阶段法的改进算法

将单纯形法与对偶单纯形法及其思想结合运用,对两阶段法引进人工变量的方式进行了改进,探索出一种最多引入一个人工变量,即可求得线性规划初始可行基的新算法,能有效地节约计算机的存储量和计算量。     

A Non-derivative MFCC Optimization Study of Cyclohexapeptide Monohydrate

The MFCC-downhill simplex method is presented to study the binding structure of small ligands in large molecular complex systems. This method employs the Molecular Fractionation with Conjugated Caps (MFCC) approach to compute the interaction energy-structure relation of the system and implements the downhill simplex algorithm for structural optimization. The method is tested on a molecular system of cyclo-AAGAGG￠H2O to optimize the binding position of water molecule to the ˉxed cyclohexapeptide. The MFCC-downhill simplex optimization results are in good agreement with the crystal structure. An MFCC-Powell optimization method which uses the Powell's minimization algorithm is also described and tested on the same system. The MFCC-downhill simplex optimization is more e±cient than the MFCC-Powell method.     

New labeling procedures for the basis graph in generalized networks

Labeling procedures for the basis graph of a generalized network are introduced which build on procedures designed for pure networks. Computational results are presented which show that a primal simplex code which uses these procedures is about 60 times faster than a general purpose linear programming code.