ppxscal/embedding_network huggingface dataset:
From the chair
Authors: Janice C. Sipior, Laurie Schatzberg
Venue: ACM SIGMIS Database (2004)

Greetings!I am pleased to report that the ACM-SIGMIS CPR (Computer Personnel Research) 2004 Conference held at the Tucson Marriott University Park in Tucson, Arizona, April 22-24, 2004, was a great success! This year's conference was co-sponsored by the Arizona Center for Information Science and Technology (ACIST) and the University of Arizona's MIS Department. Please join me in extending our sincere appreciation to the members of the Conference Committee for all their efforts: Conference Chair, Mohan Tanniru, University of Arizona; Program Chair, Suzanne Weisband, University of Arizona; Conference Treasurer, Laurie Schatzberg, University of New Mexico; Publicity Chair, Sue Brown, Indiana University; and Arrangements Chair: Sherry Thatcher, University of Arizona.The first recipients of the "Magid Igbaria Outstanding Conference Paper of the Year Award" are Dr. Maren Simonsen, University of Bergen, and Dr. Maung Sein, University of Bergen and Agder University College, Norway, for their paper, "Conceptual Frameworks in Practice: Evaluating EU Training Strategy in Organizations." Congratulations to you both!The annual SIGMIS Business Meeting was held by Laurie Schatzberg, SIGMIS Vice Chair, directly after the close of the conference. A report on the improved status of our financial position, due in large part to proceeds from ACM's Digital Library, was presented. Please continue to consider Data Base and the ACM-SIGMIS CPR Conference as an outlet for your research and a source of information.A Preliminary Outcome Report for the CPR 2004 Conference was presented by Mohan Tanniru, CPR 2004 Conference Chair. A Progress Report for the CPR 2005 Conference was given by Mike Gallivan and Eph McLean, both of Georgia State University. Plans for next year's CPR 2005 Conference, to be held in Atlanta, Georgia, are underway. All members are welcome. Please contact Mike Gallivan, mgalliva@gsu.edu, or Eph McLean, emclean@gsu.edu, for more information.Finally, please join me in extending a warm welcome to our new Information Director: Susan Vowels, Washington College, svowels2@washcoll.eduIn response to a call for volunteers sent to the SIGMIS email distribution list (SIGMIS-members@acm.org), we received expressions of interest from eight members. After careful consideration by the SIGMIS Executive Committee, Susan was appointed, mid-term, to this 2 year position (July 2003 to July 2005). She replaces Diane Lending of James Madison University, who has graciously agreed to serve as the next CPR (Computer Personnel Research) Committee Chair. We would like to thank to Diane for her superior service as Information Director. We would like to take this opportunity to thank Fred Niederman of Saint Louis University for his outstanding contributions as the first CPR Committee Chair.As always, we encourage and welcome your suggestions. Please feel free to contact any one of us with your input or ideas. Have a nice summer!
DASH: Localising Dynamic Programming for Order of Magnitude Faster, Accurate Sequence Alignment
Authors: Paul Gardner-Stephen, Greg Knowles
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

In this paper we present our genomic and proteomic sequence alignment algorithm, DASH, which results in order of magnitude speed improvement when compared to NCBIBLAST 2.2.6 [1], with superior sensitivity. Dynamic programming (DP) is the predominant contributor to search time for algorithms such as BLAST and FastA/P [2]. Improving the efficiency of DP provides an opportunity to increase sensitivity, or significantly reduce search times and help offset the effects of the continuing exponential growth in database sizes. Specifically, for nucleotide searching we have demonstrated an order of magnitude speed improvement with significantly improved sensitivity, or alternatively moderate speed up with further sensitivity gains, depending on the parameters selected. Smith-Waterman [3] complete DP is used as the sensitivity benchmark. Similar speed and sensitivity results are presented for protein searching. Since our algorithm is highly parallel, we have developed dedicated hardware which we will present in a companion paper [4], and a distributed version of our software (DDASH), which we expect to provide linear speedup on a cluster.
Updating Building Layouts of Time-Varying Virtual Cities
Authors: Masanobu Honda, Kazunori Mizuno, Yukio Fukui, Seiichi Nishihara
Venue: Proceedings of the Computer Graphics International (2004)

