ppxscal/embedding_network huggingface dataset:
Mutual fund performance&mdash;a reconsideration
Authors: Manak C. Gupta
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

In a recent article Levy and Saranat, hereafter referred to as SL [6], raise the question of reconciling the phenomenal growth of mutual funds with the equally phenomenal evidence, produced by the studies of Jensen [5] and Treynor and Mazuy [11], to cite a few, that their risk return performance has not been superior to that of the unmanaged portfolios. SL attribute this paradoxical situation to comparison of mutual funds' performance against that of a highly diversified Standard and Poors Index of 500 stocks rather than to some alternative attainable by most investors. SL argue that this kind of comparison, and the conclusion based on it, is not relevant since the alternative of attaining the degree of diversification implicit in the 500-index is not attainable by most small investors with their limited resources. But then the conclusion that mutual funds offer a better alternative, and hence their phenomenal growth, based solely on the comparison of performance of eight arbitrarily selected mutual funds against the performance of eight arbitrarily chosen stocks is hardly valid either. We concede that the performance of mutual funds be considered against that of the alternative attainable by most individual investors, and, following this line of thought, we evaluate the risk-return performance of several alternatives, all easily attainable by the average individual investor. The alternatives evaluated in this study are the following: (a) investment in Growth and Price Appreciation portfolios recommended by the Standard and Poor's (b) investment in Safety and Income Portfolios recommended by the Standard and Poor's (c) investment in the stocks comprised in the Dow Jones Index (d) investment in mutual funds. Transaction costs are taken into account in computing the comparative risk return variates from different alternatives with realistic limitations on the investment resources and the corresponding diversification levels. The method used to compare the risk return obtainable from different sources is simulation to be described in the next section.
The determination of upper bounds for economically effective compression in packet switching networks
Authors: Avner Aleh, K. Dan Levin
Venue: Proceedings of the Computer Network Performance Symposium (1982)

This paper deals with the economic tradeoffs associated with data compression in a packet switching environment. In section II we present the data profile concept and the compression analysis of typical file-transfer data strings. This is followed by a compression cost saving model that is developed in section III. Upper bounds for an economically effective compression service are derived there, and the paper concludes with an example of these bounds based on state of the art technology.
The big three - today's 16-bit microprocessor
Authors: R. K. Bell, W. D. Bell, T. C. Cooper, T. K. McFarland
Venue: ACM SIGMICRO Newsletter (1980)

This paper reports on the functional evaluation of the three 16-bit microprocessors, namely the Intel 8086, the Zilog Z8000, and the Motorola MC68000. These microprocessors were employed in several CRT applications, both monochrome and color. Execution time benchmark tests were made, mechanization problems compared and instruction/architectural characteristics highlighted. Conclusions and recommendations are made applicable to terminals and similar Sperry Univac products.
Selecting a consultant: A maxi problem in the mini-micro world
Authors: Allen K. Henry
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

In the last decade there has been a significant increase in the number of computer users. Much of the increase can be directly attributed to the development of mini-micro computer systems. Vendors of these systems have recognized the tremendous potential market in both education and small businesses and their marketing campaigns have placed professional educators and small businessmen in a position to be challenged by peers as well as competitors. However, many of the educators and businessmen do not have the talent to select and integrate a computing system into their current environment. Countless stories illustrate the frustrations those people have experienced as they attempted to make the transition into the world of computing. Many of the stories also contain statements of dissatisfaction with outside consulting services. This paper will focus on the latter situation. It will contain a survey of the consulting practices associated with both business and education, a summary of efforts to establish a certification program for computer professionals, and offer suggestions on how to select a computer consultant for mini-micro computer systems.
Automatic generation of GRBF networks for visual learning
Authors: S. Mukherjee, S. K. Nayar
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

Learning can often be viewed as the problem of mapping from an input space to an output space. Examples of these mappings are used to construct a continuous function that approximates given data and generalizes for intermediate instances. Generalized Radial Basis Function (GRBF) networks are used to formulate this approximating function. A novel method is introduced to construct an optimal GRBF network for a given mapping and error bound using the integral wavelet transform. Simple one-dimensional examples are used to demonstrate how the optimal network is superior to one constructed using standard ad hoc optimization techniques. The paper concludes with an application of optimal GRBF networks to object recognition and pose estimation. The results of this application are favorable.
Synchronization and recovery in database systems
Authors: Rudolf Bayer
Venue: Proceedings of the 4th international conference on Software engineering (1979)

