ppxscal/embedding_network huggingface dataset:
Haptic: the new biometrics-embedded media to recognizing and quantifying human patterns
Authors: Mauricio Orozco Trujillo, Ismail Shakra, Abdulmotaleb El Saddik
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Authentication for the purposes of security has taken giant strides since the introduction of Biometrics to help identify people by their behavioral and physiological features. From organizations and corporations to educational institutes, electronic resources, and even crime scenes, Biometrics offers a wide application scope to detect fraud attempts. This paper proposes a research path to achieve the task of authenticating users that are working in a haptic-based environment. The field of Biometrics can be divided into two main classes of human features. Birth-given characteristics like fingerprints and facial features cannot be developed or altered by humans. Behavioral characteristics such as hand signature and voice fall into the second class [1]. The work presented in this paper pursues the latter class and specifically studies how a person reacts to using daily devices or tools. The fact that we can exploit people's habits in handling devices to detect identity was the hypothesis that motivated this work.
Collaborative Control of the Manus Manipulator
Authors: B. J. F. Driessen, T. K. Ten. Kate, F. Liefhebber, A. H. G. Versluis, J. A. van Woerden
Venue: Universal Access in the Information Society (2005)

The Manus manipulator is a wheelchair mounted assistive device for severely motor disabled persons. It is a six degrees of freedom rehabilitation robot (excluding external lift and gripper), the control of which can be improved, especially for users with very limited rest functionality. The approach presented in this paper combines autonomous vision based control with direct user control resulting in a collaborative controller. Results of preliminary user trials show that this technique allows severely disabled persons to manipulate objects more easily.
Learning Gaussian processes from multiple tasks
Authors: Kai Yu, Volker Tresp, Anton Schwaighofer
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We consider the problem of multi-task learning, that is, learning multiple related functions. Our approach is based on a hierarchical Bayesian framework, that exploits the equivalence between parametric linear models and nonparametric Gaussian processes (GPs). The resulting models can be learned easily via an EM-algorithm. Empirical studies on multi-label text categorization suggest that the presented models allow accurate solutions of these multi-task problems.
A Scalable and Reliable Multicast Routing Protocol for Ad-hoc Wireless Networks
Authors: C. R. Dow, J. H. Lin, K. T. Chen, S. C. Chen, S. F. Hwang
Venue: Wireless Personal Communications: An International Journal (2005)

Multicasting is an essential service for ad-hoc wireless networks. In a multicasting environment with multiple senders, receivers or meeting members, traditional multicast routing protocols must pay great overhead for multiple multicast sessions. This work presents a scalable and reliable multicasting protocol for ad-hoc wireless networks. A virtual backbone is used as a shared structure for multiple sessions. A clustering scheme is used to reduce the routing path length. A novel scheme is developed to effectively multicast packets using forwarding gates. Furthermore, a lost packet recovery scheme is developed for reliable packet transmission. This scheme can be used to improve the reliability of traditional non-acknowledged multicasting approach. Experiments were conducted to evaluate the proposed multicasting scheme and the results demonstrate that our scheme outperforms other schemes in terms of packet delivery ratio, packet delivery time, control overhead, multicast efficiency, and cost effect. Furthermore, our approach is stable for networks with high mobility and the lost packet recovery scheme is cost-effective.
A Model for Detecting and Merging Vertically Spanned Table Cells in Plain Text Documents
Authors: Vanessa Long, Robert Dale, Steve Cassidy
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

A spanned cell in a table is a single, complete unit that physically occupies multiple columns and/or multiple rows. Spanned cells are common in tables, and they are a signifi- cant cause of error in the extraction of tables from free text documents. In this paper, we present a model for the detection and merging of vertically spanned cells for tables presented in plain text documents. Our model and algorithm are based purely on the layout features of the tables, and they require no semantic understanding of the documents. When tested on the 98 tables appearing in 40 randomly selected documents from a corpus of company announcements from the Australian Stock Exchange (ASX), our algorithm achieves an accuracy of 86.79% in detecting and merging vertically spanned cells.
A Robust Algorithm for Text Detection in Color Images
Authors: Yangxing LIU, Satoshi GOTO, Takeshi IKENAGA
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Text detection in color images has become an active research area since recent decades. In this paper, we present a novel approach to accurately detect text in color images possibly with a complex background. First, we use an elaborate edge detection algorithm to extract all possible text edge pixels. Second connected component analysis is employed to construct text candidate region and classify part non-text regions. Third each text candidate region is verified with texture features derived from wavelet domain. Finally, the Expectation maximization algorithm is introduced to binarize text regions to prepare data for recognition. In contrast to previous approach, our algorithm combines both the efficiency of connected component based method and robustness of texture based analysis. Experimental results show that our algorithm is robust in text detection with respect to different character size, orientation, color and language and can provide reliable text binarization result.
Policy Based Adaptive Services for Mobile Commerce
Authors: Enrico Rukzio, Sven Siorpaes, Oliver Falke, Heinrich Hussmann
Venue: Proceedings of the Second IEEE International Workshop on Mobile Commerce and Services (2005)

