We study the following combinatorial game played by two players, Alice and Bob, which generalizes the Pizza game considered by Brown, Winkler and others. Given a connected graph G with nonnegative weights assigned to its vertices, the players alternately take one vertex of G in each turn. The first turn is Alice’s. The vertices are to be taken according to one (or both) of the following two rul...

This paper takes on the task of providing a formal system of dialogue CE in which the speech acts of requesting and providing an explanation are represented as dialogue moves in the system. CE has opening rules, locution rules, dialogue rules, success rules and closing rules. The system is meant to be simple and basic, to provide a platform for developing more specialized formal dialogue system...

A sequence r1, r2, . . . , r2n such that ri = rn+i for all 1 ≤ i ≤ n, is called a repetition. A sequence S is called non-repetitive if no block (i.e. subsequence of consecutive terms of S) is a repetition. Let G be a graph whose edges are coloured. A trail is called non-repetitive if the sequence of colours of its edges is non-repetitive. If G is a plane graph, a facial non-repetitive edge-colo...

Human T-cell leukemia virus types 3 and 4 (HTLV-3 and HTLV-4) are recently isolated retroviruses. We have previously characterized HTLV-3- and HTLV-4-encoded antisense genes, termed APH-3 and APH-4, respectively, which, in contrast to HBZ, the HTLV-1 homologue, do not contain a typical bZIP domain (M. Larocque É Halin, S. Landry, S. J. Marriott, W. M. Switzer, and B. Barbeau, J. Virol. 85:12673...

Many approaches for testing configurable software systems start from the same assumption: it is impossible to test all configurations. This motivated the definition of variability-aware abstractions and sampling techniques to cope with large configuration spaces. Yet, there is no theoretical barrier that prevents the exhaustive testing of all configurations by simply enumerating them, if the ef...

We show that if X is a chordal graph containing no clique of size μ (μ an infinite cardinal) then the chromatic (even coloring) number of X is at most μ. The same conclusion holds if the condition ‘is chordal’ is replaced by ‘contains no induced C4 (or Kk,k for k finite)’. In [9] Wagon asked if the following holds. If X is a chordal graph with Kω 6≤ X then Chr(X) ≤ ω. This was proved by Halin i...

It is well-known that many NP-hard problems can be solved efficiently on graphs of bounded treewidth. We begin by showing that Knuth’s results on nested satisfiability are easily derived from this fact since nested satisfiability graphs have treewidth at most three. Noting that nested satisfiability graphs have a particular form of planar drawing, we define a more general form of graph drawing ...

5510 sayılı Kanun ve Sağlık Uygulama Tebliği ilgili hükümlerince sağlık hizmet sunucuları tarafından kişilerin müracaatı aşamasında, acil hallerde ise halin sona ermesinden sonra; nüfus cüzdanı, sürücü belgesi, evlenme pasaport veya verilmiş Kurum kartı belgelerinden biri ile kimlik tespiti biyometrik yöntemlerle doğrulaması yapılması zorunludur. Kimlik yükümlülüğünü ihlal eden hem idari mevzua...

(PCD) joins Morbidity and Mortality Weekly Report, Emerging Infectious Diseases, and scientific journals around the world in publishing on the topic of poverty and human development. This joint effort is sponsored by the Council of Science Editors (1), and the global partnership of more than 200 journals represents both developed and developing countries. PCD is honoring this commitment with a ...

welcome, and medical historians will have cause to be grateful for this worthy legacy from Prof. Merke, who died on 6 June 1975. The subject is pursued from the Ice Age through the Middle Ages down to the nineteenth century, and includes quotations from the many original texts of Ancient Egyptian, Ethiopian, Grecian, Roman, and Arabian authors. The well-documented works of medical and lay perso...