4,798 research outputs found
Goldberg, Leonard, October 23, 2015 [Interview]
No full textGoldberg remembers his early life and the history looming over his home city of Detroit. He explains his excitement in college and enthusiasm to go into Grad School, and how he fell in love both with books and his future wife.Hoffa, James
Barbara Goldberg Papers
No full textBarbara Goldberg (1943- ) is a poet, translator, editor, author of feature articles and speeches, and educator, who lives in Chevy Chase, Maryland. Raised in Forest Hills, New York, she holds degrees from Mount Holyoke College (B.A., 1963), Columbia University (M.Ed., 1970), and American University (M.F.A., 1985). She is the author of four volumes of poetry: The Royal Baker's Daughter (2008); Marvelous Pursuits (1995), Cautionary Tales (1990), and Berta Broadfoot and Pepin the Short: A Merovingian Romance (1986), three of which have been translated into Hebrew. The Fire Stays in Red: Poems by Ronny Someck was translated by Goldberg and the Israeli poet Moshe Dor (2002). In addition, Goldberg and Dor edited two anthologies of Hebrew poetry in translation: After the First Rain: Israeli Poems on War and Peace (1998) and The Stones Remember: Native Israeli Poetry (l991). Goldberg edited The First Yes: Poems About Communicating (1996) and co-edited Open Door: Selected Poems from Poet Lore, 1980-1996 (1996). The recipient of numerous awards, Goldberg's poetry has been published in Poetry, the Paris Review, the Gettysburg Review, and the Harvard Review and her translations in the American Poetry Review. In 1999, she served as Poet-in-Residence for Howard County, Maryland. She has been a fellow at Yaddo, the MacDowell Colony, and the Virginia Center for the Creative Arts. She formerly served as editor of Poet Lore magazine and as senior speechwriter at AARP. Her papers include copies of her full-length books of poetry in English and Hebrew as well as copies of those she edited or translated. There are also copies of the books and serial publications to which Goldberg contributed. The correspondence with individuals and organizations documents her writing career. Additional materials in the collection include manuscripts, page proofs, notes, research materials, publicity, audio and video recordings, and photographs
Louis Goldberg collection : accounting discipline historical research
No full textThis data collection includes both Louis Goldberg's personal papers and his extensive collection of reviews, articles and theses by various other authors. Goldberg's personal papers range from primary, secondary, and tertiary workbooks from his school years, to correspondence, journals, notes, reflections, speeches and other papers written during his professional life as an accounting educator and author. Also included are numerous drafts, research materials and notes for the many books and articles that Professor Goldberg wrote on the subject of accounting. The collection provides an excellent research resource for the history of accounting, the development of accounting as an academic discipline, and the professional working life of Professor Louis Goldberg.</p
Syndicated Columnist, NY Times Best-Selling Author Jonah Goldberg at Cedarville
No full textSyndicated political columnist, Fox News contributor and New York Times best-selling author Jonah Goldberg will lecture and host a book signing at Cedarville University’s Jeremiah Chapel Tuesday, Oct. 9 at 7:30 p.m
Early Music: Mark Kroll, harpsichord, January 17, 1984
No full textThis is the concert program of the Early Music: Mark Kroll, harpsichord performance on Friday, January 27, 1984 at 8:00 p.m., at the Concert Hall, 855 Commonwealth Avenue. The work performed was Goldberg Variations (Aria with 30 variations from "Klavierübung, Part IV"), BWV 988 by Johann Sebastian Bach. Digitization for Boston University Concert Programs was supported by the Boston University Humanities Library Endowed Fund
Film Review: Yoo Hoo, Mrs. Goldberg
No full textThe author presents a review of the documentary Yoo Hoo, Mrs. Goldberg
A complexity trichotomy for approximately counting list H-colourings
No full textWe examine the computational complexity of approximately counting the list H-colourings of a graph. We discover a natural graph-theoretic trichotomy based on the structure of the graph H. If H is an irreflexive bipartite graph or a reflexive complete graph then counting list H-colourings is trivially in polynomial time. Otherwise, if H is an irreflexive bipartite permutation graph or a reflexive proper interval graph then approximately counting list H-colourings is equivalent to #BIS, the problem of approximately counting independent sets in a bipartite graph. This is a well-studied problem which is believed to be of intermediate complexity – it is believed that it does not have an FPRAS, but that it is not as difficult as approximating the most difficult counting problems in #P. For every other graph H, approximately counting list H-colourings is complete for #P with respect to approximation-preserving reductions (so there is no FPRAS unless NP = RP). Two pleasing features of the trichotomy are (i) it has a natural formulation in terms of hereditary graph classes, and (ii) the proof is largely self-contained and does not require any universal algebra (unlike similar dichotomies in the weighted case). We are able to extend the hardness results to the bounded-degree setting, showing that all hardness results apply to input graphs with maximum degree at most 6
10481 Executive Summary – Computational Counting
No full textFrom November 28 to December 3 2010, the Dagstuhl seminar 10481
``Computational Counting'' was held in Schloss Dagstuhl – Leibnitz Center
for Informatics. 36 researchers from all over the world, with interests and
expertise in different aspects of computational counting, actively
participated in the meeting
Goldberg, Mark F., A Portrait of John Goodlad, Educational Leadership, 52(March, 1995), 82-85.
No full textProvides a review of John Goodlad\u27s professional career and his contributions to curriculum and educational reform
10481 Abstracts Collection – Computational Counting
No full textFrom November 28 to December 3 2010, the Dagstuhl Seminar 10481 ``Computational Counting'' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
- …
