ppxscal/embedding_network huggingface dataset:
An interactive dynamic model for integrating knowledge management methods and knowledge sharing technology in a traditional classroom
Authors: Vir V. Phoha
Venue: ACM SIGCSE Bulletin (2001)

This paper reports an interactive dynamic model using Continuous Knowledge Management methods and Knowledge Sharing technology to integrate the acquisition of skills and relevant information (knowledge level) into diverse, individualized, concurrent learning processes in a traditional classroom setting. As opposed to a passive introduction of technology to facilitate the traditional learning processes a Web based active learning and continuous evaluation process was created which integrates objective scientific knowledge relating to course content, subjective knowledge obtained through personal interactions and empirical knowledge collected during the learning process. Knowledge Management, an emerging area of Artificial Intelligence, encompasses identifying, mapping, and managing intellectual assets to generate new knowledge for competitive advantage and for sharing of technology. The Web-based model of knowledge management discussed here allows a diverse group of learners to progressively interact and participate in the learning process, providing non-threatening self-evaluation and just-in-time individualized feedback to the learners and efficient tracking and supervision tools to the instructor. CS1003, a required general education class provides an ideal application of this model as the course draws from a diverse body of students ranging from history to math majors and from freshmen to seniors. The instructional design of this course using the interactive dynamics of Knowledge Management includes (i) provision of course archives and relevant static information as a passive repository, (ii) Web Discussion Forums, electronic chats and email communication for active learning and continuous interaction, (iii) an intelligent self-evaluation and grade reporting system for non-threatening self-testing and what-if analysis of performance, and (iv) a dynamic student feedback system including individualized supervision and anonymous feedback. Application of this instructional process enhanced the goals of the course from mere computer literacy to what the 1999 NRC Report calls Fluency in Information Technology (FIT). Three kinds of knowledge requirements are identified for FIT: (1) Contemporary skills, (2) Foundational concepts, and (3) Intellectual capabilities. This model is broadly applicable to extend the benefits of traditional classroom instruction to focus diverse intellectual abilities and interests in a collaborative learning process. Formal and informal evaluation support this claim, demonstrating that the transition from purely traditional teaching to a high degree of technology fluency can be painless, efficient and effective in preparing the students for a technology intensive information age.
A practical guide to testing object-oriented software
Authors: John D. McGregor, David A. Sykes
Venue:  (2001)

A Practical Guide to Testing Object-Oriented Software focuses on the real-world issues that arise in planning and implementing effective testing for object-oriented and component-based software development. It shows how testing object-oriented software differs from testing procedural software and highlights the unique challenges and opportunities inherent in object-oriented software testing.The authors reveal how object-oriented software development allows testing to be integrated into each stage of the process--from defining requirements to system integration--resulting in a smoother development process and a higher end quality. As they follow this process, they describe what to test at each stage as well as offer experienced-based testing techniques.You will find information on such important topics as: Testing analysis and design models, including selecting test cases to guide design inspections Testing components, frameworks, and product lines The testing challenges of inheritance and polymorphism How to devise an effective testing strategy Testing classes, including constructing a test driver and test suites Testing object interactions, covering sampling test cases, off-the-shelf components, protocol testing, and test patterns Testing class hierarchies, featuring subclass test requirements Testing distributed objects, including threads, life cycle testing, and Web server testing Testing systems, with information on stress, life cycle, and performance testingOne comprehensive example runs throughout the book to demonstrate testing techniques for each stage of development. In addition, the book highlights important questions that testers should ask when faced with specific testing tasks.The authors acknowledge that testing is often viewed as a necessary evil, and that resources allocated to testing are often limited. With that in mind, they present a valuable repertoire of testing techniques from which you can choose those that fit your budget, schedule, and needs.
Buffer requirements and replacement policies for multicast repair service
Authors: Sneha Kumar Kasera, Jim Kurose, Don Towsley
Venue: Proceedings of NGC 2000 on Networked group communication (2000)

