ppxscal/embedding_network huggingface dataset:
Automatic generation of finite difference equations and fourier stability analyses
Authors: Michael C. Wirth
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

Recently several software tools based on the algebraic manipulation system MACSYMA have been implemented which facilitate the design, analysis and construction of finite difference programs for the numerical solution of systems of partial differential equations. Two of them are described here. The FDIFF package converts scalar, non-linear partial differential equations into linear, finite difference approximations. It includes tools for discretization of the domain of the PDE's dependent variables, linearization of non-linear terms and conversion of derivative terms into finite difference expressions. A notation and algebra for building arbitrary finite difference operators is provided. The FSTAB package automatically performs local Fourier stability analyses on sets of finite difference equations by deriving amplification matrices.
Some critical considerations on the ISO/OSI RM from a network implementation point of view
Authors: R. Popescu-Zeletin
Venue: ACM SIGCOMM Computer Communication Review (1984)

The paper outlines the conceptual and practical aspects encountered in the design and implementation of a heterogeneous computer network based on the standardization output. We discuss the feasability of the reference model and its related standards from a design, implementation and operational point of view focussing on the adopted solutions and their rationales.
Design issues for online documentation systems (abstract only)
Authors: Carolyn P. Steinhaus
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

The design of an effective interactive documentation system is introduced by tracing a hypothetical development effort aimed at shifting information contained in printed volumes of documentation to a form suitable for interactive access. Taking this approach presents a view of online documentation systems as the result of the process of adapting information conveyed in printed volumes to the constraint of interactive software considered as an information medium. The resulting discussion necessarily involves consideration of the demands which interactive software makes on both the organization of information about interactive programs and on the cognitive capacities of people using it.Existing documentation is typically intended to serve all of the informational needs of any person who uses an interactive software system. The requirements of software systems for structure and precision demand a more detailed understanding than currently exists of exactly how to provide information to people of varying levels of experience with a particular program or with computing in general. The interaction between the purposes of existing documentation and the requirements of an online system provide an interesting context for discussion of the major issues facing the designer of an interactive documentation system.
Performance of shared cache for parallel-pipelined computer systems
Authors: Phil C. C. Yeh, Janak H. Patel, Edward S. Davidson
Venue: ACM SIGARCH Computer Architecture News (1983)

Shared-cache memory organizations for parallel-pipelined multiple instruction stream processors avoid the cache coherence problem of private caches by sharing single copies of common blocks. A shared cache may have a higher hit ratio, but suffers performance degradation due to access conflicts. Effective shared cache organizations are proposed which retain the cache coherency advantage and which have very low access conflict even with very high request rates. Analytic expressions for performance based on a Markov model have been found for several important cases. Performance of shared cache organizations and design tradeoffs are discussed.
APL optimization: A unified approach
Authors: G. Battarel, D. Tusera Laboria
Venue: Proceedings of the sixth international conference on APL (1974)

Since 1969, attempts have been made to improve the interpretation process of APL. These studies have merely resulted in simulations which do not allow definitive conclusions on their practical impact. The authors make a survey of these works, and compare the approaches by the light of semantic attributes, a very useful tool for understanding and describing the semantic of a language, and the possibilities of optimization. They are implementing a modular interpreter in order to make comparative evaluations.
Implementation of a dynamic tree searching algorithm in a chess programme
Authors: Gerhard Wolf
Venue: Proceedings of the ACM annual conference (1973)

Algorithms searching game trees for games like chess, checkers etc. must have two features: They must find a good solution by inspecting all relevant parts of the tree and they must do it within acceptable time. According to that, most existing algorithms have two principal weaknesses: inconsistency and redundancy. By inconsistency I understand that not all relevant parts of the tree are considered or that parts are considered or pruned for incorrect reasons. Typical inconsistencies are fixed depth limitations, incorrect quiescence analysis and the ordinary methods of forward pruning. Consistency is a sufficient, but fortunately not always necessary condition for correct results.
An APL interpreter written in APL
Authors: Paul Penfield,  Jr.
Venue: Proceedings of seventh international conference on APL (1975)

An APL interpreter has been written in APL. It includes a set of interacting APL functions that accept quote-quad input and act on it in the same way as APL itself would. The interpreter will be used to test some proposed APL language extensions. Extensions already implemented on it include complex number arithmetic, and reduction and scan operators acting on defined as well as primitive scalar functions.
The storage, retrieval and display of integrated graphics and text (Panel)
Venue: ACM SIGGRAPH Computer Graphics (1984)

