ppxscal/embedding_network huggingface dataset:
Scalable hybrid verification of complex microprocessors
Authors: Maher Mneimneh, Fadi Aloul, Chris Weaver, Saugata Chatterjee, Karem Sakallah, Todd Austin
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

We introduce a new verification methodology for modern micro-processors that uses a simple checker processor to validate the exe-cution of a companion high-performance processor. The checker can be viewed as an at-speed emulator that is formally verified to be compliant to an ISA specification. This verification approach en-ables the practical deployment of formal methods without impact-ing overall performance.
Algorithm 812: BPOLY: An object-oriented library of numerical algorithms for polynomials in Bernstein form
Authors: Yi-Feng Tsai, Rida T. Farouki
Venue: ACM Transactions on Mathematical Software (TOMS) (2001)

The design, implementation, and testing of a C++ software library for univriate polynomials in Bernstein form is described. By invoking the class environment and operator overloading, each polynomial in an expression is interpreted as an object compatible with the arithmetic operations and other common functions (subdivision, degree, elevation, differentiation and integration, compoistion, greatest common divisor, real-root solving, etc.) for polynomials in Bernstein form. The library allows compact and intuitive implementation of lengthy manipulation of Bernstein-form polynomials, which often arise in computer graphics and computer-aided design and manufacturing applications. A series of empirical tests indicates that the library functions are typically very accurate and reliable, even for polynomials of surprisingly high degree.
MIETTA &mdash; a framework for uniform and multilingual access to structured database and Web information
Authors: Feiyu Xu, Klaus Netter, Holger Stenzhorn
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

We describe a WWW-based information system called MIETTA, which allows uniform and multilingual access to heterogenous data sources in the tourism domain. The design of the search engine is based on a new crosslingual framework. The framework integrates a crosslingual retrieval strategy with a strategy using natural language techniques: information extraction and multilingual generation. The combination of information extraction and multilingual generation enables on the one hand, multilingual presentation of the database content, and on the other hand, free text crosslingual information retrieval of the structured data entries. We will demonstrate that the new framework is useful for domain specific and multilingual applications.
A Hierarchical Approach to Formal Semantics With Application to the Definition of PL/ CS
Authors: Robert L. Constable, James E. Donahue
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1979)

We describe a means of presenting hierarchically organized formal definitions of programming languages using the denotational approach of D. Scott and C. Strachey. As an example of our approach, we give the semantics of PL/CS, an instructional variant of PL/I. We also discuss the implications of this approach to language design, pointing out some cases where the wrong choices may cause the hierarchy to collapse into chaotic rubble.
Does organisation by similarity assist image browsing?
Authors: Kerry Rodden, Wojciech Basalaj, David Sinclair, Kenneth Wood
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

In current systems for browsing image collections, users are presented with sets of thumbnail images arranged in some default order on the screen. We are investigating whether it benefits users to have sets of thumbnails arranged according to their mutual similarity, so images that are alike are placed together. There are, of course, many possible definitions of &ldquo;similarity&rdquo;: so far we have explored measurements based on low-level visual features, and on the textual captions assigned to the images. Here we describe two experiments, both involving designers as the participants, examining whether similarity-based arrangements of the candidate images are helpful for a picture selection task. Firstly, the two types of similarity-based arrangement were informally compared. Then, an arrangement based on visual similarity was more formally compared with a control of a random arrangement. We believe this work should be of interest to anyone designing a system that involves presenting sets of images to users.
NetSTAT: a network-based intrusion detection system
Authors: Giovanni Vigna, Richard A. Kemmerer
Venue: Journal of Computer Security (1999)

Network-based attacks are becoming more common and sophisticated. For this reason, intrusion detection systems are now shifting their focus from the hosts and their operating systems to the network itself. Network-based intrusion detection is challenging because network auditing produces large amounts of data, and different events related to a single intrusion may be visible in different places on the network. This paper presents a new approach that applies the State Transition Analysis Technique (STAT) to network intrusion detection. Network-based intrusions are modeled using state transition diagrams in which states and transitions are characterized in a networked environment. The target network environment itself is represented using a model based on hypergraphs. By using a formal model of both the network to be protected and the attacks to be detected the approach is able to determine which network events have to be monitored and where they can be monitored, providing automatic support for configuration and placement of intrusion detection components.
The Concept of Operational Rank Extractor
Authors: Ion E. Opris
Venue: Analog Integrated Circuits and Signal Processing (2000)

