We introduce a family of binary array codes of size t n, correcting multiple phased burst erasures of size t. The codes achieve maximal correcting capability, i.e. being considered as codes over GF (2 t ) they are MDS. The length of the codes is n = P L `=1 t ` , where L is a constant or is slowly growing in t. The complexity of encoding and decoding is proportional to rnmL, where r is the numb...

In a group testing scheme, a set of tests is designed to identify a small number t of defective items among a large set (of size N ) of items. In the non-adaptive scenario the set of tests has to be designed in one-shot. In this setting, designing a testing scheme is equivalent to the construction of a disjunct matrix, an M × N matrix where the union of supports of any t columns does not contai...

Automatizing information commerce requires languages to represent the typical information commerce processes. Existing languages and standards cover either only very speci c types of business models or are too general to capture in a concise way the speci c properties of information commerce processes. We introduce a language that is speci cally designed for information commerce. It can be dire...

by John Alan Engbers For graphs G and H, an H-coloring of G, or homomorphism from G to H, is an edge-preserving map from the vertices of G to the vertices of H. H-colorings generalize such graph theory notions as proper colorings and independent sets. In this dissertation, we consider four questions involving H-colorings of graphs. Recently, Galvin [27] showed that the maximum number of indepen...

In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs G with n vertices and ∆(G) ≤ r, which has the most complete subgraphs of size t, for t ≥ 3. The conjectured extremal graph is aKr+1 ∪Kb, where n = a(r + 1) + b with 0 ≤ b ≤ r. Gan, Loh, and Sudakov proved the conjecture wh...

Let it(G) be the number of independent sets of size t in a graph G. Alavi, Erdős, Malde and Schwenk made the conjecture that if G is a tree then the independent set sequence {it(G)}t≥0 of G is unimodal; Levit and Mandrescu further conjectured that this should hold for all bipartite G. We consider the independent set sequence of finite regular bipartite graphs, and graphs obtained from these by ...

Background: Human β-like globin genes regulaon during development from embyonic to adult stage results in generaon of different types of hemoglobin with different funcons. As β-thalassemia and sickle cell disease are disorders of β-globin chain, epigenec drugs such as thalidomide and sodium butyrate which can induce γ-globin gene are considered as a novel therapeuc approach. Drugs effec...

Introduction: Studies on behavioral patterns and personality traits play a critical role in the prediction of healthy or unhealthy behaviors and identification of high-risk individuals for cardiovascular diseases (CVDs) in order to implement preventive strategies. This study aimed to compare personality types in individuals with and without CVD based on the enneagram of personality. Materials a...

In order to formally reason about low-level system programs one needs a semantics (for the programming language in question) that can deal with programs that are not statically type-correct. For system-level programs, the semantics must deal with such heretical constructs like casting integers to pointers and converting pointers between incompatible base types. In this paper we describe a forma...