ppxscal/embedding_network huggingface dataset:
Handwritten Signature Verification Using Image Invariants and Dynamic Features
Authors: Abdullah I. Al-Shoshan
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

In this paper, a development of automatic signature classification system is proposed. We have presented offline and online signature verification system, based on the signature invariants and its dynamic features. The proposed system segments each signature based on its perceptually important points and then, for each segment, computes a number of features that are scale, rotation and displacement invariant. The normalized moments and the normalized Fourier descriptors are used for this invariancy, while the speed of pen is used as a dynamic feature of the signature. In both cases the data acquisition, pre-processing, feature extraction and comparison steps are analyzed and discussed. Both static and dynamic features were used as an input to a neural network. The neural network used for classification is a multi-layer perception (MLP) with one input layer, one hidden layer and one output layer. The performance of the proposed system is presented through simulation examples.
Numerical methods for multiscale transport equations and application to two-phase porous media flow
Authors: Xingye Yue, Weinan E
Venue: Journal of Computational Physics (2005)

We discuss numerical methods for linear and nonlinear transport equations with multiscale velocity fields. These methods are themselves multiscaled in nature in the sense that they use macro and micro grids, multiscale test functions. We demonstrate the efficiency of these methods and apply them to two-phase flow in heterogeneous porous media.
Automating Functional Tests Using Selenium
Authors: Antawan Holmes, Marc Kellogg
Venue: Proceedings of the conference on AGILE 2006 (2006)

Ever in search of a silver bullet for automated functional testing for Web Applications, many folks have turned to Selenium. Selenium is an open-source project for in-browser testing, originally developed by ThoughtWorks and now boasting an active community of developers and users. One of Selenium's stated goals is to become the de facto open-source replacement for proprietary tools such as WinRunner. Of particular interest to the agile community is that it offers the possibility of test-first design of web applications, red-green signals for customer acceptance tests, and an automated regression test bed for the web tier. This experience report describes the standard environment for testing with Selenium, as well as modifications we performed to incorporate our script pages into a wiki. It includes lessons we learned about continuous integration, script writing, and using the Selenium Recorder (renamed IDE). We also discuss how long it took to write and maintain the scripts in the iterative development environment, how close we came to covering all of the functional requirements with tests, how often the tests should be (and were) run, and whether additional automated functional testing below the GUI layer was still necessary and/or appropriate. While no silver bullet, Selenium has become a valuable addition to our agile testing toolkit, and is used on the majority of our web application projects. It promises to become even more valuable as it gains widespread adoption and continues to be actively developed.
High-Level Modeling and FPGA Prototyping of Produced Order Parallel Queue Processor Core
Authors: Ben A. Abderazek, Tsutomu Yoshinaga, Masahiro Sowa
Venue: The Journal of Supercomputing (2006)

Emerging high-level hardware description and synthesis technologies in conjunction with field programmable gate arrays (FPGAs) have significantly lowered the threshold for hardware development. Opportunities exist to integrate these technologies into a tool for exploring and evaluating microarchitectural designs especially for newly proposed architectures. This paper presents a prototyping of a new processor core based on Queue architecture as starting point for application-specific processor design exploration. Using a hardware description language, we have created the Synthesizable model of a produced order parallel queue processor core for the integer subset parallel Queue architecture. A prototype implementation is produced by synthesizing the high-level model for the Stratix FPGA prototyping board. We show how to perform prototyping and optimizations to fully exploit the capabilities of the prototyped Queue processor core, while maintaining a common source base.
Evaluation and Research of Strong Migration of Mobile Agent for Exploiting Type Inference
Authors: Donghong Qin, Zhi Li
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Strong migration of mobile agents is a study hotspot of the mobile agent system, which plays a basic and important role in studying and applying the technology of mobile agents. In this paper, we mainly focus on the technique for strong migration of mobile agent, and propose an approach to capture and reestablish the agent runtime state. This is achieved thanks to the use of type inference technique. We introduce the type-inference technique and describe the design and implementation details of agent strong migration prototype. We report on experiments conducted with our prototype, present a comparative performance evaluation of the main strong migration techniques.
Computer Society Honors Oklahoma Teen at Intel Science Fair
Authors: Bob Ward
Venue: Computer (2006)

