On the Minimum Weight of Codes over F5 Constructed from Certain Conference Matrices

In this paper, codes over F₅ with parameters [36, 18, 12], [48, 24, 15], [60, 30, 18], [64, 32, 18] and [76, 38, 21] which improve the previously known bounds on the minimum weight for linear codes over F₅ are constructed from conference matrices. Through shortening and truncating, the above codes give numerous new codes over F₅ which improve the previously known bounds on minimum weights.     

Undominated d.c. Decompositions of Quadratic Functions and Applications to Branch-and-Bound Approaches

In this paper we analyze difference-of-convex (d.c.) decompositions for indefinite quadratic functions. Given a quadratic function, there are many possible ways to decompose it as a difference of two convex quadratic functions. Some decompositions are dominated, in the sense that other decompositions exist with a lower curvature. Obviously, undominated decompositions are of particular interest. We provide three different characterizations of such decompositions, and show that there is an infinity of undominated decompositions for indefinite quadratic functions. Moreover, two different procedures will be suggested to find an undominated decomposition starting from a generic one. Finally, we address applications where undominated d.c.d.s may be helpful: in particular, we show how to improve bounds in branch-and-bound procedures for quadratic optimization problems.     

Characteristic Elements of Unimodular -lattices

Characteristic elements have been useful in the classification of unimodular lattices over the integers. This article gives an explicit formula for characteristic elements of a lattice in terms of a basis for the lattice and the dual of that basis.     

F.H.Jackson超几何级数公式_8φ_7的推广

将 C.Krattenthaler的矩阵反演恰当地用于初文昌的恒等式得到了 F.H.Jackson的超几何级数公式 87的推广 .     

AHP中专家判断信息的提取及一致性调整的方法

本探讨了层次分析法中专家判断信息的提取以及判断矩阵一致性调整的一种方法，其主要思想是通过提取专家判断矩阵中具有相关逻辑关系的信息进行比较，从而推断出专家自身较为集中的判断结果，并在此基础上对专家判断矩阵进行一致性调整。该方法既能够对不满足一致性要求的专家判断矩阵进行调整，又保证了调整后的专家矩阵所包含的是专家主要的判断信息。最后以一个算例说明方法的实施过程。     

Fermionic construction of the partition function for multimatrix models and the multicomponent Toda lattice hierarchy

We use p-component fermions, p = 2, 3,..., to represent (2p−2)N-fold integrals as a fermionic vacuum expectation. This yields a fermionic representation for various (2p−2)-matrix models. We discuss links with the p-component Kadomtsev-Petviashvili hierarchy and also with the p-component Toda lattice hierarchy. We show that the set of all but two flows of the p-component Toda lattice hierarchy changes standard matrix models to new ones. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 152, No. 2, pp. 265–277, August, 2007.     

Stability of cylindrical shells made of a particulate composite with nonlinear elastic matrix and damaged inclusions

The bifurcation instability problem for cylindrical shells made of particulate composites with nonlinear elastic matrix and damaged inclusions is formulated and solved __________ Translated from Prikladnaya Mekhanika, Vol. 43, No. 8, pp. 80–91, August 2007.     

Means of unitaries, conjugations, and the Friedrichs operator

If C is a conjugation (an isometric, conjugate-linear involution) on a separable complex Hilbert space H, then T∈B(H) is called C-symmetric if T=CT^∗C. In this note we prove that each C-symmetric contraction T is the mean of two C-symmetric unitary operators. We discuss several corollaries and an application to the Friedrichs operator of a planar domain.     

关于k-广义酉矩阵

本文研究了k-广义酉矩阵的性质及其与酉矩阵、辛矩阵、Householder矩阵之间的联系,取得了许多新的结果,推广了酉矩阵及Householder矩阵的相应结果,特别将正交矩阵的广义Cayley分解推广到了广义酉矩阵上;并将各类酉矩阵及辛矩阵统一了起来.     

Failed disk recovery in double erasure RAID arrays

Reliability is a major concern in the design of large disk arrays. In this paper, we examine the effect of encountering more failures than that for which the RAID array was initially designed. Erasure codes are incorporated to enable system recovery from a specified number of disk erasures, and strive beyond that threshold to recover the system as frequently, and as thoroughly, as is possible. Erasure codes for tolerating two disk failures are examined. For these double erasure codes, we establish a correspondence between system operation and acyclicity of its graph model. For the most compact double erasure code, the full 2-code, this underlies an efficient algorithm for the computation of system operation probability (all disks operating or recoverable).When the system has failed, some disks are nonetheless recoverable. We extend the graph model to determine the probability that d disks have failed, a of which are recoverable by solving one linear equation, b of which are further recoverable by solving systems of linear equations, and d−a−b of which cannot be recovered. These statistics are efficiently calculated for the full 2-code by developing a three variable ordinary generating function whose coefficients give the specified values. Finally, examples are given to illustrate the probability that an individual disk can be recovered, even when the system is in a failed state.