ppxscal/embedding_network huggingface dataset:
Fortran Tausworthe pseudorandom number generator
Authors: W. H. Payne
Venue: Communications of the ACM (1970)

Intermediate computations in an &ldquo;Extremely Portable Random Number Generator&rdquo; by J. B. Kruskal [Comm. ACM 12, 2 (Feb. 1969), 93-94] exceed 15 bits plus sign. This is a severe limitation since the majority of small computers uses a 16 bit (15 bits plus sign) word or less. ASA standard FORTRAN compilers for these machines are readily available. Fortunately, a linearly recurring sequence generator [2] can be written in somewhat &ldquo;portable&rdquo; ASA Standard FORTRAN which will produce maximum length [2** (word size of computer - 1) -1] pseudorandom numbers for common 12, 16, 18, 24, and 32 bit computers, to mention only a few. Following Kendall's algorithm and notation presented by Whittlesey for a p-bit computer: p = 12, N = 11, M = 2; p = 16, N = 15, M = 1, 4, or 7; p = 18, N = 17, M = 3, 5, or 6; p = 24, N = 23, M = 5 or 9; and p = 32, N = 31, M = 3, 6, 7, or 13.
Data bubbles: quality preserving performance boosting for hierarchical clustering
Authors: Markus M. Breunig, Hans-Peter Kriegel, Peer Kröger, Jörg Sander
Venue: Proceedings of the 2001 ACM SIGMOD international conference on Management of data (2001)

In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or random sampling). We propose a three step procedure: 1) compress the data into suitable representative objects; 2) apply the hierarchical clustering algorithm only to these objects; 3) recover the clustering structure for the whole data set, based on the result for the compressed data. The key issue in this approach is to design compressed data items such that not only a hierarchical clustering algorithm can be applied, but also that they contain enough information to infer the clustering structure of the original data set in the third step. This is crucial because the results of hierarchical clustering algorithms, when applied naively to a random sample or to the clustering features (CFs) generated by BIRCH, deteriorate rapidly for higher compression rates. This is due to three key problems, which we identify. To solve these problems, we propose an efficient post-processing step and the concept of a Data Bubble as a special kind of compressed data item. Applying OPTICS to these Data Bubbles allows us to recover a very accurate approximation of the clustering structure of a large data set even for very high compression rates. A comprehensive performance and quality evaluation shows that we only trade very little quality of the clustering result for a great increase in performance.
Letters to the editor: A protection model and its implementation in a dataflow system
Authors: Lubomir Bic
Venue: Communications of the ACM (1982)

A protection model is presented for a general purpose computing system based on tags attached as seals and signatures to values exchanged among processes. A tag attached to a value as a seal does not prevent that value from being propagated to any place within the system; rather, it guarantees that the value and any information derived from it cannot leave the system unless a matching tag is presented. A tag attached to a value as a signature is used by a process to verify the origin of the received data. Solutions to problems from the areas of interprocess communication and proprietary services are given.
Approximate spatio-temporal retrieval
Authors: Dimitris Papadias, Nikos Mamoulis, Vasilis Delis
Venue: ACM Transactions on Information Systems (TOIS) (2001)

This paper proposes a framework for the handling of spatio-temporal queries with inexact matches, using the concept of relation similarity. We initially describe a binary string encoding for 1D relations that permits the automatic derivation of similarity measures. We then extend this model to various granularity levels and many dimensions, and show that reasoning on spatio-temporal structure is significantly facilitated in the new framework. Finally, we provide algorithms and optimization methods for four types of queries: (i) object retrieval based on some spatio-temporal relations with respect to a reference object, (ii) spatial joins, i.e., retrieval of object pairs that satisfy some input relation, (iii) structural queries, which retrieve configurations matching a particular spatio-temporal structure, and (iv) special cases of motion queries. Considering the current large availability of multidimensional data and the increasing need for flexible query-answering mechanisms, our techniques can be used as the core of spatio-temporal query processors.
Formal specification in VHDL for hardware verification
Authors: R. Reetz, K. Schneider, T. Kropf
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

In this paper, we enrich VHDL with new specification constructs intended for hardware verification. Using our extensions, total correctness properties may now be stated whereas only partial correctness can be expressed using the standard VHDL assert statement. All relevant properties can now be specified in such a way that the designer does not need to use formalisms like temporal logics. As the specifications are independent from a certain formalism, there is no restriction to a certain hardware verification approach.
Performance of a computational fluid dynamics code on NEC and Cray supercomputers: beyond 10 gigaflops
Authors: Ferhat F. Hatay
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

