ppxscal/embedding_network huggingface dataset:
Excellence, a service standard?
Authors: H. Gordon Bennett
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Being directly involved in computer user services over the past 21 years has led me to realize that although computer services groups persist in using the term 'service' through logos, organization titles, etc., etc., we sometimes fail to reach our goal. We know from everyday living that this can and does happen to many business organizations regardless of their function, but it can be especially true in a computer based operation where so much emphasis and attention is placed on the value and power of hardware/software, as opposed to the human needs within the organization's overall service plan. At Brigham Young University's Computer Services we recognized a similar potential situation and three years ago took what we feel was unique action to alter a course from mediocre customer service toward what the great majority of our users now feel is excellent customer service.
Thin Edge Detector
Authors: Agustín Trujillo
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Most of edge detectors are based on detecting points in the image with a high gradient value. However, in general, they omit the idea that the edge must be a connected line of pixels. Instead of that, these techniques normally use a global threshold value, to control the quantity of edge points detected. Due to this, many other edge points are detected, but some of them do not really belong to an edge.In this paper we propose a new edge detector, that detects entire pieces of 1-pixel thick lines. This algorithm is more robust concerning the choice of the threshold value, because it works with the average gradient value of each piece of line. Two previous filters are needed: a contrast process, to enhance the edges, and a morphological denoising to remove noise but without blurring the edges in the image. The proposed algorithm starts from pixels with a high gradient value, and follows neighbor pixels connecting new points. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The effects of CAD on the engineering organization (Position paper)
Authors: Paul Felton
Venue: Proceedings of the 18th Design Automation Conference (1981)

The growth in the use of Computer Aided Design (CAD) tools within the Engineering organization has been an evolutionary process. CAD technology has progressed from isolated analysis and documentation tools into complete integrated CAD systems. In order for an Engineering organization to effectively use an integrated CAD system, changes have to be made to organizational structure, organizational interfaces, project funding and project scheduling methodologies.
Visions of future programming environments
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

As the demand for greater system functionality is being met with software, the productivity of software development has been receiving increasing attention. The trend has been to provide software developers with automated tools to assist in many of the methodical tasks. More recently there has been a recognition that a development environment is more than simply a collection of tools. Several projects have investigated the issues involved in building software development environments. The use of very large scale integration techniques have likewise introduced the need for hardware developer to manage increasing levels of complexity. The VLSI and VHSIC communities have built a large number of tools to support their design activites. These communities are engaged in evolving those tools into integrated design environments.
A technique for implementing a set processor
Authors: W. T. Hardgrave
Venue: ACM SIGPLAN Notices (1976)

Extended set theory is an effective method for describing the complex data structures needed to support large-scale data base applications. This paper describes the incorporation of the salient concepts of extended set theory into a general tool for the design and implementation of large-scale database systems. This tool is called a set processor. This implementation is based on the representation of sets of positive integers as bit strings and the application of the Cauchy/Cantor Diagonal Method.
Computer Aided Ship Design and numerically controlled production of towing tank models
Authors: David F. Rogers, Francisco Rodriguez, Steven G. Satterfield
Venue: Proceedings of the 16th Design Automation Conference (1979)

A Computer Aided Ship Design (CASD) and a Computer Aided Manufacturing (CAM) program are described. The objective of the program is to provide the capability to design and manufacture towing tank models using interactive CASD and CAM techniques. A three dimensional interactive graphics device supported by a mini-computer is used to drive the design portion of the system. A microprocessor based graphics system, simply and directly interfaced to a CNC controller on the shop floor, is used to perform the postprocessing and drive the milling machine. Experiences with actual use of the system and the benefits derived from this use are discussed for an actual production job.
A measure of program locality and its application
Authors: Richard B. Bunt, Jennifer M. Murphy, Shikharesh Majumdar
Venue: ACM SIGMETRICS Performance Evaluation Review (1984)

Although the phenomenon of locality has long been recognized as the single most important characteristic of program behaviour, relatively little work has been done in attempting to measure it. Recent work has led to the development of an intrinsic measure of program locality based on the Bradford-Zipf distribution. Potential applications for such a measure are many, and include the evaluation of program restructuring methods (manual and automatic), the prediction of system performance, the validation of program behaviour models, and the enhanced understanding of the phenomena that characterize program behaviour. A consideration of each of these areas is given in connection with the proposed measure, both to increase confidence in the validity of the measure and to illustrate a methodology for dealing with such problems.
Real time simulation of elevators
Authors: George T. Hummet, Thomas D. Moser, Bruce A. Powell
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

