ppxscal/embedding_network huggingface dataset:
Merging face and finger images for human identification
Authors: A. Khuwaja
Venue: Pattern Analysis Applications (2005)

Human identification performance reported so far using face or finger images under certain conditions is good practice, however, there is still a great need for better performance in biometrics for use in video surveillance. One possible way to achieve improved performance is to combine information from multiple sources. Besides, such systems alleviate some of the problems that are faced by single biometrics-based systems like restricted degrees of freedom, spoof attacks, and unacceptable error rates. We present a prototype bimodal biometric identification system by merging face and finger images. A novel approach is adopted to merge biometric (face and finger) traits of an individual to one image (containing features of both), named merged pattern. The integrated features are then extracted with an adaptive artificial neural network. The proposed algorithm is shown to exhibit robustness in achieving better classification results with both good generalization performance and a fast training/test time using variable public domain databases. Sources of variability include facial expression, gender, individual appearance, tilt, lighting conditions, and occluding objects (hair, spectacles, etc).
Managing schema mappings in highly heterogeneous environments
Authors: Yannis Velegrakis
Venue:  (2005)

Integration, transformation, and translation of data is increasingly important for modern information systems and e-commerce applications. Views, and more generally, transformation specifications, or mappings, provide the foundation for many data transformation applications. Mappings are usually specified manually by data administrators that are familiar with the semantics of the data and have a good knowledge of the transformation language. The task of generating and managing mappings is laborious, time consuming and error-prone since data administrators are called on to write complex mappings in which they specify in tedious detail how the data is to be transformed. Even once deployed, mappings must remain under constant supervision since changes in the structure of the data may require changes in the mappings. In this dissertation, we elaborate on the development of mapping management tools that are intended to shield administrators from the laborious task of mapping management. In particular, we present a novel framework for generating mappings between any combination of XML and relational schemas. A set of high-level binary relationships between the elements of the two schemas, which are specified by a user or generated by a tool, are combined together to form semantically meaningful mappings. These mappings are guaranteed to be consistent with the constraints of the schemas. To handle schemas that are dynamically modified, we describe a methodology for automatically detecting the mappings that have become invalid as a result of a schema change and rewriting them to become consistent with the modified schema. Each rewriting is generated in a way that preserves, as much as possible, the semantics of the initial mapping. Finally, we show how collections of schemas and mappings can be used in queries to provide a better understanding of how data has been integrated and transformed.
User study on older adults&#x2019; use of the Web and search engines
Authors: Anne Aula
Venue: Universal Access in the Information Society (2005)

Ten older adults were interviewed about the motivational factors behind learning to use computers and the negative and positive aspects related to it. They were then given search tasks and were observed as they used search engines for finding information from the Web. All of the participants completed several search tasks during the search session. Although their performance in the search tasks was adequate, they faced several problems in the interaction. For example, text editing was difficult and understanding the structure of the Web and terminology used caused problems. Based on the observations, an &#x201c;elderly friendly&#x201d; search user interface is proposed.
The relationship between the multiplicative and mixed generators modulo 2b
Authors: C. L. Overstreet
Venue: ACM SIGSIM Simulation Digest (1976)

In 1951, D. H. Lehmer [4] first proposed the linear congruential technique, Xn+1 &equiv; aXn + c (Mod M) as a source of random numbers. This technique has since become known as the multiplicative random number generator for c = 0 and as the mixed random number generator for c &ne; 0.
Problems, prospects, and an alternative approach in simulation modeling
Authors: Robert B. Fetter
Venue: ACM SIGSIM Simulation Digest (1979)

