ppxscal/embedding_network huggingface dataset:
Bounds on the shared memory requirements for long-lived adaptive objects (extended abstract)
Authors: Yehuda Afek, Pazi Boxer, Dan Touitou
Venue: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (2000)

In this paper we prove: For any constant d there is a large enough n such that there is no long-lived adaptive implementation of collect or renaming in the read write model with n processes that uses d or less MWMR registers. In other words, there is no implementation of a long-lived and adaptive renaming or collect object in the atomic read/write model that uses O(1) multi-writer-multi-reader registers and any number of single-writer-multi-reader registers. In 1980 Burns and Lynch [1] proved that at least n multi-writer-multi-reader (MWMR) registers are necessary in any mutual exclusion algorithm that uses only MWMR registers (i.e., atomic registers). It is also relatively easy to see that any adaptive non-trivial algorithm uses at least one multi-writer-multi-reader (MWMR) register even when there are n single-writer-multi-reader (SWMR) registers. Here we extend the techniques of Burns and Lynch and prove that adaptive algorithms that use both SWMR and MWMR registers such as, collect and renaming, need in addition to the &OHgr;(n) SWMR registers a non-constant, F(n) number of MWMR registers.
Lazy group sifting for efficient symbolic state traversal of FSMs
Authors: Hiroyuki Higuchi, Fabio Somenzi
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper proposes lazy group sifting for dynamic variable re-ordering during state traversal. The proposed method relaxes the idea of pairwise grouping of present state variables and their corresponding next state variables. This is done to produce better variable orderings during image computation without causing BDD size blowup in the substitution of next state variables with present state variables at the end of image computation. Experimental results show that our approach is more robust in state traversal than the approaches that either unconditionally group variable pairs or never group them.
Uniform Stabilization of the Dynamic Elastica by Boundary Feedback
Authors: Kazuho Ito
Venue: SIAM Journal on Control and Optimization (1999)

It is proved that the dynamic elastica, which is a nonlinear model describing the large deflecting motion of an inextensible beam, can be uniformly exponentially stabilized by boundary velocity feedback.
Stack and Queue Layouts of Directed Acyclic Graphs: Part I
Authors: Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk
Venue: SIAM Journal on Computing (1999)

Stack layouts and queue layouts of undirected graphs have been used to model problems in fault-tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags). A stack layout of a dag is similar to a stack layout of an undirected graph, with the additional requirement that the nodes of the dag be in some topological order. A queue layout is defined in an analogous manner. The stacknumber ( queuenumber) of a dag is the smallest number of stacks (queues) required for its stack layout (queue layout). In this paper, bounds are established on the stacknumber and queuenumber of two classes of dags: tree dags and unicyclic dags. In particular, any tree dag can be laid out in 1 stack and in at most 2 queues; and any unicyclic dag can be laid out in at most 2 stacks and in at most 2 queues. Forbidden subgraph characterizations of 1-queue tree dags and 1-queue cycle dags are also presented. Part II of this paper presents algorithmic results---in particular, linear time algorithms for recognizing 1-stack dags and 1-queue dags and proof of NP-completeness for the problem of recognizing a 4-queue dag and the problem of recognizing a 9-stack dag.
Integrated Design and Test of Mixed-Signal Circuits
Authors: Nur Engin, Hans G. Kerkhoff, Ronald J. W. T. Tangelder, Han Speek
Venue: Journal of Electronic Testing: Theory and Applications (1999)

In this paper, the integration of design and test flows for mixed-signal circuits is discussed. The aim is to decrease test generation and debugging costs and time-to-market for the analogue blocks in mixed-signal circuits. A tool developed in order to automate the data sharing between design and test environments is described and the functionality of this tool is explained. The generation of a test plan consists of the selection of the separate test functions and addition of commands for control signal generation and tester routing. The usage of design data for each of these functions is explained and the tool is evaluated in the design and testing of a mixed-signal demonstrator circuit. Results from this experience are discussed.
A semantics for complex objects and approximate queries
Authors: Peter Buneman, Susan Davidson, Aaron Watters
Venue: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1988)

A new definition of complex objects is introduced which provides a denotation for incomplete tuples as well as partially described sets. Set values are &ldquo;sandwiched&rdquo; between &ldquo;complete&rdquo; and &ldquo;consistent&rdquo; descriptions (representing the Smyth and Hoare powerdomains respectively), allowing the maximal values to be arbitrary subsets of maximal elements in the domain of the set. We also examine the use of rules in defining queries over such objects.
Dynamic power management using adaptive learning tree
Authors: Eui-Young Chung, Luca Benini, Giovanni De Micheli
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

