ppxscal/embedding_network huggingface dataset:
Content-Based Indexing and Retrieval Method of Chinese Document Images
Authors: Yaodong He, Zao Jiang, Bing Liu, Hong Zhao
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In Chinese information retrieval, it is easy to index a Chinese text document for retrieval. We just need to segment the text document into phrases. When the document is Chinese document image (non-ASCII file), we may first convert the document image into text file by using Chinese optical character recognition (OCR) technology, and then index the document by using information retrieval algorithm. However, OCR needs longer time, which can influence retrieval efficiency. This paper proposes an index method based on stroke density code. First segment the document image to get all the Chinese character images, then calculate stroke density of each Chinese character image, and at last attain stroke density code of the character image. The index method has the advantage of speed and robustness to noise. In addition, this paper also offers retrieval method for Chinese document image based on the index technology. We specially discuss index and retrieval method for duplicate detection. We have validated the validity of the index method through its application to keyword spotting and duplicate detection.
A MOS modelling technique for 4-state true-value hierarchical logic simulation or Karnough knowledge
Authors: Will Sherwood
Venue: Proceedings of the 18th Design Automation Conference (1981)

Modelling strategies and techniques are given for static and dynamic MOS transistors in a 4-state (0/low, 1/high, Z/high-impedance, U/undefined) logic simulator environment. General MOS modelling problems are presented and a set of workable solutions are developed. Experience with these techniques is shown along with examples of NMOS simulation applications. This paper discusses a technique with specific conventions for modelling MOS devices at the &ldquo;logical transistor&rdquo; gate level. The technique is not the optimal general solution, but was found to be satisfactory for retrofitting an existing 4-state logic simulator to include MOS capabilities. The technique is not meant to replace analog circuit simulation, but is aimed at increasing the accuracy of MOS logic (gate level) simulations. We begin with a general bus model and extend it to handle transistors, pullups and pulldowns, and dynamic MOS transfer gates. Extensions are shown for a bidirectional transfer gate model that can be connected in any topological configuration.
Interactive analysis of time series
Authors: Seppo Kaltio
Venue: Proceedings of seventh international conference on APL (1975)

A great deal of data in business, economics, engineering and the natural sciences occur in the form of time series where observations are dependent and where the nature of this dependence is of interest in itself. The technics used in the analysis of such series of dependent observations is called time series analysis. The purpose is to build stochastic models for discrete time series and to use these models. In this paper is described the ARIMA-process, the time series analyzing method introduced by Box and Jenkins. In addition is described a set of APL-functions for interactive time series analysis. These functions are based on the concents of multiplication and division of time series, which are introduced in this paper.
RISC I: A Reduced Instruction Set VLSI Computer
Authors: David A. Patterson, Carlo H. Sequin
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

The Reduced Instruction Set Computer (RISC) Project investigates an alternative to the general trend toward computers with increasingly complex instruction sets: With a proper set of instructions and a corresponding architectural design, a machine with a high effective throughput can be achieved. The simplicity of the instruction set and addressing modes allows most instructions to execute in a single machine cycle, and the simplicity of each instruction guarantees a short cycle time. In addition, such a machine should have a much shorter design time. This paper presents the architecture of RISC I and its novel hardware support scheme for procedure call/return. Overlapping sets of register banks that can pass parameters directly to subroutines are largely responsible for the excellent performance of RISC I. Static and dynamic comparisons between this new architecture and more traditional machines are given. Although instructions are simpler, the average length of programs was found not to exceed programs for DEC VAX 11 by more than a factor of 2. Preliminary benchmarks demonstrate the performance advantages of RISC. It appears possible to build a single chip computer faster than VAX 11/780.
A distributed UNIX system based on a virtual circuit switch
Authors: G. W.R. Luderer, H. Che, J. P. Haggerty, P. A. Kirslis, W. T. Marshall
Venue: ACM SIGOPS Operating Systems Review (1981)

