ppxscal/embedding_network huggingface dataset:
Finding Optimal Material Release Times Using Simulation-Based Optimization
Authors: Tito Homem-De-Mello, Alexander Shapiro, Mark L. Spearman
Venue: Management Science (1999)

We present a method for setting release times for jobs with due dates in a stochastic production flow line for which the sequence of jobs has been determined. Unlike other approaches to this problem, ours considers a transient situation. Thus, the flow line will typically contain work in process (WIP), that is, jobs that have been previously released to the system. Our goal is to develop a job release schedule that not only minimizes tardiness but also maximizes flexibility. The philosophy can be characterized as one that seeks to "release as late as possible, but no later!" Our methodology is based on Monte Carlo simulation and consequent optimization by a method that became known as "stochastic counterpart" or "sample path" simulation-based optimization techniques. We use this method to minimize an expected value objective function that contains terms for tardiness and flow time "costs." We include a discussion of how the cost parameters of this objective function can be obtained by considering a "characteristic curve" for the system. We also discuss means for obtaining sensitivity analysis with respect to due dates and service times distributions parameters. We conclude with a numerical example.
Equal Area World Maps: A Case Study
Authors: Timothy G. Feeman
Venue: SIAM Review (2000)

Maps that show the area of all regions of the earth's surface in their correct proportions, appropriately called equal area maps, are often used by cartographers to display area-based data, such as the extent of rain forests, the range of butterfly migrations, or the access of people in various regions to medical facilities. In this article, we will examine the step-by-step construction of an equal area map first announced by Karl Brandan Mollweide (1774-1825) and commonly used in atlases today. Aesthetically, Mollweide's map, which represents the whole world in an ellipse whose axes are in a 2:1 ratio, reflects the essentially round character of the earth better than rectangular maps. The mathematics involved in the construction requires mainly high school algebra and trigonometry with only a bit of calculus (which can plausibly be avoided if one so desires). All of this material, except for the calculus, was included in a first-year liberal arts math/geography course taught at Villanova University.
On effective multi-dimensional indexing for strings
Authors: H. V. Jagadish, Nick Koudas, Divesh Srivastava
Venue: ACM SIGMOD Record (2000)

As databases have expanded in scope from storing purely business data to include XML documents, product catalogs, e-mail messages, and directory data, it has become increasingly important to search databases based on wild-card string matching: prefix matching, for example, is more common (and useful) than exact matching, for such data. In many cases, matches need to be on multiple attributes/dimensions, with correlations between the dimensions. Traditional multi-dimensional index structures, designed with (fixed length) numeric data in mind, are not suitable for matching unbounded length string data. In this paper, we describe a general technique for adapting a multi-dimensional index structure for wild-card indexing of unbounded length string data. The key ideas are (a) a carefully developed mapping function from strings to rational numbers, (b) representing an unbounded length string in an index leaf page by a fixed length offset to an external key, and (c) storing multiple elided tries, one per dimension, in an index page to prune search during traversal of index pages. These basic ideas affect all index algorithms. In this paper, we present efficient algorithms for different types of string matching. While our technique is applicable to a wide range of multi-dimensional index structures, we instantiate our generic techniques by adapting the 2-dimensional R-tree to string data. We demonstrate the space effectiveness and time benefits of using the string R-tree both analytically and experimentally.
Multigrid Method for Maxwell's Equations
Authors: R. Hiptmair
Venue: SIAM Journal on Numerical Analysis (1998)