In this paper we describe a novel adaptation architecture as well as a process for the development of policy based adaptive services for mobile commerce. Our architecture is based on three basic requirements and defines the four core elements context, policies, policy decision point and policy enforcement point. The proposed approach is based on the reuse and adaptation of existing and matured standards, APIs and middleware for representing context information, usage of policies for reasoning and for the communication between the involved parties. Our aim is to present a simple architecture taking as much as possible available work and software into account to support the rapid development of context aware mobile services. Furthermore we present a novel methodology for the definition of context information and policies that is sup-ported by a new UML based diagram and a module pipeline. We show the feasibility of the architecture as well as of the process based on a prototype which implements a typical scenario for an adaptive mobile service.
Simple simulation
Authors: Richard C. Wilson
Venue: ACM SIGSIM Simulation Digest (1979)

This paper describes an example of a network flow modelling approach for "quick and dirty" analysis of traffic dynamics in material handling systems. The example is based on a real installation. It serves to demonstrate potential for quickly comparing the design feasibility of alternate conveyor system layouts under dynamic loading before using specially programmed simulations.
Automated Source-Level Error Localization in Hardware Designs
Authors: Bernhard Peischl, Franz Wotawa
Venue: IEEE Design Test (2006)

Recent achievements in formal verification techniques allow for fault detection even in large real-world designs. Tool support for localizing the faulty statements is critical, because it reduces development time and overall project costs. Automated source-level debugging and a new and novel debugging model allow for source-level debugging of large VHDL designs at the granularity of statements and expressions. This technique is fully automated and does not require that an engineer be familiar with formal verification techniques.
The trouble with login: on usability and computer security in ubiquitous computing
Authors: E. Bardram
Venue: Personal and Ubiquitous Computing (2005)

Logging in by typing usernames and passwords is by far the most common way to access modern computer systems. However, such contemporary user authentication mechanisms are inappropriate in a ubiquitous computing environment, where users constantly are accessing a wide range of different devices. This paper introduces new concepts for user authentication in ubiquitous computing, such as the notion of proximity-based user authentication and silent login. The design of these new mechanisms is part of the design of a ubiquitous computing infrastructure for hospitals, which is grounded in field studies of medical work in hospitals. The paper reports from field studies of clinicians using an electronic patient record (EPR) and describes severe usability problems associated with its login procedures. The EPR&#x2019;s login mechanisms do not recognize the nature of medical work as being nomadic, interrupted, and cooperative around sharing common material. The consequence is that login is circumvented and security is jeopardized.
Pseudonym management using mediated identity-based cryptography
Authors: Thibault Candebat, Cameron Ross Dunne, David T. Gray
Venue: Proceedings of the 2005 workshop on Digital identity management (2005)

Mobile Location-Based Services (LBS) have raised privacy concerns amongst mobile phone users who may need to supply their identity and location information to untrustworthy third parties in order to access these applications. Widespread acceptance of such services may therefore depend on how privacy sensitive information will be handled in order to restore users' confidence in what could become the "killer app" of 3G networks. In this paper, we present a proxy-based public key infrastructure that allows LBS mobile users to shield their identities using pseudonyms and protect their communications using mediated identity-based encryption. In particular, we propose the first identity-based signature scheme applicable in a mediated environment. Furthermore, we introduce a process whereby a mobile user is only required to own one private key in order to protect her communications when accessing LBS under different pseudonyms. The identity-based character of the PKI simplifies significantly key management by removing the need for digital certificates. Its mediated architecture makes key revocation easier and more efficient as it allows for instant revocation of security capabilities.
A probabilistic template-based approach to discovering repetitive patterns in broadcast videos
Authors: Peng Wang, Zhi-Qiang Liu, Shi-Qiang Yang
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