The popular UNIXTM operating system provides time-sharing service on a single computer. This paper reports on the design and implementation of a distributed UNIX system. The new operating system consists of two components: the S-UNIX subsystem provides a complete UNIX process environment enhanced by access to remote files; the F-UNIX subsystem is specialized to offer remote file service. A system can be configured out of many computers which operate either under the S-UNIX or the F-UNIX operating subsystem. The file servers together present the view of a single global file system. A single-service view is presented to any user terminal connected to one of the S-UNIX subsystems. Computers communicate with each other through a high-bandwidth virtual circuit switch. Small front-end processors handle the data and control protocol for error and flow-controlled virtual circuits. Terminals may be connected directly to the computers or through the switch. Operational since early 1980, the system has served as a vehicle to explore virtual circuit switching as the basis for distributed system design. The performance of the communication software has been a focus of our work. Performance measurement results are presented for user process level and operating system driver level data transfer rates, message exchange times, and system capacity benchmarks. The architecture offers reliability and modularly growable configurations. The communication service offered can serve as the foundation for different distributed architectures.
The goal structure of a socratic tutor
Authors: Albert L. Stevens, Allan Collins
Venue: Proceedings of the 1977 annual conference (1977)

We describe the current version of the Why System, a script-based socratic tutor which uses tutoring strategies formulated as production rules. The current system is capable of carrying on a dialogue about the factors influencing rainfall by presenting different cases to the student, asking for predictions, probing for relevent factors, entrapping the student when he has not identified all necessary factors, and presenting counterexamples. The current system is incomplete because it lacks a goal structure to guide the tutorial sessions. We outline a more complete theory of the goal structure of Socratic tutors based on analysis of human tutorial dialogues. There are two top level goals: (1) refinement of the student's causal model and (2) refinement of the student's predictive abilities. The subgoals are diagnosis of bugs in the student's knowledge and correction of the bugs. This goal-driven control mechanism governs the selection of examples and teaching strategies used by the tutor.
Simulation studies of a virtual memory, time-shared, demand paging operating system
Authors: J. Winograd, S. J. Morganstein, R. Herman
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

SIM/61 is a large (3500 lines of Simscript code), highly detailed simulation model of a virtual memory, time-shared, demand paging operating system. SIM/61 provides the capability for parameterized modeling of both hardware and software. The current model contains algorithms for interrupt analysis, task scheduling, I/O scheduling and demand paging. This paper reports the results of studies made using SIM/61. The studies fall into two main categories: (1) load and configuration studies and (2) alternate algorithm studies. The approach taken for the former was to establish a fixed load, and measure its performance on various hardware configurations. The results are particularly interesting with respect to the paging capability of various paging device configurations, and various sizes of main memory.
On programming parallel computers
Authors: Leslie Lamport
Venue: ACM SIGPLAN Notices (1975)

In this paper, I will make some general observations about how computers should be programmed, and how programs should be compiled. I will restrict my attention to programming computers to solve numerical analysis problems, although most of my remarks can be applied to other problem areas as well. My primary concern is for large parallel computers. However, I will show that parallelism is not a major issue, and I will not restrict the discussion to any single type of computer architecture. The paper is a very general one, and I will make few specific proposals for language or compiler design. Instead, I will examine the fundamental nature of the programming/compiling process, how this process is done now, and how it should be done in the future. Few of my observations will be new or original. However, a careful analysis will lead to a somewhat surprising conclusion: a higher level programming language is needed both to reduce programming costs and also to obtain more efficient programs. The analysis will also provide some useful ideas for designing a higher level language and compiling efficient code from it.
Relational data base management systems: A tale of two systems (abstract only)
Authors: Malcolm S. Cohen
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

This project management system is designed to provide research administrators and department executives the capability to handle the financial accounting needs for 30 or more separately budgeted projects/departments on a computer with 64K of RAM and two floppy disks. The system generates a wide variety of flexible reports including: a Cost Accounting Summary showing previous period expenses, current period expenses, total expenses, budgeted amount, encumbrances, and remaining balance by line item; a Budgetary Summary which shows for the current period and year-to-date the actual expenses, the budgeted amount, the variance between actual and budget, and the percent of budget by line item expended; an Income Statement showing revenue and expenses; an Expense Report; and a Transaction Register; and more.
Measurement of lawrence livermore laboratory CDC-7600 SYSTEM PERFORMANCE*
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

Performance measures of machine utilization is done on a continuing basis at Livermore. A brief description of the sampling and presentation techniques are given. The impact of timesharing and heavy I/O loading is shown graphically.
Magic: A VLSI layout system
Authors: John K. Ousterhout, Gordon T. Hamachi, Robert N. Mayo, Walter S. Scott, George S. Taylor
Venue: Proceedings of the 21st Design Automation Conference (1984)

