Implicit Difference Schemes for the Generalized Non-Linear Schrödinger System

In this paper we prove under certain weak conditions that two classes of implicit difference schemes for the generalized non-linear schrödinger system are convergent and that an iteration method for the corresponding non-linear difference equation is convergent. Therefore, quite a complete theoretical foundation of implicit schemes for the generalized non-linear Schrödinger system is established in this paper.     

A Family of Partial Geometric Designs from Three‐Class Association Schemes

In this paper, we show that partial geometric designs can be constructed from certain three‐class association schemes and ternary linear codes with dual distance three. In particular, we obtain a family of partial geometric designs from the three‐class association schemes introduced by Kageyama, Saha, and Das in their article [“Reduction of the number of associate classes of hypercubic association schemes,” Ann Inst Statist Math 30 (1978)]. We also give a list of directed strongly regular graphs arising from the partial geometric designs obtained in this paper.     

High-order methods for elliptic equations with variable coefficients

In this article, we give a simple method for developing finite difference schemes on a uniform square gird. We consider a general, two-dimensional, second-order, partial differential equation with variable coefficients. In the case of a nine-point scheme, we obtain the known results of Young and Dauwalder in a fairly elegant fashion. We show how this can be extended to obtain fourth-order schemes on thirteen points. We derive two such schemes which are attractive because they can be adapted quite easily bnto obtain formulas for gird points near the boundary. In addition to this, these formulas only require nine evaluations for the typical forcing function. Numerical examples are given to demonstrate the performance of one of the fourth-order schemes.     

Optimal (2, n) visual cryptographic schemes

In (2,n) visual cryptographic schemes, a secret image(text or picture) is encrypted into n shares, which are distributed among n participants. The image cannot be decoded from any single share but any two participants can together decode it visually, without using any complex decoding mechanism. In this paper, we introduce three meaningful optimality criteria for evaluating different schemes and show that some classes of combinatorial designs, such as BIB designs, PBIB designs and regular graph designs, can yield a large number of black and white (2,n) schemes that are optimal with respect to all these criteria. For a practically useful range of n, we also obtain optimal schemes with the smallest possible pixel expansion.     

Complex Spherical Designs and Codes

Real spherical designs and real and complex projective designs have been shown by Delsarte, Goethals, and Seidel to give rise to association schemes when the strength of the design is high compared to its degree as a code. In contrast, designs on the complex unit sphere remain relatively uninvestigated, despite their importance in numerous applications. In this paper, we develop the notion of a complex spherical design and show how many such designs carry the structure of an association scheme. In contrast with the real spherical designs and the real and complex projective designs, these association schemes are nonsymmetric.     

ID-based cryptography using symmetric primitives

A general method for deriving an identity-based public key cryptosystem from a one-way function is described. We construct both ID-based signature schemes and ID-based encryption schemes. We use a general technique which is applied to multi-signature versions of the one-time signature scheme of Lamport and to a public key encryption scheme based on a symmetric block cipher which we present. We make use of one-way functions and block designs with properties related to cover-free families to optimise the efficiency of our schemes.      

Incentive based energy market design

Current energy market designs and pricing schemes fail to give investors the appropriate market signals. In particular, energy prices are not high enough to attract investors to build new or maintain existing power capacity. In this paper we propose a method to compute second-best Pareto optimal equilibrium prices for any market exhibiting non-convexities and, based on this result, an energy market design able to restore the correct energy price signals for supply investors.     

Partial-match retrieval for dynamic files

This paper studies file designs for answering partial-match queries for dynamic files. A partial-match query is a specification of the value of zero or more fields in a record. An answer to a query consists of a listing of all records in the file satisfying the values specified.The main contribution is a general method whereby certain primary key hasing schemes can be extended to partial-match retrieval schemes. These partial-match retrieval designs can handle arbitrarily dynamic files and can be optimized with respect to the number of page faults required to answer a query.We illustrate the method by considering in detail the extension of two recent dynamic primary key hashing schemes.     

Construction of Optimal Blocking Schemes for Robust Parameter Designs

Robust parameter design (RPD) is an important issue in experimental designs. If all experimental runs cannot be performed under homogeneous conditions, blocking the units is effective. In this paper, we obtain the correspondence relation between fractional factorial RPDs and the blocking schemes for full factorial RPDs. In addition, we provide a construction of optimal blocking schemes that make all main effects and control-by-noise two-factor interactions estimable.     

Local Gaussian Process Approximation for Large Computer Experiments

We provide a new approach to approximate emulation of large computer experiments. By focusing expressly on desirable properties of the predictive equations, we derive a family of local sequential design schemes that dynamically define the support of a Gaussian process predictor based on a local subset of the data. We further derive expressions for fast sequential updating of all needed quantities as the local designs are built up iteratively. Then we show how independent application of our local design strategy across the elements of a vast predictive grid facilitates a trivially parallel implementation. The end result is a global predictor able to take advantage of modern multicore architectures, providing a nonstationary modeling feature as a bonus. We demonstrate our method on two examples using designs with thousands of data points, and compare to the method of compactly supported covariances. Supplementary materials for this article are available online.     

Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes

