ppxscal/embedding_network huggingface dataset:
Tracking Deforming Objects Using Particle Filtering for Geometric Active Contours
Authors: Yogesh Rathi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Tracking deforming objects involves estimating the global motion of the object and its local deformations as a function of time. Tracking algorithms using Kalman filters or particle filters have been proposed for finite dimensional representations of shape, but these are dependent on the chosen parametrization and cannot handle changes in curve topology. Geometric active contours provide a framework which is parametrization independent and allow for changes in topology. In the present work, we formulate a particle filtering algorithm in the geometric active contour framework that can be used for tracking moving and deforming objects. To the best of our knowledge, this is the first attempt to implement an approximate particle filtering algorithm for tracking on a (theoretically) infinite dimensional state space.
An Efficient Algorithm For The Inverse ST Problem
Authors: Ge Nong, Sen Zhang
Venue: Proceedings of the 2007 Data Compression Conference (2007)

The Schindler Transform (ST) [1] can speed up the block sorting phase of the Burrows- Wheeler Transform (BWT) by limiting the context sorting to the first k (k ¸ [0,N], where N is the length of the text) positions only. Under the STfs partial sorting scheme, if two rows share the exactly same k-order context, they may not be ordered alphabetically; instead, the relative order between them in the original matrix is preserved in the transformed matrix.
Scalable Access Control ForWeb Services
Authors: Gayatri Swamynathan, Tyler Close, Sujata Banerjee, Rick McGeer
Venue: Proceedings of the Fifth International Conference on Creating, Connecting and Collaborating through Computing (2007)

Controlling access to a large distributed service is a potentially error prone process that may negatively impact request throughput and usability. Our Authorization-Based Access Control (or ABAC) URL rewriter solves this problem by providing locally verifiable authorizations and delegation tracking compatible with common web tools. Our access control mechanism is reusable, distributed and meets the scaling requirements of large distributed services. We demonstrate the successful operation of our proposed mechanism on HP's real-time network monitoring and measurement web service, S^3.
Information geometry of topology preserving adaptation
Authors: M. K. Sonmez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

We consider adaptation by topologically smooth transformations with applications to environment and speaker adaptation for robust speech recognition. Specifically, the tradeoff between global affine transformations that fail to capture local variation but preserve topology and local class dependent bias transformations that have more resolution but may destroy the topology of the reference model is addressed. We cast the problem of topology preservation of the reference model in an information divergence geometry framework and derive a class of alternating minimization algorithms that aims to preserve topology explicitly during adaptation.
Component-based Data Layout for Efficient Slicing of Very Large Multidimensional Volumetric Data
Authors: Jusub Kim, Joseph JaJa
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

In this paper, we introduce a new efficient data layout scheme to efficiently handle out-of-core axis-aligned slicing queries of very large multidimensional volumetric data. Slicing is a very useful dimension reduction tool that removes or reduces occlusion problems in visualizing 3-D/4-D volumetric data sets and that enables fast visual exploration of such data sets. We show that the data layouts based on typical space-filling curves are not optimal for the out-of-core slicing queries and present a novel component-based data layout scheme for a specialized problem domain, in which it is only required to provide fast slicing at every k-th value, for any k \ge 1. Our component-based data layout scheme provides much faster processing time for any axis-aligned slicing direction at every k-th value, k \ge 1, requiring less cache memory size and without any replication of data. In addition, the data layout can be generalized to any high dimension.
Mega-widgets in Tcl/Tk: evaluation and analysis
Authors: Shannon Jaeger
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

This paper presents a framework for evaluating Tk mega-widget extensions. This framework addresses how these extensions perform, both from the application builder's view of created widgets as well as from the viewpoint of the mega-widget builder. Issues addressed include support for building Tk-like widgets, access to component widgets, and reuse of previous widget implementations. Several existing mega-widget extensions are then evaluated using the framework.
Evaluating Heuristic Optimization Phase Order Search Algorithms
Authors: Prasad A. Kulkarni, David B. Whalley, Gary S. Tyson
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Program-specific or function-specific optimization phase sequences are universally accepted to achieve better overall performance than any fixed optimization phase ordering. A number of heuristic phase order space search algorithms have been devised to find customized phase orderings achieving high performance for each function. However, to make this approach of iterative compilation more widely accepted and deployed in mainstream compilers, it is essential to modify existing algorithms, or develop new ones that find near-optimal solutions quickly. As a step in this direction, in this paper we attempt to identify and understand the important properties of some commonly employed heuristic search methods by using information collected during an exhaustive exploration of the phase order search space. We compare the performance obtained by each algorithm with all others, as well as with the optimal phase ordering performance. Finally, we show how we can use the features of the phase order space to improve existing algorithms as well as devise new, and better performing search algorithms.
Spline kernels for continuous-space image processing
Authors: S. Horbelt
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

