ppxscal/embedding_network huggingface dataset:
Heightened amusement park dark ride interactivity and creativity made possible with highly integrated technology
Authors: Ray Dominey, Rick Simon, Doug Wong
Venue: Computers in Entertainment (CIE) (2004)

At Six Flags Belgium, a new interactive dark ride called Challenge of Tutankhamon takes visitors on a journey deep into a replica of an ancient pyramid where the tomb of the legendary pharaoh, King Tutankhamon, was hidden from the world for thousands of years. The riders' challenge is to enter the uncharted passageways of the tomb and find the treasure. The ancient god Seth -- Lord of Disorder and Chaos -- has vowed to protect the sanctity of the tomb, and has unleashed the mystical terrors of the curse. The visitors' journey involves an interactive mythological battle with 3,000 year-old gods and demons that still protect the tomb of the pharaoh. We believe that the realism, interactivity and unique, individual riders' experience of this ride, created by Sally Corporation, together with many other amusement park dark rides, has advanced substantially in the last five years. The new dark ride phenomenon is being created by highly innovative companies utilizing major developments in technology that have enabled the enhanced interactivity, sophistication, and overall experience of these rides. Where rides once provided limited interactivity and clumsy movements powered by multiple types of systems and truckloads of cables with questionable reliability, they now give visitors complex interactivity that is achieved with a highly integrated and reliable solid-state audio and control system. This new approach replaces the bundles of cables with simple serial cable runs. Because the controllers are 100% solid-state, they can be reprogrammed on a moment's notice.
A Computational Geometry Approach to Web Personalization
Authors: Maria Rigou, Spiros Sirmakessis, Athanasios Tsakalidis
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

In this paper we present an algorithm for efficient personalized clustering. The algorithm combines the orthogonal range search with the k-windows algorithm. It offers a real-time solution for the delivery of personalized services in online shopping environments, since it allows on-line consumers to model their preferences along multiple dimensions, search for product information, and then use the clustered list of products and services retrieved for making their purchase decisions.
Development of Biological and Chemical Applications on a 64-node PC Cluster
Venue: Proceedings of the 1998 International Workshop on Innovative Architecture (1998)

