ppxscal/embedding_network huggingface dataset:
Time Aura: interfaces for pacing
Authors: Lena Mamykina, Elizabeth Mynatt, Michael A. Terry
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Historically one of the visions for human-computer symbiosis has been to augment human intelligence and extend people's cognitive abilities. In this paper, we present two visually-based systems to enhance a person's ability to flexibly control their pace while engaged in a cognitively demanding activity. In these investigations, we explore pacing interfaces that minimize the cognitive demands for assessing a current pace, provide ambient cues that can be quickly interpreted without incurring significant interruption from the current task, and place knowledge in the world to flexibly support different pacing strategies. Evaluation of our pacing interfaces shows that technology can successfully support pacing.
Analysis of the Xedni Calculus Attack
Authors: Michael J. Jacobson Neal Koblitz Joseph H. Silverman Andreas Stein Edlyn Teske
Venue: Designs, Codes and Cryptography (2000)

The xedni calculus attack on the elliptic curve discrete logarithm problem (ECDLP) involves lifting points from the finite field{\Bbb F}_p to the rational numbers {\Bbb Q} and then constructing an elliptic curve over {\Bbb Q} that passes through them. If the lifted points are linearly dependent, then the ECDLP is solved. Our purpose is to analyze the practicality of this algorithm. We find that asymptotically the algorithm is virtually certain to fail, because of an absolute bound on the size of the coefficients of a relation satisfied by the lifted points. Moreover, even for smaller values of p experiments show that the odds against finding a suitable lifting are prohibitively high.
Partial Evaluation of Views
Authors: Parke Godfrey, Jarek Gryz
Venue: Journal of Intelligent Information Systems (2001)

Many database applications and environments, such as mediation over heterogeneous database sources and data warehousing for decision support, lead to complex queries. Queries are often nested, defined over previously defined views, and may involve unions. There are good reasons why one might want to &ldquo;remove&rdquo; pieces (sub-queries or sub-views) from such queries: some sub-views of a query may be effectively cached from previous queries, or may be materialized views&semi; some may be known to evaluate empty, by reasoning over the integrity constraints&semi; and some may match protected queries, which for security cannot be evaluated for all users.In this paper, we present a new evaluation strategy with respect to queries defined over views, which we call tuple-tagging, that allows for an efficient &ldquo;removal&rdquo; of sub-views from the query. Other approaches to this are to rewrite the query so the sub-views to be removed are effectively gone, then to evaluate the rewritten query. With the tuple tagging evaluation, no rewrite of the original query is necessary.We describe formally a discounted query (a query with sub-views marked that are to be considered as removed), present the tuple tagging algorithm for evaluating discounted queries, provide an analysis of the algorithm's performance, and present some experimental results. These results strongly support the tuple-tagging algorithm both as an efficient means to effectively remove sub-views from a view query during evaluation, and as a viable optimization strategy for certain applications. The experiments also suggest that rewrite techniques for this may perform worse than the evaluation of the original query, and much worse than the tuple tagging approach.
Simulations of dynamic sequential search algorithms
Authors: Aaron Tenenbaum
Venue: Communications of the ACM (1978)

In [3], R.L. Rivest presents a set of methods for dynamically reordering a sequential list containing N records in order to increase search efficiency. The method Ai (for i between 1 and N) performs the following operation each time that a record R has been successfully retrieved: Move R forward i positions in the list, or to the front of the list if it was in a position less than i. The method A1 is called the transposition method, and the method AN-1 is called the move-to-front method.
More on algorithms that reveal properties of floating point arithmetic units
Authors: W. Morven Gentleman, Scott B. Marovich
Venue: Communications of the ACM (1974)

In the interests of producing portable mathematical software, it is highly desirable for a program to be able directly to obtain fundamental properties of the environment in which it is to run. The installer would then not be obliged to change appropriate magic constants in the source code, and the user would not have to provide information he may very well not understand. Until the standard definitions of programming languages are changed to require builtin functions that provide this information [1, 3], we will have to resort to writing routines that discover it.
Area-efficient buffer binding based on a novel two-port FIFO structure
Authors: Kyoungseok Rha, Kiyoung Choi
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

In this paper, we address the problem of minimizing buffer storage requirement in buffer binding for SDF (Synchronous Dataflow) graphs. First, we propose a new two-port FIFO buffer structure that can be efficiently shared by two producer/consumer pairs. Then we propose a buffer binding algorithm based on this two-port buffer structure for minimizing the buffer size requirement. Experimental results demonstrate 9.8%~37.8% improvement in buffer requirement compared to the conventional approaches.
JouleTrack: a web based tool for software energy profiling
Authors: Amit Sinha, Anantha P. Chandrakasan
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

