ppxscal/embedding_network huggingface dataset:
Word, image and metaphor to name APL concepts in many tongues
Authors: Paul Berry, Gottfried Bach Michel Bouchard Margarete Buch Sachiko Ikeuchi Berry Roland Pesch
Venue: Proceedings of the international conference on APL (1984)

APL notation uses symbols rather than words. But discussion and education require the use of words. A well-chosen term can make a new concept plain, or link it effectively to related topics. The English-speaking originators of APL took some pains to avoid jargon, and to select terms rooted in metaphors to help convey the meaning of symbols. This paper indentifies several goals in the choice of English terms for APL concepts, and then lists problems that arise when corresponding terms must be found in other languages, with examples from French, German, Spanish and Japanese. It notes both strengths and weaknesses of current APL terminology in English. It exhorts translators and writers in languages other than English to avoid transliterating English terms, and urges them instead to convey the relevant images implied in the English source, or, better yet, to contribute new images to enrich the international vocabulary of APL.
Graphical style towards high quality illustrations
Authors: Richard Beach, Maureen Stone
Venue: ACM SIGGRAPH Computer Graphics (1983)

If there is to be widespread acceptance of computer generated images in areas traditionally served by graphic artists, these images must meet a high standard of quality. Document preparation systems are an application area that is gaining maturity in providing high-quality computer typeset documents. These systems exhibit a trend towards specifying the formatting information for a document separately from the body of the text. The goal is to have the document format designed by someone with expert knowledge of typography. Writers can then apply a format to their own work simply by indicating the semantic content of their text, such as the headings, paragraphs, or footnotes. The result is that a writer can produce properly typeset documents without learning the esthetics of typography. This paper extends this idea to encompass the illustrations in the text. We have developed a prototype system that uses a set of graphical style rules to define the design guidelines for the illustrations. The rules, called a graphical style sheet, can be used to control a uniform &ldquo;look&rdquo; over a set of illustrations, or to change the appearance of a particular illustration to reflect different publishing styles or different media. The prototype coordinates with an existing document preparation system and the combined systems were used to produce this paper. We conclude that this is a viable method for controlling image style for at least one class of illustrations. This approach contributes to image quality by providing a method for capturing knowledge of graphic arts standards, and for ensuring a consistent appearance of related illustrations within technical documentation.
Computer aided study of human locomotion
Authors: T. Kasvand, A. O. Quanbury
Venue: Proceedings of the 1972 SIGGRAPH seminar on Computer graphics in medicine (1972)

A subject walking in front of a coded background is photographed with a high speed movie camera. For greater accuracy, the camera is moved parallel to the subject at his walking speed. The successive film frames are analyzed by a flying spot scanner under computer control. The computer program determines the location of the camera using the background code and finds the position co-ordinates of marker dots placed over various points of interest on the subject's body and limbs. From the location of the marker dots the trajectories of the various limbs and joints can be obtained in graphical form, as well as data pertaining to joint velocities and angular displacements. It is felt that this information can have important clinical use for assessing walking disabilities and for measuring gait improvement in amputees.
Generalized protocol driven problem oriented clinical data management and monitoring
Authors: Kevin C. O'Kane, Richard J. Hildebrandt
Venue: Proceedings of the ACM 1980 annual conference (1980)

In this paper we set forth the design of a generalized clinical data management system that can be adapted for use in multiple clinical specialty areas. A clinical specialty is defined to the system by means of dynamically entered protocols. Protocols are used to specify the system's hierarchy of nomenclature, data acquisition and processing functions and patient care management procedures. A protocol consists of a sequence of procedural steps to be executed and branching logic rules to determine their order of execution. The system's basic clinical record is structured according to patient problem. Clinical specialities are represented in the system as sets of protocols designed to manage the clinical problems that each specialty ordinarily encounters. Protocols are selected for execution for a given patient by virtue of the patient's problem list . The system operates on a micro-computer based mobile work-station.
The generation of confidence intervals for steady state simulations through the application of spectral analysis
Authors: Peter D. Welch
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

