ppxscal/embedding_network huggingface dataset:
A language for computational algebra
Authors: Richard D. Jenks, Barry M. Trager
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

This paper reports ongoing research at the IBM Research Center on the development of a language with extensible parameterized types and generic operators for computational algebra. The language provides an abstract data type mechanism for defining algorithms which work in as general a setting as possible. The language is based on the notions of domains and categories. Domains represent algebraic structures. Categories designate collections of domains having common operations with stated mathematical properties. Domains and categories are computed objects which may be dynamically assigned to variables, passed as arguments, and returned by functions. Although the language has been carefully tailored for the application of algebraic computation, it actually provides a very general abstract data type mechanism. Our notion of a category to group domains with common properties appears novel among programming languages (cf. image functor of RUSSELL) and leads to a very powerful notion of abstract algorithms missing from other work on data types known to the authors.
Issues of the design of a low level microprogramming language for global microcode compaction
Authors: Michael D. Poe, Ross Goodell, Simon Steely,  Jr.
Venue: Proceedings of the 14th annual workshop on Microprogramming (1981)

Microcode compaction, or packing, is the process of assigning microoperations to microwords so that the minimum number of microwords and execution time is used by the microprogram. The techniques for global microcode compaction have been described elsewhere (see below). This paper describes a proposal for an intermediate level language approach to compilation which allows machine independent global compaction. We will call the program which does this compaction the packer. This work comes from the development of the V-Compiler, a retargetable microprogram generation system1. The goal is to be able to produce very high quality microcode, while allowing code manipulations to be described and performed in an orderly manner.
Frontiers in computer science research
Authors: William F. Miller
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Old frontiers in Computer Science continue to expand. New frontiers emerge as better theoretical understanding, dramatically improved hardware characteristics, and improved techniques for software open new vistas. Much of the excitment and drive towards new frontiers still stems from new hardware characteristics which make it possible to attack a host of new problems. Conversely, the drive to improve hardware characteristics and to utilize computer systems more effectively has presented many challenging problems for computer science and engineering. An additional force that is creating a demand pull for advanced research in computer science is the drive in all industrial and government sectors toward greater efficiency and productivity in order to make our economy and industries more competitive internationally. Without doubt, the international challenge to our computer industry has stimulated both the private sector and the public sector toward new areas of computer science research.
Automating the systems development process
Authors: Ken Orr
Venue: Proceedings of the ACM '82 conference (1982)

A number of ways have been proposed to improve productivity in systems building: better management, better training, better tools. But each of these approaches by itself tends to fall short. Increasingly, it is becoming clear that those involved in developing computerized systems must do what they have been preaching to their clients. They must computerize! Over the next few years, a new phrase - Computer Aided Design/Computer Aided Programming (CAD/CAP)&mdash;will describe the technology for automating the systems development process. Already three decades old, research into computer aided design and development of systems is beginning to bear fruit. And this technology coupled with the availability of low-cost mini/microcomputers are exciting prospects.
Using procedures in list processing
Authors: V. J. Rayward-Smith
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

In many situations the atoms in a list can require a considerable amount of storage space or can be difficult to evaluate. When handling algorithms which only refer to a few atoms of a list much time and space can be wasted if the whole list is stored. In this paper an attempt is made to store lists as procedures which are only evaluated if absolutely necessary. The difficulties which arise when programming such a list processor in Algol 68 are caused by inherent scoping problems. A solution is presented for linear lists together with an example based on the processing of an infinite list.
Design principles for software manufacturing tools
Authors: Paul Bassett
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

A good solution to the reusable code problem turns out to provide a solid technical basis from which to understand and deal with the production, quality, and maintenance issues currently besieging the software industry. To this end, a software manufacturing methodology has been developed called Computer Aided Programming tm. CAP is based on a functional programming concept called a frame, motivated in turn by the reusable code problem. The introduction explains the necessary background ideas about frames. Section two analyzes the subtle but important distinction between problem solving and programming. CAP design principles are then developed which show how to build software tools that support problem solving through open&mdash;ended, structured, program manufacturing techniques. The principles are organized around the flow of program specifications from 'under' to 'optimally', to 'over' specified, machine executable instructions. The components of an existing CAP system are described in section three, and section four discusses the usage of CAP as a manufacturing technique. Statistics from a case study are presented which indicate that: (a) production quality commercial software can be manufactured at rates exceeding 2000 lines of debugged COBOL per man-day (including systems design time), and (b) less than 10% of this code needs to be hand written /-maintained.
Estimation of manpower forecast variation by GPSS simulation
Authors: Philip Hicks
Venue: Proceedings of the second conference on Applications of simulations (1968)

