ppxscal/embedding_network huggingface dataset:
Online face detection and user authentication
Authors: Caroline Mallauran, Jean-Luc Dugelay, Florent Perronnin, Christophe Garcia
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The ability to verify automatically and with great accuracy the identity of a person has become crucial in everyday life. Biometrics is an emerging topic in the field of signal processing. Our research on biometrics aims at developing a complete framework useful to control access. This technical demo shows the latest image processing techniques for face detection developed at France Telecom and for face recognition developed at Eurécom. Using only one computer and one standard webcam, our biometric system detects the user face and the recognition algorithm uses this image to enable the access to a resource, a service or a location.
Experiences with GRIA — Industrial Applications on a Web Services Grid
Authors: Mike Surridge, Steve Taylor, David De Roure, Ed Zaluska
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

The GRIA project set out to make the Grid usable by industry. The GRIA middleware is based on Web Services, and designed to meet the needs of industry for security and business-to-business (B2B) service procurement and operation. It provides well-defined B2B models for accounting and QoS agreement, and proxy-free delegation to support account management and service federation. The GRIA v3 software is now being used by industry. By taking a business-oriented approach independent of the evolving Open Grid Services Architecture proposals from the Global Grid Forum, GRIA has demonstrated the need for a wider understanding of Virtual Organizations (VOs). Traditional academic VOs are persistent, resourceful and have logically centralized, membership-oriented management structures. In contrast, the GRIA experience has been that business VOs are likely to be project-focused and have distributed, process-oriented management structures.
Approximate Coverage in Wireless Sensor Networks
Authors: Yuzhen Liu, Weifa Liang
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention due to their potential applications from civil to military domains. Since sensors in sensor networks are equipped with energylimited batteries, energy conservation in such networks is of paramount importance in order to prolong the network lifetime. Sensing coverage and sensor connectivity in sensor networks are two fundamental issues, which have been extensively addressed in the literature, and most existing work on sensing coverage has focused on the (connected) full coverage problem that aims to cover the entire monitored region using the minimum number of sensors. However, in some application scenarios, full coverage is either impossible or unnecessary and a partial coverage with a certain degree guarantee is acceptable. In this paper, we study the connected coverage problem with a given coverage guarantee. We first introduce the partial coverage concept and analyze its properties for the first time in order to prolong the network lifetime. Due to NP-hardness of the concerned problem, we then present a heuristic algorithm which takes into account the partial coverage and sensor connectivity simultaneously. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm.
Services Integration Monitor For Collaborative Workflow Management
Authors: Leo Pudhota, Andrew Tierney, Elizabeth Chang
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

Collaborative workflow management systems in logistic companies require strong information systems and computer network support. These IT integration requirements have expanded considerably with the advent of e-business; utilizing web services and Partner to Partner ecommerce. This paper deals with change management of collaborative workflow in such consortia and proposes architecture for synchronization and monitoring of these services where existing workflow systems are adapted to the changes requested by management. This paper describes conceptual framework of the services monitor which is used to monitor and edit changes resulting in new collaborative workflows.
An Automatic Negotiation Method Based on CBR and Agent Reasoning
Authors: Fubao Zhu1, Jihong Guan, Yuhua Wang, Jiaogen Zhou, Binhua Liao
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

The efficiency will be greatly improved in negotiation if negotiator is replaced by intelligent machine. In this paper, we propose an automatic negotiation method based on CBR and agent reasoning, a nearest-neighbor case matching method with commercial logic is utilized to make agent act with more intelligence. A prototype is implemented to provide automatic negotiation, and the experiments show the feasibility of the proposed approach.
Reliable Tracking of Large Scale Dense Antiparallel Particle Motion for Fluorescence Live Cell Imaging
Authors: Ge Yang, Alexandre Matov, Gaudenz Danuser
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

