ppxscal/embedding_network huggingface dataset:
Mixed reality gaming environment QuakeRunner
Authors: Martin Faust
Venue: Proceedings of the second international conference on Entertainment computing (2003)

QuakeRunner is a Mixed Reality game based on Quake 3 Arena&trade; from id Software. A new player game interface paradigm is introduced. A player is no longer running and jumping using keyboard and mouse instead he has to run in reality to move through the virtual world. This paper outlines the concept of a Mixed Reality Gaming Environment (MiRaGE) based on an example: QuakeRunner.
A Behavioral Choice Model When Computational Ability Matters
Authors: Shu Li
Venue: Applied Intelligence (2004)

This paper presents a model of how humans choose between mutually exclusive alternatives. The model is based on the observation that human decision makers are unable or unwilling to compute the overall worth of the offered alternatives. This approach models much human choice behavior as a process in which people seek to equate a less significant difference between alternatives on one dimension, thus leaving the greater one-dimensional difference to be differentiated as the determinant of the final choice. These aspects of the equate-to-differentiate model are shown to be able to provide an alternative and seemingly better account of the prominence effect. The model is also able to provide an explanation and prediction regarding the empirical violation of independence and transitivity axioms. It is suggested that the model allows understanding perplexing decision phenomena better than alternative models.
CGLS-GCV: a hybrid algorithm for low-rank-deficient problems
Authors: Fermín S. V. Bazán
Venue: Applied Numerical Mathematics (2003)

Given Ã = A + E ∈ Cm × n, where rank(A) ℓ min(m, n), and = b + ε, we investigate the following problems: (a) the construction of approximate minimum norm solutions of the least squares problem min ||Ax - b||, and (b) the computation of approximations of the column (row) subspace of A. We propose an algorithm for solving these problems based on conjugate gradient iterations followed by regularization in the generated Krylov subspace. Regularization is introduced for estimating rank(A) and implemented using the generalized cross-validation technique. We report the outcome of numerical experiments, showing that the new algorithm yields results with accuracy comparable to that of the SVD, but at a lower computational cost.
Architecture and Implementation of the Socket Interface on Top of GAMMA
Authors: Lars Schneidenbach, Bettina Schnor, Stefan Petri
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

GAMMA (the Genoa Active Message MAchine) is alightweight messaging system for Fast and Gigabit Ethernet.It is based on an Active Message-like paradigm andprovides a performing, cost-effective alternative to proprietaryhigh-speed networks, e. g. Myrinet, with the combinationof low end-to-end latency and high throughput.GAMMA supports the important class of MPI based parallelapplications via the MPI/GAMMA interface [5], but upto now support for the also important class of socket basedcluster applications is still missing.This paper describes two different approaches to howthe socket interface can be adapted to GAMMA: The firstis transparent for both application and GAMMA layer, thesecond is only transparent for the application. First performanceresults with the so-called GAMMAsockets are given.They show that the second approach performs almost asgood as native GAMMA communication.
Java IO and testing made simple
Authors: Viera K. Proulx, Richard Rasala
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

We present software tools that support robust input processing and comprehensive testing in Java. The software includes the JPT library that supports error-checked typed input via console or GUI for all primitive types. This provides a robust encapsulation of typical interactive input requests encountered in introductory programming courses.The Java Power Framework and its extension allow the user to develop a comprehensive test suite independent of the target classes. The type-safe input framework allows us to implement an external iterator interface for several types of input data sources, including the console, a GUI, a file, and an internal data structure. Student's programs that implement various algorithms can then process data independently of its source: running tests on existing data structures; creating inputs interactively; or running stress tests and timing tests on large input files.
'Good enough for what?': acceptance of handwriting recognition errors by child users
Authors: Janet C. Read, Stuart MacFarlane, Chris Casey
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

This paper describes an experiment to establish whether or not children would accept a lower rate of accuracy for handwriting recognition than the 97% reported in a study with adult users. It outlines the experimental procedure that involved the use of an automated Wizard of Oz method. Problems with the experiment are described and the results are presented.
Categorical foundations for randomly timed automata
Authors: P. Mateus, M. Morais, C. Nunes, A. Pacheco, A. Sernadas, C. Sernadas
Venue: Theoretical Computer Science (2003)

The general theory of randomly timed automata is developed: starting with the practical motivation and presentation of the envisaged notion, the categorical theory of minimization, aggregation, encapsulation, interconnection and realization of such automata is worked out. All these constructions are presented universally: minimization and realization as adjunctions, aggregation as product, interconnection as cartesian lifting, and encapsulation as co-cartesian lifting. Stochastic timed automata are shown to be a particular case of randomly timed automata. The notion of stochastic timed automaton is shown to be too restrictive to establish a self contained theory of combination and realization.
Parallel Multipliers Based on Special Irreducible Pentanomials
Authors: Francisco Rodríguez-Henríquez, Çetin Kaya Koç
Venue: IEEE Transactions on Computers (2003)