Topics covered include: "Computer Society Honors Oklahoma Teen at Intel Science Fair;" "Laser Scanning System Wins Wyoming Student $10,000; "IEEE Computer Society Launches 2006 Elections;" Elisa Bertino Receives Kanai Award;" and "CSIDC 2006 Names Top 10 Finalist Teams."
Bridging the Gap Between Reality and Simulations: An Ethernet Case Study
Authors: Punit Rathod, Srinath Perur, Raghuraman Rangarajan
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

Simulation is a widely used technique in networking research and a practice that has suffered loss of credibility in recent years due to doubts about its reliability. In this paper, we conduct a simple Ethernet experiment on a test-bed, and try to reproduce the results using three popular network simulators: ns-2, QualNet and OPNET Modeler. We find that after careful simulation we are able to approximate test-bed performance in all three simulators, and we document the simulation process for each one. We also identify blocking socket calls as a behavioral attribute of applications that affects performance, but cannot be set in any of the three simulators used.
Model Based Facial Pose Tracking Using a Particle Filter
Authors: Bogdan Kwolek
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

This paper presents a model-based technique for monocular tracking of the head pose using a non-calibrated camera. We use texture-mapped face images through the 3D head model as the data representation. The mapped data are compared to the model data via a similarity metric that expresses the likeness between the rendered and the reference images. The tracking is realized using a particle filter. In observation model we utilize rectangle features as the primary cue. The potential of our approach is demonstrated by tracking of the head pose on real videos.
Automatic Learning-based MANET Cross-Layer Parameter Configuration
Authors: Karen Zita Haigh, Srivatsan Varadarajan, Choon Yik Tang
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Mobile ad hoc networks (MANETs) operate in highly dynamic environments with limited resources. Current approaches to network configuration are static and ad-hoc, and therefore frequently perform extremely poorly. We describe our approach to network configuration control that relies on automatically learning the relationships among configuration parameters and maintains near-optimal configurations adaptively, even during highly dynamic missions. We present a case study demonstrating the feasibility of the approach.
Advanced concepts in large-scale network simulation
Authors: David M. Nicol, Michael Liljenstam, Jason Liu
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This tutorial paper reviews existing concepts and future directions in selected areas related to simulation of large-scale networks. It covers specifically topics in traffic modeling, simulation of routing, network emulation, and real-time simulation.
Grid-Enabled Workflows for Industrial Product Design
Authors: Moustafa Ghanem, Nabeel Azam, Mike Boniface, Justin Ferris
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

This paper presents a generic approach for developing and using Grid-based workflow technology for enabling cross-organizational engineering applications. Using industrial product design examples from the automotive and aerospace industries we highlight the main requirements and challenges addressed by our approach and describe how it can be used for enabling interoperability between heterogeneous workflow engines.
Multiscale Nonlinear Diffusion and Shock Filter for Ultrasound Image Enhancement
Authors: Fan Zhang, Yang Mo Yoo, Yongmin Kim, Lichen Zhang, Liang Mong Koh
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

A new noise reduction and edge enhancement method, i.e., Laplacian pyramid-based nonlinear diffusion and shock filter (LPNDSF), is proposed for medical ultrasound imaging. In the proposed LPNDSF, a coupled nonlinear diffusion and shock filter process is applied in Laplacian pyramid domain of an image, to remove speckle and enhance edges simultaneously. The performance of the proposed method was evaluated on a phantom and a real ultrasound image. In the phantom study, we obtained an average gain of 0.55 and 1.11 in contrast-to-noise ratio compared to the speckle reducing anisotropic diffusion (SRAD) and nonlinear coherent diffusion (NCD), respectively. Also, the proposed LPNDSF showed clearer boundaries on the phantom and the real ultrasound image. These preliminary results indicate that the proposed LPNDSF can effectively reduce speckle noise while enhancing image edges for retaining subtle features.
MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries
Authors: Bugra Gedik, Ling Liu
Venue: IEEE Transactions on Mobile Computing (2006)