A software energy estimation methodology is presented that avoids explicit characterization of instruction energy consumption and pre-dicts energy consumption to within 3% accuracy for a set of bench-mark programs evaluated on the StrongARM SA-1100 and Hitachi SH-4 microprocessors. The tool, JouleTrack, is available as an online resource and has various estimation levels. It also isolates the switch-ing and leakage components of the energy consumption.
Distributed information system on an Internet/intranet environment (DISI2E)
Authors: Oscar Luiz Monteiro de Farias
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

This paper relates our experience in developing DISI2E - a distributed system on an Internet/Intranet environment; built from modules the same way children play LEGO. These modules can be any kind of file visualized by a browser: pictures, html files, audio files, animations files and other types of files visualized via a plug-in, like executable programs (CGI), applets and queries to databases. The user through an interface very similar to the Windows Explorer selects these modules. Then, these modules, following the object-oriented paradigm, are related basically in part-of relations (containment relationships, like regions on a map) or some of them &mdash; simpler &mdash; are taken as attributes of more complex ones. All the user needs to operate DISI2E are http (hyper text transfer protocol) servers &mdash; to publish the distributed information &mdash; and browsers, enabling users to navigate through the distributed system visualizing non-structured information, querying databases and executing programs.
Using and teaching information hiding in single-semester software engineering projects
Authors: Mark Evered, Gisela Menger
Venue: Proceedings of the Australasian conference on Computing education (2000)

The information-hiding principle is recognised as one of the fundamental principles of software engineering. This paper reports on two kinds of experience the authors have gained in using and teaching information hiding in software engineering projects. The first relates to the enormous practical and pedagogical advantages of taking a strict approach. The second is the suprising lack of support for such an approach in the object-oriented programming languages commonly used for such projects.
Computer-aided analysis and design of information systems
Authors: J. F. Nunamaker,  Jr., Benn R. Konsynski,  Jr., Thomas Ho, Carl Allen Singer
Venue: Communications of the ACM (1976)

This paper describes the use of computer-aided analysis for the design and development of an integrated financial management system by the Navy Material Command Support Activity (NMCSA). Computer-aided analysis consists of a set of procedures and computer programs specifically designed to aid in the process of applications software design, computer selection and performance evaluation. There are four major components: Problem Statement Language, Problem Statement Analyzer, Generator of Alternative Designs, and Performance Evaluator. The statement of requirements was written in ADS (Accurately Defined Systems) and analyzed by a Problem Statement Analyzer for ADS. The ADS problem definition was supplemented with additional information in order to create a complete problem definition. The analyzed problem statement was translated to the form necessary for use by the SODA (Systems Optimization and Design Algorithm) program for the generation of alternative specifications of program modules and logical database structures.
A study of thresholding strategies for text categorization
Authors: Yiming Yang
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Thresholding strategies in automated text categorization are an underexplored area of research. This paper presents an examination of the effect of thresholding strategies on the performance of a classifier under various conditions. Using k-Nearest Neighbor (kNN) as the classifier and five evaluation benchmark collections as the testbets, three common thresholding methods were investigated, including rank-based thresholding (RCut), proportion-based assignments (PCut) and score-based local optimization (SCut); in addition, new variants of these methods are proposed to overcome significant problems in the existing approaches. Experimental results show that the choice of thresholding strategy can significantly influence the performance of kNN, and that the ``optimal'' strategy may vary by application. SCut is potentially better for fine-tuning but risks overfitting. PCut copes better with rare categories and exhibits a smoother trade-off in recall versus precision, but is not suitable for online decision making. RCut is most natural for online response but is too coarse-grained for global or local optimization. RTCut, a new method combining the strength of category ranking and scoring, outperforms both PCut and RCut significantly.
The relevance of design in CS1
Authors: Amparo López Gaona
Venue: ACM SIGCSE Bulletin (2000)

Most of the papers on the experiences in teaching the first object-oriented programming course are biased towards the selection of the best programming language. Sometimes we argue the pros and cons of particular languages (C, C++, Java). My point is that teaching a programming methodology is the most important element for such a course.
Mobile Robot Relocation from Echolocation Constraints
Authors: Jong Hwan Lim, John J. Leonard
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

