ppxscal/embedding_network huggingface dataset:
On the automatic simplification of source-language programs
Authors: Ellen R. Clark
Venue: Communications of the ACM (1967)

Methods of simplification that can be applied automatically to programs written in an ALGOL-like language are discussed. The simplifications are based on the form of the program and the knowledge obtained by a processor, without any understanding of what the program is supposed to do. These methods have been implemented in a processor called SURE that accepts a program written in JOVIAL and outputs an equivalent JOVIAL program that may be shorter and may be executed faster than the original. SURE is described, some of the problems encountered in automatic improvement at the source-language level are discussed, and further types of automatic program improvement are suggested.
Demonstration of an Analog IC Function Maintenance Strategy, Including Direct Calibration, Built-in Self-test, and Commutation of Redundant Functional Blocks
Authors: K. Wayne Current, Wei-Shang Chu
Venue: Analog Integrated Circuits and Signal Processing (2001)

A new analog subsystem maintenance strategy is presented that can be used to improve the accuracy, reliability, yield, and testability of analog and mixed-signal ICs. This scheme is a generally applicable design approach that combines hybrid redundancy, direct subcircuit parameter adjustment (calibration), and on-chip analog function verification (built-in self-test). Improvements are realized in a system-transparent fashion through careful function block commutation. The cost is a moderate die area increase. This design strategy is applicable to a wide range of moderately complex analog functions. An example analog function is used here to illustrate this new maintenance approach. Experimental data demonstrate the capabilities of this new approach to analog IC design for testability.
Touring into the picture using hand shape recognition (poster session)
Authors: Eu-Mi Ji, Ho-Sub Yoon, Younglae J. Bae
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

The purpose of this study is to prove that using gesture recognition through implementing the method of touring into the picture makes navigation very convenient and easy compared to navigation using mouse and keyboard. The method of touring into the picture is a simple technique that converts an 2D image into 3D animation. This study shows how to convert 2D image into 3D navigation, implementing the method previously proposed by Horry and Phy on the personal computer. Hand shape gesture recognition which functions as a user interface has been developed into three types: Type-1 means pause, Type-2 means showing directions on 2D; Type-3 is designed to assign upper and lower depth in space. These three types play the role as virtual mouse and keyboard in 3D-rendering image. Above all, using hand-shaped gestures contributes to the ease of user's navigation of 3D space..
A survey of system administrator mental models and situation awareness
Authors: Dennis G. Hrebec, Michael Stiber
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

Little empirical research has been conducted on the mental models and situation awareness of system administrators. To begin addressing this deficiency, a short survey was prepared and broadcast to system administrators via Internet newsgroups. Fifty-four sysadmins responded. These respondents indicated that there is much about the systems they oversee that they don't understand, and the more they do not understand about their systems, the more likely they are to attribute this ignorance to hardware, and not software, unknowns. The respondents attribute little of the expertise they do possess to formal education or training. Further, when faced with a novel situation, the respondents were more likely to rely on themselves and their personal contacts than on the system's manufacturers, or on third party support. However, the more the sysadmins attributed their ignorance of their systems to hardware unknowns, the more likely they were to rely on manufacturer and third party support. Compared to Microsoft oriented sysadmins, Unix oriented sysadmins were more likely to attribute their expertise to working with others, and were more likely to attribute their ignorance to hardware unknowns. Finally, respondents who felt that their organizational superiors understood what is involved in system administration were more likely to perceive these superiors as providing the sysadmins with adequate support.
Architecture of the Atlas Chip-Multiprocessor: Dynamically Parallelizing Irregular Applications
Authors: Lucian Codrescu, D. Scott Wills, James Meindl
Venue: IEEE Transactions on Computers (2001)

Single-chip multiprocessors are an important research direction for future microprocessors. The stigma of this approach is that many important applications cannot be automatically parallelized. This paper presents a single-chip multiprocessor that engages aggressive speculation techniques to enable dynamic parallelization of irregular, sequential binaries. Thread speculation and data value prediction are combined to enable the processor to execute dependent threads in parallel. The architecture performs a novel form of dynamic thread partitioning and includes an aggressive correlated value predictor. Microarchitectural structures manage interthread data and control dependencies. On an eight processor system, simulated execution of SPECint95 binaries delivers a speedup of 3.4 over a scalar in-order uniprocessor. This improvement is due entirely to the exploitation of dynamically extracted thread level parallelism.
DSD: A schema language for XML
Authors: Nils Klarlund, Anders Møller, Michael I. Schwartzbach
Venue: Proceedings of the third workshop on Formal methods in software practice (2000)

