ppxscal/embedding_network huggingface dataset:
A New Nonlinear Dimensionality Reduction Technique for Pose and Lighting Invariant Face Recognition
Authors: Ming-Jung Seow, Richard Cortland Tompkins, Vijayan K. Asari
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

One of the goals of biometrics research is to develop new techniques and/or algorithms for the automatic recognition of humans. In this paper, we propose the concept of a manifold of facial perception based on the observation that a perceived face in a set of similar face images-subjected to variations in pose, illumination and expression-defines a manifold in the high dimensional space. Such a manifold representation can be learned from images in a database of similar facial feature characteristics. This learned manifold can then be used as a basis for facial recognition. Development of a mathematical model for a nonlinear line attractor that represents a pattern manifold in the feature space is presented in this paper. The non-convex pattern manifolds in the feature space may be extremely complex and difficult to model. Therefore an adaptive divide and conquer modular approach which divides complex manifolds into smaller sub-manifolds in the feature space is also proposed for accurate modeling of the nonlinear line of attraction. A nonlinear dimensionality reduction technique using the learned matrices of the nonlinear line attractor network is then used to embed a set of related observations into a low-dimensional space that preserves the intrinsic dimensionality and metric structure of the data for fast and accurate face recognition. Results based on the proposed work from the first experiment of the FRGC version 2 database have shown promising performance in improving the accuracy in the face recognition.
Unsupervised, Information-Theoretic, Adaptive Image Filtering for Image Restoration
Authors: Suyash P. Awate, Ross T. Whitaker
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

Image restoration is an important and widely studied problem in computer vision and image processing. Various image filtering strategies have been effective, but invariably make strong assumptions about the properties of the signal and/or degradation. Hence, these methods lack the generality to be easily applied to new applications or diverse image collections. This paper describes a novel unsupervised, information-theoretic, adaptive filter (UINTA) that improves the predictability of pixel intensities from their neighborhoods by decreasing their joint entropy. In this way, UINTA automatically discovers the statistical properties of the signal and can thereby restore a wide spectrum of images. The paper describes the formulation to minimize the joint entropy measure and presents several important practical considerations in estimating neighborhood statistics. It presents a series of results on both real and synthetic data along with comparisons with current state-of-the-art techniques, including novel applications to medical image processing.
Simulation of networks using multidimensional Fast Fourier Transforms
Authors: Andrew G. Barto
Venue: ACM SIGSIM Simulation Digest (1974)

A fast method is presented for simulating a class of systems that includes certain regular neural networks based on neurons that perform a weighted spatial summation as a part of their operation. The method employs high-speed convolution via the Fast Fourier Transform. Some important aspects are emphasized: first, even though the FFT is essential, the neurons do not need to be completely linear (they can have time varying thresholds for example); second, simulations of networks with very dense interconnections are encouraged (they take no more time then sparse ones using this method); and finally, the method is suggestive of similar but more general computational schemes.
LTCP: improving the performance of TCP in highspeed networks
Authors: Sumitha Bhandarkar, Saurabh Jain, A. L. Narasimha Reddy
Venue: ACM SIGCOMM Computer Communication Review (2006)

In this paper, we propose Layered TCP (LTCP for short), a set of simple modifications to the congestion window response of TCP to make it more scalable in highspeed networks. LTCP modifies the TCP flow to behave as a collection of virtual flows to achieve more efficient bandwidth probing. The number of virtual flows emulated is determined based on the dynamic network conditions by using the concept of virtual layers, such that the convergence properties and RTT-unfairness behavior is maintained similar to that of TCP. In this paper, we provide the intuition and the design for the LTCP protocol modifications and evaluation results based on ns-2 simulations and Linux implementation. Our results show that LTCP has promising convergence properties, is about an order of magnitude faster than TCP in utilizing high bandwidth links, employs few parameters and retains AIMD characteristics
Password authenticated key exchange using hidden smooth subgroups
Authors: Craig Gentry, Philip Mackenzie, Zulfikar Ramzan
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