The principal transportation system in a highrise building is the elevator system. The performance of the system as perceived by the passengers can be measured by the time spent waiting for a car and smoothness of the ride. In turn, the waiting time is a very complex function of many variables: number of cars, car speed, number of floors served, passenger traffic, elevator dispatching strategy, etc. This paper discusses a recently developed minicomputer simulator, ELSIM, which simulates passenger traffic and the service rendered by a bank of elevators. This simulator uses a realistic mathematical model for passenger traffic within real-time minicomputer software and a display panel to produce a valuable tool for evaluating new elevator installations and modifications to existing systems.
An iterative technique for printed wire routing
Authors: Frank Rubin
Venue: Proceedings of the 11th Design Automation Workshop (1974)

Wires are routed allowing crossings in the initial layout. By spreading the wires and increasing the crossover penalties, fewer crossings occur on each iteration until a crossing free layout is achieved.
A new approach to construction of computer systems
Authors: Tatsuya Hayashi
Venue: Proceedings of the 1975 annual conference (1975)

In this paper we propose a new method in which original form of the whole system (described in a design and implementation language called DEAPLAN) is directly implemented as it is without either modification or transformation. In other words a kind of high level language machine is considered in the more throughgoing way. Our hardware apparently has neither CPU nor storage device and only consists of a large number of quantum processing units (QPUs) except channels and peripherals. Therefore, extremely speaking, the main contemporary concepts such as virtual space, reenterability and multiplexing of CPU as well as compiling and linkage editing are all disappeared in our system. The identity of implemented version of the system with the original form seems to give a more fundamental solution to the problem of the rapid growth of operating systems compared with the mere structured programming and so on.
On the semantic structure of information - A proposal of the abstract storage architecture
Authors: Mario Tokoro, Takashi Takizuka
Venue: ACM SIGARCH Computer Architecture News (1982)

An important strategy to enhance both the reliability and performance of high-level program execution is to have computer architecture provided with the mechanisms, such as i) to address information in a unified manner regardless of the structure and/or of the size of information objects, and ii) to dynamically check the eligibility of information accesses. This paper firstly gives the foundation for such abstraction mechanisms through examining the semantic structure of information objects. Information is hereby formalized as a set of relations between an access and the entity that is accessed. The relations are hierarchically classified into four categories, each of which associates to the corresponding level of abstraction. Object-oriented architecture which reflects this hierarchical classification directly in its storage organization is then proposed. This architecture is called the abstract storage architecture. Issues in designing the abstract storage architecture are described. The effectiveness of such architecture is concluded from the view points of both the implementation of existing high-level languages and the design of future high-level languages.
An all cycle algorithm for undirected graphs
Authors: E. Dixon, S. Goodman
Venue: Proceedings of the ACM annual conference (1973)

An algorithm is presented which generates, without duplication, all the simple cycles of an undirected graph. The algorithm employs the concept of a fundamental cycle set and is based on a more efficient branching procedure than was used previously.1,2 As a consequence both execution time and storage requirements are greatly reduced. Also included is an improved method for finding the fundamental cycle set from a spanning tree, and a branch and bound option which will find the longest cycle in a graph.
Retrospective on high-level language computer architecture
Authors: David R. Ditzel, David A. Patterson
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

High-level language computers (HLLC) have attracted interest in the architectural and programming community during the last 15 years; proposals have been made for machines directed towards the execution of various languages such as ALGOL,1,2 APL,3,4,5 BASIC,6,7 COBOL,8,9 FORTRAN,10,ll LISP,12,13 PASCAL,14 PL/I,15,16,17 SNOBOL,18,19 and a host of specialized languages. Though numerous designs have been proposed, only a handful of high-level language computers have actually been implemented.4,7,9,20,21 In examining the goals and successes of high-level language computers, the authors have found that most designs suffer from fundamental problems stemming from a misunderstanding of the issues involved in the design, use, and implementation of cost-effective computer systems. It is the intent of this paper to identify and discuss several issues applicable to high-level language computer architecture, to provide a more concrete definition of high-level language computers, and to suggest a direction for high-level language computer architectures of the future.
Evaluation and Improvement of Slant Estimation for Handwritten Words
Authors: Yimei Ding, Fumitaka Kimura, Yasuji Miyake, Malayappan Shridhar
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

