ppxscal/embedding_network huggingface dataset:
Design and Implementation of an Active RFID System Platform
Authors: Hyuntae Cho, Yunju Baek
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

An active RFID system has the active tag that incorporates an internal battery providing a robust, long-range transmission signal. Typical application using the active RFID is the identification and the position tracking of warehouse inventory-item and freight container. This paper presents the design and implementation of an active RFID system platform which complies with the ISO/IEC 18000-7 standard. Our system design focus on three parts: 1) the standard compliance with the ISO/IEC 18000-7, 2) the energy saving mechanism to maintain the longevity of tags as long as possible, and 3) the high identification rate in the presence of multiple tags. We describe the detailed design of the system and the commercial offthe- shelf (COTS) implementation. The performance evaluation of the system is also included.
Real-time shadowing techniques
Authors: Tomas Akenine-Moeller, Eric Chan, Wolfgang Heidrich, Jan Kautz, Mark Kilgard, Marc Stamminger
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

Shadows heighten realism and provide important visual cues about the spatial relationships between objects. But integration of robust shadow shadowing techniques in real-time rendering is not an easy task. In this course on how shadows are incorporated in real-time rendering, attendees learn basic shadowing techniques and more advanced techniques that exploit new features of graphics hardware.The course begins with shadowing techniques using shadow maps. After an introduction to shadow maps and general improvements of this technique (filtering, depth bias, omnidirectional lights, etc.), the first section describes two methods for reducing sampling artifacts: perspective shadow maps and silhouette maps. Both techniques can significantly improve shadow quality, but they require careful implementation. The course continues with extensions of the shadow mapping method that allow soft shadows from linear and area light sources. The second part of the course discusses recent advances in efficient and robust implementation of shadow volumes on graphics hardware and then shows how shadow volumes can be extended to generate accurate soft shadows from area lights. Finally, the course summarizes real-time shadowing from full lighting environments using the technique of precomputed radiance transfer.The course explains the differences among these algorithms and their strengths and weaknesses. Implementation details, often omitted in technical papers, are provided. And throughout the course, the tradeoffs between quality and performance are illustrated for the different techniques.
Performance of Geometrix ActiveID^TM 3D Face Recognition Engine on the FRGC Data
Authors: Thomas Maurer, David Guigonis, Igor Maslov, Bastien Pesenti, Alexei Tsaregorodtsev, David West, Gerard Medioni
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

We present and analyze the performance of the Geometrix ActiveIDTM Biometric Identity System on the FRGC data from Experiment 3, consisting of 4007 3D faces. The performance is presented and analyzed for different facial expression categories. We first present the Geometrix FaceVision 3D face recognition technology, then describe how shape and texture are fused. The effect of fusion on error rates is discussed, and the remaining errors are analyzed. We conclude with lessons learned, general findings, and what we expect in the near future.
An implementation of a computer simulation system
Authors: Gary J. Nutt
Venue: ACM SIGSIM Simulation Digest (1974)

The field of discrete simulation of computer systems has been the subject of much criticism, particularly with respect to the amount of time required to construct programming models from a system design. Reduction of this lead time is a step toward easing the task of simulating large, discrete systems. A class of models called evaluation nets has previously been defined and is alleged to be useful in reducing the amount of time required to build the simulation program from the system design [1, 2]. An implementation of those models now exists at the University of Colorado, and experimentation into their usefulness is underway. Detailed documentation of the work is available [3].
The Spread Spectrum in Computing
Authors: Norman Chonacky
Venue: Computing in Science and Engineering (2006)

From time to time, I find it necessary to remind myself of how broadly computing applications are spread across the sciences and engineering. This breadth extends not only along the axes of computing complexity and disciplinary diversity, but also along task and sophistication. Over the years, this magazine has certainly highlighted the former two, but I'd like to comment here on the latter two.
Standards rehashed
Authors: Dianna Patterson
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1978)

