ppxscal/embedding_network huggingface dataset:
Authoring systems in computer based education
Authors: Greg Kearsley
Venue: Communications of the ACM (1982)

The idea of a programming system which generates other programs (referred to as automatic programming or metasoftware) has always been a popular one in computer science. Despite the interest, however, few such systems have actually been inplemented and used. An exception is the development and use of authoring systems in the domain of Computer Based Education (CBE). This article surveys the development and characteristics of authoring systems.
An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device
Authors: Stephan Olariu, Cristina Pinotti, Si Qing Zheng
Venue: IEEE Transactions on Computers (2000)

We present a hardware-algorithm for sorting $N$ elements using either a p-sorter or a sorting network of fixed I/O size $p$ while strictly enforcing conflict-free memory accesses. To the best of our knowledge, this is the first realistic design that achieves optimal time performance, running in $\Theta ( {\frac{N \log N}{p \log p}})$ time for all ranges of $N$. Our result completely resolves the problem of designing an implementable, time-optimal algorithm for sorting $N$ elements using a p-sorter. More importantly, however, our result shows that, in order to achieve optimal time performance, all that is needed is a sorting network of depth $O(\log^2 p)$ such as, for example, Batcher's classic bitonic sorting network.
On the stability of Gauss-Jordan elimination with pivoting
Authors: G. Peters, J. H. Wilkinson
Venue: Communications of the ACM (1975)

The stability of the Gauss-Jordan algorithm with partial pivoting for the solution of general systems of linear equations is commonly regarded as suspect. It is shown that in many respects suspicions are unfounded, and in general the absolute error in the solution is strictly comparable with that corresponding to Gaussian elimination with partial pivoting plus back substitution. However, when A is ill conditioned, the residual corresponding to the Gauss-Jordan solution will often be much greater than that corresponding to the Gaussian elimination solution.
A quick safari through the reconfiguration jungle
Authors: Patrick Schaumont, Ingrid Verbauwhede, Kurt Keutzer, Majid Sarrafzadeh
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

Cost effective systems use specialization to optimize factors such as power consumption, processing throughput, flexibility or combinations thereof. Reconfigurable systems obtain this specialization at run-time. System reconfigurable has a vertical, a horizontal and a time dimension. We organize this design space as the reconfiguration hierarchy, and discuss the design methods that deal with it. Finally, we survey existing commercial platforms that support reconfiguration and situate them in the reconfiguration jungle.
Virtual enterprises and the enterprise security architecture
Authors: Tom Haigh
Venue: Proceedings of the 1995 workshop on New security paradigms (1995)

The emergence of internetworked systems has given corporations and Government agencies the opportunity to share information in unprecedented fashion. This sharing can be distributed across several enterprises. In effect, actual enterprises with shared interests can form virtual enterprises. There are significant security implications in this. An enterprise must not only protext the confidentiality and integrity of its own information; it must also protect the information of the virtual enterprises to which it belongs. We suggest that this can be considered a new security paradigm, the Virtual Enterprise Security Paradigm, which has a significant impact on security policy, architecture, and mechanisms and leads to an Enterprise Security Architecture that is consistent with the trend toward client-server systems and is suitable for the emerging, internetworked environments now found in both the Government and Private Sectors. In this paper we describe the common themes and solution priciples that led to this new view of computing and security. We then discuss the policy and architectural issues associated with the paradigm. We finish by drawing some tentative conclusions about the paradigm.
A reinforcement learning model of selective visual attention
Authors: Silviu Minut, Sridhar Mahadevan
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

This paper proposes a model of selective attention for visual search tasks, based on a framework for sequential decision-making. The model is implemented using a fixed pan-tilt-zoom camera in a visually cluttered lab environment, which samples the environment at discrete time steps. The agent has to decide where to fixate next based purely on visual information, in order to reach the region where a target object is most likely to be found. The model consists of two interacting modules. A reinforcement learning module learns a policy on a set of regions in the room for reaching the target object, using as objective function the expected value of the sum of discounted rewards. By selecting an appropriate gaze direction at each step, this module provides top-down control in the selection of the next fixation point. The second module performs &ldquo;within fixation&rdquo; processing, based exclusively on visual information. Its purpose is twofold: to provide the agent with a set of locations of interest in the current image, and to perform the detection and identification of the target object. Detailed experimental results show that the number of saccades to a target object significantly decreases with the number of training epochs. The results also show the learned policy to find the target object is invariant to small physical displacements as well as object inversion.
Deformable Shape Detection and Description via Model-Based Region Grouping
Authors: Stan Sclaroff, Lifeng Liu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