XML (eXtensible Markup Language) is a linear syntax for trees, which has gathered a remarkable amount of interest in industry. The acceptance of XML opens new venues for the application of formal methods such as specification of abstract syntax tree sets and tree transformations. A notation for defining a set of XML trees is called a schema language. Such trees correspond to a specific user domain, such as XHTML, the class of XML documents that make sense as HTML. A useful schema notation must: identify most of the syntactic requirements that the documents in the user domain follow; allow efficient parsing; be readable to the user; allow limited tree transformations corresponding to the insertion of defaults; be modular and extensible to support evolving classes of XML documents.par> In the present paper, we introduce the DSD (Document Structure Description) notation as our bid on how to meet the requirements above.
A Level-Set Method for the Evolution of Faceted Crystals
Authors: Giovanni Russo, Peter Smereka
Venue: SIAM Journal on Scientific Computing (1999)

A level-set formulation for the motion of faceted interfaces is presented. The evolving surface of a crystal is represented as the zero-level of a phase function. The crystal is identified by its orientation and facet speeds. Accuracy is tested on a single crystal by comparison with the exact evolution. The method is extended to study the evolution of a polycrystal. Numerical examples in two and three dimensions are presented.
Shifting garbage collection overhead to compile time
Authors: Jeffrey M. Barth
Venue: Communications of the ACM (1977)

This paper discusses techniques which enable automatic storage reclamation overhead to be partially shifted to compile time. The paper assumes a transaction oriented collection scheme, as proposed by Deutsch and Bobrow, the necessary features of which are summarized. Implementing the described optimizations requires global flow analysis to be performed on the source program. It is shown that at compile time certain program actions that affect the reference counts of cells can be deduced. This information is used to find actions that cancel when the code is executed and those that can be grouped to achieve improved efficiency.
Visual Surveillance for Moving Vehicles
Authors: James M. Ferryman, Stephen J. Maybank, Anthony D. Worrall
Venue: International Journal of Computer Vision (2000)

An overview is given of a vision system for locating, recognising and tracking multiple vehicles, using an image sequence taken by a single camera mounted on a moving vehicle. The camera motion is estimated by matching features on the ground plane from one image to the next. Vehicle detection and hypothesis generation are performed using template correlation and a 3D wire frame model of the vehicle is fitted to the image. Once detected and identified, vehicles are tracked using dynamic filtering. A separate batch mode filter obtains the 3D trajectories of nearby vehicles over an extended time. Results are shown for a motorway image sequence.
Consistency and Completeness in Rough Sets
Authors: Arul Siromoney, K. Inoue
Venue: Journal of Intelligent Information Systems (2000)

Consistency and completeness are defined in the context of rough set theory and shown to be related to the lower approximation and upper approximation, respectively. A member of a composed set (union of elementary sets) that is consistent with respect to a concept, surely belongs to the concept. An element that is not a member of a composed set that is complete with respect to a concept, surely does not belong to the concept. A consistent rule and a complete rule are useful in addition to any other rules learnt to describe a concept. When an element satisfies the consistent rule, it surely belongs to the concept, and when it does not satisfy the complete rule, it surely does not belong to the concept. In other cases, the other learnt rules are used. The results in the finite universe are extended to the infinite universe, thus introducing a rough set model for the learning from examples paradigm. The results in this paper have application in knowledge discovery or learning from database environments that are inconsistent, but at the same time demand accurate and definite knowledge. This study of consistency and completeness in rough sets also lays the foundation for related work at the intersection of rough set theory and inductive logic programming.
Research directions in designing intercultural interactions in collaborative virtual communities
Authors: Elaine M. Raybourn, Andrew McGrath, Alan Munro, William A. Stubblefield
Venue: ACM SIGGROUP Bulletin (2000)

As applications and environments supporting collaborative virtual communities (CVEs) become increasingly available, opportunities to work, learn, play, and share experiences trans-culturally are not only more appealing, but also more feasible. Distributed cross-cultural and cross-organizational interactions are here, now. The emergence of such synchronous, post-geographical, virtual communities raises particular issues around fostering the intercultural 'chemistry' of online interactions and online community design.Elaine Raybourn and Andrew McGrath facilitated a one-day workshop at Group 99 on online community design, highlighting the potential for intercultural communication as an over-arching design principle. The program committee included Elizabeth Churchill, Alan Munro, Wolfgang Prinz, William Stubblefield, and Eunice Young. Workshop participants represented intellectually and culturally diverse backgrounds and fields including computer science, systems engineering, ethnography, HCI, intercultural communication, design, and psychology. Private sector, public sector, and university affiliations were also represented.
Performance analysis of a multimedia synchronization mechanism based on buffer compensation in a mobile environment
Authors: Aurelio La Corte, Alfio Lombardo, Sergio Palazzo
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2000)

