ppxscal/embedding_network huggingface dataset:
A review and applications of information ecologies
Authors: Dickie Selfe, Dawn Hayden
Venue: ACM Journal of Computer Documentation (JCD) (2000)

This review of Information Ecologies notes how well Nardi and O'Day's biological approach fits with articulation theory (in rhetoric), since both encourage spelling out alternatives and consequences so as to avoid oversimplified technology choices. A closer look at the relevance of their case studies to promoting suitable technological improvements in K-12 education, however, finds concerns (about adequate social rewards and sustainability) along with promising parallels.
Deterministic BIST with Multiple Scan Chains
Authors: Gundolf Kiefer, Hans-Joachim Wunderlich
Venue: Journal of Electronic Testing: Theory and Applications (1999)

A deterministic BIST scheme for circuits with multiple scan paths is presented. A procedure is described for synthesizing a pattern generator which stimulates all scan chains simultaneously and guarantees complete fault coverage.The new scheme may require less chip area than a classical LFSR-based approach while better or even complete fault coverage is obtained at the same time.
Separate computation of alias information for reuse
Authors: Mary Jean Harrold, Gregg Rothermel
Venue: ACM SIGSOFT Software Engineering Notes (1996)

Interprocedural dataflow information is useful for many software testing and analysis techniques, including dataflow testing, regression testing, program slicing and impact analysis. For programs with aliases, these testing and analysis techniques can yield invalid results, unless the dataflow information accounts for aliasing effects. Recent research provides algorithms for performing interprocedural dataflow analysis in the presence of aliases; however, these algorithms are expensive, and achieve precise results only on complete programs. This paper presents an algorithm for performing alias analysis on incomplete programs, that lets individual software components such as library routines, subroutines, or subsystems be independently analyzed. The paper also presents an algorithm for reusing the results of this separate analysis when linking the individual software components with calling modules. The primary advantage of our algorithms is that they let us analyze frequently used software components, such as library routines or classes, independently, and reuse the results of that analysis when analyzing calling programs, without incurring the expense of completely reanalyzing each calling program.
Disbursed control computer architecture
Authors: Benjamin Driker
Venue: ACM SIGARCH Computer Architecture News (1999)

Disbursed Control Computer Architecture, comprising totally pipelined computer, a number of components interconnected in a pipeline:Control storage for control and input-output address maker, plurality of other control storage for corresponding plurality of data address makers, and another control storage for operators and operational registers.Any mentioned control storage contains, as a part of a program, a plurality of appropriate section of a control word. Control and input-output address maker issues control address to all mentioned control storage and receives its own section of control word.Plurality of data address makers receives plurality of corresponding sections of control word and issue corresponding plurality of data addresses to operands and results storage, which, in turn, is issuing and receiving data to and from operational registers and bus joint and to condition and status logic.Each clock cycle, new control address initiates new control word, sections of which contain all commands and addresses for enactment of next control and input-output address, by control and input-output address maker, and of next plurality of data addresses, by plurality of data address makers.Following in pipeline, new commands and data submitted to operators and operational registers direct performance of new primary (originated by the task) operations every clock cycle.Several clock cycles are allotted along pipeline to data address makers, allowing the most complex address preparations.Also comprising: interconnect of totally pipelined computer with other computers, operating via input-output devices with separate sending and receiving ports.
Observations Preprocessing and Quantization for Nonlinear Filters
Authors: Nigel J. Newton
Venue: SIAM Journal on Control and Optimization (2000)