Existing techniques for designing efficient password authenticated key exchange (PAKE) protocols all can be viewed as variations of a small number of fundamental paradigms, and all are based on either the Diffie-Hellman or RSA assumptions. In this paper we propose a new technique for the design of PAKE protocols that does not fall into any of those paradigms, and which is based on a different assumption. In our technique, the server uses the password to construct a multiplicative group with a (hidden) smooth order subgroup, where the group order depends on the password. The client uses its knowledge of the password to generate a root extraction problem instance in the server's group and a discrete logarithm problem instance in the (smooth order) subgroup. If the server constructed its group correctly based on the password, the server can use its knowledge of the group order to solve the root extraction problem, and can solve the discrete logarithm problem by leveraging the smoothness of the hidden subgroup.The resulting scheme is provably secure (in the random oracle model) under the "decision subgroup assumption." The scheme can be efficiently instantiated using composite modulus groups, in which case the client and server each perform the equivalent of a small number of modular exponentiations, and the security reduces to a simple variant of the "Φ-hiding" assumption. We provide preliminary implementation results of this instantiation.
Augmented Tabletops, an Incentive for Distributed Collaboration
Authors: Romain Perron, Francois Laborie
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

Global distribution of design teams is a reality for all major industries. This new organization challenges the traditional strong collaborative practices of designers. The meeting spaces must support a variety of intermediary objects that make the traditional tools, such as whiteboards, inappropriate, especially for distributed teams, and call for more relevant artifacts. Based on a distributed learning project we investigated the use of augmented tabletops as practical surfaces to share information during distributed design working sessions. In this empirical study, we describe the specifications and functionalities of the AugmenTables prototypes designed by the student teams. This paper then evaluates the technical and social impact of augmented tabletops during virtual meetings and especially informal design reviews
From Live Sequence Charts to State Machines and Back: A Guided Tour
Authors: Yves Bontemps Patrick Heymans Pierre-Yves Schobbens
Venue: IEEE Transactions on Software Engineering (2005)

The problem of relating state-based intraagent (or intraobject) behavioral descriptions with scenario-based interagent (interobject) descriptions has recently focused much interest among the software engineering community. This paper compiles the results of our investigation of this problem. As interagent formalism, we adopt a simple variant of Live Sequence Charts. For the intraagent perspective, we consider a game-theoretic foundation, looking at agents as "strategies,” which encompasses the popular "state-based” paradigm. Three classes of relationships between models are studied: scenario checking (called eLSC checking), synthesis, and verification. We set a formally defined theoretical stage that allows us to express these three problems very simply, to discuss their complexity, and to describe optimal solutions. Our study reveals the intrinsic high computational difficulty of these tasks. Consequently, many related problems and solutions are surveyed, some of which can be the basis for practical solutions. In this, we also offer a panorama of current research and directions for the future.
Integrating Expressiveness of Modern Requirements Modeling Approaches
Authors: Elena Navarro, Patricio Letelier, Isidro Ramos
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Currently, Uses Cases are the most widely accepted notation despite their restricted expressiveness and overloaded semantic. Other more sophisticated modeling techniques have been developed independently of any other ones and/or for specific application domains. These techniques often provide broad expressiveness but do not include any scalability or any integration with other approaches. In this work, we present a proposal for requirements modeling that allows the integration of the expressiveness of some of the most relevant approaches in the Requirements Engineering arena. By focusing on the scalability with respect to expressiveness and adaptability to the application domain, we have established some basic guidelines and extension mechanisms that give coherence and semantic precision to our approach.
A Fuzzy Approach to Modeling the Knowledge of Decision-Makers
Authors: Amir Danak, Farzad Rastegar, Ashkan Rahimi Kian
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

A game is a decision-making situation in which each player attempts to act in such a way that the game's circumstances get close to what desirable for him. To reach this goal, a player needs to have a suitable estimation of the other players' decisions. In this paper we propose a fuzzy approach by which a player can attain an estimation of the other players' actions and pursue a strategy which maximizes its performance. Finally, the results of applying the proposed approach to the well-known "prisoner's dilemma" problem are brought to show the effectiveness of the method.
Using Data Mining Techniques to Learn Layouts of Flat-File Biological Datasets
Authors: Kaushik Sinha, Xuan Zhang, Ruoming Jin, Gagan Agrawal
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

One of the major problems in biological data integration is that many data sources are stored as flat-files, with a variety of different layouts. Integrating data from such sources can be an extremely time-consuming task. We have been developing data mining techniques to help learn the layout of a dataset in a semi-automatic way. In this paper, we focus on the problem of identifying delimiters for optional fields. Since these fields do not occur in every record, frequency based methods are not able to identify the corresponding delimiters. We present a method which uses contrast analysis on the frequency of sequences to identify such delimiters and help complete the layout descriptions. We demonstrate the effectiveness of this technique using three flat-file biological datasets.
Disclosive Ethics and Information Technology: Disclosing Facial Recognition Systems
Authors: Lucas D. Introna
Venue: Ethics and Information Technology (2005)

