666 research outputs found
DTB 022 Carl Cunningham Jr 5-26-2022
No full textThis oral history interview with Dr. Carl Cunningham Jr. was conducted by Jada Jones and Ryan Morini in Bay Minette, Alabama at Coastal Alabama Community College. Dr. Cunningham speaks about his family’s connections to the Down the Bay community, as well as his membership in the Excelsior Band. He also shares some of his family history in relation to the history of Mobile, including his ancestor Lucrecia Perryman who has been the subject of considerable archaeological research. Dr. Cunningham also talks about his experiences growing up and learning about this history from family members, and the effect that knowing that history has had in preparing him for success in life and enabling him to advise and work with students at CACC. He also shares observations on some of the social and historical dynamics of racism in Mobile and surrounding areas. And Dr. Cunningham’s mother Audrey has a brief cameo over the phone, supplying further information about Down the Bay
Memorandum from Unknown Author to Senator Langer Regarding Clearance for Reimbursement of Expenses, February 21, 1955
No full textThis memorandum dated February 21, 1955, from unknown author to United States (US) Senator William Langer, written on US Senate memorandum stationery, reads:
Senator: Mr. Chumbers [sic] called, said he has talked to Commissioner Emmons, but Mr. Emmons has been unable to clear with the Secretary of the Interior as to the Federal government\u27s reimbursing the State of N. Dak. for their expenses. Because of the Holiday tomorrow, he may not get a report from the Secretary before Thursday.
Mr. Chumbers most likely refers to Pete Chumbris, to whom other documents in the Langer papers of this period refer.
Commission Emmons most likely refers to Glenn L. Emmons, Commissioner of the United States (US) Bureau of Indian Affairs.
See also:
Letter from Ben Youngbird and Carl Whitman, Jr. Requesting Meeting, February 1955https://commons.und.edu/langer-papers/1861/thumbnail.jp
Correspondence to Johnny Parham from M. Carl Holman, October 30, 1960
No full textThis telegram, sent by M. Carl Holman, the editor of the Atlanta Inquirer, urgently requests Johnny Parham Jr., to provide a concise overview of pre-election issues and trends among Negro voters in Los Angeles. The information is sought from various sources, including newspapers, polls, experts, and public opinions. The information is intended for publication in the Atlanta Inquirer's press on Wednesday morning, October 30th, 190. 1 page
Frank Zeidler, Milwaukee, and Cold War Civil Defense
No full textCivil defense in the Cold War encompassed the development of government policies and procedures to evacuate, shelter, and decentralizing American populations and industries in the event of a nuclear war. This project employs a body of primary documents to examine the unacknowledged role of Milwaukee's last Socialist mayor as a trailblazer in the design and implementation of civil defense policy during his tenure from 1948 until 1960. Under the leadership of the Zeidler Administration the city of Milwaukee was an exemplary national model for civil defense planning. Yet despite superior planning, implementation of civil defense in Milwaukee, like elsewhere, suffered both from apathy and the practical impossibility of preparing for nuclear disaster. This research contributes to our understanding of local defense and offers insight into the contemporary politics of municipal government in the metropolitan area of Milwaukee
Some results on e-genericity and recursively enumerable weak truth table degrees
No full textIn this manuscript we explore two topics in recursion theory and their interaction.The first topic is e-genericity, a notion of genericity for recursively enumerable (r.e.) sets introduced by C. G. Jockusch, Jr. The second is weak truth table reducibility (w-reducibility), a strong reducibility (i.e., stronger than the most general Turing reducibility) first introduced by Friedberg and Rogers. In Chapter 1 we give a brief introduction to these topics and establish the relevant terminology and notation.In Chapter 2 we give some closure and non-closure properties for the classes of e-generic sets and degrees, which are predicted by analogous results for previous notions of genericity. For example, the e-generic sets are not closed under union, intersection, or join, but on the other hand if the join of two sets is e-generic, then so are , and .In Chapter 3 we investigate the structure of the weak truth table degrees (w-degrees) inside an e-generic Turing degree. Here we show that e-generic Turing degrees are highly noncontiguous in the sense that they contain no greatest and no least r.e. w-degree.Finally in Chapter 4 we obtain some results on the ordering of the r.e. w-degrees in general. The main result is the existence of a nontrivial r.e. w-degree a which has a greatest lower bound with every r.e. w-degree b. We also show that these nontrivial completely cappable degrees can neither be low nor promptly simple.Made available in DSpace on 2011-05-07T13:41:37Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9210749.pdf: 2722683 bytes, checksum: 07c8b9b10ac798d598fefb5475260d9f (MD5)
Previous issue date: 1991Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T14:57:59Z
Item is restricted indefinitely.Restriction data tranferred 2014-07-01T11:27:14-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissionETDs are only available to UIUC Users without author permissionU of I Onl
Some results on e-genericity and recursively enumerable weak truth table degrees
No full textIn this manuscript we explore two topics in recursion theory and their interaction.The first topic is e-genericity, a notion of genericity for recursively enumerable (r.e.) sets introduced by C. G. Jockusch, Jr. The second is weak truth table reducibility (w-reducibility), a strong reducibility (i.e., stronger than the most general Turing reducibility) first introduced by Friedberg and Rogers. In Chapter 1 we give a brief introduction to these topics and establish the relevant terminology and notation.In Chapter 2 we give some closure and non-closure properties for the classes of e-generic sets and degrees, which are predicted by analogous results for previous notions of genericity. For example, the e-generic sets are not closed under union, intersection, or join, but on the other hand if the join of two sets is e-generic, then so are , and .In Chapter 3 we investigate the structure of the weak truth table degrees (w-degrees) inside an e-generic Turing degree. Here we show that e-generic Turing degrees are highly noncontiguous in the sense that they contain no greatest and no least r.e. w-degree.Finally in Chapter 4 we obtain some results on the ordering of the r.e. w-degrees in general. The main result is the existence of a nontrivial r.e. w-degree a which has a greatest lower bound with every r.e. w-degree b. We also show that these nontrivial completely cappable degrees can neither be low nor promptly simple.U of I OnlyETDs are only available to UIUC Users without author permissio
W. K. Cunningham, Jr., Superintendent, etc., v. Carl Hayes
No full textSupreme Court of Appeals of Virginia at Richmondhttps://scholarlycommons.law.wlu.edu/va-supreme-court-records-vol204/1111/thumbnail.jp
Japanese Direct Investment in the United States: Trends, Developments and Issues
No full textCarl Scheraga, with Richard Kolodny, is a contributing author, A Profile of Japanese Acquisition of U.S. Firms .https://digitalcommons.fairfield.edu/business-books/1032/thumbnail.jp
Variations in precipitation as affecting water works engineering /
No full text"With accompanying discussions by William W. Brush, Andrew J. Provost, Jr., Francis F. Longley, John C. Trautwine Jr., Sidney K. Clapp, Nicholas S. Hill, Jr., Ellsworth Huntington, and the author.""Reprinted from the Journal of The American Water Works Association, Vol. 3, No. 1, March 1916."Cover title.Mode of access: Internet
Uniformity and bounded arithmetic below P
No full textMade available in DSpace on 2011-05-07T12:31:41Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9712398.pdf: 3856594 bytes, checksum: 9160445c25b2f9a33682363c6312eef0 (MD5)
Previous issue date: 1996We study some of the complexity classes below P and, in particular, we concentrate on AC\sp0\subseteq NC\sp1\subseteq L= LogSpace. We also study the nondeterministic classes NAC\sp{i} and NNC\sp{i}, for which are the counterparts to the more familiar class NP. In the final part of this work we characterize the so-called Steven's Class SC=\bigcup\sb{i\ge1}Sc\sp{i}."We start by proving that certain basic arithmetic operations such as Count, Multiplication, Multiple Addition, Sorting, etc. can be carried out in Uniform-NC\sp1 and that similar results hold in the class Uniform-AC\sp0 when dealing with sufficiently ""small"" numbers. The proofs are carried out by using algebraic characterizations of the previous classes as developed, for example, in (C14) and (CT2)."We continue with the classes NAC\sp0\subseteq NNC\sp1\subseteq\cdots\subseteq NP introduced in (Ta2) and prove that, in fact, all of them coincide and therefore are equal to NPolyTime.Finally, we move further up and consider the complexity class SC as defined in (Co2). We introduce the notion of Extended k-Bounded Recursion on Notation (E\sb{k}BRN) and prove that the class SC\sp{k} equals the closure of the set of basic functions INITIAL (see for example, (CT2)), under composition, CRN and E\sb{k}BRN.Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T14:42:13Z
Item is restricted indefinitely.Restriction data tranferred 2014-07-01T11:18:20-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissionETDs are only available to UIUC Users without author permissionU of I Onl
- …
