ppxscal/embedding_network huggingface dataset:
Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines
Authors: Wu-chun Feng, Jane W.-S. Liu
Venue: IEEE Transactions on Software Engineering (1997)

This paper describes algorithms for scheduling preemptive, imprecise, composite tasks in real-time. Each composite task consists of a chain of component tasks, and each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the processing times of its mandatory and optional parts may become larger. The composite tasks are scheduled by a two-level scheduler. At the high level, the composite tasks are scheduled preemptively on one processor, according to an existing algorithm for scheduling simple imprecise tasks. The low-level scheduler then distributes the time budgeted for each composite task across its component tasks so as to minimize the output error of the composite task
Topographical Properties of Generic Images
Authors: J. H. Rieger
Venue: International Journal of Computer Vision (1997)

Topographical curves in images are defined by certain extremality conditions involving the gradient of the greyvalue function. Curves extracted by some edge operators and watersheds studied in geography are both examples of such topographical curves.In the first part of this article we list the possible geometrical features of certain topographical curves&mdash;such as intersection points, singular points, endpoints, curvature extrema and inflections&mdash;for generic images and for generic 1-parameter families of, linearly or non-linearly, diffused images (intuitively, generic phenomena arise with probability 1).In a second experimental part the same topographical curves are computed in discrete images and in Gaussian blurred families of images. It turns out that the geometrical features of the smooth classification also figure in these discrete approximations. The consequences of these results for edge-linking algorithms are briefly discussed.
Frame rate as a QoS parameter and its influence on speech perception
Authors: Kaoru Nakazono
Venue: Multimedia Systems (1998)

The preservation of QoS for multimedia traffic through a data network is a difficult problem. We focus our attention on video frame rate and study its influence on speech perception.When sound and picture are discrepant (e.g., acoustic 'ba' combined with visual 'ga'), subjects perceive a different sound (such as 'da'). This phenomenon is known as the McGurk effect. In this paper, the influence of degraded video frame rate on speech perception is studied.It is shown that, when flame rate decreases, correct hearing is improved for discrepant stimuli and is degraded for congruent (voice and picture are the same) stimuli. Furthermore, we studied the case where lip closure was always captured by the synchronization of sampling time and lip position. In this case, frame rate has little effect on mishearing for congruent stimuli. For discrepant stimuli, mishearing is decreased with degraded frame rate. These results indicate that the stiff motion of lips resulting from low frame rate cannot give enough labial information for speech perception. In addition, the effect of delaying the picture to correct for low frame rate was studied. The results, however, were not as definitive as expected, because of compound effects related to the synchronization of sound and picture. Finally, we inspected the still pictures of normal Japanese speech and determined a lower limit of frame rate from the view point of assisting hearing.
Locally Weighted Learning for Control
Authors: Christopher G. Atkeson, Andrew W. Moore, Stefan Schaal
Venue: Artificial Intelligence Review (1997)

Lazy learning methods provide useful representations and training algorithms for learning about complex phenomena during autonomous adaptive control of complex systems. This paper surveys ways in which locally weighted learning, a type of lazy learning, has been applied by us to control tasks. We explain various forms that control tasks can take, and how this affects the choice of learning paradigm. The discussion section explores the interesting impact that explicitly remembering all previous experiences has on the problem of learning to control.
GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
Authors: Shao-Liang Zhang
Venue: SIAM Journal on Scientific Computing (1997)

Recently Bi-CGSTAB as a variant of Bi-CG has been proposed for solving nonsymmetric linear systems, and its attractive convergence behavior has been confirmed in many numerical experiments. Bi-CGSTAB can be characterized by its residual polynomial which consists of the product of the residual polynomial of Bi-CG with other polynomials generated from two-term recurrence relations. In this paper, we propose a unified way to generalize a class of product-type methods whose residual polynomials can be factored by the residual polynomial of Bi-CG and other polynomials with standard three-term recurrence relations. Such product-type methods which are based on Bi-CG can be regarded as generalizations of Bi-CGSTAB. From the unified way, the well-known variants of the product-type methods, like CGS, Bi-CGSTAB, Bi-CGSTAB2, are reacquired again.
Approximately Counting Hamilton Paths and Cycles in Dense Graphs
Authors: Martin Dyer, Alan Frieze, Mark Jerrum
Venue: SIAM Journal on Computing (1998)

