Counting matrices over finite fields having a given number of rows of unit weight

We present a formula enumerating matrices over a finite field of a given rank and a given number of rows of unit weight, i.e., each having a single nonzero entry. We also determine the number of subspaces of a given dimension containing a given number of vectors of unit weight.     

Knight's paths towards Catalan numbers

We provide enumerating results for partial knight's paths of a given size. We prove algebraically that zigzag knight's paths of a given size ending on the x-axis are enumerated by the generalized Catalan numbers, and we give a constructive bijection with peakless Motzkin paths of a given length. After enumerating partial knight's paths of a given length, we prove that zigzag knight's paths of a given length ending on the x-axis are counted by the Catalan numbers. Finally, we give a constructive bijection with Dyck paths of a given length.     

最小多项式矩阵与线性多变量系统(Ⅰ)

本文分为两部分:(Ⅰ)为关于最小多项式矩阵的理论:(Ⅱ)为最小多项式矩阵理论在线性多变量系统中的应用.在(Ⅰ)中,我们给出了线性变换在向量组的消失多项式矩阵与最小多项式矩阵的概念,给出了不变子空间的生成组与最小生成组的概念.在讨论了这些概念的基本性质之后,我们研究了它们与线性变换在任何不变子空间上诱导算子对应的特征矩阵之间的关系,给出了向量组的最小多项式矩阵类的特征,并给出了有相同生成空间的生成组之间的充分必要条件.利用这些结果,对于给定的矩阵A,给出了能使系统x=Ax+Bu完全可控的矩阵B的全体的集合的表达式.     

The weak and strong Gaussian probabilistic realization problem

A classification is given of all σ-algebras that make two given σ-algebras conditionally independent in the case that the σ-algebras are generated by finite dimensional Gaussian random variables. In addition a classification is given of all Gaussian measures that have the conditional independence property and such that restricted to a subspace, they coincide with a given measure.     

Controlled selection a technique in random sampling

Summary The paper gives a method of constructing a random sampling design corresponding to a given population and a given sample sizen by means of which the probability of drawing a non-preferred combination of units can be reduced up to a certain level. Appropriate methods of analysing the data obtained from samples selected by this procedure are also given. A numerical example is given to illustrate the method developed in the paper.     

Boundary control in critical time by elastic forces applied at two ends of an inhomogeneous rod for the case in which the wave propagation time over each of the inhomogeneity parts is the same

We study boundary control in critical time by elastic forces at two ends of an inhomogeneous rod consisting of two parts of distinct densities and elasticities for the case in which the wave propagation time over each of these parts is the same. We present a closed-form expression for the boundary control by elastic forces bringing the originally quiescent stick into a given terminal state specified by a given terminal displacement and a given terminal velocity in a given critical time.     

A new proof of Frobenius theorem and applications

A proof of Frobenius theorem on local integrability of a given distribution on a finite or infinite dimensional manifold under weak differentiability conditions is given using holonomy methods and the curvature two form of the associated connection. The local curvature two form, which measures the non-integrability of a given distribution, is studied and a variety of applications are given. The Inverse Problem in the Calculus of Variations appears as a particular case.     

两个逆网络选址问题的计算复杂性

本文考虑两个我们称之为逆网络选址的改进问题,它们是修改网络上各个边的长度,分别使得网络上某个给定的顶点到网络上所有点的最大距离以及该点到其它顶点的距离之和不大于预先给定的上界,并且所做的修改总量最小.我们将证明这两个逆网络选址问题都是强NP困难的.     

Partitions of a Polytope and Mappings of a Point Set to Facets

Three theorems of this paper generalize previous results of the author on conjectures of A. Bezdek and V.V. Proizvolov. They show the existence of mappings from a given point set to the set of facets of a given polytope that satistfy some special conditions. Developing the same technique, some results on convex polytope partitions are presented, two of them dealing with partitions with prescribed measures of parts. Then we prove a corollary on the existence of a possibly nonconvex polytope with a given set of vertices, containing given points in its interior. We also consider problems of the following type: find an assignment of vectors from a given set to the parts of a given convex partition of ℝⁿ so that the shifts of the parts by their corresponding vectors either do not intersect by interior points or cover ℝⁿ     

微分方程零解的弱渐近稳定与不稳定的判定定理

