ppxscal/embedding_network huggingface dataset:
A Comparison of Filters For Audio Signal Segmentation in Audio Restoration
Authors: Hugh Scott, R. G. Wilson
Venue:  (1992)

This report is concerned with the choice of filters for the estimation and detection from a time-frequency representation of audio signals of partials - the approximately sinusoidal components, typically generated in harmonic series, of which many musical signals are composed. The report contains a detailed theoretical and experimental comparison between filters with Gaussian and bilateral exponential time envelopes, in terms of performance on noisy data and simplicity of implementation. It is concluded that the exponential filter is better on both counts. There follows a brief examination of the problem of onset detection, in which both additive and multiplicative approaches are examined. Some tentative conclusions are drawn about the most effective way to solve the problem of partial detection in noisy signals.
An Archive Service with Persistent Naming for Objects
Authors: John D. Jones, James C. French
Venue:  (1994)

Wide-area systems for information storage and retrieval are rapidly gaining in popularity. Exam- ples include FTP (File Transfer Protocol), Gopher, and World Wide Web (WWW) archives of many types of information. Each system provides a means of naming a file or data object so that others may retrieve the information. Unfortunately, this name depends on the network address of the server and on the filename within that machine. Some flexibility is gained by using aliases for these names, but problems persist. Additionally, the use of aliases does not handle the replication of files at several sites, or the movement of a file from one site to another. The result is that these names frequently become invalid. A name that is good today may not work in a week or a month. If a name for a useful collection is passed on to others, it may not work by the time they try to use it. For these reasons, a better approach to naming is needed. In this paper we present a prototype distributed service for archiving files. Each file is given a permanent name, which can be used to retrieve the file from any site of the archive. If the con- tacted site does not have the data, it returns the current location, which is accessed automatically by the client. This allows files to be moved and replicated within the archive without invalidating any of the names. In a hypermedia environment such as the WWW, this means that the links will remain valid, avoiding the need to change each document that references this data. We have developed this system to demonstrate that this approach is feasible. We describe both a standalone service that is accessed via a command-line client, and a gateway to the service from the World Wide Web. The gateway allows the archive to be accessed from NCSA Mosaic, or any client that can use the Hypertext Transfer Protocol (HTTP). The service is assumed to be global in scope, so issues of scalability are critical. This influenced our design, and led us to experiment with caching of names, and automatic replication of fre- quently accessed files. We have, however, omitted the implementation of a distributed name resolver, using a centralized one instead. A distributed implementation would be required for an actual service, and we describe how this might be built. The task of locating an archive site is also discussed.
A Unified Implementation of Concurrency Control and Recovery
Authors: Gustavo Alonso, Divyakant Agrawal, Amr El Abbadi
Venue:  (1993)

Transaction management in shared databases is generally viewed as a combination of two problems, concurrency control and recovery. These two problems are usually considered as orthogonal and, consequently, the correctness criteria derived from them are incomparable. Recently, a unified theory for concurrency control and recovery has been proposed along with a unified correctness criteria called prefix-reducibility. Developing efficient protocols for accepting prefix-reducible executions was left as an open problem. In this paper, we extend this theory to facilitate the design of efficient dynamic protocols that accept prefix-reducible executions. Furthermore, we develop a unified implementation of the log and lock managers required to support this new class of schedulers.
Optimal and Approximate Stochastic Planning using Decision Diagrams
Authors: Jesse Hoey, Robert St.Aubin, Alan Hu, Craig Boutilier
Venue:  (2000)

Structured methods for solving factored Markov decision processes (MDPs) with large state spaces have been proposed recently to allow dynamic programming to be applied without the need for complete state enumeration. We present algebraic decision diagrams (ADDs) as efficient data structures for solving very large MDPs. We describe a new value iteration algorithm for exact dynamic programming, using an ADD input representation of the MDP. We extend this algorithm with an approximate version for generating near-optimal value functions and policies with much lower time and space requirements than the exact version. We demonstrate our methods on a class of large MDPs (up to 34 billion states). We show that significant gains can be had with our optimal value iteration algorithm when compared to tree-structured representations (with up to a thirty-fold reduction in the number of nodes required to represent optimal value functions). We then demonstrate our approximate algorithm and compare results with the optimal ones. Finally, we examine various variable reordering techniques and demonstrate their use within the context of our methods.
Optimizing Parallel Bitonic Sort
Authors: Mihai F Ionescu
Venue:  (1997)

