ppxscal/embedding_network huggingface dataset:
ADC Precision Requirement for Digital Ultra-Wideband Receivers with Sublinear Front-Ends: A Power and Performance Perspective
Authors: Ivan Siu-Chuang Lu, Neil Weste, Sri Parameswaran
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

This paper presents the power and performance analysis of a digital, direct sequence ultra-wideband (DS-UWB) receiver operating in the 3 to 4 GHz band. The signal to noise and distortion ratio (SNDR) and bit error rate (BER) were evaluated with varying degrees of front-end linearity and analog to digital converter (ADC) accuracy. The analysis and simulation results indicate two or more ADC bits are required for reliable data reception in the presence of strong interference and intermodulation distortion. In addition to BER performance, power consumption of different hardware configurations is also evaluated to form the cost function for evaluating design choices. The combined power and performance analysis indicates that starting with one-bit ADC resolutions, a substantial gain in reliability can be attained by increasing ADC resolution to two-bits or more. When the ADC resolution improves beyond three bits , front-end linearization achieves similar BER improvements to increasing the ADC accuracy, at a fraction of the power cost. As a result, linear front-end designs become significant only when high precision ADCs are utilized.
Efficient Mining of High Branching Factor Attribute Trees
Authors: Alexandre Termier, Marie-Christine Rousset, Michele Sebag, Kouzou Ohara, Takashi Washio, Hiroshi Motoda
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In this paper, we present a new tree mining algorithm, DRYADEPARENT, based on the hooking principle first introduced in DRYADE [9]. In the experiments, we demonstrate that the branching factor and depth of the frequent patterns to find are key factor of complexity for tree mining algorithms. We show that DRYADEPARENT outperforms the current fastest algorithm, CMTreeMiner, by orders of magnitude on datasets where the frequent patterns have a high branching factor.
The Webkit Tangible User Interface: A Case Study of Iterative Prototyping
Authors: Mark Stringer, Jennifer A. Rode, Eleanor F. Toye, Alan F. Blackwell, Amanda R. Simpson
Venue: IEEE Pervasive Computing (2005)

Rapid prototyping helps designers explore issues such as form factors and the relationship between the technology and the social environment in which it will be used. This case study provides examples of good design practice for iterative design of tangible user interfaces. Furthermore, the curriculum-focused design approach demonstrates how it's sometimes necessary to design both the technology and the social context of use.This article is part of a special issue on rapid prototyping.
Notes from HPPAC 2005
Authors: Barry Rountree, Robert Springer, David K. Lowenthal, Vincent W. Freeh
Venue: ACM SIGARCH Computer Architecture News (2005)

Power-aware computing has become popular over the last several years. Most research concerns saving energy in server or mobile systems. However, power-aware mechanisms recently have gained traction in the high-performance computing community.
An Efficient, Low-Cost Inconsistency Detection Framework for Data and Service Sharing in an Internet-Scale System
Authors: Yijun Lu, Hong Jiang, Dan Feng
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

In this paper, we argue that a broad range of Internet-scale distributed applications can benefit from an underlying low-cost consistency detection framework that is an alternative to inconsistency avoidance and can detect inconsistency among nodes sharing data or services in a timely manner. This paper first presents an overview of the inconsistency detection framework. Then, it discusses the detailed design of the two-layer inconsistency detection module, the core component of this framework, which can detect inconsistency among nodes in a timely manner. The proposed two-layer inconsistency detection module is evaluated both analytically and via simulations, which shows that this module can significantly reduce the time to detect inconsistency among nodes without adding much maintenance cost. Finally, this paper outlines the possible mechanisms to discern the application semantics and to resolve the detected inconsistencies.
An Area-Reduced Scheme for Modulo 2"-1 Addition/Subtraction
Authors: Shaoqiang Bi, Warren J. Gross, Wei Wang, Asim Al-Khalili, M. N. S. Swamy
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

In this paper, we present a versatile area-reduced scheme for modulo 2¿-1 adders and subtractors using a novel MUX-based increment/decrement algorithm. A FPGA-based comparison of the proposed modulo adder and the conventional modulo adder designs is carried out. The implementation results show that the proposed adder reduces the area close to 30% compared with the modulo adder of Bayoumi et al.. The delay and the power are also reduced around 10%. In addition, it is also shown that the proposed design requires less hardware resources than the parallel-prefix modulo adder of Kalampoukas et al. while providing a comparable operation speed.
P2I: An Innovative MDA Methodology for Embedded Real-Time System
Authors: A. Cuccuru, R. De Simone, T. Saunier, G. Siegel, Y. Sorel
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