Magic is a &ldquo;smart&rdquo; layout system for integrated circuits. The user interface is based on a new design style called logs, which combines the efficiency of mask-level design with the flexibility of symbolic design. The system incorporates expertise about design rules and connectivity directly into the layout system in order to implement powerful new operations, including: a continuous design-rule checker that operates in background to maintain an up-to-date picture of violations; an operation called plowing that permits interactive stretching and compaction; and routing tools that can work under and around existing connections in the channels. Magic uses a new data structure called corner stitching to achieve an efficient implementation of these operations.
Distinguishing the potential operands in FORTRAN programs
Authors: George E. Estes
Venue: Selected papers of the 1982 ACM SIGMETRICS workshop on Software Metrics: part 1 (1982)

There are several possible relationships between the number of potential operands and the actual operands used which correlate with available data (such as Akiyama's debugging data). However, additional data is required to distinguish between these hypotheses. Since there is a large body of programs available written in FORTRAN, we wish to develop a mechanical counting procedure to enumerate potential operands in FORTRAN programs. We are currently developing counting rules for these potential operands. Sub-routine parameters and input/output variables are relatively easy to identify. However, a number of FORTRAN features, such as COMMON blocks and EQUIVALENCE'd variables introduce serious complications. Some additional analysis of usage or heuristic approaches are required to differentiate potential operands in these situations.
Dynamic usage of APL primitive functions
Authors: Harvey W. Bingham, Kenneth T. Carvin
Venue: Proceedings of the eighth international conference on APL (1976)

Dynamic measurements of APL primitive functions and operators applied to shaped data objects (arrays) are routinely collected by the Burroughs APL/700 system. Actual usage of these primitives by all APL users is counted. Data collected from two sites is contrasted. The mixed functions (that apply to the structure of shaped data objects) were used about twice as frequently as the scalar functions (that apply to the values of shaped data objects). The scalar functions were used about twice as frequently as indexing. The combined data from the two sites is found to closely match independent static data previously obtained from analysis of defined functions in workspaces.
National opinions from university computing center documentors on procedures, ideals, and interpersonal relationships
Authors: Ann White
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

In this compendium 44 individuals who review or produce computer-related documentation at their university computing installations, have contributed their opinions on what it is like to be a &ldquo;documentor&rdquo; as well as their philosophy of what a &ldquo;documentor&rdquo; should be as a professional. The individuals responded to a questionnaire that explored the advantages and disadvantages of being a documentor, their techniques for communicating with the people they must inevitably communicate with&mdash;programmers, their experiences in developing documentation that meets certain standards of quality, and their attempts to educate others with regard to solving documentation production problems. The respondents seem to agree that the documentation function is necessary and that perseverance, tact, analysis, attention to detail, self-assurance, cooperation, and oral and written communication are important. However, differences of opinion arise in several areas. (1) Whose skills are better suited for producing quality documentation&mdash;those of the programmer or those of the professional communicator? (2) What are the necessary documentation standards that should guide documentors? (3) How flexible should these standards be? (4) What can documentors do to gain greater respect and support from programmers and managers&mdash;which in turn could lead to higher salaries and a more rewarding profession? This compendium provides insight into how documentors solve some of their problems. It reveals what they themselves consider qualifies them to be documentors. And, most important, it discloses much about the psychology of the documentor.
On the lengths of proofs in the propositional calculus (Preliminary Version)
Authors: Stephen Cook, Robert Reckhow
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

One of the most important open questions in the field of computational complexity is the question of whether there is a polynomial time decision procedure for the classical propositional calculus. The purpose of the present paper is to study a question related to the complexity of decision procedures for the propositional calculus; namely, the complexity of proof systems for the propositional calculus. The fundamental issue here is whether there exists any proof system, and a polynomial p(n) such that every valid formula has a proof of length not exceeding p(n), where n is the length of the formula. Theorem 1 below helps establish the importance of this question. For the purposes of this theorem, we give the following definitions.
A Segmentation Algorithm for Handwritten Chinese Character Strings
Authors: Jiang Gao, Xiaoqing Ding, Youshou Wu
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

A new algorithm for segmenting handwritten Chinese character strings is presented. This approach is based on a split and merge strategy by locating possible ligatures between Chinese characters and merging the over-split components. The strategy is proposed by considering the structural properties of Chinese characters strings. To guarantee accuracy of the above segmentation algorithm, a recognizer is involved to aid the segmentation process. A maximum a posteriori probability index is derived for joint optimization of segmentation and recognition results, and a dynamic programming algorithm modified level building algorithm is used to optimize this index. The whole algorithm is applied to Chinese bank check amount recognition, and some promising experimental results are obtained.
Applications of mathematical system theory to system design, modelling and simulation
Authors: A. Hayne Hymore
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

A mathematical system theoretic framework is described within which the necessary elaboration of the classical System Design, Modelling, and Simulation (SDMS) might be carried out. The applications of the new, elaborated problem-solving methodology to the design and analysis of communications systems is discussed as well as the concept of modelling as the design of an information system.
A thesaurus for Canadian iconography (abstract only)
Authors: Denis Castonguay
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

The Picture Division of The Public Archives of Canada has undertaken the construction of a thesaurus of iconographic terms as part of its preparations for a computerized inventory system. The thesaurus which complements an existing set of descriptive standards will serve as a terminological control device enabling indexers and researchers to translate natural language into a more restrained and logical system language. General characteristics of the thesaurus will be described. Special emphasis will be given to the impact of on-line information retrieval computer technology on the design and development of the system language. Sample pages of the thesaurus will be available for examination and further discussion. An overview of other Canadian experiments in the field of subject access to visual records will also be provided.
Fast algorithms for LSI artwork analysis
Authors: Henry S. Baird
Venue: Proceedings of the 14th Design Automation Conference (1977)

Representative algorithms for IC mask artwork analysis are described and compared. A novel IC mask analysis algorithm is described which does not restrict the representation of artwork, permits a wide range of functions, avoids pathologies, and achieves good runtime and tolerable main memory demands, even for LSI applications. Under reasonable assumptions about the distribution of artwork within the chip area, the algorithm is shown to achieve an expected runtime complexity of 0(E**(3/2)), where E is the number of edges in the artwork. Experience with LSI circuits is described.
An interdisciplinary introduction to simulation
Authors: John W. McCredie
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

This paper presents a description of an interdisciplinary introduction to simulation developed at Carnegie-Mellon University. An outline of the course goals precedes a description of the techniques discussed, the teaching methodology used, and the application projects assigned. The final section contains an evaluation of the course with respect to the goals of the first section and the computation and teaching resources needed to support the effort.
On the failure to implement structured programming and other techniques
Authors: Henry C. Lucas,  Jr.
Venue: Proceedings of the 1975 annual conference (1975)

There is a large gap between the theory of management of software development projects and actual practice. Why have so few new software development techniques been implemented given the dismal rate of success in meeting the specifications for programming projects on time and within budget (Kay, 1969; Jones and McClean, 1970)? Before discussing some of the reasons for the failure to implement new approaches, several of these new techniques are delineated below. For a more complete description of each technique, see the references cited and the other papers in this session.
Working In The Computing And Engineering Profession: Career planning and educational alternatives
Authors: Steven L. Jamison, Paul Armer, Jeanette A. Griver, James Towsen, Helen Wood
Venue: Proceedings of the 1978 annual conference (1978)

When one takes a new job as a computer professional, ones initial performance appraisal may be lower than usual because of new skill requirements. But having identified these difficiencies and established a program to remedy them, subsequent appraisals should improve. Also, an attitude of professionalism makes a difference, since one who exhibits the traits placing one in a position of competence has a better chance for success and overall happiness in life. Doctors, lawyers and engineers work hard to become educated and evaluated as to their competency to practice their specialty; likewise, computer professionals work hard to stay up-to-date. Indeed, professional development opportunities are a mark of a profession. It has been said that the &ldquo;half-life&rdquo; of computing and engineering knowledge is only five years. Therefore, an individual completing the best degree in computer education today will know less than half of what is expected for competence five years from now, and many professionals will have trouble coping with the pace of change. Part of this session will deal with the problem of obsolescence of the computer professional, including possible solutions. Some discussion will also be given to the topic of why some computer managers fail, along with some solutions dealing with proper time and project management; and, this session's topic also relates to the general topic of business management for computer engineers. Another group of session participants will discuss the current status of Federally employed women and minorities in the sciences, engineering and computer profession. Opportunities, career tracks, problems and prospects will be addressed based on case studies involving, for example, Federal laboratories and equal employment opportunities structures.