Methods of preprocessing the observations for nonlinear filters are investigated, the aim being to reduce the computational labor involved in their implementation. An example of preprocessing is quantization, which involves the replacement of real-valued observation samples by discrete values. Because the resulting likelihood functions have finite support, they can be held in "look-up" tables kept in some type of rapid access memory, which renders their "real-time" evaluation trivial. Preprocessed observations of this sort carry less information than raw observations. This loss of information is characterized here for filters with substantially noisy observation samples by means of a functional central limit theorem. Among other things, this supplies an asymptotic, effective signal-to-noise ratio for preprocessed filters.Methods of optimizing preprocessing operations with respect to this quantified information loss are developed. In particular, optimal quantization thresholds are found for observations that are contaminated by Gaussian noise, and it is shown that the loss of information for quite coarse quantization schemes is small; for example, the asymptotic, effective signal-to-noise ratio for a filter with one-bit quantized observations is $2/\pi$ times that for the same filter with raw observations. Simulations on two examples demonstrate the validity of the asymptotic characterization, even when the observation samples are only modestly contaminated by noise.
On the Reversion of an Asymptotic Expansion and the Zeros of the Airy Functions
Authors: Bruce R. Fabijonas, F. W. J. Olver
Venue: SIAM Review (1999)

The general theories of the derivation of inverses of functions from their power series and asymptotic expansions are discussed and compared. The asymptotic theory is applied to obtain asymptotic expansions of the zeros of the Airy functions and their derivatives, and also of the associated values of the functions or derivatives. A Maple code is constructed to generate exactly the coefficients in these expansions. The only limits on the number of coefficients are those imposed by the capacity of the computer being used and the execution time that is available. The sign patterns of the coefficients suggest open problems pertaining to error bounds for the asymptotic expansions of the zeros and stationary values of the Airy functions.
Design and implementation of a software bridge with packet filtering and statistics collection functions
Authors: A. Khan, N. Al-Darwish, M. Guizani, M. Benten, H. Youssef
Venue: International Journal of Network Management (1997)

This article starts with the formulation of the complete design problem. Possible design strategies are then identified and adopted along with the reasons for adoption. Finally, the article describes the implementation of the proposed bridge. &copy; 1997 John Wiley & Sons, Ltd.
Real Solutions of the Equation $\Phi^t(A)=\frac1nJ_n$\protect\unboldmath
Authors: Zhang Xian, Yang Zhongpeng, Cao Chongguang
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

For nonsingular n x n matrices $A$, $\Phi (A)=A\circ A^{-T}$ ($\circ $ denotes the Hadamard product and A -T the inverse transpose, (A-1)T, of A) arises in mathematical control theory associated with chemical engineering design problems and in a matrix theoretic problem involving the relation between the diagonal entries and eigenvalues. For any positive integer t, we show that the equation $$ \Phi ^t(A)=\frac{1}{n}J_n $$ has at least 2t-1 and 2t mutually $\Phi $-distinct real solutions for the case n=4 and n> 4, respectively, and that these solutions can be determined by an inverted iteration. We also prove that the above equation has only one $\Phi $-distinct real solution {\scriptsize $(\begin{array}{cc} 1&1\\[-2pt] 1&-1 \end{array})$} for $t=1$ and has no real solutions for $t\ge 2$ when n=2. The above results answer the problem that has been proposed by Johnson and Shapiro in [ SIAM J. Algebraic Discrete Methods, 7 (1986), pp. 627--644]. When does the equation $\Phi (A)=A\circ A^{-T}=\frac{1}{n}J_n$ have a real solution?
Solution of Some Free Boundary Problems by Relaxation Schemes
Authors: J. Kacur
Venue: SIAM Journal on Numerical Analysis (1998)

