ppxscal/embedding_network huggingface dataset:
Collaborative Writing Is Hard to Support: A Field Study of Collaborative Writing
Authors: S. G. Tammaro, J. N. Mosier, N. C. Goodwin, G. Spitz
Venue: Computer Supported Cooperative Work (1997)

This paper documents the results of a field test of Instant Update, a collaborative writing tool by a geographically dispersed department at the MITRE Corporation. Thirty-six participants were given Instant Update software and free training and support in exchange for their cooperation with data collection. These participants spent a great deal of time writing and communicating with each other about their written work. They began the pilot test with enthusiasm, using Instant Update for many types of documents and anticipating many benefits. After three months of experience they rated the actual benefits they received from the software lower than they had expected. Their usage became much more refined. They continued to use it for some types of documents, but stopped for others. The collaborative writing software was used successfully to create joint documents that have a consistent format and are produced on a regular basis (such as weekly activity reports) and for documents that provide access to shared information (such as a vacation calendar). It was used less successfully for the production of documents that require a complex work flow and have a changing group of contributors. We concluded that although collaborative writing is difficult to support and the currently available collaborative writing tools need to be improved before they can meet the needs of most co-writers, they are adequate for some types of tasks. Documents that are well defined and are created by experienced users who can cooperate well can benefit from the currently available tools.
Hybrid slicing: integrating dynamic information with static analysis
Authors: Rajiv Gupta, Mary Lou Soffa, John Howard
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1997)

Program slicing is an effective techniqe for narrowing the focus of attention to the relevant parts of a program during the debugging process. However, imprecision is a problem in static slices, since they are based on all possible executions that reach a given program point rather than the specific execution under which the program is being debugged. Dynamic slices, based on the specific execution being debugged, are precise but incur high run-time overhead due to the tracing information that is collected during the program's execution. We present a hybrid slicing technique that integrates dynamic information from a specific execution into a static slice analysis. The hybrid sliceproduced is more precise that the static slice and less costly that the dynamic slice. The technique exploits dynamic information that is readily available during debugging&mdash;namely, breakpoint information and the dynamic call graph. This information is integrated into a static slicing analysis to more accurately estimate the potential paths taken by the program. The breakpoints and call/return points, used as reference points, divide the execution path into intervals. By associating each statement in the slice with an execution interval, hybrid slicing provides information as to when a statement was encountered during execution. Another attractive feature of our approach is that it allows the user to control the cost of hybrid slicing by limiting the amount of dynamic information used in computing the slice. We implemented the hybrid slicing technique to demonstrate the feasibility of our approach.
Library-less synthesis for static CMOS combinational logic circuits
Authors: S. Gavrilov, A. Glebov, S. Pullela, S. C. Moore, A. Dharchoudhury, R. Panda, G. Vijayan, D. T. Blaauw
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

Traditional synthesis techniques optimize CMOS circuits in two phases: i) logic minimization and ii) library mapping phase. Typically, the structures and the sizes of the gates in the library are chosen to yield good synthesis results over many blocks or even for an entire chip. Consequently this approach precludes an optimal design of individual blocks which may need custom structures. The authors present a new transistor level technique that optimizes CMOS circuits both structurally and size-wise. The technique is independent of a library and hence can explore a design space much larger than that possible due to gate level optimization. Results demonstrate a significant improvement in circuit performance of the resynthesized circuits.
On Parallelization of Static Scheduling Algorithms
Authors: Min-You Wu, Wei Shu
Venue: IEEE Transactions on Software Engineering (1997)

Most static algorithms that schedule parallel programs represented by macro dataflow graphs are sequential. This paper discusses the essential issues pertaining to parallelization of static scheduling and presents two efficient parallel scheduling algorithms. The proposed algorithms have been implemented on an Intel Paragon machine and their performances have been evaluated. These algorithms produce high-quality scheduling and are much faster than existing sequential and parallel algorithms.
Analytic derivation of comparisons in binary search
Authors: Timothy J. Rolfe
Venue: ACM SIGNUM Newsletter (1997)

Numerous authors of programming texts and algorithms / data structures texts develop code for the binary search. The common implementation is one in which the loop contains two comparisons for three outcomes --- the key is to the left of the midpoint, to the right of the midpoint, or exactly at the midpoint --- Implementation A below.
What should graduate students know before joining a large computer architecture project?
Authors: Shubhendu S. Mukherjee
Venue: ACM SIGARCH Computer Architecture News (1997)

