ppxscal/embedding_network huggingface dataset:
Efficient Simulation of Formal Processor Models
Authors: Matthew Wilding, David Greve, David Hardin
Venue: Formal Methods in System Design (2001)

Computer systems under development are routinely modeled by simulators, and formal verification can be integrated into conventional computer system development by reasoning directly about such simulators. Simulators must be extremely fast to be usable in a real development effort. We have crafted a model for a simple processor in the logic of the ACL2 theorem prover that supports both formal analysis and efficient execution, with performance near that of a simulator written in C. We demonstrate our approach using this simple model and indicate how we applied it to our latest microprocessor.
A Generalized Basic-Cycle Calculation Method for Efficient Array Redistribution
Authors: Ching-Hsien Hsu, Sheng-Wen Bai, Yeh-Ching Chung, Chu-Sing Yang
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

In many scientific applications, dynamic array redistribution is usually required to enhance the performance of an algorithm. In this paper, we present a generalized basic-cycle calculation (GBCC) method to efficiently perform a BLOCK-CYCLIC(s) over P processors to BLOCK-CYCLIC(t) over Q processors array redistribution. In the GBCC method, a processor first computes the source/destination processor/data sets of array elements in the first generalized basic-cycle of the local array it owns. A generalized basic-cycle is defined as $lcm(sP,\;tQ)/(gcd(s,t)\times P)$ in the source distribution and $lcm(sP,\;tQ)/(gcd(s,t)\times Q)$ in the destination distribution. From the source/destination processor/data sets of array elements in the first generalized basic-cycle, we can construct packing/unpacking pattern tables to minimize the data-movement operations. Since each generalized basic-cycle has the same communication pattern, based on the packing/unpacking pattern tables, a processor can pack/unpack array elements efficiently. To evaluate the performance of the GBCC method, we have implemented this method on an IBM SP2 parallel machine, along with the PITFALLS method and the ScaLAPACK method. The cost models for these three methods are also presented. The experimental results show that the GBCC method outperforms the PITFALLS method and the ScaLAPACK method for all test samples. A brief description of the extension of the GBCC method to multidimensional array redistributions is also presented.
Combining semantic and syntactic document classifiers to improve first story detection
Authors: Nicola Stokes, Joe Carthy
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

In this paper we describe a type of data fusion involving the combination of evidence derived from multiple document representations. Our aim is to investigate if a composite representation can improve the online detection of novel events in a stream of broadcast news stories. This classification process otherwise known as first story detection FSD (or in the Topic Detection and Tracking pilot study as online new event detection [1]), is one of three main classification tasks defined by the TDT initiative. Our composite document representation consists of a semantic representation (based on the lexical chains derived from a text) and a syntactic representation (using proper nouns). Using the TDT1 evaluation methodology, we evaluate a number of document representation combinations using these document classifiers.
A Fast and Accurate Face Detector Based on Neural Networks
Authors: Raphaël Féraud, Olivier J. Bernier, Jean-Emmanuel Viallet, Michel Collobert
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

Detecting faces in images with complex backgrounds is a difficult task. Our approach, which obtains state of the art results, is based on a new neural network model: the Constrained Generative Model (CGM). Generative, since the goal of the learning process is to evaluate the probability that the model has generated the input data, and constrained since some counterexamples are used to increase the quality of the estimation performed by the model. To detect side view faces and to decrease the number of false alarms, a conditional mixture of networks is used. To decrease the computational time cost, a fast search algorithm is proposed. The level of performance reached, in terms of detection accuracy and processing time, allows to apply this detector to a real world application: the indexation of images and videos.
Query term disambiguation for Web cross-language information retrieval using a search engine
Authors: Akira Maeda, Fatiha Sadat, Masatoshi Yoshikawa, Shunsuke Uemura
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

With the worldwide growth of the Internet, research on Cross-Language Information Retrieval (CLIR) is being paid much attention. Existing CLIR approaches based on query translation require parallel corpora or comparable corpora for the disambiguation of translated query terms. However, those natural language resources are not readily available. In this paper, we propose a disambiguation method for dictionary-based query translation that is independent of the availability of such scarce language resources, while achieving adequate retrieval effectiveness by utilizing Web documents as a corpus and using co-occurrence information between terms within that corpus. In the experiments, our method achieved 97% of manual translation case in terms of the average precision.
Fault origin adjudication
Authors: Karthikeyan Bhargavan, Carl A. Gunter, Davor Obradovic
Venue: Proceedings of the third workshop on Formal methods in software practice (2000)