A numerical method is proposed to solve a large number of free boundary problems modeled by degenerate doubly nonlinear parabolic, parabolic-elliptic equations and systems. The method is related to one proposed in [W. Jäger and J. Kacur, Math. Modeling Numer. Anal., 29 (1995), pp. 605--627] and is based on a nonstandard time discretization including two relaxation functions by means of which the diffusion degeneracies (slow and fast) are controlled.
An automata-theoretic approach to branching-time model checking
Authors: Orna Kupferman, Moshe Y. Vardi, Pierre Wolper
Venue: Journal of the ACM (JACM) (2000)

Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automata-theoretic techniques have long been thought to introduce an exponential penalty, making them essentially useless for model-checking. Recently, Bernholtz and Grumberg [1993] have shown that this exponential penalty can be avoided, though they did not match the linear complexity of non-automata-theoretic algorithms. In this paper, we show that alternating tree automata are the key to a comprehensive automata-theoretic framework for branching temporal logics. Not only can they be used to obtain optimal decision procedures, as was shown by Muller et al., but, as we show here, they also make it possible to derive optimal model-checking algorithms. Moreover, the simple combinatorial structure that emerges from the automata-theoretic approach opens up new possibilities for the implementation of branching-time model checking and has enabled us to derive improved space complexity bounds for this long-standing problem.
Classroom Note: A Simple Proof of the Leverrier--Faddeev Characteristic Polynomial Algorithm
Authors: Shui-Hung Hou
Venue: SIAM Review (1998)

A simple formula is established that relates the trace of the resolvent with the characteristic polynomial of a matrix. This will lead to a novel and elegant proof of the recursive relations that compute the coefficients of the characteristic polynomial used in the Leverrier--Faddeev method.
A rate selection algorithm for quantized undithered dynamic supply voltage scaling (poster session)
Authors: Lama H. Chandrasena, Michael J. Liebelt
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

In this paper we propose a novel rate calculation algorithm called Quantized Rate Selection (QRS) for quantized undithered dynamic supply voltage scaling (DSVS) systems. The algorithm monitors the total buffered workload, and where possible selects a rate value equal to a quantized rate value. At quantized rate values, energy dissipation of quantized DSVS systems approaches continuous voltage level DSVS systems. Our experimental work on FMIDCT computation using nine video sequences and a 4-level quantized undithered system shows that additional energy savings of 1.4% to 18.5% can be achieved from QRS, compared to the existing averaging technique.
External Boundary Conditions for Three-Dimensional Problems of Computational Aerodynamics
Authors: Semyon V. Tsynkov
Venue: SIAM Journal on Scientific Computing (1999)

We consider an unbounded steady-state flow of viscous fluid over a three-dimensional finite body or configuration of bodies. For the purpose of solving this flow numerically, we discretize the governing equations (Navier--Stokes) on a finite-difference grid. Prior to the discretization, we obviously need to truncate the original unbounded domain by introducing an artificial computational boundary at a finite distance from the body; otherwise, the number of discrete variables will not be finite. This artificial boundary is typically the external boundary of the domain covered by the grid.The flow problem (both continuous and discretized) formulated on the finite computational domain is clearly subdefinite unless supplemented by some artificial boundary conditions (ABCs) at the external computational boundary. In this paper, we present an innovative approach to constructing highly accurate ABCs for three-dimensional flow computations. The approach extends our previous technique developed for the two-dimensional case; it employs the finite-difference counterparts to Calderón's pseudodifferential boundary projections calculated in the framework of the difference potentials method (DPM) of Ryaben'kii. The resulting ABCs appear spatially nonlocal but are particularly easy to implement along with the existing flow solvers.The new boundary conditions have been successfully combined with the NASA-developed production code TLNS3D and used for the analysis of wing-shaped configurations in subsonic and transonic flow regimes. As demonstrated by the computational experiments and comparison with the standard local methods, the DPM-based ABCs allow one to greatly reduce the size of the computational domain while still maintaining high accuracy of the numerical solution. Moreover, they may provide for a noticeable speedup of multigrid convergence.
Load balancing for conservative simulation on shared memory multiprocessor systems
Authors: Boon Ping Gan, Yoke Hean Low, Sanjay Jain, Stephen J. Turner, Wentong Cai, Wen Jing Hsu, Shell Ying Huang
Venue: Proceedings of the fourteenth workshop on Parallel and distributed simulation (2000)

