ppxscal/embedding_network huggingface dataset:
A Proposal of COMPASS (COMmunity Portrait Authentication SyStem)
Authors: Kanako Yokota, Tatsuhiro Yonekura
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

Recently, various types of personal authentication methods have been studied to confirm a persons' identity in the on-line system. However, the alphanumeric characters and authentication methods based on passwords and PINs (knowledge-factor authenticators) hold severe problems, and still must rely on the limitation of human's capacity of recollection. Recently, "graphical password", using visual information for authentication methods that utilize photographic image for authentication, has been proposed. However this method holds some problem on security. In this paper, we propose "COMPASS" (COMmunity Portrait Authentication SyStem) that uses a portrait as the authentication image, to solve the issues of the previous graphical passwords. Moreover, COMPASS has the idea of the "community authentication" that a member of a certain community consisting of a party of human can be authenticated. The validity of the proposed method is confirmed by a set of subject experiments.
Distributed Simulation Modeling for Manufacturing Systems Design Using XML
Authors: Rawinkhan Srinon, Sreeram Ramakrishnan
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Discrete event simulations have been used to model manufacturing systems. Various decomposition methods such as distributed simulations have been employed for this modeling. In the context of distributed simulations, each federate must be able to share the embedded logic with the other federates, irrespective of the software used to design and build such systems. This paper provides an eXtensible Markup Language (XML)-based representation for distributed models that can be shared across the federation of simulations. Specifically, the paper outlines three different model components that forms the basis of a design framework for distributed simulation models — object model (for simulation constructs), logic model (represents information flow within a model and its interactions) and the connectivity model (represents the links among the simulation constructs) .
Practical knowledge management tool use in a software consulting company
Authors: Torgeir Dingsøyr, Hans Karim Djarraya, Emil Røyrvik
Venue: Communications of the ACM (2005)

Assessing the contribution of a technical skills management tool for supporting organizational learning.
Theory on Switch Preservation under 2-stage Interconnection
Authors: Shuo-Yen Robert Li, Xuesong Tan
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

The most compact pattern for interconnecting small switches into a large switch is conceivably the 2-stage interconnection network. A certain version of a 2-stage interconnection network is said to preserve switches with a certain attribute when the network constructs such a switch from smaller ones at nodes. Recursive application of this version of 2-stage interconnection then leads to the construction of indefinitely large switches with the same attribute. The present paper studies a few new classes of switches that are preserved under 2-stage interconnection and also identifies their applications. Different switch preservation theorems presented in the paper offer the advantages of both the algorithmic flexibility and the theoretic insight.
A decision-theoretic framework for the evaluation of language models used in speech recognizers
Authors: J. R. Deller,  JR., K. H. Desai, Y. P. Yang
Venue: Natural Language Engineering (2005)

An analytical method for design and performance analysis of language models (LM) is described, and an example interactive software tool based on the technique is demonstrated. The LM performance analysis does not require on-line simulation or experimentation with the recognition system in which the LM is to employed. By exploiting parallels with signal detection theory, a profile of the LM as a function of the design parameters is given in a set of curves analogous to a receiver-operating-characteristic display.
A New Scheme for Interconnecting LANs with Label Switching Bridges
Authors: Thierry K. Feuzeu, Bernard Cousin
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Ethernet, which has traditionally been the dominant technology in Local Area Networks, is now facing new challenges due to the fact that networks have scaled and today's applications require more bandwidth and increased robustness against failures. The limitations of Ethernet are mainly imposed by the Spanning Tree Protocol, which is necessary to prevent loops and provide redundancy in a switched network. The successful deployment of Ethernet over MPLS in the metro area have proved that Ethernet LANs can be further enriched with the services enabled by the label switching technique. In this article, we propose a new LAN interconnection technique based on label switching, which enhances network services, simplifies switch functionalities, while remaining flexible enough to be easily deployed in most LAN environments.
Regular expressions: new results and open problems
Authors: Keith Ellul, Bryan Krawetz, Jeffrey Shallit, Ming-wei Wang
Venue: Journal of Automata, Languages and Combinatorics (2004)