Sorting is an important component of many applications and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorting algorithms is Bitonic Sort which is represented by a sorting network consisting of multiple butterfly stages. Not surprisingly, the algorithm has been studied on different parallel network topologies which provide an easy embedding of butterflies, such as the hypercube or the shuffle-exchange. This thesis studies bitonic sort on modern parallel machines. These machines are relatively coarse grained and consist of only a modest number of nodes. Thus many data elements have to be mapped onto each processor. Under such a setting optimizing the bitonic sort algorithm becomes a question of mapping the data elements to processing nodes (data layout) to minimize communication and optimizing the local computation on each node. We developed a bitonic sort algorithm which minimizes the number of communication steps and optimizes the local computation. We have implemented the new algorithm on the Meiko CS-2, analyzed and evaluated its performance under the LogP and LogGP models of parallel computation. The resulting algorithm is faster than the previous implementations, as experimental results collected on a 64 node Meiko CS-2 show.
A Knowledge-Based System for Composite Document Analysis and Retrieval: Design Issues in the CODER Project
Authors: Edward A. Fox, Robert K. France
Venue:  (1986)

The CODER (COmposite Document Expert/Extended/Effective Retrieval) Project aims at applying a variety of methods developed in the realm of artificial intelligence to improve the performance of information retrieval systems. A prototype CODER system is being developed and will serve as a testbed for future research in this area. Initial experimentation will take place on a collection of more than three years of issues of the AIList ARPANET Digest CODER is being developed in MU-Prolog and C++ as a collection of experts communicating through central blackboards using UNIX™ pipes and the TCP/IP protocol. This distributed system can be divided up across several machines, to best utilize special display devices, storage facilities, and processors. There is a central spine, including document text and document knowledge representations, and a large lexicon being constructed from two machine readable, English dictionaries. An entry/analysis subsystem carries out detailed analysis of composite, documents, determining the structure and type of the whole and of each part. An access/retrieval subsystem has models of each user, can accomodate a variety of query languages, and supports browsing, searching, and immediate feedback. Many issues must be dealt with in the design of such a system, including issues of knowledge representation, natural language processing, storage management and support environments. This paper gives background, describes related work, explains the design principles and architecture, and closes with future plans.
The UBC Distributed Continuous Media File System: Internal Design of Server
Authors: Dwight J. Makaroff, Gerald W. Neufeld
Venue:  (1995)

This report describes the internal design of the UBC Distributed Continuous Media File Server as of April 1995. The most significant unique characteristic of this system is its approach to admission control which utilizes the time-varying requirements of the variable bit-rate data streams currently admitted into the system to properly allocate disk resources. The structure of the processes which implement the file server are described in detail as well as the communication between client processes and server processes. Each major client interface interaction is covered, as well as the detailed operation of the server in response to client requests. Buffer management considerations are introduced as they affect the admission control and disk operations. We conclude with the status of the implementation and plans for completion of the design and implementation. This document provides a snapshot of our design which has not yet been fully implemented and we expect to see significant evolution of the design as the implementation proceeds.
Extended Canonical Recoding
Authors: Nicholas Pippenger
Venue:  (2002)

Extended Canonical Recoding Nicholas Pippenger Canonical recoding transforms a sequence of bits into a sequence of signed digits, preserving the numerical value of the sequence while reducing the number of non-zero digits. It is used to reduce the number of additions and subtractions when performing multiplication (or equivalently, the number of multiplications and divisions when performing exponentiation). Standard canonical recoding uses the digits 0, 1 and -1. Any two non-zero digits are separated by at least one zero, so in the worst case n/2 + O(1) non-zero digits are used to recode an n-bit sequence; in the average case n/3 + O(1) non-zero digits are used. We introduce extended canonical recoding, which uses the digits 0, 1, -1, 3 and -3. Any two non-zero digits are separated by at least two zeroes, so at most n/3 + O(1) non-zero digits are used in the worst case. We show that the scheme is uniquely determined by this condition, and that it is optimal among schemes using the same set of signed digits. Finally, we show that in the average case, extended canonical recoding uses n/4 + O(1) non-zero digits.
Aperture Synthesis Imaging at the Australian Telescope National Facility
Authors: Christopher deSilva
Venue:  (1991)