A method for deformable shape detection and recognition is described. Deformable shape templates are used to partition the image into a globally consistent interpretation, determined in part by the minimum description length principle. Statistical shape models enforce the prior probabilities on global, parametric deformations for each object class. Once trained, the system autonomously segments deformed shapes from the background, while not merging them with adjacent objects or shadows. The formulation can be used to group image regions obtained via any region segmentation algorithm, e.g., texture, color, or motion. The recovered shape models can be used directly in object recognition. Experiments with color imagery are reported.
Effective instructional animation in 3D computer graphics education
Authors: Kevin G. Suffern
Venue: Proceedings of the Australasian conference on Computing education (2000)

A number of instructional animation are discussed for teaching 3D computer graphics. They are effective in their assigned task because they focus on concepts and processes that are difficult or impossible to see without animation. They also use a minimalist approach making the animations as simple as possible, focussed on what is relevant, and interactive. One animation is a program that allows students to explore viewing systems, two are concerned with ray tracing transparent objects, and one visualises the formation of marble.
Advising incoming CS students for what lies ahead
Authors: Robert Bryant, George Hauser, Terry Scott, Sherri Shulman
Venue: Proceedings of the second annual CCSC on Computing in Small Colleges Northwestern conference (2000)

In the mid 1980's freshmen at two universities were surveyed and their responses about computer science courses were compared with their responses about other freshmen courses&hellip;students were more likely to report reality shock, confusion, control attempts, anger, and withdrawal in their computing courses than in other courses [1]. Today computer science departments still experience some of the highest dropout rates of all disciplines with a range from 25% to over 50% attrition by the end of the first year. This panel was formed to discuss the various advising methods used by schools to attempt to prepare the students for the rigors of what their first year experience in computer science courses will involve. Helping the student understand what will be required of them goes a long way toward assuring the students success in the computer science major. Can more be done? Are any schools doing innovative approaches to this problem?
PM, a system for polynomial manipulation
Authors: G. E. Collins
Venue: Communications of the ACM (1966)

PM is an IBM 7094 program system for formal manipulation of polynomials in any number of variables, with integral coefficients unrestricted in size. Some of the formal opeartions which can be performed by the system are sums, differences, products, quotients, derivatives, substitutions and greatest common divisors. PM is based on the REFCO III list processing system, which is described and compared with the LISP and SLIP systems. The PM subroutines for arithmetic of large integers are described as constituting an independently useful subsystem. PM is compared with the ALPAK system in several respects, including the choices of canonical forms for polynomials. A new algorithm for polynomial greatest common divisor calculation is mentioned, and examples are included to illustrate its superiority.
System architecture directions for networked sensors
Authors: Jason Hill, Robert Szewczyk, Alec Woo, Seth Hollar, David Culler, Kristofer Pister
Venue: ACM SIGPLAN Notices (2000)

Technological progress in integrated, low-power, CMOS communication devices and sensors makes a rich design space of networked sensors viable. They can be deeply embedded in the physical world and spread throughout our environment like smart dust. The missing elements are an overall system architecture and a methodology for systematic advance. To this end, we identify key requirements, develop a small device that is representative of the class, design a tiny event-driven operating system, and show that it provides support for efficient modularity and concurrency-intensive operation. Our operating system fits in 178 bytes of memory, propagates events in the time it takes to copy 1.25 bytes of memory, context switches in the time it takes to copy 6 bytes of memory and supports two level scheduling. The analysis lays a groundwork for future architectural advances.
A flexible message passing mechanism for objective VHDL
Authors: W. Putzke-Röming, M. Radetzki, W. Nebel
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

When defining an object-oriented extension to VHDL, the necessary message passing is one of the most complex issues and has a large impact on the whole language. This paper identifies the requirements for message passing suited to model hardware and classifies different approaches. To allow abstract communication and reuse of protocols on system level, a new, flexible message passing mechanism proposed for Objective VHDL will be introduced.
On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata
Authors: Marco Tomassini, Moshe Sipper, Mathieu Perrenoud
Venue: IEEE Transactions on Computers (2000)

