ppxscal/embedding_network huggingface dataset:
Pair-programming helps female computer science students
Authors: Linda L. Werner, Brian Hanks, Charlie McDowell
Venue: Journal on Educational Resources in Computing (JERIC) (2004)

Pair-programming has been found to be very beneficial in educational settings. Students who pair in their introductory programming course are more confident, have greater course completion and pass rates, and are more likely to persist in computer-related majors. Although pairing helps all students, we believe that it is particularly beneficial for women because it addresses several significant factors that limit women's participation in computer science. We provide reasons for our belief that pair-programming helps women persist in these majors. We also repeat, with special emphasis on the impact on women, some details published elsewhere regarding our experiments on pair-programming with college and university students. Additionally, we provide new data that supports our original findings.
CLEARFACE: TRANSLUCENT MULTIUSER INTERFACE FOR TEAM WORKSTATION
Authors: Hiroshi Ishii, Kazuho Arita
Venue: ACM SIGCHI Bulletin (1991)

In order to provide distributed users with a "seamless" shared workspace, we designed "TeamWorkStation (TWS)" [Ishii90]. The shared screen supports a shared drawing window and face windows (Fig. 1). Through the experimental use of TWS, we found the most serious problem is the smallness of the shared screen space. Because of the limitation of screen size, it is very hard to place all face windows of the group members on one screen together with a shared drawing window large enough for effective use.
Interaction of fluids with deformable solids: Research Articles
Authors: Matthias Müller, Simon Schirm, Matthias Teschner, Bruno Heidelberger, Markus Gross
Venue: Computer Animation and Virtual Worlds (2004)

In this paper, we present a method for simulating the interaction of fluids with deformable solids. The method is designed for the use in interactive systems such as virtual surgery simulators where the real-time interplay of liquids and surrounding tissue is important. In computer graphics, a variety of techniques have been proposed to model liquids and deformable objects at interactive rates. As important as the plausible animation of these substances is the fast and stable modeling of their interaction. The method we describe in this paper models the exchange of momentum between Lagrangian particle-based fluid models and solids represented by polygonal meshes. To model the solid-fluid interaction we use virtual boundary particles. They are placed on the surface of the solid objects according to Gaussian quadrature rules allowing the computation of smooth interaction potentials that yield stable simulations. We demonstrate our approach in an interactive simulation environment for fluids and deformable solids. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Detecting driving awareness
Authors: Bruno Apolloni, Andrea Brega, Dario Malchiodi, Cristian Mesiano
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

We consider the task of monitoring the awareness state of a driver engaged in attention demanding manoeuvres. A Boolean normal form launches a flag when the driver is paying special attention to his guiding. The contrasting analysis of these flags with the physical parameters of the car may alert a decision system whenever the driver awareness is judged unsatisfactory. The paper presents preliminary results showing the feasibility of the task.
Branching automata with costs: a way of reflecting parallelism in costs
Authors: Dietrich Kuske, Ingmar Meinecke
Venue: Theoretical Computer Science (2004)

Extending work by Lodaya and Weil, we propose a model of branching automata with costs in which the calculation of the cost of a parallel composition is handled differently from the calculation of the cost of a sequential composition. Our main result characterizes the behavior of these automata in the spirit of Kleene's and Schützenberger's theorems.
Information dissemination via wireless broadcast
Authors: Baihua Zheng, Dik Lun Lee
Venue: Communications of the ACM (2005)

Unrestricted mobility adds a new dimension to data access methodology--- one that must be addressed before true ubiquity can be realized.
Process Monitor: Detecting Events That Didn't Happen
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