In this paper we are concerned with the efficient solution of discrete variational problems related to the bilinear form ({\bf curl}\! $\cdot$, {\bf curl}\! $\cdot)_{{\fontsize{6}{0pt}\selectfont\textbf{\textit{L}}}^2(\Omega)}$ + ($\cdot,\cdot)_{{\fontsize{6}{0pt}\selectfont\textbf{\textit{L}}}^2(\Omega)}$ defined on \textbf{\textit{H}}$_0$({\bf curl}; $\Omega$). This is a core task in the time-domain simulation of electromagnetic fields, if implicit timestepping is employed. We rely on N&eacute;d&eacute;lec's \textbf{\textit{H}}({\bf curl}; $\Omega$)-conforming finite elements (edge elements) to discretize the problem. We construct a multigrid method for the fast iterative solution of the resulting linear system of equations. Since proper ellipticity of the bilinear form is confined to the complement of the kernel of the {\bf curl} operator, Helmholtz decompositions are the key to the design of the algorithm: ${\cal N}$({\bf curl}) and its complement ${\cal N}$({\bf curl})$^{\bot}$ require separate treatment. Both can be tackled by nodal multilevel decompositions, where for the former the splitting is set in the space of discrete scalar potentials.Under certain assumptions on the computational domain and the material functions, a rigorous proof of the asymptotic optimality of the multigrid method can be given, which shows that convergence does not deteriorate on very fine grids. The results of numerical experiments confirm the practical efficiency of the method.
Developing a digital library of computer science teaching resources
Authors: Elana Copperman, Wanda Dann, Michael Goldweber, Janet Hartman, Marja Kuittinen, David Mutchler, Nick Parlante
Venue: ACM SIGCSE Bulletin (1998)

We describe recommendations for how to plan and develop a web-based digital library to support computer science education, i.e., the online Computer Science Teaching Center (CSTC) . This report details three facets: the identification of appropriate resources for inclusion in the CSTC, the review process for submissions, and the development and promotion of CSTC. A taxonomy of teaching resources is provided, and includes informal feedback from ITiCSE '98 conference participants enumerating desirable materials. Categories recommended for inclusion are: Labware / Courseware, Presentation / Exposition, On-line Course, Small Assignment, and Large Assignment. A formal review process is defined and detailed in order to insure that high quality materials are contained in the CSTC. A core set of reviewer guidelines is presented, suitable for the resources identified. Finally, recommendations for the marketing and the mechanics of the site are presented. The CSTC initially will support materials of visualizations, laboratory projects, and NSF CISE Education Innovation projects. Strong association with professional organizations, such as ACM and IEEE, is recommended. The working group unanimously recommends that access to CSTC resources should remain free of charge, to serve the widest possible audience.
Designing storytelling technologies to encouraging collaboration between young children
Authors: Steve Benford, Benjamin B. Bederson, Karl-Petter Åkesson, Victor Bayon, Allison Druin, Pär Hansson, Juan Pablo Hourcade, Rob Ingram, Helen Neale, Claire O'Malley, Kristian T. Simsarian, Danaë Stanton, Yngve Sundblad, Gustav Taxén
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

We describe the iterative design of two collaborative storytelling technologies for young children, KidPad and the Klump. We focus on the idea of designing interfaces to subtly encourage collaboration so that children are invited to discover the added benefits of working together. This idea has been motivated by our experiences of using early versions of our technologies in schools in Sweden and the UK. We compare the approach of encouraging collaboration with other approaches to synchronizing shared interfaces. We describe how we have revised the technologies to encourage collaboration and to reflect design suggestions made by the children themselves.
Daytona and the fourth-generation language Cymbal
Authors: Rick Greer
Venue: ACM SIGMOD Record (1999)

The Daytona&trade; data management system is used by AT T to solve a wide spectrum of data management problems. For example, Daytona is managing a 4 terabyte data warehouse whose largest table contains over 10 billion rows. Daytona's architecture is based on translating its high-level query language Cymbal (which includes SQL as a subset) completely into C and then compiling that C into object code. The system resulting from this architecture is fast, powerful, easy to use and administer, reliable and open to UNIX&trade; tools. In particular, two forms of data compression plus robust horizontal partitioning enable Daytona to handle terabytes with ease.
An Automatic Class Generation Mechanism by Using Method Integration
Authors: Katsuhisa Maruyama, Ken-Ichi Shima
Venue: IEEE Transactions on Software Engineering (2000)