The implementation and optimization of a production mode Computational Fluid Dynamics (CFD) software to NEC and Cray supercomputing platforms are discussed. It is intended to assess the impact of different computer architectures and High Power Computing approaches while studying a problem of engineering and scientific importance. The computational model solves the viscous compressible flow equations for high-speed wall-shear layer flows. The code is very versatile and has performed extremely well in vector machines as well as on massively parallel platforms. It is written in FORTRAN programming language while implementing the recent extensions such as HPF and FORTRAN 90. With this approach, an almost perfect level of portability is achieved while the performance on a particular supercomputing platform does not degrade.
Selecting Examples for Partial Memory Learning
Authors: Marcus A. Maloof, Ryszard S. Michalski
Venue: Machine Learning (2000)

This paper describes a method for selecting training examples for a partial memory learning system. The method selects extreme examples that lie at the boundaries of concept descriptions and uses these examples with new training examples to induce new concept descriptions. Forgetting mechanisms also may be active to remove examples from partial memory that are irrelevant or outdated for the learning task. Using an implementation of the method, we conducted a lesion study and a direct comparison to examine the effects of partial memory learning on predictive accuracy and on the number of training examples maintained during learning. These experiments involved the STAGGER Concepts, a synthetic problem, and two real-world problems: a blasting cap detection problem and a computer intrusion detection problem. Experimental results suggest that the partial memory learner notably reduced memory requirements at the slight expense of predictive accuracy, and tracked concept drift as well as other learners designed for this task.
Multigrid Convergence of Calculated Features in Image Analysis
Authors: Reinhard Klette, Joviša Žunić
Venue: Journal of Mathematical Imaging and Vision (2000)

This paper informs about number-theoretical and geometrical estimates of worst-case bounds for quantization errors in calculating features such as moments, moment based features, or perimeters in image analysis, and about probability-theoretical estimates of error bounds (e.g. standard deviations) for such digital approximations. New estimates (with proofs) and a review of previously known results are provided.
The impact of eye gaze on communication using humanoid avatars
Authors: Maia Garau, Mel Slater, Simon Bee, Martina Angela Sasse
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

In this paper we describe an experiment designed to investigate the importance of eye gaze in humanoid avatar's representing people engaged in conversation. We compare responses to dyadic conversations in four mediated conditions: video, audio-only, and two avatar conditions. The avatar conditions differed only in their treatment of eye gaze. In the random-gaze condition the avatars head and eye animations were unrelated to conversational flow. In the informed-gaze condition, they were related to turn-taking during the conversation. The head animations were tracked and the eye animations were inferred from the audio stream. Our comparative analysis of 100 post-experiment questionnaires showed that the random-gaze avatar did not improve on audio-only communication. The informed-gaze avatar significantly outperformed the random-gaze model and also outperformed audio-only on several response measures. We conclude that an avatar whose gaze behaviour is related to the conversation provides a marked improvement on an avatar that merely exhibits liveliness.
Double-precision square root for the CDC-3600
Authors: W. J. Cody
Venue: Communications of the ACM (1964)

In January of 1960, the late Hans J. Maehly completed a summary of approximations to the elementary functions for the CDC-1604 computer. The approximations and techniques suggested by Maehly are equally applicable to the second large computer in the CDC line, the 3600. Unlike the 1604, however, the 3600 has built-in double-precision floating-point arithmetic. The present work, largely inspired by the successes of Maehly and his associates, concerns the extension of one of Maehly's ideas to a double-precision subroutine for the 3600.
Online help systems: a conspectus
Authors: Raymond C. Houghton,  Jr.
Venue: Communications of the ACM (1984)

Users of computer systems are now accustomed to the convenience of online help systems and generally demand these amenities in the computers they buy. However, recent studies as to the efficacy of certain types of assistance for certain classes of users raise important questions for designers.
The Motor Extended Kalman Filter: A Geometric Approach for Rigid Motion Estimation
Authors: Eduardo Bayro-Corrochano, Yiwen Zhang
Venue: Journal of Mathematical Imaging and Vision (2000)

In this paper the motor algebra for linearizing the 3D Euclidean motion of lines is used as the oretical basis for the development of a novel extended Kalman filter called the motor extended Kalman filter (MEKF). Due to its nature the MEKF can be used as online approach as opposed to batch SVD methods. The MEKF does not encounter singularities when computing the Kalman gain and it can estimate simultaneously the translation and rotation transformations. Many algorithms in the literature compute the translation and rotation transformations separately. The experimental part demonstrates that the motor extended Kalman filter is an useful approach for estimation of dynamic motion problems. We compare the MEKF with an analytical method using simulated data. We present also an application using real images of a visual guided robot manipulator&semi; the aim of this experiment is to demonstrate how we can use the online MEKF algorithm. After the system has been calibrated, the MEKF estimates accurately the relative position of the end-effector and a 3D reference line. We believe that future vision systems being reliably calibrated will certainly make great use of the MEKF algorithm.
An Artificial Neural Network Approach to Diagnosing Epilepsy Using Lateralized Bursts of Theta EEGs
Authors: Steven Walczak, William J. Nowack
Venue: Journal of Medical Systems (2001)