We present an explicit formula for spline kernels; these are defined as the convolution of several B-splines of variable widths h/sub i/ and degrees n/sub i/. The spline kernels are useful for continuous signal processing algorithms that involve B-spline inner-products or the convolution of several spline basis functions. We apply our results to the derivation of spline-based algorithms for two classes of problems. The first is the resizing of images with arbitrary scaling factors. The second is the computation of the Radon transform and of its inverse. In particular, we present a new spline-based version of the filtered back-projection algorithm for tomographic reconstruction. In both cases, our explicit kernel formula allows for the use of high-degree splines; these offer better approximation performance than the conventional lower-order formulations (e.g., piecewise constant or piece-wise linear models).
Observations on greedy composite Newton methods
Authors: Thian-Peng Ter, Matthew W. Donaldson, Raymond J. Spiteri
Venue: Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (2007)

The only robust general-purpose numerical methods for approximating the solution to systems of nonlinear algebraic equations (NAEs) are based on Newton's method. Many variants of Newton's method exist in order to take advantage of problem structure; it is often computationally infeasible to solve a given problem without taking some advantage of this structure. It is generally impossible to know a priori which variant of Newton's method will be optimal for a given problem. In this paper, we describe an algorithm for automatically selecting a composite Newton method, i.e., a sequential combination of Newton variants, for solving NAEs. The algorithm is based on a greedy principle that updates the current state at regular intervals according to the best performing Newton variant. Preliminary results show that it is possible for composite Newton methods to outperform optimal classical implementations of Newton's method, i.e., ones that only use one Newton variant on a given problem.
RDF-based Model for Encoding Document Hierarchies
Authors: Ma. Auxilio Medina, J. Alfredo Sanchez
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

Some document clustering tools automatically or semiautomatically produce document hierarchies. Commonly, they are stored as text or graphical files. As a result, applications are not able to use them before some kind of processing. A more recent representation of document hierarchies employs Extensible Markup Language. However, the reusability of this representation is diminished because the semantic of XML elements is not machine accessible. This paper proposes the use of a Resource Description Framework Model to overcome these drawbacks.
Failure Recovery in Cooperative Data Stream Analysis
Authors: Bin Rong, Fred Douglis, Cathy H. Xia
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

We present a failure recovery framework for System S, a large-scale stream data analysis environment. It is intended to support multiple sites, which have their own local administration and goals. However, it is beneficial for these sites to cooperate with each other, especially in the presence of various failures. Our ultimate goal is to support automatic, timely failure recovery through cooperation among sites. We identify the unique challenges in the context of System S and present our initial design work. In particular, we consider a backup selection problem, specifying where to recover failed jobs, which we formulate as an optimization problem. We present an approximation algorithm together with empirical results obtained through simulations. Our numerical evaluations show that the proposed approximation algorithm is very efficient and effective compared to the optimal solutions. It exhibits a promising empirical performance ratio that is close to the theoretical limit of polynomial approximations of such a problem.
DSP implementation and performance evaluation of sparse-tap adaptive FIR filters with tap-position control
Authors: A. Hirano
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper presents the implementation and performance evaluation of sparse-tap adaptive FIR filters with tap-position control. For the reduction of computational costs, a small number of filter coefficients are assigned to significant regions in the impulse response. A floating-point digital signal processor (DSP) ADSP-21020 is used for the implementation. For one second of end-to-end delay and 32 milliseconds of total significant-region length, the number of computations is reduced to almost one-tenth compared with a full-tap FIR adaptive filter using the same DSP. Experimental results using a telephone network simulator show that the implemented echo canceller reduces the echo by almost 20 dB for both white-noise and real speech signals. Tracking performance for phase rolls and flat-delay changes is also examined.
Design and Stability Analysis of Fuzzy Model-based Predictive Control&mdash;A Case Study
Authors: Sašo Blažič, Igor Škrjanc
Venue: Journal of Intelligent and Robotic Systems (2007)