An operational rank extractor (ORE) is introduced in this paper as an operational amplifier having rank extractors at its inputs. This versatile building block can implement a variety of nonlinear transfer functions such as a dead-zone amplifier, a limiter, a full-wave rectifier, and a tri-state comparator (including hysteretic behavior). A 6-input circuit has been implemented in a 2 &mu;m CMOS process. The total silicon area is 460 \times 100\,\mu\hbox{m}^{2}, and the circuit dissipates 0.7 mW from a single 5 V supply. Various circuit configurations are analyzed theoretically, and experimental results are also provided.
Structured multiprogramming
Authors: Per Brinch Hansen
Venue: Communications of the ACM (1972)

This paper presents a proposal for structured representation of multiprogramming in a high level language. The notation used explicitly associates a data structure shared by concurrent processes with operations defined on it. This clarifies the meaning of programs and permits a large class of time-dependent errors to be caught at compile time. A combination of critical regions and event variables enables the programmer to control scheduling of resources among competing processes to any degree desired. These concepts are sufficiently safe to use not only within operating systems but also within user programs.
Ages of avatar: community building for inhabited television
Authors: Mike Craven, Steve Benford, Chris Greenhalgh John Wyver, Claire-Janine Brazier, Amanda Oldroyd, Tim Regan
Venue: Proceedings of the third international conference on Collaborative virtual environments (2000)

In this paper we describe and analyse the community building process for Ages of Avatar, a set of on-line Collaborative Virtual Environments created in MicrosoftVirtual Worlds, which form part of an ongoing experiment in Inhabited Television, aiming to merge CVEs and broadcast media. We describe the means by which the CVEs were launched, promoted and supported alongside a television broadcast channel, and how actions of viewers acting as inhabitants in the CVE can be used to provide broadcast material. We explain how the world content and their super-structure were managed to encourage the growth of a community over a short period of time. Using logs of activities in the worlds we deduce some of the characteristics of the community which was formed.
On improving the worst case running time of the Boyer-Moore string matching algorithm
Authors: Zvi Galil
Venue: Communications of the ACM (1979)

It is shown how to modify the Boyer-Moore string matching algorithm so that its worst case running time is linear even when multiple occurrences of the pattern are present in the text.
Noncanonical SLR(1) Grammars
Authors: Kou-Chung Tai
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1979)

Two noncanonical extensions of the simple LR(1) (SLR(1)) method are presented, which reduce not only handles but also other phrases of sentential forms. A class of context-free grammars called leftmost SLR(1) (LSLR(1)) is defined by using lookahead symbols which appear in leftmost derivations. This class includes the SLR(1), reflected SMSP, and total precedence grammars as proper subclasses. The class of LSLR(1) languages properly includes the deterministic context-free languages, their reflections, and total precedence languages. By requiring that phrases which have been scanned be reduced as early as possible, a larger class of context-free grammars called noncanonical SLR(1) (NSLR(1)) is defined. The NSLR(1) languages can be recognized deterministically in linear time using a two-stack pushdown automaton. An NSLR(1) parser generator has been implemented. Empirical results show that efficient NSLR(1) parsers can be constructed for some non-LR grammars which generate nondeterministic languages. Applications of the NSLR(1) method to improve the parsing and translation of programming languages are discussed.
TALL&mdash;a list processor for the Philco 2000 computer
Authors: Julian Feldman
Venue: Communications of the ACM (1962)

Several of the computer languages that are oriented toward problems in symbol manipulation use a list type of memory organization.1 The advantages of such a memory organization have been discussed elsewhere and will not be repeated here. The purpose of this note is to describe the method used in realizing a list language on the Philco 2000. Information Processing Language V (IPL-V) was chosen as the source language for the list processor for the 2000 because this language has been well documented and has been implemented on several computers.2 Heretofore, IPL-V has been implemented as an interpretive system. The interpretive system has three major components: (1) a loader which translates card images into internal machine words; (2) an interpreter which decodes instructions; and (3) a set of primitive processes, the &ldquo;J's,&rdquo; which make up the bulk of the instruction vocabulary. The implementation of such an interpretive system has been a rather lengthy procedure usually estimated as taking six man-months.
Efficient tools for power annotation of visual contents: a lexicographical approach
Authors: Youngchoon Park
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