Transactions are processes, which must have an atomic effect - from the user's point of view - on the state of a database. To provide this property, a database system must be prepared to undo any effects of a transaction on the state of the database, if for some reason the transaction cannot be completed successfully. Copies of data objects - shadows - are kept to be able to recover the state of the database before the transaction was started. Single transactions are assumed to be correct, i.e. to transform a correct database state into a correct database state, if they run by themselves without any disturbances by other transactions. For several reasons, however, a viable database system must be able to perform transactions in parallel, still guaranteeing the same net effect on the state of the database as if the transactions were run in some serial order one after the other. This is achieved by proper consistant synchronization, which should be supplied automatically by the database system. An important class of synchronization protocols uses locks of various types. Locks, however, tend to decrease the parallelism between transactions. Recovery techniques based on shadows and synchronization based on locking can be combined to substantially increase the potential parallelism between transactions. Several special types of locks are introduced and the corresponding synchronization protocols are developed leading to a unified approach to synchronization and recovery. One of these protocols has the property that transactions, which only read the database, never have to wait for other transactions. This property allows new longterm recovery techniques requiring a complete copy of the state of the database for archival purposes. The generalization of these techniques to distributed database systems will be discussed.
Decidability of reachability in vector addition systems (Preliminary Version)
Authors: S. Rao Kosaraju
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

A convincing proof of the decidability of reachability in vector addition systems is presented. No drastically new ideas beyond those in Sacerdote and Tenney, and Mayr are made use of. The complicated tree constructions in the earlier proofs are completely eliminated.
DRAW3D: Time sharing graphic interaction using a device-space buffer
Authors: Nicholas H. Weingarten, William Kovacs, Michael Corden
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper presents the DRAW3D system, a three-dimensional interactive graphics program which operates in a time sharing environment. Key to this system is a device-space buffer which reduces demand for CPU power and enables a number of features not usually associated with non-refresh displays.
Coherent array imaging with sparse arrays
Authors: T. J. Schulz
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

For coherent, phased-array imaging systems, sparse arrays are often used in which the aperture is not completely filled by the array. Often, the data that are not collected by the array are set to zero and an image is obtained through a straight-forward Fourier inversion. An alternative technique-based on the method of maximum-likelihood estimation from incomplete data-is discussed for handling the missing data and forming images from data acquired by a coherent imaging system with a sparse array.
An approach to testing specifications (Preliminary Draft)
Authors: C. Jard, G. V. Bochmann
Venue: Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging (1983)

An approach to testing the consistency of specifications is explored, which is applicable to the design validation of communication protocols and other cases of step-wise refinement. In this approach, a testing module compares a trace of interactions obtained from an execution of the refined specification (e. g. the protocol specification) with the reference specification (e. g. the communication service specification). Non-determinism in reference specifications presents certain problems. Using an extended finite state transition model for the specifications, a strategy for limiting the amount of non-determinacy is presented. An automated method for constructing a testing module for a given reference specification is discussed. Experience with the application of this testing approach to the design of a Transport protocol and a distributed mutual exclusion algorithm is described.
Alternative proposals for implementing Prolog concurrently and implications regarding their respective microarchitectures
Authors: Carl G. Ponder, Yale N. Patt
Venue: ACM SIGMICRO Newsletter (1984)

Prolog has become a subject of much discussion of late. It has been suggested as the logical language for programming expert systems. A parallel variant is said to be the language of the Japanese 5th Generation Project. In this paper the standard Prolog language is defined and shown to be a restriction of Logic Programming. Several alternative schemes, which have been proposed for improving the performance of Prolog, are examined. Some schemes change the semantics of the language; these effects are discussed. All schemes have implications on the microarchitecture of the implementing engine; these implications are studied.
Rotating memory processors for the matching of complex textual patterns
Authors: Lee A. Hollaar
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

Many people have suggested adding scanning logic to a rotating memory system, such as disk or shift registers, to allow faster execution of database operations. Most of these have been concerned with producing a form of associative memory which is then used to implement one or more of the models for information storage and retrieval, such as relational or hierarchical. While these are capable of searching for simple character strings, they are incapable of handling the complex patterns sometimes necessary for textual information retrieval. In addition, textual information retrieval does not lend itself to highly formatted databases, encoding of information, or arbitrary ordering of data, concepts common to the other structures. A description of the operations desirable in textual information retrieval is given, and contrasted to those operations allowed in non-textual systems. The general structure for a scanning processor is presented, and a number of different trade-offs in its design and operation are discussed.
FSDS-Fairchild Software Development System
Authors: Harley Mathews, Kam Li, John Katsaros
Venue: Proceedings of the 1975 annual conference (1975)