In a mobile communication system network performance varies considerably when handovers occur. This occurrence strongly impacts the design of the buffer compensation based techniques usually used in the fixed communication environments for minimizing probability of asynchronism between the different media composing a multimedia session. This paper provides an analytical paradigm for dimensioning synchronization buffers at the interface node between the wired and the wireless networks when network delay varies during a multimedia session due to the user mobility. For this purpose, the factors related to terminal mobility which have to be taken into account in the design of a synchronization mechanism are briefly introduced and appropriate user-perceived Quality of Service parameters referring to the synchronization of multimedia services are also introduced
Generic topic segmentation of document texts
Authors: Marie-Francine Moens, Rik De Busser
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Topic segmentation is an important initial step in many text-based tasks. A hierarchical representation of a texts topics is useful in retrieval and allows judging relevancy at different levels of detail. This short paper describes research on generic algorithms for topic detection and segmentation that are applicable on texts of heterogeneous types and domains.
Spherical Mosaics with Quaternions and Dense Correlation
Authors: Satyan Coorg, Seth Teller
Venue: International Journal of Computer Vision (2000)

We describe an algorithm for generating spherical mosaics from a collection of images acquired from a common optical center. The algorithm takes as input an arbitrary number of partially overlapping images, an adjacency map relating the images, initial estimates of the rotations relating each image to a specified base image, and approximate internal calibration information for the camera. The algorithm's output is a rotation relating each image to the base image, and revised estimates of the camera's internal parameters.Our algorithm is novel in the following respects. First, it requires no user input. (Our image capture instrumentation provides both an adjacency map for the mosaic, and an initial rotation estimate for each image.) Second, it optimizes an objective function based on a global correlation of overlapping image regions. Third, our representation of rotations significantly increases the accuracy of the optimization. Finally, our representation and use of adjacency information guarantees globally consistent rotation estimates.The algorithm has proved effective on a collection of nearly four thousand images acquired from more than eighty distinct optical centers. The experimental results demonstrate that the described global optimization strategy is superior to non-global aggregation of pair-wise correlation terms, and that it successfully generates high-quality mosaics despite significant error in initial rotation estimates.
External Representations of Objects of User-Defined Type
Authors: Peter L. Wallis
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

The portable programming language (PPL) is one of a number of recently designed programming languages that enable the user to define new types by giving their representations and operations in terms of those of previously available types. Such provisions for the construction of objects of user-defined type have been discussed elsewhere; this work concerns the related problem of the external representations of such objects, both on input-output media and as written constants within the program text. We introduce an enhancement to the PPL design allowing specification of the external representations of objects of user-defined type. This extension to the PPL design means that objects of user-defined type can be read, written, and used as constants exactly as if their representations had been selected by the writer of the PPL compiler. The implementation and use of the added facilities are also discussed.
Teaching abroad - how to get the most out of a sabbatical
Authors: John G. Meinke
Venue: Proceedings of the fourteenth annual consortium on Small Colleges Southeastern conference (2000)

Seven years ago our speaker accepted a one year position teaching with the University of Maryland University College European Division. He describes his own situation as having forgotten to come back! What's it like teaching in Europe? How much of Europe does one see? What's it like living in the culture? You can do it too!
A dynamic binary translation approach to architectural simulation
Authors: Harold W. Cain, Kevin M. Lepak, Mikko H. Lipasti
Venue: ACM SIGARCH Computer Architecture News (2001)

We present the design of a PowerPC-based simulation infrastructure for architectural research. Our infrastructure uses an execution-driven out-of-order processor timing simulator from the SimpleScalar tool set. While porting SimpleScalar to the PowerPC architecture, we would like to remain compatible with other versions of SimpleScalar. We accomplish this by performing dynamic binary translation of the PowerPC instruction set architecture to the SimpleScalar instruction set architecture, and by mapping the PowerPC architectural state onto the SimpleScalar register set. Using this infrastructure, we execute unmodified PowerPC binaries on an out-of-order processor timing simulator which implements the SimpleScalar architecture. We describe and investigate trade-offs in the translation of some complex PowerPC instructions and advocate adoption of speculative decode to optimize instruction translations for the common case. We find that simple decode predictors can reach better than 90% accuracy for guiding speculative decode.
Space-Time Tradeoffs for Emptiness Queries
Authors: Jeff Erickson
Venue: SIAM Journal on Computing (2000)