Methodologies, techniques and applications for the storage, retrieval and display of integrated graphics and text will be discussed. Current areas of interest include engineering drawings, CAD, publishing, graphics and databases, business graphics, office systems, cartography, typography and high quality text. This topic is at the leading edge of current developments and cost-effective applications will be examined. Dr. Rae Earnshaw, Chairman of the BCS Displays Group, will outline current needs and objectives for integrating graphics and text in the context of information processing and display, and indicate progress towards the long term goal of &ldquo;what you see is what you print&rdquo;.
The NETFORM concept: A more effective model form and solution procedure for large scale nonlinear problems
Authors: Fred Glover, Claude McMillan, Darwin Klingman
Venue: Proceedings of the 1977 annual conference (1977)

Recent years have seen many important advances in the solution of network problems. New solution algorithms and implementation techniques have dramatically reduced the cost of solving linear and convex network flow problems. For example, the cost of solving network problems with 2400 equations and 500,000 arcs on an IBM 360/65 has been reduced from &dollar;30,000 in 1968 to &dollar;300 in 1976 by these advances. In addition, these advances have stimulated the development of new nonlinear modeling techniques for handling a multitude of problems that arise in applications of scheduling, routing, resource allocation, production, inventory management, facilities location and other areas. This paper presents modeling techniques which are mathematically and symbolically linked to network and augmented network structures. These modeling techniques are called the NETFORM (network formulation) concept or approach. The pictorial aspect of this approach has proven to be extremely valuable in both communicating and refining nonlinear and combinatorial relationships. Additionally, the NETFORM concept often yields a formulation that enables the problem to be solved as a sequence of linear network problems with dramatic gains in efficiency over alternative approaches. The paper illustrates these attributes by providing a concrete example of a NETFORM model construction. Three real world applications are then described which have profited by the use of NETFORM techniques.
Workshop - industrial robotics
Authors: Hriday R. Prasad
Venue: Proceedings of the 19th Design Automation Conference (1982)

The robotics workshop consists of a tutorial and a discussion. The workshop objectives are to provide both the comprehensive fundamentals of robot technology and the WHAT, WHERE, WHEN, and HOW of its applications and limitations. Industrial robots are considered to be a principal tool to improve manufacturing productivity and product quality during the 80's and beyond. They are one of the key ingredients in revitalization of the manufacturing operations throughout the U.S. The fundamentals of the technology must be understood, the technical features evaluated and properly planned to achieve maximum productivity gains. The application of robots to new and more challenging tasks is increasing as robots are getting smarter with increased computer control and advances in the tactile and visual senses. During this decade the robot industry is projected to grow from a level of approximately $100 million to $2 billion. The robot technology is expected to impact all aspects of our business - management, engineering, manufacturing, finance, and educational needs.
Operators and systems programmers are people, too
Authors: Sandra J. Guinn
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

Obviously, the general function of most user service groups is to provide assistance for users. This assistance may take several forms: consulting and debugging; documentation of the system, its programs and usage; and educational classes in languages, utilities, and other aspects of computing system use. One of the ORNL site's best method of improving communications is the Computing Center's &ldquo;Operator Training Course&rdquo; which is administered collectivelyby the Systems Support Department and Operations. The course is notfor computer operators; it is for other people interested in computing center procedures, and it covers many aspects of computer use, including operations. The course is approximately 20 hours and is usually limited to two participants at a time. All new employees in the Systems Support Department take the course and any other user who shows sufficient interest may enroll. There are discussions of major system components and computing center services.
Fast parallel processing array algorithms for some graph problems(Preliminary Version)
Authors: S. Rao Kosaraju
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

The parallel processing array consists of an n&times;n array of processors to which a cn2 node directed graph can be input by placing c nodes at every point of the array. It is shown that every one of the following properties of the graph can be computed in order of n steps: (1) to test whether the graph is strongly connected, (2) to mark a node in every strongly connected component, (3) to mark a strong connected component that contains a given node, (4) to mark a simple directed path between a given pair of nodes, and (5) to compute the interconnectivity of the c nodes within every point. As a consequence, several open problems can be solved. For example, any language recognized by a 2-dimensional finite state automaton with 1 pebble can be recognized in order of n steps by a parallel processing array. (It was not even known whether the languages recognized by 2-dimensional finite state automata without pebbles can be recognized in order of n steps by a parallel processing array). Note that a 1 pebble automaton can run for order of n4 steps before accepting an input.
The ACM and standardization
Authors: T. B. Steel,  Jr.
Venue: Proceedings of the 1964 19th ACM national conference (1964)

