ppxscal/embedding_network huggingface dataset:
Application of EM algorithm to adaptive filter for multiple target tracking
Authors: Jeong-Ho Park
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Tracking the targets of interest has been one of the major research areas in radar surveillance systems. We formulate the tracking problem as an incomplete data problem and apply the EM algorithm to obtain the MAP estimate. The resulting filter has a recursive structure analogous to the Kalman filter. The difference is that the measurement-update deals with multiple measurements and the parameter-update can estimate the system parameters. Through extensive experiments, it turns out that the proposed system is better than the probabilistic data association filter (PDAF) and NNF in tracking the targets. Also, the performance degrades gracefully as the disturbances become stronger.
Cost-aware resource management for decentralized internet services
Authors: Emin Gun Sirer
Venue:  (2007)

Decentralized network services, such as naming systems, content distribution networks, and publish-subscribe systems, play an increasingly critical role and are required to provide high performance, low latency service, achieve high availability in the presence of network and node failures, and handle a large volume of users. Judicious utilization of expensive system resources, such as memory space, network bandwidth, and number of machines, is fundamental to achieving the above properties. Yet, current network services rely on ad hoc mechanisms and heuristic based techniques to manage scarce resources and, consequently, fall short of expectations. This thesis presents a principled approach for building high performance, robust, and scalable network services. The key contribution of this thesis is to show that near-optimal resolution of the fundamental cost-benefit tradeoff between resource consumption and performance through mathematical optimization enables network services to meet system-wide performance goals efficiently. This thesis develops a practical approach for near-optimal resource management in three stages: analytically model the cost-performance tradeoff as a constrained optimization problem, determine a near-optimal resource allocation strategy on the fly, and enforce the derived strategy through light-weight, decentralized mechanisms. It builds on self-organizing structured overlays, which provide failure resilience and scalability, and complements them with stronger performance guarantees and robustness under sudden changes in workload. This work enables applications to meet system-wide performance targets, such as low average response times, high cache hit rates, and small update dissemination times with minimal resource consumption. Alternatively, applications can make the best use of available resources, such as storage and bandwidth, and derive maximum advantage in performance. I have implemented an extensible framework called Honeycomb to perform near-optimal resource management on structured overlays based on the above approach and built three critical network services using it. These services consist of a new name system for the Internet called CoDoNS that distributes data associated with domain names, an open-access content distribution network called CobWeb that caches web content for faster access by users, and an online information monitoring system called Corona that notifies users about changes to web pages. Simulations and performance measurements from a planetary-scale deployment show that these services provide unprecedented performance improvement over the current state of the art.
Adaptive Workflow Support for Search Processes within Fire Service Organisations
Authors: Andrea Fressmann
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

This paper presents a brief overview about the European R&D project AMIRA (Advanced Multimodal Intelligence for Remote Assistance) focused on information support for time critical processes in fire service organisations. This paper presents a requirement analysis which has analysed what the actual needs of end-user in those organisations are. Based on that, the need for an information system is concluded, which enables search processes as short term workflows to cope with time critical processes in incident grounds.
Recursive Least Square and Fuzzy Modelling Using Genetic Algorithm for Process Control Application
Authors: Ribhan Zafira Abdul Rahman, Rubiyah Yusof, Marzuki Khalid
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

A technique for the modelling of nonlinear process control using Recursive Least Square and Takagi-Sugeno Fuzzy System with Genetic Algorithm topology is described. This paper discusses the identification of parameters of the fuzzy sets at the antecedent part and linear model at the consequent part of fuzzy model within an application to process control. The key issues of finding the best model of the process are described. Results show that fuzzy model with genetic algorithm gives minimum mean squared error compare with recursive least square.
Application of state space frequency estimation techniques to radar systems
Authors: P. Gulden
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Many applications for FMCW radar systems require the resolution of several closely spaced frequencies. In general the Fast Fourier Transform (FFT) is used for spectrum estimation, despite the inherent resolution problems. To overcome the resolution limitation the state space approach has been proposed by Rao and Arun (1992), Marple (1988) and Kay (1988). However, most experimental results in the above papers are based on simulations. This paper points out the differences of the "real world" signal structure to simulated signals, and describes the problems posed by real radar signals. For one of the key steps of the state space algorithm, model order selection, a novel algorithm based on a posteriori analysis is introduced. The feasibility of the new approach is verified with an actual 24 GHz level gauging FMCW radar system. Our approach yields stable and accurate results with a resolution approximately three times higher than the FFT resolution.
On designing a database for integrated user management: pitfalls and possibilities
Authors: Amy LaMeyer, Shankaranarayanan Ganesan, Jesper M. Johansson
Venue: Proceedings of the 3rd conference on Large Installation System Administration of Windows NT - Volume 3 (2000)