给出了平凡解弱渐近稳定定义及在已知导函数 d Vdt负定的情况下 ,通过 V( t,x)函数的符号性质来判定微分方程平凡解的弱渐近稳定性与不稳定性 ,并举例说明定理的应用 .     

Compact differences of composition operators

A characterization of compact difference is given for composition operators acting on the standard weighted Bergman spaces and necessary conditions are given on a larger scale of weighted Dirichlet spaces. Conditions are given under which a composition operator can be written as a finite sum of composition operators modulo the compacts. The additive structure of the space of composition operators modulo the compact operators is investigated further and a sufficient condition is given to insure that two composition operators lie in the same component.     

Intervals of 1-Lipschitz aggregation operators, quasi-copulas, and copulas with given affine section

Best lower and upper bounds for 1-Lipschitz aggregation operators with a given affine section are given. These are used to determine best bounds for quasi-copulas and copulas with a given affine section. However, in general there is no greatest copula with a given non-decreasing affine section. These results are used to study (quasi-)copulas with arbitrary affine sections.     

Products of EP matrices

Necessary and sufficient conditions are given for a matrix to be a product of an EP_r matrix by an EP_s matrix. It is shown that a given square matrix is a product of more than two EP matrices of specified ranks (and hence nullities) if and only if its rank is less than or equal to the minimum of the given ranks and its nullity is less than or equal to the sum of the given nullities. It is also shown that given two EP matrices, the rank of their product is independent of the order of the factors.     

循环图圈空间的最小基

For most of circular graph the length of the minimum cycle basis is given.For the others a bound of the length of the minimum cycle basis is given and the given bound is reached.     

扩充偏微分方程(组)守恒律和对称的辅助方程方法及微分形式吴方法的应用

首先,我们给出了引入伴随方程(组)扩充原方程(组)的策略使给定偏微分方程(组)的扩充方程组具有对应泛瓯即,成为Lagrange系统的方法,以此为基础提出了作为偏微分方程(组)传统守恒律和对称概念的一种推广-偏微分方程(组)扩充守恒律和扩充对称的概念;其次,以得到的Lagrange系统为基础给定了确定原方程(组)扩充守恒律和扩充对称的方法,从而达到扩充给定偏微分方程(组)的首恒律和对称的目的;第三,提出了适用于一般形式微分方程(组)的计算固有守恒律的方法;第四,实现以上算法过程中,我们先把计算(扩充)守恒律和对称问题均归结为求解超定线性齐次偏微分方程组(确定方程组)的问题.然后,对此关键问题我们提出了用微分形式吴方法处理的有效算法;最后,作为方法的应用我们计算确定了非线性电报方程组在内的五个发展方程(组)的新守恒律和对称,同时也说明了方法的有效性.     

Comparing different metaheuristic approaches for the median path problem with bounded length

In this paper we consider the Bounded Length Median Path Problem which can be defined as the problem of locating a path-shaped facility that departures from a given origin and arrives at a given destination in a network. The length of the path is assumed to be bounded by a given maximum length. At each vertex of the network (customer-point) the demand for the service is given and the cost to reach the closest service-point is computed. The objective is to minimize the sum of these costs over all the customer-points in the network.     

三维医学模型表面积和体积计算方法研究

应用MATLAB语言描述了测量任意给定的颌、颧骨区域的表面积和体积的方法,并且在临床上用实例给出了计算结果.     

Efficient Pattern Matching on Graph Patterns of Bounded Treewidth

This paper deals with a problem to decide whether a given graph structure appears as a pattern in the structure of a given graph. A graph pattern is a connected graph with structured variables. A variable is an ordered list of vertices that can be replaced with a connected graph by a kind of hyperedge replacements. The graph pattern matching problem (GPMP) is the computational problem to decide whether a given graph pattern matches a given graph. In this paper, we show that GPMP is solvable in polynomial time if for a given graph pattern p, the lengths of all variables of p are 2 and the base graph of p is of bounded treewidth.     

Embeddings of curves

In this paper a numerical criterion for divisors on a smooth projective surface to be very ample is given. The idea is to restrict a given divisor to a sufficient number of (not necessarily, irreducible nor reduced) curfes on the surface and prove the very ampleness of the restriction. At the end we given an application to Bordiga surfaces.