Coincidence Properties for Maps from the Torus to the Klein Bottle

The authors study the coincidence theory for pairs of maps from the Torus to the Klein bottle. Reidemeister classes and the Nielsen number are computed, and it is shown that any given pair of maps satisfies the Wecken property. The 1-parameter Wecken property is studied and a partial negative answer is derived. That is for all pairs of coincidence free maps a countable family of pairs of maps in the homotopy class is constructed such that no two members may be joined by a coincidence free homotopy.     

K-groups of Toeplitz algebras on connected domains

In the present paper, it is proved that the K0-group of a Toeplitz algebra on any connected domain is always isomorphic to the K0-group of the relative continuous function algebra. In addition, the cohomotopy groups of essential boundaries of some connected domains are computed, and the K0-groups of the continuous function algebras on these domains are also computed.     

ON THE CONSTRUCTION OF AUTHENTICATION CODES THAT PERMIT ARBITRATION OVER PROJECTIVE SPACES

A family of authentication codes with arbitration are constructed over projective spaces, the parameters and the probabilities of deceptions of the codes are also computed. In a special case, a perfect authentication code with arbitration is obtained.     

利用有限几何构作3-PBIB（2）设计和3-设计

The concept of t-PBIB design was introduced by Wei Wandi and Yang Benfu as a generalization of G-design and PBIB design. In this paper, a number of 3-associntion schemes and 3-PBIB(2) designs are constructed on the bases of the finite vector space over Fq and the finite unitary geometry over Fq2. Then a number of 3-designs are constructed on the bases of the finite orthogonal geometries over Fq. The parameters of all these designs are computed.     

Invariant Metrics and Laplacians on Siegel-Jacobi Disk

Let Dn be the generalized unit disk of degree n. In this paper, Riemannian metrics on the Siegel-Jacobi disk Dn × C（^m,n） which are invariant under the natural action of the Jacobi group are found explicitly and the Laplacians of these invariant metrics are computed explicitly. These are expressed in terms of the trace form.     

Some uniform convergence results for kernel estimators

This paper derives some uniform convergence rates for kernel regression of some index functions that may depend on infinite dimensional parameter. The rates of convergence are computed for independent, strongly mixing and weakly dependent data respectively. These results extend the existing literature and are useful for the derivation of large sample properties of the estimators in some semiparametric and nonparametric models.     

利用GAP研究一般线性群的抛物子群

A typical example for the algebraic groups is the general linear groups G = GL(n,F), we have studied the structure of such groups and paid special attention to its important substructures, namely the Parabolic subgroups.For a given G we computed all the Parabolic subgroups and determined their number, depending on the fact that any finite group has a composition series and the composition factors of a composition series are simple groups which are completely classified, we report here some investigations on the computed Parabolic subgroups. This has been done with the utility of GAP.     

利用有限域上一类幂零阵的标准形构造Cartesian认证码

Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS, of a successful im-personation attack and of a successful substitution attack respectively, of these codes are also computed.     

利用有限域上的向量空间构作带仲裁的认证码

This paper is devoted to constructing an authentication code with arbitration using subspaces of vector spaces over finite fields.Moreover,if we choose the encoding rules of the transmitter and the decoding rules of the receiver according to a uniform probability distribution,then some parameters and the probabilities of successful attacks are computed.     

Toeplitz operators on H~2(iR)

In this paper,the essential spectra of Toeplitz operators is discussed,and the K-theory of the Toeplitz algebra generated by {Tφ|φ∈C(iR)} is computed.In addition,the characteristic equation of Toeplitz operators is obtained and the algebraic properties of Toeplitz operators are discussed.     

Computation of equivalent inherent rounding errors in the solution of a set of linear equations

Equivalent inherent rounding errors (E.I.R.E.) are defined as perturbations on the given data, such that the computed solution is the exact solution of the problem with perturbed data. Almost minimal E.I.R.E. are computed for solutions of consistent sets of linear equations (with one or more right hand sides). Non consistent sets are also treated, but their computed E.I.R.E. cannot be proven almost minimal in all cases.     