Early work (1950's) in simulation and first attempts at modeling of health care facilities utilization are described. Lessons learned from this work are given together with perceived limitations of available technology, the development of the Conversational Modelling Language and its implications for OR in general and simulation in particular are described.
Key management for multi-user encrypted databases
Authors: Ernesto Damiani, S. De Capitani di Vimercati, Sara Foresti, Sushil Jajodia, Stefano Paraboschi, Pierangela Samarati
Venue: Proceedings of the 2005 ACM workshop on Storage security and survivability (2005)

Database outsourcing is becoming increasingly popular introducing a new paradigm, called database-as-a-service (DAS), where an organization's database is stored at an external service provider. In such a scenario, access control is a very important issue, especially if the data owner wishes to publish her data for external use.In this paper, we first present our approach for the implementation of access control through selective encryption. The focus of the paper is then the presentation of the experimental results, which demonstrate the applicability of our proposal.
HfO2/spacer-interface breakdown in HfO2 high-κ/poly-silicon gate stacks
Authors: R. Ranjan, K. L. Pey, C. H. Tung, L. J. Tang, B. Elattari, T. Kauerauf, G. Groeseneken, R. Degraeve, D. S. Ang, L. K. Bera
Venue: Microelectronic Engineering (2005)

The gate dielectric breakdown induced microstructral changes in HfO2 high-κ gate stacks are analyzed using high resolution transmission electron microscopy. A new failure mechanism along the interface of HfO2/spacer has been observed in HfO2 high-κ gate stacks. This breakdown which is more common in accumulation mode stressing conditions in HfO2 high-κ/poly-Si gate stacks has not been observed in oxynitride gate dielectrics. It is believed that this interfacial breakdown could be dependent on enhanced electric field at the source/drain extension regions and on the corner geometry of the high-κ/poly Si gate stacks.
Preventive Replication in a Database Cluster
Authors: Esther Pacitti, Cédric Coulon, Patrick Valduriez, M. Tamer Özsu
Venue: Distributed and Parallel Databases (2005)

In a database cluster, preventive replication can provide strong consistency without the limitations of synchronous replication. In this paper, we present a full solution for preventive replication that supports multi-master and partial configurations, where databases are partially replicated at different nodes. To increase transaction throughput, we propose an optimization that eliminates delay at the expense of a few transaction aborts and we introduce concurrent replica refreshment. We describe large-scale experimentation of our algorithm based on our RepDB* prototype (http://www.sciences.univ-nantes.fr./lina/ATLAS/RepDB) over a cluster of 64 nodes running the PostgreSQL DBMS. Our experimental results using the TPC-C Benchmark show that the proposed approach yields excellent scale-up and speed-up.
A general method for comparing the expected performance of tracking and motion capture systems
Authors: B. Danette Allen, Greg Welch
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

We introduce a general method for evaluating and comparing the expected performance of sensing systems for interactive computer graphics. Example applications include head tracking systems for virtual environments, motion capture systems for movies, and even multi-camera 3D vision systems for image-based visual hulls.Our approach is to estimate the asymptotic position and/or orientation uncertainty at many points throughout the desired working volume, and to visualize the results graphically. This global performance estimation can provide both a quantitative assessment of the expected performance, and intuition about the type and arrangement of sources and sensors, in the context of the desired working volume and expected scene dynamics.
Automatic Design of Binary and Multiple-Valued Logic Gates on RTD Series
Authors: Krzysztof S. Berezowski, Sarma B. K. Vrudhula
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

In this paper, we contribute to the binary and multiplevalued applications of resonant tunneling devices (RTDs). We propose a method of systematic design of physical parameters of RTD based logic. From the abstraction of their behavior, we model the design space as a handful of systems of linear inequalities generated for a given circuit topology and an arbitrary logic function. Any valid solutionreflects the physical parameters assignment that implements the function given. We solve these systems using off-theshelf optimization tool and verify the results using SystemC based RTD circuit model. Our simulations confirm, that the numerical solutions are valid parameter assignments.
Multi-Dimensional Separation of Concerns in Requirements Engineering
Authors: Ana Moreira, Awais Rashid, Joao Araujo
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Existing requirements engineering approaches manage broadly scoped requirements and constraints in a fashion that is largely two-dimensional, where functional requirements serve as the base decomposition with non-functional requirements cutting across them. Therefore, crosscutting functional requirements are not effectively handled. This in turn leads to architecture trade-offs being mainly guided by the non-functional requirements, so that the system quality attributes can be satisfied. In this paper, we propose a uniform treatment of concerns at the requirements engineering level, regardless of their functional, non-functional or crosscutting nature. Our approach is based on the observation that concerns in a system are, in fact, a subset, and concrete realisations, of abstract concerns in a meta concern space. One can delineate requirements according to these abstract concerns to derive more system-specific, concrete concerns. We introduce the notion of a compositional intersection, which allows us to choose appropriate sets of concerns in our multi-dimensional separation as a basis to observe trade-offs among other concerns. This provides a rigorous analysis of requirements-level trade-offs as well as important insights into various architectural choices available to satisfy a particular functional or non-functional concern.
Semicontinuous Mappings into T.V.S. with Applications to Mixed Vector Variational-Like Inequalities
Authors: Y. Chiang
Venue: Journal of Global Optimization (2005)

Let $$\cal L$$ (X, Z) be the space of continuous linear mappings between topological vector spaces, where Z is Hausdorff and preordered by a closed convex cone C. In this paper, we introduce a notion of semicontinuity to any function from a topological space into X. A notion of semicontinuity is also introduced to any function from a topological space into $$\cal L$$ (X, Z). These two notions of semicontinuity are related by the embedding of X into $$\cal L$$ (X, Z). Their basic properties are given. As an application, we derive some existence results for the mixed vector variational-like inequality.
Frequency domain simulation of high-Q oscillators with homotopy methods
Authors: Xiaochun Duan, K. Mayaram
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

An algorithm for the robust and efficient simulation of high-Q oscillators using the harmonic balance method is presented. Globally convergent homotopy methods are combined with the harmonic balance method for high-Q oscillator simulation. Various homotopy options are evaluated leading to an algorithm that is applicable to a wide variety of oscillator circuits.
Capacity Allocation for Business Processes with QoS Requirements: A Heavy Traffic Approach
Authors: Pu Huang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

The Business Process Execution Language for Web Services (BPEL) provides a common standard for modeling and sharing business processes across enterprises via Web services. Business applications that handle different operations within a business process usually share computational capacity. In this paper, we provide a method to allocate computational capacity across these applications. Our method takes the follow factors into consideration: random arrivals of business process instances, service time fluctuations of business applications, Quality of Service (QoS) requirements, and the composition structure of the business process specified by BPEL. Using heavy traffic approximations, we formulate and solve the capacity allocation problem as a nonlinear optimization problem with QoS constraints; our method also gives a pessimistic bound on the maximum sustainable request rate the system can support.
A statistical approach to errors in bibliographic data bases
Authors: T. D. C. Kuch
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

Virtually all large bibliographic data base (BDB) systems use inverted files for efficient retrieval. These files contain unique character strings found in the BDB, with the exception of stopwords such as A, AN, THE, etc. For each unique string, the number of records in which it occurs is also given. 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
An Efficient Approach to Custom Instruction Set Generation
Authors: GuangWei Zou, Xiang Liu
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Application-specific Instruction set extension to the computational capabilities of a processor provides an efficient mechanism to meet the growing performance and time-to-market demands of embedded applications. In this paper, a new methodology for custom instruction set generation is proposed by using profiling technique to analyze CDFG (Control and Data Flow Graph) of C program. In the new methodology, we mainly consider major blocks of CDFG of the given application in order to speed up the whole process. It results that for the application, the major blocks fewer, and the process faster. Our approach will significantly reduce the time of the whole process while does not affect the benefit of results. The experimental results demonstrate the improvements over existing techniques.
Random deviates from the DIPOLE distribution
Venue: ACM SIGSIM Simulation Digest (1973)

The function subprogram DIPOLE, written by Robert E. Knop of the Physics Department, The Florida State University at Tallahassee FL 32306, returns a random deviate - &infin; < z < &infin; sampled from the two parameters (R2 < 1, &alpha; arbitrary) family of the density function: f(z) = 1/(&pi; (1 + z2)) + R2 * ((1 - z2) * cos(2&alpha;) + 2* z* sin (2&alpha;)/(&pi; * (1 + z2)2). 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
Dynamic and Fault-tolerant Cluster Management
Authors: Anders Gidenstam, Boris Koldehofe, Marina Papatriantafilou, Philippas Tsigas
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

Recent decentralised event-based systems have focused on providing event delivery which scales with increasing number of processes. While the main focus of research has been on ensuring that processes maintain only a small amount of information on maintaining membership and routing, an important factor in achieving scalability for event-based peer-to-peer dissemination system is the number of events disseminated at the same time. This work presents a dynamic and fault tolerant cluster management method which can be used to coordinate concurrent access to resources in a peer-to-peer system. In the context of event-based dissemination systems the cluster management can be used to control the number of concurrently disseminated events. We present and analyse an algorithm implementing the proposed cluster management model in a fault-tolerant and decentralised way. The algorithm provides for each cluster a limited set of tickets. A process which has obtained a ticket may send events corresponding to the resources of the cluster. The algorithm guarantees that no two processes ever issue an event corresponding to the same ticket at the same time. The cluster management model on its own has interesting properties which can be useful for many peer-to-peer applications.
Temporal skeletons for verifying time
Authors: Gustaf Naeser, Kristina Lundqvist, Lars Asplund
Venue: ACM SIGAda Ada Letters (2005)

This paper presents an intermediate notation used in a framework for verification of real-time properties. The framework aims at overcoming the need for the framework user to have significant knowledge of the verification specific detail that formal verification at some level is bound to impose on a model. In order to accomplish this, model extraction from source code of an initial formal model, a timing skeleton, is made automatically. The model refinement needed to transform the temporal skeleton into a model that can be verified is not done immediately. This allows postponement of the abstraction and specialisation needed for the verification which further improves the readability of the skeleton. The purpose of the timing skeleton is that it easily can be validated to represent the source code it was created from. The timing skeleton is then automatically refined with verification detail, and then hidden for the user, transformed into the notation of a verification tool. This transformation is hidden from the user. In order to reduce the complexity of the application model the framework uses a formally verified run-time kernel with a clear separation from the application. The kernel supports preemption, dynamic priorities and multiple processors.
High-Level Modelling and Detection of the Faulty Behaviour of VOQ Switches under Balanced Traffic
Authors: Miguel Pereira, Enrique Soto, Juan J. Rodriguez-Andina, F. Javier Gonzalez-Castano
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

High-speed telecommunications routers are very important systems in today¿s networked environments. The purpose of this paper is to propose a mathematical model of the faulty behaviour of such systems and, derived from it, a scheme for the detection of errors occurring concurrently with their normal operation. Although the ultimate goal is to obtain a fault-tolerant router, this work concentrates on the scheduler part of the system and, in particular, in the case of virtual output-queued (VOQ) switches. As starting point, in this paper a balanced traffic load is assumed. The faulty behaviour of complex digital processing systems is usually better described at the algorithmic level, particularly when the operation of the system relies on complex mathematical principles. Therefore, the issues related to concurrent error detection are addressed from the developed mathematical model. Results are presented that point to the ability of the proposed solution to detect errors at a high abstraction level. They have been obtained by injecting faults in the algorithm flow rather than in the hardware itself.
Character Duration Modeling for Speed Improvements in the BBN Byblos OCR System
Authors: Premkumar Natarajan, Ram Sundaram, Rohit Prasad, Ehry MacRostie
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we describe a recent enhancement to our HMM-based OCR system that results in a signzjicant increase in the speed of the system without any impact on recognition accuracy. Recognition speed is, in part, a function of the number of distinct HMMs that constitute the model set. As a result, the recognition speed is much slower for ideographic scripts, such as Chinese and Japanese which contain thousands of glyphs, than for alphabetic scripts such as Latin and Arabic. In our current OCR system, methods like sub-character modeling and Gaussian shortlists are used to reduce the processing time. In this paper we describe a simple character-based duration modeling technique that puts a duration constraint on the number of frames for which a character can stay active. Character durations were obtained from automatically labeled training data and a probability mass function (histogram) was used to model character durations. The use of a duration model yielded a 37% improvement in speed with no loss in accuracy.
Active Pursuit Tracking in a Projector-Camera System with Application to Augmented Reality
Authors: Shilpi Gupta, Christopher Jaynes
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

We introduce on active object tracking algorithm that maintains relative calibration between a camera projector pair for augmented-relaity applications. The approach is motivated by the growing use of digital light projectors for human computer interaction and novel display environments. These domains typically require known relative calibration between the camera and projector so that events detected ib the camera (i.e. a user pushbutton selection) can correctly impact the projected display. The tracking algorithm detects both real world landmarks and projected fiducials and updates the transform that will bring them into alignment in each frame. The active pursuit tracker is demonstrated in the context of an application that allows users to visualize a virtual volume of three-dimensional data simply by physicallypositioning a display plane within the space.
A survey of multi-agent organizational paradigms
Authors: Bryan Horling, Victor Lesser
Venue: The Knowledge Engineering Review (2004)

Many researchers have demonstrated that the organizational design employed by an agent system can have a significant, quantitative effect on its performance characteristics. A range of organizational strategies have emerged from this line of research, each with different strengths and weaknesses. In this article we present a survey of the major organizational paradigms used in multi-agent systems. These include hierarchies, holarchies, coalitions, teams, congregations, societies, federations, markets, and matrix organizations. We will provide a description of each, discuss their advantages and disadvantages, and provide examples of how they may be instantiated and maintained. This summary will facilitate the comparative evaluation of organizational styles, allowing designers to first recognize the spectrum of possibilities, and then guiding the selection of an appropriate organizational design for a particular domain and environment.