Determining the cause of seizures is a significant medical problem, as misdiagnosis can result in increased morbidity and even mortality of patients. The reported research evaluates the efficacy of using an artificial neural network (ANN) for determining epileptic seizure occurrences for patients with lateralized bursts of theta (LBT) EEGs. Training and test cases are acquired from examining records of 1,500 consecutive adult seizure patients. The small resulting pool of 92 patients with LBT EEGs requires using a jack-knife procedure for developing the ANN categorization models. The ANNs are evaluated for accuracy, specificity, and sensitivity on classification of each patient into the correct two-group categorization: epileptic seizure or non-epileptic seizure. The original ANN model using eight variables produces a categorization accuracy of 62%. Following a modified factor analysis, an ANN model utilizing just four of the original variables achieves a categorization accuracy of 68%.
ECBL: an extended corner block list with solution space including optimum placement
Authors: Shuo Zhou, Sheqin Dong, Chung-Kuan Cheng, Jun Gu
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

A Non-Slicing floorplanning algorithm based on CBL[1], corner block list, was presented recently. It can represent non-slicing floorplans without empty rooms. In this paper, we propose an extended corner block list structure, ECBLl, to represent general non-slicing floorplans, which may include empty rooms. By setting l×[1..3], where l is the extending ratio, our algorithm can translate a topological floorplan to its corresponding placement in O(n) time, where n is the number of blocks. Also, based on the optimum solution theorem of bounded-sliceline grid in [2], we proved that the solution space of ECBLn contains the optimum block placement, which has the minimum area. Experimental results on MCNC benchmarks show promising performance with 7% improvement in wire length and 2% decrease in dead space over algorithms based on CBL. Meanwhile, compared with other algorithms, our algorithm can get better results with less runtime.
Model-driven development of Web applications: the AutoWeb system
Authors: Piero Fraternali, Paolo Paolini
Venue: ACM Transactions on Information Systems (TOIS) (2000)

This paper describes a methodology for the development of WWW applications and a tool environment specifically tailored for the methodology. The methodology and the development environment are based upon models and techniques already used in the hypermedia, information systems, and software engineering fields, adapted and blended in an original mix. The foundation of the proposal is the conceptual design of WWW applications, using HDM-lite, a notation for the specification of structure, navigation, and presentation semantics. The conceptual schema is then translated into a &ldquo;traditional&rdquo; database schema, which describes both the organization of the content and the desired navigation and presentation features. The WWW pages can therefore be dynamically generated from the database content, following the navigation requests of the user. A CASE environment, called Autoweb System, offers a set of software tools, which assist the design and the execution of a WWW application, in all its different aspects, Real-life experiences of the use of the methodology and of the AutoWeb System in both the industrial and academic context are reported.
Automatically extracting highlights for TV Baseball programs
Authors: Yong Rui, Anoop Gupta, Alex Acero
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

In today's fast-paced world, while the number of channels of television programming available is increasing rapidly, the time available to watch them remains the same or is decreasing. Users desire the capability to watch the programs time-shifted (on-demand) and/or to watch just the highlights to save time. In this paper we explore how to provide for the latter capability, that is the ability to extract highlights automatically, so that viewing time can be reduced. We focus on the sport of baseball as our initial target&mdash;it is a very popular sport, the whole game is quite long, and the exciting portions are few. We focus on detecting highlights using audio-track features alone without relying on expensive-to-compute video-track features. We use a combination of generic sports features and baseball-specific features to obtain our results, but believe that may other sports offer the same opportunity and that the techniques presented here will apply to those sports. We present details on relative performance of various learning algorithms, and a probabilistic framework for combining multiple sources of information. We present results comparing output of our algorithms against human-selected highlights for a diverse collection of baseball games with very encouraging results.
Is it okay to cheat? - the views of postgraduate students
Authors: Martin Dick, Judy Sheard, Selby Markham
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

This paper examines the attitudes of students in the Masters of Information Technology, Honours Degree in the Bachelor of Computing and Graduate Diploma of Computing at Monash University. Students were surveyed on the acceptability of a variety of scenarios involving cheating and on their knowledge of the occurrence of these scenarios. The survey found a strong consensus amongst the students as to what was acceptable or unacceptable practice. The paper then examines the significance of these results for educators aiming to prevent cheating amongst their students. The study reported is part of a larger study currently being undertaken in the School of Computer Science and Software Engineering (CSSE) at Monash University.
A streamlined system for building online presentation archives using SMIL
Authors: Darren James, Jane Hunter
Venue: Proceedings of the Australasian conference on Computing education (2000)

