ppxscal/embedding_network huggingface dataset:
Towards demystification of direct manipulation: cognitive modeling charts the gulf of execution
Authors: David Kieras, David Meyer, James Ballas
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Direct manipulation involves a large number of interacting psychological mechanisms that make the performance of a given interface hard to predict on intuitive or informal grounds. This paper applies cognitive modeling to explain the subtle effects produced by using a keypad versus a touchscreen in a performance-critical laboratory task.
Generating gamma variates by a modified rejection technique
Authors: J. H. Ahrens, U. Dieter
Venue: Communications of the ACM (1982)

A suitable square root transformation of a gamma random variable with mean a &ge; 1 yields a probability density close to the standard normal density. A modification of the rejection technique then begins by sampling from the normal distribution, being able to accept and transform the initial normal observation quickly at least 85 percent of the time (95 percent if a &ge; 4). When used with efficient subroutines for sampling from the normal and exponential distributions, the resulting accurate method is significantly faster than competing algorithms.
Graph rewrite systems for program optimization
Authors: Uwe Assmann
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2000)

Graph rewrite systems can be used to specify and generate program optimizations. For termination of the systems several rule-based criteria are developed, defining exhaustive graph rewrite systems. For nondeterministic systems stratification is introduced which automatically selects single normal forms. To illustrate how far the methodology reaches, parts of the lazy code motion optimization are specified. The resulting graph rewrite system classes can be evaluated by a uniform algorithm, which forms the basis for the optimizer generator OPTIMIX. With this tool several optimizer components have been generated, and some numbers on their speed are presented.
Modelling infection scenarios - a fixed-price eXtreme programming success story
Authors: Joseph Pelrine
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Is it possible to do fixed-price eXtreme Programming projects? How does one bid on a project with changing scope? When is the project finished? These questions and others were addressed in the context of a successful project modeling infection and vaccination scenarios implemented in VisualAge Smalltalk for a noted pharmaceutical company. Interesting results and answers, as well as a short demonstration, will be presented.
Maintenance of 2- and 3-Edge-Connected Components of Graphs II
Authors: Han La Poutré
Venue: SIAM Journal on Computing (2000)

Data structures and algorithms are presented to efficiently maintain the 2- and 3-edge-connected components of a general graph, under insertions of edges and nodes in the graph. At any moment, the data structure can answer whether two nodes are 2- or 3-edge-connected. The algorithms run in O(n+ .\alpha(m,n)) time, where m is the total number of queries and edge insertions. Furthermore, a linear-time algorithm is presented for maintaining the 2-edge-connected components in case the initial graph is connected. Finally, a new solution is presented for the 2-vertex-connected components of a graph.
report on CCITT data communications study group meeting
Authors: S. Gorn, R. W. Bemer, J. Green, E. Lohse
Venue: Communications of the ACM (1964)

Data communications was the subject of a two-week meeting held 24 September through 4 October 1963, in Geneva, Switzerland, by the International Telegraph and Telephone Consultative Committee (CCITT) Special Study Group A. Previous meetings of this group had been held in Geneva in April, 1960, and October, 1961. The CCITT has traditionally been responsible for all standardization activities involving the public telecommunications network of the world. Among the 150 participants, there were eleven USA representatives who represented the Government, various business machine companies and the common carriers.
A ray tracing solution for diffuse interreflection
Authors: Gregory J. Ward, Francis M. Rubinstein, Robert D. Clear
Venue: Proceedings of the 15th annual conference on Computer graphics and interactive techniques (1988)

An efficient ray tracing method is presented for calculating interreflections between surfaces with both diffuse and specular components. A Monte Carlo technique computes the indirect contributions to illuminance at locations chosen by the rendering process. The indirect illuminance values are averaged over surfaces and used in place of a constant "ambient" term. Illuminance calculations are made only for those areas participating in the selected view, and the results are stored so that subsequent views can reuse common values. The density of the calculation is adjusted to maintain a constant accuracy, permitting less populated portions of the scene to be computed quickly. Successive reflections use proportionally fewer samples, which speeds the process and provides a natural limit to recursion. The technique can also model diffuse transmission and illumination from large area sources, such as the sky.
Test Set Compaction Using Relaxed Subsequence Removal
Authors: Michael S. Hsiao, Srimat Chakradhar
Venue: Journal of Electronic Testing: Theory and Applications (2000)