Techniques for content-based image or video retrieval are not mature enough to recognize visual semantic completely. Whereas retrieval based on color, size, texture and shape are within the state of the art, our investigations on human factor analysis indicate that it is necessary to use captions or text annotations that are associated with photos and videos in content access of visual data. In this paper, a framework for integration of textual and visual content searching mechanism is presented. The framework includes ontology-based semantic query expansion, database navigation in a conceptual hierarchy, and a computational model for degree of term similarity calculation. The proposed method is embedded and evaluated in our novel content-based image database system called PicDB&trade;.
Scanned-display computer graphics
Authors: A. Michael Noll
Venue: Communications of the ACM (1971)

A television-like scanned-display system has been successfully implemented on a Honeywell DDP-224 computer installation. The scanned image is stored in the core memory of the computer, and software scan conversion is used to convert the rectangular coordinates of a point to the appropriate word and bit in an output display array in core storage. Results thus far indicate that flicker-free displays of large amounts of data are possible with reasonably fast graphical interaction. A scanned image of size 240 X 254 points is displayed at a 30 frame-per-second rate.
Identifying an appropriate view of software components for undergraduate education
Authors: Allen Parrish, Joe Hollingsworth, Peter Maurer, Benjamin Shults, Bruce Weide
Venue: ACM SIGCSE Bulletin (2001)

Software components have existed in one form or another for a number of years. Work in this area can be classified into two broad categories. On the one hand, a number of researchers have approached the concept of software components from a first principles perspective, advancing ideas regarding what constitutes the ideal component paradigm from perspectives of efficiency, verifiability and reusability. On the other hand, recent commercial advances in a number of popular technologies have elevated the software component concept into widespread use within the software practitioner community. Such technologies include a number of technologies made popular by Microsoft (such as Active-X, COM, DCOM and Visual Basic), as well as CORBA and Java Beans.Neither of these perspectives on software components has become a standard cornerstone of software development pedagogy. Yet both perspectives may have an important role in preparing software developers to build high-quality software in the context of modern software development technologies. In particular, teaching students how to design and construct software components from first principles provides students with important guidance as to the "right way" to structure correct and efficient software systems (i.e., with emphasis on "what" component-based systems should contain). On the other hand, teaching students about current commercial component technologies exposes students to the important dimension of best commercial practice (i.e., with emphasis on "how" component-based systems could be built).The participants of this panel are all actively involved in the development of courses and curricula that provide various perspectives on component-based systems. They represent both the first principles and commercial perspectives discussed above. Position statements for each of the panelists appear below.
Orthogonal transform processor cores based on discrete cosine transform (abstract only)
Authors: Anatoly Melnyk, Al Khatib Ahmad
Venue: Proceedings of the symposium on Contemporary computing in Ukraine (2000)

The conception of orthogonal transforms (OT) processors design is proposed. It is based on the choice of discrete cosine transform to serve basic transform for all other OT. The algorithms of OT calculating based on cosine transform are developed. An architecture of the multifunctional OT processor based on cosine transform and the architectures of the single-functional OT processors based on cosine transform are proposed.
A penny-matching program
Authors: Elizabeth Wall, Richard M. Brown
Venue: Communications of the ACM (1963)

The logic of a penny-matching program written for the CSX-1 is described.
Parametric Analysis of Computer Systems
Authors: Farn Wang
Venue: Formal Methods in System Design (2000)

A general parametric analysis problem which allows the use of parameter variables in both the real-time automata and the specifications is proposed and solved. The analysis algorithm is much simpler and can run more efficiently in average cases than can previous works.
The AED free storage package
Authors: Douglas T. Ross
Venue: Communications of the ACM (1967)

The most fundamental underlying problem in sophisticated software systems involving elaborate, changing data structure is dynamic storage allocation for flexible problem modeling. The Free Storage Package of the AED-1 Compiler System allows blocks of available storage to be obtained and returned for reuse. The total available space is partitioned into a hierarchy of free storage zones, each of which has its own characteristics. Blocks may be of any size, and special provisions allow efficient handling of selected sizes, control of shattering and garbage collection, and sharing of physical space between zones. The routines of the package perform high level functions automatically, but also allow access and control of fine internal details as well.
Incrementalized pointer and escape analysis
Authors: Frédéric Vivien, Martin Rinard
Venue: ACM SIGPLAN Notices (2001)