This paper precent a new global MDA design methodology capable to bridge the gap between an abstract specification level and a heterogeneous architecture level while assisting real-time implementation. The P21 contribution is the result of a joint study on abstraction/refinement methods and optimized mapping on architecture within a UML based design tools suite including SCADE^TM Suite for formal verifications and SynDex for optimized distributed real- time implementation. The original points of this Mwk are: i) a specification methodology that handles the control flow and the data,flow representation, including efficient verifications, ii) a method jbr parallelism exploration bused on obstruct resoairces/Pei~tbriiiance estimtrtion iii) u HW/SW mapping approach that refines the specification into explicit WW configurations and the associated SW until executable distributed real-time code. The P21 framework shows how a cooperation qf complementary methodologies and CAD tools associated wifh a relevant architecture can significantly improve the designer productivity, especially in the context of co-modelling for Embedded Design.
Feature-Based Detection of Facial Landmarks from Neutral and Expressive Facial Images
Authors: Yulia Gizatdinova, Veikko Surakka
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

Feature-based method for detecting landmarks from facial images was designed. The method was based on extracting oriented edges and constructing edge maps at two resolution levels. Edge regions with characteristic edge pattern formed landmark candidates. The method ensured invariance to expressions while detecting eyes. Nose and mouth detection was deteriorated by happiness and disgust.
Issues in Developing a Commercial Parcel Reading System
Authors: Michiel de Rijcke, Marija Bojovic, Wouter Homan, Martijn Nuijt
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we present a real time operational parcel reader from an image processing perspective. We will discuss the various difficulties that had to be dealt with to read the addresses on parcels. Main focus will be on the techniques to overcome two specific difficulties, the location of the address block and the occurrence of sender errors. The system presented was developed and implemented last year and since then it is up and running.
Scalable internet threat monitoring
Authors: Stefan Savage
Venue: Proceedings of the 2005 ACM workshop on Rapid malcode (2005)

In the time is takes to read this sentence, the Slammer worm was able to probe over a hundred million Internet hosts. Worse, this attack was both trivial and unsophisticated. Indeed, the ability to easily compromise tens of thousands of Internet hosts has emerged as the backbone of a criminal economy that includes SPAM, denial-of-service extortion, phishing, piracy and on-line identity theft. Keeping up with such prodigious speed and such broad reach continues to present new challenges for network monitoring and defense. This talk focuses on these scaling challenges in the context of two concrete systems: Earlybird - a line-rate system for automatically inferring signatures for new network worms in seconds, and Potemkin - a high-fidelity honeyfarm system designed to efficiently scale to millions of live hosts.
An access control model for querying XML data
Authors: Sabrina De Capitani di Vimercati, Stefania Marrara, Pierangela Samarati
Venue: Proceedings of the 2005 workshop on Secure web services (2005)

In the last few years, an increasing amount of si-structured data have become available electronically to humans and programs. In such a context, XML is rapidly erging as the new standard for si-structured data representation and exchange on the Internet. Securing XML data is then becoming increasingly important and several attpts at developing methods for securing XML data have been proposed. However, these proposals do not take into consideration scenarios where users want to query XML data by using complex query language.In this paper, we propose an extension to our previous access control model handling the new standard query language XQuery, which is a powerful and convenient language designed for querying XML data.
A High-Throughput Adaptive Computing Infrastructure for Bioinformatics Research
Authors: Stuart Pineo, Zhengyu Wang
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

To support our company's bioinformatics research and product development we developed the Celera Computing Analysis Pipeline Infrastructure (CCAPI). The N-tiered architecture, which includes a Web based user interface, an Oracle database, and a network of hundreds of CPUs, allows us to perform complex and compute-intensive data processing and analysis on genomic content in a cost-effective way. Developed using Perl, Java/JSP, Oracle's AQ and Platform LSF, CCAPI creates an adaptive and scalable computing framework that supports task decomposition and parallelization, optimizes computing resource allocation, facilitates the integration of proprietary and third-party applications, and supports automatic error detection and recovery.
Exponential-RED: a stabilizing AQM scheme for low- and high-speed TCP protocols
Authors: Shao Liu, Tamer Başar, R. Srikant
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

This paper introduces and analyzes a decentralized network congestion control algorithm which has dynamic adaptations at both user ends and link ends, a so-called general primal-dual algorithm. We obtain sufficient conditions for local stability of this algorithm in a general topology network with heterogeneous round-trip delays. Then, as an implementation of this algorithm in the Internet, we introduce an AQM (Active Queue Management) scheme called Exponential-RED (E-RED), which outperforms RED and is inherently stable when combined with TCP-Reno or its variants for high-speed networks.
Encoded LED System for Optical Trackers
Authors: Leonid Naimark, Eric Foxlin
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