In this paper, we will describe the development of two parallel applications running on our PC cluster which consists of 64 Pentium Pro 200MHz microprocessors. One is an integrated parallel calculation system, called the PAPIA system, dedicated to protein information analysis. The PAPIA system enables very fast protein database searches (3-D structure matching and sequence homology search) by fully utilizing the power of the 64 local hard-disks, as well as fast parallel calculations supported by the high-bandwidth and low-latency communication driver developed by RWCP. We have started a WWWservice (http://www.rwcp.or.jp/papia/) so any biologist can easily submit jobs to the PAPIA system through a WWW browser. The service has been accessed from 55 countries in the world.The other application is parallel molecular dynamics simulation. We have efficiently ported the AMBER program to the PC cluster, and then appended an optional functionality of the Barnes-Hut tree code for quick and accurate calculation of Coulomb potentials without a cut-off approximation (PPPC method). The RWC PC Cluster shows good scalability in these two real parallel applications. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Admission control with immediate notification
Authors: Michael H. Goldwasser
Venue: Journal of Scheduling (2003)

When admission control is used, an on-line scheduler chooses whether or not to complete each individual job successfully by its deadline. An important consideration is at what point in time the scheduler determines if a job request will be satisfied, and thus at what point the scheduler is able to provide notification to the job owner as to the fate of the request. In the loosest model, often seen in real-time systems, such a decision can be deferred up until the job's deadline passes. In the strictest model, more suitable for customer-based applications, a scheduler would be required to give notification at the instant that a job request arrives.Unfortunately there seems to be little existing research which explicitly studies the effect of the notification model on the performance guarantees of a scheduler. We undertake such a study by reexamining a problem from the literature. Specifically, we study the effect of the notification model on the non-preemptive scheduling of a single resource in order to maximize utilization. At first glance, it appears severely more restrictive to compare a scheduler required to give immediate notification to one which need not give any notification. Yet we are able to present alternate algorithms which provide immediate notification, while matching most of the performance guarantees which are possible by schedulers which provide no such notification. In only one case are we able to give evidence that providing immediate notification may be more difficult.
Using the online medium for discursive research about people with disabilities
Authors: Natilene Bowker, Keith Tuffin
Venue: Social Science Computer Review (2004)

Online interviews are deemed an effective and appropriate approach for accessing discourse about the online experiences of people with disabilities. Some of the central arguments in support of conducting discursive research online, a type of qualitative approach, are delineated. Various practical benefits are considered for researchers, as well as participants--especially those with disabilities. Ethical issues surrounding access to, and the analysis of, readily available data in online communities are brought to the fore. In light of ethical dilemmas surrounding naturalistic data collection online, an alternative approach is offered, which utilizes online interviews with people with disabilities about their online experiences. A description of the data-collection process is given, including participants and recruitment, materials and procedures, rapport building, and security and ethics. Reflections on the process highlight how methodological pitfalls were managed and, in some cases, resolved.
On reducing a system of equations to a single equation
Authors: Gudmund S. Frandsen, Igor E. Shparlinski
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

For a system of polynomial equations over Q;p; we present an efficient construction of a single polynomial of quite small degree whose zero set over Q;p; coincides with the zero set over Q;p; of the original system. We also show that the polynomial has some other attractive features such as low additive and straight-line complexity.The proof is based on a link established here between the above problem and some recent number theoretic result about zeros of p-adic forms.
Finding r-Dominating Sets and p-Centers of Trees in Parallel
Authors: Biing-Feng Wang
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Let T=(V, E) be an edge-weighted tree with |V|=n vertices embedded in the Euclidean plane. Let {\hbox{\rlap{I}\kern 2.0pt{\hbox{E}}}} denote the set of all points on the edges of T. Let X and Y be two subsets of {\hbox{\rlap{I}\kern 2.0pt{\hbox{E}}}} and let r be a positive real number. A subset D\subseteq X is an X/Y/r{\hbox{-}}dominating setif every point in Y is within distance r of a point in D. The X/Y/r{\hbox{-}}dominating setproblem is to find an X/Y/r{\hbox{-}}{\rm{dominating}} set D^* with minimum cardinality. Let p\ge 1 be an integer. The X/Y/p{\hbox{-}}centerproblem is to find a subset C^*\subseteq X of p points such that the maximum distance of any point in Y from C^* is minimized. Let X and Y be either V or {\hbox{\rlap{I}\kern 2.0pt{\hbox{E}}}}. In this paper, efficient parallel algorithms on the EREW PRAM are first presented for the X/Y/r{\hbox{-}}{\rm{dominating}} set problem. The presented algorithms require O(\log^2n) time for all cases of X and Y. Parallel algorithms on the EREW PRAM are then developed for the X/Y/p{\hbox{-}}{\rm{center}} problem. The presented algorithms require O(\log^3n) time for all cases of X and Y. Previously, sequential algorithms for these two problems had been extensively studied in the literature. However, parallel solutions with polylogarithmic time existed only for their special cases. The algorithms presented in this paper are obtained by using an interesting approach which we call the dependency-tree approach. Our results are examples of parallelizing sequential dynamic-programming algorithms by using the approach.
A Combinatorial Proof of Kneser&#x2019;s Conjecture
Authors: Ji&#x0159;&#x00ed; Matou&#x0161;ek
Venue: Combinatorica (2004)

Kneser&#x2019;s conjecture, first proved by Lov&#x00e1;sz in 1978, states that the graph with all k-element subsets of {1, 2, . . . , n} as vertices and with edges connecting disjoint sets has chromatic number n&#x2212;2k+2. We derive this result from Tucker&#x2019;s combinatorial lemma on labeling the vertices of special triangulations of the octahedral ball. By specializing a proof of Tucker&#x2019;s lemma, we obtain self-contained purely combinatorial proof of Kneser&#x2019;s conjecture.
A unified framework for nonlinear dependence testing and symbolic analysis
Authors: Robert A. van Engelen, J. Birch, Y. Shou, B. Walsh, Kyle A. Gallivan
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

This paper presents a unified approach for generalized induction variable recognition and substitution, pointer analysis, analysis of conditionally updated variables, value range analysis, array region analysis, and nonlinear dependence testing. The analysis techniques share a well-defined uniform approach based on the chains of recurrences algebra. The uniform algebraic approach provides a powerful unified framework for developing analysis algorithms for restructuring compilers. The paper introduces a new set of analysis algorithms that accurately handle conditional control flow, pointer arithmetic, and nonlinear symbolic expressions in loops, which are known to be problematic for conventional restructuring compilers.
Optimising cam motion using piecewise polynomials
Authors: P. Mermelstein, M. Acar
Venue: Engineering with Computers (2004)

The paper presents a method of synthesising cam profiles based on the use of piecewise polynomials together with an optimisation technique. Special cases and limitations are discussed and illustrated, making the procedure complete and systematic for any design requirements. Using piecewise polynomials, the complete cam profile can be designed as a combined linear system. The optimisation technique described goes even further, manipulating the variables in the linear system to select the ideal combination. In addition, a means to prove the validity of the results is explained.
Efficient Method for Geometric Attribute Estimation
Authors: Xi Chen, Yinglin Ke, An Li
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

A new method is proposed to estimate the discrete geometric attributes, such as normal vector and curvature. The method contains two steps: points sampling and 4D Shepard interpolation. In the first step, we extract points from point cloud and estimate the attribute of the sampled points. During the second step, we interpolate a global 4D Shepard surface over these sampled points and compute the attribute of each point in point cloud. This method is very effective for using a new global surface model. It benefits many applications such as segmentation, feature extraction, data preprocessing and etc. Application examples are given to verify the proposed method.
The next database revolution
Authors: Jim Gray
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database system. This gives an extensible object-relational system where non-procedural relational operators manipulate object sets. Coupled with this, each DBMS is now a web service. This has huge implications for how we structure applications. DBMSs are now object containers. Queues are the first objects to be added. These queues are the basis for transaction processing and workflow applications. Future workflow systems are likely to be built on this core. Data cubes and online analytic processing are now baked into most DBMSs. Beyond that, DBMSs have a framework for data mining and machine learning algorithms. Decision trees, Bayes nets, clustering, and time series analysis are built in; new algorithms can be added. There is a rebirth of column stores for sparse tables and to optimize bandwidth. Text, temporal, and spatial data access methods, along with their probabilistic reasoning have been added to database systems. Allowing approximate and probabilistic answers is essential for many applications. Many believe that XML and xQuery will be the main data structure and access pattern. Database systems must accommodate that perspective. External data increasingly arrives as streams to be compared to historical data; so stream-processing operators are being added to the DBMS. Publish-subscribe systems invert the data-query ratios; incoming data is compared against millions of queries rather than queries searching millions of records. Meanwhile, disk and memory capacities are growing much faster than their bandwidth and latency, so the database systems increasingly use huge main memories and sequential disk access. These changes mandate a much more dynamic query optimization strategy - one that adapts to current conditions and selectivities rather than having a static plan. Intelligence is moving to the periphery of the network. Each disk and each sensor will be a competent database machine. Relational algebra is a convenient way to program these systems. Database systems are now expected to be self-managing, self-healing, and always-up. We researchers and developers have our work cut out for us in delivering all these features.
Design of an e-book user interface and visualizations to support reading for comprehension
Authors: Yixing Sun, David J. Harper, Stuart N. K. Watt
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Current e-Book browsers provide minimal support for comprehending the organization, narrative structure, and themes, of large complex books. In order to build an understanding of such books, readers should be provided with user interfaces that present, and relate, the organizational, narrative and thematic structures. We propose adapting information retrieval techniques for the purpose of discovering these structures, and sketch three distinctive visualizations for presenting these structures to the e-Book reader. These visualizations are presented within an initial design for an e-Book browser.
Fast arithmetic with general Gauß periods
Authors: Joachim von zur Gathen, Michael Nöcker
Venue: Theoretical Computer Science (2004)

We show how to apply fast arithmetic in conjunction with general Gauß periods in finite fields. This is an essential ingredient for some efficient exponentiation algorithms.
Evaluation of the Automatic Multilinguality for Time Expression Resolution
Authors: E. Saquete, P. Marinez-Barco, R. Munoz
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In this paper, a semiautomatic extension of our monolingual (Spanish) TERSEO system (Temporal Expressions Resolution System applied to Event Ordering) to a multilingual level is presented. TERSEO implements a method of event ordering based on temporal expression recognition and resolution. TERSEO consists of two different modules, the first module is based on a set of rules that allows the recognition of the temporal expressions in Spanish. The second module is based on a set of rules that allows the resolution of these temporal expressions (which means transforming them into a concrete date, concrete interval or fuzzy interval). Both sets of rules were defined through an empirical study of a training corpus. The extension of the system, that makes the system able to work with multilingual texts, has been made in five stages. First, a direct translation of the temporal expressions in Spanish of our knowledge database to the target language (English, Italian, French, Catalan, etc) is performed. Each expression in the target language is linked to the same resolution rule used in the source language. The second stage is a search in Google for each expression so that we will eliminate all those expressions of which non exact instances are found. The third step is the obtaining of a set of keywords in the target language, that will be used in the next step to look for new temporal expressions in this language, learning new rules automatically. Finally, every new rule is linked with its resolution. Besides, we present two evaluations: an evaluation of the results obtained in the extension of the system to English and an evaluation of TERSEO system in English using this automatic acquisition of new TemporalExpressions in which measures of precision and recall are obtained.
Enabling sovereign information sharing using Web Services
Authors: Rakesh Agrawal, Dmitri Asonov, Ramakrishnan Srikant
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Sovereign information sharing allows autonomous entities to compute queries across their databases in such a way that nothing apart from the result is revealed. We describe an implementation of this model using web services infrastructure. Each site participating in sovereign sharing offers a data service that allows database operations to be applied on the tables they own. Of particular interest is the provision for binary operations such as relational joins. Applications are developed by combining these data services. We present performance measurements that show the promise of a new breed of practical applications based on the paradigm of sovereign information integration.
Query-related data extraction of hidden web documents
Authors: Y. L. Hedley, M. Younas, A. James, M. Sanderson
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

The larger amount of information on the Web is stored in document databases and is not indexed by general-purpose search engines (i.e., Google and Yahoo). Such information is dynamically generated through querying databases - which are referred to as Hidden Web databases. Documents returned in response to a user query are typically presented using template-generated Web pages. This paper proposes a novel approach that identifies Web page templates by analysing the textual contents and the adjacent tag structures of a document in order to extract query-related data. Preliminary results demonstrate that our approach effectively detects templates and retrieves data with high recall and precision.
Graph indexing: a frequent structure-based approach
Authors: Xifeng Yan, Philip S. Yu, Jiawei Han
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is desirable to retrieve graphs quickly from a large database via graph-based indices. In this paper, we investigate the issues of indexing graphs and propose a novel solution by applying a graph mining technique. Different from the existing path-based methods, our approach, called gIndex, makes use of frequent substructure as the basic indexing feature. Frequent substructures are ideal candidates since they explore the intrinsic characteristics of the data and are relatively stable to database updates. To reduce the size of index structure, two techniques, size-increasing support constraint and discriminative fragments, are introduced. Our performance study shows that gIndex has 10 times smaller index size, but achieves 3--10 times better performance in comparison with a typical path-based method, GraphGrep. The gIndex approach not only provides and elegant solution to the graph indexing problem, but also demonstrates how database indexing and query processing can benefit form data mining, especially frequent pattern mining. Furthermore, the concepts developed here can be applied to indexing sequences, trees, and other complicated structures as well.
Harpoon: a flow-level traffic generator for router and network tests
Authors: Joel Sommers, Hyungsuk Kim, Paul Barford
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

We describe Harpoon, a new application-independent tool for generating representative packet traffic at the IP flow level. Harpoon is a configurable tool for creating TCP and UDP packet flows that have the same byte, packet, temporal, and spatial characteristics as measured at routers in live environments. We validate Harpoon using traces collected from a live router and then demonstrate its capabilities in a series of router performance benchmark tests.
A Multimodal Interface for the Immediate Transcription of Radiology Dictation
Authors: Wu-chun Feng
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

We present the design and implementation of an integrated multimodal interface that deliversinstant turnaround on transcribing a radiology dictation. This instant turnaround time virtuallyeliminates a hospital's liability with respect to improper transcriptions of oral dictations and allbut eliminates the need for transcribers. The multimodal interface seamlessly integrates threemodes of input - speech, handwriting, and written gestures - to provide an easy-to-use systemfor the radiologist.
Architecture of a Parallel Computer Cenju-4
Venue: Proceedings of the 1998 International Workshop on Innovative Architecture (1998)

This paper describes the architecture and the evaluation results of a parallel computer Cenju-4. Cenju-4 supports two memory architectures: distributed memory with user-level message passing communication and distributed shared memory with cache-coherent nonuniform memory access (cc-NUMA) feature. Cenju-4 system consists of from 8 to 1024 nodes connected by a multistage network which has multicast, synchronization, and gather functions. Cenju-4 adopts a Mach micro kernel based operating system, which provides several services for parallel processing. We attained 5.5 µsec communication latency and 168 Mbytes/sec communication throughput in message passing communication. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player