ppxscal/embedding_network huggingface dataset:
Reuters: experience with D2000 and Globex
Authors: Alfred Scholldorf
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

From extensive experience in a large commercial application, the difficulties and rewards of &ldquo;selling&rdquo; Ada technology to management, with specific examples of how to use performance benchmarks and prototype systems to accomplish the transition. Also, discussions of the special demands of Ada on database systems and of the Ada-SQL interface. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Design of hospital admissions scheduling system using simulation
Authors: Julie C. Lowery
Venue: Proceedings of the 28th conference on Winter simulation (1996)

The ultimate objective of the research reported herein is to design an admissions scheduling system which can control hospital occupancy. This paper reports on the initial phase, of the research--demonstrating the technical feasibility of developing a simulation model of patient arrivals to and discharges from a hospital, which can be used to design the scheduling system. The specific steps that were accomplished for demonstrating technical feasibility of model development were: (1) develop a hospital simulation model, which can be used for designing the scheduling system; (2) validate the simulation model in two test hospitals; and (3) use the model to design an improved scheduling system which reduces the variability in daily census.
Wormhole run-time reconfiguration
Authors: Ray Bittner, Peter Athanas
Venue: Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays (1997)

Configurable Computing Machines (CCMs) are an emerging class of computing platform which provide the computational performance benefits of ASICs, yet retain the flexibility and rapid reconfigurability of general purpose microprocessors. In these platforms, computational "hardware" is essentially swapped in and out of the platform as needed, much like paging in virtual memory systems. For an efficient platform, the swapping of the computational hardware (referred to as Run-Time Reconfiguration, or RTR) must be rapid. Thus far, the means of altering the configuration of CCMs has relied on global control strategies that present a fundamental bottleneck to the potential bandwidth of configuration information flowing into the CCM. Wormhole Run-time Reconfiguration is presented as a distributed control methodology that is applicable not only to the problem of device-level CCM reconfiguration, but to system-wide concurrent computing as a whole. The Virginia Tech Colt/Stallion integrated circuits are computational FPGAs incorporating Wormhole RTR concepts, and are discussed as a case study.
Locally Weighted Learning
Authors: Christopher G. Atkeson, Andrew W. Moore, Stefan Schaal
Venue: Artificial Intelligence Review (1997)

This paper surveys locally weighted learning, a form of lazy learning and memory-based learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias, assessing predictions, handling noisy data and outliers, improving the quality of predictions by tuning fit parameters, interference between old and new data, implementing locally weighted learning efficiently, and applications of locally weighted learning. A companion paper surveys how locally weighted learning can be used in robot learning and control.
Recent developments in high-level synthesis
Authors: Youn-Long Lin
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (1997)

We survey recent developments in high level synthesis technology for VLSI design. The need for higher-level design automation tools are discussed first. We then describe some basic techniques for various subtasks of high-level synthesis. Techniques that have been proposed in the past few years (since 1994) for various subtasks of high-level synthesis are surveyed. We also survey some new synthesis objectives including testability, power efficiency, and reliability.
Representing Probabilistic Rules with Networks of GaussianBasis Functions
Authors: Volker Tresp, Jürgen Hollatz, Subutai Ahmad
Venue: Machine Learning (1997)

There is great interest in understanding the intrinsic knowledge neural networks have acquired during training. Most work in this direction is focussed on the multi-layer perceptron architecture. The topic of this paper is networks of Gaussian basis functions which are used extensively as learning systems in neural computation. We show that networks of Gaussian basis functions can be generated from simple probabilistic rules. Also, if appropriate learning rules are used, probabilistic rules can be extracted from trained networks. We present methods for the reduction of network complexity with the goal of obtaining concise and meaningful rules. We show how prior knowledge can be refined or supplemented using data by employing either a Bayesian approach, by a weighted combination of knowledge bases, or by generating artificial training data representing the prior knowledge. We validate our approach using a standard statistical data set.
How to decide the interconnection of isolated traffic signals
Authors: Edmond Chin-Ping Chang
Venue: Proceedings of the 17th conference on Winter simulation (1985)

Increasing traffic congestion along major urban signalized intersections demands the efficient operation and utilization of arterial facilities. Improvement on traffic flow and reduction in vehicular delays may be realized by interconnecting individually isolated intersections into a coordinated signal system, or by adding an adjacent signal into an existing coordinated system. This paper illustrates the development of interconnection warrants for isolated traffic signals by using both simulation study and field data validation. Simplified procedures were developed to evaluate the need to interconnect signalized intersections based on both simulation and field studies. Field data from several Texas cities were used to compare the results from the TRANSYT-7F and PASSER II computer programs. These programs were applied to address the effects of progression on changes in travel time and travel volume. Detailed field studies were performed at six (6) intersections under isolated-actuated, fixed-time coordination and traffic responsive operations on NASA 1 Road in front of the LBJ NASA Space Center, Houston, Texas.
Algorithms for large-scale flat placement
Authors: Jens Vygen
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

