Korner [7] defined the notion of graph-entropy. He used it in [8] to simplify the proof of the Fredman-Komlos lower bound for the family size of perfect hash functions. We use this information theoretic notion to obtain a general method for formula size lower bounds. This method can be applied to low-complexity functions for which the other known general methods ([11, 12, 3] and see also [17] )...

Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating order preserving minimal perfect hash functions. We show that almost all members of the family construct space and time optimal order preserving minimal perfect hash functions, and we identify the on...

in this work, we investigate the transfer of some homological properties from a ring $r$ to its amalgamated duplication along some ideal $i$ of $r$ $rbowtie i$, and then generate new and original families of rings with these properties.

let $p$ be a prime number and $n$ be a positive integer. the graph $g_p(n)$ is a graph with vertex set $[n]={1,2,ldots ,n}$, in which there is an arc from $u$ to $v$ if and only if $uneq v$ and $pnmid u+v$. in this paper it is shown that $g_p(n)$ is a perfect graph. in addition, an explicit formula for the chromatic number of such graph is given.

A popular technique to implement software product-lines is through object-oriented application frameworks. A major problem with application frameworks is the unstructured, cross-cutting character of their specialization interfaces, and the weak connections between the specialization goals of the application developer and the different parts of the specialization interface. In this position pape...

It has often been argued that evolutionary diversification is the result of divergent natural selection for specialization on alternative resources. I provide a comprehensive review of experiments that examine the ecology and genetics of resource specialization and adaptive radiation in microbial microcosms. In these experiments, resource heterogeneity generates divergent selection for speciali...

In 1960 Berge came up with the concept of perfect graphs, and in doing so, conjectured some characteristics about them. A perfect graph is a graph in which the chromatic number of every induced subgraph equals the size of the largest clique of that subgraph [2]. Two conjectures are now known as the Perfect Graph Theorem and the Strong Perfect Graph Theorem. Both of these theorems make deteminin...

Specialization is a technique that has the potential to provide operating system clients with the performance and functionality that they need, while still retaining the advantages of a simple generic code base for the operating system maintainer. However, at present the specialization process is labor-intensive and requires the knowledge of an expert in the domain of application behavior. In o...