ppxscal/embedding_network huggingface dataset:
Real-time update of eye features on the 3D head model texture: Research Articles
Authors: Patricio Inostroza
Venue: Computer Animation and Virtual Worlds (2005)

In this paper, a real-time tracking&#x002F;synthesis loop is proposed to animate the eye texture of a 3D head model using a video camera. The user's eyes, captured by a video camera, are tracked by means of a frame-rate pupil detector technique, based on an active illumination scheme. A small area of interest is selected around each pupil detected in the video. These areas contain the eye and eyebrow features. Substituting the captured areas on the texture of the 3D model, animation of the eyes and eyebrows is created. To avoid the &lsquo;collage&rsquo; effect, the extracted areas are colour-corrected, stretched and blended with the texture. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Haptically Driven Travelling through Conformational Space
Authors: Igor Peterlik, Ales Krenek
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

After reviewing our generic framework of building haptic interactive models of environments which are computationally very expensive, we describe its deployment in modelling conformational behaviour of flexible molecules. We conclude with description of first practical results which prove correctness of our approach, and shift the whole research towards more realistic applications.
Stability for time varying linear dynamic systems on time scales
Authors: Jeffrey J. DaCunha
Venue: Journal of Computational and Applied Mathematics (2005)

We study conditions under which the solutions of a time varying linear dynamic system of the form xΔ(t)=A(t)x(t) are stable on certain time scales. We give sufficient conditions for various types of stability, including Lyapunov-type stability criteria and eigenvalue conditions on "slowly varying" systems that ensure exponential stability. Finally, perturbations of the unforced system are investigated, and an instability criterion is also developed.
PACT: Personal Autonomic Computing Tools
Authors: Roy Sterritt, Barry Smyth, Martin Bradley
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Personal Computing offers unique challenges for self-management due to its multi-equipment, multi-situation, and multi-user nature. The aim of this research is to improve the autonomicity within personal computing; the evolution towards Personal Autonomic Computing. In this paper proof of concept self-managing tools are presented and lessons learned derived. At this stage of the autonomic evolution the need of new software development processes to provide the self-* properties is becoming very evident.
Pseudo-Stereo Vision System: A Detailed Study
Authors: Theodore P. Pachidis, John N. Lygouras
Venue: Journal of Intelligent and Robotic Systems (2005)

In this paper, a new stereovision system based on mirrors is presented. It is composed of three mirrors, a beam-splitter and a camera. It is called Pseudo-Stereo Vision System (PSVS) and can be used in real time applications. Two parallel virtual cameras are created with the geometric properties and parameters of the real camera. PSVS captures, in one shot, a complex image, created by the superposition of the left and right views of the system. The apparatus has no moving parts, low cost and double resolution compared with other monocular systems based on mirrors. It can be constructed in any dimension covering any type of camera, length of baseline and accuracy of depth measurements. The design and construction details of the system as well as the appearing refraction phenomena to the apparatus are analytically presented. Analytical expressions are derived for the calculation of mirrors dimensions, minimum common view distance and minimum length of baseline. Mirrors alignment method is also described. Equations providing the Cartesian coordinates of a point in space, taking into consideration refraction phenomena to beam-splitter and camera calibration parameters, are proved. Two new methods for the separation of complex images to pairs of left and right images using gray scale or color cameras are explained and the first real experimental results are illustrated. Finally, experimental results, where the PSVS is mounted on the end effector of a PUMA 761 robotic manipulator are presented.
Extending Relational Database Systems to Automatically Enforce Privacy Policies
Authors: Rakesh Agrawal, Paul Bird, Tyrone Grandison, Jerry Kiernan, Scott Logan, Walid Rjaibi
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Databases are at the core of successful businesses. Due to the voluminous stores of personal data being held by companies today, preserving privacy has become a crucial requirement for operating a business. This paper proposes how current relational database management systems can be transformed into their privacy-preserving equivalents. Specifically, we present language constructs and implementation design for fine-grained access control to achieve this goal.
A 4 Mb high resolution BAC contig on bovine chromosome 1q12 and comparative analysis with human chromosome 21q22: Short Communications
Authors: Cord Drögemüller, Anne Wöhlke, Tosso Leeb, Ottmar Distl
Venue: Comparative and Functional Genomics (2005)