This is a survey on the algorithms which are part ofa program for flat placement of large-scale VLSI processorchips. The basis is a quadratic optimization approachcombined with a new quadrisection algorithm.In contrast to most previous quadratic placement methods,no min-cut objective is used at all. Based on aquadratic placement, a completely new algorithm findsa four-way partitioning meeting capacity constraintsand minimizing the total movement.
An Experiment to Assess the Cost-Benefits of Code Inspections in Large Scale Software Development
Authors: Adam A. Porter, Harvey P. Siy, Carol A. Toman, Lawrence G. Votta
Venue: IEEE Transactions on Software Engineering (1997)

We conducted a long-term experiment to compare the costs and benefits of several different software inspection methods. These methods were applied by professional developers to a commercial software product they were creating. Because the laboratory for this experiment was a live development effort, we took special care to minimize cost and risk to the project, while maximizing our ability to gather useful data. This article has several goals: 1) to describe the experiment's design and show how we used simulation techniques to optimize it, 2) to present our results and discuss their implications for both software practitioners and researchers, and 3) to discuss several new questions raised by our findings. For each inspection, we randomly assigned three independent variables: 1) the number of reviewers on each inspection team (1, 2, or 4), 2) the number of teams inspecting the code unit (1 or 2), and 3) the requirement that defects be repaired between the first and second team's inspections. The reviewers for each inspection were randomly selected without replacement from a pool of 11 experienced software developers. The dependent variables for each inspection included inspection interval (elapsed time), total effort, and the defect detection rate. Our results showed that these treatments did not significantly influence the defect detection effectiveness, but that certain combinations of changes dramatically increased the inspection interval.
Hilbert-Schmidt Lower Bounds for Estimators on Matrix Lie Groups for ATR
Authors: Ulf Grenander, Michael I. Miller, Anuj Srivastana
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)

Deformable template representations of observed imagery, model the variability of target pose via the actions of the matrix Lie groups on rigid templates. In this paper, we study the construction of minimum mean squared error estimators on the special orthogonal group, SO(n), for pose estimation. Due to the nonflat geometry of SO(n), the standard Bayesian formulation, of optimal estimators and their characteristics, requires modifications. By utilizing Hilbert-Schmidt metric defined on GL(n), a larger group containing SO(n), a mean squared criterion is defined on SO(n). The Hilbert-Schmidt estimate (HSE) is defined to be a minimum mean squared error estimator, restricted to SO(n). The expected error associated with the HSE is shown to be a lower bound, called the Hilbert-Schmidt bound (HSB), on the error incurred by any other estimator. Analysis and algorithms are presented for evaluating the HSE and the HSB in case of both ground-based and airborne targets.
Teaching via the Internet: the impact of the Internet as a communication medium on distance learning introductory computing students
Authors: Linda Carswell
Venue: ACM SIGCSE Bulletin (1997)

The use of the Internet is a common theme in current educational technology research. However, hype does not augment learning, and new technology alone does not promise improvement. The question is does Internet presentation alone affect learning outcomes? This study examines two groups of distance learning students on a single course, using the same learning materials, but with different means of communication. One group consists of conventional distance learning students who communicate with their instructors via telephone and written correspondence, while the other group communicates electronically via the Internet. Attitudes, learning styles, self perceptions, grades, and experiences for each group are compared to assess the impact of the Internet, as a communication medium. The Internet as a communication medium is not found to have any significant effect on learning outcomes, and neither is any learning style profile. The student experiences are favourable in both mediums, however those using the Internet reported greater flexibility and faster response times.
Learning to Recognize Volcanoes on Venus
Authors: Michael C. Burl, Lars Asker, Padhraic Smyth, Usama Fayyad, Pietro Perona, Larry Crumpler, Jayne Aubele
Venue: Machine Learning (1998)

Dramatic improvements in sensor and image acquisition technology have created a demand for automated tools that can aid in the analysis of large image databases. We describe the development of JARtool, a trainable software system that learns to recognize volcanoes in a large data set of Venusian imagery. A machine learning approach is used because it is much easier for geologists to identify examples of volcanoes in the imagery than it is to specify domain knowledge as a set of pixel-level constraints. This approach can also provide portability to other domains without the need for explicit reprogramming; the user simply supplies the system with a new set of training examples. We show how the development of such a system requires a completely different set of skills than are required for applying machine learning to &ldquo;toy world&rdquo; domains. This paper discusses important aspects of the application process not commonly encountered in the &ldquo;toy world,&rdquo; including obtaining labeled training data, the difficulties of working with pixel data, and the automatic extraction of higher-level features.
Note. the Role of Returns Policies in Pricing and Inventory Decisions for Catalogue Goods
Authors: Hamilton Emmons, Stephen M. Gilbert
Venue: Management Science (1998)