To readers who do not live in the English speaking part of North America, I should explain that the title of this essay is meant to have a certain gastronomique relevance. This is because my intention is to eat some words that I wrote a while ago. 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
The impact of predisposition towards group work on intention to use a cscw system
Authors: Josephine Reyna
Venue:  (2005)

Groupware packages are increasingly being used to support content delivery, class discussion, student to student and student to faculty interactions and group work on projects. This research focuses on groupware packages that are used to support students who are located in different places, but who are assigned group projects as part of their coursework requirements. In many cases, students are being asked to use unfamiliar technologies that are very different from those that support personal productivity. For example, computer-supported cooperative work (CSCW) technology is different from other more traditional, stand-alone software applications because it requires the user to interact with the computer as well as other users. However, familiarity with the technology is not the only requirement for successful completion of a group assigned project. For a group to be successful, it must also have a desire to work together on the project. If this pre-requisite is not present within the group, then the technology will only create additional communication and coordination barriers. How much of an impact does each of these factors have on the acceptance of CSCW technology? The significance of this study is threefold. First, this research should contribute to how a user's predisposition toward group work affects their acceptance of CSCW technology. Second, it should help identify ways to overcome some of the obstacles associated with group work and the use of CSCW technology in an academic online environment. Finally, it should help identify early adopters of CSCW software and how these users can form the critical mass required to diffuse the technology. This dissertation studied the impact of predisposition toward group work and prior computer experience on the intention to use synchronous CSCW. It was found that predisposition toward group work was not only positively associated to perceived usefulness; it was also related to intention to use. It also found that perceived ease of use, at least in this study, had a direct and positive impact on intention, and was not mediated through perceived usefulness. These findings hold implications for academia and how it uses complex collaborative software. Avenues for further research have been identified.
Safe Concurrency for Aggregate Objects with Invariants
Authors: Bart Jacobs, Frank Piessens, K. Rustan M. Leino, Wolfram Schulte
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Developing safe multithreaded software systems is diffi- cult due to the potential unwanted interference among concurrent threads. This paper presents a flexible methodology for object-oriented programs that protects object structures against inconsistency due to race conditions. It is based on a recent methodology for single-threaded programs where developers define aggregate object structures using an ownership system and declare invariants over them. The methodology is supported by a set of language elements and by both a sound modular static verification method and run-time checking support. The paper reports on preliminary experience with a prototype implementation.
High speed obstacle avoidance using monocular vision and reinforcement learning
Authors: Jeff Michels, Ashutosh Saxena, Andrew Y. Ng
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We consider the task of driving a remote control car at high speeds through unstructured outdoor environments. We present an approach in which supervised learning is first used to estimate depths from single monocular images. The learning algorithm can be trained either on real camera images labeled with ground-truth distances to the closest obstacles, or on a training set consisting of synthetic graphics images. The resulting algorithm is able to learn monocular vision cues that accurately estimate the relative depths of obstacles in a scene. Reinforcement learning/policy search is then applied within a simulator that renders synthetic scenes. This learns a control policy that selects a steering direction as a function of the vision system's output. We present results evaluating the predictive ability of the algorithm both on held out test data, and in actual autonomous driving experiments.
Face Detection Using Distribution-Based Distance and Support Vector Machine
Authors: Peichung Shih, Chengjun Liu
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

This paper presents a novel face detection method by applying distribution-based distance (DBD) measure and Support Vector Machine (SVM). The novelty of our DBD-SVM method comes from the integration of discriminating feature analysis, face class modeling, and support vector machine for face detection. First, the discriminating feature vector is defined by combining the input image, its 1-D Haar wavelet representation, and its amplitude projections. Then the DBD-SVM method statistically models the face class by applying the discriminating feature vectors and defines the distribution-based distance measure. Finally, based on DBD and SVM, three classification rules are applied to separate faces and nonfaces. Experiments using images from the MIT-CMU test sets show the feasibility of our new face detection method. In particular, when using 92 images (containing 282 faces) from the MIT-CMU test sets, our DBD-SVM method achieves 98.2% correct face detection accuracy with 2 false detections, a performance comparable to the state-of-the-art face detection methods, such as the Schneiderman-Kanade¿s method.
safeDpi: a language for controlling mobile code
Authors: Matthew Hennessy, Julian Rathke, Nobuko Yoshida
Venue: Acta Informatica (2005)