The Fairchild F8 Software Development System (FSDS) runs on the Fairchild F8 Microprocessor. Designed to ease the burden of developing F8 based microprocessor systems, FSDS enables testing programs in a real world environment. The FSDS system provides for generating, editing and maintaining source files, assembling user's programs, and executing routines using F8 hardware. This system was developed both for in-house Fairchild applications as well as customer based development programs. FSDS not only provides a rapid means to develop application software; it also eliminates the costly method of simulating the application via a time sharing terminal.
Defining the bounding edges of a SynthaVision solid model
Authors: Robert Goldstein
Venue: Proceedings of the 18th Design Automation Conference (1981)

A computer software package is described, whose function is to provide an interface from a solid geometric modeler to a more conventional 3D wireframe system. Specifically, the conversion of a SynthaVision solid model to an edge-vertex data structure is discussed. The paper describes, qualitatively, the approach to solid modeling used in SynthaVision, a geometry translator that outputs an &ldquo;edge file&rdquo; containing the bounding edges of the model, and a view generator that processes the edge file to produce line drawings.
The IBM Systems Research Institute: An intra-company activity
Authors: F. S. Beckman
Venue: Proceedings of the third annual computer personnel research conference (1965)

In recent years it has become quite apparent that the optimal use of digital computers in the enormously varied situations in which they are applied generally requires significant knowledge of many areas and an over-all systems approach. Increasingly sophisticated uses of computers often involve a complex information system in which there may be broad interaction of the computer and the organization in which it is used. A new profession of information or data processing systems engineering is developing, and a substantial body of subject matter and experience is accumulating.
Image Segmentation by Texture Analysis
Authors: Cecilia Di Ruberto, Sergio Vitulano, Giuseppe Rodriguez
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Texture segmentation is a significant and primary issue in texture analysis. It is concerned with automatically determining the boundaries between various textured regions in an image. In this paper we propose a region-based method for textured image segmentation. First, we consider the basic problem of texel identification and the determination of its shape. Further, we describe the texture characterized by a texel, that is we identify the equivalence class of a certain structural description. Finally, we improve the accuracy of the boundaries provided by the segmentation algorithm using least squares spline approximation.
APL symbolic manipulation and generating functions
Authors: A. Kellerman
Venue: Proceedings of seventh international conference on APL (1975)

This paper is a continuation of the work of Kellerman and Rodgers [1], who covered some basic techniques of solving combinatorics problems using several features of the APL language. This paper presents a powerful additional technique: the use of generating functions.
The channel expansion problem in layout design
Authors: R. R. Chen, Y. Kajitani
Venue: Proceedings of the 21st Design Automation Conference (1984)

In order to develop an efficient method of routing channels in the layout design process, an algorithm which solves the channel expansion problem is presented. This algorithm guarantees the minimum number of rerouted channels with respect to a single channel in a given placement. In addition, examples are given to illustrate various aspects of the algorithm.
Computer science as an interdisciplinary study
Authors: William W. Agresti
Venue: ACM SIGCSE Bulletin (1976)

The organization of computer science education as an interdisciplinary program is described. First, various possible relationships among disciplines are traced, and the features of interdisciplinarity are explained. Next, a specific interdisciplinary program in computer science is introduced, including experiences with the administration and operation of the program. An appraisal of the interdisciplinary approach to computer science education follows. The advantages are significant: a lower cost program, a more adaptive program, and one that is better able to treat the interfaces of computer science with other areas. Such a favorable report suggests that the interdisciplinary approach merits consideration, especially by colleges which want to offer a computer science degree but have limited funds.
A Synthetic English query language for a relational associative processor
Authors: L. Kerschberg, E. A. Ozkarahan, J. E.S. Pacheco
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Synthetic English is a very-high-level query language based on natural English. Query specification in Synthetic English parallels the user's natural thought processes, thereby allowing him to formulate complex queries without regard to implicit or explicit language control structures. Synthetic English is designed to be used in conjunction with the Functional Data Model, which is a conceptual graph model whose nodes and arcs represent sets and total functions, respectively. Further, the Functional Model admits a transformation to the Relational Model representation. Queries written in Synthetic English are easily parsed, using semantic predication analysis and the underlying graph, into primitive templates which are in one-to-one correspondence with the high-level machine language of the Relational Associative Processor called RAP. RAP is an associative and cellular back-end processor designed to support relational data bases. RAP's proven performance superiority over conventional architectures, its high-level machine language, and its query processing philosophy, make the interface to Synthetic English extremely efficient, avoiding intermediate-level code generation.
Generics and verification in Ada
Authors: William D. Young, Donald I. Good
Venue: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language (1980)