Server&mdash;based local recovery for reliable multicast will perform efficiently only when sufficient processing and buffering resources are available at the servers. In this paper we examine the buffer requirements of servers for reliable multicast. We show how the server buffer requirements depend upon the packet arrival process at the server and the duration of time during which a packet needs to be held in its buffer. This latter quantity depends upon the required number of retransmissions and the length of time between retransmissions of the packet. We find that buffer requirements are very sensitive to small values of the number of retransmissions of a packet within the packet inter-arrival time but increase very slowly with the number of receivers a server is responsible for supplying repairs. We also determine the effect of the number of servers and buffer size at a server on the end&mdash;system throughput and network bandwidth usage. We examine three buffer replacement policies; FIFO, FIFO with minimum buffer holding time or FIFO&mdash;MH (that we propose) and LRU. Based on our performance study and noting that it could also be easily implemented, we recommend the use of the simple FIFO buffer replacement policy.
Better home shopping or new democracy?: evaluating community network outcomes
Authors: John M. Carroll, Mary Beth Rosson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

This is a perspective paper on community networks - socio-technical infrastructures supporting villages, towns, and neighborhoods. Community networking is well-established, world wide, and addresses critical societal issues, such as the &ldquo;crisis of community&rdquo; and the sociality of the Internet. However, community network projects have not emphasized evaluation. Relatively little is known about the economic, social, and psychological consequences of community networks for the individuals, groups, and communities served. Evaluating community networks is a momentous mutual opportunity for the development of CHI evaluation methodologies and for bringing technical CHI expertise to bear on societal issues.
JPEG2000: the new still picture compression standard
Authors: C. A. Christopoulos, T. Ebrahimi, A. N. Skodras
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

This paper presents an overview of the upcoming JPEG2000 still picture compression standard. JPEG2000 is not only intended to provide rate-distortion and subjective image quality performance superior to existing JPEG standard, but to also provide functionality that the current JPEG standard can either not address efficiently nor address at all. Lossless and lossy compression, encoding of very large images, progressive transmission by pixel accuracy and by resolution, robustness to the presence of bit-errors and region-of-interest coding, are some representative examples of its features.
Predicting the effects of in-car interfaces on driver behavior using a cognitive architecture
Authors: Dario D. Salvucci
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

When designing and evaluating in-car user interfaces for drivers, it is essential to determine what effects these interfaces may have on driver behavior and performance. This paper describes a novel approach to predicting effects of in-car interfaces by modeling behavior in a cognitive architecture. A cognitive architecture is a theoretical frame-work for building computational models of cognition and performance. The proposed approach centers on integrating a user model for the interface with an existing driver model that accounts for basic aspects of driver behavior (e.g., steering and speed control). By running the integrated model and having it interact with the interface while driving, we can generate a priori predictions of the effects of interface use on driver performance. The paper illustrates the approach by comparing four representative dialing interfaces for an in-car, hands-free cellular phone. It also presents an empirical study that validates several of the qualitative and quantitative predictions of the model.
Precision-Sensitive Euclidean Shortest Path in 3-Space
Authors: Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap
Venue: SIAM Journal on Computing (2000)

This paper introduces the concept of precision-sensitive algorithms, analogous to the well-known output-sensitive algorithms. We exploit this idea in studying the complexity of the 3-dimensional Euclidean shortest path problem. Specifically, we analyze an incremental approximation approach and show that this approach yields an asymptotic improvement of running time. By using an optimization technique to improve paths on fixed edge sequences, we modify this algorithm to guarantee a relative error of O(2-r) in a time polynomial in r and $1/\delta$, where $\delta$ denotes the relative difference in path length between the shortest and the second shortest path.Our result is the best possible in some sense: if we have a strongly precision-sensitive algorithm, then we can show that unambiguous SAT (USAT) is in polynomial time, which is widely conjectured to be unlikely.Finally, we discuss the practicability of this approach. Experimental results are provided.
A generational perspective of information system development
Authors: Robert I. Benjamin
Venue: Communications of the ACM (1972)

System development is categorized from a generational point of view that parallels the commonly described computing system generations. For each generation, the scope of development projects and the technological world view of the system developer are examined.
Representing dynamic binary trees succinctly
Authors: J. Ian Munro, Venkatesh Raman, Adam J. Storm
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We introduce a new updatable representation of binary trees. The structure requires the information theoretic minimum 2n + &Ogr;(n) bits and supports basic navigational operations in constant time and subtree size in &Ogr;(lg n). In contrast to the linear update costs of previously proposed succinct representations, our representation supports updates in &Ogr;(lg2 n) amortized time.
A linear algorithm for incremental digital display of circular arcs
Authors: Jack Bresenham
Venue: Communications of the ACM (1977)

