ppxscal/embedding_network huggingface dataset:
Handwritten Numeral Recognition Using Gradient and Curvature of Gray Scale Image
Authors: Yoshiharu Fujisawa, Meng Shi, Tetsushi Wakabayashi, Fumitaka Kimura
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In this paper, the authors study on the use of curvature in addition to the gradient of the gray scale character image to improve the accuracy of handwritten numeral recognition. Three procedures, based on curvature coefficient, bi-quadratic interpolation and gradient vector interpolation, are proposed for calculating the curvature of the equi-grayscale curves of an input image. The efficiency of the feature vector is tested by recognition experiments for the handwritten numeral database IPTP CDROM1. The experimental result shows the usefulness of the curvature feature and recognition rate of 99.40%, which is the highest one ever reported for the database, is achieved.
A model for a CAI learning system
Authors: Donald L. Kalmey, Marino J. Niccolai
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

Over the past ten years, computer-assisted instruction (CAI) has had an impact on the educational system. In this paper, we discuss our view of a model for developing an integrated set of CAI modules for any given subject area. The model has been implemented and tested, with very favorable results, for the subject area of metrication.
A New Technique for Color Image Segmentation
Authors: C. Amoroso, E. Ardizzone, V. Morreale, P. Storniolo
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

A novel technique for segmentation of color images is proposed. The technique implements a thresholding approach based on the analysis of the hue histogram: a new function for detecting valleys of the histogram has been devised and tested. A new blurring algorithm for noise reduction that works effectively when used over hue image, has been also developed. A feed-forward neural network that learns to recognize the hue ranges of meaningful objects completes the segmentation process.Experimental results show that the proposed technique is reliable and robust even in presence of changing environmental conditions. Extended experimentation has been carried in the framework of the Robot Soccer World Cup Initiative (RoboCup). The approach is fully general and may be successfully employed in any intermediate level image-processing task, where the color is a meaningful descriptor.
An automated micro measurement system for integrated circuit masks
Authors: F. R. Ashley, E. B. Murphy, H. J. Savard
Venue: Proceedings of the 7th Design Automation Workshop (1970)

A computer controlled system for making positional measurements on a glass plate to an accuracy of 1 &mgr;m is described. Through the use of a computer, the short-comings of the Do-all coordinate measuring machine (CMM) are overcome allowing the effective use of the inherent accuracy of the CMM. The result is a measurement system having greatly enhanced capability. A plate having an array of 208 data points can be measured in about two hours, whereas without the computer control measurement of such a large array with the CMM is not feasible.
Dempster-Shafer's Theory as an aid to Color Information Processing Application to Melanoma Detection in Dermatology
Authors: Patrick Vannoorenberghe, Olivier Colot, Denis de Brucq
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper, we first propose a color image segmentation method based on the Dempster-Shafer's theory. The tristimuli R, G and B are considered as three independent information sources which can be very limited or weak. The basic idea consists in modeling the color information in order to have the features of each region in the image. This model, obtained on training sets extracted from the intensity, allows to reduce the classification errors concerning each pixel of the image. The proposed segmentation algorithm has been applied to biomedical images in order to detect a kind of skin cancer (melanoma). In a second step, features concerning the lesion are extracted using color information. These features are used in order to classify the beginning lesions (naevus) from the other. Results, including the management of false alarms and no detection, allow to demonstrate the effectiveness of the proposed methodology.
Interactive computer graphics and macromolecular structures
Authors: Peter J. Bond
Venue: Proceedings of the 1972 SIGGRAPH seminar on Computer graphics in medicine (1972)

In 1964 on Project MAC at MIT, Levinthal and Langridge first applied interactive computer graphics to molecular model building (1, 2). Since then a number of laboratories have developed computer graphics systems to suit their particular needs (3, 4, 5, 6). I shall begin by describing the system that we have developed in the Princeton University Computer Graphics Laboratory during the past year to investigate macromolecular structures.
Simulation of a multiple CPU military communications system
Authors: James G. Sprung, Ved Aggarwal
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

