ppxscal/embedding_network huggingface dataset:
Experimenting with pair programming in the classroom
Authors: Charlie McDowell, Brian Hanks, Linda Werner
Venue: ACM SIGCSE Bulletin (2003)

There is now a substantial body of evidence in support of the use of pair programming in the classroom[3, 4, 10, 11, 13, 14]. Some of the data is anecdotal and some is the result of formal experiments. We are not aware of any published data that raises concerns about allowing students to complete programming projects using pair programming.In this paper we present data from three studies performed at UCSC. All three studies support the position that pair programming results in more student learning.
Diagrammatic specifications
Authors: Dominique Duval
Venue: Mathematical Structures in Computer Science (2003)

This paper presents a simple and powerful diagrammatic framework for dealing with specifications in computer science. Following a classical line, we define diagrammatic specifications as a kind of generalised sketch. In addition, the specifications themselves are defined as the realisations of projective sketches. This meta level provides adjunction properties: this is due to a well-known result of Ehresmann. Moreover, we prove in this paper that this meta level also provides an efficient definition of deduction. This work results from a collaboration with Christian Lair.
The effects of story webbing and visual thinking software on the written language performance of students with mild disabilities
Authors: James E. Gardner
Venue:  (2003)

The primary purpose of this mixed method quasi-experimental research was to examine the effects of teaching students with mild disabilities to use story webbing and visual thinking software. Changes in the quality and the quantity of students' writing, attitudes of students regarding the writing process, computer usage, and writing strategies, and as well as observed changes in student behavior and writing performance were explored. A total of eighteen seventh and eighth graders, identified by their school district as having mild disabilities, participated in this four week study. Students were rank ordered and alternately assigned to the intervention or comparison group. The research design for this study included the evaluation of five writing samples for each student: two handwritten samples and three word-processed samples. The independent variables were story webbing which was generated by hand or Inspiration and no story webbing. The dependent variables were the spontaneous subtests, composite scores, and quotient scores from the Test of Written Language 3rd edition ( TOWL-3): T-unit counts; word counts; character counts; Student Attitudes Survey, Student Interview Questionnaire and daily Instructors' Observation Logs. MANOVA were conducted to analyze the statistical data. The results of the study indicate that there were consistent increases in the quality of writing of students in the intervention group whether products were handwritten or word processed. Increases were also found in the writing quality of students in the comparison group; however, while statistically significant differences were found when products were word processed, only minimal gains where present when products were handwritten. In addition the quantity of written language performance was shown to increase significantly between pretest and posttest for word processed products, yet little to no increase in the quantity handwritten was evident with either group when their writing samples were compared. Student attitudes regarding the writing process, computer usage and writing strategies were shown to improve when they were taught story webbing and visual thinking software. Positive changes in behavior and writing performance were observed by instructors within the study. It is the conclusion of this study, that, because writing performance improved for both groups of students, having students write every day, giving them positive experiences with the writing process, and daily technology usage is probably the most practical solution for teachers from a pragmatic context. In this sense, the focus moves away from considering story webbing via technology in and of itself, to considering it one of many strategies which students perceive as a positive and useful support in the writing process.
A model for notification systems evaluation&mdash;assessing user goals for multitasking activity
Authors: D. Scott McCrickard, C. M. Chewar, Jacob P. Somervell, Ali Ndiwalana
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2003)

Addressing the need to tailor usability evaluation methods (UEMs) and promote effective reuse of HCI knowledge for computing activities undertaken in divided-attention situations, we present the foundations of a unifying model that can guide evaluation efforts for notification systems. Often implemented as ubiquitous systems or within a small portion of the traditional desktop, notification systems typically deliver information of interest in a parallel, multitasking approach, extraneous or supplemental to a user's attention priority. Such systems represent a difficult challenge to evaluate meaningfully. We introduce a design model of user goals based on blends of three critical parameters---interruption, reaction, and comprehension. Categorization possibilities form a logical, descriptive design space for notification systems, rooted in human information processing theory. This model allows conceptualization of distinct action models for at least eight classes of notification systems, which we describe and analyze with a human information processing model. System classification regions immediately suggest useful empirical and analytical evaluation metrics from related literature. We present a case study that demonstrates how these techniques can assist an evaluator in adapting traditional UEMs for notification and other multitasking systems. We explain why using the design model categorization scheme enabled us to generate evaluation results that are more relevant for the system redesign than the results of the original exploration done by the system's designers.
Basic time-sharing: a system of computing principles
Authors: Douglas B. Earl, Faith L. Bugely
Venue: Proceedings of the second symposium on Operating systems principles (1969)