In the paper a fuzzy model based predictive control algorithm is presented. The proposed algorithm is developed in the state space and is given in analytical form, which is an advantage in comparison with optimisation based control schemes. Fuzzy model-based predictive control is potentially interesting in the case of batch reactors, heat-exchangers, furnaces and all the processes with strong nonlinear dynamics and high transport delays. In our case it is implemented to a continuous stirred-tank simulated reactor and compared to optimal PI control. Some stability and design issues of fuzzy model-based predictive control are also given.
Sketchy hairstyles
Authors: X. Mao, S. Isobe, K. Anjyo, A. Imamiya
Venue: Proceedings of the Computer Graphics International 2005 (2005)

We present an intuitive, interactive modeling and rendering system for creating non-photorealistic hairstyle images. The main feature of our system lies in its user-friendly sketch interface that allows the user to generate his/her desired hairstyle simply by drawing a few free-form strokes on the 3D model of a scalp. Hairstyles are modeled with a polygon based technique called cluster polygons, and are rendered expressively to obtain non-photorealistic images similar to those found in hand-drawn animations and cartoons.
Symbolic Road Perception-based Autonomous Driving in Urban Environments
Authors: M. Foedisch, R. Madhavan, C. Schlenoff
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

Our previous work on road detection for autonomous road vehicles suggests the usage of high-level symbolic knowledge about the road structure. In this paper1, we present our new approach to symbolic road recognition. We explain feature extraction, model representation, and the tree search-based matching processes and discuss perfor- mance evaluation results.
Identification of noncausal nonminimum phase AR models using higher-order statistics
Authors: H. Tora
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

In this paper, we address the problem of estimating the parameters of a noncausal autoregressive (AR) signal from estimates of the higher-order cumulants of noisy observations. The proposed family of techniques uses both 3rd-order and 4th order cumulants of the observed output data. Consequently, at low SNR, they provide superior performance to methods based on autocorrelations. The measurement noise is assumed to be Gaussian and may be colored. The AR model parameters here are directly related to the solution of a generalized eigenproblem. The performance is illustrated by means of simulation examples.
Extensible Contract Broker for Performance Differentiation
Authors: Pedro Furtado, Celso Santos
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

We denote as Self-properties the control a system exerts on itself autonomically to achieve and maintain Quality-of-Service (QoS). Our focus is in external, non-intrusive approaches and in this paper we focus mainly timeliness objectives. The self-adaptation process must be guided by the specification of the desired qualities. In this paper we describe the design of a Contract-Broker (C-Broker) architecture for implementing Quality-of-Service features and Selfproperties. We also show how basic QoS features were implemented in C-Broker. Our approach involved dynamic XML specifications for required parameters.
Fault Models and Device Yield of a Large Population of Room Temperature Operation Single-Electron Transistors
Authors: Daniel Mazor, Michael L. Bushnell, David J. Mulligan, Richard J. Blaikie
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

We improved Smith and Ahmed's nanowire singleelectron transistor (SET) to change its operating temperature from 4.2oK to room temperature. We made more than 1000 nanotechnology SETs on the fabrication line. We characterized their faults, the yield, the dependence of faults on the process, and the correlation between channel width and faults. We improved the SET process recipe. SETs are made on silicon-on-insulator (SOI) wafers using an E-beam lithography machine (the Raith 150) to create two L-shaped trenches in the Si; these are etched through to the SiO2 insulating layer using reactive ion etching (RIE). After process improvements, our yield was 24.3% working SETs, of which 79.4% had significant Coulomb oscillations at room temperature. Also, 20.6% of the SETs had stuck-open transistors, 50.7% had resistive bridges, and 4.4% had gross defects, from severe fabrication line contamination.
A multimedia-workshop learning environment for statics
Authors: S. M. Holzer, R. H. Andruet
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