利用有限域上酉几何构作带仲裁的认证码

利用有限域上酉几何构作一类新的带仲裁的认证码,并且计算了所构作认证码的参数以及各种攻击成功的概率.     

某型工程车系统可靠性分析

本应用失效树分析法,以某型工程车进行了可靠性分析,建立了该系统的失效树,在此基础上用最小割集法和系统失效树的可靠性仿真法计算了该系统的可靠性参数,并对一些结果进行了比较。     

利用有限域上奇异伪辛几何构作具有仲裁的认证码

利用有限域上奇异伪辛几何构作了一个新的具有仲裁的认证码,计算了这个码的参数,当发方编码规则和收方解码规则按等概率分布选取时,计算出各种攻击成功的概率.     

利用辛对合矩阵构造Cartesian认证码

利用辛对合矩阵构作了一个C artesian认证码,并且计算了其参数.假设编码规则是按均匀概率分布选取时,计算了模仿攻击成功的概率PI和替换攻击成功的概率PS.     

Solution of a kinetic equation for diatomic gas with the use of differential scattering cross sections computed by the method of classical trajectories

A collision integral is constructed taking into account the rotational degrees of freedom of the gas molecules. Its truncation error is shown to be second order in the rotational velocity mesh size. In the solution of the kinetic equation, the resulting collision integral is directly computed using a projection method. Preliminarily, the differential scattering cross sections of nitrogen molecules are computed by applying the method of classical trajectories. The resulting cross section values are tabulated in multimillion data arrays. The one-dimensional problems of shock wave structure and heat transfer between two plates are computed as tests, and the results are compared with experimental data. The convergence of the results with decreasing rotational velocity mesh size is analyzed.     

Construction of Cartesian Authentication Codes from Pseudo Symplectic Geometry of Even Dimension

§１．ＩｎｔｒｏｄｕｃｔｉｏｎＬｅｔＳ,ＥａｎｄＭｂｅｔｈｒｅｅｎｏｎ－ｅｍｐｔｙｆｉｎｉｔｅｓｅｔｓａｎｄｌｅｔｆ：Ｓ×Ｅ→Ｍｂｅａｍａｐ．Ｔｈｅｆｏｕｒｔｕｐｌｅ（Ｓ,Ｅ,Ｍ;ｆ）ｉｓｃａｌｅｄａｎａｕｔｈｅｎｔｉｃａｔｉｏｎｃｏｄｅ（ｓｅｅ［１...     

Discrete ill-posed least-squares problems with a solution norm constraint

Straightforward solution of discrete ill-posed least-squares problems with error-contaminated data does not, in general, give meaningful results, because propagated error destroys the computed solution. Error propagation can be reduced by imposing constraints on the computed solution. A commonly used constraint is the discrepancy principle, which bounds the norm of the computed solution when applied in conjunction with Tikhonov regularization. Another approach, which recently has received considerable attention, is to explicitly impose a constraint on the norm of the computed solution. For instance, the computed solution may be required to have the same Euclidean norm as the unknown solution of the error-free least-squares problem. We compare these approaches and discuss numerical methods for their implementation, among them a new implementation of the Arnoldi–Tikhonov method. Also solution methods which use both the discrepancy principle and a solution norm constraint are considered.     

利用有限域上反对称矩阵的标准型构作卡氏认证码

利用有限域上反对称矩阵的标准型构作了一个迪卡尔认证码并计算出该码的所有参数. 进而,假定编码规则按照统一的概率分布所选取,该码的成功伪造与成功替换的最大概率PI与PS亦被计算出来.     

利用奇、偶特征的正交几何构作的最优Cartesian认证码

利用奇、偶特征有限域上的正交几何构作出一类C artesian认证码,并且计算了它们的参数.并在假定按照等概率分布来选择编码规则下,求出了认证码的成功的模仿攻击概率和成功的替换攻击概率.作为一个推论,还得到了一些最优的C artesian认证码.