ppxscal/embedding_network huggingface dataset:
The Vector-Thread Architecture
Authors: Ronny Krashinsky, Christopher Batten, Mark Hampton, Steve Gerding, Brian Pharris, Jared Casper, Krste Asanovic
Venue: ACM SIGARCH Computer Architecture News (2004)

The vector-thread (VT) architectural paradigm unifies the vectorand multithreaded compute models. The VT abstraction providesthe programmer with a control processor and a vector of virtualprocessors (VPs). The control processor can use vector-fetch commandsto broadcast instructions to all the VPs or each VP can usethread-fetches to direct its own control flow. A seamless intermixingof the vector and threaded control mechanisms allows a VT architectureto flexibly and compactly encode application parallelismand locality, and a VT machine exploits these to improve performanceand efficiency. We present SCALE, an instantiation of theVT architecture designed for low-power and high-performance embeddedsystems. We evaluate the SCALE prototype design usingdetailed simulation of a broad range of embedded applications andshow that its performance is competitive with larger and more complexprocessors.
Lessons learned from eClass: Assessing automated capture and access in the classroom
Authors: Jason A. Brotherton, Gregory D. Abowd
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2004)

This article presents results from a study of an automated capture and access system, eClass, which was designed to capture the materials presented in college lectures for later review by students. In this article, we highlight the lessons learned from our three-year study focusing on the effect of capture and access on grades, attendance, and use of the captured notes and media. We then present suggestions for building future systems discussing improvements from our system in the capture, integration, and access of college lectures.
Efficient Query Processing on Relational Data-Partitioning Index Structures
Authors: Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

In contrast to space-partitioning index structures,data-partitioning index structures naturally adapt to the actualdata distribution which results in a very good query responsebehavior. Besides efficient query processing, moderndatabase applications including computer-aided design,medical imaging, or molecular biology requirefully-fledged database management systems in order toguarantee industrial-strength. In this paper, we show howwe can achieve efficient query processing on data-partitioningindex structures within general purpose databasesystems. We reduce the navigational index traversal cost byusing "extended index range scans". If a directory node is"largely" covered by the actual query, the recursive treetraversal for this node can beneficially be replaced by ascan on the leaf level of the index instead of navigatingthrough the directory any longer. On the other hand, forhighly selective queries, the index is used as usual. In thispaper, we demonstrate the benefits of this idea for spatialcollision queries on the Relational R-tree. Our experimentswith an Oracle9i database system show that our new approachoutperforms common index structures and the sequentialscan considerably.
Web taxonomy integration through co-bootstrapping
Authors: Dell Zhang, Wee Sun Lee
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

We address the problem of integrating objects from a source taxonomy into a master taxonomy. This problem is not only currently pervasive on the web, but also important to the emerging semantic web. A straightforward approach to automating this process would be to learn a classifier that can classify objects from the source taxonomy into categories of the master taxonomy. The key insight is that the availability of the source taxonomy data could be helpful to build better classifiers for the master taxonomy if their categorizations have some semantic overlap. In this paper, we propose a new approach, co-bootstrapping, to enhance the classification by exploiting such implicit knowledge. Our experiments with real-world web data show substantial improvements in the performance of taxonomy integration.
Topic prediction based on comparative retrieval rankings
Authors: Chris Buckley
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

A new measure, AnchorMap, is introduced to evaluate how close two document retrieval rankings are to each other. It is shown that AnchorMap scores, when run on a set of initial ranked document lists from 8 different systems, are very highly correlated with categorization of topics as easy or hard, and separately, are highly correlated with those topics on which blind feedback works. In another experiment, AnchorMap is used to compare the initial ranked document list from a single system against the ranked document list from that system after blind feedback. Again, high AnchorMap values are highly correlated with both topic difficulty and successful application of blind feedback. Both experiments are examples of using properties of a topic which are independent of relevance information to predict the actual performance of IR systems on the topic. Initial experiments to attempt to improve retrieval performance based upon AnchorMap failed; the causes for failure are discussed.
An Adaptive Algorithm for Efficient Message Diffusion in Unreliable Environments
Authors: Benoit Garbinato, Fernando Pedone, Rodrigo Schmidt
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

In this paper, we propose a novel approach for solvingthe reliable broadcast problem in a probabilisticunreliable model. Our approach consists in first definingthe optimality of probabilistic reliable broadcastalgorithms and the adaptiveness of algorithms thataim at converging toward such optimality. Then, wepropose an algorithm that precisely converges towardthe optimal behavior, thanks to an adaptive strategybased on Bayesian statistical inference. We comparethe performance of our algorithm with that of a typicalgossip algorithm through simulation. Our resultsshow, for example, that our adaptive algorithm quicklyconverges toward such exact knowledge.
A Process Model for Successful CRM System Development
Authors: Hee-Woong Kim
Venue: IEEE Software (2004)

