The Existence of Partitioned Generalized Balanced Tournament Designs with Block Size 3

A generalized balanced tournament design, GBTD(n, k), defined on a kn-set V, is an arrangement of the blocks of a (kn, k, k – 1)-BIBD defined on V into an n × (kn – 1) array such that (1) every element of V is contained in precisely one cell of each column, and (2) every element of V is contained in at most k cells of each row. Suppose we can partition the columns of a GBTD(n, k) into k + 1 sets B1, B2,..., Bk + 1 where |Bi| = n for i = 1, 2,..., k – 2, |Bi| = n–1 for i = k – 1, k and |Bk+1| = 1 such that (1) every element of V occurs precisely once in each row and column of Bi for i = 1, 2,..., k – 2, and (2) every element of V occurs precisely once in each row and column of Bi Bk+1 for i = k – 1 and i = k. Then the GBTD(n, k) is called partitioned and we denote the design by PGBTD(n, k). The spectrum of GBTD(n, 3) has been completely determined. In this paper, we determine the spectrum of PGBTD(n,3) with, at present, a fairly small number of exceptions for n. This result is then used to establish the existence of a class of Kirkman squares in diagonal form.     

Theorems of the Alternative and Duality

This paper investigates the relations between theorems of the alternative and the minimum norm duality theorem. A typical theorem of the alternative is associated with two systems of linear inequalities and/or equalities, a primal system and a dual one, asserting that either the primal system has a solution, or the dual system has a solution, but never both. On the other hand, the minimum norm duality theorem says that the minimum distance from a given point z to a convex set is equal to the maximum of the distances from z to the hyperplanes separating z and . We consider the theorems of Farkas, Gale, Gordan, and Motzkin, as well as new theorems that characterize the optimality conditions of discrete l ₁-approximation problems and multifacility location problems. It is shown that, with proper choices of , each of these theorems can be recast as a pair of dual problems: a primal steepest descent problem that resembles the original primal system, and a dual least–norm problem that resembles the original dual system. The norm that defines the least-norm problem is the dual norm with respect to that which defines the steepest descent problem. Moreover, let y solve the least norm problem and let r denote the corresponding residual vector. If r=0, which means that z , then y solves the dual system. Otherwise, when r0 and z , any dual vector of r solves both the steepest descent problem and the primal system. In other words, let x solve the steepest descent problem; then, r and x are aligned. These results hold for any norm on . If the norm is smooth and strictly convex, then there are explicit rules for retrieving x from r and vice versa.     

Λ0-Nuclear Operators and Λ0-Nuclear Spaces in p-adic Analysis

For a Köthe sequence space, the classes of ₀-nuclear spaces and spaces with the ₀-property are introduced and studied and the relation between them is investigated. Also, we show that, for ₀c ₀, these classes of spaces are in general different from the corresponding ones for ₀=c ₀, which have been extensively studied in the non-archimedean literature (see, for example, [1]–[6]).     

Riemannian Manifolds in Which Certain Curvature Operator Has Constant Eigenvalues along Each Circle

Riemannian manifolds for which a natural curvature operator has constant eigenvalues on circles are studied. A local classification in dimensions two and three is given. In the 3-dimensional case one gets all locally symmetric spaces and all Riemannian manifolds with the constant principal Ricci curvatures r ₁ = r ₂ = 0, r ₃= 0 , which are not locally homogeneous, in general.     

企业科技行为系统的评价体系研究

现代企业科技行为属于高阶非线性系统行为，对其运行的评价应采用系统评价的思想和方法进行。本文确定了现代企业科技行为系统评价的基本准则，构建了评价的指标体系；提出了各指标值的归一化处理方法以及各指标权重的确定方法     

一类艾滋病传播的数学模型的定态非负解

利用分歧理论讨论带扩散问题艾滋病传播数学模型定态非负解及全局性质．     

变厚度圆柱型正交各向异性圆形薄板的非线性非对称弯曲问题

本文首先导出变厚度圆柱型正交各向异性圆形薄板的非线性非对称弯曲的基本方程，利用“两变量法”，引进四个小参数，对厚度线性变化的圆柱型正交各向异性圆形薄板的非线性非对称弯曲问题进行研究，得到了挠度函数W（r，θ）和应力函数F（r，θ）对ε1为N阶及对ε2为M阶的一致有效渐近解．     

Existence of periodic solutions

An apparatus for proving existence theorems for periodic solutions of equations with discontinuous right-hand side and differential inclusions is developed. Translated fromMatematischeskie Zametki, Vol. 61, No. 5, pp. 769–784, May, 1997. Translated by V. N. Dubrovsky     

On the Solvability of the Multidimensional Version of the First Darboux Problem for a Model Second-Order Degenerating Hyperbolic Equation

A multidimensional version of the first Darboux problem is considered for a model second-order degenerating hyperbolic equation. Using the technique of functional spaces with a negative norm, the correct formulation of this problem in the Sobolev weighted space is proved.     

Parallel Algorithm for Unconstrained Optimization Based on Decomposition Techniques

We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1.