We are developing a cooperative learning environment in the subject area of statics that combines hands-on experiments with interactive multimedia in the framework of experiential learning. The project is part of the National Science Foundation's Southeastern University and College Coalition for Engineering Education (SUCCEED), which is committed to a comprehensive revitalization of undergraduate engineering education for the 21st Century. We discuss elements of the workshop environment and illustrate how students are guided through the four stages of experiential learning to discover the method of joints for the analysis of trusses.
Towards On-Demand Ubiquitous Metascheduling on Computational Grids
Authors: J. M. Alonso, V. Hernandez, G. Molto
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Grid Computing Technologies are mature enough to be successfully applied to computationally intensive sci- entific applications. However, the current process of applying Grid Computing to them is still hard and difficult for the least experienced users. In this pa- per we describe the adaptations made to the GMarte metascheduling framework in order to provide an ubiq- uitous access to its functionality as an efficient re- source broker for the execution of tasks on computa- tional Grids. A metascheduling component accessible by only means of a Java-enabled web browser has been developed, requiring almost zero configuration by the client. This approach has enabled to produce a generic multi-platform metascheduler which can be automati- cally deployed in the clients interested in resource bro- kering on computational Grids based on the Globus Toolkit.
Using optical flow for step size initialisation in hand tracking by stochastic optimisation
Authors: Desmond Chik
Venue: Proceedings of the HCSNet workshop on Use of vision in human-computer interaction - Volume 56 (2006)

In this paper we use optical flow to initialise step sizes in a stochastic optimisation setting for hand tracking. One can appreciate that most complex hand gestures result in different segments of the hand moving at different speeds. We show that by reflecting this motion difference in our step size initialisation process, the tracking performance can be improved. Significant improvement to tracking accuracy has been observed for gripping motions of the hand.
Path invariants
Authors: Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, Andrey Rybalchenko
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

The success of software verification depends on the ability to find a suitable abstraction of a program automatically. We propose a method for automated abstraction refinement which overcomes some limitations of current predicate discovery schemes. In current schemes, the cause of a false alarm is identified as an infeasible error path, and the abstraction is refined in order to remove that path. By contrast, we view the cause of a false alarm -the spurious counterexample- as a full-fledged program, namely, a fragment of the original program whose control-flow graph may contain loops and represent unbounded computations. There are two advantages to using such path programs as counterexamples for abstraction refinement. First, we can bring the whole machinery of program analysis to bear on path programs, which are typically small compared to the original program. Specifically, we use constraint-based invariant generation to automatically infer invariants of path programs-so-called path invariants. Second, we use path invariants for abstraction refinement in order to remove not one infeasibility at a time, but at once all (possibly infinitely many) infeasible error computations that are represented by a path program. Unlike previous predicate discovery schemes, our method handles loops without unrolling them; it infers abstractions that involve universal quantification and naturally incorporates disjunctive reasoning.
Intercepting and instrumenting COM applications
Authors: Galen C. Hunt, Michael L. Scott
Venue: Proceedings of the 5th conference on USENIX Conference on Object-Oriented Technologies & Systems - Volume 5 (1999)

Binary standard object models, such as Microsoft's Component Object Model (COM) enable the development of not just reusable components, but also an incredible variety of useful component services through run-time interception of binary standard interfaces. Interception of binary components can be used for conformance testing, debugging, profiling, transaction management, serialization and locking, cross-standard middleware interoperability, automatic distributed partitioning, security enforcement, clustering, just-in-time activation, and transparent component aggregation. We describe the implementation of an interception and instrumentation system tested on over 300 COM binary components, 700 unique COM interfaces, 2 million lines of code, and on 3 major commercial-grade applications including Microsoft PhotoDraw 2000. The described system serves as the foundation for the Coign Automatic Distributed Partitioning System (ADPS), the first ADPS to automatically partition and distribute binary applications. While the techniques described in this paper were developed specifically for COM, they have relevance to other object models with binary standards, such as individual CORBA implementations.
Educational revolution in Norway?
Authors: T. Clausen
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

In Norway, the National Assembly, the Government and the dominating employer and employee organizations apparently work together to prepare a Law on Continuing Education or Lifelong Learning. This effort is driven by the wish to meet world competition on the terms of a small country to maintain the level of the welfare society of today. A recent Telemark pilot project among small and middle-sized firms tends to confirm the need for such action, and that the time may be well chosen. If the National Assembly passes such a Law, the universities and colleges will have to face new and interesting challenges. 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
Twelve Billion Bargaining Chips: The Web Side of the Net Neutrality Debate
Authors: Daniel J. Weitzner
Venue: IEEE Internet Computing (2007)

Web users have a unique set of interests at stake in the Net neutrality debate, but they also have unexploited bargaining chips in the form of the Web pages they run.