The failure rate of information systems development is estimated to be greater than 65 percent. Lowering the failure rate and supporting IS success are the ultimate goals of IS practitioners and researchers. However, few studies have focused on how the IS development process leads to successful consequences. The author argues that the state of knowledge in IS development is analogous to cooking with a list of ingredients but without the recipe. This study presents a process model for successful IS development, examining success and failure cases of customer relationship management system development to elucidate what factors are critical in IS development, how the factors influence each other, and how interplays among them lead to project outcome. The proposed model helps developers understand how to avoid repeating project failure patterns and can be used for guiding new IS development.
Ontology Formalism Transformation
Authors: Petr Aubrecht, Lubos Kral
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This article deals with the problem how to transform an ontology between different formalisms. The presented methodology requires defining meta-models of the source and the target formalisms and defining a mapping between them. This allows us then to convert any ontology encoded in the source formalism to the target one. It is further shown that an extension of the SumatraTT system can be used to implement such transformations easily. The research presented in the paper has been motivated by the needs of the CIPHER research project (Communities of Interest Promoting Heritage of Europian Regions).
Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems
Authors: J. M. López, J. L. Díaz, D. F. García
Venue: Real-Time Systems (2004)

The utilization bound for earliest deadline first (EDF) scheduling is extended from uniprocessors to homogeneous multiprocessor systems with partitioning strategies. First results are provided for a basic task model, which includes periodic and independent tasks with deadlines equal to periods. Since the multiprocessor utilization bounds depend on the allocation algorithm, different allocation algorithms have been considered, ranging from simple heuristics to optimal allocation algorithms. As multiprocessor utilization bounds for EDF scheduling depend strongly on task sizes, all these bounds have been obtained as a function of a parameter which takes task sizes into account. Theoretically, the utilization bounds for multiprocessor EDF scheduling can be considered a partial solution to the bin-packing problem, which is known to be NP-complete. The basic task model is extended to include resource sharing, release jitter, deadlines less than periods, aperiodic tasks, non-preemptive sections, context switches, and mode changes.
Bounded VC-Dimension Implies a Fractional Helly Theorem
Authors: Jir&#x00ed; Matousek
Venue: Discrete Computational Geometry (2004)

We prove that every set system of bounded VC-dimension has a fractional Helly property. More precisely, if the dual shatter function of a set system $\FF$ is bounded by $o(m^k)$, then $\FF$ has fractional Helly number $k$. This means that for every $\alpha>0$ there exists a $\beta>0$ such that if $F_1,F_2,\ldots,F_n\in\FF$ are sets with $\bigcap_{i\in I}F_i\neq\emptyset$ for at least $\alpha{n\choose k}$ sets $I\subseteq\{1,2,\ldots,n\}$ of size $k$, then there exists a point common to at least $\beta n$ of the $F_i$. This further implies a $(p,k)$-theorem: for every $\FF$ as above and every $p\geq k$ there exists $T$ such that if $\GG\subseteq\FF$ is a finite subfamily where among every $p$ sets, some $k$ intersect, then $\GG$ has a transversal of size $T$. The assumption about bounded dual shatter function applies, for example, to families of sets in $\Rd$ definable by a bounded number of polynomial inequalities of bounded degree; in this case we obtain fractional Helly number $d{+}1$.
The zero-one principle for switching networks
Authors: Yossi Azar, Yossi Richter
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied in the analysis of diverse models, one common property was evident: the analysis of input sequences composed solely of two different values is always substantially easier, and many results are known only for restricted value sequences. Motivated by this, we introduce our zero-one principle for switching networks which characterizes a wide range of algorithms for which achieving c-approximation (as well as c-competitiveness) with respect to sequences composed of 0's and 1's implies achieving c-approximation. The zero-one principle proves to be very efficient in the design of switching algorithms, and substantially facilitates their analysis. We present three applications. First, we consider the Multi-Queue QoS Switching model and design a 3-competitive algorithm, improving the result from [6]. Second, we study the Weighted Dynamic Routing problem on a line topology of length k and present a (k+1)-competitive algorithm, which improves and generalizes the results from [1,12]. As a third application, we consider the work of [11], that compares the performance of local algorithms to the global optimum in various network topologies, and generalize their results from 2-value sequences to arbitrary value sequences.
Configurable Event Communication in Cadena
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