Recent work observed that a subset of states are frequently visited during the simulation of a test set for a sequential circuit. Re-visiting a state implies that a cycle has been traversed in the state diagram. Removal of subsequence responsible for the cycle can lead to static compaction. The size of a cycle is the number of vectors in its subsequence. In this work, we extend the subsequence removal technique to provide significantly higher static compaction for sequential circuits. We show that state relaxation techniques can be used to identify more or larger cycles in a test set. State relaxation creates more opportunities for subsequence removal and hence, results in better compaction. Relaxation of a state is possible since not all memory elements in a finite state machine have to be specified for a state transition. The proposed technique has several advantages: (1) test sets that could not be compacted by existing subsequence removal techniques can now be compacted, (2) the size of cycles in a test set can be significantly increased by state relaxation and removal of the larger sized cycles leads to better compaction, (3) only two fault simulation passes are required as compared to trial and re-trial methods that require multiple fault simulation passes, and (4) significantly higher compaction is achieved in short execution times as compared to known subsequence removal methods. Experiments on ISCAS89 sequential benchmark circuits and several synthesized circuits show that the proposed technique consistently results in significantly higher compaction in short execution times.
uu for programming languages
Authors: Ulisses Ferreira
Venue: ACM SIGPLAN Notices (2000)

The Internet has motivated new programming language features and, in this article, we consider that programming for such a global environment requires the ability to deal with what is unknown because connections often fail or delay and programs should be robust. Thus, we concentrate on this particular issue.In this article we present uu, a value that can represent lack of information in programming languages. A thesis is that this value is a good feature towards the unification of some programming paradigms. Thus, in this article, we explore constructs as consequences of uu in such languages together with examples where this value helps in programming, and we explain the relationship between uu and another programming paradigm. The implementation of uu is also briefly discussed.
Mediacaptain - an interface for browsing streaming media
Authors: Florian Mueller
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

The increase of bandwidth and streaming technology has made video on the Web the current &ldquo;killer-app&rdquo; of the dot-com world. However, users still face many problems. Users have to find the right video and the right segment within the video. Locally stored files provide easy (but still not very sophisticated) access to individual points in the video by utilizing a seek slider. If the video is streamed over the Internet, this slider loses much of its attraction. Every accessed point in the video requires the video player to buffer, which causes a time lag. The mediacaptain is a system that addresses this issue by using supplementary material like text and graphics to provide indices. This time-aligned material is used to help the user make an informed decision on whether they want to watch a video and if so, what portions. This web-enabled prototype called mediacaptain emerged from user surveys and is demonstrated on several content types and represents an advanced experience with video on the Web.
Correspondences of 8-bit and Hollerith codes for computer environments&mdash;a USASI tutorial
Authors: E. Lohse
Venue: Communications of the ACM (1968)

The correspondence tables in the document reflect USASCII standard code assignments as well as other codes. Comments that refer to the assignments of characters or character sets in columns 8 through 15 of Table 1 as a basis for standardization are solicited.
Layout Dependent Matching Analysis of CMOS Circuits
Authors: Kenichi Okada, Hidetoshi Onodera, Keikichi Tamaru
Venue: Analog Integrated Circuits and Signal Processing (2000)

Layout has strong influence on matching properties of a circuit. Current matching models, which characterize both local random non-uniformities and global systematic non-uniformities stochastically, are not adequate for the matching analysis taking the effect of layout realization into account. In order to consider topological information of layout into matching analysis, we propose a matching model which treats the random and systematic components separately. Also, we characterize the micro-loading effect, which modulates fabricated line-width according to the local density of layout patterns, into matching analysis. With these two techniques, we can perform matching analysis of CMOS circuits taking layout information into account.
IMPACT: a high-level synthesis system for low power control-flow intensive circuits
Authors: K. S. Khouri, G. Lakshminarayana, N. K. Jha
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

In this paper, we present a comprehensive high-level synthesis system that is geared towards reducing power consumption in control-flow intensive circuits. An iterative improvement algorithm is at the heart of the system. The algorithm searches the design space by handling scheduling, module selection, resource sharing and multiplexer network restructuring simultaneously. The scheduler performs concurrent loop optimization and implicit loop unrolling. It minimizes the expected number of cycles of the schedule without compromising on the minimum and maximum schedule lengths. A fast simulation technique based on trace manipulation aids power estimation in driving synthesis in the right direction. Experimental results demonstrate power reduction of up to 85% with minimal overhead in area over area-optimized designs operating at 5V.
View-based consistency and false sharing effect in distributed shared memory
Authors: Z. Huang, C. Sun, M. Purvis, S. Cranefield
Venue: ACM SIGOPS Operating Systems Review (2001)