There are usually repetitive sub-segments in broadcast videos, which may be associated with high-level concepts or events, e.g., news footage, repeated scores in basketball. Unsupervised mining techniques provide generic solutions to discovering such temporal patterns in various video genres, which are currently the subject of great interests to researchers working on multimedia content analysis. In this paper, we propose a novel approach to automatically detecting repetitive patterns in a video stream. In this approach, a video stream is first transformed to a symbol sequence via the spectral clustering algorithm. After computing the transition probabilities of any two symbols in temporal evolution, we produce a set of probabilistic templates to characterize the patterns of potential interest. Finally, we verify each probabilistic template by measuring the similarities between the video sub-segments and the template. Evaluations on various sports videos show promising results.
A Systematic Approach to Exploring Embedded System Architectures at Multiple Abstraction Levels
Authors: Andy D. Pimentel, Cagkan Erbas, Simon Polstra
Venue: IEEE Transactions on Computers (2006)

The sheer complexity of today's embedded systems forces designers to start with modeling and simulating system components and their interactions in the very early design stages. It is therefore imperative to have good tools for exploring a wide range of design choices, especially during the early design stages, where the design space is at its largest. This paper presents an overview of the Sesame framework, which provides high-level modeling and simulation methods and tools for system-level performance evaluation and exploration of heterogeneous embedded systems. More specifically, we describe Sesame's modeling methodology and trajectory. It takes a designer systematically along the path from selecting candidate architectures, using analytical modeling and multiobjective optimization, to simulating these candidate architectures with our system-level simulation environment. This simulation environment subsequently allows for architectural exploration at different levels of abstraction while maintaining high-level and architecture-independent application specifications. We illustrate all these aspects using a case study in which we traverse Sesame's exploration trajectory for a Motion-JPEG encoder application.
Two Apparent `Counterexamples' To Marcus: A Closer Look
Authors: Marius Vilcu, Robert F. Hadley
Venue: Minds and Machines (2005)

Marcus et al.'s experiment (1999) concerning infant ability to distinguish between differing syntactic structures has prompted connectionists to strive to show that certain types of neural networks can mimic the infants' results. In this paper we take a closer look at two such attempts: Shultz and Bale [Shultz, T.R. and Bale, A.C. (2001), Infancy 2, pp. 501---536] Altmann and Dienes [Altmann, G.T.M. and Dienes, Z. (1999) Science 248, p. 875a]. We were not only interested in how well these two models matched the infants' results, but also whether they were genuinely learning the grammars involved in this process. After performing an extensive set of experiments, we found that, at first blush, Shultz and Bale's model (2001) replicated the infant's known data, but the model largely failed to learn the grammars. We also found serious problems with Altmann and Dienes' model (1999), which fell short of matching any of the infant's results and of learning the syntactic structure of the input patterns.
An Effective Topology Extraction Algorithm for Search Reduction Space of a GA-based QoS Routing Method in Ad-Hoc Networks
Authors: Shohei Ohba, Makoto Ikeda, Leonard Barolli, Giuseppe De Marco, Jiro Iwashige, Arjan Durresi
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

A lot of work has been done on routing in MANETs. However, the proposed routing solutions deal only with the best effort data traffic. Connections with Quality of Service (QoS) requirements are not supported. The QoS routing has been receiving increasingly intensive attention in the wireline network domain. However, for MANETs are proposed only few QoS routing algorithms. For MANETs, approximated solutions and heuristic algorithms should be developed and QoS routing algorithms should be adaptive, flexible, and intelligent. In our previous work, we proposed a Genetic Algorithm (GA) based routing method for Mobile Ad-hoc Networks (GAMAN). In this paper, we enhance the proposed algorithm by adding an effective topology extraction algorithm to reduce the search space of GAMAN. We call this algorithm E-GAMAN. The E-GAMAN uses two QoS parameters for routing. The performance evaluation via simulations show that E-GAMAN has a good performance.
A design flow for protecting FPGA-based systems against single event upsets
Authors: L. Sterpone, M. Violante
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

SRAM-based Field Programmable Gate Arrays (FPGAs) are very susceptible to Single Event Upsets (SEUs) that may have dramatic effects on the circuits they implement. In this paper we present a design flow composed by both standard tools, and ad-hoc developed tools, which designers can use fruitfully for developing circuits resilient to SEUs. Experiments are reported on both benchmarks circuits and on a realistic circuit to show the capabilities of the proposed design flow.
Situated event bootstrapping and capture guidance for automated home movie authoring
Authors: Brett Adams, Svetha Venkatesh
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

This paper describes a novel interactive media authoring framework, MediaTE, that enables amateurs to create videos of higher narrative or aesthetic quality with a completely mobile lifecycle. A novel event bootstrapping dialog is used to derive shot suggestions that yield both targetted footage and annotation enabling an automatic Computational Media Aesthetics-aware editing phase, the manual performance of which is typically a barrier to the amateur. This facilitates a move away from requiring a prior-conception of the events or locale being filmed, in the form of a template, to at-capture bootstrapping of this information. Metadata gathered as part of the critical path of media creation also has implications for the longevity and reuse of captured media assets. Results of an evaluation performed on both the usability and delivered media aspects of the system are discussed, which highlight the tenability of the proposed framework and the quality of the produced media.
An Effective Web Services Discovery Strategy for Web Services Composition
Authors: Shen Derong, Yu Ge, Cao Yu, Kou Yue, Nie Tiezheng
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

With the popularity of Web services, how to discover suitable web services to support Web services composition has become a challenge. Traditional keyword search is insufficient due to its lower recall and precision. This paper proposes an effective web service discovery strategy based on Web services description information. In this paper, the description information for web services is divided into operation information named as WSDL attributes and profile information, where profile information consists of service function information and service constraint information, and they are represented as general attributes and instance attributes respectively. Based on the information and ontology knowledge, three steps are adopted for discovering Web services. Firstly, according to WSDL attribute, the heterogeneities of service operations are resolved. Secondly, based on general attributes, the Web services to meet the function requirement of customers are found. Thirdly, a matching model is applied based on instance attributes and suitable web services are obtained and provided for customers. The service discovering approach is simple, available and become highly effective by introducing semantics, moreover, it has been applied to e_Scope successfully.
A summary-attainment-surface plotting method for visualizing the performance of stochastic multiobjective optimizers
Authors: Joshua Knowles
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

When evaluating the performance of a stochastic optimizer it is sometimes desirable to express peformance in terms of the quality attained in a certain fraction of sample runs. For example, the sample median quality is the best estimator of what one would expect to achieve in 50% of runs, and similarly for other quantiles. In multiobjective optimization, the notion still applies but the outcome of a run is measured not as a scalar (i.e. the cost of the best solution), but as an attainment surface in the k-dimensional space where k is the number of objects). In this paper we report an algorithm that can be conveniently used to plot summary attainment surfaces in any number of dimensions (though it is particularly suited for three). A summary attainment surface is defined as the union of all tightest goals that have been attained (independently) in precisely s of the runs of a sample of \eta runs, for any s \in 1...\eta and for any k We also discuss the computational complexity of the algorithm and give some examples of its use. C code for the algorithm is available from the author.
RT-Linux Based Hard Real-Time Software Architecture for Unmanned Autonomous Helicopters
Authors: Won Eui Hong, Jae Shin Lee, Laxmisha Rai, Soon Ju Kang
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

The UAV (Unmanned Aerial Vehicle) performs various kinds of missions while performing autonomous flight navigation. In order to realize all functionalities of the UAV, the software part becomes a very complex hard real-time system because some hard real-time tasks, soft real-time tasks and non-real-time tasks are concurrently working together under a RTOS. In this paper, a hierarchical architecture for Unmanned Autonomous Helicopter System is proposed that guarantees the real-time performance of hard real-time tasks and the re-configurability of soft real-time or non-real-time tasks under the RT-Linux. This software architecture has four layers: hardware, execution, service agent and remote user interface layer according to the reactiveness level for external events. In addition, the layered separation of concurrent tasks makes different kinds of mission reconfiguration possible in the system. An Unmanned autonomous helicopter system was implemented using Kyosho RC Helicopter to test and evaluate the performance of the proposed systems.
The GrImage Platform: A Mixed Reality Environment for Interactions
Authors: Jeremie Allard, Jean-Sebastien Franco, Clement Menier, Edmond Boyer, Bruno Raffin
Venue: Proceedings of the Fourth IEEE International Conference on Computer Vision Systems (2006)

In this paper, we present a scalable architecture to compute, visualize and interact with 3D dynamic models of real scenes. This architecture is designed for mixed reality applications requiring such dynamic models, tele-immersion for instance. Our system consists in 3 main parts: the acquisition, based on standard firewire cameras; the computation, based on a distribution scheme over a cluster of PC and using a recent shape-from-silhouette algorithm which leads to optimally precise 3D models; the visualization, which is achieved on a multiple display wall. The proposed distribution scheme ensures scalability of the system and hereby allows control over the number of cameras used for acquisition, the frame-rate, or the number of projectors used for high resolution visualization. To our knowledge this is the first completely scalable vision architecture for real time 3D modeling, from acquisition to visualization through computation. Experimental results show that this framework is very promising for real time 3D interactions.