Manufacturers often use returns policies to encourage retailers to stock and price items more aggressively. We focus on the effect that such policies have on both a retailer's and a manufacturer's profits when the retailer must commit prior to the selling season to both a stocking quantity and a price at which to sell an item. Such a commitment is often necessary for retailers who sell primarily through catalogues.
Research directions and emerging issues in business process re-engineering
Authors: Andrew Blyth
Venue: ACM SIGGROUP Bulletin (1998)

In the 1990 Business Process Re-Engineering (BPR) was seen as the wonder drug for organizations, with more and more organizations rushing to undertake BPR projects. Some of these projects have successful, however most have failed. The results of these BPR project have forced practitioners of Business Process Re-Engineering to recognize the need for structured and focused research to inform and direct there activities. The question for researchers is: "Into what areas is best and most productive to undertake research ?" In an attempt to answer this question in this papers I will outline some areas of research that are producing positive results. These research directions are: bull; The motivations and conditions for successful Business Process Re-Engineering. bull; Knowledge Management and Learning Processes. bull; Business Systems Modeling and Analysis. bull; Complex Adaptive and Evolving Systems. bull; Change and Innovation Management.
Behavioral Controllability of Delay-Differential Systems
Authors: Paula Rocha, Jan C. Willems
Venue: SIAM Journal on Control and Optimization (1997)

In this paper we will prove that the system described by the delay-differential equation $R(d/dt,\Delta)w=0$ (with $\Delta$ the unit delay operator) is controllable if and only if the rank of $R(\lambda,e^{-\lambda})$ is constant for all $\lambda \in {\bkC}$. This condition is compared with the existing results obtained both by the analytic approach and by the algebraic approach to delay-differential systems.
Using problem analysis to support decisions and planning in complex processes
Authors: Chris Hallgren
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1997)

This paper presents theoretical and practical arguments for a new direction in task-based, computer documentation. It ar gues that common tasks that we document for users have grown in complexity to include many stages where decisions affect the outcome. The term "complex problem" is used to describe this scenario, in that users struggle to understand the obstacles to completion of a task, and the criteria for success at each stage.The design of information for "complex problems" is seen as needing to include Problem Analysis as a parallel activity to Task Analysis. This analysis can be used to highlight tasks for special attention in the information outline, when they are "seen" by the users as containing major challenges or problems. A definition of users in this context is also argued to confound the traditional view of audience analysis, in that so many different audiences use the same technology and encounter the same problems with many products. The biggest problem occurs when people learn to cope with particular technology in a superficial way, and then fail to transfer this knowledge to upgrades or new technology.The shift in documentation strategy recommended by this paper is summarized as adopting a "problem focus" by integrating the planning of tasks that involve complex problems in the stream of task steps. This involves the integration of the related tasks into the flow required for the whole solution. These arguments are developed in the Introduction and Background sections, and elements of the "problem-focused" style of information are demonstrated through examples from jobs I have had in areas that involve complex problems. Finally, the recommendations for this new approach are summarized in the Conclusion.
The Amulet Environment: New Models for Effective User Interface Software Development
Authors: Brad A. Myers, Richard G. McDaniel, Robert C. Miller, Alan S. Ferrency, Andrew Faulring, Bruce D. Kyle, Andrew Mickish, Alex Klimovitski, Patrick Doane
Venue: IEEE Transactions on Software Engineering (1997)

The Amulet user interface development environment makes it easier for programmers to create highly-interactive, graphical user interface software for Unix, Windows and the Macintosh. Amulet uses new models for objects, constraints, animation, input, output, commands, and undo. The object system is a prototype-instance model in which there is no distinction between classes and instances or between methods and data. The constraint system allows any value of any object to be computed by arbitrary code and supports multiple constraint solvers. Animations can be attached to existing objects with a single line of code. Input from the user is handled by "interactor" objects which support reuse of behavior objects. The output model provides a declarative definition of the graphics and supports automatic refresh. Command objects encapsulate all of the information needed about operations, including support for various ways to undo them. A key feature of the Amulet design is that all graphical objects and behaviors of those objects are explicitly represented at run-time, so the system can provide a number of high-level built-in functions, including automatic display and editing of objects, and external analysis and control of interfaces. Amulet integrates these capabilities in a flexible and effective manner.
On Integer Multiflow Maximization
Authors: András Frank, Alexander V. Karzanov, András Sebo
Venue: SIAM Journal on Discrete Mathematics (1997)