The Pentagon Telecommunications Center (PTC) provides telecommunications support to Headquarters, Department of the Army and other government agencies. The current system provides the Army with a full range of communications functions, i.e., receipt, transmission, message validation, and online CRT operations, centered around an IBM System/360 (Model 65) processor. The Automation Support Detachment, under the U.S. Army Communications Electronics Engineering Installation Agency - CONUS, performs telecommunications systems design, development, and support for the system. The design efforts entail extending similar operational services to all communication centers in the Pentagon. The proposed message workload is expected to increase to 6000 messages per hour from the current 1500 messages per hour. During the design effort, a simulation model is being used to estimate the performance impact of proposed system configurations and design changes. This paper describes the modeled system and some simulation experiments made using the model as a design tool. The main objectives for the experiments were: To determine the processor speed required to process 6000 messages per hour (the expected future workload). To determine whether off-loading some of the processes associated with a message's input/output (I/O) would provide a significant improvement in central processor utilization and message throughput. To investigate whether I/O delays caused by the disk subsystem would be reduced if reads were alternated between the primary and backup disk drives.
A module level simulation technique for systems composed of LSI's and MSI's
Authors: Mario Tokoro, Masayuki Sato, Masayuki Ishigami, Eiji Tamura, Terunobu Ishimitsu, Hisashi Ohara
Venue: Proceedings of the 15th Design Automation Conference (1978)

This paper describes newly developed techniques suitable for logic verification and fault simulation of digital systems which are mainly composed of LSI's and MSI's. A simulator employing such techniques has been implemented, and has shown definite advantages over existing simulators.
Predicting success in a first programming course
Authors: R. R. Leeper, J. L. Silver
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

The results of a study to develop a predictor of success in a first programming course are presented. The predictor is based on data currently available for a substantial number of students and is tailored to the local program. This predictor is developed using data from a group of students who took the course in the fall of 1980. The results obtained by applying the predictor to a second group of students who took the course in the fall of 1981 are compared with these students' actual grades.
GASP programming procedures
Venue: Proceedings of the 6th conference on Winter simulation (1973)

GASP II consists' of a set of FORTRAN subprograms organized to assist the systems analyst in performing simulation studies. GASP II formalizes an approach to simulation by specifying common elements of simulation studies and providing subprograms for performing those simulation tasks that are independent of a particular problem. In this tutorial, the structure and subprograms of GASP II will be presented. Examples of the use of GASP II will be presented, which will include the programming required, the input data formats and the resulting summary reports. An introduction to GASP IV, a combined discrete/continuous simulation language will be presented.
Implementing software configuration control in the structured programming environment
Authors: H. Ronald Berlack
Venue: Proceedings of the 1981 ACM workshop/symposium on Measurement and evaluation of software quality (1981)

The fundamental problems in the control of software are explored. The elements of control as they relate to communications is defined, and the implementation of these elements in solving the fundamental problems and achieving optimal control during a software development life cycle, is explained. Control is defined as a vehicle for communicating changes to established, agreed-upon baseline points, made up of documents and subsequent computer programs. By communicating change to those involved or affected, and obtaining agreement of the change, one achieves a degree of control that does not inhibit software engineering innovation or progress, but helps maintain the project's prime objectives to deliver maintainable, error-free software to the ultimate user.
Compilation techniques for a control-flow concurrent LISP system
Authors: Jed B. Marti
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

Described is a strategy for the compilation of LISP programs for a concurrent processing system in the presence of global side effects. The method supports &ldquo;horizontal&rdquo; concurrency, the concurrency available when two arguments of a function can be evaluated simultaneously and without violating the semantics of sequential LISP. The method works for Standard LISP and is not restricted to &ldquo;pure&rdquo; LISP. Conventional programs may usually be compiled without modification.
Simulation: A tool for evaluating computer systems architecture
Authors: Robert Heck, Donald Ingerman
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

Simulation is an accepted tool for use in the design and evaluation of manufacturing, distribution, and transportation systems. In this study, simulation was shown to be effective in the design and evaluation of a computer system. The study addressed the overall performance of the computer-based system as well as the organization and structure of the software functions. The concept of distributed processing within the overall computer system architecture was evaluated to provide a sound and workable basis for implementing the required functions. Functional allocation was made more complex by the distributed architecture. This could add to the complexity of the computer program design. The potential benefits of a distributed architecture can be negated by bottlenecks in the system resulting from improper design. Because of these complex interactions, it was necessary to use a discrete-event simulation model during the conceptual design phase to produce a viable functional design.
Introducing electronic mail to managers a modest experiment
Authors: Harold C. Bloom
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

