ppxscal/embedding_network huggingface dataset:
A VLSI Algorithm for Computing the Euclidean Norm of a 3D Vector
Authors: Naofumi Takagi, Seiji Kuwahara
Venue: IEEE Transactions on Computers (2000)

A digit-recurrence algorithm for computing the Euclidean norm of a three-dimensional (3D) vector which often appears in 3D computer graphics is proposed. One of the three squarings required for the usual computation is removed and the other two squarings, as well as the two additions, are overlapped with the square rooting. The Euclidean norm is computed by iteration of carry-propagation-free additions, shifts, and multiplications by one digit. Different specific versions of the algorithm are possible, depending on the radix, the redundancy factor of the digit set, and etc. Each version of the algorithm can be implemented as a sequential (folded) circuit or a combinational (unfolded) circuit, which has a regular array structure suitable for VLSI.
Conversational access to a 2048-word machine
Authors: Mary Allen Wilkes
Venue: Communications of the ACM (1970)

LAP6 is an on-line system running on a 2048-word LINC which provides full facilities for text editing, automatic filing and file maintenance, and program preparation and assembly. It focuses on the preparation and editing of continuously displayed 23,040-character text strings (manuscripts) which can be positioned anywhere by the user and edited by simply adding and deleting lines as though working directly on an elastic scroll. Other features are available through a uniform command set which itself can be augmented by the user. The machine, although small, aids program design by providing display scope and premarked randomly addressable LINC tapes as standard items, in an environment similar to that of a sophisticated terminal. The tapes are logically similar to a disk. Priority was given to the design of efficient tape algorithms to minimize the limitations of the small memory. Techniques developed for handling scroll editing, filing, and the layered system structure are outlined. LAP6 is used by about 2000 people in 11 countries. Its design was strongly influenced by performance criteria established in interviews held with the LINC users themselves during the specification period.
A java API for historical ciphers: an object-oriented design project
Authors: Ralph Morelli, Ralph Walde, Gregg Marcuccio
Venue: ACM SIGCSE Bulletin (2001)

This paper describes a project suitable for a software engineering or object-oriented design course. The project consists of asking students to design an application programming interface (API) for a particular range of applications. An API-design project has several features not always found in application-design projects: It forces students to focus carefully on the distinction between the programming and the user interfaces; it provides a good justification for studying existing APIs as model code; it provides a natural way to divide tasks between different groups of designers/programmers; and, the final product can be used as the basis for programming projects in other courses. In this case the particular project we describe is the design of an API for implementing Historical Cipher algorithms.
Stabilization of Linear Differential Systems via Hybrid Feedback Controls
Authors: Elena Litsyn, Yurii V. Nepomnyashchikh, Arcady Ponosov
Venue: SIAM Journal on Control and Optimization (2000)

We study so-called "hybrid feedback stabilizers" for an arbitrarily general system of linear differential equations. We prove that under assumptions of controllability and observability there exists a hybrid feedback output control which makes the system asymptotically stable. The control is designed by making use of a discrete automaton implanted into the system's dynamics. In general, the automaton has infinitely many locations, but it gives rise to a "uniform" (in some sense) feedback control. The approach we propose goes back to classical feedback control techniques combined with some ideas used in stability theory for equations with time-delay.
Starting approximations for square root calculation on IBM system /360
Authors: C. T. Fike
Venue: Communications of the ACM (1966)

Several starting approximations for square root calculation by Newton's method are presented in a form to facilitate their use in IBM System/360 square root routines. These approximations include several for the range [1/16, 1], which is the interval of primary interest on IBM System/360.
Learning Low-Level Vision
Authors: William T. Freeman, Egon C. Pasztor, Owen T. Carmichael
Venue: International Journal of Computer Vision (2000)

We describe a learning-based method for low-level vision problems&mdash;estimating scenes from images. We generate a synthetic world of scenes and their corresponding rendered images, modeling their relationships with a Markov network. Bayesian belief propagation allows us to efficiently find a local maximum of the posterior probability for the scene, given an image. We call this approach VISTA&mdash;Vision by Image/Scene TrAining.We apply VISTA to the &ldquo;super-resolution&rdquo; problem (estimating high frequency details from a low-resolution image), showing good results. To illustrate the potential breadth of the technique, we also apply it in two other problem domains, both simplified. We learn to distinguish shading from reflectance variations in a single image under particular lighting conditions. For the motion estimation problem in a &ldquo;blobs world&rdquo;, we show figure/ground discrimination, solution of the aperture problem, and filling-in arising from application of the same probabilistic machinery.
Design of an improved transmission/data processing code
Authors: R. W. Bemer, H. J. Smith,  Jr., F. A. Williams,  Jr.
Venue: Communications of the ACM (1961)

