1,212 research outputs found
Author, Geraldine Brooks at the National Library of Australia for the 2009 Ray Mathew Lecture, Canberra, 23 October 2009 [picture] /
No full textTitle from acquisitions documentation.; Part of the collection: Portraits of author, Geraldine Brooks during her visit to the National Library of Australia for the 2009 Ray Mathew Lecture, Canberra, 23 October 2009.; Acquired in digital format; access copy available online.; Mode of access: Internet via World Wide Web.; Photographed by a staff member of the National Library of Australia
Andrew J. Rogers CdV (from House Representatives, 38th Congress Album)
No full textThe photograph features a portrait of Andrew J. Rogers (United States Representative from New Jersey). On its verso, it has a Mathew Brady backmark. The CdV is included in an album containing CdVs of Lincoln\u27s cabinet members as well as senators and representatives from the 38th Congress.https://scholarsjunction.msstate.edu/fvw-cdv/1191/thumbnail.jp
Cubicity, Degeneracy, and Crossing Number
No full textA k-box B=(R_1,R_2,...,R_k), where each R_i is a closed interval on the real line, is defined to be the Cartesian product R_1 X R_2 X ... X R_k. If each R_i is a unit length interval, we call B a k-cube. Boxicity of a graph G, denoted as box(G), is the minimum integer k such that G is an intersection graph of k-boxes. Similarly, the cubicity of G, denoted as cub(G), is the minimum integer k such that G is an intersection graph of k-cubes.
It was shown in [L. Sunil Chandran, Mathew C. Francis, and Naveen Sivadasan. Representing graphs as the intersection of axis-parallel cubes. MCDES-2008, IISc Centenary Conference, available at CoRR, abs/cs/0607092, 2006.] that, for a graph G with maximum degree \Delta, cub(G) <= \lceil 4(\Delta +1) ln n\rceil. In this paper we show that, for a k-degenerate graph G, cub(G) <= (k+2) \lceil 2e log n \rceil. Since k is at most \Delta and can be much lower, this clearly is a stronger result. We also give an efficient deterministic algorithm that runs in O(n^2k) time to output a 8k(\lceil 2.42 log n\rceil + 1) dimensional cube representation for G.
The crossing number of a graph G, denoted as CR(G), is the minimum number of crossing pairs of edges, over all drawings of G in the plane. An important consequence of the above result is that if the crossing number of a graph G is t, then box(G) is O(t^{1/4}{\lceil log t\rceil}^{3/4}) . This bound is tight upto a factor of O((log t)^{3/4}).
Let (P,\leq) be a partially ordered set and let G_{P} denote its underlying comparability graph. Let dim(P) denote the poset dimension of P. Another interesting consequence of our result is to show that dim(P) \leq 2(k+2) \lceil 2e \log n \rceil, where k denotes the degeneracy of G_{P}. Also, we get a deterministic algorithm that runs in O(n^2k) time to construct a 16k(\lceil 2.42 log n\rceil + 1) sized realizer for P. As far as we know, though very good upper bounds exist for poset dimension in terms of maximum degree of its underlying comparability graph, no upper bounds in terms of the degeneracy of the underlying comparability graph is seen in the literature
Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem
No full textAn edge q-coloring of a graph G is a coloring of its edges such that every vertex sees at most q colors on the edges incident on it. The size of an edge q-coloring is the total number of colors used in the coloring. Given a graph G and a positive integer t, the Maximum Edge q-Coloring problem is about whether G has an edge q-coloring of size t. Studies on this coloring problem were motivated by its application in the channel assignment problem in wireless networks.
Goyal, Kamat, and Misra (MFCS 2013) studied Maximum Edge 2-Coloring from the perspective of parameterized complexity. Given a graph on n vertices, they considered the standard parameter t, the number of colors in an optimal edge 2-coloring, and the dual parameter , where n- is the number of colors in an optimal edge 2-coloring. They designed FPT algorithms for Maximum Edge 2-Coloring parameterized by t and . In this paper, we revisit and study Maximum Edge 2-Coloring from the perspective of parameterized complexity and show the following results.
1) Let γ(G) denote the maximum matching size in a given graph G. It is easy to see that a maximum edge 2-coloring of G is of size at least γ(G). Goyal, Kamat, and Misra (MFCS 2013) had asked if there exists an FPT algorithm for Maximum Edge 2-Coloring parameterized by k, where k: = (size of a maximum edge 2-coloring of G) - γ(G). We show that Maximum Edge 2-Coloring parameterized by k is W[1] hard.
2) On the positive side, we show that there is an algorithm that, given a graph G on n vertices and a tree decomposition of width tw, runs in time 2^{O(qtw log {q tw})}n and outputs a maximum edge q-coloring of G
Ventriloquism Days: In Conversation with David Mathew
No full textDavid Mathew is the author of three novels – O My Days, Creature Feature, and most recently Ventriloquists – and a volume of short stories entitled Paranoid Landscapes. His wide areas of interest include psychoanalysis, linguistics, distance learning, prisons and online anxiety. With approximately 600 published pieces to his name, including a novel based on his time working in the education department of a maximum security prison (O My Days), he has published widely in academic, journalistic and fiction outlets. In addition to his writing, he co-edits The Journal of Pedagogic Development (at the University of Bedfordshire, UK), teaches academic writing, and he particularly enjoys lecturing in foreign countries and learning about wine. He is a member of the Tavistock Society of Psychotherapists and Allied Professionals, Evidence Informed Policy and Practice in Education in Europe (EIPPEE), and the European Association for the Teaching of Academic Writing. He was also a member of The Health Technology Assessment programme (www.hta.ac.uk), as part of the NIHR Evaluation, Trials and Studies Coordinating Centre at the University of Southampton (2009-2013). We met at his home in the south-east of England in November 2014 to discuss his approaches to writing and his new novel, Ventriloquists
Fifty Forensic Fables
No full textThis book does for the legal profession in England what George Ade's fables do more broadly. These are enjoyable tales with pleasing caricatures. All the actors are humans. A funny appendix follows The Story of an Ancient Line through twelve generations. The book shows what fable meant earlier in this century.This is a hardbound book (hard cover)This book has a dust jacket (book cover)O (Theo Mathew
Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs
No full textA Conflict-Free Open Neighborhood coloring, abbreviated CFON^* coloring, of a graph G = (V,E) using k colors is an assignment of colors from a set of k colors to a subset of vertices of V(G) such that every vertex sees some color exactly once in its open neighborhood. The minimum k for which G has a CFON^* coloring using k colors is called the CFON^* chromatic number of G, denoted by χ_{ON}^*(G). The analogous notion for closed neighborhood is called CFCN^* coloring and the analogous parameter is denoted by χ_{CN}^*(G). The problem of deciding whether a given graph admits a CFON^* (or CFCN^*) coloring that uses k colors is NP-complete. Below, we describe briefly the main results of this paper.
- For k ≥ 3, we show that if G is a K_{1,k}-free graph then χ_{ON}^*(G) = O(k²log Δ), where Δ denotes the maximum degree of G. Dębski and Przybyło in [J. Graph Theory, 2021] had shown that if G is a line graph, then χ_{CN}^*(G) = O(log Δ). As an open question, they had asked if their result could be extended to claw-free (K_{1,3}-free) graphs, which are a superclass of line graphs. Since it is known that the CFCN^* chromatic number of a graph is at most twice its CFON^* chromatic number, our result positively answers the open question posed by Dębski and Przybyło.
- We show that if the minimum degree of any vertex in G is Ω(Δ/{log^ε Δ}) for some ε ≥ 0, then χ_{ON}^*(G) = O(log^{1+ε}Δ). This is a generalization of the result given by Dębski and Przybyło in the same paper where they showed that if the minimum degree of any vertex in G is Ω(Δ), then χ_{ON}^*(G)= O(logΔ).
- We give a polynomial time algorithm to compute χ_{ON}^*(G) for interval graphs G. This answers in positive the open question posed by Reddy [Theoretical Comp. Science, 2018] to determine whether the CFON^* chromatic number can be computed in polynomial time on interval graphs.
- We explore biconvex graphs, a subclass of bipartite graphs and give a polynomial time algorithm to compute their CFON^* chromatic number. This is interesting as Abel et al. [SIDMA, 2018] had shown that it is NP-complete to decide whether a planar bipartite graph G has χ_{ON}^*(G) = k where k ∈ {1, 2, 3}
The Psalter in the Description of Jesus’ Passion from the Gospel of St. Mathew
No full textThe author focuses on the quotations from the psalms that we find in the description of Jesus’ Passion in the Gospel of St. Mathew. It turns out that almost all the quotations from the psalms (with the exception of 26, 64: Ps 109, 1 LXX) stress the human nature of Jesus, i.e. they are anthropologically oriented. The author discusses each of the seven quotations in the context of the psalm, and then in the context of Jesus’ Passion. Following partly the Gos¬pel of St. Mark, St. Mathew enhances in the reader a belief that Jesus in His Passion is the Suffering Just and the suffering poor Jehovah
Further Forensic Fables
No full textI had earlier found Fifty Forensic Fables, though in a republication by the original publisher in 1949. See my comments there. Again, these stories had all appeared in the Law Journal. Before the thirty fables, this volume, like the first, offers a table of cases cited and a table of statutes. Again, each story has an enjoyable newspaper-like caricature. One can get a good sense of these stories, I believe, by trying the second and third of them. In The Industrious Youth and the Stout Stranger (5), a con man looking like W.C. Fields hires the industrious youth and then borrows a sum of money from him. Of course the industrious youth never sees him again. In Mr. Whitewig and the Rash Question (9), the young Mr. Whitewig has established a very strong case when he asks one question too many of the Police Inspector, i.e., why he arrested the defendant. That question produces the records of nine previous convictions. There are twenty-six pages given to an index starting on 107. The covers are heavy boards with titles pasted on.This is a hardbound book (hard cover)By O (Theo Mathew
A short account of the malignant fever, lately prevalent in Philadelphia [electronic resource] : with a statement of the proceedings that took place on the subject in different parts of the United States. By Mathew Carey.
No full textAlso issued as the fifth title in: Select pamphlets: viz. 1. Lessons to a young prince .. Philadelphia : Published by Mathew Carey, 1796 (Evans 31172).Two states noted. In one, the last word on p. 61 is "un-". In the other, the last word is "'till".Partial list of those who died in Philadelphia between August and November, 1793, p. 100-103.Statistics gathered in Philadelphia, August to November, 1793, including meteorological observations compiled by David Rittenhouse, [9] p. at end.Signatures: [A]p4s B-Np4s Op2s Pp2sEvans,Austin, R.B. Early Amer. medical imprints,Electronic reproduction.English Short Title Catalog,Reproduction of original from British Library
- …