We propose an approach to generating virtualcities that vary dynamically over time, focusing on thelayout of artificial elements such as building, roads,and traffic lights. We first define an environmentvector as the amount of features reflecting economicand functional activities of cityýs residents in eachblock surrounded by roads. Our method generatesvirtual cities by deleting and locating buildings fromtwo points of view: building layouts using vectorsthemselves to generate cityscapes, and time-varyingusing changes of vectors to vary cityscapes. Wedemonstrate that our method can represent featuresand generate various cityscapes that vary over time.
Effective stream-based and execution-based data prefetching
Authors: Sorin Iacobovici, Lawrence Spracklen, Sudarshan Kadambi, Yuan Chou, Santosh G. Abraham
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

With processor speeds continuing to outpace the memory subsystem, cache missing memory operations continue to become increasingly important to application performance. In response to this continuing trend, most modern processors now support hardware (HW) prefetchers, which act to reduce the missing loads observed by an application.This paper analyzes the behavior of cache-missing loads in SPEC CPU2000 and highlights the inability of unit and single non-unit stride prefetchers to correctly prefetch for some commonly occurring streams. In response to this analysis, a novel multi-stride prefetcher, that supports streams with up to four distinct strides, is proposed. Performance analysis for SPEC CPU2000 illustrates that the proposed multi-stride prefetcher can outperform current stride prefetchers on several benchmarks; most notably on mcf, lucas and facerec, where it achieves an additional performance gain of up to 57%. Performance of the strided HW prefetchers is also contrasted with another recently proposed prefetch scheme, runahead execution (RAE), and the synergy between the schemes is investigated.
Weakly Associative Functions on [0, 1] as Logical Connectives
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

This report focuses on a property of conjunctiveoperators named "weak associativity," which is one ofsufficient conditions for the syllogism in fuzzy logic. Theauthors introduce a class of binary operators on [0,1]which satisfy the weak associativity and some boundaryconditions. Our newly introduced class is broader than theclass of t-norms, and is included in that of Galois-operatorson [0,1] , which and of which right-residuals formGalois-connections on [0,1] . In addition, the authorsshow some methods to construct some weakly associativefunctions by using the generators of t-norms.
Collective asynchronous reading with polylogarithmic worst-case overhead
Authors: Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander A. Shvartsman
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the total number of read and write operations. First abstracted by Saks, Shavit, and Woll [37], Collect is among the standard problems in distributed computing, The model consists of $n$ asynchronous processes, each with a single-writer multi-reader register of a polynomial capacity. The best previously known deterministic solution performs O(n3/2log n) reads and writes, and it is due to Ajtai, Aspnes, Dwork, and Waarts [3]. This paper presents a new deterministic algorithm that performs O(n log7 n) read/write operations, thus substantially improving the best previous upper bound. Using an approach based on epidemic rumor-spreading, the novelty of the new algorithm is in using a family of expander graphs and ensuring that each of the successive groups of processes collect and propagate sufficiently many rumors to the next group. The algorithm is adapted to the Repeatable Collect problem, which is an on-line version. The competitive latency of the new algorithm is O(log7 n) vs. the much higher competitive latency O(√nlog n) given in [3]. A result of independent interest in this paper abstracts a gossiping game that is played on a graph and that gives its payoff in terms of expansion.
'Visual-Fidelity' Dataglove Calibration
Authors: Ferenc Kahlesz, Gabriel Zachmann, Reinhard Klein
Venue: Proceedings of the Computer Graphics International (2004)