This paper presents a technique that reliably tracks large numbers of particles undergoing dense antiparallel motion and frequent appearance and disappearance. Such techniques are essential to many applications of fluorescence cellular and molecular imaging for automated quantitative analysis of dynamic cellular functions. The basic tracking algorithmof this technique integrates motion models at particle, local and global levels. It establishes correspondence between particles based on state similarity and resolves correspondence conflicts using optimal graph assignment. A statistical and robust approach for algorithm parameter setting is developed through establishing the equivalence of the algorithm to a Kalman-filtering based tracker under assumptions that are biologically supported. Online track initiation and propagation depend critically on computing the global vector fleld of particle flow using a new optimal-flow minimum-cost graph algorithm. Vector field denoising and interpolation are performed using anisotropic filtering after clustering. The technique has been experimentally verifiedand successfully applied to the tracking of Fluorescent Speckle Microscopy images of live cells.
Restoration of Images with Atmospheric Perturbation Simulation
Authors: Magali Lemaitre, Fabrice Meriaudeau, Olivier Laligant, Jacques Blanc-Talon
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

We study model-based restoration of ground-to-ground images. Such images may show strong degradations due to non-linear atmospheric turbulence effects and therefore, any efficient restoration method must take into account some modelling of the turbulence. The first part of the paper is devoted to the realistic simulation of single frames and image sequences degraded by atmospheric turbulence at two different light wavelengths. The second part deals with the comparison of several restoration methods (inverse filtering, Tikhonov regularization, Laplacian regularization and Wiener filtering); a new method is also considered.
10 GBPS over Copper Lines " State of the Art in VLSI, invited
Authors: Stephen Bates, Kris Iniewski
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

The convergence of voice, data and video onto a single network combined with large global consumer and corporate appetite for internetworking is leading to the continuous installation and upgrade of communication infrastructure worldwide. However, the broad variety of networking protocols used in wide, metropolitan, local and storage area networks creates unnecessary network complexity. Great simplifications in network management in could be accomplished if high-bandwidth signals can be transported over standard copper wires. The install-base of 1000BASE-T (Gigabit Ethernet over Copper) [1] has begun to grow significantly. This deployment has been fueled in part by its seamless backward compatibility with older BASE-T solutions and by the availability of cheap, low-power physical layer solutions. However, the IEEE 802.3 body has almost completed work on the successor to 1000BASE-T (10GBASE-T) [2]. This paper outlines some of the problems that VLSI designers are solving and provides some estimates on feasibility of future CMOS devices. We outline some of the challenges for 10GBASE-T and present some of the performance figures that a 10GBASE-T PHY will have to meet.
Forward slices are smaller than backward slices
Authors: David Binkley, Mark Harman
Venue: Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (2005)

This paper presents evidence from two empirical studies which show that forward slices will tend to be smaller than backward slices and discusses the importance of this result for work on source code analysis and manipulation. The difference in forward and backward slice size distributions stems from the way in which control dependence and data dependence affect slice size. The paper explains this claim in detail and supports it with empirical evidence. The empirical evidence comes from a further study which uses a restricted form of slicing that isolates the effects due to control and data dependence. This study shows that it is the inherent difference between forward and backward control dependence that leads to the difference in slice size distributions for forward and backward slicing. The results from all three empirical studies are shown to be strongly statistically significant.
A neophyte's guide to reentrant usability with enchiridion
Authors: A. P. ril Phule
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1981)

Reusable systems will require reusable documents to ensure the best possible efficiency. Improved efficiency means improved productivity per unit; although it cannot be considered a parallel indicator. 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
A content-based image retrieval system for fish taxonomy
Authors: Yixin Chen, Henry L. Bart,  Jr., Fei Teng
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

It is estimated that less than ten percent of the world's species have been discovered and described. The main reason for the slow pace of new species description is that the science of taxonomy, as traditionally practiced, can be very laborious: taxonomists have to manually gather and analyze data from large numbers of specimens, often from broad geographic areas, and identify the smallest subset of external body characters that uniquely diagnoses the new species as distinct from all its known relatives. The pace of data gathering and analysis in taxonomy can be greatly increased by the development of information technology. The Internet is being used to link taxonomists,taxonomic literature and specimen databases in different parts of the globe, and hence enables the development of tools for remote study of specimens archived as digital images. In this paper, we propose a content-based image retrieval system for taxonomic research. The system has a learning component that can identify representative body shape characters of known species based on digitized landmarks. The system can also provide statistical clues for assisting taxonomists to identify new species or subspecies. The experiments on a taxonomic problem involving species of suckers in the genera Carpiodes demonstrate promising results.
Network Routing Based on Reinforcement Learning in Dynamically Changing Networks
Authors: Sara Khodayari, M. J. Yazdanpanah
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