This paper presents a mechanism for automatically generating new classes from classes existing in a library by using their modification histories. To generate classes that are likely to meet programmer's requirements and that are consistent with the existing classes, we propose three actors, a Specifier, a Finder, and an Integrator. The Specifier records the history of modifications between methods with the same interface of a parent class and its heir. If the required method is not defined in the existing class which a programmer is referring to, the Finder retrieves classes similar to the referenced class and the Integrator applies the past modifications of similar classes to the referenced class. Classes are determined to be similar based on their positions in a class hierarchy tree. Both the Specifier and Integrator are achieved by using a method integration algorithm based on object-oriented bounded program slicing and class dependence graph matching. This mechanism enables programmers to reuse classes with little or no modification and, thus, easily create object-oriented programs.
Be careful...
Authors: Terris Wolff
Venue: ACM SIGUCCS Newsletter (1998)

I am sure that at one time or another you have heard some version of this statement: "Be careful what you ask for, you just might get it!" It's a warning not to be ignored. While asking for something, we tend to be aware of only the positive aspects of that item, only the potential immediate gratification. But what of the down side of attaining this sometimes long sought after goal?
Remark on Algorithm 752
Authors: Robert J. Renka
Venue: ACM Transactions on Mathematical Software (TOMS) (1999)

The triangulation-based scatterd-data fitting package SRFPACK was updated for (a) compatibility with a revised interface to the triangulation package TRIPACK, (b) the elimination of potential errors in the treatment of tension factors and in the extrapoltion procedure, and (c) the addition of a more accurate local gradient-estimation procedure and a simple but portable contour-plotting capability.
A diary study of information capture in working life
Authors: Barry A. T. Brown, Abigail J. Sellen, Kenton P. O'Hara
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

Despite the increasing number of new devices entering the market allowing the capture or recording of information (whether it be marks on paper, scene, sound or moving images), there has been little study of when and why people want to do these kinds of activities. In an effort to systematically explore design requirements for new kinds of information capture devices, we devised a diary study of 22 individuals in a range of different jobs. The data were used to construct a taxonomy as a framework for design and analysis. Design implications are drawn from the framework and applied to the design of digital cameras and hand held scanners.
The program decision logic approach to predicated execution
Authors: David I. August, John W. Sias, Jean-Michel Puiatti, Scott A. Mahlke, Daniel A. Connors, Kevin M. Crozier, Wen-mei W. Hwu
Venue: ACM SIGARCH Computer Architecture News (1999)

Modern compilers must expose sufficient amounts of Instruction-Level Parallelism (ILP) to achieve the promised performance increases of superscalar and VLIW processors. One of the major impediments to achieving this goal has been inefficient programmatic control flow. Historically, the compiler has translated the programmer's original control structure directly into assembly code with conditional branch instructions. Eliminating inefficiencies in handling branch instructions and exploiting ILP has been the subject of much research. However, traditional branch handling techniques cannot significantly alter the program's inherent control structure. The advent of predication as a program control representation has enabled compilers to manipulate control in a form more closely related to the underlying program logic. This work takes full advantage of the predication paradigm by abstracting the program control flow into a logical form referred to as a program decision logic network. This network is modeled as a Boolean equation and minimized using modified versions of logic synthesis techniques. After minimization, the more efficient version of the program's original control flow is re-expressed in predicated code. Furthermore, this paper proposes extensions to the HPL PlayDoh predication model in support of more effective predicate decision logic network minimization. Finally, this paper shows the ability of the mechanisms presented to overcome limits on ILP previously imposed by rigid program control structure.
Information systems development: can there be &ldquo;good&rdquo; conflict?
Authors: Kenneth J. Trimmer, Rosann Webb Collins, Richard P. Will, J. Ellis Blanton
Venue: Proceedings of the 2000 ACM SIGCPR conference on Computer personnel research (2000)