The demand for and expectation of ubiquitous access to multimedia online learning resources are much higher amongst computer science students than in other fields of study. Previous systems providing internet access to digital video or audio recordings of lectures have been disappointing or ineffective as a learning experience or excessively complex and time-consuming from the educator's point of view. This paper describes a new approach to building an online presentation archive of lectures, based on a relatively new Recommendation from W3C called SMIL (Synchronized Multimedia Integration Language) [8]. It describes a highly efficient and integrated system for capturing, indexing, searching and delivering online presentations without relying upon proprietary technology.
Comments on prevention of system deadlocks
Authors: Richard C. Holt
Venue: Communications of the ACM (1971)

Habermann's method of deadlock prevention is discussed, where deadlock is defined as a system state from which resource allocations to certain processes are not possible. It is shown that the scheduler may introduce &ldquo;artificial&rdquo; deadlocks which Habermann's method does not prevent. Permanent blocking is the situation where certain processes never receive their resource requests. It is shown that deadlock prevention does not necessarily eliminate permanent blocking. A method of preventing permanent blocking is given.
Diagnosing and correcting student's misconceptions in an educational computer algebra system
Authors: Neven Jurkovic
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

Using powerful Computer Algebra programs for mathematics education has been steadily gaining popularity, regardless of inherent user-unfriendliness exhibited by such systems. Algebrator [4, 5] is a CAS specifically designed to teach high-school algebra. Despite its limited domain (or may be because of it), it has proven to be useful to students requiring mastery of basic algebra skills. Algebrator's CA engine is but a small part of the whole system; larger portion of it deals with the way in which the system as an electronic tutor engages the student in the learning process. In this paper we will focus on Algebrator's error diagnostic capability and teacher-directed generation of appropriate remedial tutoring sessions.
STARS of MPEG decoder: a case study in worst-case analysis of discrete-event systems
Authors: Felice Balarin
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

STARS (STatic Analysis of Reactive Systems) is a methodology for worst-case analysis of discrete systems. Theoretical foundations of STARS have been laid down [1, 2, 3], but no implementation has been presented so far. We introduce an implementation of STARS as an extension of YAPI, a programming interface used to model signal processing applications as process networks [7]. We apply STARS to a YAPI model of an MPEG decoder. We show that worst-case bounds computed by STARS are quite close to simulated values (within 15%). We also show that additional effort by the designer required to build STARS models is very small compared to effort of building the YAPI simulation model, and that the run times of STARS are negligible compared to the simulation run times.
Addendum to a multiple-precision division algorithm
Authors: Charles J. Mifsud, Michael J. Bohlen
Venue: Communications of the ACM (1973)

In [1] Mifsud presented a generalized division algorithm for positive integral operands. The uniqueness of the method was advertised as causing each trial cipher in the quotient to be either equal to or one greater than its final replacement. The method of describing the algorithm was intended to stress the simple mathematical facts that were the basis of the algorithm. However, some difficulty arises with the programming and implementation of the algorithm. Article [1] addressed itself to the calculation of the trial cipher by using the first two digits of the partial dividend (step 6); i.e. it formed [pr+1pr/dr], with pr+1 < dr, where the bracket is used to indicate the integral part of its content. Thus the paper conveniently avoided the possibility of overflow which would happen if pr+1 = dr.
Coloring k-colorable graphs using smaller palettes
Authors: Eran Halperin, Ram Nathaniel, Uri Zwick
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We obtain the following new coloring results: A 3-colorable graph on n vertices with maximum degree &Dgr; can be colored, in polynomial time, using &Ogr;((&Dgr; log &Dgr;)1/3 &middot;log n) colors. This slightly improves an &Ogr;((&Dgr;1/3 log&frac12; &Dgr;) &middot; log n) bound given by Karger, Motwani and Sudan. More generally, k-colorable graphs with maximum degree &Dgr; can be colored, in polynomial time, using &Ogr;((&Dgr;1-2/k log1/k &Dgr;) &middot; log n) colors. A 4-colorable graph on n vertices can be colored, in polynomial time, using &Ogr;(n7/19) colors. This improves an &Ogr;(n2/5) bound given again by Karger, Motwani and Sudan. More generally, k-colorable graphs on n-vertices can be colored, in polynomial time, using &Ogr;(n&agr;k) colors, where &agr;5 = 97/207, &agr;6 = 43/79, &agr;7 = 1391/2315, &agr;8 = 175/271, &hellip; The first result is obtained by a slightly more refined probabilistic analysis of the semidefinite programming based coloring algorithm of Karger, Motwani and Sudan. The second result is obtained by combining the coloring algorithm of Karger, Motwani and Sudan, the combinatorial coloring algorithms of Blum and an extension of a technique of Alon and Kahale (which is based on the Karger, Motwani and Sudan algorithm) for finding relatively large independent sets in graphs that are guaranteed to have very large independent sets. The extension of the Alon and Kahale result may be of independent interest.