ppxscal/embedding_network huggingface dataset:
Sensing Deforming and Moving Objects with Commercial Off the Shelf Hardware
Authors: Philip Fong, Florian Buron
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

In many application areas, there exists a crucial need for capturing 3D videos of fast moving and/or deforming objects. A 3D video is a sequence of 3D representations at high time and space resolution. Although many 3D sensing techniques are available, most cannot deal with dynamic scenes (e.g. laser scanning), can only deal with textured surfaces (e.g. stereo vision) and/or require expensive specialized hardware. This paper presents a technique to compute high-resolution range maps from single images of moving and deformable objects. A camera observes the deformation of a projected light pattern that combines a set of parallel colored stripes and a perpendicular set of sinusoidal intensity stripes. While the colored stripes allow recovering absolute depths at coarse resolution, the sinusoidal intensity stripes give dense relative depths. This twofold pattern makes it possible to extract a high-resolution range map from each image captured by the camera. This approach is based on sound mathematical principles, but its implementation requires giving great care to a number of low-level details. In particular, the sensor has been implemented using commercial off the shelf hardware, which distorts sensed and transmitted signals in many ways. A novel method was developed to characterize and compensate for distortions due to chromatic aberrations. The sensor has been tested on several moving and deforming objects.
Automated path generation for software fault localization
Authors: Tao Wang, Abhik Roychoudhury
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Localizing the cause(s) of an observable error lies at the heart of program debugging. Fault localization often proceeds by comparing the failing program run with some "successful" run (a run which does not demonstrate the error). An issue here is to generate or choose a "suitable" successful run; this task is often left to the programmer. In this paper, we present an efficient technique where the construction of the successful run as well its comparison with the failing run is automated. Our method constructs a successful program run by toggling the outcomes of some conditional branch instances in the failing run. If such a successful run exists, program statements for these branches are returned as bug report. In our experiments with the Siemens benchmark suite, we found that the quality of our bug report compares well with those produced by existing fault localization approaches where the programmer manually provides or chooses a successful run.
Nomadic Web Service Clients
Authors: Kamal Elbashir, Ralph Deters
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Mobile devices are emerging as an attractive plalform for hosting Web Service clients. But unlike their "static" counterparts, mobile devices are typically connected via a wireless network introducing novel challenges related to constrained bandwidth and the sudden loss of connectivity. To overcome these challenges we propose the use of a cache for SOAP traffic that will store Request/Response pairs. But unlike Web caches, a SOAP cache handles traflc that encodes communication of program logics, while the traffic handled by Web caches is initiated by user actions on generally static content. A SOAP cache requires metadata providing a clear distinction between state-based, and state-altering operations in order to support the client. This paper introduces the concept of an embedded SOAP cache, highlighting the need for meta-data as the means to support it. A novel SOAP cache (CRISP) that can be embedded into the clien-side WS stack or used as standalone proxy-cache, is presented and evaluated under various loads and settings.
Implementation of Kernel Methods on the GPU
Authors: Julius Ohmer, Frederic Maire, Ross Brown
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Kernel methods such as kernel principal component analysis and support vector machines have become powerful tools for pattern recognition and computer vision. Unfortunately the high computational cost of kernel methods is a limiting factor for real-time classification tasks when running on the CPU of a standard PC. Over the last few years, commodity Graphics Processing Units (GPU) have evolved from fixed graphics pipeline processors into more flexible and powerful data-parallel processors. These stream processors are capable of sustaining computation rates of greater than ten times that of a single CPU. GPUs are inexpensive and are becoming ubiquitous (desktops, laptops, PDAs, cell phones). In this paper, we present a face recognition system based on kernel methods running on the GPU. This GPU implementation is twenty eight times faster than the same optimized application running on the CPU.
Application of a Robust and Efficient ICP Algorithm for Fitting a Deformable 3D Human Torso Model to Noisy Data
Authors: Anthony Ruto, Bernard Buxton
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