The successful operation of a large scale enterprise information system relies, in part, on the regular and successful completion of many different tasks. Some of these tasks may be fully automated, while others are done manually. One of the challenges we face is detecting when one of these tasks fails (often silently) or is forgotten. While you will eventually learn of these omissions, it is much better to have the system detect them rather than your users! This paper discusses how we implemented a system that watches what we do and reminds us when we (or our computers) forgot to do something.
Ontology-based learning content repurposing
Authors: Katrien Verbert, Dragan Gašević, Jelena Jovanović, Erik Duval
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This paper investigates basic research issues that need to be addressed for developing an architecture that enables repurposing of learning objects in a flexible way. Currently, there are a number of Learning Object Content Models (e.g. the SCORM Content Aggregation Model) that define learning objects and their components in a more or less precise way. However, these models do not allow repurposing of fine-grained components (sentences, images). We developed an ontology-based solution for content repurposing. The ontology is a solid basis for an architecture that will enable on-the-fly access to learning object components and that will facilitate repurposing these components.
Multi-Resolution Pyramidal Gabor-Eigenface Algorithm for Face Recognition
Authors: Lin Huang, Hanqi Zhuang, Sal Morgera, Wenjing Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper describes a multi-resolution Pyramidal Gabor-EigenFace (PGE) algorithm for face recognition. The PGE algorithm employs the Eigenface method on the desirable Gabor facial features, which derive from the multi-resolution Pyramidal Gabor Wavelet (PGW) transform of face images in the spatial domain directly without a Fourier implementation. The use of Eigenface method further reduces the redundancy of the images from PGW. The feasibility of the PGE algorithm has been successfully tested on face recognition using AT&T (formally Olivetti) face databases, which contain 400 face images of 40 subjects with variation in poses, facial expression, different viewing direction, and disguises. The effectiveness of the PGE algorithm is shown in terms of better accuracy, faster computational speed and much less computer memory amount.
&ldquo;Language-Based Security&rdquo;
Authors: Martín Abadi, Greg Morrisett, Andrei Sabelfeld
Venue: Journal of Functional Programming (2005)

Concepts and techniques from modern programming languages have much to offer to the security of computer systems. This special issue is devoted to research on those concepts and techniques. Over 60 active researchers working in this area were invited to contribute. In particular, a number of the participants of the Dagstuhl Seminar on Language-Based Security were encouraged to submit. Submitted articles were reviewed by 3&ndash;4 referees. As a result of the reviewing process, five articles were selected for inclusion in the special issue.
Microcomputer protocol implementation at local interconnect network
Authors: Georgi Krastev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper discusses the issues of microcomputer protocol implementation at local interconnect network LIN for automobile applications. This protocol is from class A according to the classification of SAE and it includes one master and several slave nodes. Single Chip Microcontrolers T89C51CC01 of the firm Atmel are used.
Biorthogonal Pulse Position Modulation for Time-Hopping UWB Systems
Authors: Hao Zhang, Wei Li, T. Aaron Gulliver
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

In this paper, we propose a new modulation scheme called biorthogonal pulse position modulation (BPPM) for ultra-wideband (UWB) communication systems. The BPPM signals are constructed from orthogonal pulse position modulation signals. The channel capacity and error probability of BPPM are determined for a time-hopping UWB communication system. It is shown that N-ary BPPM has better performance than N-ary PPM with the same throughput and half the computational complexity.
Book review: Cognitive Engineering in Complex Dynamic Worlds. Edited by E. Hollnagel, G. Mancini, & D. Woods (Academic Press)
Venue: ACM SIGART Bulletin (1990)

This book is a compendium of papers that resulted from a workshop composed primarily of European human factors researchers. The same articles were previously published in a special issue of the International Journal of Man-Machine Studies (November/December 1987). It is organized into three sections: the first addresses issues in the design of cognitive tools, the second describes models of decision makers in accident conditions, and the third section addresses knowledge representation. Each section is concluded with an overview and a commentary section written by one of the editors. The quality of the papers vary, with papers authored or co-authored by one of the editors being the best quality.
Application of Real-Time DEVS to Analysis of Safety-Critical Embedded Control Systems: Railroad Crossing Control Example
Authors: Hae Sang Song, Tag Gon Kim
Venue: Simulation (2005)

This article presents an application of the Discrete Event System Specification (DEVS) framework to the design and safety analysis of a real-time embedded control system, a railroad crossing control system. The authors employ an extension of the DEVS formalism, real-time DEVS (RT-DEVS), which has a sound semantics for the specification of real-time systems in a hierarchical modular fashion. The notion of a clock matrix for communicating RT-DEVS models is proposed, which represents a global time between the models. Based on the composition rules and the clock matrix, an algorithm for the generation of a timed reachability tree is developed that can be used for safety analysis at two phases: an untimed and timed analysis phase. A railroad crossing control example demonstrates that the proposed analysis for RT-DEVS models would be effective to verify the safety property of real-time control systems.
CONTROLLING INTERACTION WITH META-ACTS
Authors: David G. Novick
Venue: ACM SIGCHI Bulletin (1991)

User models that are adequate for conversational interaction between human and machine must include meta-knowledge about the state of conversational control. This paper discusses the representation and use of such meta-knowledge, proposes a conversational model based on meta-locutionary acts, and presents a conversational simulation based on the model.
What else?: people, disciplines, contexts, stories, occurrences
Authors: Manfred Tscheligi
Venue: interactions (2005)