Abstract--The state-of-the-art Galois field GF(2^m) multipliers offer advantageous space and time complexities when the field is generated by some special irreducible polynomial. To date, the best complexity results have been obtained when the irreducible polynomial is either a trinomial or an equally spaced polynomial (ESP). Unfortunately, there exist only a few irreducible ESPs in the range of interest for most of the applications, e.g., error-correcting codes, computer algebra, and elliptic curve cryptography. Furthermore, it is not always possible to find an irreducible trinomial of degree m in this range. For those cases where neither an irreducible trinomial nor an irreducible ESP exists, the use of irreducible pentanomials has been suggested. Irreducible pentanomials are abundant, and there are several eligible candidates for a given m. In this paper, we promote the use of two special types of irreducible pentanomials. We propose new Mastrovito and dual basis multiplier architectures based on these special irreducible pentanomials and give rigorous analyses of their space and time complexity.
An e-channel development framework for hybrid e-retailers
Authors: In Lee
Venue: Managing e-commerce and mobile computing technologies (2003)

Due to the profound impact of e-commerce on organizations, e-channel development emerged as one of the most important challenges that managers face. Unfortunately, studies indicate that managers in most large companies are still unclear about an e-commerce strategy, and tend to lack adequate e-commerce development expertise. Poorly planned and developed e-commerce channels add little value to organizations. Furthermore, these poorly developed e-channels may even have negative impact on their organizations by confusing and disappointing customers who value a seamless cross-channel experience. To develop an e-channel that delivers higher utility to customers and generates sustainable long-term profits, managers need to analyze how an e-commerce channel affects the performance of existing channels and develop a companywide e-channel development program.Based on a number of e-commerce case studies, we developed an e-channel development framework that consists of five step-by-step phases: (1) strategic analysis; (2) e-channel planning; (3) e-channel system design; (4) e-channel system development; and (5) performance evaluation and refinement. This framework helps managers evaluate the impact of e-commerce channels on organizational performance and determine the most appropriate channel design and integration mechanisms for the achievement of business strategies. This paper also discusses impact of e-channel structures on organizational performance.
Animations in PDF
Authors: Petr Sojka
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

This paper describes a technique to create interactive teaching materials as animations that are stored and distributed in PDF file format. PdfLATEX with small macropackage, Maple and Javascript are used and allow the development of interactive animations of high typographical quality that are fine-tuned for on-the-screen reading.
Towards Data-Adaptive and User-Adaptive Image Retrieval by Peer Indexing
Authors: Jun Yang, Qing Li, Yueting Zhuang
Venue: International Journal of Computer Vision (2004)

Adaptation to the characteristics of specific images and the preferences of individual users is critical to the success of an image retrieval system but insufficiently addressed by the existing approaches. In this paper, we propose an elegant and effective approach to data-adaptive and user-adaptive image retrieval based on the idea of peer indexing&mdash;describing an image through semantically relevant peer images. Specifically, we associate each image with a two-level peer index that models the &ldquo;data characteristics&rdquo; of the image as well as the &ldquo;user characteristics&rdquo; of individual users with respect to this image. Based on two-level image peer indexes, a set of retrieval parameters including query vectors and similarity metric are optimized towards both data and user characteristics by applying the pseudo feedback strategy. A cooperative framework is proposed under which peer indexes and image visual features are integrated to facilitate data- and user-adaptive image retrieval. Simulation experiments conducted on real-world images have verified the effectiveness of our approach in a relatively restricted setting.
Periodic signal suppression in a concurrent fault simulator
Authors: Tara Weber, Fabio Somenzi
Venue: Proceedings of the conference on European design automation (1991)

