ppxscal/embedding_network huggingface dataset:
Using architectural &ldquo;families&rdquo; to increase FPGA speed and density
Authors: Vaughn Betz, Jonathan Rose
Venue: Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays (1995)

In order to narrow the speed and density gap between FPGAs and MPGAs we propose the development of &ldquo;families&rdquo; of FPGAs. Each FPGA family is targeted at a single maximum logic capacity, and consists of several &ldquo;siblings&rdquo;, or FPGAs of different yet complementary architectures. Any given application circuit is implemented in the sibling with the most appropriate architecture. With properly chosen siblings, one can develop a family of FPGAs which will have better speed and density than any single FPGA. We apply this concept to create two different FPGA families, one composed of architectures with different types of hard-wired logic blocks and the other created from architectures with different types of heterogeneous logic blocks. We found that a family composed of eight chips with different hard-wired logic block architectures simultaneously improves density by 12 to 14% and speed by 18 to 20% over the best single hard-wired FPGA.
An object-oriented tutoring system for teaching sets
Authors: H. Altay Güvenir
Venue: ACM SIGCSE Bulletin (1995)

Over the recent years several prototypes of intelligent tutoring systems for scientific subjects have been developed. Meanwhile, the object-oriented paradigm has become popular in the software engineering and artificial intelligence communities. The objective of the research presented in this paper is an application of the object-oriented paradigm to the design and implementation of an intelligent tutoring system. The domain of the system is the set theory at the secondary school level. It is shown that the inheritance hierarchy of the object-oriented paradigm is very useful in defining and organizing the components of the set theory, and in the generation of examples and questions. The issues raised in the object-oriented design of an intelligent tutoring system are discussed.
Some new results on the initial transient problem
Authors: Peter W. Glynn
Venue: Proceedings of the 27th conference on Winter simulation (1995)

This paper contains two new results pertaining to the initial transient problem for steady-state simulations. Our first result rigorously establishes the asymptotic superiority of a few long replications relative to a large number of shorter replications, assuming that no initial transient deletion is attempted. Our second result concerns an initial transient detection test proposed by Schruben; we develop asymptotics that are suggestive of the types of initial transients that the test is capable of detecting. As one might expect, the ability to detect a non-stationarity in the simulation output depends both on the magnitude of the non-stationarity of the initial condition, and the degree of autocorrelation in the process.
Active memory: a new abstraction for memory-system simulation
Authors: Alvin R. Lebeck, David A. Wood
Venue: Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems (1995)

This paper describes the active memory abstraction for memory-system simulation. In this abstraction---designed specifically for on-the-fly simulation, memory references logically invoke a user-specified function depending upon the reference's type and accessed memory block state. Active memory allows simulator writers to specify the appropriate action on each reference, including "no action" for the common case of cache hits. Because the abstraction hides implementation details, implementations can be carefully tuned for particular platforms, permitting much more efficient on-the-fly simulation than the traditional trace-driven abstraction.Our SPARC implementation, Fast-Cache, executes simple data cache simulations two or three times faster than a highly-tuned trace-driven simulator and only 2 to 7 times slower than the original program. Fast-Cache implements active memory by performing a fast table look up of the memory block state, taking as few as 3 cycles on a SuperSPARC for the no-action case. Modeling the effects of Fast-Cache's additional lookup instructions qualitatively shows that Fast-Cache is likely to be the most efficient simulator for miss ratios between 3% and 40%.
Coding-Based Replication Schemes for Distributed Systems
Authors: Gagan Agrawal, Pankaj Jalote
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

Data is often replicated in distributed systems to improve availability and performance. This replication is expensive in terms of disk storage since the existing schemes generally require full files to be stored at each site. In this paper, we present schemes which significantly reduce the storage requirements in replication based systems. These schemes use the coding method suggested by Rabin to store replicated data. The first scheme that we present is a modification of the simple voting algorithm and its quorum requirements. We then show how some of the extensions of the voting algorithm can also be modified to get storage efficient schemes for managing such replication. We evaluate the availability offered by these schemes and show that the storage space required to achieve certain availability are significantly lower than the conventional schemes with full file replication. Since coding is used, these schemes also provide a high degree of data security.Index Terms¿Availability, coding schemes, data replication, data security, disk usage, distributed databases, fault-tolerance, performance evaluation, voting protocols.
NDHORM: an OO approach to requirements modeling
Authors: Jiazhong Zhang, Zhijian Wang
Venue: ACM SIGSOFT Software Engineering Notes (1996)