This paper proposes a novel View-based Consistency model for Distributed Shared Memory. A view is a set of ordinary data objects that a processor has the right to access in a data-race-free program. The View-based Consistency model requires that the data objects of a view are made up-to-date only before a processor accesses them. Compared with other memory consistency models, the View-based Consistency model can achieve data selection without user annotation and reduce more false sharing effect.
Improved interpretation of UNIX-like file names embedded in data
Authors: Douglas W. Jones
Venue: Communications of the ACM (1984)

When the data processed by a program span several files, the common practice of including file names as data in some of the files leads to difficulties in moving or sharing that data. In systems using tree structured directories, this problem can be solved by making a syntactic distinction between absolute and relative file names.
A method of comparing the time requirements of sorting methods
Authors: Michael H. Hall
Venue: Communications of the ACM (1963)

Formulas have been developed for estimating the sorting time required by most of the known internal sorting methods in terms of parameters describing the file to be sorted and the computer time required for basic sorting operations. Procedures are described for using these estimates to compare the efficiency of various methods, and results of several comparisons are given. A procedure to determine optimum combinations of sorting methods is shown. An expression for tape time required by a balanced merge sort is obtained, and difficulties in obtaining such expressions for cascade, polyphase and oscillating sorts are discussed.
Path verification using Boolean satisfiability
Authors: M. Ringe, T. Lindenkreuz, E. Barke
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

The importance of identifying false paths in a combinational circuit cannot be overstated since they may mask the true delay. We present a fast algorithm based on boolean satisfiability for solving this problem. We also present extensions to this per-path approach to find the critical path of a circuit in a reasonable time.
A Serial-Parallel Architecture for Two-Dimensional Discrete Cosine and Inverse Discrete Cosine Transforms
Authors: Hyesook Lim, Vincenzo Piuri, Earl E. Swartzlander
Venue: IEEE Transactions on Computers (2000)

The Discrete Cosine and Inverse Discrete Cosine Transforms are widely used tools in many digital signal and image processing applications. The complexity of these algorithms often requires dedicated hardware support to satisfy the performance requirements of hard real-time applications. This paper presents the architecture of an efficient implementation of a two-dimensional DCT/IDCT transform processor via a serial-parallel systolic array that does not require transposition.
Systematic recursion removal
Authors: M. A. Auslander, H. R. Strong
Venue: Communications of the ACM (1978)

The recursion removal algorithm presented by Strong and Walker is amplified and applied to a relatively complex PL/I program. The aim is to demonstrate systematic recursion-removal techniques on something more complex than Knuth's &ldquo;sturdy toddler&rdquo; and to obtain measurements of the cost of procedure linkage in PL/I and the savings achievable via procedure integration in the presence of recursion. First, the paper describes the recursion-removal process and the example on which it will be illustrated. Recursion removal is then applied to the two major parts of this example and the final result of the process is displayed. Our performance comparison results are presented, and our conclusions are briefly discussed
Recovery of Drawing Order from Single-Stroke Handwriting Images
Authors: Yoshiharu Kato, Makoto Yasuhara
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

This paper describes a new method to recover a drawing order of a handwritten script from a static 2D image. The script should be written in a single stroke and may include double-traced lines. After the script is scanned in and preprocessed, we apply our recovery method which consists of two phases. In the first phase, we globally analyze the graph constructed from the skeletal image and label the graph by determining the types of each edge. In the second phase, we trace the graph from the start vertex to the end vertex using the labeling information. This method does not enumerate the possible cases, for example, by solving the traveling salesman problem and, therefore, does not cause a combinatorial explosion even if the script is very complex. By recovering a drawing order of a handwritten script, the temporal information can be recovered from a static 2D image. Hence, this method will be used as a bridge from the offline handwriting character recognition problem to the online one.
A systematic analysis of reuse strategies for design of electronic circuits
Authors: M. Koegst, P. Conradi, D. Garte, M. Wahl
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

In this paper a number of reuse approaches for circuit design are analysed. Based on this analysis an algebraic core model for discussion of a general reuse strategy is proposed. Using this model, the aim is to classify different reuse approaches for circuit design, to compare the applied terms and definitions, and to formulate classes of typical reuse tasks. In a practical application with focus on retrieval and parameterisation techniques, this model is on the way to being applied to DSP design issues.
GeneyTM: designing a collaborative activity for the palmTM handheld computer
Authors: Arman Danesh, Kori Inkpen, Felix Lau, Keith Shu, Kellogg Booth
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

