ppxscal/embedding_network huggingface dataset:
A simulation model for predicting the effect of advertisement schedules
Authors: R. Balachandra
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

Advertisement Scheduling refers to the detailing of where advertisements for a product/idea should appear in different media vehicles (TV shows, magazines, etc.) so as to maximize the effect on the target population. The effect is usually hoped to be favorable and influence the population to go out and buy the product/idea. Media scheduling models provide solutions that describe the number of advertisements to be inserted in different media vehicles over a given time horizon. These models do not specify the precise timing of the insertions, as it is usually assumed that within a given time interval there are not many choices for any one media option. (e.g. there is only one Reader's Digest each month). But if TV or radio is considered the situation becomes more difficult. The number of choices even within a week is large (e.g. there are five &ldquo;To-night&rdquo; shows in a week); and many of the desired spots may not be available because of high demand. Therefore the detailed schedules which take into consideration the availability of specific spots must be evaluated. As the relationships that exist between exposure to advertisements, their timing and the effect on the individuals are complex analytical methods are not very useful. The simulation model described below evaluates different advertisement schedules for their effect on the target population. The effect can be in terms of any one of a number of variables - probability of purchase, awareness of brand's advertisement, intention to purchase etc. In this model awareness of the brand's advertisement is used as the desired variable. Although not directly influencing the market share of the brand, this variable is considered quite important by marketing managers. The model is a micro-simulation model - it stimulates the responses of individuals from the sample population. It can simulate single period and multi-periods.
Retrieval systems(Tutorial Session): documents and data
Authors: Gerard Salton, Edgar Sibley
Venue: Proceedings of the 1976 annual conference (1976)

This tutorial session reviews the state of the art with reference to two major types of retrieval systems, namely, Information Retrieval and Database Management. Each discussant will (1) introduce the basic concepts and terminology of his field, and (2) building on this foundation, provide information about current problem areas and, wherever possible, the indicated solutions. Similarities and differences between the two areas will be evident as a result.
An automated software design evaluator
Authors: Nancy Giddings, Tim Colburn
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

A prototype automated software design evaluator was implemented as part of a project whose long-term goal is the application of AI techniques to the tools in a software engineering environment. The purposes of undertaking this prototype were to: 1) identify the attributes of a software design that could be captured as design rules, 2) investigate machine-processable representations of a software design, and 3) build a proof-of-principle prototype that demonstrates that an automated design assistant can be built.
Computability theory in admissible domains
Authors: E. Sciore, A. Tang
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

Denotational semantics was introduced by Strachey as a means of defining semantics of programming languages. It's mathematical foundation was justified by Scott [14] in 1969 when he introduced continuous lattices to model data types and showed how to solve reflexive domain equations. It is not the case that any solution of a given reflexive domain equation is a suitable model for studying denotational semantics. In programming languages, the constructs that we deal with can all be realizable by some machines, hence their meanings, considered as mathematical objects in a lattice, should be computable. In other words, we need a solution where we can formalize the notion of computability. Of course, this means that many continuous lattices are irrelevant to the study of denotational semantics of programming languages. It is the purpose of this paper to isolate those lattices which are relevant.
ACM conference paper quadratic programming with bounded variable restrictions
Authors: Y. C. Ho, Peter Wegner
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Let x be an n x l vector of variables, p be an n x l vector, and C be an n x n positive definite matrix. Consider the problem of minimizing (1) z &equil; p'x + 1/2x' Cx subject to restrictions of the form (2) ximin &le; xi &le; x.imax i &equil; l, ..., n
Alternative Approaches To Wiring The Office Of The Future (Panel Discussion)
Authors: Victor A. DeMarines, David Willward
Venue: Proceedings of the 1978 annual conference (1978)