Decisions on implementing IT systems have often been departmental or isolated in nature. As a result many organizations now are faced with the challenge of integrating different networks and computers (in different departments or possibly even within each), each managed by a different operating system, and each running different types of applications. In the last decade all organizations have understood the importance of integrating the different systems and applications. While practitioners and researchers have proposed and implemented several methods for integrating systems, applications, and data, one area has been and continues to be difficult to integrate - user accounts. In this paper we present an approach to integrate user account information from several systems. This approach is interesting for several reasons. First it is not specific to managing users on a particular system and is general enough to be used in an integrated environment that includes several systems of different types. Second, it is easily scalable to include applications and networks that have users and need user management. Third, it is simple and easy to understand and implement. The approach results in a database of user accounts that can be queried for specific users, groups, and so on. The design can be implemented in any relational database, or for example in the Windows 2000 Active Directory to take advantage of the fact that it already tracks user accounts and related information.
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
Authors: Jagat Patel, John W. Chinneck
Venue: Mathematical Programming: Series A and B (2007)

The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branching variable selection rely on estimating the effect of the candidate variables on the objective function. We present a new approach that relies on estimating the impact of the candidate variables on the active constraints in the current LP relaxation. We apply this method to the problem of finding the first feasible solution as quickly as possible. Empirical experiments demonstrate a significant improvement compared to a state-of-the art commercial MIP solver.
Extending a Secure Autonomous Bootstrap Mechanism to Multicast Security
Authors: Nobuo Okabe, Shoichi Sakane, Kazunori Miyazawa, Ken'ichi Kamada
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

There are many kinds of control systems, which have been used in industry area, such as Process Automation (PA) and Factory Automation (FA). They have numerous sensors and actuators called field devices in their networks, and are introducing Internet Protocol (IP) as network technology. Network security is necessary to make the most of IP's capability. The authors have previously studied a security mechanism which can satisfy the restrictions required by control systems and a secure autonomous bootstrap mechanism which is based on the security mechanism. This paper 1 shows an extension of the bootstrap mechanism to support multicast security. The discussion in this paper excludes security of multicast routing protocols and admission control protocols, e.g. IGMP and MLD, because the subject of this paper and those protocols are orthogonal.
Self-heating-aware optimal wire sizing under Elmore delay model
Authors: Min Ni, Seda Ogrenci Memik
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Global interconnect temperature keeps rising in the current and future technologies due to self-heating and the adiabatic property of top metal layers. The thermal effects impact adversely both reliability and performance of the interconnect wire, shortening the interconnect lifetime and increasing the interconnect delay. Such effects must be considered during the process of interconnect design. In this paper, one important argument is that the traditional linear dependence between wire resistance and wire width is no longer adequate for high layer interconnects due to the adiabatic property of these wires. By using curve fitting technique, we propose a quadratic model to represent the resistance of interconnect, which is aware of the thermal effects. Based on this model and the Elmore delay model, we derived a linear optimal wire sizing formula in form of f (x) = ax + b. Compared to non-thermal-aware exponential wire sizing formula in form of f (x) = ae-bx, we observed a 49.7% average delay gain with different choices of physical parameters.
Learning model order from labeled and unlabeled data for partially supervised classification, with application to word sense disambiguation
Authors: Zheng-Yu Niu, Dong-Hong Ji, Chew Lim Tan
Venue: Computer Speech and Language (2007)

