ppxscal/embedding_network huggingface dataset:
A Haptically Enhanced Broadcasting System
Authors: Jongeun Cha, Jeha Ryu, Seungjun Kim, Byungha Ahn
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper, we discuss a haptically enhanced broadcasting system. Four stages of a proposed system are briefly analyzed: scene capture, edit, transmission, and display with haptic interaction. In order to show usefulness of the proposed system, a potential home shopping scenario is implemented.
Real Time Environment Map Interpolation
Authors: Wenle Wang, Lifeng Wang, Stephen Lin, Jianmin Wang, Baining Guo
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Environment mapping, or reflection mapping, has been widely used in the game and movie industries to give objects a realistic illumination atmosphere. For moving objects, direct frame-by-frame calculation of environment maps and correspondence-based interpolation are both impractical for real-time applications due to the large computational costs. To deal with this problem, "fake" environment mapping with a fixed, pre-generated environment image has been commonly used, but clearly such an approximation is inadequate for a highly reflective object whose environment is constantly changing as it moves. In this paper, we present an approach that sparsely samples environment maps of a moving object and rapidly interpolates them for high performance. Two techniques are introduced for fast environment map interpolation without computation of scene shading. The first method utilizes scene geometry to facilitate interpolation, and the second involves geometry reconstruction from depth buffer values to reduce inefficiencies caused by complex scene geometry. These two techniques can easily be implemented in graphics hardware, and test results show that they achieve significant boosts in performance over frame-by-frame environment map computation with little loss in visual quality.
Parallel computation of Janet and Gröbner bases over rational numbers
Authors: V. P. Gerdt, D. A. Yanovich
Venue: Programming and Computing Software (2005)

In this paper, a parallel algorithm for computation of polynomial Janet bases is considered. After construction of a Janet basis, a reduced Gröbner basis (which is a subset of the Janet basis) is extracted from it without any additional reductions. The algorithm discussed is an improved version of an earlier suggested parallel algorithm. The efficiency of a C implementation of the algorithm and its scalability are illustrated by way of the standard test examples that are often used for comparing various algorithms and codes for computing Gröbner bases.
Message Passing for Linux Clusters with Gigabit Ethernet Mesh Connections
Authors: Jie Chen, William Watson III, Robert Edwards, Weizhen Mao
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 9 - Volume 10 (2005)

Multiple copper-based commodity Gigabit Ethernet (GigE) interconnects (adapters) on a single host can lead to Linux clusters with mesh/torus connections without using expensive switches and high speed network interconnects (NICs). However traditional message passing systems based on TCP for GigE will not perform well for this type of clusters because of the overhead of TCP for multiple GigE links. In this paper, we present two os-bypass message passing systems that are based on a modified M-VIA (an implementation of VIA specification) for two production GigE mesh clusters: one is constructed as a 4x8x8 (256 nodes) torus and has been in production use for a year; the other is constructed as a 6x8x8 (384 nodes) torus and was deployed recently. One of the message passing systems targets to a specific application domain and is called QMP and the other is an implementation of MPI specification 1.1. The GigE mesh clusters using these two message passing systems achieve about 18.5 ¿s half-way round trip latency and 400MB/s total bandwidth, which compare reasonably well to systems using specialized high speed adapters in a switched architecture at much lower costs.
Fast Recursive Mathematical Morphological Transforms
Authors: Jiali Cui, Yunhong Wang, Tieniu Tan, Zhenan Sun
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Since many mathematical morphology operations are recursive transforms of dilation and erosion, this paper proposes fast recursive transforms to reduce computational complexity. The basic idea of the method is to compute the temporary results within a series of adaptive windows and the computing is performed on specific pixels. Each step of the recursive process consists of two parts: 1) Computation is limited to the specific pixels (foreground or background pixels) within a window; 2) Update the window adaptively and delete those varied pixels. Extensive results show that the time complexity of the method is proportional to the number of the specific pixels.
Game-playing programs: theory and practice
Authors: M. A. Bramer
Venue: Issue 80 (April 1982) (1982)

This collection of articles has been brought together to provide SIGART members with an overview of Artificial Intelligence approaches to constructing game-playing programs. Papers on both theory and practice are included.
Intelligent fact retrieval: Georgia Tech
Authors: Janet Kolodner
Venue: Issue 79 (January 1982) (1982)