Historically there has been strong difference of opinion in the construction of 6-bit (64-character) data codes, based upon whether the code is to be used for communications or data processing. This paper reports on investigation of an improved code which meets transmission requirements and requires very little modification for varied data processing usage.
User-level process checkpoint and restore for migration
Authors: M. Bozyigit, M. Wasiq
Venue: ACM SIGOPS Operating Systems Review (2001)

In simple words, process checkpointing means saving the state of a process, so that, it can be reconstructed in the future. Checkpointing followed by restore is important for the purpose of load balancing and fault tolerance. For load balancing, processes may have to be migrated among workstations. Before migrating, a process has to be checkpointed, so that, it can be restored from where it left off. For fault tolerance, a process must be ready for a restore at a different site. Thus, an earlier checkpoint must be ready for the restore. In both cases the process needs to be restarted from its latest checkpoint, thus work done preceding the checkpoint is not wasted. This paper discusses simple techniques of implementing a user-level checkpoint and restore operations for Unix processes. The technique does not require any changes in the user programs or the operating system. The details given show the simplicity of the implementation.
Increasing the effective bandwidth of complex memory systems in multivector processors
Authors: Anna M. del Corral, Jose M. Llaberia
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

In multivector processors, the lost cycles due to conflicts between concurrent vector streams make the effective throughput be lower than the peak throughput. When the request rate of all the concurrent vector streams to every memory module is less than or equal to the service rate, conflicts appear because concurrent vector streams reference memory modules in different orders. In addition, in a memory system where several memory modules are mapped in every bus (complex memory system) bus conflicts are added to memory module conflicts. This paper proposes an access order to the vector stream elements that reduces the average memory access time in vector processors with complex memory systems. When request rate is greater than the service rate, the proposed order reduces the numbe of lost cycles, and the effective throughput increases. In other cases, the effective throughput reach the peak throughput. The proposed order generates the memory references in such a way that the memory modules shared by the concurrent self-conflict-free vector streams, and the sections where memory modules are mapped, are referenced using the same order.
A correctness proof of a topology information maintenance protocol for a distributed computer network
Authors: William D. Tajibnapis
Venue: Communications of the ACM (1977)

In order for the nodes of a distributed computer network to communicate, each node must have information about the network's topology. Since nodes and links sometimes crash, a scheme is needed to update this information. One of the major constraints on such a topology information scheme is that it may not involve a central controller. The Topology Information Protocol that was implemented on the MERIT Computer Network is presented and explained; this protocol is quite general and could be implemented on any computer network. It is based on Baran's &ldquo;Hot Potato Heuristic Routing Doctrine.&rdquo; A correctness proof of this Topology Information Protocol is also presented.
GaAs FET Current-Mode Integrators and Their Application to Filters
Authors: Nobukazu Takai, Nobuo Fujii
Venue: Analog Integrated Circuits and Signal Processing (2000)

In this paper, current-mode integrators which consist of only n-channel depletion-mode FET and their application to filters are presented. Lossy integrator is simply realized with a capacitor and a grounded gate FET. Lossless integrator can be obtained by providing a lossy integrator with a positive feedback. To do this, multi-output current mirror is proposed. To reduce 2nd-order harmonic and THD of the filter, unbalanced/balanced conversion circuit is proposed. As an application example, 3rd-order leapfrog low-pass Chebyshev filter is simulated with GaAs MESFET process parameters. Simulation results show good performances.
Sympathetic agents assist route in route planning
Authors: P. De Causmaecker, P. Demeester, Ph. De Pauw-Waterschoot, G. Vanden Berghe
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Although many excellent algorithms exist it is still a challenge to take human-like characteristics such as au\-ton\-o\-my, interactivity, intelligence,&hellip; into account in vehicle routing. This paper presents how software agents can be incorporated in a mobile nursing service with time windows; using non-explicit information and discretely imitating human negotiation processes. While keeping the economic cost of the routes down, the system must take the personal requirements and wishes of the nurses into consideration. We demonstrate how the implementation of reciprocal feelings amongst the personnel in agent-like software components can lead to a higher quality global satisfaction.
A generalized text editor
Authors: Christopher W. Fraser
Venue: Communications of the ACM (1980)

Text is not the only data that needs editing; for example, file deletion utilities edit directories. If all &ldquo;editors&rdquo; used the same command language, they would be easier to learn, remember, and code. This paper describes a generalized editor that edits text, directories, binary core images, and certain operating system data with a single user interface.
Experiences in mining aviation safety data
Authors: Zohreh Nazeri, Eric Bloedorn, Paul Ostwald
Venue: Proceedings of the 2001 ACM SIGMOD international conference on Management of data (2001)

