Undetected error probability of q-ary constant weight codes

In this paper, we introduce a new combinatorial invariant called q-binomial moment for q-ary constant weight codes. We derive a lower bound on the q-binomial moments and introduce a new combinatorial structure called generalized (s, t)-designs which could achieve the lower bounds. Moreover, we employ the q-binomial moments to study the undetected error probability of q-ary constant weight codes. A lower bound on the undetected error probability for q-ary constant weight codes is obtained. This lower bound extends and unifies the related results of Abdel-Ghaffar for q-ary codes and Xia-Fu-Ling for binary constant weight codes. Finally, some q-ary constant weight codes which achieve the lower bounds are found.      

An integer linear programming approach for approximate string comparison

We introduce a problem called maximum common characters in blocks (MCCB), which arises in applications of approximate string comparison, particularly in the unification of possibly erroneous textual data coming from different sources. We show that this problem is NP-complete, but can nevertheless be solved satisfactorily using integer linear programming for instances of practical interest. Two integer linear formulations are proposed and compared in terms of their linear relaxations. We also compare the results of the approximate matching with other known measures such as the Levenshtein (edit) distance.     

On the steady motions of a flat domain wall in a ferromagnet

A new derivation is presented of Walker's exact solution to Gilbert equation, a solution which mimicks the travelling-wave motion of a flat domain wall at 180^°. It is shown that a process during which the working of the applied magnetic field exactly compensates dissipation (the Walker condition) exists both under the constitutive circumstances considered in the standard Gilbert equation and when either the internal free-energy or the dissipation, or both, are generalized by the introduction of higher-gradient terms; but that such a process cannot solve the generalized Gilbert equation. It is also shown that, when dry-friction dissipation is considered and a suitable magnetic field is applied, the associated Gilbert equation has a Walker-type solution mimicking a flat wall, at 90^° this time, which however does not satisfy the Walker condition. Received 16 November 2001     

非线性Jaynes-Cummings模型中的薛定谔猫态

本文采用密度算符间的距离论证了非线性(强度相关)Jaynes-Cummings模型在初始相干光场很强的条件下光场周期地演化为薛定谔猫态,且薛定谔猫态的特性取决于原子的初态。     

Domain pattern in ferroelectric triglycine sulphate using pyroelectric effect

A method to study domain structure in ferroelectrics, using pyroelectric effect is described. Variation of pyroelectric signal from the surface of a triglycine sulphate crystal plate has been studied by scanning the surface of the crystal with a low wattage He-Ne laser beam. The integrated pyroelectric signal is due to two components, namely, (1) the primary component arising out of the change in spontaneous polarization with temperature and (2) the delayed component arising out of the possible polarization reversal. The component of an electric field along the ferroelectric axis due to thermal hemisphere within the crystal plate formed by the laser beam has been calculated and shown to exceed coercive field, making polarization reversal possible. The delayed pyroelectric signal is a measure of polarization reversal within the patch illuminated and its observed variation over the surface yields information of the domain structure.     

The median procedure in cluster analysis and social choice theory

Classical approachs for fitting and aggregation problems, specially in cluster analysis, social choice theory and paired comparisons methods, consist in the minimization of a remoteness function between relational data and a relational model. The notion of median, with its algebraic, metric, geometrical and statistical aspects, allow a unified treatment of many of base problems. Properties of median procedures are organized according to four directions: stabilities and axiomatic characterizations; Arrow-like properties; combinatorial properties; effective computational possibilities. Finally, interesting mathematical problems, related to the notion of median are surveyed.     

THE CONVERGENCE OF A DOMAIN DECOMPOSITION ALGORITHM FOR PARABOLIC PROBLEMS

At recent, Hourgat et gave a domain decomposition algorithm for elliptic problems which can be implemented in parallel. Many numerical experiments have illustrated its efficiency. In the present paper, we apply this algorithm to solve the discrete parabolic problems, analyse its convergence and show that its convergence rale is about (1 - 2p + σp2 ) which is nearly optimal and independent of the parameter τ, where σ τ O((1 +H )(1 + ln(H / h))2 ). 0 < p < 1 / σ,τ,h,H are the time step size, finite element parameter and subdomain diameter, respectively.     

Extremal stochastic integrals: a parallel between max-stable processes and α-stable processes

We construct extremal stochastic integrals of a deterministic function with respect to a random Fréchet () sup-measure. The measure is sup-additive rather than additive and is defined over a general measure space , where is a deterministic control measure. The extremal integral is constructed in a way similar to the usual stable integral, but with the maxima replacing the operation of summation. It is well-defined for arbitrary , and the metric metrizes the convergence in probability of the resulting integrals.This approach complements the well-known de Haan's spectral representation of max-stable processes with Fréchet marginals. De Haan's representation can be viewed as the max-stable analog of the LePage series representation of stable processes, whereas the extremal integrals correspond to the usual stable stochastic integrals. We prove that essentially any strictly stable process belongs to the domain of max-stable attraction of an Fréchet, max-stable process. Moreover, we express the corresponding Fréchet processes in terms of extremal stochastic integrals, involving the kernel function of the stable process. The close correspondence between the max-stable and stable frameworks yields new examples of max-stable processes with non-trivial dependence structures.This research was partially supported by a fellowship of the Horace H. Rackham School of Graduate Studies at the University of Michigan and the NSF Grant DMS-0505747 at Boston University.     

Analysis of the magnetic bubble collapse method

In the bubble collapse technique the domain wall mobility is evaluated by measuring the shortest time for which a magnetic bubble collapses. The way in which this evaluation should be carried out is discussed.