This paper presents a novel calibration method for data-gloveswith many degrees of freedom 1. The goal of ourmethod is to establish a mapping from the sensor valuesof the glove to the joint angles of an articulated hand thatis of ýhigh visualý fidelity. This is in contrast to previousmethods that aim at determining the absolute values of thereal joint angles with high accuracy. The advantage of ourmethod is that it can be simply carried through without theneed for auxiliary calibration hardware (such as cameras),while still producing visually correct mappings. To achievethis, we developed a method that explicitly models the cross-couplingsof the abduction sensors with the neighboring flexsensors. The results show that our method performs superiorto linear calibration in most cases.
Cost-based labeling of groups of mass spectra
Authors: Lei Chen, Zheng Huang, Raghu Ramakrishnan
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

We make two main contributions in this paper. First, we motivate and introduce a novel class of data mining problems that arise in labeling a group of mass spectra, specifically for analysis of atmospheric aerosols, but with natural applications to market-basket datasets. This builds upon other recent work in which we introduced the problem of labeling a single spectrum, and is motivated by the advent of a new generation of Aerosol Time-of-Flight Spectrometers, which are capable of generating mass spectra for hundreds of aerosol particles per minute. We also describe two algorithms for group labeling, which differ greatly in how they utilize a linear programming (LP) solver, and also differ greatly from algorithms for labeling a single spectrum.Our second contribution is to show how to automatically select between these two algorithms in a cost-based manner, analogous to how a query optimizer selects from a space of query plans. While the details are specific to the labeling problem, we believe that is a promising first step towards a general framework for cost-based data mining, and opens up an important direction for future search.
Reporters, Editors and Presenters: Using Embodied Agents to Report on Online Computer Games
Authors: Dan Fielding, Mike Fraser, Brian Logan, Steve Benford
Venue: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3 (2004)

We present a multi-agent framework to generate reports of playersý activities within multi-player computer games. We describe an initial implementation of our framework as an extension to the Capture the Flag game within Unreal Tournament, and sketch future applications of this work including other genres of games, the emergence of games as a spectator sport, implications for pervasive games as well as non-gaming applications.
Better extractors for better codes?
Authors: Venkatesan Guruswami
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We present an explicit construction of codes that can be list decoded from a fraction (1-ε) of errors in sub-exponential time and which have rate ε/logO(1)(1/ε). This comes close to the optimal rate of Ω(ε), and is the first sub-exponential complexity construction to beat the rate of ε2 achieved by Reed-Solomon or algebraic-geometric codes. Our construction is based on recent extractor constructions with very good seed length [17]. While the "standard" way of viewing extractors as codes (as in [16]) cannot beat the O(ε2) rate barrier due to the 2 log (1/ε) lower bound on seed length for extractors, we use such extractor codes as a component in a well-known expander-based construction scheme to get our result. The O(ε2) rate barrier also arises if one argues about list decoding using the minimum distance (via the so-called Johnson bound) --- so this also gives the first explicit construction that "beats the Johnson bound" for list decoding from errors.The main message from our work is perhaps conceptual, namely that good strong extractors for low min-entropies will yield near-optimal list decodable codes. Given all the progress that has been made on extractors, we view this as an optimistic avenue to look for better list decodable codes, both by looking for better explicit extractor constructions, as well as by importing non-trivial techniques from the extractor world in reasoning about and constructing codes.
Development of Web-Based Correction System for Artistic Design
Authors: Tsuneko A. Kura, Naoyuki Kakehi, Hideo Suzuki, Takeshi Sugiyama, Tokiichiro Takahashi, Keiko Takemiya
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

We have developed a web-based correction systemfor artistic design education. This system aims toeliminate the restrictions on the time and location ofstudying for both students and teachers. It enablesstudents to submit their work easily and it enablesteachers to coach students by correcting their work ona web browser. Thus, it can assist artistic designeducation effectively.
Book Reviews
Authors: Shari Lawrence Pfleeger
Venue: IEEE Security and Privacy (2004)