We present a new pointer and escape analysis. Instead of analyzing the whole program, the algorithm incrementally analyzes only those parts of the program that may deliver useful results. An analysis policy monitors the analysis results to direct the incremental investment of analysis resources to those parts of the program that offer the highest expected optimization return. Our experimental results show that almost all of the objects are allocated at a small number of allocation sites and that an incremental analysis of a small region of the program surrounding each site can deliver almost all of the benefit of a whole-program analysis. Our analysis policy is usually able to deliver this benefit at a fraction of the whole-program analysis cost.
A methodology for testing spreadsheets
Authors: Gregg Rothermel, Margaret Burnett, Lixin Li, Christopher Dupuis, Andrei Sheretov
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2001)

Spreadsheet languages, which include commercial spreadsheets and various research systems, have had a substantial impact on end-user computing. Research shows, however, that spreadsheets often contain faults; thus, we would like to provide at least some of the benefits of formal testing methodologies to the creators of spreadsheets. This article presents a testing methodology that adapts data flow adequacy criteria and coverage monitoring to the task of testing spreadsheets. To accommodate the evaluation model used with spreadsheets, and the interactive process by which they are created, our methodology is incremental. To accommodate the users of spreadsheet languages, we provide an interface to our methodology that does not require an understanding of testing theory. We have implemented our testing methodology in the context of the Forms/3 visual spreadsheet language. We report on the methodology, its time and space costs, and the mapping from the testing strategy to the user interface. In an empirical study, we found that test suites created according to our methodology detected, on average, 81% of the faults in a set of faulty spreadsheets, significantly outperforming randomly generated test suites.
Is &ldquo;sometime&rdquo; sometimes better than &ldquo;always&rdquo;?: intermittent assertions in proving program correctness
Authors: Zohar Manna, Richard Waldinger
Venue: Communications of the ACM (1978)

This paper explores a technique for proving the correctness and termination of programs simultaneously. This approach, the intermittent-assertion method, involves documenting the program with assertions that must be true at some time when control passes through the corresponding point, but that need not be true every time. The method, introduced by Burstall, promises to provide a valuable complement to the more conventional methods. The intermittent-assertion method is presented with a number of examples of correctness and termination proofs. Some of these proofs are markedly simpler than their conventional counterparts. On the other hand, it is shown that a proof of correctness or termination by any of the conventional techniques can be rephrased directly as a proof using intermittent assertions. Finally, it is shown how the intermittent-assertion method can be applied to prove the validity of program transformations and the correctness of continuously operating programs.
Program transformation and runtime support for threaded MPI execution on shared-memory machines
Authors: Hong Tang, Kai Shen, Tao Yang
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2000)

Parallel programs written in MPI have been widely used for developing high-performance applications on various platforms. Because of a restriction of the MPI computation model, conventional MPI implementations on shared-memory machines map each MPI node to an OS process, which can suffer serious performance degradation in the presence of multiprogramming. This paper studies compile-time and runtime techniques for enhancing performance portability of MPI code running on multiprogrammed shared-memory machines. The proposed techniques allow MPI nodes to be executed safety and efficiently as threads. Compile-time transformation eliminates global and static variables in C code using node-specific data. The runtime support includes an efficient and provably correct communication protocol that uses lock-free data structure and takes advantage of address space sharing among threads. The experiments on SGI Origin 2000 show that our MPI prototype called TMPI using the proposed techniques is competitive with SGI's native MPI implementation in a dedicated environment, and that it has significant performance advantages in a multiprogrammed environment.
Computerization, institutional maturation, and qualitative change: analysis of a Ghanaian public corporation
Authors: Wisdom J. Tettey
Venue: Information Technology for Development (2000)

This article uses the social interactionist conceptual framework to analyse computerization in the Volta River Authority, a public corporation in Ghana. It first analyses the initial phase of ICT adoption in the organization, and shows how limited personnel skills, unplanned and uncoordinated innovations, and overwhelming organizational defects resulted in the inability of the technology to produce intended results. The article then proceeds to discuss how these initial problems were dealt within the subsequent phase to produce more positive outcomes. Reasons for this success included comprehensive feasibility studies, departmental representation in planning, and corporate support for the technologies at the highest organizational levels. It suggests, however, that certain socio-cultural, political and organizational problems continue to hinder effective use of ICTs. Based on these findings the article concludes that institutions should be understood as social systems with contingent configurations of reality that determine the success or failure of technological innovations. The unique contingencies that constitute a particular system should, therefore, be taken into account when designing, adopting, and implementing innovations. This is not only to ensure the sensitivity of the innovations to the social milieux into which they are planted, but also to address any militating factors that might constrain the effectiveness of the innovations.