Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels

In this paper we consider the (t, n)-threshold visual secret sharing scheme (VSSS) in which black pixels in a secret black-white images is reproduced perfectly as black pixels when we stack arbitrary t shares. This paper provides a new characterization of the (t, n)-threshold visual secret sharing scheme with such a property (hereafter, we call such a VSSS the (t, n)-PBVSSS for short). We use an algebraic method to characterize basis matrices of the (t, n)-PBVSSS in a certain class of matrices. We show that the set of all homogeneous polynomials each element of which yields basis matrices of the (t, n)-PBVSSS becomes a set of lattice points in an (n−t+1)-dimensional linear space. In addition, we prove that the optimal basis matrices in the sense of maximizing the relative difference among all the basis matrices in the class coincides with the basis matrices given by Blundo, Bonis and De Santis [3] for all n≥ t ≥ 2.     

Monotonicity criteria for difference schemes designed for hyperbolic equations

Previously formulated monotonicity criteria for explicit two-level difference schemes designed for hyperbolic equations (S.K. Godunov’s, A. Harten’s (TVD schemes), characteristic criteria) are extended to multileveled, including implicit, stencils. The characteristic monotonicity criterion is used to develop a universal algorithm for constructing high-order accurate nonlinear monotone schemes (for an arbitrary form of the desired solution) based on their analysis in the space of grid functions. Several new fourth-to-third-order accurate monotone difference schemes on a compact three-level stencil and nonexpanding (three-point) stencils are proposed for an extended system, which ensures their monotonicity for both the desired function and its derivatives. The difference schemes are tested using the characteristic monotonicity criterion and are extended to systems of hyperbolic equations.     

Constructions of External Difference Families and Disjoint Difference Families

External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. In this paper, some earlier ideas of recursive and cyclotomic constructions of combinatorial designs are extended, and a number of classes of EDFs and disjoint difference families are presented. A link between a subclass of EDFs and a special type of (almost) difference sets is set up.     

基于二次插值的非饱和土壤水流问题的特征差分方法及数值模拟

本文针对一类非饱和土壤水流问题,提出了基于二次插值的特征差分格式,得到了严谨的L2模误差估计.并作了数值试验,指明方法的有效性.     

New Plasmon Waveguides Composed of Twin Metal Wedges with a Nano Gap

We have numerically shown the existence of coupled wedge plasmons (CWPs) which propagates along a nano gap of a twin metal wedge. The CWPs are formed by wedge plasmons which can interact with each other. The dispersion relations of the wavenumber, propagation distance, and beam area of CWPs, are described and show that the characteristics of CWPs are similar to those of wedge plasmons and of gap plasmons. We also propose a new plasmon waveguide composed of twin metal wedges with a nano gap.     

High order generalized upwind schemes and numerical solution of singular perturbation problems

High even order generalizations of the traditional upwind method are introduced to solve second order ODE-BVPs without recasting the problem as a first order system. Both theoretical analysis and numerical comparison with central difference schemes of the same order show that these new methods may avoid typical oscillations and achieve high accuracy. Singular perturbation problems are taken into account to emphasize the main features of the proposed methods. AMS subject classification (2000)  65L10, 65L12, 65L50     

A New Family of Cyclic Difference Sets with Singer Parameters in Characteristic Three

We construct a new family of cyclic difference sets with parameters ((3 ^d – 1)/2, (3 ^{d – 1} – 1)/2, (3 ^{d – 2} – 1)/2) for each odd d. The difference sets are constructed with certain maps that form Jacobi sums. These new difference sets are similar to Maschietti's hyperoval difference sets, of the Segre type, in characteristic two. We conclude by calculating the 3-ranks of the new difference sets.     

Measurements of edge-uncolorability

Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let c_k be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r₃=|E|−c₃ and . We show that on one side r₃ and r₂ bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r₃ and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr₃. For k=2,3, let ζ_k denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other.     

基于移动Agent技术的医学图像检索方法

针对现有医学图像检索方法中，检索算法速度较慢、准确性较低以及远程检索时占用大量带宽等问题，设计并实现了一种基于移动Agent技术的医学图像检索方法，重点讨论了该方法实现的关键技术，包括提升框架下的M带整数小波变换和提取多通道纹理特征的检索算法．模拟实验结果表明，该方法实时性较强，占用网络带宽较少，采用的算法运算速度提高近10倍、运算复杂度降低约50％，提取的纹理特征能充分表达图像内容，较好地满足了医学图像的检索要求，实现了对医学图像库快速较准确的检索．     

Concerning seven and eight mutually orthogonal Latin squares

In this paper, three new direct Mutually Orthogonal Latin Squares (MOLS) constructions are presented for 7 MOLS(24), 7 MOLS(75) and 8 MOLS(36); then using recursive methods, several new constructions for 7 and 8 MOLS are obtained. These reduce the largest value for which 7 MOLS are unknown from 780 to 570, and the largest odd value for which 8 MOLS are unknown from 1935 to 419. © 2003 Wiley Periodicals, Inc.