When a program P fails to satisfy a requirement R supposedly ensured by a detailed specification S that was used to implement P, there is a question about whether the problem arises in S or in P. We call this determination fault origin adjudication and illustrate its significance in various software engineering contexts. The primary contribution of this paper is a framework for formal fault origin adjudication for network protocols using the NS simulator and the SPIN model checker. We describe our architecture and illustrate its use in a case study involving a standard specification for packet radio routing.
Low-Voltage Analog Tripler Circuit
Authors: Cheng-Chieh Chang, Shen-Iuan Liu, Yuh-Shyan Hwang
Venue: Analog Integrated Circuits and Signal Processing (2001)

A new low-voltage CMOS tripler is presented in this paper. It is realized by the square-law characteristics of MOS transistors operating in saturation. The proposed circuit has been fabricated in a 0.8 &mu;m CMOS process. Experimental results have been given to demonstrate the feasibility of the proposed circuit. It is expected to be useful in low-voltage analog signal-processing applications.
Content-based language models for spoken document retrieval
Authors: Hsin-min Wang, Berlin Chen
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

Spoken document retrieval (SDR) has been extensively studied in recent years because of its potential use in navigating large multimedia collections in the near future. This paper presents a novel concept of applying the content-based language models to spoken document retrieval. In an example task for retrieval of Mandarin broadcast news, the content-based language models either trained with the automatic transcriptions of the spoken documents or adapted from the baseline language models using the automatic transcriptions of the spoken documents were used to create the more accurate recognition results and indexing terms from both the spoken documents and the speech queries. We report on some interesting findings obtained in this research.
An improved equivalence algorithm
Authors: Benrard A. Galler, Michael J. Fisher
Venue: Communications of the ACM (1964)

An algorithm for assigning storage on the basis of EQUIVALENCE, DIMENSION and COMMON declarations is presented. The algorithm is based on a tree structure, and has reduced computation time by 40 percent over a previously published algorithm by identifying all equivalence classes with one scan of the EQUIVALENCE declarations. The method is applicable in any problem in which it is necessary to identify equivalence classes, given the element pairs defining the equivalence relation.
Spatially distributed databases on sensors
Authors: Bo Xu, Ouri Wolfson, Sam Chamberlain
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

We consider the problem of data dissemination in a sensor network. First we introduce a cost model for data dissemination in such networks. The model quantifies the tradeoff between the inconsistency of the data, and its transmission cost; the transmission cost is given in terms of energy and bandwidth. Then we introduce a novel broadcast policy, ABR, that utilizes our cost model. In the ABR policy, each sensor broadcasts updates only if the cost of sending is justified by (its view of) the current level of inconsistency. Data received from other sensors are rebroadcast using the same cost measures. Finally we compare the performance of ABR with that of several existing data dissemination policies. Via the comparison we discover an intricate interplay among the various parameters in choosing a dissemination policy.
A New Approach for SOI Devices Small-Signal Parameters Extraction
Authors: A. Bracale, V. Ferlet-Cavrois, N. Fel, D. Pasquet, J. L. Gautier, J. L. Pelloie, J. du Port de Poncharra
Venue: Analog Integrated Circuits and Signal Processing (2000)

SOI devices are frequently used nowadays in the RF and HF field. Design of complex SOI integrated circuits involves a prior detailed analog simulation, that can only be performed through accurate SOI active components models. We are interested here in linear operation modeling; we test new methods for small-signal parameters determination, suitable for a conventional MOSFET high-frequency model and somewhat inspired from methods applied to MESFET technology. In this paper, we deal mainly with extrinsic parameters, for which we obtain reliable estimation on a large frequency range. Our finally adopted extraction procedure takes closely into account the model topology, which reflects the device electrical behavior. We completely describe the procedure, from measurements to the extracted equivalent circuit simulation, without having to optimize parameters and with a straightforward extrinsic elements extraction.
Teaching theory of computation using pen-based computers and an electronic whiteboard
Authors: Dave Berque, David K. Johnson, Larry Jovanovic
Venue: ACM SIGCSE Bulletin (2001)

This paper describes a Theory of Computation course that was taught in an electronic classroom equipped with a network of pen-based computers, a touch-sensitive electronic whiteboard, and locally written groupware that was designed to enhance the ability of teachers and students to share written information during class. We first describe the technology that was used to support the course, and then provide an overview of the instructor's use of this technology to engage students during class. Finally, we present the students' reaction to the approach.
Mobility management for hierarchical wireless networks
Authors: Guangyu Pei, Mario Gerla
Venue: Mobile Networks and Applications (2001)

In this paper, we consider the mobility management in large, hierarchically organized multihop wireless networks. The examples of such networks range from battlefield networks, emergency disaster relief and law enforcement etc. We present a novel netwroks addressing architecture to accommodate mobility using a &ldquo;Home Agent&rdquo; concept akin to mobile IP. We distinguish between the &ldquo;physical&rdquo; routing hierarchy (dictated by geographical relationships between nodes) and &ldquo;logical&rdquo; hierarchy of subnets in which the members moves as a group (e.g., company, brigade, abttalion in the battlefield). The performance of the mobility management scheme is investigated through simulation.
Rapid significance estimation in local sequence alignment with gaps
Authors: Ralf Bundschuh
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