The bovine RPCI-42 BAC library was screened to construct a sequence-ready &sim;4 Mb single contig of 92 BAC clones on BTA 1q12. The contig covers the region between the genes KRTAP8P1 and CLIC6. This genomic segment in cattle is of special interest as it contains the dominant gene responsible for the hornless or polled phenotype in cattle. The construction of the BAC contig was initiated by screening the bovine BAC library with heterologous cDNA probes derived from 12 human genes of the syntenic region on HSA 21q22. Contig building was facilitated by BAC end sequencing and chromosome walking. During the construction of the contig, 165 BAC end sequences and 109 single-copy STS markers were generated. For comparative mapping of 25 HSA 21q22 genes, genomic PCR primers were designed from bovine EST sequences and the gene-associated STSs mapped on the contig. Furthermore, bovine BAC end sequence comparisons against the human genome sequence revealed significant matches to HSA 21q22 and allowed the in silico mapping of two new genes in cattle. In total, 31 orthologues of human genes located on HSA 21q22 were directly mapped within the bovine BAC contig, of which 16 genes have been cloned and mapped for the first time in cattle. In contrast to the existing comparative bovine&ndash;human RH maps of this region, these results provide a better alignment and reveal a completely conserved gene order in this 4 Mb segment between cattle, human and mouse. The mapping of known polled linked BTA 1q12 microsatellite markers allowed the integration of the physical contig map with existing linkage maps of this region and also determined the exact order of these markers for the first time. Our physical map and transcript map may be useful for positional cloning of the putative polled gene in cattle. The nucleotide sequence data reported in this paper have been submitted to EMBL and have been assigned Accession Numbers AJ698510&ndash;AJ698674. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Synthesis for handwriting analysis
Authors: N. Vincent, A. Seropian, G. Stamon
Venue: Pattern Recognition Letters (2005)

Recently a large number of studies has been published in the area of Fractal Analysis. In this paper we review briefly the IFS (Iterated Function System) theory, and we show how this theoretical tool leads to new applications in Pattern Recognition and more precisely in the analysis of handwritten texts. Among other results, this research work shows that fractal analysis is no longer only restricted to a descriptive role, but has entered in a functional phase. More precisely we developed a concrete application, based on automatic feature selection by fractal approach, and dedicated to alphabet discrimination.
Computer forensics laboratory and tools
Authors: Guillermo A. Francia, Keion Clinton
Venue: Journal of Computing Sciences in Colleges (2005)

The pervasiveness and the convenience of information technology tend to make most of society deeply dependent on the availability computers and network systems. As our reliance on such systems grows, so does our exposure to its vulnerabilities. Day after day, computers are being attacked and compromised. These attacks are made to steal personal identities, to bring down an entire network segment, to disable the online presence of businesses, or to completely obliterate sensitive information that is critical for personal or business purposes. It is the responsibility of every organization to establish a reasonably secure system to protect its own interests as well as those of its customers. And as computer crime steadily grows, so does the need for computer security professionals trained in understanding computer crimes, in gathering digital forensic evidence, in applying the necessary security tools, and in collaborating with law enforcement agencies. This paper presents the design and implementation of an experimental Computer Security and Forensic Analysis (CSFA) laboratory and the tools associated with it. The laboratory is envisioned to be a training facility for future computer security professionals.
Apple Training Series: iLife 05 (Apple Training)
Authors: Michael Rubin
Venue:  (2005)

In the only Apple-certified guide to iLife '05, digital pioneer Michael Rubin has you making miracles with iLife within the first few pages. Using real-life material and practical lessons that you can apply immediately to your own projects, this book/DVD combo offers a complete, self-paced course in all aspects of iLife '05. Focused lessons take you step-by-step through everything from arranging your iTunes library to adding special effects to your video project. You'll learn to make custom music CDs or DJ a party with your iPod, add motion and sound to your slide shows and use “Hollywood style” techniques for making better videos. With this book you'll go from newbie to producer of your own media content in one day! The book is both a self-paced learning tool and the official curriculum of the Apple Training and Certification Program, used by schools and training centers worldwide. An easy, accessible style paired with ample illustrations and keyboard shortcuts guarantee that readers will make iLife their life in no time.
Optimization of a Tandem M/GI/1 Router Network with Batch Arrivals
Authors: Nalan Gulpinar, Peter Harrison, Berc Rustem, Louis-Francois Pau
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

An optimization methodology is developed for a tandem router network with batch arrivals. The end-to-end performance, computed as the mean transmission delay in a simple analytical model, is minimized subject to an upper limit on the rate of losses and finite capacity queueing and recovery buffers. The optimal ratio of arrival-buffer size to recovery-buffer size is determined, which is a critical quantity that affects both loss rate and transmission time. Losses may be due to either full buffers or corrupted data. Losses at a full buffer are inferred by a time-out whereas corrupted data is detected immediately on receipt of a packet at a router, causing a N-ACK to be sent upstream. Recovery buffers hold successfully transmitted packets so that on receiving a N-ACK, the packet, if present, can be retransmitted, avoiding an expensive resend from source. The impact of the retransmission probability is investigated similarly: too high a value leads to congestion and so higher response times, too low and packets are lost forever, yielding a different penalty. Graphs are shown to illustrate performance in the near-optimal region of the critical parameters.
Face Traversal Routing on Edge Dynamic Graphs
Authors: Xiaoyang Guan
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

