Consider the number of monochromatic k-cliques in an edge-two-coloring of the complete graph of order n. We determine asymptotically the best constant ck such that the number of one of the monochromatic k-cliques is less than ckn. For example, if k = 3 then c3 = μ3/6, where μ ≈ 0.65 is a root of z3−3z2 +1 = 0, and to get this c3 we translate the problem into a problem concerning the volume of a...

We analyze two well-known matching mechanisms—the Gale-Shapley, and the Top Trading Cycles (TTC) mechanisms—in the experimental lab in three different informational settings, and study the role of information in individual decision making. Our results suggest that—in line with the theory—in the college admissions model the Gale-Shapley mechanism outperforms the TTC mechanisms in terms of effici...

Squamous carcinoma of the oral cavity is a slow multi-steps process, based on progressive accumulation of genetic events leading to the selection of clonal populations of transformed epithelial cells (Ha&Califano, 2002) The spectrum of histological changes occurring in this process ranges from atypical squamous hyperplasia to carcinoma in situ (CIS), and is grouped under the designation of oral...

On April 2, 2012 the Eindhoven University of Technology published the first adaptive PhD thesis [4] describing the research on the adaptation language and engine GALE, and served (adaptively) by the GALE engine. The aim of the this research was twofold: to make the authoring of adaptive documents feasible without much technical knowledge, and to create an adaptation and user modeling service th...

From the famous Gale–Shapley theorem we know that each classical marriage problem admits at least one stable matching. This fact has inspired researchers to search for the maximum number of possible stable matchings, which is equivalent to finding the minimum number of unstable matchings among all such problems of size n. In this paper, we deal with this issue for the Gale–Shapley model with pr...

Type III galactosemia is a metabolic disorder caused by reduced activity of UDP-galactose-4-epimerase, which participates in galactose metabolism and the generation of various UDP-sugar species. We characterized gale-1 in Caenorhabditis elegans and found that a complete loss-of-function mutation is lethal, as has been hypothesized for humans, whereas a nonlethal partial loss-of-function allele ...

In both humans and Drosophila melanogaster, UDP-galactose 4'-epimerase (GALE) catalyzes two distinct reactions, interconverting UDP-galactose (UDP-gal) and UDP-glucose (UDP-glc) in the final step of the Leloir pathway of galactose metabolism, and also interconverting UDP-N-acetylgalactosamine (UDP-galNAc) and UDP-N-acetylglucosamine (UDP-glcNAc). All four of these UDP-sugars serve as vital subs...

The Gale transform is an involution on sets of points in a projective space. It plays a crucial role in several different subjects, such as algebraic geometry, optimization, coding theory, and so on. We give a brief survey—from a finite geometry point of view—on the algebraic and geometrical implications of the Gale transform with emphasis on its applications to coding theory, and describe some...

Managing large groups of human judges to perform any annotation task is a challenge. Linguistic Data Consortium coordinated the creation of manual machine translation post-editing results for the DARPA Global Autonomous Language Exploration Program. Machine translation is one of three core technology components for GALE, which includes an annual MT evaluation administered by National Institute ...