The goal of data analysis in aviation safety is simple: improve safety. However, the path to this goal is hard to identify. What data mining methods are most applicable to this task? What data are available and how should they be analyzed? How do we focus on the most interesting results? Our answers to these questions are based on a recent research project we completed. The encouraging news is that we found a number of aviation safety offices doing commendable work to collect and analyze safety-related data. But we also found a number of areas where data mining techniques could provide new tools that either perform analyses that were not considered before, or that can now be done more easily. Currently, Aviation Safety offices collect and analyze the incident reports by a combination of manual and automated methods. Data analysis is done by safety officers who are well familiar with the domain, but not with data mining methods. Some Aviation Safety officers have tools to automate the database query and report generation process. However, the actual analysis is done by the officer with only fairly rudimentary tools to help extract the useful information from the data. Our research project looked at the application of data mining techniques to aviation safety data to help Aviation Safety officers with their analysis task. This effort led to the creation of a tool called the &ldquo;Aviation Safety Data Mining Workbench&rdquo;. This paper describes the research effort, the workbench, the experience with data mining of Aviation Safety data, and lessons learned.
Computer problems of terminology standardization (abstract only)
Authors: Roman Rozhankiws'kyj, Myroslaw Kuzan
Venue: Proceedings of the symposium on Contemporary computing in Ukraine (2000)

Ukrainian alphabet wided in ten stressed vowels as a standart program tool has to be accessible for computer consumers. The Universal table for Ukraine language transliteration from Cyrillic to Latin letters and vice versa was designed and realised as a computer program. The structure of Terminology data bank oriented for concepts system supporting has been designed. Multilingual document (terminology standart or its part) as a holder of concept system is placed at high level and terminology article as a holder of concept description - at low level. An article may belong to many documents or to fictitious (none) document. The instrumental tools based on the hypertext model for establishing and supporting the concept relations has been realised.
Mining and visualizing recommendation spaces for elliptic PDEs with continuous attributes
Authors: Naren Ramakrishnan, Calvin J. Ribbens
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

In this paper we extend previous work in mining recommendation spaces based on symbolic problem features to PDE problems with continuous-valued attributes. We identify the research issues in mining such spaces, present a dynamic programming algorithm form the data-mining literature, and describe how a priori domain metaknowledge can be used to control the complexity of induction. A visualization aid for continuous-valued recommendation spaces is also outlined. Two case studies are presented to illustrate our approach and tools: (i) a comparison of an iterative and a direct linear system solver on nearly singular problems, and (ii) a comparison of two iterative solvers on problems posed on nonrectangular domains. Both case studies involve continuously varying problem and method parameters which strongly influence the choice of best algorithm in particular cases. By mining the results from thousands of PDE solves, we can gain valuable insight into the relative performance of these methods on similar problems.
On the modeling of parallel access to shared data
Authors: A. Chesnais, E. Gelenbe, I. Mitrani
Venue: Communications of the ACM (1983)

A model is constructed of a database that can be accessed and modified concurrently by a number of users, and an approximate solution is presented. The resource allocation policies considered involve dynamic acquisition of entities and locking; deadlock is avoided by limiting the number of consecutive attempts to acquire a particular entity. The accuracy of the approximation is evaluated by simulations. Several generalizations aimed at improving the practicality of the model are described.
Character cluster based Thai information retrieval
Authors: Thanaruk Theeramunkong, Virach Sornlertlamvanich, Thanasan Tanhermhong, Wirat Chinnan
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

Some languages including Thai, Japanese and Chinese do not have explicit word boundary. This causes the problem of word boundary ambiguity that results in decreasing the accuracy of information retrieval. This paper proposes a new technique so-called character clustering to reduce the ambiguity of word boundary in Thai documents and hence improve searching efficiency. To investigate the efficiency, a set of experiments using Thai newspapers is conducted in both non-indexing and indexing searching approaches. The experimental results show our method outperform the traditional methods in both non-indexing and indexing approaches in all measures.
Evaluating enterprise resource planning (ERP) systems using an interpretive approach
Authors: Walter Skok, Michael Legge
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

