In Cataloging beyond the Notes: Annotating Bibliographic Records for Music Effectively in RDA, authors Ralph Hartsock and Peter Lisius present examples illustrating the effective use of notes in the description of music, and this is especially important with RDA. Since RDA has increased granularity in the description of music, whether in score, recording, video, or data formats, the expert direction offered in Cataloging beyond the Notes makes it a key reference for music cataloging. Bibliographic records are presented using MARC21. An essential resource for practicing music catalogers, Cataloging beyond the Notes begins with a comprehensive introduction, including instructions on how to use the book, and presents examples of the granular data that informs users about specific details. In addition, the examples are augmented by the authors’ commentary, so that the result is expert guidance in a single, highly accessible publication. More than that, navigation to and from the newer RDA format is facilitated by an appendix keyed to specific RDA details. Frequently used and related terms are also covered in a glossary specific to this volume. Taken as a whole, Cataloging beyond the Notes belongs in every music library and on each cataloger’s desk.

Introduction to Probabilistic Automata deals with stochastic sequential machines, Markov chains, events, languages, acceptors, and applications. The book describes mathematical models of stochastic sequential machines (SSMs), stochastic input-output relations, and their representation by SSMs. The text also investigates decision problems and minimization-of-states problems arising from concepts of equivalence and coverings for SSMs. The book presents the theory of nonhomogeneous Markov chains and systems in mathematical terms, particularly in relation to asymptotic behavior, composition (direct sum or product), and decomposition. "Word functions," induced by Markov chains and valued Markov systems, involve characterization, equivalence, and representability by an underlying Markov chain or system. The text also discusses the closure properties of probabilistic languages, events and their relation to regular events, particularly with reference to definite, quasidefinite, and exclusive events. Probabilistic automata theory has applications in information theory, control, learning theory, pattern recognition, and time sharing in computer programming. Programmers, computer engineers, computer instructors, and students of computer science will find the collection highly valuable.

"A bibliography of poetry composed in what is now the United States of America and printed in the form of books or pamphlets before 1821"--Provided by publisher.

This is Volume XIV of thirty-eight in a series on the General Psychology. Originally published in 1960, this study offers A Comprehensive Phenomenology of Theories and their Meanings for Therapy.

Includes, beginning Sept. 15, 1954 (and on the 15th of each month, Sept.-May) a special section: School library journal, ISSN 0000-0035, (called Junior libraries, 1954-May 1961). Also issued separately.