In this paper, we propose an OO approach to requirement modeling, which includes a hierarchical object-oriented requirements model NDHORM and its requirements modeling procedure. The NDHORM model concentrates on capturing and simulating dynamic interaction relationships between problem objects in a real world, as well as the stepwise refinement of interacting objects during the modeling process. A behavior-directed method and its uniform notations for identifying objects, attributes, services, relationships, etc. are also provided.
From conceptual time to linguistic time
Authors: Michel Gagnon, Guy Lapalme
Venue: Computational Linguistics (1996)

In this paper, we present a method for generating French texts conveying temporal information that integrates Discourse Representation Theory (DRT) and Systemic Grammar Theory. DRT is used to represent temporal information and an intermediate semantic level for the temporal localization expressed by temporal adverbial phrases and verb phrases. This representation is then translated into a syntactic form using Systemic Grammar Theory. We have implemented this method in a working prototype called Pr&eacute;texte.
Optimal prefetching via data compression
Authors: Jeffrey Scott Vitter, P. Krishnan
Venue: Journal of the ACM (JACM) (1996)

Caching and prefetching are important mechanisms for speeding up access time to data on secondary storage. Recent work in competitive online algorithms has uncovered several promising new algorithms for caching. In this paper, we apply a form of the competitive philosophy for the first time to the problem of prefetching to develop an optimal universal prefetcher in terms of fault rate, with particular applications to large-scale databases and hypertext systems. Our prediction algorithms with particular applications to large-scale databases and hypertext systems. Our prediction algorithms for prefetching are novel in that they are based on data compression techniques that are both theoretically optimal and good in practice. Intuitively, in order to compress data effectively, you have to be able to predict future data well, and thus good data compressors should be able to predict well for purposes of prefetching. We show for powerful models such as Markov sources and mthe order Markov sources that the page fault rate incurred by our prefetching algorithms are optimal in the limit for almost all sequences of page requests.
Cognitive bias in software engineering
Authors: Webb Stacy, Jean MacMillan
Venue: Communications of the ACM (1995)

Developer's thought processes are a fundamental area of concern. Cognitive scientist have discovered that people's intiative inferences and probality judgments do not strictly conform to the laws of logic or mathematics, and that people are willing to provide plausible explanations for random events. This article examines the role these phenomena might have in software development, ultimately concluding that what are cast as one-sided software development guidelines often can be recast beneficially as two-sided trade-offs.
The philosophy of nothing and everything
Authors: Neville Holmes, Colin Hallam
Venue: ACM SIGAPL APL Quote Quad (1995)

Perhaps inspired by the IEEE floating point arithmetic standard's introduction of a representation for aberrant numbers, such as the reciprocal of zero, the J interpreter overtly deals with infinites and indeterminacies.This step got rid of some domain error messages, but brought in a few new difficulties, and exposed inconsistencies in the behaviour of elementary arithmetic functions presumably as delivered by the C compilers used for the J interpreters.This paper proposes notation that would allow the J interpreter better to deal with failures of arithmetic. The discussion should assist development of arithmetic for other interpreters and compilers.
Efficient incremental LR parsing for syntax-directed editors
Authors: Pierpaolo Degano, Stefano Mannucci, Bruno Mojana
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1988)

A technique for generating parsers which is an extension to LR techniques and is based on parsing table splitting, is presented. Then this technique is slightly extended to support incremental syntax analysis. Given a context-free grammar and a set &ldquo;IC&rdquo; of nonterminals devised to be incremental, a set of subtables is generated to drive the analysis of program fragments derivable from nonterminals in IC. The proposed technique generates parsing tables which are considerably smaller than the standard ones, even when incrementality is not exploited. Thus, these tables may be stored as arrays permitting faster access and accurate error handling. Furthermore, our tables are suitable for generating syntax-directed editors which provide a full analytic mode. The efficiency of the analytic component of a syntax-directed editor obtained in this way and its easy integration with the generative component stress the advantages of incremental program writing.
Abstract Data Views: An Interface Specification Concept to Enhance Design for Reuse
Authors: Donald D. Cowan, Carlos J. P. Lucena
Venue: IEEE Transactions on Software Engineering (1995)

