ppxscal/embedding_network huggingface dataset:
Information, technical writing, knowledge and power: a case study of NASA's Cassini project
Authors: Mattio Valentino
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1999)

The study of technology should not limit its scope to hardware, software, applications and systems; it should also involve language, how language shapes and is shaped by information, how information becomes knowledge, and how dominant knowledge can become power, all within the complex contexts of human culture. Technology transfer, the transfer of the knowledge of technology, is mediated by language, which, paradoxically, is itself a technology. What happens, then, when one community attempts to transfer knowledge of technology to an outside community? Sometimes the transfer occurs smoothly resulting in different and diverse communities willingly constructing shared knowledge together. Sometimes conflicts arise and the transfer of knowledge, when forced, can become a struggle on social, economic, and political levels.
Generation of Execution Sequences for Modular Time Critical Systems
Authors: Pierluigi San Pietro, Angelo Morzenti, Sandro Morasca
Venue: IEEE Transactions on Software Engineering (2000)

We define methods for generating execution sequences for time-critical systems based on their modularized formal specification. An execution sequence represents a behavior of a time critical system and can be used, before the final system is built, to validate the system specification against the user requirements (specification validation) and, after the final system is built, to verify whether the implementation satisfies the specification (functional testing). Our techniques generate execution sequences in the large, in that we focus on the connections among the abstract interfaces of the modules composing a modular specification. Execution sequences in the large are obtained by composing execution sequences in the small for the individual modules. We abstract from the specification languages used for the individual modules of the system, so our techniques can also be used when the modules composing the system are specified with different formalisms. We consider the cases in which connections give rise to either circular or noncircular dependencies among specification modules. We show that execution sequence generation can be carried out successfully under rather broad conditions and we define procedures for efficient construction of execution sequences. These procedures can be taken as the basis for the implementation of (semi)automated tools that provide substantial support to the activity of specification validation and functional testing for industrially-sized time critical systems. In addition, we show how we have applied our techniques to an industrial-strength case study with the aid of a prototype tool.
Customer-focused design data in a large, multi-site organization
Authors: Paula Curtis, Tammy Heiserman, David Jobusch, Mark Notess, Jayson Webb
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

Qualitative user-centered design processes such as contextual inquiry can generate huge amounts of data to be organized, analyzed, and represented. When you add the goal of spreading the resultant understanding to the far reaches of a large, multi-site organization, many practical barriers emerge. In this paper we describe experience creating and communicating representations of contextually derived user data in a large, multi-site product development organization. We describe how we involved a distributed team in data collection and analysis and how we made the data representations portable. We then describe how we have engaged over 200 people from five sites in thinking through the user data and its implications on product design.
Three-Processor Tasks Are Undecidable
Authors: Eli Gafni, Elias Koutsoupias
Venue: SIAM Journal on Computing (1999)

We show that no algorithm exists for deciding whether a finite task for three or more processors is wait-free solvable in the asynchronous read-write shared-memory model. This impossibility result implies that there is no constructive (recursive) characterization of wait-free solvable tasks. It also applies to other shared-memory models of distributed computing, such as the comparison-based model.
Ethical issues related to Internet development and research
Authors: G. Ernest Anderson, R. Waldo Roth, Stuart A. Varden
Venue: ACM SIGCSE Bulletin (1998)

This paper discusses ethical issues concerning Internet development, presentation and research. A brief overview of the major ethical issues related to computing is followed by a discussion of ethical issues specific to the use of the Internet. We will look at the implications of these issues for particular population groups such as children, women, disabled persons, and the low socio-economic class. Finally, we offer suggestions for how these issues can be brought into the computer or information science classroom in a way that stimulates critical thinking skills.
Postprocessing the Galerkin Method: The Finite-Element Case
Authors: Bosco Garc
Venue: SIAM Journal on Numerical Analysis (1999)

A postprocessing technique, developed earlier for spectral methods, is extended here to Galerkin finite-element methods for dissipative evolution partial differential equations. The postprocessing amounts to solving a linear elliptic problem on a finer grid (or higher-order space) once the time integration on the coarser mesh is completed. This technique increases the convergence rate of the finite-element method to which it is applied, and this is done at almost no additional computational cost. The numerical experiments presented here show that the resulting postprocessed method is computationally more efficient than the method to which it is applied (say, quadratic finite elements) as well as standard methods of similar order of convergence as the postprocessed one (say, cubic finite elements). The error analysis of the new method is performed in L2 and in $L^\infty$ norms.
A Convex Optimization Approach to the Rational Covariance Extension Problem
Authors: Christopher I. Byrnes, Sergei V. Gusev, Anders Lindquist
Venue: SIAM Journal on Control and Optimization (1999)