In order to assess the significance of sequence alignments it is crucial to know the distribution of alignment scores of pairs of random sequences. For gapped local alignment it is empirically known that the shape of this distribution is of the Gumbel form. However, the determination of the parameters of this distribution is a computationally very expensive task. We present a new algorithmic approach which allows to estimate the more important of the Gumbel parameters at least five times faster than the traditional methods. Actual runtimes of our algorithm between less than a second and a few minutes on a workstation bring significance estimation into the realm of interactive applications.
Segment sizes and liftetimes in Algol 60 programs
Authors: A. P. Batson, R. E. Brundage
Venue: Communications of the ACM (1977)

The characteristics of the virtual memory requirements of a sample of Algol 60 programs have been measured. Distributions are presented for the sizes of memory requests and for their holding times (lifetimes). The results are presented in terms of Johnston's contour model and a simple abstract machine. They provide new empirical evidence of certain aspects of the construction and behavior of real programs, and some of their implications for the design of virtual memory systems are presented and discussed.
Comments on price/performance patterns of U. S. computer systems
Authors: Jane Fedorowicz
Venue: Communications of the ACM (1981)

Several errors are noted in the formulation of econometric models describing computer price/performance patterns. An alternative model is presented which shows the effects of technological advances and computer size on price reduction.
A unifying computational method for the analysis of complete factorial experiments
Authors: B. E. Cooper
Venue: Communications of the ACM (1967)

A computational method which may be used for the calculation of sums of squares in the analysis of variance of complete factorial experiments and in the computation of main effect or interaction means is described. The method is elucidated as unifying since one method can be used for a variety of purposes each previously requiring different methods. The programming advantages of such a method are obvious. The following variants are discussed: (1) the standard analysis of variance; (2) analyses omitting certain levels of one or more factors; (3) separate analyses for some levels of a factor or for combinations of levels of more than one factor. These are performed simultaneously; (4) the calculation of main effect or interaction means. The method expects the data in standard order and it leaves the data in that order so that many analyses of the same data can be performed without rearrangement. The total sum of squares, excluding a replication sum of squares, is partitioned into all polynomial partitions and their interactions each with one degree of freedom. This is so even if factors have unequally spaced factor levels.
Leslie Lamport's properties and actions
Authors: Martín Abadi
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

Since the 1970s, Leslie Lamport has done substantial work on specification and verification methods. This work might be regarded as complementary to his other celebrated research on concurrency and distributed computing, perhaps sometimes even as secondary. However, this work is excellent in its own right. It introduces (or distills) many original and useful ideas. These include the important definitions of safety and liveness properties, and later the insightful conception of a temporal logic of actions. This talk will describe some of Lamport's ideas and results on specification and verification methods. It will touch on the impact of some of those ideas on the speaker (who collaborated closely with Lamport for several years) and on the field.
Tracking the Invisible Hand: Convergence of Double Auctions toCompetitive Equilibrium
Authors: Antoni Bosch-Domènech, Shyam Sunder
Venue: Computational Economics (2000)

Economics is the science of want and scarcity. We show that want and scarcity, operating within a simple exchange institution (double auction), can be sufficient for an economy consisting of multiple inter-related markets to attain competitive equilibrium (CE). We generalize Gode and Sunder's (1993a,b) single-market finding to multi-market economies, and explore the role of the scarcity constraint in convergence of economies to CE. When the scarcity constraint is relaxed by allowing arbitrageurs in middle markets to enter speculative trades, prices still converge to CE, but allocative efficiency of the economy declines. Optimization by individual agents, often used to derive competitive equilibria, is unnecessary for an actual economy to approximately attain such equilibria. From the failure of humans to optimize in complex tasks, one need not conclude that the equilibria derived from the competitive model are descriptively irrelevant. We show that even in complex economic systems which are highly inefficient, such equilibria can be attained under a range of surprisingly weak assumptions about agent behavior.
Searching for patterns of snakes in hypercubes (student paper)
Authors: Karl G. Scheidt
Venue: Proceedings of the fourteenth annual consortium on Small Colleges Southeastern conference (2000)

The problem of finding longest snakes in hypercubes, which has applications in error checking, error correction, and electronic locking schemes, among others, has been an open problem for over forty years. Recently, some attention has been given to maximal snakes in hypercubes, in the hope that this approach will produce information that will be useful in the study of longest snakes. This paper presents a finding that is based on previous research of maximal snakes. The hope is that this line of research can be continued to discover general properties of the existence of maximal snakes in hypercubes.
Microprogramming, emulators and programming languages
Authors: Julien Green
Venue: Communications of the ACM (1966)