The University of Chicago Computation Center acquired a powerful electronic mail system about two years ago for its DEC-20 computer; it is the MM system obtained from M.I.T. The DEC-20 operating system comes with a primitive mail facility, which provides two commands for reading and sending mail. Users of the basic facility found it beneficial in their day to day work, but when the MM system arrived it was immediately installed by the systems programming group, initially for their own use, and very soon after for use by interested staff. The MM system provides a set of integrated functions for the management of electronic mail. Included are the ability to read, reply, send, and edit mail; to send mail to multiple recipients and to carbon-copy and blind carbon-copy others; to send messages to a group of people by using distribution lists; to search the mail file for messages containing specific text strings; to keyword messages and search on keyword; to store outgoing messages in a separate file; and to customize the system through the use of an initialization file.
Traffic considerations in switched data networks
Authors: G. J. Clowes, C. S. Jayasuriya
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

Based on a model for the data traffic between major Canadian cities, different types of switched networks are compared chiefly on the basis of channel miles. Circuit switched, packet switched and combined circuit/packet switched networks are compared. Attention is given to the internodal grade of service and the significant network design parameters such as the distribution of message lengths and the selection of packet sizes. Different network topologies, with fixed routing strategies, are analyzed.
&ldquo;Error free MOS/LSI design system&rdquo;
Authors: Anthony V. Banes
Venue: Proceedings of the 9th Design Automation Workshop (1972)

Designing MOS/LSI devices can be, and in many cases is a complex, tedious task; one that is frustrating because sources of errors can be great and means of overcoming them are limited. When one considers the magnitude of the job, the finished size of the device, and the packing density of the elements, it becomes a challenging undertaking for the most capable of designers. Consider what must be accomplished in many of these complex devices. The number of gates is counted in thousands; the interconnections provide a network maze to lose many a tracer. All this is on a chip of 175 &times; 200 mils - less than two-tenths of an inch. The required spacing between elements must be, in many cases, less than three ten-thousands of an inch. Even with drawings made at 400 times size, this spacing distance is less than an eighth of an inch. The 175 &times; 200 mil chip at 400 to 1 becomes a drawing 70 &times; 80 inches. On this large drawing, signal lines are generally drawn 1/8 inch wide. Transistor gates are .25 &times; .30 inches. If the device is a random access or read only memory, or a shift register, the drawing is a collection of repetitive patterns in the center portion, with control logic around the periphery. On the other hand, if the device is a computer or a one chip calculator, then there is a minimum of repetitive logic. It is to this design that computer aids are most needed. The programs described here can be used on designs with repetitive cells equally as well as on the random logic designs.
Optical Videodisc technology
Authors: Thomas R. Kohler
Venue: Proceedings of the 1977 annual conference (1977)

The Philips and MCA Optical Videodisc 1,2 System will be discussed from a systems point of view. First, the unique attributes of the system will be examined, and then a short discussion will be given of the technology involved, i.e., mastering, replication and playback. Special applications, including possibilities for digital storage and combined video-digital storage, will also be discussed. The videodisc is 1.1 mm thick 30 cm in diameter, similar in size to the LP record of your home hi-fi system. It provides a full half hour of color video programming. The disc and the system design result in the following unique features.
The engineering design environment
Authors: Kirk Sherhart, Mark Vershel, Judy Owen
Venue: Proceedings of the 21st Design Automation Conference (1984)

A description of EDeN, a new Engineering Design Environment, is presented. EDeN software provides a hardware-independent, user-friendly interface and data management system that serves as the framework for the integration of DA tools and effective use of the hardware environment. EDeN-specific tools include schematics and layout entry/edit through an interactive color graphics system. EDeN promotes sharing of designs within a project in a controlled manner, preserving a uniform design representation. The system is extensible to new applications and new DA tools, with standards and controls applied at the user interface and data management levels.
Verification of an Algol 68 implementation
Authors: Bernard Houssais
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

