ppxscal/embedding_network huggingface dataset:
Flatland: new dimensions in office whiteboards
Authors: Elizabeth D. Mynatt, Takeo Igarashi, W. Keith Edwards, Anthony LaMarca
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

Flatland is an augmented whiteboard interface designed for informal office work. Our research investigates approaches to building an augmented whiteboard in the context of continuous, long term office use. In particular, we pursued three avenues of research based on input from user studies: techniques for the management of space on the board, the ability to flexibly apply behaviors to support varied application semantics, and mechanisms for managing history on the board. Unlike some previously reported whiteboard systems, our design choices have been influenced by a desire to support long-term, informal use in an individual office setting.
Adaptive multi-stage distance join processing
Authors: Hyoseop Shin, Bongki Moon, Sukho Lee
Venue: ACM SIGMOD Record (2000)

A spatial distance join is a relatively new type of operation introduced for spatial and multimedia database applications. Additional requirements for ranking and stopping cardinality are often combined with the spatial distance join in on-line query processing or internet search environments. These requirements pose new challenges as well as opportunities for more efficient processing of spatial distance join queries. In this paper, we first present an efficient k-distance join algorithm that uses spatial indexes such as R-trees. Bi-directional node expansion and plane-sweeping techniques are used for fast pruning of distant pairs, and the plane-sweeping is further optimized by novel strategies for selecting a sweeping axis and direction. Furthermore, we propose adaptive multi-stage algorithms for k-distance join and incremental distance join operations. Our performance study shows that the proposed adaptive multi-stage algorithms outperform previous work by up to an order of magnitude for both k-distance join and incremental distance join queries, under various operational conditions.
Performance-based evaluations of the tangible benefits of information networks with applications
Authors: Rafiq Jamal-Aldeen, Saad Haj Bakry, Adnan Haj Nouh
Venue: International Journal of Network Management (2000)

This paper provides a new methodology for the evaluation of the tangible benefits of information networks, based on their utilization and performance. The methodology enables the evaluation of different tangible benefits including those resulting from time, movement, paper, and space savings. Copyright &copy; 2000 John Wiley Sons, Ltd.
An Augmented Lagrangian Method for Identifying Discontinuous Parameters in Elliptic Systems
Authors: Zhiming Chen, Jun Zou
Venue: SIAM Journal on Control and Optimization (1999)

The identification of discontinuous parameters in elliptic systems is formulated as a constrained minimization problem combining the output least squares and the equation error method. The minimization problem is then proved to be equivalent to the saddle-point problem of an augmented Lagrangian. The finite element method is used to discretize the saddle-point problem, and the convergence of the discretization is also proved. Finally, an Uzawa algorithm is suggested for solving the discrete saddle-point problem and is shown to be globally convergent.
Local loop ISDN dial backup for frame relay
Authors: Eugene H. Wolf
Venue: International Journal of Network Management (1998)

Corporations using FR services increasingly require access-line resiliency to their major carrier, and the carriers are, in return, offering a committment to an increased level of service. This article discusses a way of assuring that this service . This article discusses a way of assuring that this service can be achieved. &copy; 1998 John Wiley & Sons, Ltd.
A Programming Methodology for Dual-Tier Multicomputers
Authors: Scott B. Baden, Stephen J. Fink
Venue: IEEE Transactions on Software Engineering (2000)

Hierarchically organized ensembles of shared memory multiprocessors possess a richer and more complex model of locality than previous generation multicomputers with single processor nodes. These dual-tier computers introduce many new factors into the programmer's performance model. We present a methodology for implementing block-structured numerical applications on dual-tier computers and a run-time infrastructure, called KeLP2, that implements the methodology. KeLP2 supports two levels of locality and parallelism via hierarchical SPMD control flow, run-time geometric meta-data, and asynchronous collective communication. KeLP applications can effectively overlap communication with computation under conditions where nonblocking point-to-point message passing fails to do so. KeLP's abstractions hide considerable detail without sacrificing performance and dual-tier applications written in KeLP consistently outperform equivalent single-tier implementations written in MPI. We describe the KeLP2 model and show how it facilitates the implementation of five block-structured applications specially formulated to hide communication latency on dual-tiered architectures. We support our arguments with empirical data from applications running on various single- and dual-tier multicomputers. KeLP2 supports a migration path from single-tier to dual-tier platforms and we illustrate this capability with a detailed programming example.
Regularity extraction via clan-based structural circuit decomposition
Authors: Soha Hassoun, Carolyn McCreary
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout efforts. We introduce in this paper a novel method for identifying a set of repeating circuit structures, referred to as templates, and we report on using an efficient binate cover solver to select an appropriate subset of templates with which to cover the circuit. Our approach is comprised of three steps. First, the circuit graph is decomposed in a hierarchical inclusion parse tree using a clan-based decomposition algorithm. This algorithm discovers clans, grouping of nodes in the circuit graph that have a natural affinity towards each other. Second, the parse tree nodes are classified into equivalence classes. Such classes represent templates suitable for circuit covering. The final step consists of using a binate cover solver to find an appropriate cover. The cover will consist of instantiated templates and gates that cannot be covered by any templates. We describe the results of applying this algorithm to several circuits, and show that the algorithm is effective in extracting structural regularity.
Why web-based network monitoring? Leveraging the platform
Authors: Ron D. Jenkins
Venue: International Journal of Network Management (1999)