Previous face traversal algorithms for ad-hoc routing all assume static graphs during the routing process. In this paper, we present a new face traversal algorithm that does not rely on this assumption. Specifically, we consider routing on edge dynamic graphs, which have stationary nodes and whose edges may change between being active and inactive at any time. The algorithm guarantees message delivery if there exists a sequence of connected spanning subgraphs of the routing graph, each of which is stable for a sufficiently long period of time. Moreover, the algorithm tolerates a wide array of transient faults.
Virtual Gateways in the DECOS Integrated Architecture
Authors: R. Obermaisser, P. Peti, H. Kopetz
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

The DECOS architecture divides the overall system into a set of nearly-independent distributed application subsystems, which share the node computers and the physical network of a single distributed computer system. Through restricting each application subsystem's communication activities to a corresponding encapsulated virtual network realized as an overlay network on a time-triggered backbone, the DECOS architecture supports fault isolation, complexity management, and the independent development of application subsystems. This paper provides a solution to the controlled export and import of information between distributed application subsystems. We give the designer the ability to coordinate application services and exploit redundancy in the system to either improve reliability or reduce resource duplication. We introduce virtual gateways for the coupling of virtual networks by the selective redirection of messages. Virtual gateways not only resolve property mismatches between distributed application subsystems, but also preserve encapsulation.
Evolutionary approaches to fuzzy modelling for classification
Authors: Michelle Galea, Qiang Shen, John Levine
Venue: The Knowledge Engineering Review (2004)

An overview of the application of evolutionary computation to fuzzy knowledge discovery is presented. This is set in one of two contexts: overcoming the knowledge acquisition bottleneck in the development of intelligent reasoning systems, and in the data mining of databases where the aim is the discovery of new knowledge. The different strategies utilizing evolutionary algorithms for knowledge acquisition are abstracted from the work reviewed. The simplest strategy runs an evolutionary algorithm once, while the iterative rule learning approach runs several evolutionary algorithms in succession, with the output from each considered a partial solution. Ensembles are formed by combining several classifiers generated by evolutionary techniques, while co-evolution is often used for evolving rule bases and associated membership functions simultaneously. The associated strengths and limitations of these induction strategies are compared and discussed. Ways in which evolutionary techniques have been adapted to satisfy the common evaluation criteria of the induced knowledge&mdash;classification accuracy, comprehensibility and novelty value&mdash;are also considered. The review concludes by highlighting common limitations of the experimental methodology used and indicating ways of resolving them.
Reconciliation service for copies synchronisation
Authors: Lydialle Chateigner, Sophie Chabridon, Nawel Sabri, Guy Bernard
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

The concept of multi-synchronous interaction has become popular in the context of collaborative work [7]. This cooperation mode allows the participants of a virtual team to alternate periods of work in coupled mode collaborating with the other team members with isolated work in uncoupled mode. As divergence may then occur, a reconciliation mechanism is required for team members to synchronize their work.This article deals with collaborative work among mobile users who manipulate component-based applications. We present the architecture of a reconciliation service that can be seen as an extra-fonctional service supported by the components container. More precisely we propose to extend a component-based middleware by the integration of a synchronisation service implementing the SOCT4. ("S&eacute;rialisation des op&eacute;rations concurrentes par transposition") algorithm [23, 24] based on operation transforms technology.
Learning nonsingular phylogenies and hidden Markov models
Authors: Elchanan Mossel, Sébastien Roch
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

In this paper, we study the problem of learning phylogenies and hidden Markov models. We call a Markov model nonsingular if all transition matrices have determinants bounded away from 0 (and 1). We highlight the role of the nonsingularity condition for the learning problem. Learning hidden Markov models without the nonsingularity condition is at least as hard as learning parity with noise. On the other hand, we give a polynomial-time algorithm for learning nonsingular phylogenies and hidden Markov models.
Rayleigh Flat Fading Channels' Capacity
Authors: Jun Li, Amitava Bose, Yiqiang Q. Zhao
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