Clock suppression has been proposed to take advantage of the periodic signals such as the clock present in synchronous designs. In clock suppression, no events due to the clock input are generated, but the information can be reconstructed as needed. In this paper, we present periodic signal suppression, which is a generalized form of clock suppression, as a means to suppress predictable events of all periodic signals throughout the circuit. To do this, a special signal state labeled P is introduced. P states indicate that signals are periodic, but cause no unnecessary activity in an event driven simulator. At any time, the original waveform can be reconstructed from the periodic signal. Our general implementation allows clock suppression to work on divided or gated clocks and on signals that may alternate periodic and non-periodic behavior in addition to the clock tree. Moreover, concurrent simulation of faults on the suppressed signal wires including the clock tree is possible.
Layered Motion Segmentation and Depth Ordering by Tracking Edges
Authors: Paul Smith, Tom Drummond, Roberto Cipolla
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--This paper presents a new Bayesian framework for motion segmentation--dividing a frame from an image sequence into layers representing different moving objects--by tracking edges between frames. Edges are found using the Canny edge detector, and the Expectation-Maximization algorithm is then used to fit motion models to these edges and also to calculate the probabilities of the edges obeying each motion model. The edges are also used to segment the image into regions of similar color. The most likely labeling for these regions is then calculated by using the edge probabilities, in association with a Markov Random Field-style prior. The identification of the relative depth ordering of the different motion layers is also determined, as an integral part of the process. An efficient implementation of this framework is presented for segmenting two motions (foreground and background) using two frames. It is then demonstrated how, by tracking the edges into further frames, the probabilities may be accumulated to provide an even more accurate and robust estimate, and segment an entire sequence. Further extensions are then presented to address the segmentation of more than two motions. Here, a hierarchical method of initializing the Expectation-Maximization algorithm is described, and it is demonstrated that the Minimum Description Length principle may be used to automatically select the best number of motion layers. The results from over 30 sequences (demonstrating both two and three motions) are presented and discussed.
Design and implementation of a comprehensive outpatient results manager
Authors: Eric G. Poon, Samuel J. Wang, Tejal K. Gandhi, David W. Bates, Gilad J. Kuperman
Venue: Journal of Biomedical Informatics (2003)

Prior research has demonstrated that clinicians often fail to review and act upon outpatient test results in a timely and appropriate manner. To address this patient safety and quality of care issue, Partners Healthcare has developed a browser-based, provider-centric, comprehensive results management application to help clinic physicians review and act upon test results in a safe, reliable, and efficient manner. The application, called the Results Manager, incorporates extensive decision support features to classify the degree of abnormality for each result, presents guidelines to help clinicians manage abnormal results, allows clinicians to generate result letters to patients with predefined, context-sensitive templates and prompts physicians to set reminders for future testing. In this paper, we outline the design process and functionality of Results Manager. We also discuss its underlying architectural design, which revolves around a clinical event monitor and a rules engine, and the methodological challenges encountered in designing this application.
Bench-style network research in an Internet Instance Laboratory
Authors: Paul Barford, Larry Landweber
Venue: ACM SIGCOMM Computer Communication Review (2003)

Network researchers employ a variety of experimental methods and tools including analytic modeling techniques, simulators, and widely depolyed measurement infrastructures. It is natural to assume that the overall scope of network research may be limited by the type and capability of the tools and test systems that are available. In this paper we describe a new, bench-style approach for conducting network research that we argue is essential for effectively investigating different classes of important problems. We describe the architecture for the workbench environment that enables this approach-what we call the Internet Instance Laboratory (IIL). The conceptual model for an IIL is a highly configurable laboratory environment containing commercial networking equipment typical of any end-to-end path in the Internet. An IIL would also have the capability to create accurately a broad range of conditions across all networking layers. The two most important advantages of an IIL are the ability to instrument entire end-to-end paths and the ability to install new equipment or protocols in any location in the environment. Clearly, neither of these opporutnities is available in the live Internet. while an IIL offers significant challenges. We describe these challenges and approaches for addressing them. Finnlay, we discuss different classes of research questions that would become tractable if an IIL were available.
Problem Orientation in Developing Computer Architectures
Authors: A. V. Palagin, A. F. Kurgayev
Venue: Cybernetics and Systems Analysis (2003)

The results of investigating the trends of evolution of computer architectures are considered from the viewpoint of problem orientation. Main directions of development, prospects, and realizability of highly efficient computer systems with virtual architecture are formulated and substantiated.
Personalcasting: Tailored Broadcast News
Authors: Mark Maybury, Warren Greiff, Stanley Boykin, Jay Ponte, Chad Mchenry, Lisa Ferro
Venue: User Modeling and User-Adapted Interaction (2004)

Broadcast news sources and newspapers provide society with the vast majority of real-time information. Unfortunately, cost efficiencies and real-time pressures demand that producers, editors, and writers select and organize content for stereotypical audiences. In this article we illustrate how content understanding, user modeling, and tailored presentation generation promise personalcasts on demand. Specifically, we report on the design and implementation of a personalized version of a broadcast news understanding system, MITRE's Broadcast News Navigator (BNN), that tracks and infers user content interests and media preferences. We report on the incorporation of Local Context Analysis to both expand the user's original query to the most related terms in the corpus, as well as to allow the user to provide interactive feedback to enhance the relevance of selected newsstories. We describe an empirical study of the search for stories on ten topics from a video corpus. By personalizing both the selection of stories and the form in which they are delivered, we provide users with tailored broadcast news. This individual news personalization provides more fine-grained content tailoring than current personalized television program level recommenders and does not rely on externally provided program metadata.
Remote access internetworking laboratory
Authors: Sung Yoo, Scott Hovis
Venue: ACM SIGCSE Bulletin (2004)