Previous partially supervised classification methods can partition unlabeled data into positive examples and negative examples for a given class by learning from positive labeled examples and unlabeled examples, but they cannot further group the negative examples into meaningful clusters even if there are many different classes in the negative examples. Here we proposed an automatic method to obtain a natural partitioning of mixed data (labeled data+unlabeled data) by maximizing a stability criterion defined on classification results from an extended label propagation algorithm over all the possible values of model order (or the number of classes) in mixed data. Our experimental results on benchmark corpora for word sense disambiguation task indicate that this model order identification algorithm with the extended label propagation algorithm as the base classifier outperforms SVM, a one-class partially supervised classification algorithm, and the model order identification algorithm with semi-supervised k-means clustering as the base classifier when labeled data is incomplete.
CARAT: a toolkit for design and performance analysis of component-based embedded systems
Authors: Egor Bondarev, Michel Chaudron, Peter H. N. de With
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Solid frameworks and toolkits for design and analysis of embedded systems are of high importance, since they enable early reasoning about critical properties of a system. This paper presents a software toolkit that supports the design and performance analysis of real-time component-based software architectures deployed on heterogeneous multi-processor platforms. The tooling environment contains a set of integrated tools for (a) component storage and retrieval, (b) graphics-based design of software and hardware architectures, (c) performance analysis of the designed architectures and, (d) automated code generation. The cornerstone of the toolkit is a performance analysis framework that automates composition of the individual component models into a system executable model, allows simulation of the system model and gives design-time predictions of key performance properties like response time, data throughput, and usage of hardware resources. We illustrate the efficiency of this toolkit on a Car Radio Navigation benchmark system.
Texture Atlas Generation for Inconsistent Meshes and Point Sets
Authors: Patrick Degener, Reinhard Klein
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

In order to compute texture atlases with low stretch and hardly visible texture seams existing texture mapping tools pose high demands on the quality of surface representations like consistent orientation, watertightness, or manifoldness which many models commonly used in day-to-day modeling practice fail to meet. In this paper we propose an approach that bridges the gap between requirements of high quality texture mapping tools and poor mesh connectivity of models used in practice. In the spirit of classical two-part mapping an intermediate proxy surface is created that can be pro- cessed by high quality texture mapping tools. The texture signal is transfered to the original geometry using a novel mapping technique. Avoiding a modification of the original geometry typi- cal problems of mesh repairing approaches like approxi- mation errors or feature corruption are circumvented. As our method poses almost no demands on connectivity it can also be applied to point clouds. Contrary to classical two- part mapping, the method requires little user-interaction. Its robustness and quality are demonstrated in several ex- amples.
Structures and strings
Authors: Robert Frank
Venue:  (2007)

A central question for linguistics is how strings and structures relate to one another. The majority of frameworks that exist today assume that the hidden structures contain complete information about word order. Hence, the theory of grammar is only a theory of the structure-generating component. However, it is possible to design a theory of grammar which views the structure-generating component as separate from the linearization component. As a result, structural descriptions can directly incorporate multi-dominance, and consequently eliminate the need for transformational devices like movement. Another benefit is that linearization can take into account any combination of structural, morpho-phonological and discourse features, paving the way for a word order typology in the style of Optimality Theory. This dissertation presents an analysis of basic word order typology in this formalism, and suggests that cross-linguistic frequency of word orders can be explained if constraints are viewed as priors for Bayesian iterative learning. Finally, it discusses the role of information structure and morpho-phonology for language-internal word order.
Intel SIM8-01: A Proto-PC
Authors: Zbigniew Stachniak
Venue: IEEE Annals of the History of Computing (2007)

The SIM8-01 prototyping board was introduced by Intel in 1972 as a low-cost hardware aid for the development of applications involving Intel's 8008 microprocessor. This article traces the SIM8-01's development at Intel and analyzes its impact on the formation of the first wave of worldwide microcomputer activities.
Semantic mapping using mobile robots
Authors: Gaurav S. Sukhatme
Venue:  (2006)