Dynamic Power Management (DPM) is a technique to reduce power consumption of electronic systems by selectively shutting down idle components. The quality of the shutdown control algorithm (power management policy) mostly depends on the knowledge of user behavior, which in many in many cases is initially unknown or non-stationary. For this reason, DPM policies should be capable of adapting to changes in user behavior. In this paper, we present a novel DPM scheme based on idle period clustering and adaptive learning trees. We also provide a design guide for applying our technique to components with multiple sleep states. Experimental results show that our technique outperforms other advanced DPM schemes as well as simple time-out policies. The proposed approach shows little deviation of efficiency for various workloads having different characteristics, while other policies show that their efficiency changes drastically depending on the trace data characteristics. Furthermore, experimental evidence indicates that our workload learning algorithm is stable and has fast convergence.
The Invisible World of Intermediaries: A Cautionary Tale
Authors: Kate Ehrlich, Debra Cash
Venue: Computer Supported Cooperative Work (1999)

Many observers consider traditional intermediaries such as brokers, lenders and salespersons anachronisms in a world where consumers can communicate directly with providers of products and services over computer networks. Under the same rubric, information mediators such as journalists, editors, librarians and customer support representatives are being targeted for elimination. Drawing on our ethnographically-informed studies of customer support analysts and librarians, we demonstrate that the expertise and experience of intermediaries is often invisible &ndash; to the consumer, to the organization in which these intermediaries work, and even to the intermediaries&lsquo; managers. The valuable services provided by intermediaries are not made unnecessary by end-user access. We argue for a richer understanding of intermediation, and a reallocation of functions and roles in which &rsquo;&rsquo;new intermediaries&lsquo;&lsquo; &ndash; people, software or a combination of the two &ndash; aggregate, personalize and assure the quality of information.
Exploring bimanual camera control and object manipulation in 3D graphics interfaces
Authors: Ravin Balakrishnan, Gordon Kurtenbach
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

We explore the use of the non-dominant hand to control a virtual camera while the dominant hand performs other tasks in a virtual 3D scene. Two experiments and an informal study are presented which evaluate this interaction style by comparing it to the status-quo unimanual interaction. In the first experiment, we find that for a target selection task, performance using the bimanual technique was 20% faster. Experiment 2 compared performance in a more complicated object docking task. Performance advantages are shown, however, only after practice. Free-form 3D painting was explored in the user study. In both experiments and in the user study participants strongly preferred the bimanual technique. The results also indicate that user preferences concerning bimanual interaction may be driven by factors other than simple time-motion performance advantages.
M-Convex Function on Generalized Polymatroid
Authors: Kazuo Murota, Akiyoshi Shioura
Venue: Mathematics of Operations Research (1999)

The concept of M-convex function, introduced by Murota (1996), is a quantitative generalization of the set of integral points in an integral base polyhedron as well as an extension of valuated matroid of Dress and Wenzel (1990). In this paper, we extend this concept to functions on generalized polymatroids with a view to providing a unified framework for efficiently solvable nonlinear discrete optimization problems.
Global Block-Similarity and Pole Assignment of Class Cp
Authors: Josep Ferrer, Ferran Puerta
Venue: SIAM Journal on Matrix Analysis and Applications (1998)

Starting from the existence of a Cp-basis for any Cp-family of subspaces having constant dimension, we construct a Brunovsky basis of class Cp for a Cp-family of pairs of matrices having constant Brunovsky type. We derive a global pole assignment theorem for such kinds of pairs. In all the cases we assume that the manifold of parameters is contractible.
A New Convergence Proof for Finite Volume Schemes Using the Kinetic Formulation of Conservation Laws
Authors: Michael Westdickenberg, Sebastian Noelle
Venue: SIAM Journal on Numerical Analysis (2000)

We give a new convergence proof for finite volume schemes approximating scalar conservation laws. The main ingredients of the proof are the kinetic formulation of scalar conservation laws, a discrete entropy inequality, and the velocity averaging technique.
Why? When an otherwise successful intervention fails
Authors: Michael McCracken, Robert Waters
Venue: ACM SIGCSE Bulletin (1999)

Problem-Based Learning (PBL) has been an effective technique in developing self-directed learning and problem-solving skills in students --- especially in the medical school environment. This paper looks at some preliminary results of an ethnographic study of students in a software development environment trying to use PBL. Our findings indicate that students need explicit training in group dynamics, students tend to rely excessively on existing knowledge, and they focus almost solely on product-related issues versus process-related ones. We then present some suggested improvements and future planned research.
A framework for comparison of update semantics
Authors: Marianne Winslett
Venue: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1988)

