ppxscal/embedding_network huggingface dataset:
GA-Based Iris/Sclera Boundary Detection for Biometric Iris Identification
Authors: Tatiana Tambouratzis, Michael Masouris
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

Iris identification (IRI) constitutes an increasingly accepted methodology of biometrics. IRI is based on the successful encoding and matching of distinctive iris features (folds, freckles etc.), which - in turn - presupposes that iris segmentation has been accurately performed. In contrast to the inner (iris/pupil) iris boundary, which --- owing to the high contrast between the adjacent areas - is relatively easy to localize, detection of the outer (iris/sclera) iris boundary is more challenging since the low contrast between the separated areas often results in fragmented, ambiguous and spurious edges. A novel approach to iris boundary detection is presented here, featuring a genetic algorithm (GA) for outer iris boundary detection.
Coverage Estimation in the Presence of Occlusions for Visual Sensor Networks
Authors: Cheng Qian, Hairong Qi
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

Visual coverage is an essential issue in the research on visual sensor networks. However, because of the presence of visual occlusions, the statistics of visual coverage blend the statistics of nodes and targets and are extremely difficult to derive. By assuming the deployment of nodes as a stationary Poisson point process and ignoring boundary effects, this paper presents the first attempt to estimate the probability that an arbitrary target in the field is visually k-covered. The major challenge for the estimation is how to formulate the probability (q) that a node captures a target in its visual range. To tackle this challenge, we first assume a visual detection model that takes visual occlusions into account and then derive several significant statistical parameters of q based on this model. According to these parameters, we can finally reconstruct the probability density function of q as a combination of a Binomial function and an impulse function. With the estimated coverage statistics, we further propose an estimate of the minimum node density that suffices to ensure a K-coverage across the field.
Large Workspace Haptic Devices for Human-Scale Interaction: A Survey
Authors: Florian Gosselin, Claude Andriot, Joan Savall, Javier Martín
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

One aim of haptic interfaces is to enhance the user's immersion in a virtual environment through the stimulation of the haptic sense. Some applications demand a large-volume workspace to allow human-scale interaction. Different design approaches aimed at addressing this issue, such as specific non redundant devices, redundant robots, mobile or wearable haptic interfaces and tensed cable architectures are reviewed and compared in this paper, concluding with some guidelines for their applicability.
HYCARE: A Hybrid Context-Aware Reminding Framework for Elders with Mild Dementia
Authors: Kejun Du, Daqing Zhang, Xingshe Zhou, Mounir Mokhtari, Mossaab Hariz, Weijun Qin
Venue: Proceedings of the 6th international conference on Smart Homes and Health Telematics (2008)

Dementia occurs much more frequently in the elders who exhibit impairments of memory, thought and reasoning. In this paper, we present a hybrid context-aware reminding framework intended to help elders with mild dementia improve their level of independence and quality of life. Based on the user study in three different pilot sites, the reminding services are identified and classified into four types according to the nature and urgency. The framework with a novel scheduling mechanism is designed which handles both synchronous time-based and asynchronous event-based reminding services. In order to facilitate the interaction between the caregivers and system, we also provide a simple software tool for caregivers to create and edit the reminding services. Finally, we present some initial implementation results.
Preserving Computer-Related Source Material
Venue: IEEE Annals of the History of Computing (1980)

In June 1979 a small brochure entitled "Preserving Computer-Related Source Materials" was produced by AFIPS. It was distributed to the registrants at the 1979 AFIPS National Computer Conference and to various individuals believed to be interested in the subject, including subscribers to the Annals. Because the Annals is also partly a journal of record for important material in the history of computing, it is appropriate to reproduce the text here. The brochure, which is the standard size of 3 3/4" x 8 1/2", can be obtained from AFIPS Headquarters for individual or bulk distribution. The brochure was prepared by Nancy Stern, a member of the AFIPS History of Computing Committee (HOCC); it was reviewed by the HOCC prior to completion and was issued under HOCC auspices. We want to acknowledge that this brochure was based, with permission, on Scientific Source Materials: A Note on Their Preservation, a publication of the American Institute of Physics' Center for History of Physics. 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
Efficient Updates for Continuous Skyline Computations
Authors: Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for multi-dimensional databases. In contrast to most of the prior work, we focus on the unresolved issue of frequent data object updates. In this paper we propose the ESC algorithm, an Efficient update approach for Skyline Computations, which creates a pre-computed second skyline set that facilitates an efficient and incremental skyline update strategy and results in a quicker response time. With the knowledge of the second skyline set, ESC enables (1) to efficiently find the substitute skyline points from the second skyline set only when removing or updating a skyline point (which we call a first skyline point) and (2) to delegate the most time-consuming skyline update computation to another independent procedure, which is executed after the complete updated query result is reported. We leverage the basic idea of the traditional BBS skyline algorithm for our novel design of a two-threaded approach. The first skyline can be replenished quickly from a small set of second skylines - hence enabling a fast query response time - while de-coupling the computationally complex maintenance of the second skyline. Furthermore, we propose the Approximate Exclusive Data Region algorithm (AEDR) to reduce the computational complexity of determining a candidate set for second skyline updates. In this paper, we evaluate the ESC algorithm through rigorous simulations and compare it with existing techniques. We present experimental results to demonstrate the performance and utility of our novel approach.
TOCTOU, Traps, and Trusted Computing
Authors: Sergey Bratus, Nihal D'Cunha, Evan Sparks, Sean W. Smith
Venue: Proceedings of the 1st international conference on Trusted Computing and Trust in Information Technologies: Trusted Computing - Challenges and Applications (2008)

