A Cartesian grid method combined with a simplified gas kinetic scheme is presented for subsonic and supersonic viscous flow simulation on complex geometries. Under the Cartesian mesh, the computational grid points are classified into four different c
ategories, the fluid point, the solid point, the drop point, and the interpolation point. The boundaries are represented by a set of direction-oriented boundary points. A constrained weighted least square method is employed to evaluate the physical quantities at the interpolation points. Different boundary conditions, including isothermal boundary, adiabatic boundary, and Euler slip boundary, are presented by different interpolation strategies. We also propose a simplified gas kinetic scheme as the flux solver for both subsonic and supersonic flow computations. The methodology of constructing a simplified kinetic flux function can be extended to other flow systems. A few numerical examples are used to validate the Cartesian grid method and the simplified flux function. The reconstruction scheme for recovering the boundary conditions of compressible viscous and heat conducting flow with a Cartesian mesh can provide a smooth distribution of physical quantities at solid boundary, and present an accurate solution for the flow study with complex geometry.
How to construct an ideal multi-secret sharing scheme for general access structures is difficult. In this paper, we solve an open problem proposed by Spiez et al.recently [Finite Fields and Their Application, 2011(17) 329-342], namely to design an al
gorithm of privileged coalitions of any length if such coalitions exist. Furthermore, in terms of privileged coalitions, we show that most of the existing multi-secret sharing schemes based on Shamir threshold secret sharing are not perfect by analyzing Yang et al.s scheme and Pang et al.s scheme. Finally, based on the algorithm mentioned above, we devise an ideal multi-secret sharing scheme for families of access structures, which possesses more vivid authorized sets than that of the threshold scheme.
There are several methods for constructing secret sharing schemes, one of which is based on coding theory. Theoretically, every linear code can be used to construct secret sharing schemes. However, in general, determining the access structures of the
schemes based on linear codes is very hard. This paper proposed the concept of minimal linear code, which makes the determination of the access structures of the schemes based on the duals of minimal linear codes easier. It is proved that the shortening codes of minimal linear codes are also minimal ones. Then the conditions whether several types of irreducible cyclic codes are minimal linear codes are presented. Furthermore, the access structures of secret sharing schemes based on the duals of minimal linear codes are studied, and these access structures in specific examples are obtained through programming.
