ppxscal/embedding_network huggingface dataset:
An efficient accessing technique of Chinese characters using Boshiamy Chinese input system
Authors: Chin-Chen Chang, Tung-Shou Chen, Yi Lin
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

In this paper, a new efficient technique for Chinese character retrieval is proposed. This technique designs a minimal perfect hashing function based on the Chinese remainder theorem for a simply and widely used Chinese input system called Boshiamy Chinese input system. The hashing function accepts the input key sequence of Boshiamy and calculates the address of the corresponding Chinese character. The Chinese character therefore can be retrieved through the computed address directly. Consequently, this technique is suitable for Boshiamy Chinese input system and could retrieve Chinese characters very efficiently.
Device-level placement for analog layout: an opportunity for non-slicing topological representations
Authors: Florin Balasa
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Layout design for analog circuits has historically been a time consuming error-prone, manual task. Its complexity results not so much from the number of devices, as from the complex interactions among devices, as from the complex interactions among devices or with the operating environment, and also from continuous-valued performance specifications. This paper addresses the problem the device-level placement for analog layout in a non-traditional way. Different from the traditional approaches -exploring a huge search space with a combinatorial optimization technique, where the cells are represented by means of absolute coordinates, being allowed to illegally overlap during their moves in the chip plane - this paper advocates the use of non-slicing topological representations, like (symmetric-feasible) sequence-pairs, ordered- and binary- trees. Extensive tests, processing industrial analog designs, have shown that using skillfully the symmetry constraints (very typical to analog circuits) to remodel the solution space of the encoding systems, the topological representation techniques can achieve a better computation speed than the traditional approach, while obtaining a similar high quality of the designs.
A mammography tele-consultation pilot system in Taiwan
Authors: Chien-Shun Lo, Ching-Wen Yang, Pau-Choo Chung, Yen-Chieh Ouyang, San-Kan Lee, Ping-Sung Liao
Venue: Journal of High Speed Networks (2000)

A pilot system for a mammography tele-consultation in TaiChung Veterans General Hospital (TCVGH), Taiwan is proposed in this paper. It is developed and designed based on a distributed system and implemented in a top-down high speed network hierarchy with communication security. It is also integrated with specific diagnostic tools and collaboration awareness tools currently available in TCVGH and linked with the external internet, Taiwan Academic Network (TANet) that will be upgraded into the next generation, TANet2 in the next five years. The distributed system is designed using a JAVA-based remote method invoking system. It allows the transport of images through a firewall combined with peripheral applications that include a Digital Imaging and Communications in Medicine (DICOM) server for image transmission, Picture Archiving and Communication System (PACS), Hospital Information System (HIS) and computer-aided diagnostic systems via a Java native interface. The communication security is implemented using ElGamals public-key cryptosystem for identifications of authorization. Finally the specific mammography diagnostic tools and collaboration awareness tools demonstrated in the proposed system are developed in accordance with the Breast Imaging Reporting And Data System (BI-RADS) suggested by the American College of Radiology.
Real-time: the &ldquo;Lost World&rdquo; of software debugging and testing
Authors: Robert L. Glass
Venue: Communications of the ACM (1980)

Real-time debug and test is still a &ldquo;lost world&rdquo; compared to the &ldquo;civilization&rdquo; developed in other areas of software, says Robert L. Glass. From a survey of current practice across several projects and companies, he defines a state of the art for this problem area and suggests improvements which will ease the practitioner's task.
Language support for regions
Authors: David Gay, Alex Aiken
Venue: ACM SIGPLAN Notices (2001)

Region-based memory management systems structure memory by grouping objects in regions under program control. Memory is reclaimed by deleting regions, freeing all objects stored therein. Our compiler for C with regions, RC, prevents unsafe region deletions by keeping a count of references to each region. Using type annotations that make the structure of a program's regions more explicit, we reduce the overhead of reference counting from a maximum of 27% to a maximum of 11% on a suite of realistic benchmarks. We generalise these annotations in a region type system whose main novelty is the use of existentially quantified abstract regions to represent pointers to objects whose region is partially or totally unknown. A distribution of RC is available at http://www.cs.berkeley.edu/~dgay/rc.tar.gz.
Economical encoding of commas between strings
Authors: S. Even, M. Rodeh
Venue: Communications of the ACM (1978)

A method for insertion of delimiters between strings without using new symbols is presented. As the lengths of the strings increase, the extra cost, in terms of prolongation, becomes vanishingly small compared to the lengths of the strings.
An experimental computer program for hypothesis selection
Authors: M. Kochen
Venue: Communications of the ACM (1961)