Load balancing is a crucial factor in achieving good performance for parallel discrete event simulations. In this paper, we present a load balancing scheme that combines both static partitioning and dynamic load balancing. The static partitioning scheme maps simulation objects to logical processes before simulation starts while the dynamic load balancing scheme attempt to balance the load during runtime. The static scheme involves two steps. First, the simulation objects that contribute to small lookahead are merged together by using a merging algorithm. Then a partitioning algorithm is applied. The merging is needed to ensure a consistent performance for our dynamic scheme. Our dynamic scheme is tailor-made for an asynchronous simulation protocol that does not rely on null messages. The performance study on a supply-chain simulation shows that the partitioning algorithm and dynamic load balancing are important in achieving good performance.
On Minimal Realization Over a Finite Chain Ring
Authors: Graham Norton
Venue: Designs, Codes and Cryptography (1999)

Let R be a finite chain ring, e.g. a Galois ring. We give a compact recursive formula for a minimal realization of a finite R-sequence. In particular, we show how to obtain a monic minimal polynomial and a rational approximation of a finite R-sequence. We also show how to solve the classical key equation of Algebraic Coding Theory over R.
Selected Research Issues in Decision Support Databases
Authors: David Maier, Mary Edie Meredith, Leonard Shapiro
Venue: Journal of Intelligent Information Systems (1998)

A flurry of buzzwords awaits anyone investigating database technology for decision support: data warehouse, multidimensional and dimensional database, on-line analytical processing, star schema, slicing, dicing, drill-down and roll-up. We introduce the area via an example based on a long-ago project to design a repository on energy information for the US Department of Energy. Once we have introduced some terminology, we explore research issues associated with decision-support databases, including representation, modeling, metadata, architectures and query processing. The purpose of this paper is to provide researchers with the background they need to contribute to this area.
Reducing energy requirements for instruction issue and dispatch in superscalar microprocessors (poster session)
Authors: Kanad Ghose
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

Recent studies [MGK 98, Tiw 98] have confirmed that a significant amount of energy is dissipated in the process of instruction dispatching and issue in modern superscalar microprocessors. We propose a model for the energy dissipated by instruction dispatching and issuing logic in modern superscalar microprocessors and validate them through register level simulations and SPICE-measured dissipation coefficients from 0.5 micron CMOS layouts of relevant circuits. Alternative organizations are studied for instruction window buffers that result in energy savings of about 47% over traditional designs.
Congressional samples for approximate answering of group-by queries
Authors: Swarup Acharya, Phillip B. Gibbons, Viswanath Poosala
Venue: ACM SIGMOD Record (2000)

In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex decision support queries using precomputed summary statistics, such as samples. Decision support queries routinely segment the data into groups and then aggregate the information in each group (group-by queries). Depending on the data, there can be a wide disparity between the number of data items in each group. As a result, approximate answers based on uniform random samples of the data can result in poor accuracy for groups with very few data items, since such groups will be represented in the sample by very few (often zero) tuples. In this paper, we propose a general class of techniques for obtaining fast, highly-accurate answers for group-by queries. These techniques rely on precomputed non-uniform (biased) samples of the data. In particular, we propose congressional samples, a hybrid union of uniform and biased samples. Given a fixed amount of space, congressional samples seek to maximize the accuracy for all possible group-by queries on a set of columns. We present a one pass algorithm for constructing a congressional sample and use this technique to also incrementally maintain the sample up-to-date without accessing the base relation. We also evaluate query rewriting strategies for providing approximate answers from congressional samples. Finally, we conduct an extensive set of experiments on the TPC-D database, which demonstrates the efficacy of the techniques proposed.
Lurker demographics: counting the silent
Authors: Blair Nonnecke, Jenny Preece
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