We describe fully polynomial randomized approximation schemes for the problems of determining the number of Hamilton paths and cycles in an n-vertex graph with minimum degree $(\frac{1}{2}+\a)n$, for any fixed a > 0. We show that the exact counting problems are \#P-complete. We also describe fully polynomial randomized approximation schemes for counting paths and cycles of all sizes in such graphs.
Verifying Authentication Protocols in CSP
Authors: Steve Schneider
Venue: IEEE Transactions on Software Engineering (1998)

This paper presents a general approach for analysis and verification of authentication properties using the theory of Communicating Sequential Processes (CSP). The paper aims to develop a specific theory appropriate to the analysis of authentication protocols, built on top of the general CSP semantic framework. This approach aims to combine the ability to express such protocols in a natural and precise way with the ability to reason formally about the properties they exhibit. The theory is illustrated by an examination of the Needham-Schroeder Public-Key protocol. The protocol is first examined with respect to a single run and then more generally with respect to multiple concurrent runs.
Monadic state: axiomatization and type safety
Authors: John Launchbury, Amr Sabry
Venue: ACM SIGPLAN Notices (1997)

Type safety of imperative programs is an area fraught with difficulty and requiring great care. The SML solution to the problem, originally involving imperative type variables, has been recently simplified to the syntactic-value restriction. In Haskell, the problem is addressed in a rather different way using explicit monadic state. We present an operational semantics for state in Haskell and the first full proof of type safety. We demonstrate that the semantic notion of value provided by the explicit monadic types is able to avoid any problems with generalization.
Manufacturing simulation consultant's forum
Authors: F. Bradley Armstrong, Bennett Foster, Charles Kern, Randall Gibson, Darrell Starks
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Consultants are an important segment of the manufacturing simulation community because they are on the forefront of change and innovation. From their position they have much to offer the rest of the community. This session offers the panelists and audience the opportunity to share their thoughts and views on communication issues when conducting manufacturing simulation projects.
Performance of self-taught documents: exploiting co-relevance structure in a document collection
Authors: Abraham Bookstein
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

In this paper we study the behavior of an information retrieval system in which index terms are assigned at random to both documents and requests. The random indexing is then modified by means of a feedback mechanism derived from a normal probability model and applied to both the request and document representations. Of interest is the convergence properties of the representation vectors. After few feedback iterations, it is found that well defined clusters form that accurately represent the corelevance structure among the documents&mdash;in effect the feedback mechanism has permitted the documents to index themselves. This approach offers an interesting way to extend the dimensionality of the indexing vocabulary. Both this application and a theoretical analysis of the impact of extending the indexing vocabulary are discussed.
Complex problems: what's the next step?
Authors: Arthur G. Elser
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1997)

Technical communicators often document products that are used in complex technical and business domains. Traditional minimalist and task documentation works well for teaching the basic use of the tools, but at some point, many users need more information to help them make complex decisions about using the tool. We need to involve customers as partners on development teams to help design the product for ease of use and the documentation for ease of learning to use the tool for complex decision making. Researchers need to study how expert users integrate tools into their decision-making processes to provide the rationale and strategies for best documenting these complex uses of the tools.
Global Word Shape Processing in Off-Line Recognition of Handwriting
Authors: Christophe Parisse
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1996)

Off-line recognition of handwriting may be achieved using simplified profiles of word shapes. These profiles consist of approximations of the word's upper and lower contour. Training and recognition are based on n-gram extraction and identification. The lexicons used extend to 16,000 words.
Combining Expert Judgment by Hierarchical Modeling: An Application to Physician Staffing
Authors: Joseph Lipscomb, Giovanni Parmigiani, Vic Hasselblad
Venue: Management Science (1998)

Expert panels are playing an increasingly important role in U.S. health policy decision making. A fundamental issue in these applications is how to synthesize the judgments of individual experts into a group judgment. In this paper we propose an approach to synthesis based on Bayesian hierarchical models, and apply it to the problem of determining physician staffing at medical centers operated by the U.S. Department of Veteran Affairs (VA). Our starting point is the supra-Bayesian approach to synthesis, whose principal motivation in the present context is to generate an estimate of the uncertainty associated with a panel's evaluation of the number of physicians required under specified conditions. Hierarchical models are particularly natural in this context since variability in the experts' judgments results in part from heterogeneity in their baseline experiences at different VA medical centers. We derive alternative hierarchical Bayes synthesis distributions for the number of physicians required to handle the (service-mix specific) daily workload in internal medicine at a given VA medical center (VAMC). The analysis appears to be the first to provide a statistical treatment of expert judgment processes for evaluating the appropriate use of resources in health care. Also, while hierarchical models are well established, their application to the synthesis of expert judgment is novel.
Why partial design verification works better than it should
Authors: Jacob Savir
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