This paper presents a method for relocation of a mobile robot using sonar data. The process of determining the pose of a mobile robot with respect to a global reference frame in situations where no a priori estimate of the robot's location is available is cast as a problem of searching for correspondences between measurements and an a priori map of the environment. A physically-based sonar sensor model is used to characterize the geometric constraints provided by echolocation measurements of different types of objects. Individual range returns are used as data features in a constraint-based search to determine the robot's position. A hypothesize and test technique is employed in which positions of the robot are calculated from all possible combinations of two range returns that satisfy the measurement model. The algorithm determines the positions which provide the best match between the range returns and the environment model. The performance of the approach is demonstrated using data from both a single scanning Polaroid sonar and from a ring of Polaroid sonar sensors.
Cacheminer: A Runtime Approach to Exploit Cache Locality on SMP
Authors: Yong Yan, Xiaodong Zhang, Zhao Zhang
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

Exploiting cache locality of parallel programs at runtime is a complementary approach to a compiler optimization. This is particularly important for those applications with dynamic memory access patterns. We propose a memory-layout oriented technique to exploit cache locality of parallel loops at runtime on Symmetric Multiprocessor (SMP) systems. Guided by application-dependent and targeted architecture-dependent hints, our system, called Cacheminer, reorganizes and partitions a parallel loop using the memory-access space of its execution. Through effective runtime transformations, our system maximizes the data reuse in each partitioned data region assigned in a cache, and minimizes the data sharing among the partitioned data regions assigned to all caches. The executions of tasks in the partitions are scheduled in an adaptive and locality-preserved way to minimize the execution time of programs by trading off load balance and locality. We have implemented the Cacheminer runtime library on two commercial SMP servers and an SimOS simulated SMP. Our simulation and measurement results show that our runtime approach can achieve comparable performance with the compiler optimizations for programs with regular computation and memory-access patterns, whose load balance and cache locality can be well optimized by the tiling and other program transformations. However, our experimental results show that our approach is able to significantly improve the memory performance for the applications with irregular computation and dynamic memory access patterns. These types of programs are usually hard to optimize by static compiler optimizations.
Dynamic Task Scheduling Using Online Optimization
Authors: Babak Hamidzadeh, Lau Ying Kit, David J. Lilja
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

Algorithms for scheduling independent tasks on to the processors of a multiprocessor system must trade-off processor load balance, memory locality, and scheduling overhead. Most existing algorithms, however, do not adequately balance these conflicting factors. This paper introduces the Self-Adjusting Dynamic Scheduling (SADS) class of algorithms that use a unified cost model to explicitly account for these factors at runtime. A dedicated processor performs scheduling in phases by maintaining a tree of partial schedules and incrementally assigning tasks to the least-cost schedule. A scheduling phase terminates whenever any processor becomes idle, at which time partial schedules are distributed to the processors. An extension of the basic SADS algorithm, called DBSADS, controls the scheduling overhead by giving higher priority to partial schedules with more task-to-processor assignments. These algorithms are compared to two distributed scheduling algorithms within a database application on an Intel Paragon distributed-memory multiprocessor system.
Gene functional classification from heterogeneous data
Authors: Paul Pavlidis, Jason Weston, Jinsong Cai, William Noble Grundy
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

In our attempts to understand cellular function at the molecular level, we must be able to synthesize information from disparate types of genomic data. We consider the problem of inferring gene functional classifications from a heterogeneous data set consisting of DNA microarray expression measurements and phylogenetic profiles from whole-genome sequence comparisons. We demonstrate the application of the support vector machine (SVM) learning algorithm to this functional inference task. Our results suggest the importance of exploiting prior information about the heterogeneity of the data. In particular, we propose an SVM kernel function that is explicitly heterogeneous. We also show how to use knowledge about heterogeneity to aid in feature selection.
Comparison of iterative methods for the calculation of nth roots
Authors: J. F. Traub
Venue: Communications of the ACM (1961)

Three iterative methods for calculation of nth roots (including one proposed by the author) are compared in two ways: (1) Theoretical convergence estimates are given. (2) A new macro-compiler which estimates machine running time is used to compare the running time of the three methods for a variety of input data.
Mark sense and port-a-punch programming inputs
Authors: William F. Luebbert
Venue: Communications of the ACM (1964)