Book review of "A Gift of Fire: The Social, Legal and Ethical Issues for Computers and the Internet," by Sara Baase.
Using WGENK to generate synthetic daily weather data for modelling of agricultural processes
Authors: Leszek Kuchar
Venue: Mathematics and Computers in Simulation (2004)

In the paper, the weather generator WGENK producing synthetic daily data of solar radiation, maximum and minimum temperature, and total precipitation is presented. A WGENK model, modification of WGEN model, introduces annual courses of transition probability, α parameter of Γ distribution, and correlation's between solar radiation and temperatures described by trigonometric polynomials. The method was tested by comparing statistics of 200 years of generated data with 20 years of observed weather data for five weather stations of southwest of Poland. The absolute correlation errors were decreased about three times in various time period while standard deviation of precipitation has lowered two times compared to original WGEN model; new correlations were examined (at 0.05 level) and accepted in 95% of 2520 tests.
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
Authors: Igor Kaporin
Venue: Theoretical Computer Science (2004)

The main purpose of this paper is to present a fast matrix multiplication algorithm taken from the paper of Laderman et al. (Linear Algebra Appl. 162-164 (1992) 557) in a refined compact "analytical" form and to demonstrate that it can be implemented as quite efficient computer code. Our improved presentation enables us to simplify substantially the analysis of the computational complexity and numerical stability of the algorithm as well as its computer implementation. The algorithm multiplies two N × N matrices using O(N2.7760) arithmetic operations. In the case where N = 18 ċ 48k, for a positive integer k, the total number of flops required by the algorithm is 4.894N2.7760 - 16.165N2, which may be compared to a similar estimate for the Winograd algorithm, 3.732N2.8074 - 5N2 flops, N = 8 ċ 2k, the latter being current record bound among all known practical algorithms. Moreover, we present a pseudo-code of the algorithm which demonstrates its very moderate working memory requirements, much smaller than that of the best available implementations of Strassen and Winograd algorithms. For matrices of medium-large size (say, 2000 ≤ N < 10,000) we consider one-level algorithms and compare them with the (multilevel) Strassen and Winograd algorithms. The results of numerical tests clearly indicate that our accelerated matrix multiplication routines implementing two or three disjoint product-based algorithm are comparable in computational time with an implementation of Winograd algorithm and clearly outperform it with respect to working space and (especially) numerical stability. The tests were performed for the matrices of the order of up to 7000, both in double and single precision.
A collaborative filtering algorithm and evaluation metric that accurately model the user experience
Authors: Matthew R. McLaughlin, Jonathan L. Herlocker
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Collaborative Filtering (CF) systems have been researched for over a decade as a tool to deal with information overload. At the heart of these systems are the algorithms which generate the predictions and recommendations.In this article we empirically demonstrate that two of the most acclaimed CF recommendation algorithms have flaws that result in a dramatically unacceptable user experience.In response, we introduce a new Belief Distribution Algorithm that overcomes these flaws and provides substantially richer user modeling. The Belief Distribution Algorithm retains the qualities of nearest-neighbor algorithms which have performed well in the past, yet produces predictions of belief distributions across rating values rather than a point rating value.In addition, we illustrate how the exclusive use of the mean absolute error metric has concealed these flaws for so long, and we propose the use of a modified Precision metric for more accurately evaluating the user experience.
Easy SoC Design with VCI SystemC Adapters
Authors: Salim Ouadjaout, Dominique Houzet
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