This paper explores the restrictions a mechanism in the style of the Ada generics facility would have to satisfy in order to be amenable to existing verification techniques. &ldquo;Generic verification&rdquo; is defined and defended as the appropriate goal for any such facility. Criteria are developed for generic verification to be possible and then Ada is evaluated with respect to these criteria. An example of the application of these techniques to an Ada unit is presented to show that generic verification is possible at least on a subclass of Ada generic units. Finally some potential applications of verified generic units are presented.
COMPUTER-TUTOR: From a student project to a self-paced CAI/CMI course
Authors: William H. Linder
Venue: ACM SIGCSE Bulletin (1976)

COMPUTER-TUTOR is a software package that presents interactively a self-paced, competency-based course in elementary FORTRAN programming. It developed from a project in a course where students design and implement a large-scale programming application. A COMPUTER-TUTOR course, presented on a PDP11/45, consists of nine modules-each module having a lesson, quiz, and programming assignment. A student must pass the quiz in a course-module before going on to the next module. The course grade depends on the number of modules completed. The student-commands LESSON, QUIZ, PROGRAM, OUTLINE, REVIEW, and INFORMATION bring the instructional material (CAI). The instructor uses eight support commands to monitor student progress and course material. COMPUTER-TUTOR will next be expanded to include courses in BASIC and COBOL.
Multiple computer networks and intercomputer communication
Authors: Lawrence G. Roberts
Venue: Proceedings of the first ACM symposium on Operating System Principles (1967)

There are many reasons for establishing a network which allows many computers to communicate with each other to interchange and execute programs or data. The definition of a network within this paper will always be that of a network between computers, not including the network of typewriter consoles surrounding each computer. Attempts at computer networks have been made in the past; however, the usual motivation has been either load sharing or interpersonal message handling. Three other more important reasons for computer networks exist, at least with respect to scientific computer applications. Definitions of these reasons for a computer network follow.
Measuring user satisfaction: The semantic differential technique
Authors: Michael L. Lyons
Venue: Proceedings of the seventeenth annual computer personnel research conference (1980)

No data processing system can be considered good in and of itself. The true test of the value of a system is whether or not its users are satisfied with it. It's quite possible to design and install a most comprehensive on-line data base system, and yet end up with a user who &ldquo;can't live&rdquo; with the terminal noise. Then, after costly replacement of the offending hardward, we may discover that the complaint about the noise made by the terminals was merely the easiest way to express a less clearly focused dissatisfaction with the system. Indeed, by the time the terminals are replaced, the user may have become accustomed to their comforting sound. It isn't easy for people who work with the &ldquo;hard&rdquo; facts of computer hardware and software to deal with such a subjective phenomenon as user satisfaction. Rather than confront the nebulous area of attitude and opinion, computer professionals may retreat to the consideration of more objective, technical matters-matters which, in and of themselves, fail to satisfy users. Some brave souls will occasionally ask their users &ldquo;Is everything O.K.?&rdquo;, but it is considered polite for the users to gloss over subjective problem areas. What both parties need is a reasonable means to quantify the measurement of user satisfaction. Fortunately, substantial work has been done to create measurement instrument that will allow us to evaluate how people really feel about a system, a design, or a report. It's up to the data processing professionals to get together with their users and draw upon this resource of prior work to create better systems of measurement of user satisfaction.
New real-time simulations of multihead tape units
Authors: Benton Leong, Joel Seiferas
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

Just as the Church-Turing thesis has simplified proofs of computability [8], efficient simulations of one computer model by another have simplified proofs of complexity upper bounds. A good example of this is Fischer, Meyer, and Rosenberg's real-time simulation of multihead Turing machines by multitape Turing machines [5]. Without this result, for example, even Slisenko [11] may have found it hopeless to show that a multitape Turing machine can recognize palindromes in real time. In this paper we give a comparatively simple proof of the Fischer-Meyer-Rosenberg result, dramatically reduce the number of single-head tapes required for the simulation, and generalize the result to multidimensional tapes. In the case of Slisenko's palindrome-recognizer, for example, our best simulation brings the number of tapes for a multitape Turing machine implementation down from 41 to 20.