OMEN (On-demand Metadata Extraction Network) addresses a fundamental problem in Music Information Retrieval: the lack of universal access to a large dataset containing significant amounts of copyrighted music. This thesis proposes a solution to this problem that is accomplished by utilizing the large collections of digitized music available at many libraries. Using OMEN, libraries will be able to perform on-demand feature extraction on site, returning feature values to researchers instead of providing direct access to the recordings themselves. This avoids copyright difficulties, since the underlying music never leaves the library that owns it. The analysis is performed using grid-style computation on library machines that are otherwise under-used (e.g., devoted to patron web and catalogue use).

Thesis (Ph. D.)--University of Washington, 2007. / Vita. Includes bibliographical references (leaves 97-103).

Thesis (Ed. D.)--West Virginia University, 1989. / Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 101-106).

Thesis (Ph. D.)--University of Hong Kong, 1998. / Includes bibliographical references (leaves 347-365).

No description available.

Call number: LD2668 .T4 1960 E47

Call number: LD2668 .T4 1984 S47 / Master of Science

Functional languages offer a number of advantages over their imperative counterparts. However, a substantial amount of the time spent on processing functional programs is due to the large amount of storage management which must be performed. Two apparent reasons for this are that the programmer is prevented from including explicit storage management operations in programs which have a purely functional semantics, and that more readable programs are often far from optimal in their use of storage. Correspondingly, two alternative approaches to the optimisation of store usage at compile-time are presented in this thesis. The first approach is called compile-time garbage collection. This approach involves determining at compile-time which cells are no longer required for the evaluation of a program, and making these cells available for further use. This overcomes the problem of a programmer not being able to indicate explicitly that a store cell can be made available for further use. Three different methods for performing compile-time garbage collection are presented in this thesis; compile-time garbage marking, explicit deallocation and destructive allocation. Of these three methods, it is found that destructive allocation is the only method which is of practical use. The second approach to the optimisation of store usage is called compile-time garbage avoidance. This approach involves transforming programs into semantically equivalent programs which produce less garbage at compile-time. This attempts to overcome the problem of more readable programs being far from optimal in their use of storage. In this thesis, it is shown how to guarantee that the process of compile-time garbage avoidance will terminate. Both of the described approaches to the optimisation of store usage make use of the information obtained by usage counting analysis. This involves counting the number of times each value in a program is used. In this thesis, a reference semantics is defined against which the correctness of usage counting analyses can be proved. A usage counting analysis is then defined and proved to be correct with respect to this reference semantics. The information obtained by this analysis is used to annotate programs for compile-time garbage collection, and to guide the transformation when compile-time garbage avoidance is performed. It is found that compile-time garbage avoidance produces greater increases in efficiency than compile-time garbage collection, but much of the garbage which can be collected by compile-time garbage collection cannot be avoided at compile-time. The two approaches are therefore complementary, and the expressions resulting from compile-time garbage avoidance transformations can be annotated for compile-time garbage collection to further optimise the use of storage.

PLEXPLAN, an automated software system and methodology for Information Systems (IS) planning, is described. The PLEXPLAN methodology and tools are used to integrate information from multiple and dynamic perspectives on the organization. A conceptual and technical software architecture is described which permits storage, integration and manipulation of such information. The PLEXPLAN methodology is consistent with the PLEXPLAN software architecture inasmuch as specific techniques in the methodology are represented in the automated environment as tools. A case is presented where PLEXPLAN was used to address an Information Systems planning task. Use of the PLEXPLAN methodology and tools is specifically described as they relate to the case.

This research identifies a current and future need in the realm of information systems development which has surfaced as a result of layered architectures and software reuse. An analysis methodology based upon two three-dimensional metamodels which correspond to the principal aspects of system architecture, structure and communication, is developed. Each metamodel can be viewed as having three planes which represent increasing abstractions away from actual source code. For example, with regard to the structure metamodel, the lowest plane corresponds to actual source code structures written in a specific computer language, the middle plane represents the general form of the structure available in that language, and the top plane represents the general form of structures available in any language. An object-oriented viewpoint was adopted in order to allow the expression of the relationships between entities found on a single plane of a metamodel, as well as the expression of the relationships between entities found on different planes. The metamodels provide a framework and methodology for discerning the structure and communication mechanisms employed in software source code as well as a framework from within which behavioral models can be developed.