This paper is an attempt to present disclosive ethics as a framework for computer and information ethics --- in line with the suggestions by Brey, but also in quite a different manner. The potential of such an approach is demonstrated through a disclosive analysis of facial recognition systems. The paper argues that the politics of information technology is a particularly powerful politics since information technology is an opaque technology --- i.e. relatively closed to scrutiny. It presents the design of technology as a process of closure in which design and use decisions become black-boxed and progressively enclosed in increasingly complex socio-technical networks. It further argues for a disclosive ethics that aims to disclose the nondisclosure of politics by claiming a place for ethics in every actual operation of power --- as manifested in actual design and use decisions and practices. It also proposes that disclosive ethics would aim to trace and disclose the intentional and emerging enclosure of politics from the very minute technical detail through to social practices and complex social-technical networks. The paper then proceeds to do a disclosive analysis of facial recognition systems. This analysis discloses that seemingly trivial biases in recognition rates of FRSs can emerge as very significant political acts when these systems become used in practice.
Second-order Cone Programming Methods for Total Variation-Based Image Restoration
Authors: Donald Goldfarb, Wotao Yin
Venue: SIAM Journal on Scientific Computing (2005)

In this paper we present optimization algorithms for image restoration based on the total variation (TV) minimization framework of Rudin, Osher, and Fatemi (ROF). Our approach formulates TV minimization as a second-order cone program which is then solved by interior-point algorithms that are efficient both in practice (using nested dissection and domain decomposition) and in theory (i.e., they obtain solutions in polynomial time). In addition to the original ROF minimization model, we show how to apply our approach to other TV models, including ones that are not solvable by PDE-based methods. Numerical results on a varied set of images are presented to illustrate the effectiveness of our approach.
Implications of the ADA&reg; environment for simulation studies
Authors: Patricia Friel, Sallie Sheppard
Venue: ACM SIGSIM Simulation Digest (1985)

Ada packages to support event and process oriented simulation have been developed at Texas A&M University. These packages include standard Facilities such as queue handling, random number generation, automatic statistics collection and simulation control. This paper provides an overview of the system facilities followed by an evaluation of the strengths and weaknesses of Ada as an implementation language for simulation software. Based on our experience Ada has appeal as a general purpose language which can be integrated into larger systems. It is portable among various computer architectures, it provides a rich base of constructs in which to implement models, and offers promise in terms of execution on parallel architectures.
A Service Workflow Management Framework Based on Peer-to-Peer and Agent Technologies
Authors: Jun Yan, Yun Yang, Ryszard Kowalczyk, Xuan T. Nguyen
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Service workflow management which consolidates multiple services to achieve business goals has become a critical issue in service-oriented computing. Due to the unique feature of service workflows such as full distribution and high dynamicity, the contemporary workflow technology has exhibited inefficiency, vulnerability, inflexibility and lack of adaptability. Based upon the authors' previous work on peer-to-peer based workflow management and seamless integration of agents and Web services, this paper innovatively presents SwinDeW-A which is a decentralised service workflow management framework based on peer-to-peer and agent technologies. Based on this framework, this paper also discusses how autonomous service level agreement negotiation, decentralised process enactment, and autonomous process adaptation can be achieved. The proposed approach takes advantages of the peer-to-peer computing technology and the agent technology to provide more efficient, reliable, flexible and adaptive service workflow management.
Performance Analysis of Scalable Certificate Revocation Schemes for Ad Hoc Networks
Authors: Stephan Eichler, Bernd Muller-Rathgeber
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Certificate revocation is a challenging task, especially in mobile network environments. Several different revocation approaches have been proposed in the literature. However, no performance evaluation and usability studies exist for mobile network environments like ad hoc networks. In this paper a comparison of two different certificate revocation schemes used in the context of ad hoc network scenarios is presented. First the state of the art in certificate revocation is presented and a motivation for its use in the context of ad hoc environments is given. A quick introduction in the theoretical background and overhead calculation of revocation approaches is presented. Further, our two revocation protocols are introduced and simulation results presented. The paper closes with an evaluation and a discussion of the results and gives an outlook on future work.
A Rotation-Based Quasi-Orthogonal Space-Time Block Coded OFDM System over Frequency-Selective Channels
Authors: Xiaofeng Lu, Guangxi Zhu, Yingzhuang Liu, Xiao Xiao
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In this paper, we apply Quasi-Orthogonal Space - Time Block Code through Constellation rotation (QOSTBC_CR) in OFDM system, construct the QOSTBC_CR-OFDM code and propose the decoder. Since OFDM can combat frequency-selective channels and the QOSTBC_CR have both full rate and full diversity, the QOSTBC_CR-OFDM performs effectively in frequency-selective channels. Simulation results show that QOSTBC_CR-OFDM achieves better tradeoff between transmission rate and diversity gain. This approves the theoretical analysis.
Open HW, Open Design SW, and the VC Ecosystem Dilemma
Authors: Juan-Antonio Carballo
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