This report summarises the topics covered in the workshop on aperture synthesis imaging in radio astronomy run by the Australian Telescope National Facility at the CSIRO Radiophysics Laboratory in Marsfirld, New South Wales, in July 1991. It outline the theoretical background of aperture synthesis and describes some of the signal processing techniques used to reduce the data from antena arrays to maps of radio brightness The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Using full match classes for self-maintenance of mediated views
Authors: Valéria Magalhães Pequeno, Vânia Maria Ponte Vidal
Venue: Enterprise information systems IV (2003)

Sharing information among multiple heterogeneous and autonomous data sources has emerged as a new and strategic requirement in modern enterprises. In this paper, we use a mediator-based approach for integrating multiple heterogeneous data sources. The mediator supports materialized views (mediated views) which are stored in a centralized repository. The queries on the view can be processed directly from the integrated view, with no need for accessing the remote sources. The main difficulty with this approach is to maintain the consistency of the materialized view with respect to the source databases updates. Usually, match classes are not self-maintainable. In a prior paper, we presented a technique for self-maintenance of full match classes. In this work, we show how to make other types of match classes self-maintainable by using full match classes as auxiliary classes.
Complexity Measurement of a Graphical Programming Language
Authors: Sallie M. Henry, Roger Goff
Venue:  (1987)

For many years the software engineering community has been attacking the software reliability problem on two fronts: First via design methodologies, languages and tools as a precheck on quality and second by measuring the quality of produced software as a postcheck. This research attempts to unify the approach to creating reliable software by providing the ability to measure the quality of a design prior to its design implementation. Using a graphical design language in an effort to support cognitive science research, we have successfully defined and applied Software Quality Metrics to graphical designs in an effort to predict software quality early in the software lifecycle. Metrics values from the Graphical Design are input to predictor equations, provided in this paper, to give metric values for the resultant source code.
Integrating user operations in multichannel hypermedia
Authors: Franca Garzotto, Vito Perrone
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

Web Applications are progressively becoming multi-channel and cross-channel. The "same" service should be made available in different delivery environments and devices. A user may invoke a service on one device, suspend it, and complete its execution in another one. In this paper we provide the reader with the main concepts and innovative aspects of MC2 a design framework for specifying Multi/Cross Channel web application services. MC2 adopts an high-level, end user perspective and exploits the notion of context, to characterize who, where and how an operation can be invoked.
A Scheduling Framework for Web Server Clusters with Intensive Dynamic Content Processing
Authors: Huican Zhu, Ben Smith, Tao Yang
Venue:  (1998)

Clustering support with a single-system image view for large-scale Web servers is important to improve the system scalability in processing a large number of concurrent requests from Internet, especially when dynamic content generation using CGI or other protocols becomes increasingly popular. This paper studies a two-level scheduling framework with a master/slave architecture for clustering Web servers. Such an architecture has advantages in dynamic resource recruitment, fail-over management and it can also improve server performance compared to a flat architecture. The key methods we propose to make this architecture efficient are the separation of static and dynamic content processing, low overhead remote execution, and reservation-based scheduling which considers both I/O and CPU utilization. This paper provides a comparison of several scheduling approaches using experimental evaluation and analytic modeling. The results show that proper optimization in resource management can lead to over 65% performance improvement for a fixed number of nodes, and can achieve more substantial improvement when considering idle resource recruitment.
Three-dimensional structural modelling of multi-storey buildings for obtaining moment envelopes
Authors: T. M. Nahhas, M. H. Imam
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

A practical approach is presented for fast, easy and error-free generation of three-dimensional structural models of multi-storey buildings without apriori visualization of the wire frame model. Concept of a "building unit structure" is presented to generate all possible topologies and live load patterns from the data associated with the floor plan. A software package, FEMBUS, based on this concept generates ready-to-go input data files for various general-purpose structural analysis software packages. The time and effort comparisons prove that the presented approach is drastically superior to the traditional approach as well as to the current state of the art approach of the general-purpose structural analysis software packages.
Formal Verification by Symbolic Evaluation of Partially-Ordered Trajectories
Authors: Carl J Seger, Bryant,  R, E. al
Venue:  (1993)