Traditionally, manpower estimation has been done on an expected value basis. Such estimates, although providing an estimate of the mean of manpower requirements, provide no indication of the probable spread about the mean. Manpower solution plans, however, often implicitly assume an estimate spread based upon experience gained from previous projects. This paper is concerned with estimation of manpower forecast variations, both in the aggregate and by skill level.
Finished musical scores from the keyboard: An expansion of the composer's creativity
Authors: Alan D. Talbot
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Music copying (the writing of musical scores) does not lend itself easily to automation. Like language, music notation has evolved over a long period of time, resulting in notational conventions which are complicated and often illogical. Many of the symbols required are quite elaborate, and some can vary in size and proportion. For a musician to be able to read the music quickly and correctly in a performance situation, the notation must follow a very precise set of aesthetic rules. For these reasons music is almost always hand copied, even today. Composers typically draw up their own scores and then send them to a copyist to have the parts extracted. The parts usually contain mistakes, and the scores are often not as legible as they should be. Furthermore, musicians often compose under extreme pressure, allowing little time for proofreading and revision. The following is a description of a computer system which offers an alternative to this expensive and time consuming process by automatically transcribing keyboard performances into legible musical scores. In designing an automated music printing system, a number of complex problems arise. The user should not be expected to be a computer expert. Input to such a system should be simple and natural and not require unusual skills. The system should be able to produce valid music with minimal user interaction, and therefore must handle unassisted many complex aspects of written music. For the system to do everything completely automatically would require artificial intelligence capabilities which could not be implemented in a small system affordable to the musician. Instead, comprehensive, flexible editing must be provided to allow the user to step in where the machine fails to copy correctly. Finally the system must provide quick, clean output on durable paper so that the music can be reproduced easily and will withstand the demands of stage performance.
Wireless Java: Developing with J2ME, 2 edition
Authors: Jonathan Knudsen
Venue:  (2003)

:Although Java is incredibly popular, the standard edition of Java is way too big and way too bulky to build applications for wireless devices such as the PDAs and phones. Thus Sun has released "Java 2 Platform, Micro Edition" (J2ME). J2ME has the potential to be as revolutionary in the wireless space as Java has been in the server space. Wireless Java: Developing with J2ME, Second Edition will be updated to include coverage of the next version of programs for mobile Java devices. The second edition will cover MIDP 2.0 and CLDC 1.1, and the new information will be distinguishable so readers can still reference the book for MIDP 1.0/CLDC 1.0. About the AuthorJonathan Knudsen is a Java developer and noted author of several books, including Wireless Java: Developing with Java 2, Micro Edition(Apress), Mobile Java, The Unofficial Guide to LEGO MINDSTORMS Robots, Learning Java, and Java 2D Graphics. Jonathan began his object-oriented programming career in Objective-C on the NeXT OS, soon thereafter suffering through a couple of purgatorial years in Microsoft's Visual C++ before graduating to Java in 1996. He has written extensively about Java and Lego robots, including five books, a monthly online column called "Bite-Size Java", and articles for JavaWorld, EXE, NZZ Folio, and the O'Reilly Network. Jonathan holds a degree in mechanical engineering from Princeton University.
Efficient scheduling of consumer goods manufacturing processes in the continuous time domain
Authors: Nikolaos F. Giannelos, Michael C. Georgiadis
Venue: Computers and Operations Research (2003)

A new model for scheduling fast consumer goods manufacturing processes is developed using mixed-integer linear programming (MILP) techniques combined with a continuous representation of time. Key features of the model include sequence-dependent changeovers and flexible intermediate storage requirements typically arising in industrial manufacturing problems. Due to the utilization of a continuous time representation, the formulation is shown to result in reduced model sizes in terms of both variables and constraints. Near-optimal solutions are reported for the case study under investigation.
Nyström-Clenshaw-Curtis quadrature for integral equations with discontinuous kernels
Authors: Sheon-Young Kang, Israel Koltracht, George Rawitscher
Venue: Mathematics of Computation (2003)