The complexities of standardization procedures and the interlocking multiplicity of Sectional Committees, Subcommittees, and Working Groups comprising the formal standardization organizations are undoubtedly bewildering to the uninitiated. The author can assert from experience that it requires about a year of heavy involvement in the process before one begins to have a clear understanding of how it all works. Upon observing this, one is tempted to view the whole complex as a classical example of Parkinsonism; concurrently one develops the wish to cut the structure apart and proceed toward attaining standardization goals in a simple and direct manner. Let me assure you that the obvious, straightforward approach will not work. There are too many interrelated questions to answer and too many conflicts of interest to resolve. It is not clear that the standardization structure which has evolved is the optimum one but, just as in the case of the Congress - which may not be the optimum legislative configuration - it is the best one we know. Further, it seems to work. American Standards in information processing are beginning to appear and, once published, they have not caused any violent or widespread dismay. Despite all this, the computing man in the street generally feels that his opinions are not considered and his technical problems given little, if any, weight. There i s substantial justification for this view. To take one example, the preliminary work in the preparation of proposed American Standards in the area of common programming languages, such as ALGOL, COBOL and FORTRAN, i s being done almost entirely by people whose principal occupation is compiler writing. The Subcommittee whose function it is to determine when the work is ready to enter the real standardization mill is largely constituted of peeple who have not written computer programs on a day-te-day basis for some time. Finally, the Board that ultimately decides whether the community Interest is being served through the promulgation of an American Standard has few members who have ever written a program for a stored program computer. One cannot help but notice the absence of those really affected-and-mdash;the users of common programming languages.
Office automation and the changing definition of the workplace
Authors: Margrethe H. Olson
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

The introduction of telecommunications and computer technology into the workplace has profound implications for the nature of work itself. In particular, the implementation of &ldquo;office automation&rdquo; permits significant changes in the organization and execution of office work. It is possible that the term &ldquo;office&rdquo; may take on new meanings. Office automation provides the potential to alter the locational and temporal definitions of large numbers of office jobs. This discussion focuses on the phenomenon of &ldquo;remote office work&rdquo;, which is facilitated by developments in telecommunications and computer technology. The general position is that technology can support either positive or negative implementations of remote office work; social and economic forces, as well as policy, provide the impetus for change in one direction or the other. This discussion emphasizes one particular form of remote work, that is, work at home. The reason for this emphasis is that work at home serves as an excellent example of the wide range of potential implications of remote work.
Automatic deduction and equality
Authors: Vincent J. Digricoli
Venue: Proceedings of the 1979 annual conference (1979)

This paper defines rules of inference which incorporate the axioms of equality into a new definition of binary resolution which is based on equality as well as unification. These inference rules are complete to prove E-unsatisfiability and lead to much shorter proofs than those using the equality axioms.
Implementation of a PDP11/ICL1900 cross assembler in Algol 68R
Authors: M. W. Bennett
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

The implementation in Algol 68R of a cross assembler for the PDP11 minicomputer to run on the ICL1900 is described. The assembler duplicates the features of the PAL11 assembler. RRE's Syntax Improving Device was used for a two pass assembly system. The cross assembler uses a tree structured symbol table, a lexical analyser to read in basic assembler items and code generation routines that use Algol 68 modes and operators to map the 8 bit bytes and 16 bit words of the mini onto the ICL1900 words. The cross assembler reproduces the error diagnostics of PAL11 with more detailed diagnostics available if required by the user. The assembler outputs binary program on paper tape for loading directly onto the mini.
Transportation models
Authors: David W. Graff, W. Wayne Siesennop, Fritz Callies, Neil S. Campbell, John C. Rea, David C. Nowadling, Philip W. Buckholts, Frank P. Testa, Mark Handelman
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The four papers in this session cover a wide range of transportation uses and problem areas. Thus, they are representative of simulation activity in the field of transportation, the potential of simulation in both large scale and small scale problems, and the application of different simulation languages.
A multiple media delay simulator for MOS LSI circuits
Authors: Kaoru Okazaki, Tomoko Moriya, Toshihiko Yahara
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper concerns an accurate delay modeling of MOS gates at the logic level. The model takes account of the effects of not only the loading capacitance but also the slope of the input waveform. A logic simulator which uses multiple rise/fall delays based on the model is described. Some experimental results are also presented.
The German EDS network
Authors: Hermann G. Gabler
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

