2,067 research outputs found
Recollections of Clement C. Moore, author of "A Visit from St. Nicholas"
No full textIncludes 2 poems by Clement C Moore, including "A Visit from St. Nicholas." Part of the Nancy H. Marshall Night before Christmas collection. Swem Library copy includes and undated letter about the book by Margaret N.C. Bradley, niece of the author
Factorisation of regular graphs into forests of short paths
No full textAbstractThe k-linear arboricity of a graph G is the minimum number of forests whose connected components are paths of length at most k which partition E(G). Motivated by this index, we investigate a variation of this idea for d-regular graphs. Namely, we define a d-regular graph G to be (l,k)-linear arborific if E(G) can be partitioned into edge sets of l linear forests consisting of paths of length at most k. By extending an inductive tool developed by Jackson and Wormald, we determine, for d ⩾ 4, values of k such that every d-regular graph is (d − 1, k)-linear arborific
Load Balancing and Orientability Thresholds for Random Hypergraphs
No full textLet h> w> 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices positive signs with respect to the hyperedge, and the rest negative. A (w, k)-orientation of H consists of a w-orientation of all hyperedges of H, such that each vertex receives at most k positive signs from its incident hyperedges. When k is large enough, we determine the threshold of the existence of a (w, k)-orientation of a random hypergraph. The (w, k)-orientation of hypergraphs is strongly related to a general version of the off-line load balancing problem. The graph case, when h = 2 and w = 1, was solved recently by Cain, Sanders and Wormald and independently by Fernholz and Ramachandran, thereby settling a conjecture made by Karp and Saks. Motivated by a problem of cuckoo hashing, the special hypergraph case with w = k = 1, was solved in three separate preprints dating from October 2009, by Frieze and Melsted, by Fountoulakis an
Random matchings which induce Hamilton cycles, and hamiltonian decompositions of random regular graphs
No full textSelect four perfect matchings of 2n vertices, independently at random. We find the asymptotic probability that each of the first and second matchings forms a Hamilton cycle with each of the third and fourth. This is generalised to embrace any fixed number of perfect matchings, where a prescribed set of pairs of matchings must each produce Hamilton cycles (with suitable restrictions on the prescribed set of pairs). We also show how the result with four matchings implies that a random d-regular graph for fixed even d 4 asymptotically almost surely decomposes into d/2 Hamilton cycles. This completes a general result on the edge-decomposition of a random regular graph into regular spanning subgraphs of given degrees together with Hamilton cycles, and verifies conjectures of Janson and of Robinson and Wormald
External interventions and the duration of civil wars
No full textThe authors combine an empirical model of external intervention, with a theoretical model of civil war duration. Their empirical model of intervention allows them to analyze civil war duration, using"expected"rather than"actual"external intervention as an explanatory variable in the duration model. Unlike previous studies, they find that external intervention is positively associated with the duration of civil war. They distinguish partial third-party interventions that extend the length of war, from multilateral"peace"operations, which have a mandate to restore peace without taking sides - and which typically take place at war's end, or at least when both sides have agreed to a cease-fire. In a future paper, the authors will examine whether partial third-party interventions - whatever their effect on a war's duration - increase the risk of war's recurrence. If that proves true, then even if interventions reduce the length of civil war, they may do so at the cost of further destabilizing the political system, and sowing the seeds of future rebellion.Children and Youth,Peace&Peacekeeping,Post Conflict Reconstruction,Post Conflict Reconstruction,International Affairs,Post Conflict Reconstruction,Social Conflict and Violence,Peace&Peacekeeping,Post Conflict Reconstruction,International Affairs
Hamiltonian decompositions of random bipartite regular graphs
No full textAbstractWe prove a complete hamiltonian decomposition theorem for random bipartite regular graphs, thereby verifying a conjecture of Robinson and Wormald. The main step is to prove contiguity (a kind of asymptotic equivalence) of two probabilistic models of 4-regular bipartite graphs; namely, the uniform model, and the model obtained by taking the union of two independent, uniformly chosen bipartite Hamilton cycles, conditioned on forming no multiple edges. The proof uses the small subgraph conditioning method to establish contiguity, while the differential equation method is used to analyse a critical quantity
Hamiltonian Decompositions of Random Bipartite Regular Graphs
No full textWe prove a complete hamiltonian decomposition theorem for random bipartite regular graphs, thereby verifying a conjecture of Robinson and Wormald. The main step is to prove contiguity (a kind of asymptotic equivalence) of two probabilistic models of 4-regular bipartite graphs; namely, the uniform model, and the model obtained by taking the union of two independent, uniformly chosen bipartite Hamilton cycles, conditioned on forming no multiple edges. The proof uses the small subgraph conditioning method to establish contiguity, while the differential equation method is used to analyse a critical quantity
Chapter 3 - Excavations at Tac-Cawla, Rabat, Gozo, 2014 (Temple places: Excavating cultural sustainability in prehistoric Malta)
No full textp.s. Vella Nicholas C. co-author appears on the print version but not the online version.In this chapter, we present the results of archaeological excavations at the prehistoric settlement known as Taċ-Ċawla, Rabat, Gozo (site code TCC14), undertaken by the FRAGSUS Project from 27 March to 17 July 2014. This exercise involved sampling intact archaeological deposits for dateable environmental and economic remains, and identifying and interpreting new features found at a significant settlement site. The site had potential to tackle the fundamental research questions posed by the FRAGSUS Project (§1.5) and expand knowledge of early domestic settlement on Malta. [Excerpt from Introduction]peer-reviewe
Characterization and structure in the development of Tudor comedy
No full textThe role of characterization in dramatic structure is assessed by theoretical criteria.
Characters who perform actions necessary for the completion of the narrative sequence are
said to be "bound" to the narrative; those without such obligations are "free". Characters
who maintain a single, constant meaning during the course of a play are said to be "static";
characters who change or develop into new roles are "dynamic". Horatian decorum
demanded that comic characters be static, and the characters of Plautine and Terentian
tradition were almost always bound to narrative intrigue. However, evaluations of six
Tudor comedies show an increasing use of non-classical characterization within the comic
form.
In the early comedies lohan lohan and Roister Doister all characters are bound and
static, yet the impetus to enlarge the role of characterization is evident. The characters of
lohan lohan are expanded from their French source, and Roister Doister includes
extraneous episodes in which Udall displays his braggart hero. Free characters abound in
Misogonus; as well the play brings dynamic characterization into the scope of comedy with
the conversion of its prodigal son.
Free characters offer new possibilities of non-narrative plotting. In comedies of the
1580s favourite traditional characters appear as diversions outside the action, and thematic
arrangements of characters inform the increasingly complex plots. Lyly stresses the
symbolic potential of characters in Endimion, whereas Greene uses dynamic
characterization to heighten the illusion of independent figures in Friar Bacon and Friar
Bungay. Love's Labour's Lost exposes the limitations of comic artifice by pulling the
characters between convention and individualization.
By the end of the sixteenth century free and dynamic characters had become
common, and characterization had established a sizable claim on the design of English
comedy. These developments set the English form apart from its neoclassical counterparts
Flexible Mx Specification of Various Extended Twin Kinship Designs
No full textThe extended twin kinship design allows the simultaneous testing of additive and nonadditive genetic, shared and individual-specific environmental factors, as well as sex differences in the expression of genes and environment in the presence of assortative mating and combined genetic and cultural transmission (Eaves et al., 1999). It also handles the contribution of these sources of variance to the (co)variation of multiple phenotypes. Keller et al. (2008) extended this comprehensive model for family resemblance to allow or a flexible specification of assortment and vertical transmission. As such, it provides a general framework which can easily be reduced to fit subsets of data such as twin-parent data, children-of-twins data, etc. A flexible Mx specification of this model that allows handling of these various designs is presented in detail and applied to data from the Virginia 30,000. Data on height, body mass index, smoking status, church attendance, and political affiliation were obtained from twins and their families. Results indicate that biases in the estimation of variance components depend both on the types of relative available for analysis, and on the underlying genetic and environmental architecture of the phenotype of interest. Author(s): Hermine H. Maes 1 * | Michael C. Neale 2 | Sarah E. Medland 3 | Matthew C. Keller 4 | Nicholas G. Martin 5 | Andrew C. Heath 6 | Lindon J. Eaves
- …