The work described centers on communications in the local environment such as an office building, hospital, military command center and the like. Connection is made to long haul services through gateways to support desk-to-desk connection. To be completely supportive of the requirements, the solution must provide for interaction in all modes whether it be video, voice, or data. CATV coaxial cable technology can provide the bandwidth (in excess of 300 Mhz) necessary to support the most demanding of requirements. Signal quality is excellent and flexibility is provided at low cost. The use of two complete one-way systems provides for transmission and reception at any point in the system to any other. For example, a TV camera transmits a signal on a frequency on one cable (called inbound) which is made available to all subscribers on the outbound cable. Connection, and perhaps frequency translation, is accomplished at the cable headend. Similarly, in the data communication environment subscribers (terminals, computers, etc.) are connected so that all data traffic is available to all other subscribers. Called bus systems, a degree of flexibility is provided that is unparalleled in current point-to-point or switched interconnection systems. Consider that the devices connect to the inbound and outbound coaxial cables through a bus interface unit (BIU). The BIU collects data from the device, affixes the address and other header data, and transmits it on a designated frequency on the coaxial cable. The data is made available to all other BIUs. If the message is meant for a BIU, it accepts the message, decodes it, and passes it on to the device connected. Broadcasting on a multidrop structure is provided by having BIUs filter on message contents. The switching function is thus distributed. Cost of the bus system is very nearly equal to the cost per BIU times the number of BIUs (assuming the coaxial cable cost is relatively small). Connection between devices of different speed and protocol can, to some extent, be accommodated by BIU adaptation. The RF broadcast nature of the CATV facilitates the easy movement of devices, since service is provided at any of the prewired outlets.
Productivity improvement analysis using simulation
Authors: Joseph F. Faccenda
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

In recent years, a growing number of American industries have faced increased competition from foreign manufacturers. As a result, many corporations are investing more of their resources in productivity and process modernization studies. This paper describes how the Remington Arms Corporation is using a simulation model as part of the productivity improvement/process modernization program at its Ilion, New York plant. The objectives of this simulation modeling effort are reviewed; the development of the model and the data requirements are summarized; and aspects of the implementation are discussed. Examples of its initial application in the analysis of short-term process improvements are presented.
IRAIN - an instructional relational database system designed for small computer system
Authors: A. C. Liu, S. K. Chang
Venue: Proceedings of the 5th ACM SIGSMALL symposium on Small systems (1982)

A modular design approach for a database system is presented in this paper. We require that every database file be self-descriptive and every program module be self-contained. To improve access efficiency and database security, database decomposition is also considered. Based upon this approach, IRAIN - a relational database system is designed and implemented on PDP11 UNIX system. Similar approach can be applied to other data models.
The cytocomputer: A practical pipelined image processor
Authors: Robert M. Lougheed, David L. McCubbrey
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

This paper presents a new architecture for image processing. It consists of a pipeline of identical programmable serial processing stages, referred to as a cytocomputer. Comparisons are made between cytocomputer and parallel array systems. Cytocomputer systems are shown generally to possess the advantages of lower complexity, high bandwidth and greater architectural flexibility. A first generation system is described and examples of processing are illustrated. Finally, current development efforts are described.
Coercion and type inference
Authors: John C. Mitchell
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

A simple semantic model of automatic coercion is proposed. This model is used to explain four rules for inferring polymorphic types and providing automatic coercions between types. With the addition of a fifth rule, the rules become semantically complete but the set of types associated with an expression may be undecidable. An efficient type checking algorithm based on the first four rules is presented. The algorithm is guaranteed to find a type whenever a type can be deduced using the four inference rules. The type checking algorithm may be modified so that calls to type conversion functions are inserted at compile time.
3-D graphic display of discrete spatial data by prism maps
Authors: Randolph Franklin, Harry R. Lewis
Venue: ACM SIGGRAPH Computer Graphics (1978)

An efficient algorithm for displaying 3-D scenes showing a discrete spatially varying surface is described. Given a 2-D map or planar graph composed of polygons where each polygon has a positive real number attribute, a prism is erected on each polygon with height proportional to that attribute. The resulting 3-D scene is plotted with shading and hidden lines removed. Thus the spatial variation of the attribute may be quickly and intuitively grasped by the nontechnical observer. This has applications to areas such as geography if the map is a cartographic map, or to physics if the map diagrams the periodic table. The algorithm takes time O(N*log(N)) where N is the number of edges in the map. Most of the calculations can be done without knowing the prism heights so extra plots with different attributes for the prisms can be produced quickly. This algorithm has been implemented and tested on maps of up to 12000 edges.
Coupling graphics and circuit analysis techniques
Authors: J. L. Malakoff
Venue: Proceedings of the 4th Design Automation Conference (1967)

The purpose of this paper is to describe an application program written by the International Business Machines Corporation to couple the existing Electronic Circuit Analysis Program(1) with the IBM 2250 cathode ray tube display scope. The program which, in this paper, will be referred to as 2250 ECAP is a Type III program available from IBM(2). 2250 ECAP has been in use at Beckman Instruments, Inc., Fullerton, California, for approximately four months. This paper will detail some of the experiences available from the use of this program, some of the pitfalls of its use, as well as human factor education relative to the displayed image generated throughout the application.
A new grammatical transformation into LL(k) form (Extended Abstract)
Authors: Michael Hammer
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