Basic Time-Sharing is an attempt to systematize the computing principles which should underlie the design of operating systems. These principles emphasize the fundamental separateness of work and resources and the parallelism inherent in the computing process. Primary constructions are described in which all computing activity can be realized.
Latent semantic models for collaborative filtering
Authors: Thomas Hofmann
Venue: ACM Transactions on Information Systems (TOIS) (2004)

Collaborative filtering aims at learning predictive models of user preferences, interests or behavior from community data, that is, a database of available user preferences. In this article, we describe a new family of model-based algorithms designed for this task. These algorithms rely on a statistical modelling technique that introduces latent class variables in a mixture model setting to discover user communities and prototypical interest profiles. We investigate several variations to deal with discrete and continuous response variables as well as with different objective functions. The main advantages of this technique over standard memory-based methods are higher accuracy, constant time prediction, and an explicit and compact model representation. The latter can also be used to mine for user communitites. The experimental evaluation shows that substantial improvements in accucracy over existing methods and published results can be obtained.
Design of a cycle-efficient 64-b/32-b integer divisor using a table-sharing algorithm
Authors: Chua-Chin Wang, Po-Ming Lee, Jun-Jie Wang, Chenn-Jung Huang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

In new generations of microprocessors, the superscalar architecture is widely adopted to increase the number of instructions executed in one cycle. The division instruction among all of the instructions needs more cycles than the rest, e.g., addition and multiplication. It then makes division instruction an important cycles-per-instruction figure for modern microprocessors. In this paper, a radix-16/8/4/2 divisor is proposed, which uses a variety of techniques, including operand scaling, table partitioning, and, particularly, table sharing, to increase performance without the cost of increasing complexity. A physical chip using the proposed method is implemented by 0.35-µm single poly four metal (1P4M) CMOS technology. The testing measurement shows that the chip can execute signed 64-b/32-b integer division between 3-13 cycles with a 80-MHz operating clock.
Similarity measures of RNA structures
Authors: Tamas Horvath
Venue: ACM SIGBIO Newsletter (1998)

Untranslated regions of (pre-) mRNAs contain regulatory elements called signal structures to control gene expression at the posttranscriptional level. Their regulatory information is encoded in their primary and secondary structures. Given a set of known signal structures belonging to several classes, our aim is to find a) the presence of signal structures belonging to known classes on uncharacterized mRNA, and b) uncharacterized signal structure classes. We have applied relational instance-based method for the first problem.
A Class of M-Ary Asymmetric Symbol Error Correcting Codes for Data Entry Devices
Authors: Haruhiko Kaneko, Eiji Fujiwara
Venue: IEEE Transactions on Computers (2004)

Abstract--Nonbinary M-ary symbols such as alphanumeric characters are commonly used in data entry devices, e.g., keyboards and character recognition devices. The M-ary symbols processed by these devices are sometimes mistaken for other symbols due to errors such as mistyping in keyboards or misreading in character recognition systems. These errors are generally asymmetric, not symmetric. For example, the symbols corresponding to adjacent keys in a keyboard have a high error probability due to mistapping. Similarly, in character recognition systems, two symbols having similar shape have high error probability to be misrecognized. These asymmetric errors can be corrected or detected by using M-ary asymmetric symbol error control codes. This paper proposes a new class of M-ary single asymmetric symbol error correcting codes by using a new class of rings obtained from a direct product of Galois fields. Asymmetric symbol errors are expressed by an error directionality graph, based on which the error correction capability of the codes is determined. The code is defined by a parity check matrix over the ring and functions which map a set of M-ary symbols into the ring. One of the functions is derived from the graph coloring problem of the error directionality graph. The proposed codes have greater information symbol length than the existing M-ary single symmetric symbol error correcting codes.
On nonsystematic perfect binary codes of length 15
Authors: A. M. Romanov
Venue: Discrete Applied Mathematics (2004)

A construction of nonsystematic perfect binary codes of length 15 is offered.
The Application of Network Science Principles to Knowledge Simulation
Authors: Steven M. Halladay, Charles A. Milligan
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Current approaches to knowledge representation begin with the principles of logic and ontology that Aristotle initially introduced into history. These knowledge representation approaches focus on building systems that incorporate not only computational models, but also models that people can understand and analyze. Knowledge representation fidelity requires relationship richness of both relationship types and quantities.This paper introduces a new discipline entitled simulated knowledge. Simulated knowledge differs from knowledge representation in that simulated knowledge relaxes the requirements of human understanding while maintaining the capability for human interaction and emphasizing its computational capability. Also, instead of an Aristotelian foundation, knowledge simulation principles emphasize those of the new Network Science.
Aliasing and anti-aliasing in branch history table prediction
Authors: Kristopher C. Breen, Duncan G. Elliott
Venue: ACM SIGARCH Computer Architecture News (2003)