To generate a confidence interval on the steady state expectation of the output sequence from a simulation one must generate a &ldquo;good&rdquo; estimate of the variance of the sample mean. This is less than straight forward because, in general, such output sequences are serially correlated. However, the variance of the sample mean is very simply related to the spectral density of the sequence. For large sample sizes, it is approximately equal to the spectral density at zero frequency divided by the sample size. Although this relationship has been well known for many years and the subject of spectral estimation is a well developed one,the application of spectral estimation techniques to simulation confidence interval generation has a somewhat checkered history and may yet be surrounded by considerable confusion. This talk will attempt to put recent work into perspective with regard to the history of spectral approaches, other approaches and the basic issues of confidence interval generation. Broader issues such as sequential testing and run length control will also be discussed. The talk will assume no knowledge of spectral analysis.
First programming language: Consequences (Panel Discussion)
Venue: Proceedings of the 1979 annual conference (1979)

What is a good programming language for beginners? For those adults entering the programming profession as adults the choice of first language seems to have a profound effect and the &ldquo;flavor&rdquo; of that first language seems to become ingrained and stay with the programmer forever unless strong deliberate steps are taken to break out of the artificial bounds set by the early influence. We are now in an era when computers are available to many schools and when programming is being taught to children from primary school to high school. The language most often used is BASIC and the teachers most often barely know anything about programming - have never written anything but toy programs. Now that personal computers are available for under &dollar;500 (with BASIC as usually the only programming language) a generation of self-taught programmers will soon be evident. It would seem that there is a whole host of factors that will shape the competency of the next generation of computer users. The choice of first language is probably the most significant of these, yet we do not really know the consequences of this choice. The participants in this panel have all had an opportunity to observe the progress of young, beginning programmers. They have all thought about what must be learned and unlearned when the beginner moves on from playing with computers into real programming. They will discuss what a proper beginning language might be and what consequences may be expected if such a language is not forthcoming in the immediate future.
Use of a computer model to determine energy requirements of a predatory fish, the largemouth black bass (Micropterus salmoides)
Authors: Norman R. Glass
Venue: Proceedings of the second conference on Applications of simulations (1968)

In some types of biological research the techniques of engineering and other applied sciences have figured prominently in many significant advances made during the last ten years. Such analytical methods as simulation studies, optimization techniques, dynamic programming, and others have opened whole new theoretical and mission-oriented capabilities in many areas of investigation. The analysis of energy flow in both individual animals and populations of animals has been one field of ecological research that has developed rapidly, and one which will continue to enlarge in scope in the future. However, modern numerical techniques are not solely responsible for advances in energetics analysis. Rather, progress has been due to the conceptual framework for study that has developed from principles and considerations underlying theory in many seemingly diverse disciplines. At first glance, such areas of endeavor as urban transit system design, land and resource management strategies, urban planning, and economic theory do not appear to be too closely related. However, all of these activities along with the study of energetics in ecological systems have in common the analysis and optimization of energy flow.
Pros and cons of various user education modes
Authors: Mary C. Boyd, Lincoln Fetcher, Sara K. Graffunder, Thea D. Hodge
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

Panel will discuss various methods for providing assistance and education to users. Results from the University of Minnesota experience will be presented to help compare and evaluate the relative advantages and disadvantages of the following modes: Short Courses Multi-level Documentation On-line Documentation, including HELP files Telephone Consulting Face-to-Face Consulting Audio-Visual Materials (video tapes) CAI for Use of Computers
Test-site evaluation of ICU/PLANIT
Authors: Terry J. Frederick
Venue: Proceedings of the ACM annual conference (1973)

PLANIT (Programming LANguage for Interactive Teaching) is a language used by authors to generate instructional sequences which are accessed by students via a computer. The Instructor's Computer Utility or ICU/PLANIT is the complete software system which makes PLANIT operational. This system is intended to function either as the sole operating system for the target machine or in co-operation with other operating systems. In August 1972, the National Science Foundation selected Purdue University as a test-site for an analysis and evaluation of ICU/PLANIT. Near the end of 1972, the Northwest Regional Educational Laboratory and Dr. Frye contracted with NSF for further PLANIT development and interaction between the test-site and PLANIT development was established.
Adaptive optimization of the performance of a virtual memory computer
Authors: M. Badel, E. Gelenbe, J. Leroudier, D. Potier, J. Lenfant
Venue: ACM SIGMETRICS Performance Evaluation Review (1974)

