Two problems in the 筭數書 Suanshu shu (Book of Mathematics): Geometric relations between circles and squares and methods for determining their mutual relations

Much research has been devoted to two problems, Yi yuancai fang (From a circular timber [find] a square) and Yi fangcai yuan (From a square timber [find] a circle), both of which appear in the Suanshu shu, an early Han dynasty mathematical work written on bamboo slips, excavated from tomb 247 at Zhangjiashan in Hubei Province, China. In this article, the geometric relations between circles and squares and the methods for determining their mutual relations in these two problems are interpreted in a different way, and an alternative approach is offered for reconciling these two problems.     

一种显示器投影成象系统的彩色图象几何畸变校正方法

显示器投影成象系统是解决数字图象输出的一种设备,它可将显示器荧屏上的图象(可来自数码相机、光盘、计算机等)扩印在普通彩色相纸上.由于光学镜头会产生几何畸变,加之显示器表面有一定弧度,因此成象在相纸上的图象存在着非线性的畸变.本文主要介绍了如何用数字图象处理的方法对显示器投影成象系统的图象进行几何畸变校正,并对其软件实现进行了简单的讨论.     

Covering and radius-covering arrays: Constructions and classification

The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering arrays (equivalently, surjective codes with a radius) has been determined precisely only in special cases. In this paper, explicit constructions for numerous best known covering arrays (upper bounds) are found by a combination of combinatorial and computational methods. For radius-covering arrays, explicit constructions from covering codes are developed. Lower bounds are improved upon using connections to orthogonal arrays, partition matrices, and covering codes, and in specific cases by computation. Consequently for some parameter sets the minimum size of a covering array is determined precisely. For some of these, a complete classification of all inequivalent covering arrays is determined, again using computational techniques. Existence tables for up to 10 columns, up to 8 symbols, and all possible strengths are presented to report the best current lower and upper bounds, and classifications of inequivalent arrays.     

Augmented truncation approximations of discrete-time Markov chains

Let P be a positive recurrent infinite transition matrix with invariant distribution π and be a truncated and arbitrarily augmented stochastic matrix with invariant distribution _(n)π. We investigate the convergence ‖_(n)π−π‖→0, as n→∞, and derive a widely applicable sufficient criterion. Moreover, computable bounds on the error ‖_(n)π−π‖ are obtained for polynomially and geometrically ergodic chains. The bounds become rather explicit when the chains are stochastically monotone.     

Geometric phase as a simple closed-form integral

For a general evolution of a quantal system, the geometric phase measured with reference to a given initial state is derived as an integral of a function of the pure state density operator by invoking the Pancharatnam connection continuously.     

The complementary unboundedness of dual feasible solution sets in convex programming

F.E. Clark has shown that if at least one of the feasible solution sets for a pair of dual linear programming problems is nonempty then at least one of them is both nonempty and unbounded. Subsequently, M. Avriel and A.C. Williams have obtained the same result in the more general context of (prototype posynomial) geometric programming. In this paper we show that the same result is actually false in the even more general context of convex programming — unless a certain regularity condition is satisfied.We also show that the regularity condition is so weak that it is automatically satisfied in linear programming (prototype posynomial) geometric programming, quadratic programming (with either linear or quadratic constraints),l _p -regression analysis, optimal location, roadway network analysis, and chemical equilibrium analysis. Moreover, we develop an equivalent regularity condition for each of the usual formulations of duality.Research sponsored by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR-73-2516.     

Triaxial superdeformation in Lu

High-spin states in ¹⁶³Lu have been investigated using the Euroball spectrometer array. The previously known superdeformed band has been extended at low and high energies, and its connection to the normal-deformed states has been established. From its decay the mixing amplitude and interaction strength between superdeformed and normal states are derived. In addition, a new band with a similar dynamic moment of inertia has been found. The experimental results are compared to cranking calculations which suggest that the superdeformed bands in this mass region correspond to shapes with a pronounced triaxiality (γ≈±20°).