We investigate the use of an iterative closest point (ICP) algorithm in the alignment of a point distribution model (PDM) of 3D human female torsos to sample female torso data. An approximate k-d tree procedure for efficient ICP is tested to assess whether it improves the speed of the alignment process. The use of different error norms, namely L₂ and L₁, are compared to ascertain if either offers an advantage in terms of convergence and in the quality of the final fit when the sample data is clean, noisy or has some data missing. It is found that the performance of the ICP algorithm used is improved in both speed of convergence and accuracy of fit through the combined use of an approximate and exact k-d tree search procedure and with the minimisation of the L₁ norm even when up to 50% of the data is noisy or up to 25% is missing. We demonstrate the use of this algorithm in providing, via a fitted torso PDM, smooth surfaces for noisy torso data and valid data points for torsos with missing data.
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Venue: Workshop On Privacy In The Electronic Society (2005)

These proceedings contain the papers selected for presentation at the Fourth ACM Workshop on Privacy in the Electronic Society, held in association with the 12th ACM Computer and Communications Security Conference, November 7, 2005, in Alexandria, VA (USA).In response to the call for papers, 40 papers were submitted to the workshop. These papers were evaluated on the basis of their significance, novelty, and technical quality. Each paper was reviewed by at least three members of the program committee. The program committee meeting was held electronically. Because there was interest in many more of the papers than there was available time to present, 9 papers were selected for long presentation at the workshop, and 6 were selected for short presentation. Papers received correspondingly long or short space in the proceedings as well.
A two-stage handwritten character segmentation approach in mail address recognition
Authors: Zhi Han, Chang-Ping Liu
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Character segmentation has become a crucial step for mail address recognition in the automatic post mail sorting system. In this paper, a two-stage character segmentation algorithm according to the characteristics of handwritten mail address characters is proposed. In the simple segmentation stage, the block sequence is extracted from the mail address image using the structure-based methob, including projection profile analysis, connected components analysis and stroke cross number analysis. In the precise segmentation stage, all candidate segmentation paths are created by combining the neighboring blocks and represented with a candidate segmentation graph first. Then several optimal candidate paths are selected from the graph by dynamic programming searching based on recognition confidence. Finally the best segmentation path is determined by matching these paths with the known post address database. In the experiment on more than 500 real envelop images with the this approach, the correct sorting rate of address recognition is up to 79.46% and that of address-postcode integrated recognition is up to 96.26%.
Efficient Group Key Management Protocol with One-Way Key Derivation
Authors: Jen-Chiun Lin, Feipei Lai, Hung-Chang Lee
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

The growth of the Internet inspires lots of new network applications, and many of them are based on group communication models. Key trees are ideal for a group of users to efficiently and securely share a common secret key, the group key, which can encrypt transmitted data, or other session keys that protect group communication. An efficient group key management protocol is proposed for centralized dynamic groups, and one-way key derivation is integrated with key trees to reduce the communication overhead of rekeying operations. The server does not have to send new keys to those members who can derive the keys by themselves, and the total number of encrypted keys transmitted per rekeying operation becomes fewer. It is shown that the technique can be applied to both synchronous and asynchronous rekeying operations. The proposed protocol outperforms the other group key management protocols from our analysis and simulation, and is suitable for practical systems.
Web Services Searching based on Domain Ontology
Authors: Xu Bin, Wang Yan, Zhang Po, Li Juanzi
Venue: Proceedings of the IEEE International Workshop (2005)

Searching proper web services is the basic step to composite web services into applications. Current searching in UDDI servers is based on taxonomy and tModel, which is not convenient to find domain related web services. In this paper, we propose a method to search web services based on domain ontology. Firstly the WSDL crawler collects the WSDL files from the Internet resources like Google, Baidu and XMethods as much as possible. Secondly ontology is used to represent the domain, such as travel ontology. Thirdly a Support Vector Machine (SVM) classifier is constructed to select the domain WSDL files from the collected WSDL files; domain vector is built according to the domain ontology, and features are extracted from WSDL files to train the SVM classifier. Finally we evaluate the method through experiment and show that the method is effective.
Automated layout of information presentations
Authors: Steven K. Feiner
Venue:  (2005)