Relevance is not always obvious. We have to investigate the unseen and talk about the unknown. Our insights from the outside come from listening to stories within our field. Synergy among the disciplines we think we constitute is always necessary, though hard to achieve. Let us ask questions for which we do not yet have an answer. We have to see what is going on beyond the standard, everywhere, in particular at places we do not consider to be central. Here we will connect to people, places, events, and much more.
Solving the undirected minimum cost flow problem with arbitrary costs
Authors: A. Sedeño-Noda, C. González-Martín, S. Alonso
Venue: Networks (2005)

We address the undirected minimum cost flow problem with arbitrary arcs costs. Any optimal solution for this problem is characterized by the property that the flow of each arc with negative cost must be equal to its capacity. That is, the flow can be nonzero in both directions. This situation implies that the flow can take values that are integer multiple of &frac12;. Therefore, this single commodity flow problem does not satisfy the unimodularity property. However, using a reformulation of the original problem, we develop an easy method for solving it using any classical minimum-cost flow problem algorithm. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 45&lpar;1&rpar;, 1&ndash;3 2005
Towards connectivity management adaptability: context awareness in policy representation and end-to-end evaluation algorithm
Authors: Jun-Zhao Sun, Jukka Riekki, Jaakko Sauvola, Marko Jurmu
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

An infrastructure based on multiple heterogeneous access networks is one of the leading enablers for the emerging pervasive and ubiquitous computing paradigm, in which the optimal management of diverse networking resources is a challenging problem. This paper presents a context-aware policy mechanism and related end-to-end evaluation algorithm for adaptive connectivity management of multi-access wireless networks. A policy is used to express the criteria for adaptive selection of the best local and remote network interfaces. The best connection can then be used for the establishment of a channel as well as the maintenance of on-going data transmission. Rich context information is considered in the policy representation with respect to user profile and preference, application characteristics, device capability, and network QoS condition. The decision of the best access networks to be used is made on the basis of an end-to-end evaluation process. The decision can be made in both Master-Slave and Peer-to-Peer modes. The paper focuses on the methods for policy representation and connection evaluation algorithm. A case study is presented to show the usability of the proposed policy mechanism and decision-making algorithm in the adaptive management of heterogeneous networking resources.
Weak gaze awareness in video-mediated communication
Authors: Takehiko Ohno
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We present a video mediated communication system that conveys gaze information to a remote location. Unlike existing video mediated communication system, this system does not send visual information directly, only gaze position and face direction. The appearance of those cues on the display depends on the distance between the screen and the user's eyes, which allows the user to control the appearance of her gaze. Face direction is represented as a still image, which changes when the user's gaze position moves. With this system, people are able to transfer visual cues without becoming self-conscious about their face.
Traffic Temporal Analysis for Reconfigurable Interconnects in Shared-Memory Systems
Authors: W. Heirman, J. Dambre, J. Van Campenhout, C. Debaes, H. Thienpont
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

New advances in reconfigurable optical interconnect technologies will allow the fabrication of cheap, fast and run-time adaptable networks for connecting processors and memory modules in large shared-memory multiprocessor machines. Since, in some technologies, the switching times of these components are high compared to the memory access time, reconfiguration can only take place on a time scale significantly above individual memory accesses. In this paper, we present preliminary results of our investigation into the exploitability of the space and time locality of address streams by a reconfigurable network.
Personalized Queries under a Generalized Preference Model
Authors: Georgia Koutrika, Yannis Ioannidis
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Query Personalization is the process of dynamically enhancing a query with related user preferences stored in a user profile with the aim of providing personalized answers. The underlying idea is that different users may find different things relevant to a search due to different preferences. Essential ingredients of query personalization are: (a) a model for representing and storing preferences in user profiles, and (b) algorithms for the generation of personalized answers using stored preferences. Modeling the plethora of preference types is a challenge. In this paper, we present a preference model that combines expressivity and concision. In addition, we provide efficient algorithms for the selection of preferences related to a query, and an algorithm for the progressive generation of personalized results, which are ranked based on user interest. Several classes of ranking functions are provided for this purpose. We present results of experiments both synthetic and with real users (a) demonstrating the efficiency of our algorithms, (b) showing the benefits of query personalization, and (c) providing insight as to the appropriateness of the proposed ranking functions.
Artistic Collaboration in Designing VR Visualizations
Authors: Daniel F. Keefe, David B. Karelitz, Eileen L. Vote, David H. Laidlaw
Venue: IEEE Computer Graphics and Applications (2005)

This article describes some of the lessons we have learned from our collaborations with artists on visualization problems at Brown University's Visualization Research Lab. Over the past several years, we have worked closely with artists to develop, refine, and critique visualizations ranging from archaeological dig data from the Great Temple of Petra site in Jordan to the fluid dynamics and wing bone shape deformations that begin to explain how bats, the only flying mammals, stay aloft.
The Hook-ups initiative: how youth can learn by creating their own computer interfaces and programs
Authors: Amon Millner
Venue: ACM SIGGROUP Bulletin (2003)