The problem of verifying the correctness of a combinatorial design is known to be NP complete. Nevertheless, most products reaching the consumer are functionally correct. This paper attempts to explain this phenomenon by sizing the effort of going through less than perfect design verification process and explaining why many design errors are relatively easily caught.
Existence of Incomplete Transversal Designs with BlockSize Five and Any Index &lambda;
Authors: R. J. R. Abel, Charles J. Colbourn, Jianxing Yin, Hantao Zhang
Venue: Designs, Codes and Cryptography (1997)

The basic necessary condition for the existence of a TD(5, &lambda;; v)-TD(5, &lambda;; u), namely v &ge; 4u, is shown to be sufficient for any &lambda; &ge; 1, except when (v, u) = (6, 1) and &lambda; = 1, and possibly when (v, u) = (10, 1) or (52, 6) and &lambda; = 1. For the case &lambda; = 1, 86 new incomplete transversal designs are constructed. Several construction techniques are developed, and some new incomplete TDs with block size six and seven are also presented.
A Non-interactive Public-Key Distribution System
Authors: Ueli M. Maurer, Yacov Yacobi
Venue: Designs, Codes and Cryptography (1996)

An identity-based non-interactive public key distribution system is presented that is based on a novel trapdoor one-way function allowing a trusted authority to compute the discrete logarithms modulo a publicly known composite number m while this is infeasible for an adversary not knowing the factorization of m. Without interaction with a key distribution center or with the recipient of a given message, a user can generate a mutual secure cipher key based solely on the recipient's identity and his own secret key, and subsequently send the message, encrypted with the generated cipher used in a conventional cipher, over an insecure channel to the recipient. In contrast to previously proposed identity-based systems, no public keys, certificates for public keys or other information need to be exchanged and thus the system is suitable for certain applications that do not allow for interaction. The paper solves an open problem proposed by Shamir in 1984.
Performance evaluation and prediction for parallel algorithms on the BBN GP1000
Authors: François Bodin, Daniel Windheiser, William Jalby, Daya Atapattu, Mannho Lee, Dennis Gannon
Venue: Proceedings of the 4th international conference on Supercomputing (1990)

The techniques of &ldquo;load/store&rdquo; memory reference modeling is based on deriving performance characteristics of the memory architecture of a computer by looking at the behavior of simple sequences of load, store and nop (null operation) instructions. The resulting data base can be used to match load/store templates against algorithm kernels to predict performance or as a source of data for testing analytical models of the architecture. In this paper we study the BBN GP1000 parallel processing system. We show how to build a subset of the load/store kernels needed to characterize the machine and illustrate the behavior of a simple model based on the data.
On the use of regular expressions for searching text
Authors: Charles L. A. Clarke, Gordon V. Cormack
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1997)

The use of regular expressions for text search is widely known and well understood. It is then surprising that the standard techniques and tools prove to be of limited use for searching structured text formatted with SGML or similar markup languages. Our experience with structured text search has caused us to reexamine the current practice. The generally accepted rule of &ldquo;leftmost longest match&rdquo; is an unfortunate choice and is at the root of the difficulties. We instead propose a rule which is semantically cleaner. This rule is generally applicable to a variety of text search applications, including source code analysis, and has interesting properties in its own right. We have written a publicly available search tool implementing the theory in the article, which has proved valuable in a variety of circumstances.
Fine-grain multithreading with minimal compiler support&mdash;a cost effective approach to implementing efficient multithreading languages
Authors: Kenjiro Taura, Akinori Yonezawa
Venue: ACM SIGPLAN Notices (1997)

It is difficult to map the execution model of multithreading languages (languages which support fine-grain dynamic thread creation) onto the single stack execution model of C. Consequently, previous work on efficient multithreading uses elaborate frame formats and allocation strategy, with compilers customized for them. This paper presents an alternative cost-effective implementation strategy for multithreading languages which can maximally exploit current sequential C compilers. We identify a set of primitives whereby efficient dynamic thread creation and switch can be achieved and clarify implementation issues and solutions which work under the stack frame layout and calling conventions of current C compilers. The primitives are implemented as a C library and named StackThreads. In StackThreads, a thread creation is done just by a C procedure call, maximizing thread creation performance. When a procedure suspends an execution, the context of the procedure, which is roughly a stack frame of the procedure, is saved into heap and resumed later. With StackThreads, the compiler writer can straightforwardly translate sequential constructs of the source language into corresponding C statements or expressions, while using StackThreads primitives as a blackbox mechanism which switches execution between C procedures.
On-line knowledge-based simulation for FMS: a state of the art survey
Authors: Lissette R. Gonzalez, Marelys L. Garcia, Martha A. Centeno
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Simulation modeling has been widely used to study many aspects of FMS design, planing and control. Yet, simulation modeling still offers other capabilities that are proven to be effective for the on-line control of FMS. An example of it is the training of neural nets off-line, so that it will later control the decision making process when the FMS is in operation. if the neural net runs out of knowledge, it turns back to a simulation model to learn new situations. In this paper, we review the various ways in which on-line knowledge-based simulation for FMS has been approached. This paper represents the early stages of on-going research efforts at Florida International University.
Off-Line Signature Verification by Local Granulometric Size Distributions
Authors: Robert Sabourin, Ginette Genest, Françoise J. Prêteux
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