In this paper we present a convex optimization problem for solving the rational covariance extension problem. Given a partial covariance sequence and the desired zeros of the modeling filter, the poles are uniquely determined from the unique minimum of the corresponding optimization problem. In this way we obtain an algorithm for solving the covariance extension problem, as well as a constructive proof of Georgiou's seminal existence result and his conjecture, a stronger version of which we have resolved in [Byrnes et al., IEEE Trans. Automat. Control, AC-40 (1995), pp. 1841--1857].
Discounted stochastic games
Authors: Eilon Solan
Venue: Mathematics of Operations Research (1998)

We give an alternative proof to a result of Mertens and Parthasarathy, stating that every n-player discounted stochastic game with general setup, and with a norm-continuous transition, has a subgame perfect equilibrium.
On the value locality of store instructions
Authors: Kevin M. Lepak, Mikko H. Lipasti
Venue: ACM SIGARCH Computer Architecture News (2000)

Value locality, a recently discovered program attribute that describes the likelihood of the recurrence of previously-seen program values, has been studied enthusiastically in the recent published literature. Much of the energy has focused on refining the initial efforts at predicting load instruction outcomes, with the balance of the effort examining the value locality of either all register-writing instructions, or a focused subset of them. Surprisingly, there has been very little published characterization of or effort to exploit the value locality of data words stored to memory by computer programs. This paper presents such a characterization, proposes both memory-centric (based on message passing) and producer-centric (based on program structure) prediction mechanisms for stored data values, introduces the concept of silent stores and new definitions of multiprocessor false sharing based on these observations, and suggests new techniques for aligning cache coherence protocols and microarchitectural store handling techniques to exploit the value locality of stores. We find that realistic implementations of these techniques can significantly reduce multiprocessor data bus traffic and are more effective at reducing address bus traffic than the addition of Exclusive state to a MSI coherence protocol. We also show that squashing of silent stores can provide uniprocessor speedups greater than the addition of store-to-load forwarding.
A Priori Error Estimates for Numerical Methods for Scalar Conservation Laws Part III: Multidimensional Flux-Splitting Monotone Schemes on Non-Cartesian Grids
Authors: Bernardo Cockburn, Pierre-Alain Gremaud, Jimmy Xiangrong Yang
Venue: SIAM Journal on Numerical Analysis (1998)

This paper is the third of a series in which a general theory of a priori error estimates for scalar conservation laws is constructed. In this paper, we consider multidimensional flux-splitting monotone schemes defined on non-Cartesian grids. We identify those schemes which are consistent and prove that the $L^\infty(0,T;L^1(\Bbb{R}^d))$-norm of the error goes to zero as $(\Delta x)^{1/2}$ when the discretization parameter $\Delta x$ goes to zero. Moreover, we show that nonconsistent schemes can converge at optimal rates of $(\Delta x)^{1/2}$ because (i) the conservation form of the schemes and (ii) the so-called consistency of the numerical fluxes allow the regularity properties of the approximate solution to compensate for their lack of consistency.
Piecewise smooth subdivision surfaces with normal control
Authors: Henning Biermann, Adi Levin, Denis Zorin
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

In this paper we introduce improved rules for Catmull-Clark and Loop subdivision that overcome several problems with the original schemes, namely, lack of smoothness at extraordinary boundary vertices and folds near concave corners. In addition, our approach to rule modification allows the generation of surfaces with prescribed normals, both on the boundary and in the interior, which considerably improves control of the shape of surfaces.
Load-reuse analysis: design and evaluation
Authors: Rastislav Bodík, Rajiv Gupta, Mary Lou Soffa
Venue: ACM SIGPLAN Notices (1999)

Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the results of prior memory accesses. This paper develops a load-reuse analysis and designs a method for evaluating its precision.In designing the analysis, we aspire for completeness---the goal of exposing all reuse that can be harvested by a subsequent program transformation. For register promotion, a suitable transformation is partial redundancy elimination (PRE). To approach the ideal goal of PRE-completeness, the load-reuse analysis is phrased as a data-flow problem on a program representation that is path-sensitive, as it detects reuse even when it originates in a different instruction along each control flow path. Furthermore, the analysis is comprehensive, as it treats scalar, array and pointer-based loads uniformly.In evaluating the analysis, we compare it with an ideal analysis. By observing the run-time stream of memory references, we collect all PRE-exploitable reuse and treat it as the ideal analysis performance. To compare the (static) load-reuse analysis with the (dynamic) ideal reuse, we use an estimator algorithm that computes, given a data-flow solution and a program profile, the dynamic amount of reuse detected by the analysis. We developed a family of estimators that differ in how well they bound the profiling error inherent in the edge profile. By bounding the error, the estimators offer a precise and practical method for determining the run-time optimization benefit.Our experiments show that about 55% of loads executed in Spec95 exhibit reuse. Of those, our analysis exposes about 80%.
The surprising dynamics of a simple year 2000 bug
Authors: Lutz Prechelt
Venue: ACM SIGSOFT Software Engineering Notes (1999)