For some time, it has been recognized that left-to-right deterministic top-down parsing has a number of features to recommend it. The logic of such a parser is easily expressed as a one-state pushdown machine, and very flexible translations can readily be performed in conjunction with top-down processing. The major difficulty with this style of parsing is that there are relatively few grammars which satisfy the rather restrictive requirements to admit of top-down parsing (the LL(k) grammars), in comparsion with grammars that can be parsed deterministically bottom-up (the LR(k) grammars). There has been some research along the lines of trying to apply transformations to non-LL(k) grammars in order to convert them into equivalent LL(k) form [1,2,3]; the most successful approach has been that of Rosenkrantz and Lewis [4]. They define class of grammars, the LC(k) grammars, which can be parsed in a mixed hybrid of top-down bottom-up techniques; this class strictly includes the LL(k) grammars, as well as many interesting but non-LL(k) grammars. They then provide a deterministic algorithm for converting any LC(k) grammar into an equivalent LL(k) grammar. This work is a generalization of, and in the same spirit as, the Lewis and Rosenkrantz program. We investigate a new hybrid parsing method, basically bottom-up in character, but which contains a minimal infusion of top-down ideas. We consider the class of grammars which can be parsed by this method, and observe that it strictly includes the class of LC(k) grammars. Then we exhibit an algorithm for deriving from any such grammar an equivalent LL(k) grammar; this derived grammar is also as &ldquo;useful&rdquo; as the original one in directing compilation activities, for it can support translations equivalent to those supportable by the original grammar.
UNIGRAFIX
Authors: C. H. Séquin, P. S. Strauss
Venue: Proceedings of the 20th Design Automation Conference (1983)

UNIGRAFIX is a three-dimensional graphics modeling environment that runs under the UNIX operating system. It comprises a terse, human-readable descriptive language that allows scene files of complex objects to be created with little overhead. These scenes can be used as input to a set of UNIGRAFIX programs which can be run either as separate functional units, or from within the interactive UNIGRAFIX environment. Programs are available to transform and illuminate the scene descriptions and to display them in a variety of styles on various output devices. The built-in hidden-face and hidden-line elimination routines use a scan-line algorithm which makes strong use of scan-line coherence as well as object coherence.
A pictorial format function for patterning decorated numeric displays
Authors: Adin D. Falkoff
Venue: Proceedings of the international conference on APL (1981)

An extension to the APL dyadic format function is proposed, using a character vector left argument. This argument is a literal pattern having the exact length of the last dimension of the resultant array. No special markers are required to separate adjacent numeric fields, arbitrary decorations may appear within or outside of fields, negative or positive numbers can be distinguished by symbols of choice, and there is provision for accommodating the number representation practices of different countries. The extension completely covers the present functional capability of dyadic format with one minor exception (and possible improvement) in a detail of exponential presentation. In the proposed extension, format information is carried in three ways: in the structure of the pattern, in the choice of digits to denote number fields, and in a system variable. Common requirements, such as the use of commas, floating negative signs on either or both sides of a number, and optional suppression of zero values, are achieved very simply. This paper will describe the evolution of this proposal, which was first discussed at APL/73, give a rigorous formulation of the rules, and show examples of its use.
M-valued sequential cellular networks
Authors: S. F. Thelliez
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

Complex behavior in sequential machines can be achieved by either a large number of simple connected machines or by having a complex machine to start with. Our primary interest being with the former we have tried to get systematic decompositions of a n-state asynchronous sequential machine into a network of identical m-state asynchronous sequential machines.
A set-based benchmarking method for address bloc location on arbitrarily complex grey level images
Authors: S. Randriamasy
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

A set-based benchmarking method has been previously presented for page segmentation. The author proposes to adapt it to address bloc location on grey level images of various layouts and visual quality. For each mailpiece, a ground truth file describing the address bloc lines is compared with the automatically located zones meant to contain them. The pixels forming the ground truth lines are extracted by an adaptive binarization on the manually located zones. The algorithm allows ABL to locate lines partially, to provide several solutions, and the contents-related importance of a text line is reflected numerically. It provides an explicit error diagnosis together with a numerical evaluation.
Computer-aided space planning
Authors: William R. Miller
Venue: Proceedings of the 7th Design Automation Workshop (1970)