College students in computer networking courses are very interested in Internet technology because of the rapid growth in that area. Of particular interest is the need for practical experience in network design and configuration. A typical computer networking class curriculum includes the study of theory and the laboratory projects. The laboratory projects are designed to give students a better understanding of computer networks. Most of the laboratory projects are software projects. Furthermore it is common to find projects in the area of implementing an application layer protocol and protocol observations in many computer network course textbooks [7,11,12]. However, having a networking laboratory with the proper hardware facilities to teach real networking has several difficulties. These difficulties include funding for the hardware facility, physical space limitations, and physical accessibility of the lab facility [6,10]. We have designed a networking lab that can solve these problems. Old PCs have been converted to IP routers with the free router software Zebra [5]. The proposed laboratory system can be accessed through the Internet, and the network topology can be changed remotely.
Circular chromatic number and a generalization of the construction of Mycielski
Authors: Peter Che Bor Lam, Wensong Lin, Guohua Gu, Zengmin Song
Venue: Journal of Combinatorial Theory Series B (2003)

In this paper, we introduce a graph transformation analogous to that of Mycielski. Given a graph G and any integer m, one can transform G into a new graph µm(G), the generalized Mycielskian of G. Many basic properties of µm(G) were established in (Lam et al., Some properties of generalized Mycielski's graphs, to appear). Here we completely determine the circular chromatic number of µm(Kn) for any m(≥0) and n(≥ 2). We prove that for any odd integer n ≥ 3 and any nonnegative integer m, χc (µm(Kn)) = χ(µm(Kn)) = n + 1. This answers part of the question raised by Zhou (J. Combin. Theory Ser. B 70 (1997) 245) or that by Zhu (Discrete Math. 229 (2001) 371). Because µm(K3), for arbitrary m, is a planar graph with connectivity 3 and maximum degree 4, it provides another counterexample to a question asked by Vince (J. Graph Theory 17 (1993) 349). For any positive even number n(≥2) and any nonnegative integer m, we show that χc(µm(Kn)) = n + (1/t), where t = ⌊2m/n⌋ + 1. This gives a family of arbitrarily large critical graphs G with high connectivity and small maximum degree for which χc(G) can be arbitrarily close to χ(G) - 1.
Planar tilings and the search for an aperiodic prototile
Authors: Glenn Charles Rhoads
Venue:  (2003)

The most surprising planar tiling result in recent decades was the discovery in the 1960s of aperiodic sets of prototiles, that is sets of tiles which admit tilings of the Euclidean plane but where all such tilings are nonperiodic. In 1914, Roger Penrose discovered his famous aperiodic set consisting of just two prototiles. Since then, the outstanding open question has been whether there exists an aperiodic set containing just a single prototile. In an attempt to find such a prototile, I developed some tiling software which takes an arbitrary polytile (a class of promising types of tiles made by attaching together congruent copies of basic tiles) and tries either to find a periodic tiling or to prove that it does not tile the plane. Using this software, I eliminated millions of potential aperiodic prototiles; and determined the tiling status of every polyomino up through order fourteen, every polyhex up through order seven, and every aligned polyklein up through order twelve. Additionally, I found five tiles where the size of a minimal translational patch in any tiling admitted by the tile is larger than for any previously known tile (including one tile where the size is three times as large as the previously published record).
Empirical study of students' perceptions of online courses
Authors: Judith C. Simon, Lloyd D. Brooks, Ronald B. Wilkes
Venue: Current issues in IT education (2003)

The recent proliferation of availability of online courses and programs has caused some concerns related to ensuring that the time and cost investments provide beneficial results, both to students and the institutions providing the material. Students' perceptions of these programs are likely to affect their interest in enrolling in them. Schools need an awareness of these student perceptions to determine if a need exists to modify the delivery of online programs. This study was designed to determine current perceptions of online programs by potential students, compared with the traditional on-campus environment. Findings indicate those issues that are most important to students in course delivery and their beliefs as to whether these issues are more likely to be delivered through online or through traditional on-campus courses.
An approach to the analysis and test of crosstalk faults in digital VLSI circuits
Authors: Antonio Rubio, Noriyoshi Itazaki, Xiaole Xu, Kozo Kinoshita
Venue: Proceedings of the conference on European design automation (1991)

The continuous reduction of the device size in integrated circuits and the increasing of the switching rate cause parasitic capacitances between conducting layers might become dominant enough to provoke logic errors in the circuits. So, capacitive couplings can be considered as potential logic faults. Classical fault models do not cover this sort of faults. In this paper we present a logic fault characterization of these faults, a logic level circuit fault model, a crosstalk fault list generator working at layout level and a test pattern generation procedure for crosstalk type faults.