Robotic mapping is the process of automatically constructing an environment representation using mobile robots. We address the problem of semantic mapping, which consists of using mobile robots to create maps that represent not only metric occupancy but also other properties of the environment. Specifically, we develop techniques to build maps that represent mobility, navigability, and activity of the environment. In doing so, we also develop techniques which partially address two important cases in robotic mapping; dynamic environments and large-scale environments. Our approach to semantic mapping is to combine machine learning techniques with standard mapping algorithms. Supervised learning methods are used to automatically associate properties of space to the desired classification patterns. We present two methods, the first based on hidden Markov models and the second on support vector machines. Both approaches have been tested and validated in two problem domains: terrain mapping and activity-based mapping. For the most part, previous mobile robotics mapping research has concentrated on static environments. The explicit semantic identification of dynamic entities improves the accuracy of the localization and mapping processes. We extend the well-known occupancy grid approach to simultaneously maintain parallel occupancy grids for static and dynamic portions of the environment. A Bayesian inference mechanism is used to infer the map from sensed data and prior distributions on these grids. Finally, we address the problem of scale. Most previous mapping algorithms have been designed for small structured environments (e.g. indoor office-like spaces). Through robust outdoor localization, we provide initial solutions for mapping large urban spaces.
Spatial Sparsity Induced Temporal Prediction for Hybrid Video Compression
Authors: Gang Hua, Onur G. Guleryuz
Venue: Proceedings of the 2007 Data Compression Conference (2007)

In this paper we propose a new motion compensated prediction technique that enables successful predictive encoding during fades, blended scenes, tem- porally decorrelated noise, and many other temporal evolutions which force predictors used in traditional hybrid video coders to fail. We model reference frame blocks to be used in motion compensated prediction as consisting of two superimposed parts: One part that is relevant for prediction and another part that is not relevant. By performing prediction in a domain where the video frames are spatially sparse, our work allows the automatic isolation of the prediction-relevant parts. These are then used to enable better prediction than would be possible otherwise. Our sparsity induced prediction algorithm (SIP) generates successful predictors by exploiting the non-convex structure of the sets that natural images and video frames lie in. Correctly determining this non-convexity through sparse representations allows better performance in hybrid video codecs equipped with the proposed work.
Advances in the Pad++ zoomable graphics widget
Authors: Benjamin B. Bederson, James D. Hollan
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

We describe Pad++, a zoomable graphical sketchpad that we are exploring as an alternative to traditional window and icon-based interfaces. We discuss the motivation for Pad++, describe the implementation, and present some of the differences between Pad++ and the standard Tk Canvas widget.
Kernel and Application Integrity Assurance: Ensuring Freedom from Rootkits and Malware in a Computer System
Authors: Lifu Wang, Partha Dasgupta
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01 (2007)

Malware and rootkits are serious security vulnerabilities, and they can be designed to be resistant to anti-viral software, or even totally undetectable. This paper described a hierarchical trust management scheme, where the root of trust is in a non-tamperable hardware co-processor on a PCI bus. The hardware checks a part of the OS kernel for integrity which in turn checks other parts till we ensure the entire system is free of rootkits and viruses. Our system can detect illegal modifications to kernel, loadable kernel modules and user applications. It also provides a secure communication line for user interaction to enable legal software updates.
Transcoding of video into different encoding formats
Authors: T. Shanableh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

In this paper, transcoding of pre-encoded MPEG-1,2 video into lower bit rates is realized through altering the coding algorithm into H.261/H.263 standards with lower spatial resolutions. We extract and compose a set of candidate motion vectors, from the incoming bit stream, to comply with the encoding format of the output bit stream. For the spatial resolution reduction, we generate one motion vector out of a set of input motion vectors operating on the higher spatial resolution image. We discuss the impact of motion estimation refinement on the new motion vectors and show that for all cases a simple half-pixel refinement is sufficient for near-optimum results.
Dynamic Transition Refinement
Authors: Michael Köhler, Heiko Rölke
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Refinement of Petri nets is well suited for the hierarchical design of system models. It is used to represent a model at different levels of abstraction. Usually, refinement is a static concept. For many scenarios, however, it is desirable to have a more flexible form of refinement. For example in the context of service updates, e.g. version control in distributed systems, a mechanism for dynamic transition refinement is needed. The requirement of dynamic refinement at runtime is quite strong. Since we would like to redefine the system structure by itself, transition refinement cannot be implemented by a model transformation. Instead, an approach is needed which allows for dynamic net structures that can evolve as an effect of transitions firing. In previous work we introduced nets-within-nets as a formalism for the dynamic refinement of tokens. Here we consider an extension of nets-within-nets that uses special net tokens describing the refinement structure of transitions. Using this formalism it is possible to update refinements, introduce alternative refinements, etc. We present some formal properties of the extended formalism and introduce an example implementation for the tool Renew in the context of workflow modeling.