Enterprise Resource Planning (ERP) systems involve the purchase of pre-written software modules from third party suppliers, rather than bespoke (i.e. specially tailored) production of software requirements, and are often described as a buy rather than build approach to information systems development. Current research has shown that there has been a notable decrease in the satisfaction levels of ERP implementations over the period 1998-2000. The environment in which such software is selected, implemented and used may be viewed as a social activity system, which consists of a variety of stakeholders e.g. users, developers, managers, suppliers and consultants. In such a context, an interpretive research approach (Walsham, 1995) is appropriate in order to understand the influences at work. This paper reports on an interpretive study that attempts to understand the reasons for this apparent lack of success by analyzing issues raised by representatives of key stakeholder groups. Resulting critical success factors are then compared with those found in the literature, most notably those of Bancroft et al (1998). Conclusions are drawn on a wide range of organizational, management and political issues that relate to the multiplicity of stakeholder perceptions.
A caching and streaming framework for mulitmedia
Authors: Shantanu Paknikar, Mohan Kankanhalli, K. R. Ramakrishnan, S. H. Srinivasan, Lek Heng Ngoh
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

In this paper, we explore the convergence of the caching and streaming technologies for Internet multimedia. The paper describes a design for a streaming and caching architecture to be deployed on broadband networks. The basis of the work is the proposed Internet standard, Real Time Streaming Protocol (RTSP), likely to be the de-facto standard for web-based A/V caching and streaming, in the near future. The proxies are all managed by an `Intelligent Agent' or `Broker' - this has been designed as an enhanced RTSP proxy server that maintains the state information that is so essential in streaming of media data. In addition, all the caching algorithms run on the broker. Having an intelligent agent or broker ensures that the `simple' caching servers can be easily embedded into the network. However, RTSP does nor have the right model for doing broker based streaming/caching architecture. The work reported here is an attempt to contribute towards that end.
Computing capabilities at Argentine and Chilean universities
Authors: Aaron Finerman
Venue: Communications of the ACM (1969)

The author reports on a trip to universities in Argentina and Chile during November 1968, describing university conditions and computing activities. As elsewhere, these universities are experiencing student discontent with the status quo and the solutions they are attempting contrast: Argentina is excluding students from participating in university government; Chile is allowing such participation. University computing service and academic activities are limited. The number of computers is small and so is the capacity, none larger than an IBM 360/40; with some exception, computing science academic programs are rare. This situation is by no means attributable to those responsible for computing developments, who strive for excellence; rather the &ldquo;system&rdquo; is hard to overcome. Universities, especially those with strong European traditions, adapt slowly to new academic resources and disciplines; superimposed are the severe technological and economic constraints of the developing nation. Consequently, in the absence of conscious government emphasis on strengthening computing capabilities, future progress may be retarded.
On Harrison's substring testing technique
Authors: Abraham Bookstein
Venue: Communications of the ACM (1973)

This note comments on a technique by Malcolm Harrison [1] that tests whether a given string of characters, S1, is a substring of another string of characters, S2. This technique first transforms S2 into the set consisting of all the smaller fixed size substrings of length k and then hashes each of these segments into the m positions of a computer &ldquo;word&rdquo;; the bit corresponding to a position in this word is turned on if at least one segment is hashed onto it; else it is zero. The test is based on the observation that the same procedure applied to an arbitrary substring of the first string will not turn on any new bits. In the following we shall assume that S1 and S2 are decomposed into l1 and l2 segments respectively.
Proving security protocols with model checkers by data independence techniques
Authors: A. W. Roscoe, P. J. Broadfoot
Venue: Journal of Computer Security (1999)

Model checkers such as FDR have been extremely effective in checking for, and finding, attacks on cryptographic protocols - see, for example, and many of the papers in . Their use in proving protocols has, on the other hand, generally been limited to showing that a given small instance, usually restricted by the finiteness of some set of resources such as keys and nonces, is free of attacks. While for specific protocols there are frequently good reasons for supposing that this will find any attack, it leaves a substantial gap in the method. The purpose of this paper is to show how techniques borrowed from data independence and related fields can be used to achieve the illusion that nodes can call upon an infinite supply of different nonces, keys, etc., even though the actual types used for these things remain finite. It is thus possible to create models of protocols in which nodes do not have to stop after a small number of runs, and to claim that a finite-state run on a model checker has proved that a given protocol is free from attacks which could be constructed in the model used. We develop our methods via a series of case studies, discovering a number of methods for restricting the number of states generated in attempted proofs, and using two distinct approaches to protocol specification.
Accreditation and student assessment in distance education (poster session): why we all need to pay attention
Authors: Lisa C. Kaczmarczyk
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

Distance Education (D.E.) is changing fundamental debates about academic integrity and rigor. The role of teaching and learning is being discussed with respect to both accreditation and student assessment. Evidence suggests that popular methods of student assessment in D.E. differ little from traditional methods. Studies of cheating in D.E. show that perceptions do not match reality. Accrediting agencies are grappling with an inherent educational paradigm shift. Beliefs about professional autonomy and academic freedom may be affected. Computer Scientists are in a unique position to understand the implications of this technology-driven debate. We need to educate ourselves about these issues and make our voices heard.