Scattered across the scientific literature of three or more disciplines appears a profusion of proposals for semantics of updates to logical theories. Because no previous work has compared these proposals with one another, the merits and demerits of the various approaches are not well known. Since the semantics differ from one another in systematic ways, it is possible to generalize from existing proposals and speak of the properties of classes of update semantics. In this paper we suggest a two-dimensional taxonomy for characterizing semantics, and describe the properties inherent to the classes implicit therein. Our discussion includes measurement of the computational complexity of the different classes.
Incremental maintenance of recursive views using relational calculus/SQL
Authors: Guozhu Dong, Jianwen Su
Venue: ACM SIGMOD Record (2000)

Views are a central component of both traditional database systems and new applications such as data warehouses. Very often the desired views (e.g. the transitive closure) cannot be defined in the standard language of the underlying database system. Fortunately, it is often possible to incrementally maintain these views using the standard language. For example, transitive closure of acyclic graphs, and of undirected graphs, can be maintained in relational calculus after both single edge insertions and deletions. Many such results have been published in the theoretical database community. The purpose of this survey is to make these useful results known to the wider database research and development community. There are many interesting issues involved in the maintenance of recursive views. A maintenance algorithm may be applicable to just one view, or to a class of views specified by a view definition language such as Datalog. The maintenance algorithm can be specified in a maintenance language of different expressiveness, such as the conjunctive queries, the relational calculus or SQL. Ideally, this maintenance language should be less expensive than the view definition language. The maintenance algorithm may allow updates of different kinds, such as just single tuple insertions, just single tuple deletions, special set-based insertions and/or deletions, or combinations thereof. The view maintenance algorithms may also need to maintain auxiliary relations to help maintain the views of interest. It is of interest to know the minimal arity necessary for these auxiliary relations and whether the auxiliary relations are deterministic. While many results are known about these issues for several settings, many further challenging research problems still remain to be solved.
Temporal Pattern Matching Using Fuzzy Templates
Authors: Andrew Lowe, Richard W. Jones, Michael J. Harrison
Venue: Journal of Intelligent Information Systems (1999)

The identification of temporal patterns plays an important role in many medical diagnostic applications. Template systems that identify events and landmark points directly from time-series information have been shown to work well in various applications and in various forms. However, few such systems directly account for the uncertainty and vagueness often associated with medical decision-making. This paper describes a template system that uses fuzzy set theory to provide a consistent mechanism of accounting for uncertainty in the existence of events, as well as vagueness in their starting times and durations. Fuzzy set theory allows the creation of fuzzy templates from linguistic rules. The fuzzy template system that is introduced in this paper can accommodate multiple time signals, relative or absolute trends, and obviates the need to also design a regression formula for pattern matching (a requirement in non-fuzzy template systems)&mdash;the system automatically generates a normalised &lsquo;goodness of fit&rsquo; score. Our target application for the fuzzy template system is anaesthesia monitoring. Initial testing using both simulated and recorded patient data has been encouraging. Results are presented showing the diagnosis using various temporal relationships of a number of problems.
Mixed Finite Element Analysis and Numerical Solitary Solution for the RLW Equation
Authors: Zhendong Luo, Ruxun Liu
Venue: SIAM Journal on Numerical Analysis (1998)

In this paper a mixed finite element (MFE) formulation is proposed for the 1-D regularized long wave (RLW) equation $u_t+auu_x-\delta u_{xxt}=0$. The existence of its mixed generalized solution and semidiscrete and fully discrete mixed finite element solutions is proved, error estimates based on energy methods are given, and finally, results of numerical experiments comparing this formulation with a Galerkin method based on cubic splines are also given.
Utilization Bounds for N-Processor Rate MonotoneScheduling with Static Processor Assignment
Authors: Dong-Ik Oh, T. P. Bakker
Venue: Real-Time Systems (1998)

We consider the schedulability of a set of independent periodic tasks under fixed priority preemptive scheduling on homogeneous multiprocessor systems. Assuming there is no task migration between processors and each processor schedules tasks preemptively according to fixed priorities assigned by the Rate Monotonic policy, the scheduling problem reduces to assigning the set of tasks to disjoint processors in such a way that the Monotonic policy, the scheduling problem reduces to assigning the set of tasks to disjoint processors in such a way that the schedulability of the tasks on each processor can be guaranteed. In this paper we show that the worst case achievable utilization for such systems is between n(2^{1/2}-1) and (n+1)/(1+2^{1/(n+1)}), where n stands for the number of processors. The lower bound represents 41 percent of the total system capacity and the upper bound represents 50 to 66 percent depending on n. Practicality of the lower bound is demonstrated by proving it can be achieved using a First Fit scheduling algorithm.
Compaan: deriving process networks from Matlab for embedded signal processing architectures
Authors: Bart Kienhuis, Edwin Rijpkema, Ed Deprettere
Venue: Proceedings of the eighth international workshop on Hardware/software codesign (2000)