safeDpi is a distributed version of the Picalculus, in which processes are located at dynamically created sites. Parametrised code may be sent between sites using so-called ports, which are essentially higher-order versions of Picalculus communication channels. A host location may protect itself by only accepting code which conforms to a given type associated to the incoming port.We define a sophisticated static type system for these ports, which restrict the capabilities and access rights of any processes launched by incoming code. Dependent and existential types are used to add flexibility, allowing the behaviour of these launched processes, encoded as process types, to depend on the host's instantiation of the incoming code.We also show that a natural contextually defined behavioural equivalence can be characterised coinductively, using bisimulations based on typed actions. The characterisation is based on the idea of knowledge acquisition by a testing environment and makes explicit some of the subtleties of determining equivalence in this language of highly constrained distributed code.
Knowledge-based Experimental Development of Web Application Systems
Authors: Makoto Yoshida, Noriyuki Iwane
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Quality, Cost and Delivery are the most crucial factors to be maintained in developing software systems in the industry. Recently, in addition to these factors, customer satisfaction is getting increasing attention. How to acquire customer's needs and reflect them quickly into the software products with least effort becomes important issues. The weight of costs for developing software systems is shifting from coding effort to analysis effort. This paper summarizes the step-wise developments of the web-based application systems that we had experienced in the last several years. Having developed the toolkit which automatically generates application programs from specifications, it was applied to the software product line systems. Furthermore it is integrated with the questionnaire systems. The shift behavior of our application development processes and the lessons we learned to produce the efficient customized software application systems while offering substantial savings in time and cost are described.
A Logic Based Approach for the Multimedia Data Representation and Retrieval
Authors: Samira Hammiche, Salima Benbernou, Athena Vakali
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Nowadays, the amount of multimedia data is increasing rapidly, and hence, there is an increasing need for efficient methods to manage the multimedia content. This paper proposes a framework for the description and retrieval of multimedia data. The data are represented at both the syntactic (structure, metadata and low level features) and semantic (the meaning of the data) levels. We use the MPEG-7 standard, which provides a set of tools to describe multimedia content from different viewpoints, to represent the syntactic level. However, due to its XML Schema based representation, MPEG-7 is not suitable to represent the semantic aspect of the data in a formal and concise way. Moreover, inferential mechanisms are not provided. To alleviate these limitations, we propose to extend MPEG-7 with a domain ontology, formalized using a logical formalism. Then, the semantic aspect of the data is described using the ontology's vocabulary, as a set of logical expressions. We enhance the ontology by a rules layer, to describe more complex constraints between domain concepts and relations. User's queries may concern the syntactic and/or semantic features. The syntactic constraints are expressed using XQuery language and evaluated using an XML query engine; whereas the semantic query constraints are expressed using a rules language and evaluated using a specific resolution mechanism.
Distributed Source Coding in Wireless Sensor Networks
Authors: Guogang Hua, Chang Wen Chen
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

This paper offers a practical distributed data compression in wireless sensor networks based on convolutional code and turbo code. An improved Viterbi algorithm for distributed source coding (VADSC) is proposed to take the advantage of the known parity bits at the decoder. When the algorithm is applied to recursive systematic convolutional (RSC) and Turbo codes, it can decrease both the decoding error probability and the computation complexity. Also a scheme of applying distributed source coding to wireless sensor networks is proposed to ensure receiving the data correctly as well as reducing the energy consumption in the networks.
On the Design of Optimization Strategies Based on Global Response Surface Approximation Models
Authors: András Sóbester, Stephen J. Leary, Andy J. Keane
Venue: Journal of Global Optimization (2005)