With the growing popularity and availability of mobile communications, our ability to stay connected while on the move is becoming a reality instead of science fiction as it was just a decade ago. An important research challenge for modern location-based services is the scalable processing of location monitoring requests on a large collection of mobile objects. The centralized architecture, though studied extensively in literature, would create intolerable performance problems as the number of mobile objects grows significantly. This paper presents a distributed architecture and a suite of optimization techniques for scalable processing of continuously moving location queries. Moving location queries can be viewed as standing location tracking requests that continuously monitor the locations of mobile objects of interest and return a subset of mobile objects when certain conditions are met. We describe the design of MobiEyes, a distributed real time location monitoring system in a mobile environment. The main idea behind the MobiEyes' distributed architecture is to promote a careful partition of a real time location monitoring task into an optimal coordination of server-side processing and client-side processing. Such a partition allows evaluating moving location queries with a high degree of precision using a small number of location updates, thus providing highly scalable location monitoring services. A set of optimization techniques are used to limit the amount of computation to be handled by the mobile objects and enhance the overall performance and system utilization of MobiEyes. Important metrics to validate the proposed architecture and optimizations include messaging cost, server load, and amount of computation at individual mobile objects. We evaluate the scalability of the MobiEyes location monitoring approach using a simulation model based on a mobile setup. Our experimental results show that MobiEyes can lead to significant savings in terms of server load and messaging cost when compared to solutions relying on central processing of location information.
Boxy types: inference for higher-rank types and impredicativity
Authors: Dimitrios Vytiniotis, Stephanie Weirich, Simon Peyton Jones
Venue: ACM SIGPLAN Notices (2006)

Languages with rich type systems are beginning to employ a blend of type inference and type checking, so that the type inference engine is guided by programmer-supplied type annotations. In this paper we show, for the first time, how to combine the virtues of two well-established ideas: unification-based inference, and bidi-rectional propagation of type annotations. The result is a type system that conservatively extends Hindley-Milner, and yet supports both higher-rank types and impredicativity.
Particles with Age for Data Clustering
Authors: Satchidananda Dehuri, Ashish Ghosh, Rajib Mall
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

This paper proposes a novel particle swarm optimisation (PSO) algorithm using the concept of age of particles. Effective fitness of a particle depends both on its functional value and age. Age of a newly generated particle is taken as zero, and in every iteration age of each individual is increased by one. In this paper, a trapezoidal aging function is considered. The model aims to emulate natural swarm system in a more natural way. The effectiveness of this concept is demonstrated by cluster analysis. Results show that the model provides enhanced performance and maintains more diversity in the swarm and thereby allows the particles to be robust to trace the changing environment.
Hardware/Software Co-design Applied to Reed-Solomon Decoding for the DMB Standard
Authors: Arjan C. Dam, Michel G. J. Lammertink, Kenneth C. Rovers, Johan Slagman, Arno M. Wellink
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

This paper addresses the implementation of Reed- Solomon decoding for battery-powered wireless devices. The scope of this paper is constrained by the Digital Media Broadcasting (DMB). The most critical element of the Reed-Solomon algorithm is implemented on two different reconfigurable hardware architectures: an FPGA and a coarse-grained architecture: the Montium, The remaining parts are executed on an ARM processor. The results of this research show that a co-design of the ARM together with an FPGA or a Montium leads to a substantial decrease in energy consumption. The energy consumption of syndrome calculation of the Reed- Solomon decoding algorithm is estimated for an FPGA and a Montium by means of simulations. The Montium proves to be more efficient.
A Fast Biologically Inspired Algorithm for Recurrent Motion Estimation
Authors: Pierre Bayerl Heiko Neumann
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We have previously developed a neurodynamical model of motion segregation in cortical visual area V1 and MT of the dorsal stream. The model explains how motion ambiguities caused by the motion aperture problem can be solved for coherently moving objects of arbitrary size by means of cortical mechanisms. The major bottleneck in the development of a reliable biologically inspired technical system with real-time motion analysis capabilities based on this neural model is the amount of memory necessary for the representation of neural activation in velocity space. We propose a sparse coding framework for neural motion activity patterns and suggest a means by which initial activities are detected efficiently. We realize neural mechanisms such as shunting inhibition and feedback modulation in the sparse framework to implement an efficient algorithmic version of our neural model of cortical motion segregation. We demonstrate that the algorithm behaves similarly to the original neural model and is able to extract image motion from real world image sequences. Our investigation transfers a neuroscience model of cortical motion computation to achieve technologically demanding constraints such as real-time performance and hardware implementation. In addition, the proposed biologically inspired algorithm provides a tool for modeling investigations to achieve acceptable simulation time.
Indoor Localization Using Camera Phones
Authors: Nishkam Ravi, Pravin Shankar, Andrew Frankel, Ahmed Elgammal, Liviu Iftode
Venue: Proceedings of the Seventh IEEE Workshop on Mobile Computing Systems & Applications: Supplement (2006)