To satisfy the stringent QoS requirements of distributedreal-time embedded (DRE) systems, middleware servicescustomized to the specific needs of the application may beneeded. This problem is often attacked by re-implementingall or large portions of an existing middleware service,which can be a time-consuming and an error prone task.In this paper, we propose a model-driven approach formiddleware customization. To enable this approach, wepropose Event Communication Framework (ECF), a customizablemiddleware framework which provides a numberof different options for implementing various featuresof event communication. To determine when to exerciseeach option, we have performed experiments to identifythe application contexts in which each ECF mechanismperforms better than the others. Heuristics from these experimentshave been incorporated into algorithms whichanalyze high-level specifications of application scenariosto identify where ECF customizations can be applied. Weprovide configuration tools that generate customized pushpaths for event notifications using a combination of codesynthesis, weaving and transformation techniques. Wehave applied our approach to the application scenarios inthe Boeing BoldStroke system.
Large system performance of SPEC OMP benchmark suites
Authors: Hideki Saito, Greg Gaertner, Wesley Jones, Rudolf Eigenmann, Hidetoshi Iwashita, Ron Lieberman, Matthijs van Waveren, Brian Whitney
Venue: International Journal of Parallel Programming (2003)

Performance characteristics of application programs on large-scale systems are often significantly different from those on smaller systems. SPEC OMP includes benchmark suites intended for measuring performance of modern shared memory parallel systems. SPEC OMPM2001 is developed for medium-scale (4- to 16-way) systems whereas SPEC OMPL2001 is developed for large-scale systems (32-way and larger). We present our experiences on benchmark development in achieving good scalability using the OpenMP API. We also analyze the published results of these benchmark suites on large systems (32-way and larger), based on application program behavior and systems' architectural features.
Projector-Based Dual-Resolution Stereoscopic Display
Authors: Guy Godin, Jean-François Lalonde, Louis Borgeat
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

We present a stereoscopic display system which incorporates a high-resolution inset image, or fovea. We describethe specific problem of false depth cues along the boundaries of the inset image, and propose a solution in whichthe boundaries of the inset image are dynamically adaptedas a function of the geometry of the scene. This methodproduces comfortable stereoscopic viewing at a low additional computational cost. The four projectors need only beapproximately aligned: a single drawing pass is required, regardless of projector alignment, since the warping is applied as part of the 3-D rendering process.
A study of mixtures of HfO2 and TiO2 as high-k gate dielectrics
Authors: F. Chen, X. Bin, C. Hella, X. Shi, W. L. Gladfelter, S. A. Campbell
Venue: Microelectronic Engineering (2004)

HfxTi1-xO2 films have been deposited by chemical vapor deposition. Permittivities of approximately 50 have been obtained. The films are stable up to 1000 °C. The interface properties and charge trapping appear to depend on composition. For films with approximately equal Hf and Ti concentration, transistor characteristics and inversion layer mobilities are comparable to those obtained when using pure HfO2.
Well-posedness in BVt and convergence of a difference scheme for continuous sedimentation in ideal clarifier-thickener units
Authors: R. B&#x00fc;rger, K. H. Karlsen, N. H Risebro, J. D. Towers
Venue: Numerische Mathematik (2004)

We consider a scalar conservation law modeling the settling of particles in an ideal clarifier-thickener unit. The conservation law has a nonconvex flux which is spatially dependent on two discontinuous parameters. We suggest to use a Kru&#x017e;kov-type notion of entropy solution for this conservation law and prove uniqueness (L1 stability) of the entropy solution in the BVt class (functions W(x,t) with &#x2202;tW being a finite measure). The existence of a BVt entropy solution is established by proving convergence of a simple upwind finite difference scheme (of the Engquist-Osher type). A few numerical examples are also presented.
Hyperexponential solutions of finite-rank ideals in orthogonal ore rings
Authors: George Labahn, Ziming Li
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

An orthogonal Ore ring is an abstraction of common properties of linear partial differential, shift and q-shift operators. Using orthogonal Ore rings, we present an algorithm for finding hyperexponential solutions of a system of linear differential, shift and q-shift operators, or any mixture thereof, whose solution space is finite-dimensional. The algorithm is applicable to factoring modules over an orthogonal Ore ring when the modules are also finite-dimensional vector spaces over the field of rational functions.
Point Based Rendering for Massive Data Sets: A Case Study
Authors: Stephan Mantler, Anton L. Fuhrmann
Venue: Proceedings of the Computer Graphics International (2004)

In this case study, we describe our experiences with implementinga hybrid polygonal and point based renderingsystem for displaying large data sets. Our reasons forchoosing a point based system are explained in detail, togetherwith some notes about the implementation and howit was integrated into a larger environment. We will then describesome of the unforeseen problems of using point basedrendering in OpenGL, and how we solved these issues. Weconclude the report with a discussion of what worked welland what didnýt, and the lessons learned.
The MDF discrimination measure: fisher in disguise
Authors: Marco Loog, Robert P. W. Duin, Max A. Viergever
Venue: Neural Networks (2004)