The security of the standard TCG architecture depends on whether the values in the PCRs match the actual platform configuration. However, this design admits potential for time-of-check time-of-use vulnerabilities: a PCR reflects the state of code and data when it was measured, not when the TPM uses a credential or signs an attestation based on that measurement. We demonstrate how an attacker with sufficient privileges can compromise the integrity of a TPM-protected system by modifying critical loaded code and static data after measurement has taken place. To solve this problem, we explore using the MMU and the TPM in concert to provide a memory event trapping framework, in which trap handlers perform TPM operations to enforce a security policy. Our framework proposal includes modifying the MMU to support selective memory immutability and generate higher granularity memory access traps. To substantiate our ideas, we designed and implemented a software prototype system employing the monitoring capabilities of the Xen virtual machine monitor.
New Products
Authors: Eyal de Lara, Maria Ebling
Venue: IEEE Pervasive Computing (2007)

In this issue, editors Eyal de Lara and Maria Ebling cover initiatives for building a ubiquitous city and rewarding excellence in the design of virtual worlds. They also highlight a robot that scares away pest birds, technology that harvests electricity from the wind generated by passing traffic, a taxi navigation system, an adaptor that provides Ethernet connectivity over residential power lines, and a bracelet that vibrates when your cell phone rings. Finally, they present a cell phone that can sense motion.
A Logical Analysis of the Interaction between `Obligation-to-do' and `Knowingly Doing'
Authors: Jan Broersen
Venue: Proceedings of the 9th international conference on Deontic Logic in Computer Science (2008)

Within a STIT framework, this paper presents a logical study of the interaction between `ought-to-do', and an epistemic notion of `knowingly doing'. We start out with some motivating examples concerning the interaction between action, obligation and knowledge. Then we present a complete temporal STIT logic including operators for action, obligation and knowledge. We use the logic to analyze the examples and discuss open problems.
Automatic Diagram Drawing Based on Natural Language Text Understanding
Authors: Anirban Mukherjee, Utpal Garain
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

This article presents a general framework for automatic conversion of a piece of text into a diagram that is described in the given text. Such kind of text is often found in many branches of Science Engineering. Secondary school-level geometric problems are considered as a reference in this study. A knowledge base or lexical resource named GeometryNet is used in interpreting geometric meaning of a given text to draw the corresponding diagram.
A note on computing set overlap classes
Authors: Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
Venue: Information Processing Letters (2008)