Finding good random number generators (RNGs) is a hard problem that is of crucial import in several fields, ranging from large-scale statistical physics simulations to hardware self-test. In this paper, we employ the cellular programming evolutionary algorithm to automatically generate two-dimensional cellular automata (CA) RNGs. Applying an extensive suite of randomness tests to the evolved CAs, we demonstrate that they rapidly produce high-quality random-number sequences. Moreover, based on observations of the evolved CAs, we are able to handcraft even better RNGs, which not only outperform previously demonstrated high-quality RNGs, but can be potentially tailored to satisfy given hardware constraints.
Chaining Span-Dependent Jump Instructions
Authors: Bruce W. Leverett, Thomas G. Szymanski
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

The assembled length of a span-dependent jump instruction depends on the distance between the instruction and its target. Such instructions are found on many computers and typically have two forms, long and short. We consider the problem of minimizing object program length for such machines by chaining together jumps with the same target. Although the problem is NP-complete in its most general form, several mildly restricted forms of the problem exist that are of practical importance and have efficient solutions.
An interactive computer system using graphical flowchart input
Authors: M. F. Robbins, J. D. Beyer
Venue: Communications of the ACM (1970)

An interactive computer system operational on a graphical computer terminal is described. This system was designed to demonstrate a method of programming by computer interpretation of a flowchart. The user draws a description of a sampled-data system and specifies an original input signal on a display oscilloscope. This graphical description is transmitted to a large scale computer. The design is simulated, and a graphic representation of the processed signal is returned to the scope. A successful design may require numerous modifications of the original design. A graphical interactive system provides an environment to perform this iterative process efficiently and effectively.
Optimizing queries using materialized views: a practical, scalable solution
Authors: Jonathan Goldstein, Per-Åke Larson
Venue: Proceedings of the 2001 ACM SIGMOD international conference on Management of data (2001)

Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To realize this potential, the query optimizer must know how and when to exploit materialized views. This paper presents a fast and scalable algorithm for determining whether part or all of a query can be computed from materialized views and describes how it can be incorporated in transformation-based optimizers. The current version handles views composed of selections, joins and a final group-by. Optimization remains fully cost based, that is, a single &ldquo;best&rdquo; rewrite is not selected by heuristic rules but multiple rewrites are generated and the optimizer chooses the best alternative in the normal way. Experimental results based on an implementation in Microsoft SQL Server show outstanding performance and scalability. Optimization time increases slowly with the number of views but remains low even up to a thousand.
Automatic Accurate Live Memory Analysis for Garbage-Collected Languages
Authors: Leena Unnikrishnan, Scott D. Stoller, Yanhong A. Liu
Venue: ACM SIGPLAN Notices (2001)

This paper describes a general approach for automatic and accurate live heap space and live heap space-bound analyses for high-level languages. The approach is based on program analysis and transformations and is fully automatic. The space-bound analysis produces accurate (tight) upper bounds in the presence of partially known input structures. The analyses have been implemented and experimental results confirm their accuracy.
Encapsualtion and reuse as viewed by java students
Authors: Ann E. Fleury
Venue: ACM SIGCSE Bulletin (2001)

Through audio-taped student interviews, this study examined beginning Java students' conceptions of object-oriented programming. Students rated programs on stylistic criteria including ease of comprehension, ease of debugging, ease of modification, ease of reuse, and overall quality of design. They also explained the reasons for their ratings. The results will be discussed and interpreted in light of previous research. Implications for instruction will also be examined.
Scientific Applications: BRAD: the brookhaven raster display
Authors: D. Ophir, S. Rankowitz, B. J. Shepherd
Venue: Communications of the ACM (1968)

A multiconsole computer display system has been designed that provides very rich displays at low unit cost. Each BRAD (Brookhaven RAster Display) console can plot tens of thousands of points, or up to 4000 characters at 30 frames per second. After an initial display system investment of $50,000, each display, with teletype, cost less than $3,000. The technique employed is that of programmatically generating a binary image of the desired display in a computer. The image is written on a rotating drum memory. Independent read heads continuously display the picture, which is generated by swept horizontal lines. A standard TV monitor serves as the display device. The technique has two drawbacks. A computer must compute any image to be displayed. Also, the &ldquo;pointing&rdquo; interaction is more difficult. This is because the pointing function gives only the coordinates of the point on the screen. The inverse of the map generation process is required to calculate the coordinates at the input space.
Empirical comparison of software-based error detection and correction techniques for embedded systems
Authors: Royan H. L. Ong, Michael J. Pont
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