This paper presents the Compaan tool that automatically transforms a nested loop program written in Matlab into a process network specification. The process network model of computation fits better with the new emerging kind of embedded architectures that use coprocessors. Process networks can describe both fine-grained and coarse-grained parallelism, making the mapping of the applications easier.
Teaching very large instruction word architectures
Authors: John Impagliazzo
Venue: ACM SIGCSE Bulletin (1999)

The VLIW model describes a philosophy whereby the compiler organizes several nondependent machine operations into the same instruction word. Some features of this form of architecture are illustrated and certain strategies on presenting this topic to students are shown.
How to Sort N Items Using a Sorting Network of Fixed I/O Size
Authors: Stephan Olariu, M. Christina Pinotti, S. Q. Zheng
Venue: IEEE Transactions on Parallel and Distributed Systems (1999)

Sorting networks of fixed I/O size p have been used, thus far, for sorting a set of p elements. Somewhat surprisingly, the important problem of using such a sorting network for sorting arbitrarily large data sets has not been addressed in the literature. Our main contribution is to propose a simple sorting architecture whose main feature is the pipelined use of a sorting network of fixed I/O size p to sort an arbitrarily large data set of N elements. A noteworthy feature of our design is that no extra data memory space is required, other than what is used for storing the input. As it turns out, our architecture is feasible for VLSI implementation and its time performance is virtually independent of the cost and depth of the underlying sorting network. Specifically, we show that by using our design N elements can be sorted in \Theta({\frac Np} \log {\frac Np}) time without memory access conflicts. Finally, weshow how to use an AT^2-optimal sorting network of fixed I/O size p to construct a similar architecture that sorts N elements in \Theta({\frac N{p}} \log {\frac N{p\log p}}) time.
Understanding the backward slices of performance degrading instructions
Authors: Craig B. Zilles, Gurindar S. Sohi
Venue: ACM SIGARCH Computer Architecture News (2000)

For many applications, branch mispredictions and cache misses limit a processor's performance to a level well below its peak instruction throughput. A small fraction of static instructions, whose behavior cannot be anticipated using current branch predictors and caches, contribute a large fraction of such performance degrading events. This paper analyzes the dynamic instruction stream leading up to these performance degrading instructions to identify the operations necessary to execute them early. The backward slice (the subset of the program that relates to the instruction) of these performance degrading instructions, if small compared to the whole dynamic instruction stream, can be pre-executed to hide the instruction's latency. To overcome conservative dependance assumptions that result in large slices, speculation can be used, resulting in speculative slices. This paper provides an initial characterization of the backward slices of L2 data cache misses and branch mispredictions, and shows the effectiveness of techniques, including memory dependence prediction and control independence, for reducing the size of these slices. Through the use of these techniques, many slices can be reduced to less than one tenth of the full dynamic instruction stream when considering the 512 instructions before the performance degrading instruction.
Overload Management in Real-Time Control Applications Using m,k $(m,k)$-Firm Guarantee
Authors: Parameswaran Ramanathan
Venue: IEEE Transactions on Parallel and Distributed Systems (1999)

Tasks in a real-time control application are usually periodic and they have deadline constraints by which each instance of a task is expected to complete its computation, even in the adverse circumstances caused by component failures. Techniques to recover from processor failures often involve a reconfiguration in which all tasks are assigned to fault-free processors. This reconfiguration may result in processor overload where it is no longer possible to meet the deadlines of all tasks. In this paper, we discuss an overload management technique which discards selected task instances in such a way that the performance of the control loops in the system remain satisfactory even after a failure. The technique is based on the rationale that real-time control applications can tolerate occasional misses of the control law updates, especially if the control law is modified to account for these missed updates. The paper devises a scheduling policy which deterministically guarantees when and where the misses will occur. The paper also proposes a methodology for modifying the control law to minimize the deterioration in the control system behavior as a result of these missed control law updates.
Design Wizards and Visual Programming Environments for GenVoca Generators
Authors: Don Batory, Gang Chen, Eric Robertson, Tao Wang
Venue: IEEE Transactions on Software Engineering (2000)

Domain-specific generators will increasingly rely on graphical languages for declarative specifications of target applications. Such languages will provide front-ends to generators and related tools to produce customized code on demand. Critical to the success of this approach will be domain-specific design wizards, tools that guide users in their selection of components for constructing particular applications. In this paper, we present the P3 ContainerStore graphical language, its generator, and design wizard.
Thinking parallel: the process of learning concurrency
Authors: Mordechai Ben-Ari, Yifat Ben-David Kolikant
Venue: ACM SIGCSE Bulletin (1999)

This paper describes a course in concurrent and distributed computing for high school students and empirical research that was done to study students' conceptions and attitudes. We found that both their conceptions and their work methods evolved during course to the point that they were able to successfully develop algorithms and to prove their correctness. Students initially found the course extremely challenging but eventually came to appreciate its relevance and its contribution to improving their cognitive skills.