The open model for solutions development is quickly extending from software to other technology areas, such as hardware and services. Specifically, just as open source has spawned a revolution in the technical, business, and legal model for software, open hardware will provide a swell of collaborative innovation that will create entirely new markets and provide significant business benefits to the most creative, most reliable, and most adaptable semiconductor, EDA, System-On-Chip (SoC) and systems houses. The open-source software stack with Linux as its cornerstone is increasingly the preferred choice for newly venture-funded companies. Open hardware will also change the world of SoC venture investing. While the degree of openness and the business model may vary, SoC products have to be increasingly developed through a collaborative model that helps assemble IP blocks and services from multiple sources. In this paper we describe the open standards model for hardware, chip, and tool innovation, and we argue the a systematic IP valuation methodology will help the success of this environment, in that it will allow each member of the value chain ¿ especially small VC-backed companies - to capture enough value to desire to participate.
Infrared properties of ultrathin oxides on Si(100)
Authors: Feliciano Giustino, Alfredo Pasquarello
Venue: Microelectronic Engineering (2005)

We study the infrared absorption spectra of ultrathin SiO2 films on Si(100) using a first-principles approach, and adopting a model Si(100)-SiO2 interface with a realistic transition structure. We calculate both the transverse-optical and the longitudinal-optical infrared absorption spectra across the interface, and show that the red shift of the high-frequency peaks observed experimentally with decreasing oxide thickness originates from the softer vibrational frequencies of the substoichiometric interfacial layer. From the calculated infrared properties, we are able to assess the effect of the frequency softening on the corresponding static permittivity.
News Briefs
Authors: Heather Drinan, Nancy Fontaine, Brent Kesler
Venue: IEEE Security and Privacy (2005)

News items related to security, privacy, and policy.
Tastes like...
Authors: Miha Ciglar
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

"Tastes Like..." (a composition for two monitors, mixing board and human body) is an interactive audiovisual work implemented without computers and common sound/picture - synthesis/processing techniques but exclusively with low-tech analogue equipment. Basically it can be perceived as a new instrument, representing a product of creative misuse and combination of objects mentioned in the subtitle. The monitors, mixing board and the player's body are connected in a specific constellation, which causes an audiovisual feedback, activated only through the presence of the artist and controlled by the location of his body inside the two dimensional, electrodynamic field, created by the two right angle positioned monitors.
A unified shot boundary detection framework based on graph partition model
Authors: Jinhui Yuan, Jianmin Li, Fuzong Lin, Bo Zhang
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we propose a unified shot boundary detection framework by extending the previous work of graph partition model with temporal constraints. To detect both the abrupt transitions (CUTs) and gradual transitions (GTs, excluding fade out/in) in a unified way, we incorporate temporal multi-resolution analysis into the model. Furthermore, instead of ad-hoc thresholding scheme, we construct a novel kind of feature to characterize shot transitions and employ support vector machine (SVM) with active leaning strategy to classify boundaries and non-boundaries. Extensive experiments have been carried out on the platform of TRECVID benchmark. The experimental results show that the proposed framework outperforms some others and achieves satisfactory results.
Self-Orthogonal 3-(56,12,65) Designs and Extremal Doubly-Even Self-Dual Codes of Length 56
Authors: Masaaki Harada
Venue: Designs, Codes and Cryptography (2006)

In this paper, we show that the code generated by the rows of a block-point incidence matrix of a self-orthogonal 3-(56,12,65) design is a doubly-even self-dual code of length 56. As a consequence, it is shown that an extremal doubly-even self-dual code of length 56 is generated by the codewords of minimum weight. We also demonstrate that there are more than one thousand inequivalent extremal doubly-even self-dual [56,28,12] codes. This result shows that there are more than one thousand non-isomorphic self-orthogonal 3-(56,12,65) designs.