Symbolic trajectory evaluation provides a means to formally verify properties of a sequential system by a modified form of symbolic simulation. The desired system properties are expressed in a notation combining Boolean expressions and the temporal logic ``next-time'''' operator. In its simplest form, each property is expressed as an assertion [ A =< C ], where the antecedent A expresses some assumed conditions on the system state over a bounded time period, and the consequent C expresses conditions that should result. A generalization allows simple invariants to be established and proven automatically. The verifier operates on system models in which the state space is ordered by ``information content''''. By suitable restrictions to the specification notation, we guarantee that for every trajectory formula, there is a unique weakest state trajectory that satisfies it. Therefore, we can verify an assertion [ A =< C ] by simulating the system over the weakest trajectory for A and testing adherence to C. Also, establishing invariants correspond to simple fixed point calculations. This paper presents the general theory underlying symbolic trajectory evaluation. It also illustrates the application of the theory to the task of verifying switch-level circuits as well as more abstract implementations.
Globally Convergent Homotopy Methods: A Tutorial
Authors: Layne T. Watson
Venue:  (1987)

The basic theory for probability one globally convergent homotopy algorithms was developed in 1976, and since then the theory; algorithms, and applications have considerably expanded. These are algorithms for solving nonlinear systems of (algebraic) equations, which are convergent for almost all choices of starting point. Thus they are globally convergent with probability one. They are applicable to Brouwer fixed point problems, certain classes of @erofin mg problems unconstrained optimization, linearly constrained optimization, nonlinear complementarity, and the discretizations of nonlinear two-point boundary value problems based on shooting, finite differences, collocation, and finite elements. A mathematical software package, HOMPACK, exists that implements several different strategies and handles both dense and sparse problems. Homotopy algorithms are closely related to ODE algorithms, and make heavy use of ODE techniques. Homotopy algorithms for some classes of nonlinear systems, such as polynomial systems, exhibit a large amount of coarse grain parallelism. These and other topics are discussed in a tutorial fashion.
Non-linear fire resistance analysis of reinforced concrete frames
Authors: S. Bratina, G. Turk, M. Saje, I. Planinc
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The paper deals with the non-linear structural analysis of behaviour of reinforced concrete structures in fire. The procedure consists of three separate steps. In the first step, the temperature of fire is determined. In the second, the time dependent distribution of the temperature in the structure is evaluated numerically. The third step is devoted to the time dependent mechanical response of reinforced concrete structure due to simultaneous temperature and mechanical loads. The effect of plasticity of concrete and viscous creep of steel is taken into consideration. The constitutive relationships for concrete and steel and unknown thermal parameters of the material were taken in accord with the European standards ENV 1992-1-2. The effectiveness of the proposed method is examined using an example of simply supported beam for which the experimental results were known.
History-based Access-Control For Mobile Code
Authors: Guy Edjlali, Anurag Acharya, Vipin Chaudhary
Venue:  (1998)

In this paper, we present a history-based access-control mechanism that is suitable for mediating accesses from mobile code. The key idea behind history-based access-control is to maintain a selective history of the access requests made by individual programs and to use this history to improve the differentiation between safe and potentially dangerous requests. What a program is allowed to do depends on its own behavior and identity and not the location it was loaded from or the identity of its author/provider. History-based access-control has the potential to significantly expand the set of programs that can be executed without compromising security or ease of use. We describe the design and implementation of Deeds, a history-based access-control mechanism for Java. Access-control policies for Deeds are written in Java, and can be updated while the programs whose accesses are being mediated are still executing.
Detecting Delaminations in Composite Structures Using Anti-Optimization
Authors: Jaechong Lee, Robert T. Haftka, O. H Griffin, Layne T. Watson, Mark Sensmeier
Venue:  (1994)

The present study proposes a detection technique for delaminations in a laminated composite structure. The proposed technique optimizes the spatial distribution of harmonic excitation so as to magnify the difference between the delaminated and intact structure. The technique is evaluated by numerical simulation of two-layered aluminum beams. Effects of measurement and geometric noises are included in the analysis. A finite element model for a delaminated composite, based on the layer-wise laminated plate theory in conjunction with a step function to simulate delaminations, is used.
A Metric Tool for Predicting Source Code Quality from a PDL Design
Authors: Sallie M. Henry, Calvin Selig
Venue:  (1987)

The software crisis has increased the demand for automated tools to assist software developers in the production of quality software. Quality metrics have given software developers a tool to measure software quality. These measurements, however, are available only after the software has been produced. Due to high cost, software managers are reluctant, to redesign and reimplement low quality software. Ideally, a life cycle which allows early measurement of software quality is a necessary ingredient to solving the software crisis. This paper describes an automated tool for predicting software quality at design time.