Circular arcs can be drawn on an incremental display device such as a cathode ray tube, digital plotter, or matrix printer using only sign testing and elementary addition and subtraction. This paper describes methodology for producing dot or step patterns closest to the true circle.
An information-theoretic approach to automatic query expansion
Authors: Claudio Carpineto, Renato de Mori, Giovanni Romano, Brigitte Bigi
Venue: ACM Transactions on Information Systems (TOIS) (2001)

Techniques for automatic query expansion from top retrieved documents have shown promise for improving retrieval effectiveness on large collections; however, they often rely on an empirical ground, and there is a shortage of cross-system comparisons. Using ideas from Information Theory, we present a computationally simple and theoretically justified method for assigning scores to candidate expansion terms. Such scores are used to select and weight expansion terms within Rocchio's framework for query reweigthing. We compare ranking with information-theoretic query expansion versus ranking with other query expansion techniques, showing that the former achieves better retrieval effectiveness on several performance measures. We also discuss the effect on retrieval effectiveness of the main parameters involved in automatic query expansion, such as data sparseness, query difficulty, number of selected documents, and number of selected terms, pointing out interesting relationships.
Finding an optimal functional decomposition for LUT-based FPGA synthesis
Authors: Jian Qiao, Makoto Ikeda, Kunihiro Asada
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper, we propose a novel approach to the optimal functional decomposition for LUT-based FPGA synthesis. We focus on exploring all design space and finding a set of which can be merged, to the maximal extent, into multiple-output CLBs or an LUT such that the decomposition constructed from the components is also minimal. In particular, to exploit more degrees of freedom, pliable encoding has been introduced to take over the classical rigid encoding process when the latter fails to get a satisfactory solution. Experimental results on a set of MCNC91 benchmarks show that our method is promising.
How long will they stay? Predicting an IT professional's preferred employment duration
Authors: Ritu Agarwal, Prabuddha De, Thomas W. Ferratt
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

Agarwal and Ferratt [3] describe a theory of the staying behavior of IT professionals, which combines individual- and organizational- centric views. Their theory, drawing upon Rousseau's [24] conception of psychological contracts, proposes that a critical antecedent of staying behavior is an IT professional's preferred employment duration. The purpose of the research-in-progress described in this paper is to build upon their work by further examining the antecedents of this construct We argue that preferred employment duration is jointly determined by career anchor, life stage, and competencies of the IT professional, with the type of the employing organization serving as a potentially moderating factor. The paper presents the model and describes the conceptual underpinnings for each of its various constructs and relationships. We also briefly discuss a two-phased empirical study to investigate the model.
Energy efficiency of TCP in a local wireless environment
Authors: Michele Zorzi, Ramesh R. Rao
Venue: Mobile Networks and Applications (2001)

The focus of this paper is to analyze the energy consumption performance of various versions of TCP, namely, Tahoe, Reno and NewReno, for bulk data transfer in an environment where channel errors are correlated. We investigate the performance of a single wireless TCP connection by modeling the correlated packet loss/error process (e.g., as induced by a multipath fading channel) as a first-order Markov chain. Based on a unified analytical approach, we compute the throughput and energy performance of various versions of TCP. The main findings of this study are the (1) error correlations significantly affect the energy performance of TCP (consistent with analogous conclusions for throughput), and in particular they result in considerably better performance for Tahoe and NewReno than iid errors, and (2) the congestion control mechanism implemented by TCP does a good job at saving energy as well, by backing off and idiling during error bursts. An interesting conclusion is that, unlike throughput, the energy efficiency metric may be very sensitive to the TCP version used and to the choice of the protocol parameters, so that large gains appear possible.
MIRFAC: a compiler based on standard mathematical notation and plain English
Authors: H. J. Gawlik
Venue: Communications of the ACM (1963)

A pilot version of the compiler MIRFAC, now in the operation, is described. The chief features of the system, which is intended for the solution of scientific problems, are the presentation of mathematical formulas entirely in standard textbook notation. The use of plain English for organizational instructions, automatic error diagnosis indicating the actual location of the error in the uncompiled program, and an attempt to minimize that fragmentation of the original problem statement which is a normal feature of programming systems.
An approach to modeling performance evaluation on the ethernet with QoS parameters
Authors: Shin-Jer Yang
Venue: International Journal of Network Management (2001)