Regular expressions have been studied for nearly 50 years, yet many intriguing problems about their descriptive capabilities remain open. In this paper we sketch some new results and discuss what remains to be solved.
Extended-DDF Modeling Embedded System Design: Adapting to IP Technology
Authors: Yi Jiao, Chenglin Guo, Baifeng Wu, Hui Luo
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This paper extends DDF (Dynamic Date Flow graph) to a large-grain model which can guide system design in function level. The adoption of a novel algorithm, as well as a formal definition for cDDF, strengthens the capacity of DDF as a formal specification model. Starting from a lower level of abstraction, it merges sub-modules into a larger one by extracting the Input/Output relations. The extracted I/O relations, together with the new module's functional description, could serve as IP core selection criteria in design space exploration. Normal DDF merely decomposes compound node into simpler ones. The algorithm presented in this paper provides a reverse process which exploits the hierarchical characteristic of DDF by capturing both data and control flow in different level of abstraction. The important steps in design work, such as function partition, scheduling, optimization, etc., are also reconsidered synthetically to adapt the introduction of the new idea.
A Comparative Experimental Analysis of Separate and Combined Facial Features for GA-ANN Based Technique
Authors: Xiaolong Fan, Brijesh Verma
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

This paper investigates a feature selection and classification technique for face recognition using genetic algorithms and artificial neural networks. The experiments using separate facial features and combined facial features have been conducted on a face image dataset which is extracted from FERET benchmark database and was used in our previous study. The experiments using just combined features have also been conducted on an extended version of this dataset. The new experiments have achieved much better recognition rate than some of the existing face recognition techniques and significantly improved our previously published results. A detailed comparative analysis of experimental results is included in this paper.
Shape optimizing diffeomorphisms for medical image analysis
Authors: Brian B. Avants
Venue:  (2005)

An important question, historically, is how structure and function relate. The field of medical image analysis addresses this question by using imaging devices such MRI or CT to gain in vivo structural and functional measurements. Statistical analysis of the data requires smoothly mapping the images of an individual into a common (or atlas) coordinate system. Novel mathematics and principles for this mapping process (labeled Diffeomorphometry) are the subject of this dissertation. Diffeomorphometry is a rigorous mathematical framework for statistical analysis of shape and shape coordinate systems derived from images. Diffeomorphometry is characterized by computing diffeomorphisms and their inverses in the Lagrangian frame, representing diffeomorphisms by their initial conditions, and combining initial conditions to evaluate the statistics and neighborhood relationships of shapes. This approach addresses many of the basic issues in image registration, including how to generate geodesics and geodesic distances between shape objects, how to represent shape and topology differences, how to register images symmetrically and how to define unbiased coordinate systems for medical or pharmacological studies. These general techniques are useful in a wide array of image processing applications. We apply these techniques to analyze atrophy as it correlates with cognitive decline in frontotemporal dementia, to reverse engineer the evolution between chimpanzee and human cortex and to fuse histological data with MRI. Other applications include matching dynamic series of pulmonary data.
Classification of smoking cessation status with machine learning methods
Authors: Mollie Poynton
Venue:  (2005)

This study examined the ability of a backpropagation neural network (BPNN) classifier to distinguish between current and former smokers in the 2000 National Health Interview Survey (NHIS) sample adult file. Pre-processing and automated attribute subset selection aided in reduction of the search space, or number of possible solutions. A multilayer artificial neural network was constructed and trained to predict class membership, current or former smoker, using inputs from the attribute subset. Classifier performance exceeded that of random chance, with Az asymmetric 95% confidence intervals (0.7532, 0.7790). However, separation of current and former smokers was imperfect, as illustrated by the ROC (receiver operating characteristic) curve. Additionally, performance did not exceed that of a comparison classifier created using logistic regression. These findings indicate that imprecise, but high quality health survey data provided sufficient information for prediction of smoking cessation status. Membership of specific survey items in the attribute subset was largely supported by the literature. However, the inability to interpret relationships among attribute values in the BPNN model hampers comparison with published literature. The study establishes the ability of a machine learning method, backpropagation neural networks, to classify a health-related behavior, smoking cessation.
Experiences from Implementing Multiprocessor Support for an Industrial Operating System Kernel
Authors: Simon Kagstrom, Hakan Grahn, Lars Lundberg
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

The ongoing transition from uniprocessor to multiprocessor computers requires operating system support. There is a large body of specialized operating systems which require porting in order to work on multiprocessors. In this paper we describe the design and implementation of a multiprocessor port of a cluster operating system kernel. The multiprocessor support is implemented with a giant locking scheme, which allowed us to get an initial working version with only minor changes to the original code. We also discuss performance and implementation experiences.
Formal specification of multi-agent e-barter systems
Authors: Manuel Núñez, Ismael Rodríguez, Fernando Rubio
Venue: Science of Computer Programming (2005)