The abstract data view (ADV) design model was originally created to specify clearly and formally the separation of the user interface from the application component of a software system, and to provide a systematic design method that is independent of specific application environments. Such a method should lead to a high degree of reuse of designs for both interface and application components. The material in this paper extends the concept of ADV's to encompass the general specification of interfaces between application components in the same or different computing environments. This approach to specifying interfaces clearly separates application components from each other, since they do not need to know how they are used, or how they obtain services from other application components. Thus, application components called abstract data objects (ADO's) in this paper, are designed to minimize knowledge of the environment in which they are used and should be more amenable to reuse.
A General Surface Approach to the Integration of a Set of Range Views
Authors: Marc Soucy Denis Laurendeau
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper presents a new and general solution to the problem of range view integration. The integration problem consists in computing a connected surface model from a set of registered range images acquired from different viewpoints. The proposed method does not impose constraints on the topology of the observed surfaces, the position of the viewpoints, or the number of views that can be merged. The integrated surface model is piecewise estimated by a set of triangulations modeling each canonical subset of the Venn diagram of the set of range views. The connection of these local models by constrained Delaunay triangulations yields a non-redundant surface triangulation describing all surface elements sampled by the set of range views. Experimental results show that the integration technique can be used to build connected surface models of free-form objects. No integrated models built from objects of such complexity have yet been reported in the literature. It is assumed that accurate range views are available and that frame transformations between all pairs of views can be reliably computed.
Alernating-Direction Line-Relaxation Methods on Multicomputers
Authors: Jörn Hofhaus, Eric F. Van de
Venue: SIAM Journal on Scientific Computing (1996)

We study the multicomputer performance of a three-dimensional Navier--Stokes solver based on alternating-direction line-relaxation methods. We compare several multicomputer implementations, each of which combines a particular line-relaxation method and a particular distributed block-tridiagonal solver. In our experiments, the problem size was determined by resolution requirements of the application. As a result, the granularity of the computations of our study is finer than is customary in the performance analysis of concurrent block-tridiagonal solvers. Our best results were obtained with a modified half-Gauss--Seidel line-relaxation method implemented by means of a new iterative block-tridiagonal solver that is developed here. Most computations were performed on the Intel Touchstone Delta, but we also used the Intel Paragon XP/S, the Parsytec SC-256, and the Fujitsu S-600 for comparison.
Perspectives on reuse (panel)
Authors: Lorette Cameron, Charles Berman, Brian Henderson-Sellers, Laura Hill, Randall Smith
Venue: ACM SIGPLAN Notices (1996)

Reuse is about more than sharing code. As technology, standards and ideas evolve: so do the artifacts available for reuse. Our understanding of the non-technical issues associated with reuse also progresses. This panel will look at reuse from 5 different perspectives. We will look at the reuse of design patterns and of services in a service-based, distributed architecture as examples of artifacts relatively new to the corporate world. We will also focus on the psychological factors affecting the success of reuse programs along with organizational modifications and measurement techniques that will help make reuse work. Lastly, we will take a look at how certain kinds of reuse can affect the success of a project at the user level, and what this might imply for measuring the effectiveness of our reuse programs. The audience will leave with some concrete ideas about how to implement and measure reuse program as well as new thoughts on what artifacts may be reused.
Unsupervised mutual information criterion for elimination of overtraining in supervised multilayer networks
Authors: G. Deco, W. Finnoff, H. G. Zimmermann
Venue: Neural Computation (1995)

Controlling the network complexity in order to prevent overfitting is one of the major problems encountered when using neural network models to extract the structure from small data sets. In this paper we present a network architecture designed for use with a cost function that includes a novel complexity penalty term. In this architecture the outputs of the hidden units are strictly positive and sum to one, and their outputs are defined as the probability that the actual input belongs to a certain class formed during learning. The penalty term expresses the mutual information between the inputs and the extracted classes. This measure effectively describes the network complexity with respect to the given data in an unsupervised fashion. The efficiency of this architecture/penalty-term when combined with backpropagation training, is demonstrated on a real world economic time series forecasting problem. The model was also applied to the benchmark sunspot data and to a synthetic data set from the statistics community.
Addressing techniques used in database object managers O2 and ORION
Authors: André Gamache, Nadjiba Sahraoui
Venue: ACM SIGMOD Record (1995)

Addressing mechanisms used by the new generation of Data Base Management Systems (DBMS) differ significantly from traditional ones. Such changes are the direct result of new applications requirements such as office information systems (OIS) and computer aided design (CAD). In this context, object format requires different representations on disk and in main memory, and this is often valid for interobject references. It is evident that these mechanisms are closely linked to the mode of object-identity implementation, as well as clustering strategies. All of these functions are controlled by the object manager.This article describes these mechanisms through the implementation of two object managers for object-oriented DBMS: O2 and ORION. We show how the performance of these systems depends on their memory management and addressing scheme. The two managers to be discussed merges techniques proposed by both data base field and object-oriented programming field. Their own mechanism differs, according to the way it handles distribution. ORION-1SX and O2 have a Client/Server architecture, but each one uses a different approach for distributing of functionalities. ORION-1SX implements an object-server, whereas O2 uses a page-server approach. An analysis of the two systems shows that they both use a two-level addressing mechanism. buffer management for objects in memory is diffent and more complex in ORION. On the other hand, the clustering strategies in O2 have the advantage of being more dynamic and can be specified outside the schema.
Understanding application performance on shared virtual memory systems
Authors: Liviu Iftode, Jaswinder Pal Singh, Kai Li
Venue: Proceedings of the 23rd annual international symposium on Computer architecture (1996)