&ldquo;Function Tokens&rdquo; and &ldquo;NOP Fills&rdquo; are two methods proposed by various authors to deal with Instruction Pointer corruption in microcontrollers, especially in the presence of high electromagnetic interference levels. An empirical analysis to assess and compare these two techniques is presented in this paper. Two main conclusions are drawn: [1] NOP Fills are a powerful technique for improving the reliability of embedded applications in the presence of EMI, and [2] the use of Function Tokens can lead to a reduction in overall system reliability.
Evaluating a probabilistic model for cross-lingual information retrieval
Authors: Jinxi Xu, Ralph Weischedel, Chanh Nguyen
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

This work proposes and evaluates a probabilistic cross-lingual retrieval system. The system uses a generative model to estimate the probability that a document in one language is relevant, given a query in another language. An important component of the model is translation probabilities from terms in documents to terms in a query. Our approach is evaluated when 1) the only resource is a manually generated bilingual word list, 2) the only resource is a parallel corpus, and 3) both resources are combined in a mixture model. The combined resources produce about 90% of monolingual performance in retrieving Chinese documents. For Spanish the system achieves 85% of monolingual performance using only a pseudo-parallel Spanish-English corpus. Retrieval results are comparable with those of the structural query translation technique (Pirkola, 1998) when bilingual lexicons are used for query translation. When parallel texts in addition to conventional lexicons are used, it achieves better retrieval results but requires more computation than the structural query translation technique. It also produces slightly better results than using a machine translation system for CLIR, but the improvement over the MT system is not significant.
Programming Techniques: ASP&mdash;a ring implemented associative structure package
Authors: C. A. Lang, J. C. Gray
Venue: Communications of the ACM (1968)

ASP is a general purpose Associative Data Structure Package in which an arbitrary number of data items and an arbitrary number of the relationships between these data items may be represented. A special picture language is described which has proved very useful for drawing ASP structures on paper. ASP structures are built and manipulated by means of a series of macro calls, which are outlined in the Appendix. Emphasis is on the philosophy of the system rather than a particular implementation, though sufficient information is included to enable the reader to produce his own implementation of ASP.
Raising awareness of the economic advantages of universal design
Authors: Michael Burks
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

As the work in the field of Universal Design advances, more and more practical solutions to a myriad problems are presenting themselves. The technology now exists to bring products to market at a reasonable price that can be used by a larger number of people than ever before. With the expansion of the Internet and wireless telecommunications networks, this is particularly true. Properly presented huge amounts of information can now be used by the most diverse audience in history. Much of this is due to the implementation of Universal Design Principles in building accessible web sites. But there is a persistent feeling amongst some that this is enormously expensive. What can be done to help everyone understand that implementation of these principles will not only increase the size of the user population for any one product, but is the most economically feasible method for producing goods and services?
Experiment with an automatic theorem-prover having partial ordering inference rules
Authors: James R. Slagle, Lewis M. Norton
Venue: Communications of the ACM (1973)

Automatic theorem-provers need to be made much more efficient. With this in mind, Slagle has shown how the axioms for partial ordering can be replaced by built-in inference rules when using a particular theorem-proving algorithm based upon hyper-resolution and paramodulation. The new rules embody the transitivity of partial orderings and the close relationship between the &sub; and &sube; predicates. A program has been developed using a modified version of these rules. This new theorem-prover has been found to be very powerful for solving problems involving partial orderings. This paper presents a detailed description of the program and a comprehensive account of the experiments that have been performed with it.
A hash code method for detecting and correcting spelling errors
Authors: M. Mor, A. S. Fraenkel
Venue: Communications of the ACM (1982)

The most common spelling errors are one extra letter, one missing letter, one wrong letter, or the transposition of two letters. Deletion, exchange, and rotation operators are defined which detect and &ldquo;mend&rdquo; such spelling errors and thus permit retrieval despite the errors. These three operators essentially delete a letter of a word, exchange two adjacent letters, and rotate a word cyclically. Moreover, the operators can be used in conjunction with hashing, thus permitting very fast retrieval. Results of experiments run on large databases in Hebrew and in English are briefly indicated.
An analysis of inline substitution for a structured programming language
Authors: Robert W. Scheifler
Venue: Communications of the ACM (1977)

An optimization technique known as inline substitution is analyzed. The optimization consists of replacing a procedure invocation by a modified copy of the procedure body. The general problem of using inline substitution to minimize execution time subject to size constraints is formulated, and an approximate algorithmic solution is proposed. The algorithm depends on run-time statistics about the program to be optimized. Preliminary results for the CLU structured programming language indicate that, in programs with a low degree of recursion, over 90 percent of all procedure calls can be eliminated, with little increase in the size of compiled code and a small savings in execution time. Other conclusions based on these results are also presented.