Branch history table (BHT) prediction is a simple and effective method of predicting branch direction at run-time in a microprocessor. Unfortunately, this method suffers from performance limitations due to aliasing, which is when more than one branch uses a single entry in the branch history table. Theoretically, for programs that exhibit pseudo-random branch positioning, aliasing can be predicted and reduced, thereby improving performance. In this paper, we develop a probabilistic model for aliasing and "anti-aliasing", and we use SimpleScalar to explore the extent to which "anti-aliasing" is useful in real programs. Our results show that programs can be "anti-aliased" to some extent when using history tables of 256 entries or greater, and that for large enough history tables, a significant percentage of table entries are unused and available for "anti-aliasing."
Similarity-based clustering of Web transactions
Authors: Giuseppe Manco, Riccardo Ortale, Domenico Saccà
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We introduce a measure to compute similarity between two sequences containing accesses to Web pages, to be exploited in a clustering approach for grouping sessions of accesses to a Web site. The notion of sequence similarity is parametric to the sequence topology, and the similarity among Web pages within the sequences. In our formalization, two Web pages are similar if they can be considered synonymies not only from a content point of view, but also from a usage point of view, i.e., if users exhibit the same behavior on both pages. The refined notion of page similarity, as well as the related notion of sequence siilarity, are envisaged to be effective in the application of a centroid-based clustering technique to the personalization of Web experience.
A Study of Secure Multi-Party Statistical Analysis
Authors: Wenjun Luo, Xiang Li
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Static analysis is a widely used computation in real life, but the known methods usually require one to known the whole data set. Little work has been conducted to investigate how statistical analysis could be performed in multi-party cooperative environment, where the participants want to conduct statistical analysis on the joint data set, but each participant is concerned about the confidentiality of its own data. In this paper, we have developed protocols for conducting the statistic analysis in secure multi-party cooperative environment, based on secure two-party cooperative environment and cryptography primitives.
Error checking, tracing, and dumping in an ALGOL 68 checkout compiler
Authors: C. M. Thomson
Venue: ACM SIGPLAN Notices (1977)

A case is stated for the need for error checking, tracing, and dumping. Consideration is given to the types of errors which must be checked for. Examples are given which demonstrate the need that all these errors be checked at run time in ALGOL 68. Tracing and dumping are discussed, with emphasis on those aspects of ALGOL 68 which make them difficult. Some possible solutions to these problems are offered. An outline of the facilities provided in the FLASC system is given.
Implementing operations to navigate semantic star schemas
Authors: Alberto Abelló, José Samos, Fèlix Saltor
Venue: Proceedings of the 6th ACM international workshop on Data warehousing and OLAP (2003)

In the last years, lots of work have been devoted to multidimensional modeling, star shape schemas and OLAP operations. However, "drill-across" has not captured as much attention as other operations. This operation allows to change the subject of analysis keeping the same analysis space we were using to analyze another subject. It is assumed that this can be done if both subjects share exactly the same analysis dimensions. In this paper, besides the implementation of an algebraic set of operations on a RDBMS, we are going to show when and how we can change the subject of analysis in the presence of semantic relationships, even if the analysis dimensions do not exactly coincide.
Automatic Scan Insertion and Pattern Generation for Asynchronous Circuits
Authors: Aristides Efthymiou, Christos Sotiriou, Douglas Edwards
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents 3\phiLSSD, a novel, easily-automatable approach for scan insertion and ATPG of asynchronous circuits. 3\phiLSSD inserts scan latches only into global circuit feedback paths, leaving the local feedback paths of asynchronous state-storing gates intact. By employing a three-phase LSSD clocking scheme and complemented by a novel ATPG method, our approach achieves industrial quality testability with significantly less area overhead testing the same number of faults compared to full-scan LSSD. The effectiveness of our approach is demonstrated on an asynchronous SOC interconnection fabric, where our 3\phiLSSD ATPG tool achieved over 99% test coverage.
A tabu search algorithm for parallel machine total tardiness problem
Authors: Ümit Bilge, Furkan Kiraç, Müjde Kurtulan, Pelin Pekgün
Venue: Computers and Operations Research (2004)