An e-barter multi-agent system consists of a set of agents that exchange goods. These agents may perform multilateral exchanges involving several goods. In particular, money can be one of these goods. Each agent is endowed with a utility function indicating the preferences of the respective user. In order to improve the performance, these barter systems are structured in a hierarchical form. Initially agents are grouped, according to localities, into local markets. Once a local market gets completed, that is, no more exchanges are possible, the local market itself becomes a new agent. The preferences of this agent, given by a new utility function, represent the individual preferences of its former customer agents. Then, local markets exchange goods in a higher order market until it gets completed. The process is iterated, in a bottom-up fashion, until the global market embracing all the agents in the system gets completed as well.We provide a formal language, based on classical process algebras, for specifying and analyzing e-barter systems. We also study properties of e-barter systems represented in our notation. In particular, we show that the final distribution of goods in a hierarchical e-barter system is a Pareto optimum. In other words, we will be able to prove that economic efficiency is not lost by considering our hierarchical structure instead of a single market.
A documentation format for fortran programs
Authors: Gordon D. D. Jackson
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

This article reports one aspect of work I performed (1) while undertaking research for a PhD at Imperial College, University of London.
3D Site Modelling and Verification of Plant Design for Nuclear Security Applications
Authors: V. Sequeira, G. Bostrom, M. Fiocco, D. Puig, J. G. M. Goncalves
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

It is important in Nuclear Security to detect changes made in a given installation or track the progression of the construction work in a new plant. This paper describes a system accepting multi-sensory, variable scale data as input. Scalability allows for different acquisition systems and algorithms according to the size of the objects/buildings/sites to be modelled. Semi-automated tools support the comparison between the acquired "as-built" and the approved design models. The paper presents examples of the use in indoor and outdoor environments. It shows that it is possible in any time to redo a data acquisition from the same area without any assumptions of exact position, orientation or used scanner. Based on this new information it is possible to detect centimetre changes in the scene.
Impact of incentive mechanisms on quality of experience
Authors: Andrew Roczniak, Abdulmotaleb El Saddik
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Since entities participating in P2P networks are usually autonomous and therefore free to decide on their level of participation, mechanisms to resolve conflicts between individual and collective rationality are needed. How can implementations of such mechanisms be compared? This paper introduces a qualitative reference framework, highlighting essential elements and major design decisions in any implementation of incentive mechanisms. In the context of multimedia applications built on top of P2P architectures, the reference framework can be used in assessing the impact on the quality of experience (QoE) when incentive mechanisms are included.
Efficient Non-interactive Deniable Authentication Protocols
Authors: Haifeng Qian, Zhenfu Cao, Lichen Wang, Qingshui Xue
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Deniable authentication protocol is an authentication protocol that allows a sender to authenticate a message for a receiver, in a way that the receiver cannot convince a third party that such authentication ever took place. In recent years, due to the popularity of Internet and its special property, many deniable authentication protocols have been proposed. However, most of these proposed schemes are interactive and less efficient. To our knowledge, Shao has proposed an efficient non-interactive deniable authentication protocol based on generalized ElGamal signature scheme without security proof. Lu et al have proposed a deniable authentication also, however, the protocol suffers from the receiver's attack who once interacts with the sender. For the reason above, we would like to propose a generic method to construct efficient non-interactive deniable authentication protocols from any trapdoor permutations. Using RSA trapdoor permutations we introduce a new digital signature with tight security and use it to construct a concrete deniable authentication protocol. Concentrated on security problem we prove the protocol secure in random oracle. We also believe that the protocol is much efficient and practical in application with non-interactive property.
Logical Labeling of Arabic Newspapers using Artificial Neural Nets
Authors: Karim Hadjar, Rolf Ingold
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Logical structure analysis is an important phase in the process of document image understanding. In this paper we propose a learning-based method to label logical components on Arabic newspaper documents. The labeling is driven by artificial neural nets. Each one is specialized in a document class. The first prototype of LUNET has been tested on a set of Arabic newspapers of three document classes. Some promising experimental results are reported.
A multivariate empirical characteristic function test of independence with normal marginals
Authors: M. Bilodeau, P. Lafaye de Micheaux
Venue: Journal of Multivariate Analysis (2005)