Layout refers to the process of determining the sizes and positions of the visual objects that are part of an information presentation. Automated layout refers to the use of a computer program to automate either all or part of the layout process. This field of research lies at the crossroads of artificial intelligence and human computer interaction. Automated layout of presentations is becoming increasingly important as the amount of data that we need to present rapidly overtakes our ability to present it manually. We present a set of novel techniques that can assist an automated layout system to produce an effective presentation of information, given a set of components to display and metadata describing relationships between those components. Unlike the vast majority of previous approaches to layout and numerous related problems, our techniques attempt to mimic the workflow used by a human graphic designer when manually creating a presentation. Our techniques include a method to control the length of text being displayed that is inspired by the capability of a designer to ask a copy editor for a change in the content length to suit a particular layout. We have also developed a method for automatically evaluating and improving the visual balance of a layout that closely mirrors the process used by graphic designers. Finally, we have developed a method to deliver layouts produced by our techniques using a thin-client approach. Our techniques are uniquely capable of capturing the irregular and sometimes counterintuitive tactics used by human designers to create layouts. When combined with a model of the workflow used by human graphic designers, our techniques allow systems to automatically generate layouts that are highly effective, superior in both form and function to those generated by investigations into this field to date.
Database Replication Using Generalized Snapshot Isolation
Authors: Sameh Elnikety, Willy Zwaenepoel, Fernando Pedone
Venue: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (2005)

Generalized snapshot isolation extends snapshot isolation as used in Oracle and other databases in a manner suitable for replicated databases. While (conventional) snapshot isolation requires that transactions observe the "latest" snapshot of the database, generalized snapshot isolation allows the use of "older" snapshots, facilitating a replicated implementation. We show that many of the desirable properties of snapshot isolation remain. In particular, read-only transactions never block or abort and they do not cause update transactions to block or abort. Moreover, under certain assumptions on the transaction workload the execution is serializable. An implementation of generalized snapshot isolation can choose which past snapshot it uses. An interesting choice for a replicated database is prefix-consistent snapshot isolation, in which the snapshot contains at least all the writes of locally committed transactions. We present two implementations of prefix-consistent snapshot isolation. We conclude with an analytical performance model of one implementation, demonstrating the benefits, in particular reduced latency for read-only transactions, and showing that the potential downsides, in particular change in abort rate of update transactions, are limited.
Emulator Implementation of Service Scenario Description Framework for Home Networked Appliances
Authors: Tatsuya Yamazaki, Dongseop Kwon, Atsushi Sawada, Michihiko Minoh
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

A home network service middleware called "UKARI-Kernel" has been proposed for distributed and collaborative networked appliances and networked sensors. A home network service can be established by the middleware using distributed function elements on the networked appliances. The middleware uses a service scenario description framework on the basis of BPEL, an XML language to define business processes, to set up the service according to the present situation. In this paper, we describe the overview and of the home network service middleware and its service scenario description. Then implementation of an emulator for the service scenario description framework is reported. It is noted that the proposed description framework can be constructed easily by using the existing toolkits.
The bomar gene: fictiobiography, digiart, hypertext
Authors: Jason Nelson
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The Bomar Gene [6] is a new media, digital fiction hybrid that explores the speculative concept that within us, the codes governing our bodies, is a single unique gene. This speculative gene gives each person an individualized ability, a singular talent. The work's nine sections chronicle through ficto-biographies how these abilities separate/isolate us from our cultural/physical landscape and yet reside us within those spaces the gene impacts. With each story and the accompanying interactive elements, the project explores how these genetically derived abilities consequently adjust our internal and external geographies. Through game, video, sonic and interactive interfaces, the ways these genes both locate and dislocate the characters are recreated/translated into aesthetic hypertexts. Our genetics build personal layers and our cultural response adds dimension. The Bomar Gene utilizes the layering of meanings, fiction over code over user invited exploration, to situate the user within the character's lives and genes. And the result is a space within spaces, the story of how our genetics effect the larger spaces around us. This project isn't as much about the science of genetics, as it is about human attributes and how those talents and internal deformities, reconfigure our relationship with "where we are".
An autonomous explore/exploit strategy
Authors: Alex McMahon, Dan Scott, Will Browne
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