It is known that the regulation of the degree of multiprogramming is perhaps one of the most important factors determining the overall performance of a virtual memory computer. In this paper we present an approach which differs some what from the approaches usually taken to regulate the degree of multiprogramming, which are mainly derived from the working-set principles. We design a controller which will regulate the system in order to optimize a given performance measure. The controller is applied to a system where the critical resource is primary memory, and we are only concerned with systems where ineffective regulation leads to the phenomenon known as thrashing due to extensive paging activity. In the first section, the dynamics of the system we wish to regulate are investigated using an analytical model. The system consists of a set of terminals and of a resource loop (CPU, secondary memory device, file disk) shared by the users. Using classical assumptions about program behavior (e.g., life-time function), the throughput of the RL is obtained as a function of the degree of multiprogramming n (number of users sharing the resources at a given instant of time) and of the system parameters. This result provides a greater insight of the &ldquo;plant&rdquo; we wish to control. The mathematical results are validated and extended with data from simulation experiments using a more detailed model (overheads and non-exponential assumption). In the next section, a criterion called &ldquo;dilatation&rdquo; based on the utilization of the different resources is defined. From the analytical and simulation results of the first section, it can be shown that there exists a value no of the degree of multiprogramming which maximizes this criterion. The regulation of n to no is achieved by controlling the access of the users to the RL. The value of no is estimated in real-time through a continuous estimation of the two first moments of the criterion. Using these estimations, the decision of introducing or not a new user in the RL is taken whenever a user leaves a terminal or departs from the RL. Extensive simulation experiments were conducted, where the implementation of the different functions of the controller have been thoroughly simulated. They have shown that the control scheme leaves to an improvement of the system performance in mean response time and resource utilization, and, overall, adapts in real-time the degree of multiprogramming to the characteristics of the users (the adaptation is performed in 4 sec. or so for a unit variation of the optimal degree of multiprogramming). A discussion of practical application of results ends the paper.
Teaching the Design and evaluation of User-Computer Interfaces
Authors: James D. Foley
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

In this paper we describe a graduate Computer Science course, &ldquo;The Design of User-Computer Interfaces&rdquo;, which the author developed and has taught since 1979. Students taking the course are normally in their second year of graduate study, and have thus been exposed to several different interactive computing environments.
Variable block size lapped transforms
Authors: R. L. de Queiroz, K. R. Rao
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

A structure for implementing lapped transforms with time-varying block sizes is discussed. It allows full orthogonality in the transitions based on a factorization of the transfer matrix into orthogonal factors. Such an approach can be viewed as a sequence of stages with variable-block-size transforms intermediated by sample-shuffling (delay) stages. Details for a first order system are given and a design example is presented.
English as a query language
Authors: Burt Leavenworth, Vincent E. Guiliano, Arthur D. Little, Christine A. Montogomery, Charles Kellog, Robert F. Simons, Frederick B. Thompson, William A. Woods
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Natural English as a query language offers the ultimate in directness for man-machine communications and has new and powerful potentials for interactive problem solving. The linguistic problems underlying machine interpretation and generation of natural English, however, have been slow in yielding to solution, though recent successes have raised new expectations. Speakers in the Query Language Session will explore these potentials and problems and discuss their approaches to the use of natural English. Two opening presentations by Dr. Vincent Giuliano and Dr. Christine Montgomery will set the theme of the session, and a panel of experts will then discuss their positions on the question. Natural English as a query language can provide interactive communication between men and computers of a kind and quality previously only possible between humans. Natural language is thought to be optimally coupled to the abilities and limitations of human information processing. Further, a machine that can understand and answer questions in natural English comes close to passing Turing's classic test of machine intelligence. However, natural English is not always formal English, and even when it is, the meaningful and the grammatical cannot be equated with any assurance. Nor can the strictures of a &ldquo;constranied English&rdquo; avoid the transforming colorations of context inherent in natural language. The very redundancy of English which permits ill-formed expression to convey clear messages to humans too often has resulted in a linguistic and programming quagmire of uncertainty and peril. Despite the considerable problems in using natural English as a query language, certain operational successes of significance have been achieved by session participants and by others, and these experiences will be discussed, as will recent advances in computational linguistics, that now show promise of closing the linguistic gap between form and meaning.
Computer assisted document production at Carnegie-Mellon University
Authors: Rosemary Rainbolt
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

Word processing needs at Carnegie-Mellon University include the usual: forms for accounting, billing, and grade reports, form letters for admissions and alumni, papers and proposals and reports and theses, and massive bibliography storage and retrieval. Word processing needs at Carnegie-Mellon also include the unusual: highly technical, mathematical and scientific text formatting.
Recent results in non-uniform random variate generation
Authors: Luc Devroye
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