A new highly accurate numerical approximation scheme based on a Gauss type Clenshaw-Curtis quadrature for Fredholm integral equations of the second kind x(t) + ∫ab k(t, s)x(s)ds = y(t), whose kernel k(t,s) is either discontinuous or not smooth along the main diagonal, is presented. This scheme is of spectral accuracy when k(t,s) is infinitely differentiable away from the diagonal t = s. Relation to the singular value decomposition is indicated. Application to integro-differential Schrödinger equations with nonlocal potentials is given.
Specifying Workflow Process Requirements for an Emergency Medical Service
Authors: M. Poulymenopoulou, F. Malamateniou, G. Vassilacopoulos
Venue: Journal of Medical Systems (2003)

Recent trends in healthcare delivery have led to a gradual shift in the conceptualisation of healthcare information systems towards supporting healthcare processes in a more direct way. The move towards integrated and managed care, which requires designing healthcare processes around patient needs and incorporating efficiency considerations, has led to an increased interest in process-oriented healthcare information systems based on workflow technology. This means to actively deliver the tasks to be performed to the right persons at the right time with the necessary information and the application functions needed. Moreover, workflow technology promotes a component-oriented development whereby the process logic is separated from application logic. This paper presents an approach to capturing process logic requirements for healthcare workflow systems with a view to design a system that is easily adjustable to process changes and to evolving organizational structures at a reasonable cost.
Why is the snowflake schema a good data warehouse design?
Authors: Mark Levene, George Loizou
Venue: Information Systems (2003)

Database design for data warehouses is based on the notion of the snowflake schema and its important special case, the star schema. The snowflake schema represents a dimensional model which is composed of a central fact table and a set of constituent dimension tables which can be further broken up into subdimension tables. We formalise the concept of a snowflake schema in terms of an acyclic database schema whose join tree satisfies certain structural properties. We then define a normal form for snowflake schemas which captures its intuitive meaning with respect to a set of functional and inclusion dependencies. We show that snowflake schemas in this normal form are independent as well as separable when the relation schemas are pairwise incomparable. This implies that relations in the data warehouse can be updated independently of each other as long as referential integrity is maintained. In addition, we show that a data warehouse in snowflake normal form can be queried by joining the relation over the fact table with the relations over its dimension and subdimension tables. We also examine an information-theoretic interpretation of the snowflake schema and show that the redundancy of the primary key of the fact table is zero.
Understanding Interorganizational Cooperation: Public-Private Collaboration in Regulating Financial Market Innovation
Authors: Sue R. Faerman, David P. McCaffrey, David M. Van Slyke
Venue: Organization Science (2001)

This paper examines how a collaborative effort between the private and public sectors, called the Derivatives Policy Group (DPG), helped shape current regulation of financial innovation. In 1994 and 1995, this group of six large financial firms developed procedures for risk management, internal controls, and reporting for largely unregulated areas of finance, in cooperation with the United States Securities and Exchange Commission and Commodity Futures Trading Commission. The process succeeded despite strong competition among the firms themselves and incentives for both the public and private sectors to resort to adversarial lobbying and legal challenges. The Derivatives Policy Group was a path-setting event in the development of flexible regulation of financial innovation that is now the norm for related policy making.The case is important in and of itself--the financial markets are a major concern of national and international economic policy--but here we treat it as an instance of a larger class of problems. Organizational science constantly encounters settings that involve numerous participants who compete or have histories of conflicts; who are interdependent, and collectively would gain (and even individually gain long term) by cooperating rather than competing on an issue; who fall under different governance systems; and who try as a group to design rules and principles governing their behavior. Four factors appear repeatedly in the research on the success or failure of such arrangements. These are (1) the initial dispositions toward cooperation, (2) the extant issues and incentives, (3) leadership, and (4) the number and variety of organizations involved. This paper focuses on how these factors shaped the development and consequences of the Derivatives Policy Group, and the general implications of this process for interorganizational cooperation.
Faceted classification as a basis for knowledge organization in a digital environment: the bliss bibliographic classification as a model for vocabulary management and the creation of multidimensional knowledge structures
Authors: Vanda Broughton
Venue: The New Review of Hypermedia and Multimedia (2002)