An algorithm for finding the characterization of a class of objects on the basis of a randomly ordered sequence of labeled individual objects&mdash;some members of the class, some not&mdash;is described. The class is characterized as a disjunction of terms, each term being a conjunction of attributes. &ldquo;All red, round objects or all square, small objects&rdquo; is an example. Mechanisms based on this algorithm are described in terms of such properties as the amount of storage available for recording instances and the number of instances which had to be examined until the class was first guessed.
Typed compilation of inclusive subtyping
Authors: Karl Crary
Venue: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (2000)

I present a type-preserving translation that eliminates subtyping and bounded quantification without introducing any run-time costs. This translation is based on Mitchell and Pierce's encoding of bounded quantification using intersection types. I show that, previous negative observations notwithstanding, the encoding is adequate given a sufficiently rich target type theory. The necessary target type theory is made easily typecheckable by including a collection of explicit coercion combinators, which are already desired for eliminating subtyping. However, no form of coercion abstraction is necessary (even to support bounded quantification), leading to a simple target language.
Numerical properties of the Ritz-Trefftz algorithm for optimal control
Authors: W. E. Bosarge,  Jr., O. G. Johnson
Venue: Communications of the ACM (1971)

In this paper the Ritz-Trefftz algorithm is applied to the computer solution of the state regulator problem. The algorithm represents a modification of the Ritz direct method and is designed to improve the speed of solution and the storage requirements to the point where real-time implementation becomes feasible. The modification is shown to be more stable computationally than the tradiational Ritz approach. The first concern of the paper is to describe the algorithm and establish its properties as a valid and useful numerical technique. In particular such useful properties as definiteness and reasonableness of condition are established for the method. The second part of the paper is devoted to a comparison of the new techniques with the standard procedure of numerically integrating a matrix Riccati equation to determine a feedback matrix. The new technique is shown to be significantly faster for comparable accuracy.
Compiler and tool support for debugging object protocols
Authors: Sergey Butkevich, Marco Renedo, Gerald Baumgartner, Michal Young
Venue: ACM SIGSOFT Software Engineering Notes (2000)

We describe an extension to the Java programming language that supports static conformance checking and dynamic debugging of object &ldquo;protocols,&rdquo; i.e., sequencing constraints on the order in which methods may be called. Our Java protocols have a statically checkable subset embedded in richer descriptions that can be checked at run time. The statically checkable subtype conformance relation is based on Nierstrasz' proposal for regular (finite-state) process types, and is also very close to the conformance relation for architectural connectors in the Wright architectural description language by Allen and Garlan. Richer sequencing properties, which cannot be expressed by regular types alone, can be specified and checked at run time by associating predicates with object states. We describe the language extensions and their rationale, and the design of tool support for static and dynamic checking and debugging.
Teaching a robot how to read symbols
Authors: François Michaud
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Symbols are used everywhere to help us find our way and to provide useful information about our world. Autonomous robots that would operate in real life settings could surely benefit from these indications. To do so, this research project integrates a character recognition technique with methods to position the robot in front of the symbol, to capture the image that will be used in the identification process, and validate the overall system on a robot.
Hierarchical geometric models for visible surface algorithms
Authors: James H. Clark
Venue: Communications of the ACM (1976)

The geometric structure inherent in the definition of the shapes of three-dimensional objects and environments is used not just to define their relative motion and placement, but also to assist in solving many other problems of systems for producing pictures by computer. By using an extension of traditional structure information, or a geometric hierarchy, five significant improvements to current techniques are possible. First, the range of complexity of an environment is greatly increased while the visible complexity of any given scene is kept within a fixed upper limit. Second, a meaningful way is provided to vary the amount of detail presented in a scene. Third, &ldquo;clipping&rdquo; becomes a very fast logarithmic search for the resolvable parts of the environment within the field of view. Fourth, frame to frame coherence and clipping define a graphical &ldquo;working set,&rdquo; or fraction of the total structure that should be present in primary store for immediate access by the visible surface algorithm. Finally, the geometric structure suggests a recursive descent, visible surface algorithm in which the computation time potentially grows linearly with the visible complexity of the scene.
Advanced computers
Authors: R. A. Brouse
Venue: Communications of the ACM (1961)

The objective is to investigate significant developments in advanced computers and to explore the relationship between programming and new concepts of computer organization. Two specific studies are in progress: Data Sequencing and Vertical Data Processing.
The next 700 programming languages
Authors: P. J. Landin
Venue: Communications of the ACM (1966)