Since introducing a hybrid vision-inertial tracker using passive fiducial markers, we have encountered several applications in which the use of encoded LEDs would be preferable to paper fiducials. This includes small-scale applications requiring higher precision, and applications where the size of the target, or the range of viewing angles, or operation in the dark is important. We present a novel technique to encode LEDs without any need for synchronization between the LEDs and cameras. By using amplitude modulation codes instead of blinking binary codes, the LED is always on, and can therefore be tracked after it has been decoded at an arbitrary or even non-periodic frame rate with no missed data.
Subset selection procedures with special reference to the analysis of two-way layout: application to motor-vehicle fatality data
Authors: Shanti S. Gupta, Jason C. Hsu
Venue: ACM SIGSIM Simulation Digest (1978)

In this paper, the origin of selection and ranking problems is discussed. Then the two basic approaches to the selection problem - the indifference zone approach and the subset selection approach - are reviewed briefly. As an application, Gupta's subset selection procedure is applied to motorvehicle fatality data which fits into a two-way layout.
On Overlay Schemes to Support Point-in-Range Queries for Scalable Grid Resource Discovery
Authors: Liping Chen, K. Selcuk Candan, Junichi Tatemura, Divyakant Agrawal, Dirceu Cavendish
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

A resource directory is a critical component of a Grid architecture. P2P computing paradigm could address some of the scalability issues that make distributed resource discovery services challenging. Unfortunately, most existing Distributed Hash Table (DHT) based P2P overlays have difficulty in treating attribute range queries that are common in resource discovery lookups. This paper proposes a general framework for range-based resource discovery. In particular, the proposed framework maps tree-structured logical data (i.e., range indexing) onto a DHT-based physical node space (i.e., resource brokers). In this paper, we consider three mapping schemes from the logical space onto the physical space. Each mapping scheme uses a different replication mechanism to reduce range search time and to achieve load balance. We analytically and experimentally compare the performance characteristics (query/update costs and workload distributions) of these schemes and discuss their applicability under different resource discovery service scenarios.
A Technique for Simultaneous Multiple Tag Identification
Authors: Vijay Pillai, Rene Martinez, John Bleichner, Katherine Elliot, Shashi Ramamurthy, K. V. S. Rao
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

We present for the first time ever, a technique for simultaneously decoding multiple tag responses (i.e. a collision). Additionally the technique provides a considerable degree of robustness and alleviates the problem of missed tags. A theoretical discussion of the underlying principle is done. We provide simulation results when this technique is used specifically for the EPC Gen 2 protocol; the resultant increase in identification rate is 20% when two tag signals are simultaneously decoded and 30% when three tag signals are simultaneously decoded. Experimental results presented show that the extracted individual tag signals (when there is a collision of two or more tag responses) are virtually identical to the single tag signal. We believe that the signal extraction technique discussed here will eventually be a standard feature of all base stations.
Algorithms and implementations for differential elimination
Authors: Allan Wittkopf
Venue:  (2005)

The primary focus of this work is the design and implementation of efficient differential elimination algorithms. Such algorithms use a finite number of differentiations and elimination to simplify over-determined systems of ordinary and partial differential equations (ODE and PDE) to a more tractable form. They can be used in exact solution methods for ODE and PDE systems, as a preprocessor for numerical solution of these systems, and for reduction of nonlinear PDE to linear PDE. Differential elimination algorithms have been implemented to date in a number of symbolic languages, and although these algorithms are finite in theory, in practice, their complexity puts many interesting problems out of reach. We enlarge the class of problems which can be completed, by which we mean simplified to a form satisfying certain theoretical properties (canonical form in the linear case, and a form that yields an existence and uniqueness theorem in the nonlinear case). Additionally we provide means of obtaining partial information (in some cases the most relevant information) for many problems that cannot be completed. Differential elimination relies heavily on other algorithms, such as computation of multi-variate polynomial greatest common divisors ( GCDs). As a result, significant contributions have also been made in this area. These include enhanced versions of known algorithms for computing multivariate polynomial GCDs for both dense (many terms for the given degree) and sparse (few terms for the given degree) polynomials. The differential elimination algorithms have been implemented in the symbolic mathematics language Maple, and one in the compiled language C. We demonstrate their effectiveness on problems from symmetry analysis. The GCD algorithms have been implemented in Maple, and we provide a detailed asymptotic comparison of these algorithms with Maple's primary GCD algorithm, and a well known algorithm for dense polynomial problems.
A comparative study of Markovian and variational image-matching techniques in application to mammograms
Authors: Frédéric J. P. Richard
Venue: Pattern Recognition Letters (2005)