Large projects have become common in the computer architecture research community today. This article examines some of the things that graduate students who become involved in such large projects should be aware of.The purpose of this article is not to advocate that a graduate student should join a large project; rather, this article should be viewed as an aid that helps a new graduate student make this decision.
An integrated business application architecture
Authors: Wei-Tih Cheng
Venue: ACM SIGAPL APL Quote Quad (1985)

An integrated business application architecture has been implemented in the Information Systems and Communications Group and the Information Systems and Products Group, two of IBM's group headquarters. The language base used is APL so that the maximum productivity can be achieved. The cornerstone of this architecture is an APL-based graphics package called A Presentation Graphics System (APGS). The architecture is a closed-loop system with the flexibility to expand as more application systems are needed. Increases in productivity and quality have been realized through the implementation of this architecture for both the management, the planning staff and the application programmers.
Decomposition and technology mapping of speed-independent circuits using Boolean relations
Authors: Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, Enric Pastor, Alex Yakovlev
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

Presents a new technique for the decomposition and technology mapping of speed-independent circuits. An initial circuit implementation is obtained in the form of a netlist of complex gates, which may not be available in the design library. The proposed method iteratively performs Boolean decomposition of each such gate F into a two-input combinational or sequential gate G, which is available in the library, and two gates H/sub 1/ and H/sub 2/, which are simpler than F, while preserving the original behavior and speed-independence of the circuit. To extract functions for H/sub 1/ and H/sub 2/, the method uses Boolean relations, as opposed to the less powerful algebraic factorization approach used in previous methods. After logic decomposition, overall library matching and optimization is carried out. Logic resynthesis, performed after speed-independent signal insertion for H/sub 1/ and H/sub 2/, allows for the sharing of decomposed logic. Overall, this method is more general than existing techniques based on restricted decomposition architectures, and thereby leads to better results in technology mapping.
The LIVE-project: retrieval experiments based on evaluation viewpoints
Authors: P. Bollmann, F. Jochum, U. Reiner, V. Weissmann, H. Zuse
Venue: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval (1985)

Besides the operators 'and', 'or' and 'not' the GRIPS retrieval language contains thesaurus &mdash; operators to extend the query and truncation &mdash; and context-operators for freetext and Boolean searching. In a similar way several other viewpoints and evaluation measures were defined and applied in the retrieval experiment. Under the assumption that the evaluation measure is an interval scale averaging is done by calculating the arithmetic mean.As levels of the experimental factor /8/ the following similarity measures were used: inner product measure, cosine measure, overlap measure, coefficient of Jaccard and Euclidean distance. As situative factors /8/ the number of documents retrieved by GRIPS, the number of descriptiors of the queries, generality and topic of documents were used.The retrieval experiment is not yet finished completely but several results have already been obtained. For example in the average (over 81 queries) for the above defined viewpoint the ranking with the inner product measure does not indicate a significant improvement compared with the GRIPS-output. In the case of the Euclidean distance measure it seems that in the average the user has to inspect less nonrelevant documents. This means an improvement compared with the unordered retrieved set from the GRIPS-output.For more details of the so called 'two-level retrieval process' and further experimental results we refer to the long version of this paper.
AMS: an APL management system
Authors: John W. Burgeson, Robert G. Germain
Venue: ACM SIGAPL APL Quote Quad (1985)

This paper describes AMS, an integrated, user expandable collection of tools for use in the construction, debugging, modification and maintenance of APL application workspaces. AMS offers six significant advantages over conventional APL workspace management systems: Commands work on any object, any size, any shape. Torso syntax, yet easy to use and remember. Automatic date/time stamping, functions and data. Modular design. Interactive or batch use. Open ended. User may customize his own commands. All of the function described in this paper is operational. The system, which is terminal-independent, will function in any APL environment. Implementations exist in APL.SV, VSAPL and IBM PC-APL systems.
Inequalities for the Hadamard Product of Matrices
Authors: B. Mond, J. E. Pecaric
Venue: SIAM Journal on Matrix Analysis and Applications (1998)

Some known inequalities for the Hadamard product of matrices are extended and new inequalities obtained.
Algebraic change propagation for semijoin and outerjoin queries
Authors: Timothy Griffin, Bharat Kumar
Venue: ACM SIGMOD Record (1998)

Many interesting examples in view maintenance involve semijoin and outerjoin queries. In this paper we develop algebraic change propagation algorithms for the following operators: semijoin, anti-semijoin, left outerjoin, right outerjoin, and full outerjoin.
A common architecture for different text processing techniques in an information retrieval environment
Authors: G. Thurmair
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