The increasing use of network monitoring and the growth of the Internet and intranets are converging trends that make IP network infrastructures the logical means of delivering network monitoring, using browser -bused clients. Copyright &copy; 1999 John Wiley Sons, Ltd.
Design of a Temporal Learning Chip for Signal Generation and Classification
Authors: Fathi M. Salam, Hwa-Joon Oh
Venue: Analog Integrated Circuits and Signal Processing (1999)

The design and analog VLSI implementation of a recurrent neural network with integrated temporal learning is presented. The learning algorithm is forward in time, and is implemented strictly as instantaneous, local weight updates. PSpice simulations of networks with 4 to 6 neurons demonstrate robust learning of trajectory generation and classification tasks. A scalable 2-D VLSI architecture is described and a prototupe 4-neuron recurrent neural network with learning has subsequently been fabricated in MOSIS TinyChip 2 micron technology. Experimental results of the chip validate the learning performance with convergence in the millisecond range. Specific experimental results of learning circular and figure-8 dynamic trajectories are included.
Integration of Temporal Reasoning and Temporal-Data Maintenance into a Reusable Database Mediator to Answer Abstract, Time-Oriented Queries: The Tzolkin System
Authors: John H. Nguyen, Yuval Shahar, Samson W. Tu, Amar K. Das, Mark A. Musen
Venue: Journal of Intelligent Information Systems (1999)

The ability to reason with time-oriented data is central to the practice of medicine. Monitoring clinical variables over time often provides information that drives medical decision making (e.g., clinical diagnosis and therapy planning). Because the time-oriented patient data are often stored in electronic databases, it is important to ensure that clinicians and medical decision-support applications can conveniently find answers to their clinical queries using these databases. To help clinicians and decision-support applications make medical decisions using time-oriented data, a database-management system should (1) permit the expression of abstract, time-oriented queries, (2) permit the retrieval of data that satisfy a given set of time-oriented data-selection criteria, and (3) present the retrieved data at the appropriate level of abstraction. We impose these criteria to facilitate the expression of clinical queries and to reduce the manual data processing that users must undertake to decipher the answers to their queries. We describe a system, Tzolkin, that integrates a general method for temporal-data maintenance with a general method for temporal reasoning to meet these criteria. Tzolkin allows clinicians to use SQL-like temporal queries to retrieve both raw, time-oriented data and dynamically generated summaries of those data. Tzolkin can be used as a standalone system or as a module that serves other software systems. We implement Tzolkin with a temporal-database mediator approach. This approach is general, facilitates software reuse, and thus decreases the cost of building new software systems that require this functionality.
Analyzing bounding boxes for object intersection
Authors: Subhash Suri, Philip M. Hubbard, John F. Hughes
Venue: ACM Transactions on Graphics (TOG) (1999)

Heuristics that exploit bouning boxes are common in algorithms for rendering, modeling, and animation. While experience has shown that bounding boxes improve the performance of these algorithms in practice, the previous theoretical analysis has concluded that bounding boxes perform poorly in the worst case. This paper reconciles this discrepancy by analyzing intersections among n geometric objects in terms of two parameters: &agr; an upper bound on the aspect ratio or elongatedness of each object; and &sgr; an upper bound on the scale factor or size disparity between the largest and smallest objects. Letting Ko and Kb be the number of intersecting object pairs and bounding box pairs, respectively, we analyze a ratio measure of the bounding boxes' efficiency, r=Kb/n+Ko . The analysis proves that r=Oas log2s and r=Was . One important consequence is that if &agr; and &sgr; are small constants (as is often the case in practice), then Kb= O(Ko)+ O(n, so an algorithm that uses bounding boxes has time complexity proportional to the number of actual object intersections. This theoretical result validates the efficiency that bounding boxes have demonstrated in practice. Another consequence of our analysis is a proof of the output-sensitivity of an algorithm for reporting all intersecting pairs in a set of n convex polyhedra with constant &agr; and &sgr;. The algorithm takes time O(nlogd&minus;1n+ Kolog d&minus;1n) for dimension d = 2, 3. This running time improves on the performance of previous algorithms, which make no assumptions about &agr; and &sgr;.
Cleanroom software engineering: technology and process
Authors: Stacy J. Prowell, Carmen J. Trammell, Richard C. Linger, Jesse H. Poore
Venue: Addison Wesley Sei Series In Software Engineering (1999)