These are the reactions (and an analysis of their reasons) of a very simple program containing a rather simple form of century-dependent code. These reactions are extremely surprising and emerge from an interesting daisy-chain of effects.
A Collaborative Environment for Authoring Large Knowledge Bases
Authors: Peter D. Karp, Vinay K. Chaudhri, Suzanne M. Paley
Venue: Journal of Intelligent Information Systems (1999)

Collaborative knowledge base (KB) authoring environments are critical for the construction of high-performance KBs. Such environments must support rapid construction of KBs by a collaborative effort of teams of knowledge engineers through reuse of existing knowledge and software components. They should support the manipulation of knowledge by diverse problem-solving engines even if that knowledge is encoded in different languages and by different researchers. They should support large KBs and provide a scalable and interoperable development infrastructure. In this paper, we present an environment that satisfies many of these goals.We present an architecture for scalable frame representation systems (FRSs). The Generic Frame Protocol (GFP) provides infrastructure for reuse of software components. It is a procedural interface to frame representation systems that provides a common means of accessing and modifying frame KBs. The Generic KB Editor (GKB-EDITOR) provides graphical KB browsing, editing, and comprehension services for large KBs. Scalability of loading and saving time is provided by a storage system (PERK) which submerges a database management system in an FRS. Multi-user access is controlled through a collaboration subsystem that uses a novel optimistic concurrency control algorithm. All the results have been implemented and tested in the development of several real KBs.
Dynamic Routing and Operational Controls in Workflow Management Systems
Authors: Akhil Kumar, J. Leon Zhao
Venue: Management Science (1999)

Businesses around the world are paying more attention to process management and process automation to improve organizational efficiency and effectiveness. In this paper, we describe a general framework for implementing dynamic routing and operational control mechanisms in Workflow Management Systems (WMSs). The framework consists of three techniques: workflow control tables, sequence constraints, and event-based workflow management rules. Our approach offers several unique features that are missing in commercial workflow management systems: (1) it provides more flexibility in process modeling and control; (2) it permits rework on an ad hoc basis; (3) it handles exceptions to routing and operational controls; and (4) it exploits parallelism to increase system throughput and response time. Finally, the workflow management techniques are applied to the case of consumer loan management and compared with other approaches based on static routing.
On Singularities of a Boundary of the Stability Domain
Authors: Alexei A. Mailybaev, Alexander P. Seyranian
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

This paper deals with the study of generic singularities of a boundary of the stability domain in a parameter space for systems governed by autonomous linear differential equations $\dot y=Ay$ or x(m) + a1x(m-1) + . . . + amx=0. It is assumed that elements of the matrix A and coefficients of the differential equation of mth order smoothly depend on one, two, or three real parameters. A constructive approach allowing the geometry of singularities (orientation in space, magnitudes of angles, etc.) to be determined with the use of tangent cones to the stability domain is suggested. The approach allows the geometry of singularities to be described using only first derivatives of the coefficients ai of the differential equation or first derivatives of the elements of the matrix A with respect to problem parameters with its eigenvectors and associated vectors calculated at the singular points of the boundary. Two methods of study of singularities are suggested. It is shown that they are constructive and can be applied to investigate more complicated singularities for multiparameter families of matrices or polynomials. Two physical examples are presented and discussed in detail.
Statistical Condition Estimation for Linear Least Squares
Authors: C. S. Kenney, A. J. Laub, M. S. Reese
Venue: SIAM Journal on Matrix Analysis and Applications (1998)

Statistical condition estimation is applied to the linear least squares problem. The method obtains componentwise condition estimates via the Fr&eacute;chet derivative. A rigorous statistical theory exists that determines the probability of accuracy in the estimates. The method is as computationally efficient as normwise condition estimation methods, and it is easily adapted to respect structural constraints on perturbations of the input data. Several examples illustrate the method.
SNMP&rsquo;s Remote Monitoring MIB
Authors: Nathan J. Muller
Venue: International Journal of Network Management (1996)

The ability to monitor the performance of remote LAN segments has been made easier with SNMP&rsquo;s Remote Monitoring Management Information Base &lpar;RMON MIB&rpar; standard.
Nodose version 2.0
Authors: Brad Adelberg, Matthew Denny
Venue: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (1999)

This paper describes a tool, called Nodose, we have developed to expedite the creation of robust wrappers. Nodose allows non-programmers to build components that can convert data from the source format to XML or another generic format. Further, the generated code performs a set of statistical checks at runtime that attempt to find extraction errors before they are propogated back to users.
A generic tool set for application specific processor architectures
Authors: Frank Engel, Johannes Nührenberg, Gerhard P. Fettweis
Venue: Proceedings of the eighth international workshop on Hardware/software codesign (2000)