Handwritten words are usually slant or Italicized due to the mechanism of handwriting and the personality. The authors proposed a chain code method for the slant estimation and correction to improve the accuracy of character segmentation and recognition [1]. However the method is very simple and usually gives good estimate of the word slant, there is a defect such that the relationship between the actual slant and the estimated slant is not linear, and the slant tends to be underestimated when the absolute of the slant is close or greater than 45 degree. To remove the defect, this paper proposes new methods for evaluating and improving the linearity and the accuracy of the slant estimation.The result of experimental study shows that the proposed algorithms are improved in the linearity and the accuracy of the slant estimation, and that a high speed iterative method is efficient also in the processing time.
Classification and Representation of Networks from Satellite Images
Authors: Véronique Prinet, Songde Ma, Olivier Monga
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Classification is one of the major issue in image analysis and processing for remote sensing applications. Though classification based on texture analysis - land-use, forests, cities, etc - is the purpose of numerous works, classification of curvilinear networks is hardly processed. However, it is of major interest, in particular for image indexing and images matching, because it is a main feature whose global shape does not change with sensors nor point of view. This paper introduces a new approach aiming at (i) building the networks from extracted curvilinear-like features and (ii) classifying them into roads, highways, rivers. The main idea is to use a decision tree taking into account a priori knowledge. Classification and graph building are achieved simultaneously using a hypothesis generation/propagation scheme. The resulting network is encoded as a graph with a multi-scale description. Illustrations given on satellite optical SPOT images show encouraging results.
Specifications a key to effective software development
Authors: P. C. Belford, A. F. Bond, D. G. Henderson, L. S. Sellers
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Specifications provide the fundamental link to make the transition between the concept and definition phases of the system development cycle. Straightforward, unambiguous specifications are required to ensure successful results and at the same time minimize cost overruns during the development cycle. Many of the problems currently being addressed by software engineers have their origins in the frequently inconsistent and incomplete nature of system specifications. The U.S. Army Ballistic Missile Defense Advanced Technology Center (BMDATC) is currently studying several advanced software development technologies. BMDATC's efforts are directed toward identifying and resolving the fundamental problems that plague the software community: excessive costs, unrealistic or inappropriate schedules, and inadequate performance. A primary category of the BMDATC program is Data Processing System Engineering Research. This research employs an advanced engineering approach to the generation, verification, and unambiguous communication of a complete and consistent set of system requirements. The key elements of this technology are: (1) a mathematically rigorous decomposition technology that effectively translates system requirements into a traceable graphic representation; (2) a usable System Specification Language (SSL) that supports simulation and specification generation; (3) a set of software tools that aid in the development, verification, and configuration control of the decomposed requirements; and (4) a management approach that supports the designed-in quality of the developed specification. Definitive specifications are of primordial importance to the development process in that they are both the springboard for the design process and the yardstick of the test procedures. This paper describes the importance of verifying systems specifications before commencing any software design and delineates a technique for accomplishing this objective.
Experience with processes and monitors in Mesa (Summary)
Authors: Butler W. Lampson, David D. Redell
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

In early 1977 we began to design the concurrent programming facilities of Pilot, a new operating system for a personal computer [5]. Pilot is a fairly large program itself (25,000 lines of Mesa code). In addition, it supports some large applications, ranging from data base management to internetwork message transmission, which are heavy users of concurrency (our experience with some of these applications is discussed in the paper). We intended the new facilities to be used at least for the following purposes: Local concurrent programming: An individual application can be implemented as a tightly coupled group of synchronized processes to express the concurrency inherent in the application. Global resource sharing: Independent applications can run together on the same machine, cooperatively sharing the resources; in particular, their processes can share the processor. Replacing interrupts: A request for software attention to a device can be handled directly by waking up an appropriate process, without going through a separate interrupt mechanism (e.g., a forced branch, etc.).
Recent developments in numerical techniques for treating material interfaces
Authors: Hans M. Ruppel
Venue: Proceedings of the SIGNUM meeting on Software for partial differential equations (1975)

The Arbitrary-Lagrangian Eulerian Technique (ALE) provides a framework in which one can regrid individually different regions of a calculational mesh. In particular, one can treat an interface between materials as a Lagrangian line and rezone the remaining parts of the grid with some appropriate algorithm. This keeps material from being fluxed across the interface and avoids the problem of mixed cells with the attendant difficulty of obtaining pressures for such cells. At the same time it maintains some degree of regularity in the regions away from the interface.
Polyvalent functions, operators, strand notation and their precedence
Authors: Richard L. Naugle, Joseph B. Schlam
Venue: Proceedings of the international conference on APL (1984)