In this paper, we consider single-user transmission over a Rayleigh flat fading channel, in which the Channel State Information (CSI) is known by the receiver only. Subject to an average transmit power constraint, we study the capacity of an Additive White Gaussian Noise (AWGN) channel with Rayleigh fading. Under an independently identically distributed fading assumption, lower and upper bounds of the channel capacity are given and proved and they are compared to the capacity results numerically computed. Besides, an approximation result of such channel capacity is proposed, and by conducting numerical comparison it is shown that our suggested approximation result has a better performance in approximating Rayleigh fading channels capacity than the bounds given above. In addition, the channel capacity with outage probability is discussed and compared with different outage probabilities.
Online-configuration of software visualizations with Vizz3D
Authors: Thomas Panas, Rüdiger Lincke, Welf Löwe
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

A software visualization is defined by an abstract software model, views on this model and a mapping between them. For creating new visualizations, we online-configure views and their mappings instead of hand-coding them. In this paper, we introduce an architecture allowing such an online configuration and, as a proof of concept, a framework implementing this architecture. In several examples, we demonstrate generality and flexibility of our approach.
A comprehensive framework for modeling set-based business rules during conceptual database design
Authors: Sudha Ram, Vijay Khatri
Venue: Information Systems (2005)

Business rules are the basis of any organization. From an information systems perspective, these business rules function as constraints on a database helping ensure that the structure and content of the real world sometimes referred to as miniworld--is accurately incorporated into the database. It is important to elicit these rules during the analysis and design stage, since the captured rules are the basis for subsequent development of a business constraints repository. We present a taxonomy for set-based business rules, and describe an overarching framework for modeling rules that constrain the cardinality of sets. The proposed framework results in various types constraints, i.e.. attribute, class, participation, projection, co-occurrence, appearance and overlappinq, on a semantic model that supports abstractions like classification, generalization/specialization, aggregation and association. We formally define the syntax of our proposed framework in Backus-Naur Form and explicate the semantics using first-order logic. We describe partial ordering in the constraints and define the concept of metaconstraints, which can be used for automatic constraint consistency checking during the design stage itself. We demonstrate the practicality of our approach with a case study and show how our approach to modeling business rules seamlessly integrates into existing database design methodology. Via our proposed framework, we show how explicitly capturing data semantics will help bridge the semantic gap between the real world and its representation in an information system.
Tabu Marking Scheme for IP Traceback
Authors: Miao Ma
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

The IP traceback is an attractive mechanism in defending against distributed denial-of-service (DDoS) attacks. In this paper we propose a new probabilistic packet marking (PPM) scheme for IP traceback, Tabu Marking Scheme (TMS). In this scheme a router regards a packet marked by an upstream router as a tabu and does not mark it again. Furthermore we derive a new analytical result on the partial coupon collection problem for convergence analysis. Numerical results show that TMS significantly reduces the convergence time under DDoS attacks, as compared with previous PPM schemes that allow overwriting. TMS also ensures the authentication of the routers' markings.
AwareDAV: a generic WebDAV notification framework and implementation
Authors: Henning Qin Jehøj, Niels Olof Bouvin, Kaj Grønbæk
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

WebDAV needs awareness support in order to be a full-fledged collaboration system, This paper introduces AwareDAV, a new WebDAV extension framework enabling shared awareness through event notification. By extending the WebDAV protocol with seven new request-methods and an extensible XML based event subscription scheme, AwareDAV supports fine grained event subscriptions over a range of transport mechanisms and enables a wide range of collaboration scenarios. This paper describes the design of AwareDAV, its API, experiences with its initial implementation, as well as a comparison with Microsoft Exchange and WebDAV-notify.
Tools for computer architecture research
Authors: Doug Burger, Anand Sivasubramaniam
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Simulators are critical tools for computer architecture research and education. They are invaluable when evaluating hardware designs and enhancements, that would otherwise be prohibitively expensive to prototype in practice. Simulators can be useful vehicles for verifying the validity of initial designs, understanding their cost-benefit trade-offs, whether or not a more expensive and time-consuming hardware prototyping effort is undertaken. In addition to being the sole vehicle for conducting an investigation in different research organizations, simulators are extensively used in industry for validating new ideas before justifying further investments on those ideas. Further, simulators can also serve as excellent platforms for teaching difficult concepts in hardware and compilers, by allowing students hands-on access to hardware and software internals that may not be accessible otherwise.
Book review: USING BASIC by Tom Rugg and & Phil Feldman (Que Corporation, 1990)
Venue: ACM SIGSMALL/PC Notes (1991)

This book is similar to a number of books published by Que Corporation; they are written as tutorials for persons wishing to learn or more thoroughly learn a software package. This book is written to teach versions 2.0 through 3.3 of Microsoft's GW-BASIC and IBM's BASICA; this book is the most thorough, yet highly readable guides to BASIC that I have read.