Successful information systems development (ISD) is a perennial concern of both practitioners and researchers. As the scope of ISD expands to provide enterprise-wide and web-based systems, the set of individuals in ISD includes many whose responsibilities and experiences cross organizational functions. The involvement of this diverse set of individuals in ISD can lead to increased levels of conflict within the development group. However, not all conflict is detrimental to organizational tasks. This paper presents conflict and the resulting conflict resolution as a facet of team development. Conflict can take two general forms. The first form of conflict, interpersonal, has a negative or dysfunctional impact on group tasks and relations, and can lead to turnoever. The second form, task conflict, has a positive impact on group tasks. The need for ISD teams to recognize different types of conflict and successfully resolve them is presented within the context of an overall model of team and systems development.
Decision-Centric Information Monitoring
Authors: Len Seligman, Paul Lehner, Ken Smith, Chris Elsaesser, David Mattox
Venue: Journal of Intelligent Information Systems (2000)

We are interested in information management for decision support applications, especially those that monitor distributed, heterogeneous databases to assess time-critical decisions. Users of such applications can easily be overwhelmed with data that may change rapidly, may conflict, and may be redundant. Developers are faced with a dilemma: either filter out most information and risk excluding critical items, or gather possibly irrelevant or redundant information, and overwhelm the decision maker. This paper describes a solution to this dilemma called decision-centric information monitoring (DCIM). First, we observe that decision support systems should monitor only information that can potentially change some decision. We present an architecture for DCIM that meets the requirements implied by this observation. We describe techniques for identifying the highest value information to monitor and techniques for monitoring that information despite autonomy, distribution, and heterogeneity of data sources. Finally, we present lessons learned from building LOOKOUT, which is to our knowledge the first implementation of a top-to-bottom system performing decision-centric information monitoring.
Formal verification in hardware design: a survey
Authors: Christoph Kern, Mark R. Greenstreet
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (1999)

In recent years, formal methods have emerged as an alternative approach to ensuring the quality and correctness of hardware designs, overcoming some of the limitations of traditional validation techniques such as simulation and testing. There are two main aspects to the application of formal methods in a design process: the formal framework used to specify desired properties of a design and the verification techniques and tools used to reason about the relationship between a specification and a corresponding implementation. We survey a variety of frameworks and techniques proposed in the literature and applied to actual designs. The specification frameworks we describe include temporal logics, predicate logic, abstraction and refinement, as well as containment between &ohgr;-regular languages. The verification techniques presented include model checking, automata-theoretic techniques, automated theorem proving, and approaches that integrate the above methods. In order to provide insight into the scope and limitations of currently available techniques, we present a selection of case studies where formal methods were applied to industrial-scale designs, such as microprocessors, floating-point hardware, protocols, memory subsystems, and communications hardware.
An Analysis of Bitstate Hashing
Authors: Gerard J. Holzmann
Venue: Formal Methods in System Design (1998)

The bitstate hashing, or supertrace, technique was introduced in 1987 as a method to increase the quality of verification by reachability analyses for applications that defeat analysis by traditional means because of their size. Since then, the technique has been included in many research verification tools, and was adopted in tools that are marketed commercially. It is therefore important that we understand well how and why the method works, what its limitations are, and how it compares with alternative methods over a broad range of problem sizes.The original motivation for the bitstate hashing technique was based on empirical evidence of its effectiveness. In this paper we provide an analytical argument. We compare the technique with two alternatives that have been proposed in the recent literature. We also describe a sequential bitstate hashing technique that can be of value when confronted with very large problem sizes.
Teaching computer architecture with a new superscalar processor emulator
Authors: Santiago Rodríguez de la Fuente, M. Isabel García Clemente, Rafael Méndez Cavanillas
Venue: ACM SIGCSE Bulletin (1999)