This paper proposes an empirical approach to model the performance of Ethernet with QoS &lpar;Quality of Services&rpar; parameters. Hence, how to model the performance of Ethernet becomes a critical issue for the LAN implementation and operation. In the QoS approach, however, Ethernet network performance can be dynamically tuned by existing and enhanced operation parameters based on the current information status of the Ethernet LAN system. Consequently, Ethernet performance can be predicted and maintained through using the proposed methodology, and then to promote the system throughput. Copyright &copy; 2001 John Wiley Sons, Ltd.
Algorithm 806: SPRNG: a scalable library for pseudorandom number generation
Authors: Michael Mascagni, Ashok Srinivasan
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

In this article we present background, rationale, and a description of the Scalable Parallel Random Number Generators (SPRNG) library. We begin by presenting some methods for parallel pseudorandom number generation. We will focus on methods based on parameterization, meaning that we will not consider splitting methods such as the leap-frog or blocking methods. We describe, in detail, parameterized versions of the following pseudorandom number generators: (i) linear congruential generators, (ii) shift-register generators, and (iii) lagged-Fibonacci generators. We briefly describe the methods, detail some advantages and disadvantages of each method, and recount results from number theory that impact our understanding of their quality in parallel applications. SPRNG was designed around the uniform implementation of different families of parameterized random number generators. We then present a short description of SPRNG. The description contained within this document is meant only to outline the rationale behind and the capabilities of SPRNG. Much more information, including examples and detailed documentation aimed at helping users with putting and using SPRNG on scalable systems is available at htt;//sprng.sc.fsu.edu. In this description of SPRNG we discuss the random-number generator library as well as the suite of tests of randomness that is an integral part of SPRNG. Random-number tools for parallel Monte Carlo applications must be subjected to classical as well as new types of empirical tests of randomness to eliminate generators that show defects when used in scalable envionments.
The OSCON Operating System Consultant
Authors: Paul Mc Kevitt
Venue: Artificial Intelligence Review (2000)

OSCON (Operating System CONsultant) is an operating system consultant which gives English answers to English queries about computer operating systems. The program currently answers queries for over 40 commands from the UNIX and MS-DOS operating systems. OSCON answers a wide variation of queries that users may wish to ask. OSCON is intended to be a consultant for various types of users who may ask vague and detailed queries. OSCON is programmed in Quintus Prolog and answers queries in less than 2.5 seconds. An empirical study with the Wizard-of-Oz technique provides important data for the further development of OSCON.
Homilies for humble standards
Authors: Douglas T. Ross
Venue: Communications of the ACM (1976)

At every standards meeting, in clear view on the table there should be a small plaque engraved: &ldquo;Do it once, do it right, do it internationally.&rdquo; The many contributions of Douglas Ross exemplify this directive. If, for example, you look at the ASCII standard, ANSI-X3.4-1968, you will find that D.T. Ross represented ACM on the ANSI X3 Committee at that time. This paper is part of an argument that well-founded standards go hand in hand with an effective systems methodology. When first submitted for refereeing, &ldquo;Homilies for Humble Standards&rdquo; was oriented toward Computer Aided Manufacturing (CAM) applications. As it is now published, the context is elevated to consider all applications. In a similar manner, we can broaden the scope to show that it is the concern of all ACM members. Manufacturing is the application of tools and processes on materials to create a product. Languages are our tools; algorithms and procedures are our processes; data is our material. The product is an enhancement of the power and span of control of the customer. I commend this paper for your reading as one of the relatively few in ACM publications which tell why ACM and its members should be &ldquo;involved&rdquo;; it discusses an unsolved problem, rather than a solution looking for a problem.
A formal framework for inter-agent dialogues
Authors: Peter McBurney, Simon Parsons
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

We present a logic-based formalism for modeling of dialogues between intelligent and autonomous software agents, building on a theory of abstract dialogue games which we present. The formalism enables representation of complex dialogues as sequences of moves in a combination of dialogue games, and allows dialogues to be embedded inside one another. The formalism can be readily operationalized and its modular nature enables different types of dialogues to be represented.
The impact of distributions and disciplines on multiple processor systems
Authors: Charles H. Sauer, K. Mani Chandy
Venue: Communications of the ACM (1979)

Simple queueing models are used to study the performance tradeoffs of multiple processor systems. Issues considered include the impact of CPU service disciplines and distributions, level of multiprogramming, multitasking, and job priorities.