Retargetability allows an easy adoption of a simulator on different processor architectures without a time consuming redesign of all tools. This is evident for an efficient HW/SW codesign.In this paper we describe a tool set for fast and easy simulation of processor architectures based on a retargetable simulator core. This approach helps to reduce the development time for designing and validating System-on-a-chip (SoC) applications based on a processor core. The use of ANSIC avoids an expensive development of a modeling language.Our main focus in this paper is on conceptual decisions we made and on the structure of the tool set.
File Assignment in Parallel I/O Systems with Minimal Variance of Service Time
Authors: Lin-Wen Lee, Peter Scheuermann, Radek Vingralek
Venue: IEEE Transactions on Computers (2000)

We address the problem of assigning nonpartitioned files in a parallel I/O system where the file accesses exhibit Poisson arrival rates and fixed service times. We present two new file assignment algorithms based on open queuing networks which aim at minimizing simultaneously the load balance across all disks, as well as the variance of the service time at each disk. We first present an off-line algorithm, Sort Partition, which assigns to each disk files with similar access time. Next, we show that, assuming that a perfectly balanced file assignment can be found for a given set of files, Sort Partition will find the one with minimal mean response time. We then present an on-line algorithm, Hybrid Partition, that assigns groups of files with similar service times in successive intervals while guaranteeing that the load imbalance at any point does not exceed a certain threshold. We report on synthetic experiments which exhibit skew in file accesses and sizes and we compare the performance of our new algorithms with the vanilla greedy file allocation algorithm.
Proximity in Arrangements of Algebraic Sets
Authors: J. H. Rieger
Venue: SIAM Journal on Computing (1999)

Let X be an arrangement of n algebraic sets Xi in d-space, where the Xi are either parametrized or zero-sets of dimension $0\le m_i\le d-1$. We study a number of decompositions of d-space into connected regions in which the distance-squared function to X has certain invariances. Each region is contained in a single connected component of the complement of the bifurcation set $\cB$ of the family of distance-squared functions or of certain subsets of $\cB$. The decompositions can be used in the following proximity problems: given some point, find the k nearest sets Xi in the arrangement, find the nearest point in X, or (assuming that X is compact) find the farthest point in X and hence the smallest enclosing $(d-1)$-sphere. We give bounds on the complexity of the decompositions in terms of n, d, and the degrees and dimensions of the algebraic sets Xi.
VLSI layout and packaging of butterfly networks
Authors: Chi-Hsiang Yeh, Behrooz Parhami, E. A. Varvarigos, H. Lee
Venue: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures (2000)

We present a scheme for optimal VLSI layout and packaging of butterfly networks under the Thompson model, the multilayer grid model, and the hierarchical layout model. We show that when L layers of wires are available, an N-node butterfly network can be laid out with area 4N2/L2 log22 N + o (N2/L2 log2 N), maximum wire length 2N/L log2 N + o (N/L log N), and volume 4N2/L log22 N + o (N2/L log2 N) , under the multilayer 2-D grid model, where only one active layer (for network nodes) is required and L layers of wires are available. Our layout scheme allows us to partition an N-node butterfly network into &THgr;(N1-1/l N)-node clusters with an average of dic &ap; 4l-4/log2 N (=O(1/log N) for any constant integer l) inter-cluster links per node, leading to optimal layout and packaging at the same time under the hierarchical layout model. The scalability of our layouts are optimal in that we can allow each of O(N/ log N) nodes to occupy an area as large as o (N/L2 log N) and each of the remaining N - o(N) network nodes to occupy an area as large as o (N/L2 log2 N), without increasing the leading constants of layout area, volume, or maximum wire length.
Numerical Methods for Finding Clustersolutions of Optimal Control Problems
Authors: Luhan Chuang, I. Norman Katz
Venue: SIAM Journal on Scientific Computing (1998)

Obtaining the value function associated with an optimal control problem is an important part of solving the control problem. It is known that the value function may be not a classical solution but is always a viscosity solution of the Hamilton--Jacobi--Bellman (HJB) equation associated with the control problem. This means that the value function is not obtained from the HJB equation directly, but may be obtained by solving two viscosity HJB inequalities. Essentially nonoscillatory (ENO) upwind finite difference methods for solving the HJB inequalities have been developed. They determine the upwind direction and the numerical viscosity by checking all possible convecting velocities associated with the super- or subdifferentials. This leads to high computational cost. In order to lower the computational cost, we develop ENO-upwind finite difference methods for finding a generalized solution called a clustersolution of the HJB equation. These numerical methods determine the upwind direction and the numerical viscosity more simply by checking the mean value of a generalized gradient called the clusterdifferential at a point. Clustersolutions and clusterdifferentials have been defined in earlier papers. Some numerical results are presented.