This paper introduces the plans made by the German Telecommunication Administration for the setting up of a special data network within the near future. Starting from the present situation existing in the Federal Republic of Germany in the field of data transmission a description is given of the data network concept. The essential technical characteristics and design considerations as well as the salient facilities are dealt with in a brief survey.
Debunking the &ldquo;expensive procedure call&rdquo; myth or, procedure call implementations considered harmful or, LAMBDA: The Ultimate GOTO
Authors: Guy Lewis Steele,  Jr.
Venue: Proceedings of the 1977 annual conference (1977)

Folklore states that GOTO statements are &ldquo;cheap&rdquo;, while procedure calls are &ldquo;expensive&rdquo;. This myth is largely a result of poorly designed language implementations. The historical growth of this myth is considered. Both theoretical ideas and an existing implementation are discussed which debunk this myth. It is shown that the unrestricted use of procedure calls permits great stylistic freedom. In particular, any flowchart can be written as a &ldquo;structured&rdquo; program without introducing extra variables. The difficulty with the GOTO statement and the procedure call is characterized as a conflict between abstract programming concepts and concrete language constructs.
The modular complexity of a tree structured higher radix multiplier
Authors: James R. Armstrong
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

The modular complexity of a tree structured higher radix multiplier is analyzed. The number of required modules is shown to be closely approximated by [equation] where R is the radix n is the number of positions in the numbers to be multiplied.
Aw expanded logic equation list for checkout
Authors: J. A. Rader, D. A. Isaak
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

In the computer-aided design of digital equipment, by the time a wire unit is in the check-out lab, a large amount of information concerning this unit exists in the form of tape files. Since our D.A. System is entered via logic equations, we have a file containing this information, plus files indicating the partitioning of the equations, the placement of smaller building blocks within larger building blocks, and the assignment of signals to pins for routing or wiring. Also, there will be a wire list file (or a router output file) plus a punch card deck when a wiring machine is to be used. In addition a large pile of computer output reports will exist communicating this information to the literate world. About two years ago we learned that in some of the checkout labs engineers were devoting large amounts of time pouring through the reports we generate in order to correlate signals appearing in logic equations with connector pins. In order to remove this burden from these engineers, a program known as the Equation Connector Program (EQNCON) was written. This program exhibits the correlation of logic signals and connector pins in a printed report which is then heavily used during checkout.
An analysis of line numbering strategies in text editors
Authors: M. L. Schneider, S. Nudelman, K. Hirsh-Pasek
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Many techniques are employed in numbering lines for text editing. The simplest approach uses a single integer that changes each time a line is added or deleted (1). BASIC, in addition to other systems, uses fixed multi-digit numbers bound to each line. This approach has problems: only a fixed number of lines can be inserted between two consecutive lines of text, otherwise the original text must be renumbered. This negates one advantage of line numbers: the ability to compare different versions of the same document. In order to overcome these disadvantages, two basic schemes have been proposed and implemented. The following grammar defines the two schemes: fractional line numbering (FLN) and hierarchical line numbering (HLN).
Commodity market dynamics a system analysis of fundamental relationships
Authors: Robert D. Landel
Venue: Proceedings of the 5th conference on Winter simulation (1971)

The agricultural environment encompasses an important segment of production and distribution operations in the American economy. Many agriculturally related enterprises experience large fluctuations in their inventories, production activities, sales, capacity, and earnings. Cyclic, seasonal, and irregular patterns of behavior in such large-scale agricultural systems have persisted over the years.
Handwritten Numeral String Recognition with Stroke Grouping
Authors: Chan E. Cheong, Ho-Yon Kim, Jang-Won Suh, H. Kim
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In this paper, a framework for off-line handwritten numeral string recognition based on stroke grouping is proposed. In our approach, strokes are aligned into a sequence of strokes and then segmentation process is performed to partition strokes in the sequence into possible-digits, that is, groups of strokes which may be possibly a digit. As the result of stroke grouping, grouping-hypotheses, which imply possible segmentation, are generated. An input numeral string is recognized by dynamic programming scheme, in which the best grouping-hypothesis with maximum matching score is chosen. The framework also provides systematic way of reducing computational complexity by embedding external knowledge into the framework. The experimental results to evaluate the proposed framework are shown.