A selective survey is given of new methods in non-uniform random variate generation.
A Figure Extraction Method Based on the Color and Texture Contrasts of Regions
Authors: Shoji Tanaka, Yuichi Iwadate, Seiji Inokuchi
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Detecting interesting regions from pictures has become important in order to reduce the computational complexity associated with such time-consuming processes as object recognition. In this paper, we assume that figure-ground segmentation of a picture is necessary as the first step towards evaluating the attractiveness of regions. In Vision research, it has been found that the V4 cortex in the visual system contributes to figure-ground selectivity. By utilizing this finding, we propose a method for extracting figure regions from a picture based on the color and texture contrasts of regions. This method discriminates regions previously segmented from a picture into figure regions and ground regions by a discrimination function defined with contrast parameters. The contrast parameters include the color difference and the texture difference between a region and its surroundings, as well as the focus of the region. A discrimination function is constructed based on the characteristics of the extracted figures and ground obtained in our experiments. In other experiments on evaluating the accuracy of the proposed method, figure regions selected by human subjects are extracted by the method at the rate of 80% accuracy.
Complexity of finitely presented algebras
Authors: Dexter Kozen
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

An algebra A is finitely presented if there is a finite set G of generator symbols, a finite set O of operator symbols, and a finite set &Ggr; of defining relations x&Xgr;y where x and y are well-formed terms over G and O, such that A is isomorphic to the free algebra on G and O modulo the congruence induced by &Ggr;. The uniform word problem, the finiteness problem, the triviality problem (whether A is the one element algebra), and the subalgebra membership problem (whether a given element of A is contained in a finitely generated subalgebra of A) for finitely presented algebras are shown to be &le;mlog-complete for P. The schema satisfiability problem and schema validity problem are shown to be &le;mlog-complete for NP and co-NP, respectively. Finally, the problem of isomorphism of finitely presented algebras is shown to be polynomial time many-one equivalent to the problem of graph isomorphism.
Tree structures construction using key densities
Authors: S. B. Yao
Venue: Proceedings of the 1975 annual conference (1975)

Storage structure alternatives exist for structuring symbol trees. Sequential structure is used in Trie and linked list structure is used in Doubly Chained Tree. A model of hybrid tree structures is presented which employs storage structures at levels where they are most efficient. The model parameters are determined by the densities of key components. A related hit ratio problem is solved so that these densities can be estimated. Analyses are given to determine appropriate tree structures from the model.
Combine and top down block placement algorithm for hierarchical logic VLSI layout
Authors: Tokinori Kozawa, Chihei Miura, Hidekazu Terai
Venue: Proceedings of the 21st Design Automation Conference (1984)

A Combine and TOP down placement (CTOP) algorithm for determination of relative placement of blocks which are set of cells is presented. The objective functions of the CTOP algorithm are to minimize inter-block wiring space and dead space using a combine value P. P is defined as the combination of the connectivity and dead space factor. With use of the CTOP algorithm, chip size in our example is about 6% smaller than with manual block placement. In the experiment reported on here, we used the same automatic placement and routing program for intra-block design.
User perceptual mechanisms in the search of computer command menus
Authors: Stuart K. Card
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Menu-based command systems, in which a user selects a command from a set of choices displayed to him, have acquired widespread use as a human-computer interface technique. The technique is especially attractive for use with new or untrained users since the user need not recall the command he wishes, but merely recognize it. But menu systems also find application in more sophisticated systems meant for expert users (for example, Teitelman, 1977) where they can be used to reduce the complexity of the options with which the user is presented.
The components of a computerized test-scoring service
Authors: George Beekman
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

This paper describes the systems, human and computer, that make up the Oregon State University Computer Center Test-Scoring Service. The Test-Scoring Service makes it possible for faculty members from OSU and elsewhere to have their objective tests scored quickly and accurately by computer at a relatively low cost. The service offers the instructor an unusual degree of flexibility in test construction, assignment of point values and test parts, and choice of printouts to be generated. Printouts available include several types of class listings, a detailed frequency distribution, individual student printouts, a gradebook for compiling term scores, and an item analysis for assessing the quality of the test and teaching methods used. The software has evolved to meet the needs of the faculty, with the over-riding goal in system design being to maximize flexibility from the instructor's point of view without sacrificing speed or accuracy of processing. Because many members of the faculty are unfamiliar with (or uncomfortable with) computers, statistics, and testing theory, faculty education in the form of manuals, workshops, and seminars is an important part of the Test-Scoring Service. These extra services not only help instructors to improve their testing and teaching methods, but also increase faculty interest in and support of the Test-Scoring Service and the Computer Center in general.