In this study, we consider the problem of scheduling a set of independent jobs with sequence dependent setups on a set of uniform parallel machines such that total tardiness is minimized. Jobs have nonidentical due dates and arrival times. A tabu search (TS) approach is employed to attack this complex problem. In order to obtain a robust search mechanism, several key components of TS such as candidate list strategies, tabu classifications, tabu tenure and intensification/diversification strategies are investigated. Alternative approaches to each of these issues are developed and extensively tested on a set of problems obtained from the literature. The results obtained are considerably better than those reported previously and constitute the best solutions known for the benchmark problems as to date.
Program control language: a programming language for adaptive distributed applications
Authors: Brian Ensink, Joel Stanley, Vikram Adve
Venue: Journal of Parallel and Distributed Computing (2003)

Many distributed applications must meet stringent performance requirements even when the performance characteristics of the underlying systems and networks vary significantly at runtime. Runtime adaptation can be used to tolerate such changes, but sophisticated adaptive distributed programs can be extremely challenging to design, implement and debug. This paper proposes a language called Program Control Language (PCL) that provides a novel means of specifying adaptations in distributed applications. PCL is based on an abstract, global representation of a distributed program (a static task graph), which enables a programmer to reason about and to describe a wide range of application-specific adaptation strategies at a high level, using a few key mechanisms. PCL provides simple high-level syntax for local and remote adaptation operations, local and remote performance monitoring (and aggregation), and for performing adaptations synchronously or asynchronously with respect to the execution of the application process initiating the adaptation. The global task graph representation enables remote performance metrics and adaptation operations to be specified in simple global terms by any process, and the compiler and runtime system automatically perform the communication and synchronization required for the remote operations. The paper describes the conceptual adaptation framework, the PCL language, and our implementation of the PCL compiler and runtime system. The paper uses three adaptative applications examples to illustrate the capabilities and benefits of PCL, and to show experimentally that the performance overheads of using PCL for implementing an adaptive application are negligible.
On Concurrent Error Detection with Bounded Latency in FSMs
Authors: Sobeeh Almukhaizim, Petros Drineas, Yiorgos Makris
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

We discuss the problem of concurrent error detection (CED) with bounded latency in finite state machines (FSMs). The objective of this approach is to reduce the overhead of CED, albeit at the cost of introducing a small latency in the detection of errors. In order to ensure no loss of error detection capabilities as compared to CED without latency, an upper bound is imposed on the introduced latency. We examine the necessary conditions for performing CED with bounded latency, based on which we extend a parity-based method to permit bounded latency. We formulate the problem of minimizing the number of required parity bits as an Integer Program and we propose an algorithm based on Linear Program relaxation and Randomized Rounding to solve it. Experimental results indicate that allowing a small bounded latency reduces the hardware cost of the CED circuitry.
An entity-relation approach to information retrieval
Authors: Antonio Ferrández, Julio Martínez, Jesús Peral
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

In this paper, a novel model of indexation in IR is proposed, in order to overcome the problems of traditional bag of words approaches, by means of indexing the "entities" and the "relations" between these entities in the documents through the clauses and anaphoric relations. This model has been evaluated on the Los Angeles Times collection. The obtained results have been compared with the vectorial model and an increase of the 12% in the average precision, and an increase of the 13% in the R-Precision have been obtained.
Certificate validation service using XKMS for computational grid
Authors: Namje Park, Kiyoung Moon, Sungwon Sohn
Venue: Proceedings of the 2003 ACM workshop on XML security (2003)

A computational grid is a hardware and software infrastructure capable of providing dependable, consistent, pervasive, and inexpensive access to high-end computational resource. There are many ways to access the resources of a computational grid, each with unique security requirements and implications for both the resource user and the resource provider. Current Grid security Infrastructure using PKI based on SSO. But open grid service Security Infrastructure in Global Grid Forum(GGF) will extend use of grid system or services up to business area using XML web services security technology. This paper describes a novel security approach on open grid service to validate certificate based on current globus toolkit environment using XKMS(XML Key Management Specification) and SAML(Security Assertion Markup Language), XACML(extensible Access Control Markup Language) in XML security.
A reliable storage management layer for distributed information retrieval systems
Authors: Charles L. A. Clarke, Philip L. Tilker, Allen Quoc-Luan Tran, Kevin Harris, Antonio S. Cheng
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

We present a storage management layer that facilitates the implementation of parallel information retrieval systems, and related applications, on networks of workstations. The storage management layer automates the process of adding and removing nodes, and implements a dispersed mirroring strategy to improve reliability. When nodes are added and removed, the document collection managed by the system is redistributed for load balancing purposes. The use of dispersed mirroring minimizes the impact of node failures and system modifications on query performance.