Commitment schemes have been extensively studied since they were introduced by Blum in 1982. Rivest recently showed how to construct unconditionally secure non-interactive commitment schemes, assuming the existence of a trusted initializer. In this paper, we present a formal mathematical model for unconditionally secure non-interactive commitment schemes with a trusted initializer and analyze their binding and concealing properties. In particular, we show that such schemes cannot be perfectly binding: there is necessarily a small probability that Alice can cheat Bob by committing to one value but later revealing a different value. We prove several bounds on Alice's cheating probability, and present constructions of schemes that achieve optimal cheating probabilities. We also analyze a class of commitment schemes based on resolvable designs.     

An analogue oft-Designs in the association schemes of alternating bilinear forms

The notion of designs in an association scheme is defined algebraically by Delsarte [4]. It is known that his definition of designs has a geometric interpretation for known (P andQ)-polynomial association schemes except three examples. In this paper we give a geometric interpretation of designs in an association scheme of alternating bilinear forms, which is one of the three.     

Abelian and non-abelian Paley type group schemes

In this paper, we present a construction of abelian Paley type group schemes which are inequivalent to Paley group schemes. We then determine the equivalence amongst their configurations, the Hadamard designs or the Paley type strongly regular graphs obtained from these group schemes, up to isomorphism. We also give constructions of several families of non-abelian Paley type group schemes using strong multiplier groups of the abelian Paley type group schemes, and present the first family of p-groups of non-square order and of non-prime exponent that contain Paley type group schemes for all odd primes p.     

On discontinuous Galerkin method and semiregular family of triangulations

Discretization of second order elliptic partial differential equations by discontinuous Galerkin method often results in numerical schemes with penalties. In this paper we analyze these penalized schemes in the context of quite general triangular meshes satisfying only a semiregularity assumption. A new (modified) penalty term is presented and theoretical properties are proven together with illustrative numerical results. This work is a part of the research project MSM 0021620839 financed by MSMT and was partly supported by the project No. 201/04/1503 of the Grant Agency of the Czech Republic.     

A generalization of the Erdős–Ko–Rado theorem to t-designs in certain semilattices

The Erd?s–Ko–Rado theorem is extended to designs in semilattices with certain conditions. As an application, we show the intersection theorems for the Hamming schemes, the Johnson schemes, bilinear forms schemes, Grassmann schemes, signed sets, partial permutations and restricted signed sets.     

On the Dealer's Randomness Required in Secret Sharing Schemes

In this paper we provide upper and lower bounds on the randomness required by the dealer to set up a secret sharing scheme for infinite classes of access structures. Lower bounds are obtained using entropy arguments. Upper bounds derive from a decomposition construction based on combinatorial designs (in particular, t-(v,k,) designs). We prove a general result on the randomness needed to construct a scheme for the cycle Cn; when n is odd our bound is tight. We study the access structures on at most four participants and the connected graphs on five vertices, obtaining exact values for the randomness for all them. Also, we analyze the number of random bits required to construct anonymous threshold schemes, giving upper bounds. (Informally, anonymous threshold schemes are schemes in which the secret can be reconstructed without knowledge of which participants hold which shares.)     

On the incomplete block designs derivable from the association schemes

Blackwelder (1969) has given two methods of constructing balanced incomplete block (BIB) designs from the association matrices of association schemes with two and three associate classes. In this note these two methods are incorporated in a general method, and the existence of a series of BIB designs is shown by the generalized method. In addition, a remark about partially balanced incomplete block (PBIB) designs with respect to the method is made.     

Connection Among Some Optimal Criteria for Symmetrical Fractional Factorial Designs

A fundamental and practical question for fractional factorial designs is the issue of optimal factor assignment. Recently, some new criteria, such as generalized minimum aberration, WV-criterion, NB-criterion and uniformity criterion are proposed for comparing and selecting fractions. In this paper, we indicate that these criteria agree quite well for symmetrical fraction factorial designs.     

Numerical comparison of methods for solving linear differential equations of fractional order

In this article, we implement relatively new analytical techniques, the variational iteration method and the Adomian decomposition method, for solving linear differential equations of fractional order. The two methods in applied mathematics can be used as alternative methods for obtaining analytic and approximate solutions for different types of fractional differential equations. In these schemes, the solution takes the form of a convergent series with easily computable components. This paper will present a numerical comparison between the two methods and a conventional method such as the fractional difference method for solving linear differential equations of fractional order. The numerical results demonstrates that the new methods are quite accurate and readily implemented.