Balance constraints reduction of large-scale linear programming problems

This paper describes a method and the corresponding algorithms for simplification of large-scale linear programming models. It consists of the elimination of the balance constraints (i.e. constraints with zero RHS term). The idea is to apply some linear transformations to the original problem in order to nullify the balance constraints. These transformations are able to simultaneously eliminate more balance rows. The core of this contribution is the introduction of the reduction matrix and the associated theorems on the equivalent linear programs (original and reduced). The numerical experiments with this method of simplification proved this approach to be beneficial for a large class of LP problems.This research work was done while the first author was at Duisburg University, Mess-, Steuer und Regelungstechnik, Germany, under the greatly appreciated financial assistance given by the Alexander-von-Humboldt Foundation.     

Farthest-point queries with geometric and combinatorial constraints

In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the point farthest from a query line segment in O(log²n) time. Our data structure needs O(nlogn) space and preprocessing time. To the best of our knowledge no solution to this problem has been suggested yet. Second, we show how to use this data structure to obtain an output-sensitive query-based algorithm for polygonal path simplification. Both results are based on a series of data structures for fundamental farthest-point queries that can be reduced to each other.     

Optimum gas chromatographic conditions in wall-coated capillary columns. Extended and simplified forms of the Golay-equation

Band broadening in capillary columns is satisfactorily described by the Golay-equation extended to situations of appreciable pressure drop by Giddings. In practice, however, several simplifications are often made. The effect of these simplifications on the calculated values of the minimum plate height and optimum carrier gas velocity are treated systematically.     

微积分的再思考

基于代数和显式一致估计的微积分思想可以追溯到前牛顿时代,或者欧拉和拉格朗日.由于所涉及的数学非常简单,新的方法可以从一些简单的例子出发,直接、自然却严格地建立微分和积分的流线型理论,并不需要连续性、极限和紧性的概念.     

Meshfree Thinning of 3D Point Clouds

An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point removal algorithm, termed thinning, which outputs a data hierarchy of point-samples for multiresolution surface approximation. The thinning algorithm works with a point removal criterion, which measures the significances of the points in their local neighbourhoods, and which removes a least significant point at each step. For any point x in the current point set Y⊂X, its significance reflects the approximation quality of a local surface reconstructed from neighbouring points in Y. The local surface reconstruction is done over an estimated tangent plane at x by using radial basis functions. The approximation quality of the surface reconstruction around x is measured by using its maximal deviation from the given point-samples X in a local neighbourhood of x. The resulting thinning algorithm is meshfree, i.e., its performance is solely based upon the geometry of the input 3D surface point-samples, and so it does not require any further topological information, such as point connectivities. Computational details of the thinning algorithm and the required data structures for efficient implementation are explained and its complexity is discussed. Two examples are presented for illustration. This paper is dedicated to Arieh Iserles on the occasion of his 60th anniversary.     

圆形地下连续墙场地地震反应的简化计算方法

首先将水平地震荷载作用沿环向展开为傅立叶级数,利用沿圆周法向和切向两个方向的正交性,再将水平地震荷载转化为一致横向荷载组合,使三维求解问题转变为一系列旋转子午面上二维问题的叠加,进而提出圆形地下连续墙场地地震反应的简化计算方法。之后,采用等效线性化方法来考虑土体非线性性质,进一步将非线性地震反应问题转化为线性问题求解。...     

Two tractable subclasses of minimal unsatisfiable formulas

The minimal unsatisfiability problem is considered of the prepositional formulas in CNF which in the case of variablesx ₁,⋯,x _n consist ofn +k clauses including it,x ₁ V ⋯ Vx _n and ⌉x ₁ V ⋯ V ⌉x _n It is shown that whenk ⩽4 the minimal unsatisfiability problem can be solved in polynomial time. Project supported by the National Natural Science Foundation of China (Grant No. 19771045) and Nationl High-Tech R&D Project (863) (Grant No. 863-306-ET06-01-2).     

基于工业CT图像重构的网格模型的保特征简化方法

对基于工业CT图像重构的网格模型进行网格简化时,大多数现有网格模型简化算法会丢失特征,出现网格质量不好的问题。因此提出一种网格模型保特征简化方法,该方法用三角形折叠法对原始模型进行简化,当简化后模型的平均二面角角度误差达到允许误差后,再使用边折叠法对模型进行简化。在三角形折叠法中提出了利用被折叠三角形的法向量、各个顶点的高斯曲率及其在周边三角形上的投影确定该三角形的折叠点,利用局部体积误差与二面角角度误差的无因次化和确定折叠代价的方法;在边折叠法中提出了将二面角角度误差引入到二次误差测度(QEM)法的折叠代价中的改进QEM法。实验结果表明:与其他算法相比,该方法能够生成保特征、高质量、低几何误差的网格模型。     

基于层次简化的三维场景快速绘制方法

实时三维场景快速绘制是实现漫游和仿真的基础,提出了一种基于分层简化和碰撞检测的快速渲染算法．该算法先采用八叉树的分层简化三维场景模型,然后用包围盒实现视景的实时碰撞检测,最后采用基于场景剔除的图像缓存技术．从实验结果分析,此方法在效率和显示效果上是可行的．     

Robot learning schemes that trade motion accuracy for command simplification

This study was inspired by the human motor control system in its ability to accommodate a wide variety of motions. By contrast, the biologically inspired robot learning controller usually encounters huge learning space problems in many practical applications. A hypothesis for the superiority of the human motor control system is that it may have simplified the motion command at the expense of motion accuracy. This tradeoff provides an insight into how fast and simple control can be achieved when a robot task does not demand high accuracy. Two motion command simplification schemes are proposed in this paper based on the equilibrium-point hypothesis for human motion control. Investigation into the tradeoff between motion accuracy and command simplification reported in this paper was conducted using robot manipulators to generate signatures. Signature generation involves fast handwriting, and handwriting is a human skill acquired via practice. Because humans learn how to sign their names after they learn how to write, in the second learning process, they somehow learn to trade motion accuracy for motion speed and command simplicity, since signatures are simplified forms of original handwriting. Experiments are reported that demonstrate the effectiveness of the proposed schemes.