A fundamental problem in the field of off-line signature verification is the lack of a signature representation based on shape descriptors and pertinent features. The main difficulty lies in the local variability of the writing trace of the signature which is closely related to the identity of human beings. In this paper, we propose a new formalism for signature representation based on visual perception. A signature image consists of 512 × 128 pixels and is centered on a grid of rectangular retinas which are excited by local portions of the signature. Granulometric size distributions are used for the definition of local shape descriptors in an attempt to characterize the amount of signal activity exciting each retina on the focus of the attention grid. Experimental evaluation of this scheme is made using a signature database of 800 genuine signatures from 20 individuals. Two types of classifiers, a Nearest Neighbor and a threshold classifier, show a total error rate below 0.02 percent and 1.0 percent, respectively, in the context of random forgeries.
SOLO: a generator of efficient layouts from optimized MOS circuit schematics
Authors: Donald G. Baltus, Jonathan Allen
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper describes SOLO, a program for mapping arbitrary MOS circuit schematics into efficient corresponding layouts. SOLO employs a layout strategy which allows it to be applied to circuits with sized transistors as well as to circuits which include unequal numbers of n-MOS and p-MOS transistors. The program can effectively be applied to module-size circuits including up to roughly 200 transistors.
Compositional references for stateful functional programming
Authors: Koji Kagawa
Venue: Proceedings of the second ACM SIGPLAN international conference on Functional programming (1997)

We introduce the notion of compositional references into the framework of monadic functional programming and propose a set of new primitives based on this notion. They enable us to use a wide range of mutable data structures. There, references may be passed around explicitly, or mutable data structures such as arrays and tuples may be passed implicitly as hidden state. The former style is called the explicit style and is usually more expressive, while the latter is called the implicit style and has simpler semantics. We investigate the relation between the two styles and discus implementation issues.
Simulating a proposed information delivery system
Authors: Eugenio M. Alvarez, Paul R. Mitchell, Walter M. Callahan, Peter Hoefer, Raymond Telerole
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper describes the results of a simulation analysis of hardware designs for a proposed data delivery system. The system is to serve clients of a large accounting firm. Once the required hardware components were identified, and their system parameters and response times estimated, the design of such a system required selection of components in a way to optimize specific performance characteristics. Simulation was used to understand the performance of the system, and to help with decisions on the components to be used.
Working-memory failure in phone-based interaction
Authors: Brian R. Huguenard, F. Javier Lerch, Brian W. Junker, Richard J. Patz, Robert E. Kass
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (1997)

This article investigates working-memory (WM) failure in phone-based interaction (PBI). We used a computational model of phone-based interaction (PBI USER) to generate predictions about the impact of three factors on WM failure:PBI features (i.e. menu structure), individual differences (i.e., WM capacity), and task characteristics (i.e., number of tasks). Our computational model stipulates that both the storage and the processing of information contribute to WM failure. In practical terms the model and the empirical results indicate that, contrary to guidelines for the design of phone-based interfaces, deep menu hierarchies (no more than three options per menu) do not reduce WM error rates in PBI. At a more theoretical level, the study shows that the use of a computational model in HCI research provides a systematic approach for explaining complex empirical results.
Filter-based model checking of partial systems
Authors: Matthew B. Dwyer, Corina S. Pasareanu
Venue: Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering (1998)

Recent years have seen dramatic growth in the application of model checking techniques to the validation and verification of correctness properties of hardware, and more recently software, systems. Most of this work has been aimed at reasoning about properties of complete systems. This paper describes an automatable approach for building finite-state models of partially defined software systems that are amenable to model checking using existing tools. It enables the application of existing model checking tools to system components taking into account assumptions about the behavior of the environment in which the components will execute. We illustrate the application of the approach by validating and verifying properties of a reusable parameterized programming framework.