Cleanroom software engineering is a process for developing and certifying high-reliability software. Combining theory-based engineering technologies in project management, incremental development, software specification and design, correctness verification, and statistical quality certification, the Cleanroom process answers today's call for more reliable software and provides methods for more cost-effective software development.Cleanroom originated with Harlan D. Mills, an IBM Fellow and a visionary in software engineering. Written by colleagues of Mills and some of the most experienced developers and practitioners of Cleanroom, Cleanroom Software Engineering provides a roadmap for software management, development, and testing as disciplined engineering practices. This book serves both as an introduction for those new to Cleanroom and as a reference guide for the growing practitioner community. Readers will discover a proven way to raise both quality and productivity in their software-intensive products, while reducing costs.Highlights Explains basic Cleanroom theory Introduces the sequence-based specification method Elaborates the full management, development, and certification process in a Cleanroom Reference Model (CRM) Shows how the Cleanroom process dovetails with the SEI's Capability Maturity Model for Software (CMM) Includes a large case study to illustrate how Cleanroom methods scale up to large projects.
Patient Dependency Knowledge-Based Systems
Authors: F. Soliman
Venue: Journal of Medical Systems (1998)

The ability of Patient Dependency Systems to provide information for staffing decisions and budgetary development has been demonstrated. In addition, they have become powerful tools in modern hospital management. This growing interest in Patient Dependency Systems has renewed calls for their automation. As advances in Information Technology and in particular Knowledge-Based Engineering reach new heights, hospitals can no longer afford to ignore the potential benefits obtainable from developing and implementing Patient Dependency Knowledge-Based Systems. Experience has shown that the vast majority of decisions and rules used in the Patient Dependency method are too complex to capture in the form of a traditional programming language. Furthermore, the conventional Patient Dependency Information System automates the simple and rigid bookkeeping functions. On the other hand Knowledge-Based Systems automate complex decision making and judgmental processes and therefore are the appropriate technology for automating the Patient Dependency method. In this paper a new technique to automate Patient Dependency Systems using knowledge processing is presented. In this approach all Patient Dependency factors have been translated into a set of Decision Rules suitable for use in a Knowledge-Based System. The system is capable of providing the decision-maker with a number of scenarios and their possible outcomes. This paper also presents the development of Patient Dependency Knowledge-Based Systems, which can be used in allocating and evaluating resources and nursing staff in hospitals on the basis of patients' needs.
Problems associated with FES-standing in paraplegia
Authors: Tadej Bajd, Marko Munih, Alojz Kralj
Venue: Technology and Health Care (1999)

Prolonged immobilization, such as occurs after the spinal cord injury (SCI), results in several physiological problems. It has been demonstrated that the standing posture can ameliorate many of these problems. Standing exercise can be efficiently performed by the help of functional electrical stimulation (FES). The first application of FES to a paraplegic patient was reported by Kantrowitz in 1963. It was later shown by our group that standing for therapeutic purposes can be achieved by a minimum of two channels of FES delivered to both knee extensors. The properties of the stimulated knee extensors (maximal isometric joint torque, fatiguing, and spasticity) were not found as sufficient conditions for efficient standing exercise. According to our studies, the ankle joint torque during standing is the only parameter which is well correlated to the duration of FES assisted standing. For good standing low values of the ankle joint torque are required. To minimize the ankle joint torque the lever belonging to the vertical reaction force must be decreased. Adequate alignment of the posture appears to be the prerequisite for efficient FES assisted and arm supported standing exercise. Some patients are able to assume such posture by themselves, while many must be aided by additional measures. At present, surface stimulation of knee extensors combined with some appropriately compliant shoes looks to be adequate choice.
Pointer analysis for programs with structures and casting
Authors: Suan Hsi Yong, Susan Horwitz, Thomas Reps
Venue: Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation (1999)

Type casting allows a program to access an object as if it had a type different from its declared type. This complicates the design of a pointer-analysis algorithm that treats structure fields as separate objects; therefore, some previous pointer-analysis algorithms "collapse" a structure into a single variable. The disadvantage of this approach is that it can lead to very imprecise points-to information. Other algorithms treat each field as a separate object based on its offset and size. While this approach leads to more precise results, the results are not portable because the memory layout of structures is implementation dependent.This paper first describes the complications introduced by type casting, then presents a tunable pointer-analysis framework for handling structures in the presence of casting. Different instances of this framework produce algorithms with different levels of precision, portability, and efficiency. Experimental results from running our implementations of four instances of this framework show that (i) it is important to distinguish fields of structures in pointer analysis, but (ii) making conservative approximations when casting is involved usually does not cost much in terms of time, space, or the precision of the results.
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
Authors: Yu-Li Chou, H. Edwin Romeijn, Robert L. Smith, Martin Skutella
Venue: Mathematics of Operations Research (1998)