This paper proposes a semi-parametric test of independence (or serial independence) between marginal vectors each of which is normally distributed but without assuming the joint normality of these marginal vectors. The test statistic is a Cramer-von Mises functional of a process defined from the empirical characteristic function. This process is defined similarly as the process of Ghoudi et al. [J. Multivariate Anal. 79 (2001) 191] built from the empirical distribution function and used to test for independence between univariate marginal variables. The test statistic can be represented as a V-statistic. It is consistent to detect any form of dependence. The weak convergence of the process is derived. The asymptotic distribution of the Cramer-von Mises functionals is approximated by the Cornish-Fisher expansion using a recursive formula for cumulants and inversion of the characteristic function with numerical evaluation of the eigenvalues. The test statistic is finally compared with Wilks statistic for testing the parametric hypothesis of independence in the one-way MANOVA model with random effects.
Mobility Support in Private Networks Using RPX
Authors: Sanchai Rattananon, Bjorn Landfeldt, Aruna Seneviratne, Prawit Chumchu
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

The limited IPv4 address space has driven the cellular industly to start using IPv6 addresses for mobile users in 3G-networks. However, there is a potential threat to the success of 3G-network deployment, as the success will depend on the services offering to the end users. Currently, the overwhelming proportion of services resides in the IPv4 address space, which makes them inaccessible to users in the IPv6 address space. Thus, users cannot directly communicate with and access services without an intermediate translation mechanism. Previous studies on network address translation methods have shown that REBEMH-IP with Port Extension, RPX is promising in that it provides excellent theoretical maximum scalability while supporting all types of services without limitations for the users in the network. However, the initial RPX proposal does not support host mobility to different networks, despite the fact that mobility is the most important feature of a wireless communication system. In this paper, we propose to extend the RPX scheme with a mobility support scheme based on Mobile IP. RPX allows more than one host to use a single IPv4 address and therefore we have augmented Mobile IP with a new tunneling mechanism called IP-in-FQDN tunneling. The mechanism allows for unique mapping despite the sharing of IP addresses while maintaining the scalability of RPX. In addition, we present simulation results that indicate that the proposed scheme pe$orms well in terms of scalability, connection request delay and packet transmission delay compared to Mobile IP.
ScriptGen: an automated script generation tool for honeyd
Authors: Corrado Leita, Ken Mermoud, Marc Dacier
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

Honeyd [14] is a popular tool developed by Niels Provos that offers a simple way to emulate services offered by severalmachines on a single PC. It is a so called low interaction honeypot. Responses to incoming requests are generated thanks to ad-hoc scripts that need to be written by hand. As a result, few scripts exist, especially for services handling proprietary protocols. In this paper, we propose a method to alleviate these problems by automatically generating new scripts. We explain the method and describe its limitations. We analyze the quality of the generated scripts thanks to two different methods. On the one hand, we have launched known attacks against a machine running our scripts; on the other hand, we have deployed that machine on the Internet, next to a high interaction honeypot during two months. For those attackers that have targeted both machines, we can verify if our scripts have, or not, been able to fool them. We also discuss the various tuning parameters of the algorithm that can be set to either increase the quality of the script or, at the contrary, to reduce its complexity.
Hand Geometry: A New Approach for Feature Extraction
Authors: Guilherme Boreki, Alessandro Zimmer
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

This work presents a complete control access system based on the hand geometry, a hardware key and a vital sign detector. The circuitry reads the hardware key and the heartbeat in order to confirm the identity of the author given by the analysis of the hand image. The presented system distinguish itself from other similar biometric systems mainly because of the feature extraction process which is based on the analysis of the curvature profile of the image, making the system invariant to the rotation and translation of the hand. This makes unnecessary the use of any kind of restriction devices such as pins or pegs to position the hand. FAR rates as low as 0.8% were obtained by the use of simple weighted geometric features on a database of more than 360 hand images.
A Web Services Provisioning Optimization Model in a Web Services Community
Authors: Zongwei Luo, Jenny S. Li
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

In this paper, we propose a service provisioning optimization model in a Web services community. Requirements of the service provisioning and provisioning capabilities of the Web services community are discussed. The service community supports various types of IT resource management networks, i.e. participant network, service network, and resource network. These networks help to build on demand solutions with service provisioning capabilities in the Web services community. We propose to use the Markov Decision Process to model the service community participants' behavioral strategies for obtaining optimal service provisioning decisions.