Let V be a finite set of n elements and F={X"1,X"2,...,X"m} a family of m subsets of V. Two sets X"i and X"j of F overlap if X"i@?X"j@A, and X"i@?X"j
Generating Multiple Solutions for Mixed Integer Programming Problems
Authors: Emilie Danna, Mary Fenelon, Zonghao Gu, Roland Wunderling
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

As mixed integer programming (MIP) problems become easier to solve in pratice, they are used in a growing number of applications where producing a unique optimal solution is often not enough to answer the underlying business problem. Examples include problems where some optimization criteria or some constraints are difficult to model, or where multiple solutions are wanted for quick solution repair in case of data changes. In this paper, we address the problem of effectively generating multiple solutions for the same model, concentrating on optimal and near-optimal solutions. We first define the problem formally, study its complexity, and present three different algorithms to solve it. The main algorithm we introduce, the one-tree algorithm, is a modification of the standard branch-and-bound algorithm. Our second algorithm is based on MIP heuristics. The third algorithm generalizes a previous approach that generates solutions sequentially. We then show with extensive computational experiments that the one-tree algorithm significantly outperforms previously known algorithms in terms of the speed to generate multiple solutions, while providing an acceptable level of diversity in the solutions produced.
Challenges in the Automated Verification of Security Protocols
Authors: Hubert Comon-Lundh
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

The application area of security protocols raises several problems that are relevant to automated deduction. We describe in this note some of these challenges.
Efficient Exploration in Reinforcement Learning Based on Utile Suffix Memory
Authors: Arthur Pchelkin
Venue: Informatica (2003)

Reinforcement learning addresses the question of how an autonomous agent can learn to choose optimal actions to achieve its goals. Efficient exploration is of fundamental importance for autonomous agents that learn to act. Previous approaches to exploration in reinforcement learning usually address exploration in the case when the environment is fully observable. In contrast, we study the case when the environment is only partially observable. We consider different exploration techniques applied to the learning algorithm &ldquo;Utile Suffix Memory&rdquo;, and, in addition, discuss an adaptive fringe depth. Experimental results in a partially observable maze show that exploration techniques have serious impact on performance of learning algorithm.
Case Authoring: From Textual Reports to Knowledge-Rich Cases
Authors: Stella Asiimwe, Susan Craw, Bruce Taylor, Nirmalie Wiratunga
Venue: Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2007)

SmartCAT is a Case Authoring Tool that creates knowledge-rich cases from textual reports. Knowledge is extracted from the reports and used to learn a concept hierarchy. The reports are mapped onto domain-specific concepts and the resulting cases are used to create a hierarchically organised case-based system. Indexing knowledge is acquired automatically unlike most textual case-based reasoning systems. Components of a solution are attached to nodes and relevant parts of a solution are retrieved and reused at different levels of abstraction. We evaluate SmartCAT on the SmartHouse domain looking at the usefulness of the cases, the structure of the case-base and the retrieval strategy in problem-solving. The system generated solutions compare well with those of a domain expert.
Combining Global and Local Classifiers for Lipreading
Authors: Shengping Zhang, Hongxun Yao, Yuqi Wan, Dan Wang
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

Lipreading has become a hot research topic in recent years since the visual information extracted from the lip movement has been shown to improve the performance of automatic speech recognition (ASR) system especially under noisy environments [1]-[3], [5]. There are two important issues related to lipreading: 1) how to extract the most efficient features from lip image sequences, 2) how to build lipreading models. This paper mainly focuses on how to choose more efficient features for lipreading.
On-off keying modulation and tardos fingerprinting
Authors: Fuchun Xie, Teddy Furon, Caroline Fontaine
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

We consider a particular design of fingerprinting code for multimedia contents, carefully motivated by a detailed analysis. This design is based on a two-layer approach: a probabilistic fingerprinting code a la Tardos coupled with a zero-bit side informed watermarking technique. The detection of multiple watermark presences in content blocks give birth to extended accusation processes, whose performances, assessed experimentally, are excellent. This prevents the colluders from mixing different content blocks, a class of collusion which is not encompassed in the classical marking assumption. Therefore, the collusion must stick to the block exchange strategy which is fully tackled by the fingerprinting code.
Multiple Criteria Mathematical Programming and Data Mining
Authors: Yong Shi, Rong Liu, Nian Yan, Zhenxing Chen
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Recently, researchers have extensively applied quadratic programming into classification, known as V. Vapnik's Support Vector Machine, as well as various applications. However, using optimization techniques to deal with data separation and data analysis goes back to more than forty years ago. Since 1998, the authors and their colleagues extended such a research idea into classification via multiple criteria linear programming (MCLP) and multiple criteria quadratic programming (MQLP). The purpose of the paper is to share our research results and promote the research interests in the community of computational sciences. These methods are different from statistics, decision tree induction, and neural networks. In this paper, starting from the basics of Multiple Criteria Linear Programming (MCLP), we further discuss penalized MCLP Multiple Criteria Quadratic Programming (MCQP), Multiple Criteria Fuzzy Linear Programming, Multi-Group Multiple Criteria Mathematical Programming, as well as regression method by Multiple Criteria Linear Programming. A brief summary of applications of Multiple Criteria Mathematical Programming is also provided.
DRN: A CORBA-Based Distributed Resource Navigation System for Data Grid
Authors: Jia-Jia Miao, Ai-Ping Li, Jia Yan, Quan-Yuan Wu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Data grids are becoming increasingly important for sharing distributed data and information in collaborative environments. This paper presents a CORBA-based Distributed Resource Navigation system consisting of Resource Agents and Navigation Service. The former one is a middleware that provides applications with a uniform set of operations to access heterogeneous distributed storage resources including file systems and database systems, and archival storage systems. The latter one is a metadata navigation service which is utilized by DRN to improve data publishing and lookup efficiency. Experiments show that CORBA-based DRN can provide the essential data virtualization services, and that Navigation service and Resource agent have a good performance with concurrent accesses.
Optimal computer memory allocation for the Poisson flows
Authors: V. V. Mazalov, M. Tamaki, S. V. Vinnichenko
Venue: Automation and Remote Control (2008)