Due to its obvious practical relevance, the Time-Cost Tradeoff Problem has attracted the attention of many researchers over the last forty years. While the Linear Time-Cost Tradeoff Problem can be solved in polynomial time, its discrete variant is known to be NP-hard. We present the first approximation algorithms for the Discrete Time-Cost Tradeoff Problem. Specifically, given a fixed budget we consider the problem of finding a shortest schedule for a project. We give an approximation algorithm with performance ratio 3/2 for the class of projects where all feasible durations of activities are either 0, 1, or 2. We extend our result by giving approximation algorithms with performance guarantee O(log l), where l is the ratio of the maximum duration of any activity to the minimum nonzero duration of any activity. Finally, we discuss bicriteria approximation algorithms which compute schedules for a given deadline or budget such that both project duration and cost are within a constant factor of the duration and cost of an optimum schedule for the given deadline or budget.
A 3/2-Approximation Algorithm for the Mixed Postman Problem
Authors: Balaji Raghavachari, Jeyakesavan Veerasamy
Venue: SIAM Journal on Discrete Mathematics (1999)

The mixed postman problem, a generalization of the Chinese postman problem, is that of finding the shortest tour that traverses each edge of a given mixed graph (a graph containing both undirected and directed edges) at least once. The problem is solvable in polynomial time either if the graph is undirected or if the graph is directed, but it is NP-hard in mixed graphs. An approximation algorithm with a performance ratio of 3/2 for the postman problem on mixed graphs is presented.
Future challenges in program visualization (panel session)
Venue: Proceedings of the 5th annual SIGCSE/SIGCUE ITiCSEconference on Innovation and technology in computer science education (2000)

As an interdisciplinary topic, program visualization research needs a comprehensive approach, in order to be useful for college education and research, as well as software engineering. This main challenge consists of several aspects, like developing efficient visualization techniques, composing attractive pilot environments, analyzing visualizations from the cognitive point of view, creating functional taxonomies to compare various environments, supporting teamwork in algorithm design and programming, and designing field testing methods to evaluate a given visualization environment.
An analytical model of the working-set sizes in decision-support systems
Authors: Magnus Karlsson, Per Stenström
Venue: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2000)

This paper presents an analytical model to study how working sets scale with database size and other applications parameters in decision-support systems (DSS). The model uses application parameters, that are measured on down-scaled database executions, to predict cache miss ratios for executions of large databases.By applying the model to two database engines and typical DSS queries we find that, even for large databases, the most performance-critical working set is small and is caused by the instructions and private data that are required to access a single tuple. Consequently, its size is not affected by the database size. Surprisingly, database data may also exhibit temporal locality but the size of its working set critically depends on the structure of the query, the method of scanning, and the size and the content of the database.
AKORD: transistor level and mixed transistor/gate level placement tool for digital data paths
Authors: Tatjana Serdar, Carl Sechen
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper describes AKORD, a transistor level and mixed transistor/gate level placement tool. AKORD has unique layout capabilities that address the digital data path layout problem. In order to improve communication between the placement and routing steps, new post placement algorithms were developed: a device re-spacing procedure, an optimization procedure for gate contacts, and a procedure which reduces wire crossovers. AKORD supports dynamically: 1. Transistor folding without usage of device libraries that contain variants of the same device; 2. Device merging, including information about optimal transistor chain formation; and 3. Well area minimization. Experimental results show that the automated layouts are comparable to skilled manual layouts and that the computation times are quite modest.
Theory and Practice of Projective Rectification
Authors: Richard I. Hartley
Venue: International Journal of Computer Vision (1999)

This paper gives a new method for image rectification, the process of resampling pairs of stereo images taken from widely differing viewpoints in order to produce a pair of &ldquo;matched epipolar projections&rdquo;. These are projections in which the epipolar lines run parallel with the x-axis and consequently, disparities between the images are in the x-direction only. The method is based on an examination of the fundamental matrix of Longuet-Higgins which describes the epipolar geometry of the image pair. The approach taken is consistent with that advocated by Faugeras (1992) of avoiding camera calibration. The paper uses methods of projective geometry to determine a pair of 2D projective transformations to be applied to the two images in order to match the epipolar lines. The advantages include the simplicity of the 2D projective transformation which allows very fast resampling as well as subsequent simplification in the identification of matched points and scene reconstruction.