Recently, a discrimination measure for feature extraction for two-class data, called the maximum discriminating (MDF) measure (Talukder and Casasent [Neural Networks 14 (2001) 1201-1218]), was introduced.In the present paper, it is shown that the MDF discrimination measure produces exactly the same results as the classical Fisher criterion, on the condition that the two prior probabilities are chosen to be equal. The effect of unequal priors on the efficiency of the measures is also discussed.
A conjecture about polynomial time computable lattice-lattice functions
Authors: Miklós Ajtai
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We formulate a conjecture which describes all of the polynomial time computable (p. t. c. ) functions f with domain(f)=lattice n, range(f) ⊆ lattice m, m ≤ nc, where latticen is the set of lattices in Rn with determinant 1. A former conjecture, the 0-1-conjecture, of the author states that all 0,1-valued functions defined on latticen are constant almost everywhere. Since the n-dimensional lattices as Abelian groups are pairwise isomorphic we can say that, according to this conjecture, the value of a p. t. c. 0,1-function may depend only on the algebraic structure of the lattice and not on the metric defined on it. The new conjecture generalizes this statement for functions where the value is also a lattice. As a typical example we can think of the function f(L)=L′, where L′ is the dual of L. When both the domain and the range of the functions are n-dimensional lattices with determinants 1 then, according to the conjecture, every p. c. t. functions are either constant or identical almost everywhere to f(L)=AL, or f(L)=AL′, where A is a suitably chosen linear transformation with determinant one.There is a striking analogy between the new conjecture and theorems describing the uniquely definable functions which assign for each n-dimensional vectorspace an m-dimensional vectorspace. These theorems are closely related to questions about the Axiom of Choice. In this analogy polynomial time computation corresponds to definability (in set theory) and lattices to finite dimensional vectorspaces.
A Probabilistic Approach to Fault-Tolerant Routing Algorithm on Mesh Networks
Authors: Gaocai Wang, Taoshen Li, Jianer Chen
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

In this paper, we propose a novel and efficientfault tolerant routing algorithm for mesh networksbased on the concept of k-submesh without virtualchannels and not sacrifice non-faulty nodes. Ouralgorithm is distributed and local information based.Due to the fact that our algorithm is designed basedon k-submesh structure, we apply probabilistic analysison the fault tolerance of our routing algorithm.Suppose that each node has an independent failureprobability, we derive the probability that our routingalgorithm successfully returns a fault-free routingpath. For example, we formally prove that aslong as the node failure probability is bounded by0.35%, our routing algorithm succeeds in finding afault-free routing path with high probability of 99%on mesh networks with 250000 nodes. Our algorithmruns in liner time and simulation results showthat the length of the routing path constructed by ouralgorithm are very close to the optimal length.
Researching the impact of the networked information environment on learning and teaching
Authors: M. Zenios, P. Goodyear, C. Jones
Venue: Computers Education (2004)

During the last decade, the focus of innovation and research in the field of computers and education has shifted from strand-alone to networked computers. The rapidly growing educational use of networked computers raises questions about which approaches to research can tell us most about improving educational impact. A key aim of this paper is to stimulate discussion about such research approaches by presenting a methodological case study of the use 'project logic' evaluation methods. The paper draws on our formative evaluation of what is currently the largest learning technology development programme in UK tertiary education. Originally called the Distributed National Electronic Resource (DNER) and more recently re-named the Information Environment (IE), this development is intended to create a managed environment for accessing quality-assured information resources on the Internet (DNER, 2002). These resources are intended for a variety of purposes in tertiary education, including research. However, our focus has been on the use, or likely use, of these resources for teaching and learning something that was the intended focus of a substantial number of projects funded under the DNER/IE umbrella. The paper illustrates a method for helping project teams articulate their implicit theories about learning and change. which we argue are important in predicting and improving educational impact.
Understanding spaces as places: extending interaction design paradigms
Authors: Luigina Ciolfi
Venue: Cognition, Technology and Work (2004)

This short paper focuses on some issues involved in the design of ubiquitous technologies and their integration within physical spaces. Current design methodologies and techniques do not explicitly consider the importance of gaining a full understanding of the human experience of space when designing technologies that will pervade and become an integral part of our physical environment. This paper is specifically focused on the importance of considering spaces as places, and of analysing those features of a place that are going to shape users&#x2019; interactions with technologically enhanced environments. It also examines the future implications that this approach may have on theoretical and methodological aspects of interaction design.