For the data making up Poisson processes, a method for optimal allocation of the computer memory consisting of serially positioned stacks was proposed.
From an Information System to a Decision Support System
Authors: Alicja Wakulicz---Deja, Agnieszka Nowak
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

In the paper we present the definition of Pawlak's model of an information system. The model covers information systems with history, systems with the decomposition of objects or attributes and dynamical information systems. Information systems are closely related to rough set theory and decision support systems. The paper demonstrates how the results of Pawlak's research can be applied in the artificial intelligence domain.
Noise Control Boundary Image Matching Using Time-Series Moving Average Transform
Authors: Bum-Soo Kim, Yang-Sae Moon, Jinho Kim
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

To achieve the noise reduction effect in boundary image matching, we exploit the moving average transform of time-series matching. Our motivation is that using the moving average transform we may reduce noise in boundary image matching as in time-series matching. We first propose a new notion of k-order image matching, which applies the moving average transform to boundary image matching. A boundary image can be represented as a sequence in the time-series domain, and our k-order image matching identifies similar boundary images in this time-series domain by comparing the k-moving average transformed sequences. Next, we propose an index-based method that efficiently performs k-order image matching on a large image database, and prove its correctness. Moreover, we present its index building and k-order image matching algorithms. Experimental results show that our k-order image matching exploits the noise reduction effect, and our index-based method outperforms the sequential scan by one or two orders of magnitude.
Adaptive collaboration in an ever-changing environment
Authors: Jinqiao Yu, Y. V. Ramana Reddy, Shufen Liu, Zhilin Yao, Vijayanand Bharadwaj, Sumitra Reddy, Srinivas Kankanahalli
Venue: Multiagent and Grid Systems (2008)

Traditional collaboration systems are typically bundled with a set of tools with pre-specified static workflow and usage patterns. They are found to be inflexible and incompetent for today's heterogeneous and ever-changing collaboration contexts and computing environments. Today's collaboration systems must be aware of the dynamic changes of collaboration contexts in a timely manner and be adaptive to these changes appropriately. In this paper, we illustrate how business logic and computing environment context awareness are provided through a set of shared ontologies with well-defined semantics in a project called as EkSarva. The awareness of collaboration contexts and its changes then enables the collaboration system to adapt to these changes and be more flexible. A dynamic workflow process is also facilitated by the context-awareness.
The Planetary Simulator for Generalized Understanding of Astronomical Phenomena from Various Viewpoints
Authors: Masato Soga, Yasunori Nakanishi, Kohe Tokoi
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

We developed the planetary simulator that is able to simulate astronomical phenomena in the solar system. The planetary simulator can set not only target planet but also the planet of viewpoint. It can simulate planets' revolutions around the sun fixing viewpoint on another planet. Therefore it can help generalized understanding of wax and wane of inner planets. The planetary simulator also supports viewpoint guiding function for self-learning. Moreover, the planetary simulator shows a small dynamic guide map that shows current learner's viewpoint, target and scope. Finally, We developed the function by which a learner can perform the virtual experiment in the simulator to understand Kepler's laws of planets' revolutions.
Nature Inspired Intelligence for the Constrained Portfolio Optimization Problem
Authors: Vassilios Vassiliadis, Georgios Dounias
Venue: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications (2008)

In this paper, we apply a basic Bee Colony Optimization algorithm in order to find a high-quality solution for the constrained portfolio optimization problem. Moreover, we use a basic Ant Colony Optimization algorithm and a Tabu Search metaheuristic approach as a benchmark. Our findings indicate that nature-inspired methodologies are able to find feasible solutions for dynamic optimization problems in a reasonable amount of time in contrast with the simple tabu search.