This paper describes the application of MATRAN-III, a computer program developed by the author, to planning the space for a branch bank in Southern California. MATRAN-III is used to identify clusters of elements within a set of interrelated elements. The program accepts any arbitrary listing of the elements and their proximal relations and creates an adjacency matrix. This matrix is block diagonalized yielding visually recognizable patterns which can be mapped into line-dot diagrams. These diagrams can then be presented to a designer providing him with a memory pattern from which we can begin laying out the geometric configuration of the space.
A flexible semantic analyzer for Ada
Authors: Mark S. Sherman, Martha S. Borkan
Venue: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language (1980)

A technique for writing semantic analysis phases of compilers is described. The technique uses Simula classes and virtual procedures to create a flexible and modular program. This technique is used to implement a semantic analysis phase of a compiler front end for the preliminary Ada language. Because the design is extremely flexible and modular, the front end is able to accommodate changes in the Ada language and its semantics as they are published. Several problems were encountered when implementing Ada's semantics. These problems are described and their solutions presented. The front end also produces TCOLAda, the specified intermediate language for various Ada compiler contracts. This output has been used by an experimental compiler back end. [9] The front end is written as two programs which perform lexical analysis, syntactic analysis, semantic analysis, and TCOLAda generation. The front end is coded in Simula, and has been running on DEC Tops-10 and Tops-20 systems since September 1979.
The computer as coach: As athletic paradigm for intellectual education
Authors: Ira Goldstein, Brian Carr
Venue: Proceedings of the 1977 annual conference (1977)

Over the next five years, computer games will find their way into many homes, creating a unique educational opportunity: the development of &ldquo;computer coaches&rdquo; for the serious intellectual skills required by some of these games. From the player's perspective, the coach will provide advice regarding strategy and tactics for better play. But, from the perspective of the coach, the request for help is an opportunity to tutor basic mathematical, scientific or other kinds of knowledge that the game exercises. Establishing an &ldquo;athletic&rdquo; paradigm for skills usually considered the antithesis of ordinary sports is an exciting prospect. There are, however, critical research issues which must be addressed. While the hardware needed for games and coaches will continue to drop in cost, the software technology (and related educational and psychological theory) for designing competent coaches is only beginning to be developed. This paper presents a preliminary design for such coaches and describes a protoype coach for the computer game of Wumpus.
The Yorktown Simulation Engine: Introduction
Authors: Gregory F. Pfister
Venue: Proceedings of the 19th Design Automation Conference (1982)

The Yorktown Simulation Engine (YSE) is a special-purpose, highly-parallel programmable machine for the gate-level simulation of logic. It can simulate up to one million gates at a speed of over two billion gate simulations per second; it is estimated that the IBM 3081 processor could have been simulated on the YSE at a rate of 1000 instructions per second. This is far beyond the capabilities of existing register-level software simulators. The YSE has been designed and is being constructed at the IBM T. J. Watson Research Center. This paper introduces the YSE and describes its top-level architecture.
The alvey DHSS major demonstrator
Authors: Myer W. Morron
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

This project is a result of the study carried out by the ICL-led consortium under a grant from the Alvey Directorate. The funded study commenced on 1 November 1983. A major Five year Demonstrator Project is described. The consortium in conjunction with the UK Department of Health and Social Security (DHSS) began work on the project in April 1984. The subject of this Demonstrator Project is knowledge-based Decison Support within a legislation based organisation. The project is staffed as follows (numbers represent the Year 5 peak contributions): ICL (15 people) Logica UK Ltd (3.5 people) >University of Lancaster (6 people) University of Surrey (6 people) Imperial College (2 people) In addition the DHSS are providing 3 people full time and various facilities: several consultants will also be utilised.
Wealth and jobs in the fifth new world
Authors: Abbe Mowshowitz
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Automation in the 1950's sparked predictions of massive unemployment, and similar gloomy forecasts have been voiced many times since then. Although "Detroit automation" (transfer lines) did increase productivity and contribute to a decline in manufacturing employment, expansion of job opportunities in the service and information sectors more than compensated for that loss. Moreover, the rapid diffusion of computer applications has been accompanied by the creation of new kinds of jobs. With the advent of microelectronics and, more recently, intelligent systems in the marketplace, the specter of unemployment looms large once again. However, many observers are reluctant to predict widespread unemployment for fear of emulating the little boy who cried wolf.