8,125 research outputs found
Alica Ann McCarty
No full textAlice Ann (Nolan) McCarty, the mother of 11 children and a longtime resident of Palo Alto, has died. She was 94. McCarty died peacefully and surrounded by family on Nov. 29, at home in Redwood City. After World War II, she married her high school sweetheart, Leo Robert McCarty, and they came to California, where Leo attended Stanford University. They were married 58 years when he died in 2004. A stay-at-home mother for the first 15 years of their marriage, she later worked part-and full-time, as needed, mastering computer programs as they evolved. A long-time member at Our Lady of the Rosary Church, and St. Thomas Aquinas Parish, she volunteered in many capacities through the years. All of her children survive her: Michael (Cathy), Kevin (Elena), Kathleen, Maureen Mandell, Mary Aileen Fehrenbacher (David), Nora Lundin (Chris), Rose Emanuel (Charlie Weir), Theresa Young (Jim), John (Alessandra), Kieran and Robert (Kathleen). She is also survived by 22 grandchildren
On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification
No full textGraph classes of bounded tree rank were introduced recently in the context of the model checking problem for first-order logic of graphs. These graph classes are a common generalization of graph classes of bounded degree and bounded treedepth, and they are a special case of graph classes of bounded expansion. We introduce a notion of decomposition for these classes and show that these decompositions can be efficiently computed. Also, a natural extension of our decomposition leads to a new characterization and decomposition for graph classes of bounded expansion (and an efficient algorithm computing this decomposition).
We then focus on interpretations of graph classes of bounded tree rank. We give a characterization of graph classes interpretable in graph classes of tree rank 2. Importantly, our characterization leads to an efficient sparsification procedure: For any graph class interpretable in a graph class of tree rank at most 2, there is a polynomial time algorithm that to any G ∈ computes a (sparse) graph H from a fixed graph class of tree rank at most 2 such that G = I(H) for a fixed interpretation I. To the best of our knowledge, this is the first efficient "interpretation reversal" result that generalizes the result of Gajarský et al. [LICS 2016], who showed an analogous result for graph classes interpretable in classes of graphs of bounded degree
Trip account
No full textTrip account - AMs, 15 pp.
“I am attempting to give you some account of a recent vacation trip which we were privileged to enjoy - Rose, Mother and I…” As the account of the trip to view the eclipse is unsigned, we can’t say for sure but as the author states “Rose, Mother and I” one could logically assume that the author is a sibling of T. Rose Curtis
ROSE POLY and ME A Memoir
No full textAuthor discusses his time as an engineering student and football player (1955-59), and then football coach, track coach, athletic director, instructor and then assistant professor of civil engineering at Rose Polytechnic Institute (now Rose-Hulman Institute of Technology) (1962-64). As a football player in 1958, he led the nation in scoring with 168 points in 8 games. Sixty-two years later, the 168 points continues to be the record for points in a season by an Indiana college football player. His 21.0 points per game were the national record for thirty years (1958-88) until broken by Barry Sanders of Oklahoma State. In 1957 and 1958, the Rose Poly football team won fifteen games in a row over two seasons while the defense held opponents to 5.4 points per game. In 1958, the team led the NCAA Division II in defense holding opponents to 95.8 yards per game and a total of 31 points (3.9 points per game). As the football coach, he rescued the team from a disastrous previous year in which the team lost all of its games and scored only six points. The author concludes with his afterthoughts on his alma mater after a career of more than 60 years in engineering education.https://scholar.rose-hulman.edu/alum_pub/1003/thumbnail.jp
Trove: Innovation in Access to Information in Australia
No full textIn late 2009 the National Library of Australia released version 1 of Trove [1] to the public. Trove is a free search engine. It searches across a large aggregation of Australian content. The treasure is over 90 million items from over 1000 libraries, museums, archives and other organisations which can be found at the click of a button. Finding information just got easier for many Australians. Exploring a wealth of resources and digital content like never before, including full-text books, journals and newspaper articles, images, music, sound, video, maps, Web sites, diaries, letters, archives, people and organisations has been an exciting adventure for users and the service has been heavily used. Finding and retrieving instantly information in context; interacting with content and social engagement are core features of the service. This article describes Trove features, usage, content building, and its applications for contributors and users in the national context
Obstructions for bounded shrub-depth and rank-depth
No full textShrub-depth and rank-depth are dense analogues of the tree-depth of a graph.
It is well known that a graph has large tree-depth if and only if it has a long
path as a subgraph. We prove an analogous statement for shrub-depth and
rank-depth, which was conjectured by Hlin\v{e}n\'y, Kwon, Obdr\v{z}\'alek, and
Ordyniak [Tree-depth and vertex-minors, European J.~Combin. 2016]. Namely, we
prove that a graph has large rank-depth if and only if it has a vertex-minor
isomorphic to a long path. This implies that for every integer , the class
of graphs with no vertex-minor isomorphic to the path on vertices has
bounded shrub-depth.Comment: 19 pages, 5 figures; accepted to Journal of Combinatorial Theory Ser.
Did Plant Patents Create the American Rose?
No full textThe Plant Patent Act of 1930 was the first step towards creating property rights for biological innovation: it introduced patent rights for asexually-propagated plants. This paper uses data on plant patents and registrations of new varieties to examine whether the Act encouraged innovation. Nearly half of all plant patents between 1931 and 1970 were for roses. Large commercial nurseries, which began to build mass hybridization programs in the 1940s, accounted for most of these patents, suggesting that the new intellectual property rights may have helped to encourage the development of a commercial rose breeding industry. Data on registrations of newly-created roses, however, yield no evidence of an increase in innovation: less than 20 percent of new roses were patented, European breeders continued to create most new roses, and there was no increase in the number of new varieties per year after 1931.
Colouring Polygon Visibility Graphs and Their Generalizations
No full textCurve pseudo-visibility graphs generalize polygon and pseudo-polygon visibility graphs and form a hereditary class of graphs. We prove that every curve pseudo-visibility graph with clique number ω has chromatic number at most 3⋅4^{ω-1}. The proof is carried through in the setting of ordered graphs; we identify two conditions satisfied by every curve pseudo-visibility graph (considered as an ordered graph) and prove that they are sufficient for the claimed bound. The proof is algorithmic: both the clique number and a colouring with the claimed number of colours can be computed in polynomial time
Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs
No full textIn this paper, we consider the class ^d of sphere intersection graphs in R^d for d ≥ 2. We show that for each integer t, the class of all graphs in ^d that exclude K_{t,t} as a subgraph has strongly sublinear separators. We also prove that ^d has asymptotic dimension at most 2d+2
Letter from Rose Cecil O'Neill to Mary Louise Clifton
No full textA handwritten letter from Rose Cecil O'Neill to Mary Louise Clifton Womer regarding folk art in the Ozarks
- …