A System on Chip (SoC) contains a large number of components including hard cores, soft cores and basic standard cells. Short time to market and rich functionality requirements have driven design houses to adopt the SoC design flow. The complexity of SoC design requires the use of IPs from many different sources in order to reduce time-to-market windows. However, it is important that standardization emerges in the industry to enable the import and export of key IP modules. Thus a standard is very useful. A standard such as VSIA's Virtual Component Interface [Virtual Component Interface Standard (OCB 2 1.0)] has its usefulness in allowing easy integration of IP. In this paper we suggest a top-down methodology [Top-Down system Level Design Methodology Using SpecC, Vcc and systemC] from SystemC to silicon. In our methodology, we focus on methods to make design flow smooth, efficient and easy by allowing a rapid integration of communication. The communication integration is based on a custom library of interface adapters that use VCI standard. This library aims to perform the interface synthesis which allows heterogeneous IPs to communicate in a plug-and-play fashion in the same system.
QoS of Timeout-Based Self-Tuned Failure Detectors: The Effects of the Communication Delay Predictor and the Safety Margin
Authors: Raul Ceretta Nunes, Ingrid Jansch-Porto
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Unreliable failure detectors have been an importantabstraction to build dependable distributed applicationsover asynchronous distributed systems subject to faults.Their implementations are commonly based on timeoutsto ensure algorithm termination. However, for systemsbuilt on the Internet, it is hard to estimate this time valuedue to traffic variations. Thus, different types ofpredictors have been used to model this behavior andmake predictions of delays. In order to increase thequality of service (QoS), self-tuned failure detectorsdynamically adapt their timeouts to the communicationdelay behavior added of a safety margin. In this paper,we evaluate the QoS of a failure detector for differentcombinations of communication delay predictors andsafety margins. As the results show, to improve the QoS,one must consider the relation between the pairpredictor/margin, instead of each one separately.Furthermore, performance and accuracy requirementsshould be considered for a suitable relationship.
Writing-all deterministically and optimally using a non-trivial number of asynchronous processors
Authors: Dariusz R. Kowalski, Alexander A. Shvartsman
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

The problem of performing n tasks on p asynchronous or undependable processors is a basic problem in distributed computing. This paper considers an abstraction of this problem called Write-All: using p processors write 1's into all locations of an array of size n. In this problem writing 1 abstracts the notion of performing a simple task. Despite substantial research, there is a dearth of efficient deterministic asynchronous algorithms for Write-All. Efficiency of algorithms is measured in terms of work that accounts for all local steps performed by the processors in solving the problem. Thus an optimal algorithm would have work Θ(n), however it is known that optimality cannot be achieved when p=Ω(n). The quest then is to obtain work-optimal solutions for this problem using a non-trivial, compared to n, number of processors p. Recently it was shown that optimality can be achieved using a non-trivial number M of processors, where M=4√n/log n. The new result in this paper significantly extends the range of processors for which optimality is achieved. The result shows that optimality can be achieved using close to M2 processors; more precisely, using (M log M)2-ε processors, for any ε > 0. Additionally, the new result uses only the atomic read/write memory, without resorting to using the test-and-set primitive that was necessary in the previous solution. This paper presents the algorithm and gives its analysis showing that the work complexity of the algorithm is O(n+p2+ε), which is optimal when p = O(n1/(2+ε)), while all prior deterministic algorithms require super-linear work when p=Ω(n1/4).
An Intrinsically Robust Technique for Fault Tolerance under Multiple Upsets
Authors: C. A. L. Lisboa, L. Carro
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

In this study, the use of stochastic operators for thedesign of inherently robust circuits for future technologiesis proposed, being an alternative to conventionaldigital arithmetic operators.
Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace
Authors: R. Ahlswede, H. Aydinian, L. Khachatrian
Venue: Combinatorica (2003)

We introduce and solve a natural geometrical extremal problem. For the set E(n,w) = {xn &#x2208; {0,1}n : xn has w ones } of vertices of weight w in the unit cube of &#x211d;n we determine M (n,k,w) &#x225c; max{|Ukn &#x2229; E(n,w)|:Ukn is a k-dimensional subspace of &#x211d;n. We also present an extension to multi-sets and explain a connection to a higher dimensional Erd&#x0151;s&#x2013;Moser type problem.