Striking the correct balance between global exploration of search spaces and local exploitation of promising basins of attraction is one of the principal concerns in the design of global optimization algorithms. This is true in the case of techniques based on global response surface approximation models as well. After constructing such a model using some initial database of designs it is far from obvious how to select further points to examine so that the appropriate mix of exploration and exploitation is achieved. In this paper we propose a selection criterion based on the expected improvement measure, which allows relatively precise control of the scope of the search. We investigate its behavior through a set of artificial test functions and two structural optimization problems. We also look at another aspect of setting up search heuristics of this type: the choice of the size of the database that the initial approximation is built upon.
Maintaining Reliability Through Activity Management in 802.15.4 Sensor Networks
Authors: Jelena Misic, Shairmina Shafi, Vojislav B. Misic
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

Achieving the desired data rate from a sensor network while simultaneously maximizing the lifetime of individual sensors are somewhat conflicting goals, further complicated by the fact that collisions at the MAC layer will affect both the throughput and power consumption. We address this problem in the context of a beacon enabled 802.15.4 sensor network by analytically modeling the network reliability as the function of the activity management policy and MAC layer parameters. The network coordinator monitors the throughput and adjusts the probability with which individual sensors go to sleep after sending their data. Results show that this activity management policy is able to maintain the desired data rate in a wide range of sensor network sizes and packet arrival rates at the nodes.
The Road to Disaster?
Authors: Philip H. Dorn
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1979)

The craftsmen and cottage industries of the 18th century evolved to the now familiar industrial society. After just over 1DO years, the world faces another iteration in an endless social transformation process. Will a post-industrial society, an information age, replace the product-based economic system? If the transition is to occur, when will it happen? What will be the effect on working populations when, inevitably, the mills stop and the furnaces cool? What are the consequences for individuals, nations, and societies of a system where fewer and fewer people produce more and more goods and services?
Avalia&ccedil;&atilde;o comparativa de algoritmos de personaliza&ccedil;&atilde;o para direcionamento de conte&uacute;do
Authors: Carlos R. C. Alves, Lúcia V. L. Filgueiras
Venue: Proceedings of the 2005 Latin American conference on Human-computer interaction (2005)

Personalization techniques that combine user characteristics, user behavior, and content organization can be used to help users on finding objectively content on the web. The main contribution of this text is the multidisciplinary study that was conducted integrating different areas on human knowledge in order to find the best way to direct content, including a wide research on personalization concepts and application. This study also presents the development of the Argo software which is formed by a web site, a component that captures and stores information about the user navigation, and three different personalization algorithms. Using navigation data it is possible to generate user profile, which is used to recommend content. Tests were conducted to check efficiency of the personalization algorithms.
Using the Lock Manager to Choose Timestamps
Authors: David Lomet, Richard T. Snodgrass, Christian S. Jensen
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Our goal is to support transaction-time functionality that enables the coexistence of ordinary, non-temporal tables with transaction-time tables. In such a system, each transaction updating a transaction-time or snapshot table must include a timestamp for its updated data that correctly reflects the serialization order of the transactions, including transactions on ordinary tables. A serious issue is coping with SQL CURRENT_TIME functions, which should return a time consistent with a transaction¿s timestamp and serialization order. Prior timestamping techniques cannot support such functions with this desired semantics. We show how to compatibly extend conventional database functionality for transaction-time support by exploiting the database system lock manager and by utilizing a spectrum of optimizations.
New kernels for protein structural motif discovery and function classification
Authors: Chang Wang, Stephen D. Scott
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We present new, general-purpose kernels for protein structure analysis, and describe how to apply them to structural motif discovery and function classification. Experiments show that our new methods are faster than conventional techniques, are capable of finding structural motifs, and are very effective in function classification. In addition to strong cross-validation results, we found possible new oxidoreductases and cytochrome P450 reductases and a possible new structural motif in cytochrome P450 reductases.