In this paper, we focus our interest on the image-matching problem. This major problem in Image Processing has received a considerable attention in the last decade. However, contrarily to other image-processing problems such as image restoration, the image-matching problem have been mainly tackled using a single approach based on variational principles. In this paper, our motivation is to investigate the feasibility of another famous image-processing approach based on Markov random fields (MRF). For that, we propose a discrete and stochastic image-matching framework which is equivalent to an usual variational one and suitable for an MRF-based approach. In this framework, we describe multigrid implementations of two algorithms: an iterated conditional modes (ICM) and a simulated annealing. We apply these algorithms for the registration of mammograms and compare their performances to those of an usual variational algorithm. We come to the conclusion that MRF-based techniques are optimization techniques which are relevant for the mammogram application. We also point out some of their specific properties and mention interesting perspectives offered by the Markovian approach.
Enhancing Web Services Availability
Authors: Subil Abraham, Mathews Thomas, Johnson Thomas
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Little work has been reported on highly available web services which are essential for mission critical applications. In this paper we propose an architecture for highly available web services for mission critical applications. The central idea is the enhancement of web services by the introduction of a central hub to increase the availability of web services.
Making Logistic Regression a Core Data Mining Tool with TR-IRLS
Authors: Paul Komarek, Andrew W. Moore
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Binary classification is a core data mining task. For large datasets or real-time applications, desirable classifiersare accurate, fast, and need no parameter tuning. We present a simple implementation of logistic regression that meets these requirements. A combination of regularization, truncated Newton methods, and iteratively re-weighted least squares make it faster and more accurate than modern SVM implementations, and relatively insensitive to parameters. It is robust to linear dependencies and some scaling problems, making most data preprocessing unnecessary.
Using program specialization to speed SystemC fixed-point simulation
Authors: Stephen A. Edwards
Venue: Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation (2006)

Generic simulation components, such as fixed-precision arithmetic routines, make it easier to quickly assemble system simulations, but generic components tend to simulate more slowly than their manually-written specialized counterparts. So a system modeler is normally forced to choose between building a simulation quickly or running it quickly.This paper explores the use of program specialization as a way to address this conundrum. Through hints provided by the author of a generic library and aggressive compiler optimizations, program specialization can automatically rewrite a generic component into a specialized one with performance comparable to a careful manual implementation. As a result, the user of such a specializable library can quickly assemble a simulation from generic components whose performance can equal that of a more tedious implementation.Experimental results show that program specialization provides a three- to seven-times speed-up on an important class of simulations: signal processing kernels in SystemC that manipulate fixed-precision numbers.
A Power-Aware Multicast Routing Protocol forMobile Ad Hoc Networks with Mobility Prediction
Authors: Nen-Chung Wang, Yu-Li Su
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

A mobile ad hoc network (MANET) is a dynamically reconfigurable wireless network that does not have a fixed infrastructure. Due to the high mobility of nodes, the network topology of MANETs changes very fast, making it more difficult to find the routes that message packets use. Because mobile nodes have limited battery power, it is therefore very important to use energy in a MANET efficiently. In this paper, we propose a power-aware multicast routing protocol (PMRP) with mobility prediction for MANETs. In order to select a subset of paths that provide increased stability and reliability of routes, in routing discovery, each node receives the RREQ packet and uses the power-aware metric to get in advance the power consumption of transmitted data packets. If the node has enough remaining power to transmit data packets, it uses the global positioning system (GPS) to get the location information (i.e. position, velocity and direction) of the mobile nodes and utilizes this information to calculate the link expiration time (LET) between two connected mobile nodes. During route discovery, each destination node selects the routing path with the smallest LET and uses this smallest link expiration time as the route expiration time (RET). The destination nodes collect several feasible routes and then selects the path with the longest RET as the primary routing path. Then the source node uses these routes between the source node and each destination node to create a multicast tree. In the multicast tree, the source node will be the root node and the destination nodes will be the leaf nodes. Simulation results show that the proposed PMRP outperforms MAODV.
How Well Can Simple Metrics Represent the Performance of HPC Applications?
Authors: Laura C. Carrington, Michael Laurenzano, Allan Snavely, Roy L. Campbell, Larry P. Davis
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

In this paper, a systematic study of the effects of complexity of prediction methodology on its accuracy for a set of real applications on a variety of HPC systems is performed. Results indicate that the use of any single, simple synthetic metric to predict performance does an inadequate job, and the use of a linear combination of these simple metrics with optimized weights also performs poorly. Better, however, are methodologies that rely on the convolution of an application "transfer function" based on tracing information with system performance data measured by simple benchmarks. This latter methodology can predict performance with an average accuracy of 80%, based on the current work.