Project Support: NSF (IST division) Sept., 1981 - Sept, 1983; NIH (through Georgia Tech's Biological Research Support Group) June, 1981 - April, 1982; UPI DataNews High Speed News Wire pending: AFOSR July, 1981 - June, 1985
Integral Histogram: A Fast Way To Extract Histograms in Cartesian Spaces
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a novel method, which we refer as an integral histogram, to compute the histograms of all possible target regions in a Cartesian data space. Our method has three distinct advantages: 1- It is computationally superior to the conventional approach. The integral histogram method makes it possible to employ even an exhaustive search process in real-time, which was impractical before. 2- It can be extended to higher data dimensions, uniform and non-uniform bin formations, and multiple target scales without sacrificing its computational advantages. 3- It enables the description of higher level histogram features. We exploit the spatial arrangement of data points, and recursively propagate an aggregated histogramby starting from the origin and traversing through the remaining points along either a scan-line or a wave-front. At each step, we update a single bin using the values of integral histogram at the previously visited neighboring data points. After the integral histogramis propagated, histogram of any target region can be computed easily by using simple arithmetic operations.
Mixture-Based Bone Segmentation and Its Application in Computer Aided Diagnosis and Treatment Planning
Authors: Hongbing Lu, Zhengrong Liang, Bin Li, Xiang Li, Jie Meng, Xin Liu
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

The developmental dysplasia of the hip (DDH) is a congenital malformation of the acetabulum with different degrees. Leaving it partially treated or untreated is a major cause of disability. In this paper, we implemented a computer-aided system for the diagnosis and treatment planning of DDH. Instead of labeling each voxel with a unique label or tissue type, the percentage of different tissues within each voxel, which we call a mixture, was considered in establishing a maximum a posterior probability (MAP) framework for more accurate segmentation. A graphical module displayed the segmented bone in a 3D view to show the spatial relationship between acetabulum and femurs. This virtual image, together with quantitative measurement indexes, helps physicians make diagnosis. The system also provides physicians a virtual treatment planning on screen for acetabular and femoral osteotomy. It is currently under clinical trial on patient datasets.
A branch-and-price algorithm for the capacitated p-median problem
Authors: Alberto Ceselli, Giovanni Righini
Venue: Networks (2005)

The capacitated p-median problem is the variation of the well-known p-median problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity. We present a branch-and-price algorithm, that exploits column generation, heuristics and branch-and-bound to compute optimal solutions. We compare our branch-and-price algorithm with other methods proposed so far, and we present computational results both on test instances taken from the literature and on random instances with different values of the ratio between the number of medians and the number of users. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 45&lpar;3&rpar;, 125&ndash;142 2005
A note on line broadcast in digraphs under the edge-disjoint paths mode
Authors: Pierre Fraigniaud
Venue: Discrete Applied Mathematics (2004)

It is known that unless NP ⊂ DTIME(nlog log n), no polynomial-time approximation algorithm for the multicast problem can have approximation ratio less than Ω(log n) in n-node digraphs under the edge-disjoint paths mode of the line model. In this note, we give a polynomial-time O((Δmin + log n)/(log(Δmin + log n)))-approximation algorithm, where (Δmin is the smallest integer k such that there exists a rooted directed tree of maximum out-degree k, spanning the considered digraph.
Oracle Database 10g OCP Certification All-In-One Exam Guide, 1 edition
Authors: Damir Bersinic, John Watson
Venue:  (2005)

Table of contentsPart I: Oracle Database 10g Administrative I ExamChapter 1: Basic Oracle ConceptsChapter 2: Installing Oracle Database 10gChapter 3: Creating an Oracle DatabaseChapter 4: Interfacing with the Oracle DatabaseChapter 5: Managing Oracle ProcessesChapter 6: Managing Oracle Storage StructuresChapter 7: Administering Database UsersChapter 8: Managing Database ObjectsChapter 9: Manipulating Database DataChapter 10: Programming Oracle with PL/SQLChapter 11: Securing the Oracle DatabaseChapter 12: Configuring Oracle NetworkingChapter 13: Managing Shared ServersChapter 14: Managing Database PerformanceChapter 15: Monitoring OracleChapter 16: Managing UndoChapter 17: Dealing with LockingChapter 18: Configuring the Database for Backup and RecoveryChapter 19: Backing Up an Oracle DatabaseChapter 20: Recovering Oracle DatabasesChapter 21: Managing Globalization in Oracle DatabasesPart II: Oracle Database 10g Administrative II ExamChapter 22: Configuring Security for the ListenerChapter 23: Getting Started with Oracle Recovery Manager (RMAN)Chapter 24: Using RMAN to Back Up DatabasesChapter 25: Diagnosing Oracle Database IssuesChapter 26: Recovering from Noncritical LossesChapter 27: Incomplete Database RecoveryChapter 28: Using Oracle Flashback DatabaseChapter 29: Recovering From User ErrorsChapter 30: Detecting and Recovering from Database CorruptionChapter 31: Tools for Oracle Database 10g TuningChapter 32: Monitoring and Managing StorageChapter 33: Managing Storage with Automatic Storage ManagementChapter 34: Computer Telephony IntegrationChapter 35: Monitoring and Managing MemoryChapter 36: Automating Administrative TasksAPPENDIX: ABOUT THE CDGLOSSARY: GLOSSARY OF ACRONYMSINDEX
Model-Theoretic Methods in Combined Constraint Satisfiability
Authors: Silvio Ghilardi
Venue: Journal of Automated Reasoning (2004)

We extend the Nelson--Oppen combination procedure to the case of theories that are compatible with respect to a common subtheory in the shared signature. The notion of compatibility relies on model completions and related concepts from classical model theory.
Fault tolerant bus architecture for deep submicron based processors
Authors: N. Venkateswaran, S. Balaji, V. Sridhar
Venue: ACM SIGARCH Computer Architecture News (2005)

In the Deep Submicron era testing of processors is gaining prominence due to the effect of many analog faults. These faults have a direct impact on the signal integrity in interconnects. In deep submicron based processors electromigration poses a major challenge for interconnect reliability. This is of major concern in processor bus architectures. Though a lot of research has been focused on fault tolerance at the module level, no effective research has been carried out to evolve fault tolerant interconnect structures. Faults due to electromigration give rise to weak ones and zeros, thus affecting the signal integrity. This paper presents a fault tolerant scheme for electromigration which also leads to unification of detection and correction of crosstalk faults and stuck-at faults. In the scheme presented, the signal is rerouted through adjacent spare interconnects. The spare interconnect also acts as a shield against crosstalk under fault free system operation. Moreover, the entire testing process is carried out concurrently with the processor instruction execution. The hardware overhead is also insignificant compared to the overall device count in a deep submicron based processor. To the best of our knowledge this is the first time a fault tolerant scheme for bus architectures is being presented.
A reconfigurable architecture for load-balanced rendering
Authors: Jiawen Chen, Michael I. Gordon, William Thies, Matthias Zwicker, Kari Pulli, Frédo Durand
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2005)

Commodity graphics hardware has become increasingly programmable over the last few years but has been limited to fixed resource allocation. These architectures handle some workloads well, others poorly; load-balancing to maximize graphics hardware performance has become a critical issue. In this paper, we explore one solution to this problem using compile-time resource allocation. For our experiments, we implement a graphics pipeline on Raw, a tile-based multicore processor. We express both the full graphics pipeline and the shaders using StreamIt, a high-level language based on the stream programming model. The programmer specifies the number of tiles per pipeline stage, and the StreamIt compiler maps the computation to the Raw architecture.We evaluate our reconfigurable architecture using a mix of common rendering tasks with different workloads and improve throughput by 55-157% over a static allocation. Although our early prototype cannot compete in performance against commercial state-of-the-art graphics processors, we believe that this paper describes an important first step in addressing the load-balancing challenge.
Fragile image watermarking using a gradient image for improved localization and security
Authors: Shan Suthaharan
Venue: Pattern Recognition Letters (2004)

A fragile watermarking algorithm for image authentication and tamper detection is proposed. It uses a gradient image and its structure to achieve localization and security requirements. It provides superior localization with greater security against many attacks including vector quantization attack.
Camera parameter estimation from a long image sequence by tracking markers and natural features
Authors: Tomokazu Sato, Masayuki Kanbara, Naokazu Yokoya, Haruo Takemura
Venue: Systems and Computers in Japan (2004)

Camera parameter recovery from an image sequence is very important in many applications such as 3D model reconstruction, object recognition, robot navigation, and mixed reality. However, there is a problem concerning the precision in camera parameter estimation from the image sequence, because feature tracking errors and estimation errors are accumulated. In this paper, we propose a camera parameter estimation method which is based on using a number of markers with known 3D position, color, and shape, as well as natural features. Initially, the camera parameters and 3D positions of natural features are estimated efficiently in every frame by tracking both these markers and natural features. The accumulation of estimated errors is then minimized by specifying additional markers in some frames of input and optimizing parameters globally through the whole input. In the experiments, some results of 3D reconstruction show the validity of the proposed method. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(8): 12&ndash;20, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10702
A programmable inductive position sensor interface circuit
Authors: F. Roewer, U. Kleine, K.-E. Salzwedel, F. Mednikov, Ch. Pfaffinger, M. Sellen
Venue: Integration, the VLSI Journal (2004)

In this paper a new programmable sensor interface circuit for contactless inductive position sensors is described, which is based on a novel measurement method. The chip meets the requirements of various sensors with different electrical and mechanical parameters. The interface circuit is Fabricated in a 0.8 µm CMOS technology. It has a resolution of 11 bits for the position information, which is validated by measurements.
Learning objects in a multimedia interactive environment: the codewitz project
Authors: Aacute;srún Matthíasdóttir
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Student success in mastering basic programming skills is not as successful as would be expected and at the same time number of students enrolling in Computer Science is decreasing almost worldwide. The Codewitz project is developing and producing interactive web-based learning objects in order to help students and teachers in entry level programming courses. The learning objects are made available via an online material bank (data base) on the Internet at <u>www.codewitz.net.</u> To prepare the projects a need analysis was conducted using an online questionnaire for data collection. The results from the survey will be used to guide Codewitz/Minerva partners in their work to develop the most needed learning objects. Teachers or their respective educational institutions can become partners in Codewitz and download learning objects. All partners can develop their own learning objects and place them in the database and thereby becoming part of the development process of Codewitz.
Virtual scholarly collaboration: a case study
Authors: Bruce J. Neubauer, Gene A. Brewer
Venue: Journal of Computing Sciences in Colleges (2004)

Scholarly collaboration can certainly offer the potential to increase the productivity of scholars but can carry with it burdens and challenges not experienced by those who choose to write and publish individually. As scholarship itself becomes more complex the benefits of collaboration are likely to become more significant. Information technology can be used to facilitate scholarly collaboration over a distance in ways that were not available to scholars of previous generations. This is a case study, reporting and reflecting upon the experiences of authors in using information technology to facilitate their collaborative efforts. Parallels between scholarly writing and software programming are suggested.
On the Validation of SPDM Task Verification Facility
Authors: Ou Ma, Jiegao Wang, Sarthak Misra, Michael Liu
Venue: Journal of Robotic Systems (2004)

This paper describes a methodology for validating a ground-based, hardware-in-the-loop, space-robot simulation facility. This facility, called &ldquo;SPDM task verification facility,&rdquo; is being developed by the Canadian Space Agency for the purpose of verifying the contact dynamics performance of the special purpose dexterous manipulator (SPDM) performing various maintenance tasks on the International Space Station because the real SPDM cannot be physically tested for 3D operations on the ground due to the gravity. The facility uses a high-fidelity SPDM mathematical model, known as the &ldquo;truth model&rdquo; of the space robot, to drive a hydraulic robot to mimic the space robot performing contact operations. In this research different techniques were studied for practically verifying that the complex simulation facility preserves the dynamics of the truth model of the space robot for space-representative contact robotic tasks. Based upon the study and many years of experience in developing and verifying space robotic systems, a practical validation strategy including detailed test cases was developed along with a set of quantitative criteria for judging the validation test results. &copy; 2004 Wiley Periodicals, Inc.
SIGART Member Dissertation Abstracts: Automatic Recognition of Machinable Features in Solid Models
Authors: Jan H. Vandenbrande
Venue: ACM SIGART Bulletin (1990)

Recognition of machining features such as holes, slots and pockets is essential for the fully automatic manufacture of mechanical parts. This thesis discusses an experimental feature recognizer that uses a blend of artificial intelligence (AI) and computational geometry techniques. The recognizer is implemented in a rapid prototyping test bed consisting of the Knowledge Craft (TM) AI environment tightly coupled with the PADL-2 solid modeler, running under Unix on a SUN 3/260 computer. It is capable of finding features with interacting volumes (e.g., two crossing slots), and takes into account nominal shape information, tolerancing and other available data.
The evaluation of cursor control devices for space station freedom
Authors: Kritina L. Holden, Debra Muratore, Marianne Rudisill
Venue: ACM SIGCHI Bulletin (1991)

Human-Computer Interface researchers at the Johnson Space Center are faced with the challenge of designing a cursor control device for use in zero gravity so that crewmembers can take full advantage of direct manipulation interfaces. Over the past year, the Crew Interface Analysis Section (CIAS) and the Astronaut Space Station Support Office at the Johnson Space Center in Houston have been working together to generate a research-based recommendation for the design of a microgravity cursor control device for Space Station Freedom.
A Scalable Generative Topographic Mapping for Sparse Data Sequences
Authors: Ata Kaban
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

We propose a novel, computationally efficient generative topographic model for inferring low dimensional representations of high dimensional data sets, designed to exploit data sparseness. The associated parameter estimation algorithm scales linearly with the number of non-zero entries in the observations while still learning a truly nonlinear generative mapping. The latent variables of the model lie in a 2D space that can be used for visualisation. We discuss related work and we provide experimental results on text based documents visualisation as well as the exploratory analysis of web navigation sequences.
Real time constructive solid geometry rendering using 3D texture mapping
Authors: Genevieve Herres
Venue: Journal of Computing Sciences in Colleges (2004)

Constructive Solid Geometry (CSG) creates complex 3-dimensional shapes as unions, intersections, and differences of primitive objects (such as spheres, cones, etc.). For example, an ice cream cone can be modeled as the union of a cone and a sphere. Primitives used as operands to unions, intersections and on the left side of differences are positive, primitives used on the right side of differences are negative. CSG information is stored in a CSG Tree, whose internal nodes represent set operations and whose leaves represent primitives. The resulting object is contained within a cubical bounding box.