This paper describes a project to explore issues surrouding the development of a collaborative handheld educational application for children. A user-centered, iterative design process was used to develop GeneyTM, a collaborative problem solving application to help children explore genetic concepts using PalmTM handheld computers. The design methodology utilized mock-ups of representative tasks and scenarios, pre-design meetings with targets users, prototype development, and feedback sessions with target users. The results of this work identify an effective way of utilizing handheld computers for collaborative learning and provide important insights into the design of handheld applications for children. This work also illustrates the necessity of user-centered design when new user groups are targeted, especially when novel user interface paradigms are employed that go beyond current windows-based interfaces.
On specifying security policies for web documents with an XML-based language
Authors: Elisa Bertino, Silvana Castano, Elena Ferrari
Venue: Proceedings of the sixth ACM symposium on Access control models and technologies (2001)

The rapid growth of the Web and the ease with which data can be accessed facilitate the distribution and sharing of information. Information dissemination often takes the form of documents that are made available at Web servers, or that are actively broadcasted by Web servers to interested clients. In this paper, we present an XML-compliant formalism for specifying security-related information for Web document protection. In particular, we introduceX-Sec, an XML-based language for specifying subject credentials and security policies and for organizing them into subject profiles and policy bases, respectively. The language is complemented by a set of subscription-based schemes for accessing distributed Web documents, which rely on defined XML subject profiles and XML policy bases.
Specifying queries as relational expressions: the SQUARE data sublanguage
Authors: Raymond F. Boyce, Donald D. Chamberlin, W. Frank King,  III, Michael M. Hammer
Venue: Communications of the ACM (1975)

This paper presents a data sublanguage called SQUARE, intended for use in ad hoc, interactive problem solving by non-computer specialists. SQUARE is based on the relational model of data, and is shown to be relationally complete; however, it avoids the quantifiers and bound variables required by languages based on the relational calculus. Facilities for query, insertion, deletion, and update on tabular data bases are described. A syntax is given, and suggestions are made for alternative syntaxes, including a syntax based on English key words for users with limited mathematical background.
An experimental evaluation of data type conventions
Authors: J. D. Gannon
Venue: Communications of the ACM (1977)

The language in which programs are written can have a substantial effect on the reliability of the resulting programs. This paper discusses an experiment that compares the programming reliability of subjects using a statically typed language and a &ldquo;typeless&rdquo; language. Analysis of the number of errors and the number of runs containing errors shows that, at least in one environment, the use of a statically typed language can increase programming reliability. Detailed analysis of the errors made by the subjects in programming solutions to reasonably small problems shows that the subjects had difficulty manipulating the representation of data.
Variable-width tables with binary-search facility
Authors: Mark Halpern
Venue: Communications of the ACM (1958)

The family of subroutines described in this report was designed to create, search and maintain tables which are to contain entries of different lengths, and yet be amenable to search by partition, or &ldquo;binary&rdquo; search. It is designed explicitly for fixed-word-length binary machines; the tables in question are the argument-function type, with the two parts physically separated&mdash;i.e., no one machine word contains both, or parts of both. The family consists at present of seven subroutines, of which four are primitive and three second-generation. (By &ldquo;primitive&rdquo; is meant a self-sufficient routine; a second-generation routine is one which calls on one or more primitives.) These routines are at present coded for the IBM 709; with a few trivial changes they are ready also for the 704. The primitives are: (1) STT (Start Table), (2) TLU (Table Look-Up), (3) ITC (Increase Table Capacity), and (4) AOD (Append Ordered Data). The second-generation routines are: (1) INT (Insert in Table), (2) INX (Insert and Expand), and (3) ANX (Append and Expand). It is intended that this family be written, with modifications as necessary, for several stored-program computers. The calling-sequences for any one of the routines will, as far as possible, be identical on the several machines.
Pushing politely: improving Web responsiveness one packet at a time
Authors: Brian D. Davison, Vincenzo Liberatore
Venue: ACM SIGMETRICS Performance Evaluation Review (2000)

The rapid growth of traffic on the World-Wide Web results in heavier loads on networks and servers and in increased latency experienced while retrieving web documents. This paper presents a framework that exploits idle periods to satisfy future HTTP requests speculatively and opportunistically. Our proposal differs from previous schemes in that speculative dissemination always gives precedence to on-demand traffic, uses ranged requests for improved performance, and can be implemented over a connectionless transport. The protocol uses bounded and little server state even as the workload was increased and it is resistant to erroneous estimates of available bandwidth. Substantial latency improvements are reported over pure on-demand strategies.