A family of unimplemented computing languages is described that is intended to span differences of application area by a unified framework. This framework dictates the rules about the uses of user-coined names, and the conventions about characterizing functional relationships. Within this framework the design of a specific language splits into two independent parts. One is the choice of written appearances of programs (or more generally, their physical representation). The other is the choice of the abstract entities (such as numbers, character-strings, list of them, functional relations among them) that can be referred to in the language. The system is biased towards &ldquo;expressions&rdquo; rather than &ldquo;statements.&rdquo; It includes a nonprocedural (purely functional) subsystem that aims to expand the class of users' needs that can be met by a single print-instruction, without sacrificing the important properties that make conventional right-hand-side expressions easy to construct and understand.
Improving the Java memory model using CRF
Authors: Jan-Willem Maessen, Xiaowei Shen
Venue: Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2000)

This paper describes alternative memory semantics for Java programs using an enriched version of the Commit/Reconcile/Fence (CRF) memory model [16]. It outlines a set of reasonable practices for safe multithreaded programming in Java. Our semantics allow a number of optimizations such as load reordering that are currently prohibited. Simple thread-local algebraic rules express the effects of optimizations at the source or bytecode level. The rules focus on reordering source-level operations; they yield a simple dependency analysis algorithm for Java. An instruction-by-instruction translation of Java memory operations into CRF operations captures thread interactions precisely. The fine-grained synchronization of CRF means the algebraic rules are easily derived from the translation. CRF can be mapped directly to a modern architecture, and is thus a suitable target for optimizing memory coherence during code generation.
Using thumbnails to search the Web
Authors: Allison Woodruff, Andrew Faulring, Ruth Rosenholtz, Julie Morrsion, Peter Pirolli
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

We introduce a technique for creating novel, textually-enhanced thumbnails of Web pages. These thumbnails combine the advantages of image thumbnails and text summaries to provide consistent performance on a variety of tasks. We conducted a study in which participants used three different types of summaries (enhanced thumbnails, plain thumbnails, and text summaries) to search Web pages to find several different types of information. Participants took an average of 67, 86, and 95 seconds to find the answer with enhanced thumbnails, plain thumbnails, and text summaries, respectively. We found a strong effect of question category. For some questions, text outperformed plain thumbnails, while for other questions, plain thumbnails outperformed text. Enhanced thumbnails (which combine the features of text summaries and plain thumbnails) were more consistent than either text summaries or plain thumbnails, having for all categories the best performance or performance that was statistically indistinguishable from the best.
Supporting collaborative interpretation in distributed Groupware
Authors: Donald Cox, Saul Greenberg
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

Collaborative interpretationoccurs when a group interprets and transforms a diverse set of information fragments into a coherent set of meaningful descriptions. This activity is characterized byemergence, where the participants' shared understanding develops gradually as they interact with each other and the source material. Our goal is to support collaborative interpretation by small, distributed groups. To achieve this, we first observed how face-to-face groups perform collaborative interpretation in a particular work context. We then synthesized design principles from two relevant areas: the key behaviors of people engaged in activities where emergence occurs, and how distributed groups work together over visual surfaces. We built and evaluated a system that supports a specific collaborative interpretation task. This system provides a large workspace and several objects that encourages emergence in interpretation. People manipulatecardsthat contain the raw information fragments. They reduce complexity by placing duplicate cards intopiles. They suggest groupings as they manipulate the spatial layout of cards and piles. They enrich spatial layouts throughnotes, textandfreehand annotations. They record their understanding of their final groupings asreportscontaining coherent descriptions.
An Assumption-based Truth Maintenance System in ActiveAid for UNIX Users
Authors: John Jones, Mark Millington, Maria Virvou
Venue: Artificial Intelligence Review (2000)

This paper deals with the problem of assigning meaning to the interaction of a user with a command-driven system such as UNIX. This research is part of the construction of an active intelligent help system that monitors users in order to offer spontaneous help when they are facing problems. In order to ensure this, the help system must build and maintain a model of the user. We describe a mechanism that is used by the user modelling component of such a help system. This mechanism makes explicit assumptions about the user which account for different hypotheses about what the user is actually thinking at every stage of the interaction. The consistency of these assumptions is managed by an Assumption-based Truth Maintenance System (ATMS). The selection between a number of different user models is based on the information which is extracted from the feedback that UNIX provides in response to user actions.
Evaluation of two security schemes for mobile agents
Authors: Igor Sobrado
Venue: Workshop on Data communication in Latin America and the Caribbean (2001)

