We report the investigation of two 16-residue peptides in aqueous solution by means of molecular-dynamics simulations. The peptides constitute the C- and N-terminal halves of the 33-residue monomer whose dimer constitutes the leucine zipper of the yeast transcriptional activator, denoted GCN4-p1. To examine a hypothesis about coiled-coil formation, in which the C-terminal half contains a helix-...

P ulmonologists have generally taken a nihilistic view of chemotherapy for the treatment of advanced lung cancer. In a study of beliefs among pulmonologists in the therapeutic treatment of lung cancer, Schroen and colleagues found that only one third of those surveyed believed that chemotherapy conferred a survival benefit for patients with stage IV non-small cell lung cancer and 35% said they ...

Tree initialisation techniques for genetic programming (GP) are examined in [4,3], highlighting a bias in the standard implementation of the initialisation method Ramped Half-n-Half (RHH) [1]. GP trees typically evolve to random shapes, even when populations were initially full or minimal trees [2]. In canonical GP, unbalanced and sparse trees increase the probability that bigger subtrees are s...

We explore the connections between the well-studied Aztec Diamond graphs and a new family of graphs called the Half-Hexagons, discovered by Jonathan Novak. In particular, both families of graphs have very simple domino shuffling algorithms, which turn out to be intimately related. This connection allows us to prove an “arctic parabola” theorem for the Half-Hexagons as a corollary of the Arctic ...

We consider the minimum number of zeroes in a 2m 2n (0; 1)-matrix M that contains no m n submatrix of ones. We show that this number, denoted by f(m; n), is at least 2n + m + 1 for m n. We determine exactly when this bound is sharp and determine the extremal matrices in these cases. For any m, the bound is sharp for n = m and for all but nitely many n > m. A general upper bound due to Gentry, f...

Consider the minimum number f(m,n) of zeroes in a 2m×2n (0, 1)-matrixM that contains no m×n submatrix of ones. This special case of the well-known Zarankiewicz problem was studied by Griggs and Ouyang, who showed, for m ≤ n, that 2n+m+1 ≤ f(m,n) ≤ 2n + 2m − gcd(m,n) + 1. The lower bound is sharp when m is fixed for all large n. They proposed determining limm→∞{f(m,m+ 1)/m}. In this paper, we sh...

Timo Henckel is a Fellow in international and development economics at the Crawford School of Economics and Government, The Australian National University Vanuatu’s economy paints a picture of contradictions: it has continued on the recent growth path with low inflation, government budget surpluses, and increased capital inflows. Yet successful management of the economy has not translated into ...