A tool for the systematic production of test cases for a compiler is first presented. The input of the generator are formal grammars, derived from the definition of the reference language. This tool has been applied to the generation of test programs for Algol 68. For each construction which the language possesses, the syntactic structure of the corresponding test and the semantic verifications it contains are given. The test set has begun to be employed on a specific implementation. Discovered errors related to Algol 68 constructions are analysed.
The new generation of computer architecture
Authors: Philip C. Treleaven
Venue: Proceedings of the 10th annual international symposium on Computer architecture (1983)

Four major areas of research are involved in attempting to identify the fifth generation of computers (cir. 1990). The investigation of: knowledge processing systems, data and demand driven computers, integrating communications and computers, and VLSI processor architectures. From these four areas, two approaches for the fifth generation are emerging: one &ldquo;revolutionary&rdquo; - a parallel logic machine supporting knowledge processing applications, and the other &ldquo;evolutionary&rdquo; - a decentralised control flow system consisting of a network of heterogeneous processors. This paper describes the above four areas of research and discusses how their computing technologies are converging to produce fifth generation computers. It then contrasts the revolutionary logic machine approach adopted by Japan's Fifth Generation Project, and favoured by the artificial intelligence community, with the evolutionary control flow computer approach favoured by the data communications and microelectronics communities.
Defensive microprogramming
Authors: David T. Wang
Venue: Proceedings of the 15th annual workshop on Microprogramming (1982)

Defensive microprogramming is advocated for individual microprogrammers. Defensive measures, through proper documentation and adequate communication, will produce quality work and in effect provide protection. The use of this technique promises to make testing and maintenance of microprogram simple and easy.
The decidability of equivalence for deterministic finite-turn pushdown automata
Authors: Leslie G. Valiant
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

A deterministic pushdown automaton (dpda) is described as finite-turn if there is a bound on the number of times the direction of the stack movement can change in the set of all derivations from the starting configuration. The purpose of this paper is to show that there exists a procedure for deciding whether two such finite-turn machines recognize the same language. By virtue of a direct correspondence between a restricted class of one-turn dpda and deterministic two-tape acceptors (Valiant (1973)), our proof also provides a solution to the equivalence problem for the latter, alternative to that of Bird (1973). Since some of the ideas we introduce are not related exclusively to the finite-turn property, or even pushdown machines, it is hoped that our methods can be adapted for constructing equivalence tests for other classes of deterministic automata. Our main technique can be regarded as a generalization in several directions of one introduced by Rosenkrantz and Stearns (1970). They consider a class of pushdown automata for which a natural valuation can be placed on each stack segment, and deduce that for any input word, two equivalent machines in that class must have closely related stack movements. They show how, under such circumstances, for any two machines a single pushdown automaton can be constructed to simulate them both, and used to decide their equivalence. What we shall show is that even for a class with no such stack valuation known, and in which two equivalent machines can have totally dissimilar stack movements, pushdown automata, now nondeterministic, can be found to perform the required simulations.
Teaching workshops to college faculty, staff, and administrators
Authors: Susan J. Bahr
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

HELPING USERS become self-sufficient is one of the primary functions of academic computing in a college or university computer center. One-on-one consulting, the teaching of literacy courses and workshops, along with the distribution of documentation and newsletters, are some of the methods employed to help the user attain this self-sufficiency. I have worked in academic computing at Temple University in Philadelphia, Trinity University in San Antonio, Cuyahoga Community College in Cleveland, and Montgomery College in Rockville, Maryland. At these institutions, most of the aforementioned methods of helping the user attain self-sufficiency have met with little success. Manuals and newsletters are distributed for free, or for a small amount of money, to faculty, staff, and administrators. Even though users eagerly accept the written material, they rarely read it as can easily be inferred by the questions they later ask. Consulting is made available, but there aren't enough staff members to handle all of the needs for one-on-one consulting. The success of computer literacy courses often depends on work done outside the scheduled class time. At one institution where I taught literacy classes, the courses generated tremendous initial enthusiasm but that enthusiasm waned once the term got under way. Of all of the methods I have used to help the users become self-sufficient, workshops have been the most successful. This success can be measured by the types of questions workshop participants later do or do not ask relating to the topic that was taught. In this paper, I will draw upon my experiences in academic computing at the four institutions at which I have worked. At these colleges and universities, workshops have typically been two-hour sessions for groups of ten to twenty people. I will examine some of the reasons for the success of workshops, the evolution of the techniques I have used, and the rules-of-thumb I have developed for giving successful workshops.