We present a simple primal-dual algorithm for computing approximate Nash equilibria in two-person zero-sum sequential games with incomplete information and perfect recall (like Texas Hold’em poker). Our algorithm only performs basic iterations (i.e matvec multiplications, clipping, etc., and no calls to external first-order oracles, no matrix inversions, etc.) and is applicable to a broad class...

We study the development of conjunctive keyword searchable scheme which enables one to search encrypted documents by using more than one keyword. The notion of conjunctive keyword searching was presented by Golle et al. in 2004. However, their security model was constructed in a symmetric-key setting which is not applicable for the overall applications in the reality. So Park et al. extended Go...

In this paper we present several proofs on the extension of M. Riesz fractional integration and di¤erentiation to the contexts of spaces of homogeneous type and measure metric spaces with non-doubling measures. 1. Introduction, some de…nitions, and a basic lemma Professor M. Ash asked me to write a survey article on some of the results that Stephen Vági and I obtained in the nineties on fractio...

In this paper we propose a simple and efficient strategy to obtain a data structure generator to accomplish a perfect hash of quite general order restricted multidimensional arrays named phormas. The constructor of such objects gets two parameters as input: an n-vector a of non negative integers and a boolean function B on the types of order restrictions on the coordinates of the valid n-vector...

We reconsider a previously published (Dalkilic et al.) algorithm for merging lists by way of the perfect shuffle permutation. The original publication gave only experimental results which, although consistent with linear execution time on the samples tested, provided no analysis. Here we prove that the time complexity, in the average case, is indeed linear, although there is a Θ(n) worst case. ...

Let H denote a finite simple hypergraph. The cover ideal of H, denoted by J = J(H), is the monomial ideal whose minimal generators correspond to the minimal vertex covers of H. We give an algebraic method for determining the chromatic number of H, proving that it is equivalent to a monomial ideal membership problem involving powers of J . Furthermore, we study the sets Ass(R/Js) by exploring th...

Demand for efficient software is increasing day by day and object-oriented design technique became able to fulfill this demand because it is the most powerful mechanism to develop efficient software systems. It can not only help in reducing the cost but also helps in the development of high quality software systems. Software developers need appropriate metrics to develop efficient software syst...

The aim of Object Oriented (OO) Metrics is to predict the quality of the object oriented software products. Various attributes, which determine the quality of the software, include maintainability, defect density, fault proneness, normalized rework, understandability, reusability etc. Heuristics plays an important role in software development and is widely used to provide a link between design ...

A new way of constructing (minimal) perfect hash functions is described. The technique considerably reduces the overhead associated with resolving buckets in two-level hashing schemes. Evaluating a hash function requires just one multiplication and a few additions apart from primitive bit operations. The number of accesses to memory is two, one of which is to a fixed location. This improves the...