The problem we have been concerned with is that of converting language to action&mdash;or intellectual energy to mechanical energy. The medium that we use for this purpose is language and therefore we are preoccupied with the subject of language. In the areas of language investigation we have concentrated first on formalizing syntax and then on semantics. I believe semantics has received an unfair share of the energy of too many people&mdash;mainly misdirected to trying to reduce semantics to an algebraic manipulation of symbols, without enough attention to reality. By reality I mean the devices or mechanisms which are going to use these symbols. We have been overly concerned with what the symbols mean to one class of users, namely, the human or the senders of the symbols, without sufficient concern about the receivers of the symbols, in this case the machines.
Data management support for asynchronous groupware
Authors: Nuno Preguiça, J. Legatheaux Martins, Henrique Domingos, Sérgio Duarte
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

In asynchronous collaborative applications, users usually collaborate accessing and modifying shared information independently. We have designed and implemented a replicated object store to support such applications in distributed environments that include mobile computers. Unlike most data management systems, awareness support is integrated in the system. To improve the chance for new contributions, the system provides high data availability. The development of applications is supported by an object framework that decomposes objects in several components, each one managing a different aspect of object "execution". New data types may be created relying on pre-defined components to handle concurrent updates, awareness information, etc.
Notes on computing peaks in k-levels and parametric spanning trees
Authors: Naoki Katoh, Takeshi Tokuyama
Venue: Proceedings of the seventeenth annual symposium on Computational geometry (2001)

We give an algorithm to compute all the local peaks in the $k$-level o f an arrangement of $n$ lines in $O(n \log n) + \tilde{O}((kn)^{2/3})$ time. We can also find $\tau$ largest peaks in $O(n \log ^2 n) + \tilde{O}((\tau n)^{2/3})$ time. Moreover, we consider the longest edge in a parametric minimum spanning tree (in other words, a bottleneck edge for connectivity), and give an algorithm to compute the parameter value (within a given interval) maximizing/minimizing the length of the longest edge in MST. The time complexity is $\tilde{O}( n^{8/7}k^{1/7} + n k^{1/3})$.
Fortran
Authors: W. P. Heising
Venue: Communications of the ACM (1963)

&ldquo;The FORTRAN language is intended to be capable of expressing any problem of numerical computation. In particular, it deals easily with problems containing large sets of formulae and many variables, and it permits any variable to have up to three independent subscripts. However, for problems in which machine words have a logical rather than a numerical meaning it is less satisfactory, and it may fail entirely to express some such problems. Nevertheless, many logical operations not directly expressable in the FORTRAN language can be obtained by making use of provisions for incorporating library routines.&rdquo; This quotation is taken from &ldquo;The FORTRAN Automatic Coding System for the IBM 704 EDPM,&rdquo; dated October 15, 1956. This first manual was a programmer's reference manual issued by the Programming Research Department of IBM. The original system and the original manual were the work of J. W. Backus, R. J. Beeber, S. Best, R. Goldberg, H. L. Herrick, R. A. Hughes (U.C.R.L., Livermore), L. B. Mitchell, R. A. Nelson, R. Nutt (United Aircraft), D. Sayre, P. B. Sheridan, H. Stern, and I. Ziller; all were associated with IBM except as noted.
The Bioperl project: motivation and usage
Authors: Jason Stajich, Ewan Birney
Venue: ACM SIGBIO Newsletter (2000)

This paper describes motivation, basic structure, and usage of the Bioperl project. As an open source project, all Bioperl modules are freely available for use and contribution from the bioinformatics community. The project's goal is to produce high quality software for managing and manipulating biological information. The bioperl web site (http://bio.perl.org) provides news and information as well as access to source code and details about joining the project [3].
OMDoc: an infrastructure for OpenMath content dictionary information
Authors: Michael Kohlhase
Venue: ACM SIGSAM Bulletin (2000)

The OPENMATH framework for transmitting mathematical objects over the Internet relies on the concept of Content Dictionaries (CDs) to define the semantics of mathematical objects. This is an essential measure for establishing a meaningful communication amongst mathematical software systems (and humans).Currently, the infrastructure for conceiving, administering, viewing CDs is limited to a file-based almost flat repository. In this paper, we propose to use the OMDoc extension of the OPENMATH XML encoding as an infrastructure to express and manipulate content dictionary information. OMDoc extends OPENMATH by adding support for document markup (making the CDs more readable to the human user) and structured specification (making them more explicit, formal, and allow the user to reuse, and inherit CD information in a flexible, but well-defined way).