In this article, we submit and compare two different but complementary approaches to the problem of protecting mobile agents in untrusted computing environments. The first alternative, a technique for protection of mobile agents built upon an asymmetric cryptographic system resistant to conventional cryptoanalysis techniques, is based on the application of one-time keys. The second solution, geared towards computing environments supporting public-key cryptographic systems, permits the simulation protection of the code and data areas of mobile agents that travel in an information network. This latter protection mechanism can be implemented using any asymmetric cryptosystem We believe the protection strategies we have developed in our investigation are the first complete solution for the protection of mobile agents in distributed computing environments.
Hardware resource allocation for hardware/software partitioning in the LYCOS system
Authors: J. Grode, P. V. Knudsen, J. Madsen
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper presents a novel hardware resource allocation technique for hardware/software partitioning. It allocates hardware resources to the hardware data-path using information such as data-dependencies between operations in the application, and profiling information. The algorithm is useful as a designer's/designtool's aid to generate good hardware allocations for use in hardware/software partitioning. The algorithm has been implemented in a tool under the LYCOS system. The results show that the allocations produced by the algorithm come close to the best allocations obtained by exhaustive search.
Structural analysis of cooking preparation steps in Japanese
Authors: Reiko Hamada Ichiro Ide, Shuichi Sakai, Hidehiko Tanaka
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

We propose a method to create process flow graphs automatically from textbooks for cooking programs. This is realized by understanding context by narrowing down the domain to cooking, and making use of domain specific constraints and knowledge. Since it is relatively easy to extract significant keywords from cooking procedures, we create a domain specific dictionary by statistical methods, and propose a structural analysis method using the dictionary. In order to evaluate the ability of the proposed method, we applied the method to actual procedures as an experiment, which showed effective results. The same experiment was also performed on a different program, which showed lower accuracy but also showed realistic results.
Simultaneous logic decomposition with technology mapping in FPGA designs
Authors: Gang Chen, Jason Cong
Venue: Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays (2001)

Conventional technology mapping algorithms for SRAM-based Field Programmable Gate Arrays (FPGAs) are normally carried out on a fixed logic decomposition of a circuit. The impact of logic decomposition on delay and area of the technology mapping solutions is not well understood. In this paper, we present an algorithm named SLDMap that performs delay-minimized technology mapping on a large set of decompositions and simultaneously controls the mapping area under delay constraints. Our study leads to two conclusions: (1) For depth minimization, the best algorithms in conventional flow (dmig + CutMap) produce satisfactory results with a short runtime, even with a fixed decomposition; (2) When all the structural decompositions of the 6-bounded Boolean network are explored, SLDMap consistently outperforms the state-of-the-art separate flow (dmig + CutMap) by 12% in depth and 10% in area on average; it also consistently outperforms the state-of-the-art combined approach dogma by 8% in depth and 6% in area on average.
Empirical evaluation of some features of instruction set processor architectures
Authors: Åmund Lunde
Venue: Communications of the ACM (1977)

This paper presents methods for empirical evaluation of features of Instruction Set Processors (ISPs). ISP features are evaluated in terms of the time used or saved by having or not having the feature. The methods are based on analysis of traces of program executions. The concept of a register life is introduced, and used to answer questions like: How many registers are used simultaneously? How many would be sufficient all of the time? Most of the time? What would the overhead be if the number of registers were reduced? What are registers used for during their lives? The paper also discusses the problem of detecting desirable but non-existing instructions. Other problems are briefly discussed. Experimental results are presented, obtained by analyzing 41 programs running on the DECsystem10 ISP.
Information Retrieval: PEEKABIT, computer offspring of punched card PEEKABOO, for natural language searching
Authors: Fred C. Hutton
Venue: Communications of the ACM (1968)

The &ldquo;peekaboo&rdquo; idea from punched card information retrieval methods has been mated with the idea of superimposed punching to produce a programming technique which cuts computer run time in half on a test search of 33,000 subject index entries. A search program using the device has been operational since late 1963. As an item is entered in the store, an 18-byte mask is created from the item's meaningful words using the inclusive OR operation. If, at search time, the logical product (using the AND operation) of this mask and a similarly constructed question mask is not equal to the question mask, then one or more question words are not present in the store item. An equality is inconclusive; the words of the store item must be unpacked and compared with question words. The present store is made up of over 600,000 subject index entries estimated to average 60 characters each. Longer texts, such as abstracts, could be handled by multiple masks.