As online groups grow in number and type, understanding lurking is becoming increasingly important. Recent reports indicate that lurkers make up over 90% of online groups, yet little is known about them. This paper presents a demographic study of lurking in email-based discussion lists (DLs) with an emphasis on health and software-support DLs. Four primary questions are examined. One, how prevalent is lurking, and do health and software-support DLs differ? Two, how do lurking levels vary as the definition is broadened from zero posts in 12 weeks to 3 or fewer posts in 12 weeks? Three, is there a relationship between lurking and the size of the DL, and four, is there a relationship between lurking and traffic level? When lurking is defined as no posts, the mean lurking level for all DLs is lower than the reported 90%. Health-support DLs have on average significantly fewer lurkers (46%) than software-support DLs (82%). Lurking varies widely ranging from 0 to 99%. The relationships between lurking, group size and traffic are also examined.
Optimal Rounding of Instantaneous Fractional Flows Over Time
Authors: Lisa Fleischer, James B. Orlin
Venue: SIAM Journal on Discrete Mathematics (2000)

A transshipment problem with demands that exceed network capacity can be solved by sending flow in several waves. How can this be done in the minimum number, T, of waves, and at minimum cost, if costs are piecewise linear convex functions of the flow? In this paper, we show that this problem can be solved using $\min\{ m,\log T,\ub{\Gamma}{U} \}$ maximum flow computations and one minimum (convex) cost flow computation. Here m is the number of arcs, $\Gamma$ is the maximum supply or demand, and U is the maximum capacity. When there is only one sink, this problem can be solved in the same asymptotic time as one minimum (convex) cost flow computation. This improves upon the previous best algorithm to solve the problem without costs by a factor of k. Our solutions start with a stationary fractional flow and use rounding to transform this into an integral flow. The rounding procedure takes O(n) time.
Econometric Estimation of a Continuous Time Macroeconomic Model of theUnited Kingdom with Segmented Trends
Authors: K. B. Nowman
Venue: Computational Economics (1998)

The exact Gaussian estimation of complicated higher order continuous time econometric models from discrete stock and flow data has only recently been feasible given recent advances in computing processing power. In this paper we estimate a second order continuous time macroeconomic model of the United Kingdom developed by Bergstrom, Nowman and Wymer (1992) recently. The model is extended to include segmented time trends and estimated using recently developed exact Gaussian estimation methods for continuous time econometric models.
A case for user-level dynamic page migration
Authors: Dimitrios S. Nikolopoulos, Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Jesús Labarta, Eduard Ayguadé
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

This paper presents user-level dynamic page migration, a runtime technique which transparently enables parallel programs to tune their memory performance on distributed shared memory multiprocessors, with feedback obtained from dynamic monitoring of memory activity. Our technique exploits the iterative nature of parallel programs and information available to the program both at compile time and at runtime in order to improve the accuracy and the timeliness of page migrations, as well as amortize better the overhead, compared to page migration engines implemented in the operating system. We present an adaptive page migration algorithm based on a competitive and a predictive criterion. The competitive criterion is used to correct poor page placement decisions of the operating system, while the predictive criterion makes the algorithm responsive to scheduling events that necessitate immediate page migrations, such as preemptions and migrations of threads. We also present a new technique for preventing page pingpong and a mechanism for monitoring the performance of page migration algorithms at runtime and tuning their sensitive parameters accordingly. Our experimental evidence on a SGI Origin2000 shows that unmodified OpenMP codes linked with our runtime system for dynamic page migration are effectively immune to the page placement strategy of the operating system and the associated problems with data locality. Furthermore, our runtime system achieves solid performance improvements compared to the IRIX 6.5.5 page migration engine, for single parallel OpenMP codes and multiprogrammed workloads.
On the Stabilization of a Flexible Beam with a Tip Mass
Authors: Francis Conrad, Ömer Morgül
Venue: SIAM Journal on Control and Optimization (1998)

We study the stability of a flexible beam that is clamped at one end and free at the other; a mass is also attached to the free end of the beam. To stabilize this system we apply a boundary control force at the free end of the beam. We prove that the closed-loop system is well-posed and is exponentially stable. We then analyze the spectrum of the system for a special case and prove that the spectrum determines the exponential decay rate for the considered case.