The following paper gives an overview on a text processing software called REALIST (Retrieval Aids by Linguistics and Statistics) which integrates different text processing techniques into a common surface. It supports the user by offering the environment of a given term, using morphological, syntactic and statistic means. The user can call up the processing results, use it for indexing, classification or retrieval purposes and combine them as he wishes e.g. to set up a search logic. The text processing is done on a main frame computer, the results are transferred to a minicomputer where the evaluation is performed. REALIST is a stand alone package, fitting any existing search systems. In the retrieval context, this technique reduces connecting time and improves the search results. REALIST is able to run on English and German texts. Each REALIST component has been separately tested with good success. An integrated version is currently under test at the US Patent ad Trademark Office using 150000 English patent abstracts, and a German version is being tested with 12000 legal texts of the European Community.
Maintaining the consistency of class libraries during their evolution
Authors: Mira Mezini
Venue: ACM SIGPLAN Notices (1997)

Two important problems of object-oriented reuse are the propagation of design and implementation specifics of the base software to the inheritors, and the protection of the inheritors against changes in the base software. In this paper, we argue that the simple inheritance rules of existing object-oriented languages are not sufficient for properly dealing with these problems. In the proposal presented in this paper, programmers are enabled to make metalevel declarations of the internal protocols and dependencies of their classes. Additionally, changes of the base module are automatically monitored to filter out information about the alterations that may invalidate already existing inheritors. Based on these informations, the subclassing semantics is adjusted such that the maintenance of the base module properties and the protection of the inheritor is ensured during their integration, In this way, language support is provided for keeping the behavior of reusable software consistent during its evolution.
Investigation of the Degeneracy Phenomenon of the Maximum Principle for Optimal Control Problems with State Constraints
Authors: Aram V. Arutyunov, Sergei M. Aseev
Venue: SIAM Journal on Control and Optimization (1997)

In this paper we study the degeneracy phenomenon in optimal control problems with state constraints. It is shown that this phenomenon occurs because of the incompleteness of the standard variants of Pontryagin's maximum principle for problems with state constraints. A new maximum principle containing additional information about the behavior of the Hamiltonian at the endtimes is developed. We also obtain some sufficient and necessary conditions for nondegeneracy and pointwise nontriviality of the maximum principle. The results obtained pertain to optimal control problems with systems described by differential inclusions and ordinary differential equations.
A Generalized Rational Interpolation Problem and the Solution of theWelch&ndash;Berlekamp Key Equation
Authors: Simon R. Blackburn
Venue: Designs, Codes and Cryptography (1997)

We show that an algorithm designed to solve the Welch&ndash;Berlekamp key equation may also be used to solve a more general problem, which can be regarded as a finite analogue of a generalized rational interpolation problem. As a consequence, we show that a single algorithm exists which can solve both Berlekamp&lsquo;s classical key equation (usually solved by the Berlekamp&ndash;Massey algorithm) and the Welch&ndash;Berlekamp key equation which arise in the decoding of Reed&ndash;Solomon codes.
Computing Size Functions from Edge Maps
Authors: Claudio Uras, Alessandro Verri
Venue: International Journal of Computer Vision (1997)

Size functions are integer valued functions of two real variables which have been recently proposed for the representation and recognition of shape. A main limitation of the theory of size functions appeared to be the fragility of the produced representation with respect to edge fragmentation. In this paper it is shown that size functions can actually be defined without making assumptions on the topological structure of the viewed shape. Consequently, size functions can be profitably used even in the presence of fragmented edge maps. In order to demonstrate the potential of size functions for computer vision, a system for shape recognition is described and tested on two different domains. The very good performances of the system indicate that size functions are extremely effective for the analysis of shapes for which geometric models might be difficult to obtain.
Size-limited batch movement in product-form closed discrete-time queueing networks
Authors: Michael E. Woodward
Venue: Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (1997)

Existing models for product-form closed discrete-time queueing networks with batch movement of customers implicitly assume that batch sizes are unrestricted. In many practical modelling situations however, it is necessary to impose restrictions on the batch sizes, and this paper examines the repercushions of such restrictions on the product-form properties of the networks. It is shown that when batch sizes are restricted independently then, in general, the resulting networks cannot have a product-form equilibrium distribution. Sufficient conditions to retain a product-form are derived in the cases when batch sizes are either correlated or depend on the state of the network. Examples of applying the results to obtain product-form networks with both correlated and state dependent batch movement are given.
A new method for analysing feedback-based protocols with applications to engineering Web traffic over the Internet
Authors: D. P. Heyman, T. V. Lakshman, Arnold L. Neidhardt
Venue: Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (1997)