This paper introduces the Hook-ups initiative. In this initiative, young people learn by designing and constructing "Hook-ups" - physical objects that can control games, animations, and other computer programs which they create. Hook-ups can be inspired by traditional computer interfaces (e.g., joysticks) or are entirely new types of interfaces (e.g., a spaceship steering wheel). In creating Hook-ups, young people work with objects and materials that they have a strong interest in exploring. Youth become designers capable of integrating virtual media with materials from the world around them. By engaging in Hook-ups design processes, learners gain confidence and motivation to explore topics within areas such as interface design, programming, and physics.
Comparing relevance feedback algorithms for web search
Authors: Vishwa Vinay, Ken Wood, Natasa Milic-Frayling, Ingemar J. Cox
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We evaluate three different relevance feedback (RF)algorithms, Rocchio, Robertson/Sparck-Jones (RSJ)and Bayesian, in the context of Web search. We use a target-testing experimental procedure whereby a user must locate a specific document. For user relevance feedback, we consider all possible user choices of indicating zero or more relevant documents from a set of 10 displayed documents. Examination of the effects of each user choice permits us to compute an upper-bound on the performance of each RF algorithm.We ind that there is a significant variation in the upper-bound performance o the three RF algorithms and that the Bayesian algorithm approaches the best possible.
UML Fever: Diagnosis and Recovery
Authors: Alex E. Bell
Venue: Queue (2005)

Acknowledgment is only the first step toward recovery from this potentially devastating affliction. The Institute of Infectious Diseases has recently published research confirming that the many and varied strains of UML Fever continue to spread worldwide, indiscriminately infecting software analysts, engineers, and managers alike. One of the fevers most serious side effects has been observed to be a significant increase in both the cost and duration of developing software products. This increase is largely attributable to a decrease in productivity resulting from fever-stricken individuals investing time and effort in activities that are of little or no value to producing deliverable products. For example, afflictees of Open Loop Fever continue to create UML (Unified Modeling Language) diagrams for unknown stakeholders. Victims of Comfort Zone Fever remain glued in the modeling space, postponing the development of software. And those suffering from Gnats Eyebrow Fever continue creating models that glorify each and every Boolean value of prospective software implementations.
Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths
Authors: Steven Chamberland, Désiré Oulaï Khyda, Samuel Pierre
Venue: Computers and Operations Research (2005)

In this paper, we tackle the routing and wavelength assignment problem for wavelength division multiplexing (WDM) networks containing permanent and reliable wavelength paths (WPs). It consists of finding the route and the wavelength of each WP for the normal state of the network and for the important failure scenarios. These scenarios might be the most probable failure scenarios or simply the failure scenarios of interest to the network planner (e.g., the single link failure scenarios). We propose a mathematical programming model for this problem. In order to find a solution within a reasonable amount of time, a simple heuristic algorithm is proposed. The results show that "good" solutions can be obtained with the proposed heuristic algorithm.
ROSEPACK-robust statistics estimation package
Authors: Virginia Klema
Venue: ACM SIGNUM Newsletter (1978)

ROSEPACK (RObust Statistics Estimation PACKage) is a system of Fortran subroutines and an interactive driver to compute solutions to the iteratively reweighted least square problem. The weights are determined from the data and the linear fit and are computed as functions of the scaled residuals.
Haptic Illusions Induced by Moving Line Stimuli
Authors: Hiromi Mochiyama, Akihito Sano, Naoyuki Takesue, Ryo Kikuuwe, Kei Fujita, Shinji Fukuda, Ken'ichi Marui, Hideo Fujimoto
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper, we report some observations related to a haptic illusion called the Velvet Hand Illusion (VHI) in which we can feel a strange velvety sensation when we lightly rub a wire mesh of hexagonal pattern between our hands, keeping our hands pressed gently together. Moving line stimuli are used to find the conditions for eliciting the illusion in order to understand its mechanism deeply.
Presence, memory and interaction in virtual environments
Authors: Alistair Sutcliffe, Brian Gault, Jae-Eun Shin
Venue: International Journal of Human-Computer Studies (2005)

An experimental study is described, comparing presence, memory, and interaction in three different virtual environments: CAVE, Interactive WorkBench, and Reality Room. The aim of the experiment was to investigate possible relationships between these three parameters. It was found that the CAVE was remembered better, had better usability, and provided a better sense of presence to its users.