Many researchers have proposed interesting protocols for shared virtual memory (SVM) systems, and demonstrated performance improvements on parallel programs. However, there is still no clear understanding of the performance potential of SVM systems for different classes of applications. This paper begins to fill this gap, by studying the performance of a range of applications in detail and understanding it in light of application characteristics.We first develop a brief classification of the inherent data sharing patterns in the applications, and how they interact with system granularities to yield the communication patterns relevant to SVM systems. We then use detailed simulation to compare the performance of two SVM approaches---Lazy Released Consistency (LRC) and Automatic Update Release Consistency (AURC)---with each other and with an all-hardware CC-NUMA approach. We examine how performance is affected by problem size, machine size, key system parameters, and the use of less optimized program implementations. We find that SVM can indeed perform quite well for systems of at leant up to 32 processors for several nontrivial applications. However, performance is much more variable across applications than on CC-NUMA systems, and the problem sizes needed to obtain good parallel performance are substantially larger. The hardware-assisted AURC system tends to perform significantly better than the all-software LRC under our system assumptions, particularly when realistic cache hierarchies are used.
Digital libraries, value, and productivity
Authors: Gio Wiederhold
Venue: Communications of the ACM (1995)

A digital library is popularly viewed an electronic version of a public library. But replacing paper by electronic storage leads to three major differences: storage in digital form, direct communication to obtain material, and copying from a master version. These differences in turn lead to a plethora of further differences, so that eventually the digital library no longer mimics the traditional library. Furthermore, a library is only element in the process of creating, storing, culling, accessing, selecting, and distributing information to customers. While the technical focus of digital library research is on the central functions of storage and access, major changes will occur in the interaction within the new systems.
Understanding the requirements for information system documentation: an empirical investigation
Authors: Abdulaziz Jazzar, Walt Scacchi
Venue: Proceedings of conference on Organizational computing systems (1995)

Software and Information Systems (IS) documents are a common product of large IS development efforts. These documents are produced and consumed through a variety of documentation processes. These processes involve developers and users working within complex organizational settings, as well as with the focal system under development. These organizational settings facilitate and constrain IS documentation and development efforts in complicated ways. Accordingly, we present, analyze, and compare cases from field studies of three different IS development efforts in a large industrial corporation. Based on these studies, we identify a new set of variables and hypotheses that we believe represent a more plausible set of requirements for IS documentation products and processes in different organizational settings. In this regard, we utilize the concept of viewing IS documentation requirements as hypotheses to be tested, refined, or refuted.
Height as a coefficient bound for univariate polynomial factors, part II
Authors: Zhuojun Liu, Paul S. Wang
Venue: ACM SIGSAM Bulletin (1994)

Consider any degree-n polynomial u(x) isin; Z[x] that is square-free and an * an a0 ne; 0. An efficient algorithm is given to test if u(x) is ring-ordinary. Let[EQUATION]
Toeplitz-circulant Preconditioners for Toeplitz Systems and Their Applications to Queueing Networks with Batch Arrivals
Authors: Raymond H. Chan, Wai-Ki Ching
Venue: SIAM Journal on Scientific Computing (1996)

The preconditioned conjugate gradient method is employed to solve Toeplitz systems $T_n {\bf x} ={\bf b}$ where the generating functions of the $n$-by-$n$ Toeplitz matrices $T_n$ are functions with zeros. In this case, circulant preconditioners are known to give poor convergence, whereas band-Toeplitz preconditioners offer only linear convergence and can handle only real-valued functions with zeros of even orders. We propose here preconditioners which are products of band-Toeplitz matrices and circulant matrices. The band-Toeplitz matrices are used to cope with the zeros of the given generating function and the circulant matrices are used to speed up the convergence rate of the algorithm. Our preconditioner can handle complex-valued functions with zeros of arbitrary orders. We prove that the preconditioned Toeplitz matrices have singular values clustered around 1 for large $n$. We apply our preconditioners to solve the stationary probability distribution vectors of Markovian queueing models with batch arrivals. We show that if the number of servers is fixed independent of the queue size $n$, then the preconditioners are invertible and the preconditioned matrices have singular values clustered around 1 for large $n$. Numerical results are given to illustrate the fast convergence of our methods.