Generalizing the two-commodity flow theorem of Rothschild and Whinston [Oper. Res., 14 (1966), pp. 377--387] and the multiflow theorem of Lovász [Acta Mat. Akad. Sci. Hungaricae, 28 (1976), pp. 129--138] and Cherkasky [Ekonom.-Mat. Metody, 13 (1977), pp. 143--151], Karzanov and Lomonosov [Mathematical Programming, O. I. Larichev, ed., Institute for System Studies, 1978, pp. 59--66] in 1978 proved a min-max theorem on maximum multiflows. Their original proof is quite long and technical and relies on earlier investigations into metrics. The main purpose of the present paper is to provide a relatively simple proof of this theorem. Our proof relies on the locking theorem, which is another result of Karzanov and Lomonosov, and the polymatroid intersection theorem of Edmonds [Combinatorial Structures and Their Applications, R. Guy, H. Hanani, N. Sauer, and J. Schönheim, eds., Gordon and Breach, 1970, pp. 69--87]. For completeness, we also provide a simplified proof of the locking theorem. Finally, we introduce the notion of a node demand problem and, as another application of the locking theorem, we derive a feasibility theorem concerning it.The presented approach gives rise to (combinatorial) polynomial-time algorithms.
Programming languages for mobile code
Authors: Tommy Thorn
Venue: ACM Computing Surveys (CSUR) (1997)

Sun's announcement of the programming language Java more that anything popularized the notion of mobile code, that is, programs traveling on a heterogeneous network and automatically executing upon arrival at the destination. We describe several classes of mobile code and extract their common characteristics, where security proves to be one of the major concerns. With these characteristics as reference points, we examine six representative languages proposed for mobile code. The conclusion of this study leads to our recommendations for future work, illustrated by examples of ongoing research.
On optimal call admission control in cellular networks
Authors: Ramachandran Ramjee, Don Towsley, Ramesh Nagarajan
Venue: Wireless Networks (1997)

Two important Quality-of-Service (QoS) measures for current cellular networks are the fractions of new and handoff &ldquo;calls&rdquo; that are blocked due to unavailability of &ldquo;channels&rdquo; (radio and/or computing resources). Based on these QoS measures, we derive optimal admission control policies for three problems: minimizing a linear objective function of the new and handoff call blocking probabilities (MINOBJ), minimizing the new call blocking probability with a hard constraint on the handoff call blocking probability (MINBLOCK) and minimizing the number of channels with hard constraints on both of the blocking probabilities (MINC). We show that the well-known Guard Channel policy is optimal for the MINOBJ problem, while a new Fractional Guard Channel policy is optimal for the MINBLOCK and MINC problems. The Guard Channel policy reserves a set of channels for handoff calls while the Fractional Guard Channel policy effectively reserves a non-integral number of guard channels for handoff calls by rejecting new calls with some probability that depends on the current channel occupancy. It is also shown that the Fractional policy results in significant savings (20-50\%) in the new call blocking probability for the MINBLOCK problem and provides some, though small, gains over the Guard Channel policy for the MINC problem. Further, we also develop computationally inexpensive algorithms for the determination of the parameters for the optimal policies.
Tutorial on fuzzy logic in simulation
Authors: M. Luisa McAllister, Sergei A. Ovchinnikov, John T. Dockery, Klaus-Peter Adlassnig
Venue: Proceedings of the 17th conference on Winter simulation (1985)

The objective of this tutorial is to introduce to the simulation community another tool that is now available. This tool is best known under the name of Fuzzy Set Theory. This tutorial contains a brief discussion of the current trends in simulation which we believe justify the need of this new tool. Kept to a minimum, the Introduction to fuzzy sets will be strictly limited to the case of a finite number of elements. Most attention will be devoted to fuzzy logic. It is precisely fuzzy logic which lends itself to growth in the simulation of situations that arise in real life either because of the inexactness of the environment, or because of the inexactness/imprecision of the available data.
A Posteriori Error Estimators for Nonconforming Approximation of Some Quasi-Newtonian Flows
Authors: Claudio Padra
Venue: SIAM Journal on Numerical Analysis (1997)

This paper deals with a posteriori error estimators for nonconforming approximations of quasi-Newtonian flows.We consider the Crouzeix--Raviart piecewise linear approximations of scalar elliptic problems and define an error estimator. When $\Omega$ is a simply connected domain, the error is dominated by the estimator. This estimator can be generalized to higher-order elements.We define a posteriori error estimators for the Fortin--Soulie piecewise quadratic approximations of quasi-Newtonian flows and prove that the error is dominated by the estimator. This estimator can be computed locally in terms of the approximate solution and is therefore suitable for adaptive refinement.