We develop the first nontrivial lower bounds on the complexity of online hyperplane and halfspace emptiness queries. Our lower bounds apply to a general class of geometric range query data structures called partition graphs. Informally, a partition graph is a directed acyclic graph that describes a recursive decomposition of space. We show that any partition graph that supports hyperplane emptiness queries implicitly defines a halfspace range query data structure in the Fredman/Yao semigroup arithmetic model, with the same asymptotic space and time bounds. Thus, results of Brönnimann, Chazelle, and Pach imply that any partition graph of size s that supports hyperplane emptiness queries in time t satisfies the inequality $st^d = \Omega((n/\log n)^{d - (d-1)/(d+1)})$. Using different techniques, we improve previous lower bounds for Hopcroft's problem---Given a set of points and hyperplanes, does any hyperplane contain a point?---in dimensions four and higher. Using this offline result, we show that for online hyperplane emptiness queries, $\Omega(n^d/{\mbox{ polylog }} n)$ space is required to achieve polylogarithmic query time, and $\Omega(n^{(d-1)/d}/{\mbox{ polylog }} n)$ query time is required if only O(n polylog n) space is available. These two lower bounds are optimal up to polylogarithmic factors. For two-dimensional queries, we obtain an optimal continuous tradeoff $st^2=\Omega(n^2)$ between these two extremes. Finally, using a lifting argument, we show that the same lower bounds hold for both offline and online halfspace emptiness queries in ${\mathbb{R}}^{d(d+3)/2}$.
Parameterised system design based on genetic algorithms
Authors: Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

A recent reduction in the time to market has led to the development of a new approach to IP-based design in which a highly parametric pre-designed system-on-a-chip is configured according to the application it will have to execute. The greatest problems in this area regard exploration of the range of possible system configurations in search of the optimal configuration for a given system. There are, in fact, a number of parameters involved (bus sizes, cache configurations, software algorithms, etc.), each of which has a great impact on design constraints such as area, power and performance. An exhaustive analysis of all possible configurations is thus computationally unfeasible. In this paper we propose using genetic algorithms to determine the optimal configuration for a highly parametric system. The approach is applied to the search for the optimal configuration (in terms of area, power and mean access time) of a memory hierarchy involved in a given application.
Securing RSVP for multimedia applications
Authors: Vanish Talwar, Klara Nahrstedt
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

Distributed multimedia applications require end-to-end quality of service (QoS) in order to be accepted and used. One approach to achieve end-to-end QoS is to provide end-to-end resource reservations. Resource ReSerVation Protocol (RSVP) [5] [1] is a unicast and multicast signalling protocol for setting up network bandwidth reservation. In this paper, we propose a solution for securing RSVP messages in a flexible, efficient and scalable manner. Our solution extends the RSVP protocol with a scalable QoS protection, using a hybrid hierarchical security approach. The RSVP messages go through two different protocol treatments - one within subnetworks and the other across subnetworks. We use delayed integrity checking within the subnetwork by sending feedback messages from the egress node. A stronger integrity and encryption check is made on messages sent across subnetworks. Our solution is thus an intermediate approach between the extremes of hop by hop authentication [2] and the SDS/CD protocol [8] and overcomes the drawbacks of the two protocols.
Tables of 64-bit Mersenne twisters
Authors: Takuji Nishimura
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2000)

We give new parameters for a Mersenne Twister pseudorandom number gene rator for 64-bit word machines.
Software engineering services for export and small developing economies
Authors: Han Reichgelt
Venue: Information Technology for Development (2000)

A number of authors and multi-national organizations have suggested that providing information services, and in particular software engineering and programming services, for export afford an important economic opportunity for poor countries. Throughout the world, developing countries have acted on this advice. This paper will argue that the opportunities for software engineering services in particular are limited, at least for small developing economies. The main argument is that software engineering and programming are labor-intensive activities and that small developing countries simply do not have the required resources to acquire or train a sufficient number of software engineers and programmers. Any development policy that blindly follows the tenet that small developing countries can improve their economic position through the provision of information services for export is therefore bound to fail. Hence, more sophisticated policies are called for. This paper will also examine a number of such policy options, including an innovative human resource development policy being developed in Jamaica.
Cubic splines on uniform meshes
Authors: E. N. Nilson
Venue: Communications of the ACM (1970)

A very simple procedure is presented for constructing cubic splines, periodic or nonperiodic, on uniform meshes. Arcs of two cubics suffice to construct a basis of cardinal splines. An algorithm is given which requires only minimal storage and computation and permits easy trade-off of one against the other.