Functions and operators that take any number of arguments are proposed. Examples in current APL are shown. Function subvalence and polyvalent defined functions are established. Polyvalent primitive functions respond as follows: 644(A A+A),(A A+),+A A&larr;2 Current operator usage, operator subvalence, polyvalent defined operators are explored. A polyvalent primitive product operator and polyvalent returns are examined. Precedence rules are studied. Polyvalent low strand precedence works as follows: 4096A A times;A A+A&larr;4
A fifth generation approach to intelligent information retrieval
Authors: Gian Piero Zarri
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

This paper briefly examines certain of the Intelligent Information Retrieval (IIR) mechanisms used in the RESEDA system, a system equipped with &ldquo;reasoning&rdquo; capabilities in the field of complex biographical data management. Particular attention is paid to a description of the different &ldquo;levels&rdquo; of inference procedure which can be executed by the system. The intention is to show that the technical solutions to IIR problems implemented in RESEDA are of an equivalent level to those now proposed in the same field by the Japanese project for Fifth Generation Computer Systems.
Discrete event simulation using PL/I based general and special purpose simulation languages
Authors: Walter C. Metz
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

This paper describes the architecture and language features of a simulation model which was developed using a new IBM discrete event simulation package based on PL/I. The package contains implementations of both the GPSS and SIMPL/I simulation languages, and in addition provides the capability for a model developer to create special purpose simulation languages tailored to his unique simulation application. The model described in this paper simulates a retail or supermarket store point-of-sale communication system. The model was written using both GPSS and SIMPL/I commands, but with a limited subset of the available commands in each language. Three special purpose languages were developed so that a model user can easily create a version of the model that simulates a particular store system. The model description illustrates the various language alternatives available with this new simulation package.
Small business system performance analysis
Authors: James O. Dyal, William DeWald,  Jr.
Venue: ACM SIGSIM Simulation Digest (1979)

This paper presents results from the performance simulation study of a small business-oriented computer system. The system, SPERRY UNIVAC BC/7-700, is commercially available in the configuration modeled and in other higher performance models. All BC/7 systems modeled are supported with highly interactive applications software systems. The model is parameterized to select one or more workstations and one or more cartridge disks. File allocations are by cylinder. Seek times are computed by remembering the position of each movable arm. References are randomized within each file, but the sequence in which files are accessed is controlled by the application logic, in conjunction with the number of line items/order. Most event times are not constant, but the result of drawing randomly against empirical distributions with specified mean and standard deviation. For this study, the system simulated is composed of a single work-station running the highly interactive on-line version of a sophisticated order entry application package. Principal performance measures are system throughput and response time, including operator action times. It is found that, in the single workstation environment, performance is very cost effective in this highly competitive part of the information system market.
Experiences with a simple structured programming language
Authors: Victor R. Basili, Albert J. Turner
Venue: ACM SIGCSE Bulletin (1974)

A great deal of interest has developed in structured programming [Dahl, Dijkstra, and Hoare, 1972] during the past few years. This paper is concerned with some experiences obtained in the use of a structured programming language in the computer science curriculum at the University of Maryland. The language used was SIMPL-X [Basili, 1973], a language designed and implemented at the University of Maryland. SIMPL-X was designed to be a transportable, extendable, compiler-writing language that was to be the base language for a family of programming languages. It is, in fact, being used for that purpose as the SIMPL-X compiler [Basili and Turner, 1973] is written in SIMPL-X, and a compiler for the graph algorithmic language GRAAL [Rheinboldt, Basili, and Mesztenyi, 1972] is presently being designed as an extension of the SIMPL-X compiler.
An algorithm for sorting bibliographic data
Authors: Charles R. Sage
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

The subject of this paper might seem out of context with the interests of this audience; however, there is a category of users who under-utilizes your facilities, namely the library, and perhaps an explanation of an application in a typical academic library might help serve to open a new area of support services. A portion of our library materials (30,000 serial entries) at Iowa State University are accessed in a public book catalog2 rather than in a card catalog. All these records are in machine-readable form and are computer sorted. This paper discusses the algorithm that was developed to sort these records.