In reinforcement learning problems it has been considered that neither exploitation nor exploration can be pursued exclusively without failing at the task. The optimal balance between exploring and exploiting changes as the training progresses due to the increasing amount of learnt knowledge. This shift in balance is not known a priori so an autonomous online adjustment is sought. Human beings manage this balance through logic and explorations based on feedback from the environment. The XCS learning classifier system uses a fixed explore/exploit balance, but does keep multiple statistics about its performance and interaction in an environment. Utilising these statistics in a non-linear manner, autonomous adjustment of the explore/exploit balance was achieved. This resulted in reduced exploration in simple environments, which could increase with the complexity of the problem domain. It also prevented unsuccessful 'loop' exploit trials and suggests a method of dynamic choice in goal setting.
Augmenting Deformable Objects in Real-Time
Authors: Julien Pilet, Vincent Lepetit, Pascal Fua
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

We present a real-time system that can draw virtual patterns or images on deforming real objects by estimating both the deformations and the shading parameters. We show that this is what is required to render the virtual elements so that they blend convincingly with the surrounding real textures. The whole process of uncompressing the video stream, measuring the deformations, estimating the lighting parameters, and realistically augmenting the input image takes about 100 ms on a 2.8 GHz PC. It is fully automated and does not require any manual initialization or engineering of the scene. It is also robust to large deformations, lighting changes, motion blur, specularities, and occlusions. It can therefore be demonstrated live on a simple laptop.
Ontology-Based E-Catalog Matching for Integration of GDSN and EPCglobal Network
Authors: Joshua Zhexue Huang, Feilong Tang, Yunming Ye, George Huang, Minglu Li
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

EPCglobal network is aimed to capture the realtime dynamic information about the flow of goods in the global supply chain. The global data synchronization network (GDSN) can automatically synchronize the static product information among trading partners. To maximize the efficiency of the global supply chain and further increase the market share and revenues of companies, these two technologies must be integrated to support full and highly-efficient collaboration among trading partners. This paper proposes a model to integrate these two networks, and discusses the key issues and technologies for implementation of the integration model. Intelligent e-catalog matching is at the heart of this integration. Because of lack of unified e-catalog standards, we propose to use ontology to solve the ecatalog matching problems and introduce a matching algorithm to maximize the accuracy of product searching in product sourcing operations.
Reuse-Oriented Process Component Representation and Retrieval
Authors: XU Ru-Zhi, He Tao, CHU Dong-Sheng, 1, XUE Yun-Jiao, QIAN Le-Qiu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This paper proposes a Reuse-Oriented Process Component Representation framework for the description and classification of Process Components (PCs). The key features of our approach are the division of process component descriptions into a goal-oriented PC's General Information Description (PGD), an implementation-oriented PC's Specification Description (PSD) and an improvement-oriented PC's Data Description (PDD). A facet-based PC classification scheme and an XML-based process description method is presented. A retrieval model based on tree-containment matching is given, which can improve the recall while maintaining a high level precision. Finally, a reuse based process and project management system (P2MS) to support process improvement and control is also introduced in this paper.
Resource and Task Allocation in Complex of Parallel Operations with Uncertain and Random Parameters
Authors: Z. Bubnicki, D. Orski
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The paper is concerned with a task and resource allocation in a complex of parallel operations with two kinds of unknown parameters: uncertain parameters characterized by an expert in the form of certainty distributions and random parameters described by probability distributions (probability densities). It has been shown how to apply the theory of uncertain variables in the problem under consideration. Two versions of the optimal allocation problem formulation and solution have been described. A simple example illustrating a resource distribution for a complex of operations with uncertain and random execution times has been presented.
Error Propagation in the Reliability Analysis of Component Based Systems
Authors: Petar Popic, Dejan Desovski, Walid Abdelmoez, Bojan Cukic
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Component based development is gaining popularity in the software engineering community. The reliability of components affects the reliability of the system. Different models and theories have been developed to estimate system reliability given the information about system architecture and the quality of the components. Almost always in these models a key attribute of component-based systems, the error propagation between the components, is overlooked and not taken into account in the reliability prediction. We extend our previous work on Bayesian reliability prediction of component based systems by introducing the error propagation probability into the model. We demonstrate the impact of the error propagation in a case study of an automated Personnel Access Control System. We conclude that error propagation may have a significant impact on the system reliability prediction and, therefore, future architecture-based models should not ignore it.