In this paper we propose a reinforcement learning (RL) algorithm for packet routing in computer networks with emphasis on different traffic conditions. It is shown that routing with an RL approach, considering the traffic, can result in shorter delivery time and less congestion. A simple, but rational simulation of a computer network has also been tested and the suggested algorithm has been compared with other conventional ones. At the end, it is concluded that the suggested algorithm can perform packet routing efficiently with advantage of considering the dynamics in a real network.
Review of "Computer Simulation Techniques in Hydrology, by George Fleming", American Elsevier Publishing Company, 1975
Venue: ACM SIGSIM Simulation Digest (1976)

Although a specialized volume in modeling and simulation (deterministic simulation techniques were first introduced in this field about 1959), this volume is highly recommended. It is useful not only to those engaged in hydrology, but it serves as a guide to model and simulation development in other areas of ecosystems. 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
2005 Linux journal readers' choice awards
Authors: Linux Journal Staff
Venue: Linux Journal (2005)

Your favorite distribution is what? This year, maybe the rest of the readers finally agree with you.
Integrating procedural textures with replicated image editing
Authors: Stephen Brooks, Neil A. Dodgson
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Image editing software is often characterized by a seemingly endless array of toolbars, filters, transformations and layers. But recently, a counter trend has emerged in the field of image editing which aims to reduce the user's workload through semi-automation. This alternate style of interaction has been made possible through advances in directed texture synthesis and computer vision. and it is in this context that we have developed our texture editing system that allows complex operations to be performed on images with minimal user interaction. This is achieved by utilizing the inherent self-similarity of image textures to replicate intended manipulations globally. In this paper, we expand the capabilities of replicated image editing by integrating procedural texture generation.
High performance LU factorization for non-dedicated clusters
Authors: T. Endo, K. Kaneda, K. Taura, A. Yonezawa
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

This paper describes an implementation of parallel LU factorization. The focus is to achieve high performance on non-dedicated clusters, where the number of available computing resources may be arbitrary and even dynamically changing. We accommodate joining/leaving processes by describing the algorithm in the Phoenix programming model. We achieve high performance in this setting by a combination of techniques including a latency tolerant communication and data partitioning that achieves both load balance and small communication volume for arbitrary and dynamically changing number of processors. We observed 130 GFlops with 128 processes on a 70-node dual 2.4GHz Xeon cluster, at matrix size = 46080. This performance is comparable to that of the High Performance Linpack (HPL). When cluster nodes are loaded by background processes, our implementation surpasses HPL.
Investigating the Relations used in Conceptual Combination
Authors: Barry Devereux, Fintan Costello
Venue: Artificial Intelligence Review (2005)

How do people understand noun---noun compounds such as volcano science and pear bowl? In this paper, we present evidence against one approach to noun---noun compounds, namely that of arranging the meanings of compounds into a small, finite taxonomy of general semantic relations. Using a typical relation taxonomy, we conducted an experiment examining how people classify compounds into the taxonomy's relation categories. We found that people often select not one but several relations for each compound; for example, people classify coffee stain as coffee MAKES stain, stain MADE OF coffee, coffee CAUSES stain and stain DERIVED FROM coffee. A natural metric for relational similarity follows from our experimental data; we found that using cluster analysis to group compounds' interpretations with respect to this metric produced groupings that were different from the original taxonomic categories, suggesting that there is more than one way to classify the meanings of compounds. We also found that compounds which had similar constituent concepts tended to be interpreted with similar relations, indicating that the intrinsic properties of a compound's constituent concepts help determine how that compound is interpreted. Such findings are problematic for taxonomic theories of conceptual combination
A Design Process for the Development of Innovative Smart Clothing that Addresses End-User Needs from Technical, Functional, Aesthetic and Cultural View Points.
Authors: Jane McCann, Richard Hurford, Adam Martin
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