The United States Military Academy is faced with the situation whereby 700 cadets may in a single subject prepare computer programs in class one day and get their solutions in the form of a computer runoff at their next class attendance. If the programs had to be processed by conventional keypunch techniques the peak requirements for keypunching would be overwhelming. Keypunched cards with operator errors caused by misinterpreted coding sheets could not be returned to students for review and correction prior to the time the solutions are required in class. This situation has caused the Military Academy to investigate methods bypassing the keypunching operation. A number of special type mark-sense and Port-A-Punch cards have been used. Figure 1 shows a card used with SADSAC, a simplified academic design single address computer; Figure 2, a card for SASSY, a symbolic assembly program; Figure 3, a card for CADETRAN, a dialect of FORTRAN. (It contains the arithmetic statement X = 3.5 * A/(K**2 - C**2).) The CADETRAN/FORTRAN card is printed in four colors. Numbers (which require marking of a single position) are printed in black. Letters of the first third of the alphabet are printed in green, as is the 12-zone position which is identified A&rarr;I. Middle third letters of the alphabet are printed in red, as is the 11-zone position identified J&rarr;R. The final third of the alphabet is printed in blue as is the 0-zone position, and identified as S&rarr;Z. Commonly used symbols which would require 3 marks have been brought out to a separate left column where a single mark serves to identify them. Common but lengthy verbs such as FORMAT, DIMENSION and READ may also be represented by a single mark.
Computer science&mdash;seminars for undergraduates
Authors: Abraham Kandel
Venue: Communications of the ACM (1973)

In recent years a number of curricula for computer science education have been proposed. Most notable among these are [1-4]. The results from these four studies were unbalanced oriented educational programs each with a different primary emphasis on various aspects of computer science and its application. None offered a prescription within the undergraduate framework for a satisfactory synthesis of hardware, software, and abstract theory.
Information science in a Ph.D. computer science program
Authors: G. Salton
Venue: Communications of the ACM (1969)

This report contains recommendations on a sample course curriculum in the general area of information organization and information system design in a Ph.D. Computer Science Program. The subject area is first briefly described, followed by a listing of some desirable graduate-level courses. Suitable bibliographies are appended.
A Fast Computational Procedure to Solve the Multi-Item Single Machine Lot Scheduling Optimization Problem: The Average Cost Case
Authors: L. S. Aragone, R. L. V. González
Venue: Mathematics of Operations Research (2000)

In this paper we present some special procedures for the numerical solution of the optimal scheduling problem of a multi-item single machine. We study the in6nite horizon case when the optimization criterion is the average cost. We establish the solution of the problem in terms of viscosity solutions of the Quasi-Variational Inequality (QVI) system associated to the problem. The existence of solution of the QVI and the uniqueness of the optimal average cost are proved. A method of discretization and a computational procedure are described. They allow us to compute the solution in a short time and with precision of orderk. We obtain an estimate for the discretization error and develop an algorithm that converges in a finite number of steps. In our method the nodes of the triangulation mesh are joined by segments of trajectories of the original system. This feature allows us to obtain thek-order precision which, in general, is impossible to obtain by usual methods.
Game interpretation of the deadlock avoidance problem
Authors: R. Devillers
Venue: Communications of the ACM (1977)

The deadlock avoidance problem may be defined informally as the determination, from some a priori information about the processes, resources, operating system, etc., of the &ldquo;safe situations&rdquo; which may be realized without endangering the smooth running of the system. When each process specifies its future needs by a flowchart of need-defined steps, a global approach to the phenomenon and its interpretation as a game between the operating system and the processes allows formalization of risk and safety concepts. The bipartite graph representation of this game may then be used to construct explicitly the set of safe states and to study their properties.
Information Retrieval: Easy English, a language for information retrieval through a remote typewriter console
Authors: M. Rubinoff, S. Bergman, F. Rapp, H. Cautin
Venue: Communications of the ACM (1968)

Easy English is a natural command language designed to simplify communication between man and machine through remote typewriter console. It has been developed for retrieval of documents from a computerized data base, the Moore School Information Systems Laboratory files. Requests are formulated in a standardized syntactical form (examples of which are presented), and this form is then transformed into an equivalent query expressed in the retrieval system's original Symbolic Command Language, which is briefly described. Operation of Easy English is detailed by illustration of the transformations performed upon a sample request up to the point at which the request string is sent to the system. A macro flowchart of Easy English is included, and an Appendix provides the printout of a retrieval demonstration.
Information Theoretic Measure for Visual Target Distinctness
Authors: Jose A. García, Joaquín Fdez-Valdivia, Xose R. Fdez-Vidal, Rosa Rodriguez-Sánchez
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

It is of great benefit to have advance knowledge of human visual target acquisition performance for targets or other relevant objects. However, search performance inherently shows a large variance and depends strongly on prior knowledge of the perceived scene. A typical search experiment therefore requires a large number of observers to obtain statistically reliable data. Moreover, measuring target acquisition performance in field situations is usually impractical and often very costly or even dangerous. This paper presents a new method for characterizing information of a target relative to its background. The resultant computational measures are then applied to quantify the visual distinctness of targets in complex natural backgrounds from digital imagery. A generalization of the Kullback-Leibler joint information gain of various random variables is shown to correlate strongly with visual target distinctness as estimated by human observers. Bootstrap methods for assessing statistical accuracy were used to produce this inference.