Indoor localization has long been a goal of pervasive computing research. In this paper, we explore the possibility of determining user's location based on the camera images received from a smart phone. In our system, the smart phone is worn by the user as a pendant and images are periodically captured and transmitted over GPRS to a web server. The web server returns the location of the user by comparing the received images with images stored in a database. We tested our system inside the Computer Science department building. Preliminary results show that user's location can be determined correctly with more than 80% probability of success. As opposed to earlier solutions for indoor localization, this approach does not have any infrastructure requirements. The only cost is that of building an image database.
Towards all-author co-citation analysis
Authors: Dangzhi Zhao
Venue: Information Processing and Management: an International Journal (2006)

The present study examines one of the fundamental aspects of author co-citation analysis (ACA): the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting: on the one hand, the traditional type that only counts the first one among a cited work's authors, and on the other hand, a simplified approach to all-author co-citation counting that takes into account the first five authors of a cited work. Results indicate that the picture produced through this simplified all-author co-citation counting contains author groups that are more coherent, and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed. Variations of counting more than first authors are compared.
Maintaining Consistency between Loosely Coupled Services in the Presence of Timing Constraints and Validation Errors
Authors: Carlos Molina-Jimenez, Santosh Shrivastava
Venue: Proceedings of the European Conference on Web Services (2006)

Loose coupling is often cited as a defining characteristic of service-oriented architectures. Interactions between services take place via messages in an asynchronous environment where communication and processing delays can be unpredictable; further, interacting parties are not required to be on-line at the same time. Despite loose coupling, many service interactions have timing and validation constraints. For example, business interactions that take place using RosettaNet partner interface processes (PIPs) such as request price and availability, request purchase order, notify of invoice, etc. have to meet several timing and message validation constraints. A failure to deliver a valid message within its time constraint could cause mutually conflicting views of an interaction. For example, one party can regard it as timely whilst the other party regards it as untimely, leading to application level inconsistencies. The paper describes how business interactions, such as PIPs can be wrapped by simple handshake synchronisation protocols to provide bilateral consistency, thereby simplifying the task of coordinating peer-to-peer business processes.
Necessity is the ...
Authors: H. K. Hodge
Venue: ACM SIGSMALL Newsletter (1982)

Fisher Body Division of General Motors Corporation has fixtures in its plants designed to check the quality of the parts they produce (believe it or not). The most recent ones are based on Z80 processors, and I have written the programs for many of them (you would think that a door is a door is a door, but each plant has its own ideas of what should be checked). The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Is there a grand challenge or X-prize for data mining?
Authors: Gregory Piatetsky-Shapiro, Robert Grossman, Chabane Djeraba, Ronen Feldman, Lise Getoor, Mohammed Zaki
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

This panel will discuss possible exciting and motivating Grand Challenge problems for Data Mining, focusing on bioinformatics, multimedia mining, link mining, text mining, and web mining.
Statistical similarity search applied to content-based video copy detection
Authors: Alexis Joly, Olivier Buisson, Carl Frelicot
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Content-based copy detection (CBCD) is one of the emerging multimedia applications for which there is a need of a concerted effort from the database community and the computer vision community. Recent methods based on interest points and local fingerprints have been proposed to perform robust CBCD of images and video. They include two steps: the search of similar fingerprints in the database and a voting strategy that merges all the local results in order to perform a global decision. In most image or video retrieval systems, the search of similar features in the database is performed by a geometrical query in a multidimensional index structure. Recently, the paradigm of approximate knearest neighbors query has shown that trading quality for time can be widely profitable in that context. In this paper, we introduce a new approximate search paradigm, called Statistical Similarity Search (S3), dedicated to local fingerprints and we describe the original indexing structure we have developped to compute efficiently the corresponding queries. The key-point relates to the distribution of the relevant fingerprints around a query. Since a video query can result from (a combination of ) more or less transformations of an original one, we modelize the distribution of the distorsion vector between a referenced fingerprint and a candidate one. Experimental results show that these statistical queries allow high performance gains compared to classical e-range queries. By studying the influence of this approximate search on a complete CBCD scheme based on local video fingerprints, we also show that trading quality for time during the search does not degrade seriously the global robustness of the system, even with very large databases including more than 20,000 hours of video.