The research and development of attractive smart clothing, with truly embedded technologies, demands the merging of science and technology with art and design. This paper looks at a comparatively new and unique design discipline that has been given little prior consideration. The concept of 'wearables' crosses the boundaries between many disciplines. A gap exists for a common 'language' that facilitates creativity and a systematic design process. Designers of smart clothing require guidance in their enquiry, as gaining an understanding of issues such as; usability, manufacture, fashion, consumer culture, recycling and end user needs can seem forbidding and difficult to prioritise. This paper presents a design tool in a format that can be understood by practitioners who come from a range of backgrounds. The representation of the 'critical path' is intended as a tool to guide the design research and development process in the application of smart technologies.
Estimating the Pen Trajectories of Multi-Path Static Scripts Using Hidden Markov Models
Authors: E. Nel, J. A. Du Preez, B. M. Herbst
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Static handwritten scripts are available only as images on documents and by definition do not contain dynamic information. This study is about extracting dynamic information from a static handwritten script, specifically the sequence of pen positions that created the script. We assume that a dynamic representative of the static image is available (a different version typically obtained during an earlier registration process). A Hidden Markov Model (HMM) of the static image is compared with the dynamic representative to extract the dynamic information from the static image.
A Comparative Study of Feature Vector-Based Topic Detection Schemes A Comparative Study of Feature Vector-Based Topic Detection Schemes
Authors: Masafumi Hamamoto, Hiroyuki Kitagawa, Jia-Yu Pan, Christos Faloutsos
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

Topic detection is an important subject when voluminous text data is sent continuously to a user. We examine a method to detect topics in text data using feature vectors. Feature vectors represent the main distribution of data and they are obtained by various data analysis methods. This paper examines three methods: Singular Value Decomposition (SVD), clustering, and Independent Component Analysis (ICA). SVD and clustering are popular existing methods. Clustering, especially, is applied to many topic detection methods. ICA was recently developed in signal processing research. In applications related to text data, however, ICA has not been compared with SVD and clustering, nor has its relationship with them been explored. This paper reports comparative experiments for these three methods and then shows properties as they apply to text data.
Investigation of Combining SVM and Decision Tree for Emotion Classification
Authors: Thao Nguyen, Mingkun Li, Iris Bass, Ishwar K. Sethi
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

This paper discusses the use of a combination of support vector machine and decision tree learning for recognizing four emotions in speech, which are Neutral, Angry, Lombard, and Loud. The base features selected were pitch, derivative of pitch, energy, speaking rate, formants, bandwidths, and Mel Frequency Cepstral Coefficients. Three methods of combining learned support vector machine and decision tree classifiers were proposed, namely, minimum misclassification, maximum accuracy, and dominant class. Using the Speech Under Simulated and Actual Stress database, the average accuracy from the minimum misclassification, maximum accuracy, and dominant class methods were 72.4%, 70.8%, 71.3% respectively as opposed to 63.9% and 67.4% which were obtained by using support vector machine and decision tree learning alone.
A methodology for implementing structured flowcharting
Authors: Stephen C. Dewhurst
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1979)

The need for a structured approach to flowcharting is well-established. As a design aid structured flowcharting helps to produce a structured product, and as a documentation tool structured flowcharts are invariably more readable (and hence, move useful) than unstructured ones.
Obfuscated databases and group privacy
Authors: Arvind Narayanan, Vitaly Shmatikov
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

We investigate whether it is possible to encrypt a database and then give it away in such a form that users can still access it, but only in a restricted way. In contrast to conventional privacy mechanisms that aim to prevent any access to individual records, we aim to restrict the set of queries that can be feasibly evaluated on the encrypted database.We start with a simple form of database obfuscation which makes database records indistinguishable from lookup functions. The only feasible operation on an obfuscated record is to look up some attribute Y by supplying the value of another attribute X that appears in the same record (i.e., someone who does not know X cannot feasibly retrieve Y). We then (i) generalize our construction to conjunctions of equality tests on any attributes of the database, and (ii) achieve a new property we call group privacy. This property ensures that it is easy to retrieve individual records or small subsets of records from the encrypted database by identifying them precisely, but ``mass harvesting'' queries matching a large number of records are computationally infeasible.Our constructions are non-interactive. The database is transformed in such a way that all queries except those explicitly allowed by the privacy policy become computationally infeasible, i.e.,, our solutions do not rely on any access-control software or hardware.