Most of the studies of feedback-based flow and congestion control consider only persistent sources which always have data to send. However, with the rapid growth of Internet applications built on TCP/IP such as the World Wide Web and the standardization of traffic management schemes such as Available Bit Rate (ABR) in Asynchronous Transfer Mode (ATM) networks, it is essential to evaluate the performance of feedback-based protocols using traffic models which are specific to dominant applications. This paper presents a method for analysing feedback-based protocols with a Web-user-like input traffic where the source alternates between "transfer" periods followed by "think" periods. Our key results, which are presented for the TCP protocol, are:(1) The goodputs and the fraction of time that the system has some given number of transferring sources are insensitive to the distributions of transfer (file or page) sizes and think times except through the ratio of their means. Thus, apart from network round-trip times, only the ratio of average transfer sizes and think times of users need be known to size the network for achieving a specific quality of service.(2) The Engset model can be adapted to accurately compute goodputs for TCP and TCP over ATM, with different buffer management schemes. Though only these adaptations are given in the paper, the method based on the Engset model can be applied to analyze other feedback systems, such as ATM ABR, by finding a protocol specific adaptation. Hence, the method we develop is useful not only for analysing TCP using a source model significantly different from the commonly used persistent sources, but also can be useful for analysing other feedback schemes.(3) Comparisons of simulated TCP traffic to measured Ethernet traffic shows qualitatively similar autocorrelation when think times follow a Pareto distribution with infinite variance. Also, the simulated and measured traffic have long range dependence. In this sense our traffic model, which purports to be Web-user-like, also agrees with measured traffic.
Concepts of the cover coefficient-based clustering methodology
Authors: Fazli Can, Esen A. Ozkarahan
Venue: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval (1985)

Document clustering has several unresolved problems. Among them are high time and space complexity, difficulty of determining similarity thresholds, order dependence, nonuniform document distribution in clusters, and arbitrariness in determination of various cluster intiators. To overcome these problems to some degree, the cover coefficient based clustering methodology has been introduced. The concepts used in this methodology have created certain new concepts, relationships, and measures such as the effect of indexing on clustering, an optimal vocabulary generation for indexing, and a new matching function. These new concepts are discussed. The result of performance experiments that show the effectiveness of the clustering methodology and the matching function are also included. In these experiments, it has been also observed that the majority of the documents obtained in a search are concentrated in a few clusters containing a low percentage of documents of the database.
An enhanced data model for CAD/CAM database systems
Authors: Ying-Kuei Yang
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

The record-based conventional data models have been criticized as not powerful enough to model a complex data domain of CAD/CAM. This paper proposes a Semantic Network plus Model (SN+M) as a data model for an integrated CAD/CAM database system. The SN+M basically is a model coupling semantic network capability developed in artificial intelligence and relational table capability developed in database in order to naturally accommodate the features of a complex data domain. In this paper, we first discuss some of the special features of a CAD/CAM data domain which make it very desirable to have a higher level data model. The SN+M data model concept is then briefly discussed. We then discuss on how the proposed model can be used adequately and naturally to model some of the important and representative information of CAD/CAM data domain. Finally, a conclusion is made to summarize the major advantages of the proposed use of SN+M as compared the use of conventional data models.
Kleene algebra with tests
Authors: Dexter Kozen
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1997)

We introduce Kleene algebra with tests, an equational system for manipulating programs. We give a purely equational proof, using Kleene algebra with tests and commutativity conditions, of the following classical result: every while program can be simulated by a while program can be simulated by a while program with at most one while loop. The proof illustrates the use of Kleene algebra with tests and commutativity conditions in program equivalence proofs.
Difference Sets Corresponding to a Class of Symmetric Designs
Authors: Siu Lun Ma, Bernhard Schmidt
Venue: Designs, Codes and Cryptography (1997)

We study difference sets with parameters(v, k, &lambda;) = (p^s(r^2m - 1)/(r - 1), p^{s-1}r^{2m-2}(r - 1)r^{2m -2}, where r = (p^s - 1)/(p - 1) and p is a prime. Examples for such difference sets are known from a construction of McFarland which works for m = 1 and all p, s. We will prove a structural theorem on difference sets with the above parameters; it will include the result, that under the self-conjugacy assumption McFarland&lsquo;s construction yields all difference sets in the underlying groups. We also show that no abelian .160; 54; 18/-difference set exists. Finally, we give a new nonexistence prove of (189, 48, 12)-difference sets in Z_3 &times; Z_9 &times; Z_7.