Current computers use several techniques to improve performance such as cache memories, pipeline and multiple instruction issue per cycle. Using a real computer to teach these concepts is actually impractical, because these computers are designed to be programmed in high-level languages.In order to solve this problem, we have implemented a superscalar processor emulator, where most of the processor and cache parameters can be defined by the student. Its objective is to create a set of laboratory works allowing the student to observe how the different components of the computer evolve while executing an assembler program. It allows detection of the different kinds of cache misses and hazards as well as their impact on performance. Then, the student can apply some software techniques to reduce cache misses and to avoid hazards.
Explicit control of logic programs through rule algebra
Authors: Tomasz Imielinski, Shamim Naqvi
Venue: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1988)

In this paper we argue with a basic premise in logic programming research that the meaning of a program can be inferred from its syntax alone. We show that users may have a variety of intended models for programs and that a single program may give different intended models under different assumptions of semantics. Our conclusion is that it is impossible to infer the intended model from the syntax of the program and no single semantics will capture all the intended models. We propose as a solution an explicit specification of control. Towards this purpose we define a rule algebra. The user formulates a program as an algebraic specification that directs the execution towards the intended model. The interesting question at that point is how to efficiently implement such programs. We show a natural and easy transformation such that it takes as input an algebraic specification and produces as output a program belonging to a subclass of locally stratified programs. Moreover, there is a homomorphic correspondence between the algebraic expressions and their translations.
Two Purposes for Matrix Factorization: A Historical Appraisal
Authors: Lawrence Hubert, Jacqueline Meulman, Willem Heiser
Venue: SIAM Review (2000)

Matrix factorization in numerical linear algebra (NLA) typically serves the purpose of restating some given problem in such a way that it can be solved more readily; for example, one major application is in the solution of a linear system of equations. In contrast, within applied statistics/psychometrics (AS/P), a much more common use for matrix factorization is in presenting, possibly spatially, the structure that may be inherent in a given data matrix obtained on a collection of objects observed over a set of variables. The actual components of a factorization are now of prime importance and not just as a mechanism for solving another problem. We review some connections between NLA and AS/P and their respective concerns with matrix factorization and the subsequent rank reduction of a matrix. We note in particular that several results available for many decades in AS/P were more recently (re)discovered in the NLA literature. Two other distinctions between NLA and AS/P are also discussed briefly: how a generalized singular value decomposition might be defined, and the differing uses for the (newer) methods of optimization based on cyclic or iterative projections.
Unique Positive FM-AM Decomposition of Signals
Authors: Ramdas Kumaresan, Ashwin Rao
Venue: Multidimensional Systems and Signal Processing (1998)

An analytic signal, observed over an interval of T seconds, is decomposed into a Minimum Phase (AM) and an All-Phase (FM) signal. The former&lsquo;s log-envelope and phase form a Hilbert transform pair while the latter has positive definite instantaneous frequency (IF). An AM-FM demodulator algorithm to achieve the above decomposition is proposed.
Synchronization in multimedia data retrieval
Authors: Anna Haj Hać, Cindy X. Xue
Venue: International Journal of Network Management (1997)

Synchronization of multiple medium streams in real time has been recognized as one of the most important requirements for multimedia applications based on broadband high-speed networks. This article presents a complete synchronization scheme for distributed multimedia information systems. &copy; 1997 John Wiley Sons, Ltd.
Primal-Dual Strategy for Constrained Optimal Control Problems
Authors: Maïtine Bergounioux, Kazufumi Ito, Karl Kunisch
Venue: SIAM Journal on Control and Optimization (1999)

An algorithm for efficient solution of control constrained optimal control problems is proposed and analyzed. It is based on an active set strategy involving primal as well as dual variables. For discretized problems sufficient conditions for convergence in finitely many iterations are given. Numerical examples are given and the role of the strict complementarity condition is discussed.