The library classification scheme was the first means of subject access to information, but is largely disregarded as a tool for the management of electronic resources; modern classifications built on facet analytical principles are more appropriate to this purpose than is generally realised. Faceted classifications as exemplified by the Bliss Bibliographic Classification (BC2) are powerful tools for the management of vocabulary, characterised by a rigorous analytical approach to terms, and the clear identification of semantic and syntactic relationships and structures. The philosophy and function of BC2 are described, as is the process of building a knowledge structure on facet analytical principles. The range of related functions of such structures when employed as knowledge management tools (as classification, thesaurus, subject heading list, browsable index) is considered, as is the potential of facet analytical knowledge structures for the management of digital materials. Facet analysis is regarded as a powerful methodology for the creation of structures appropriate to specific retrieval requirements in a range of contexts, with emphasis on the problems of complex subject description and retrieval and multidimensionality.
Reverse-Logistics Strategy for Product Take-Back
Authors: Markus Klausner, Chris T. Hendrickson
Venue: Interfaces (2000)

Product take-back of consumer products is generally expensive, especially reverse logistics. In the take-back program for power tools in Germany, costs exceed revenues for recycling power tools. Systematic analysis of take-back alternatives can make take-back policies more attractive. For example, an alternative take-back system for power tools would combine profitable remanufacturing and unprofitable materials recycling. The profit from remanufacturing could cover the loss from recycling as well as the costs of reverse logistics, allowing the manufacturer a profit. Remanufacturing requires a continuous flow of returned postconsumer products. By buying back end-of-life products, firms could control the flow of returned products. We developed a model that allows us to determine the optimal amount to spend on buy-back and the optimal unit cost of reverse logistics. We can use the latter to select a suitable reverse-logistics system for end-of-life products. We apply our model to the remanufacturing take-back concept for power tools, using empirical data on the current take-back program.
A new 2-D systolic digital filter architecture without global broadcast
Authors: Lan-Da Van
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2002)

In this paper, we propose two-dimensional (2-D) systolic-array infinite-impulse response (IIR) and finite-impulse response (FIR) digital filter architectures without global broadcast, by the hybrid of a modified reordering scheme and a new systolic transformation. This architecture has local broadcast, lower-quantization error, and zero latency without sacrificing the number of multipliers, as well as delay elements under the satisfactory critical period. Furthermore, we extend this new architecture to a useful 2-D systolic cascade-form architecture and provide the comprehensive error analysis for the proposed architectures.
Computing in Papua New Guinea: lessons learned about computer science service learning projects
Authors: James Skon
Venue: Journal of Computing Sciences in Colleges (2001)

This paper chronicles a recent departmental project involving the design, development, procurement, transport and deployment of a computer network system. The system manages patient information system for a 100-bed mission hospital in the Western Highland Province of Papua New Guinea. Additionally, this paper summarizes the aspects of the project that contributed to its relative success, drawing upon experiences from a series of previous service projects.
Handling Sensor Data in Rapidly Changing Environments to Support Soft Real-Time Requirements
Authors: Anindya Datta, Igor R. Viguier
Venue: INFORMS Journal on Computing (2000)

Databases have been mandated as the chosen platform to develop automated control systems for environments where the state of the system changes rapidly and actions need to be taken with timing constraints, for example, stock trading, air traffic control, network management, and process control to name a few. Input data in such systems come from sensors distributed throughout the physical environment being monitored. As the system state changes rapidly, the sensors report information fast and with high volumes. Control decisions in such systems are highly dependent on the accuracy and timeliness of such recorded sensor-reported data. In this paper we suggest ways to algorithmically maintain the accuracy and timeliness of sensor data by enforcing two properties termedrecency andtemporal consistency. Simultaneously, our algorithms also attempt to satisfyquality of service requirements on response times of queries submitted in such systems. The performance of these algorithms is validated through an extensive simulation.
On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming
Authors: Erling D. Andersen
Venue: INFORMS Journal on Computing (1999)

During the last decade, interior-point methods have become an efficient alternative to the simplex algorithm for solution of large-scale linear programming (LP) problems. However, in many practical applications of LP, interior-point methods have the drawback that they do not generate an optimal basic and nonbasic partition of the variables. This partition is required in the traditional sensitivity analysis and is highly useful when a sequence of related LP problems are solved. Therefore, in this article we discuss how an optimal basic solution can be generated from the interior-point solution. The emphasis of the article is on how problem structure can be exploited to reduce the computational cost associated with the basis identification. Computational results are presented that indicate that it is highly advantageous to exploit problem structure.