ppxscal/embedding_network huggingface dataset:
Application of blind second order statistics MIMO identification methods to the blind CDMA forward link channel estimation
Authors: Ph. Loubaton
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Blind channel estimation for periodic sequence DS-CDMA systems can be cast into the framework of "structured" blind estimation of multi-input/multi-output (MIMO) FIR systems, where the structure is imposed by the user's signatures. A possible approach to tackle this problem consists in looking for a structured solution to one of the so-called "blind" MIMO-FIR system identification techniques proposed previously. This is the approach undertaken, among others, by Wang and Poor (see IEEE Trans. on Communications, vol.46, no.1, p.92-103, 1998), who proposed an adaptation of the subspace method originally developed by Moulines et al. (see IEEE Trans. on Signal Processing, vol.43, no.2, p.516-25, 1995) for single-input multiple outputs (SIMO) FIR systems, and later extended by Abed-Meraim et al. (see IEEE Trans. on Information Theory, vol.43, no.2, p.499-511, 1997) to MIMO-FIR systems. In this article, we follow this approach to consider the particular blind forward channel estimation problem, and improve quite significantly the results presented by Wang and Poor.
Mbuf issues in 4.4BSD IPv6/IPsec support-experiences from KAME IPv6/IPsec implementation
Authors: Jun-ichiro Itojun Hagino
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

The 4.4BSD network stack has made certain assumptions regarding the packets it will handle. In particular, 4.4BSD assumes that (1) the total protocol header length is shorter than or equal to MHLEN, usually 100 bytes, and (2) there are a limited number of protocol headers on a packet. Neither of these assumptions hold any longer, due to the way IPv6/IPsec specifications are written. We at the KAME project are implementing IPv6 and IPsec support code on top of 4.4BSD. To cope with the problems, we have introduced the following changes: (1) a new function called m_pulldown, which adjusts the mbuf chain with a minimal number of copies/allocations, and (2) a new calling sequence for parsing inbound packet headers. These changes allow us to manipulate incoming packets in a safer, more efficient, and more spec-conformant way. The technique described in this paper is integrated into the KAME IPv6/IPsec stack kit, and is freely available under BSD copyright. The KAME codebase is being merged into NetBSD, OpenBSD and FreeBSD. An integration into BSD/OS is planned.
Unsupervised Clustering In Streaming Data
Authors: Dimitris K. Tasoulis, Niall M. Adams, David J. Hand
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Tools for automatically clustering streaming data are becoming increasingly important as data acquisition technology continues to advance. In this paper we present an extension of conventional kernel density clustering to a spatio-temporal setting, and also develop a novel algorithmic scheme for clustering data streams. Experimental results demonstrate both the high efficiency and other benefits of this new approach.
The Vinum volume manager
Authors: Greg Lehey
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

The Vinum Volume Manager is a block device driver which implements virtual disk drives. It isolates disk hardware from the block device interface and maps data in ways which result in an increase in flexibility, performance and reliability compared to the traditional slice view of disk storage. Vinum implements the RAID-0, RAID-1 and RAID-5 models, both individually and in combination.
Experimental assessment of random testing for object-oriented software
Authors: Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertrand Meyer
Venue: Proceedings of the 2007 international symposium on Software testing and analysis (2007)

Progress in testing requires that we evaluate the effectiveness of testing strategies on the basis of hard experimental evidence, not just intuition or a priori arguments. Random testing, the use of randomly generated test data, is an example of a strategy that the literature often deprecates because of such preconceptions. This view is worth revisiting since random testing otherwise offers several attractive properties: simplicity of implementation, speed of execution, absence of human bias. We performed an intensive experimental analysis of the efficiency of random testing on an existing industrial-grade code base. The use of a large-scale cluster of computers, for a total of 1500 hours of CPU time, allowed a fine-grain analysis of the individual effect of the various parameters involved in the random testing strategy, such as the choice of seed for a random number generator. The results provide insights into the effectiveness of random testing and a number of lessons for testing researchers and practitioners.
From human-centred to human-context centred approach: looking back over &#x2018;the hills&#x2019;, what has been gained and lost?
Authors: Lauge Baungaard Rasmussen
Venue: AI Society (2007)

The cornerstone of the human-centred tradition lies in two notions: socially useful production and human machine symbiosis. However, only the latter became in focus in the successive user-centred design approaches. The paper makes a critical &#x2018;flash-back&#x2019; to various human centred design approaches since the 1970s. In addition, it explores the sustainability challenges facing the current situation and suggests that &#x2018;human-centredness&#x2019; should be extended to &#x2018;human-context centred&#x2019; approach in order to recognize the challenges of the sustainability. Finally, the paper discuss the possibilities to develop and use narrative and modelling simulation methods including both qualitative and quantitative tools in a combined approach to meet the challenges of sustainable development within such a human-context centred approach.
Bi-directional 3D auto-regressive model approach to motion picture restoration
Authors: W. B. Goh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

Most image restoration algorithms will blur edges of moving objects in the vicinity of occluded and uncovered image regions. These artifacts are visually annoying. This paper proposes a new bi-directional 3D auto-regressive model which is able to suppress mixed noise processes and recover lost signals in both the covered and uncovered regions in an image sequence. The performance of this algorithm is shown to be superior to the existing 3D AR model.
Property testing in hypergraphs and the removal lemma
Authors: V. Rödl, M. Schacht
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

Property testers are efficient, randomized algorithms which recognize if an input graph (or other combinatorial structure) satisfies a given property or if it is "far" from exhibiting it.Generalizing several earlier results, Alon and Shapira showed thathereditary graph properties are testable (with one-sided error). In this paper we prove the analogous result for hypergraphs.This result is an immediate consequence of a (hyper)graph theoretic statement, which is an extension of the so-called removal lemma. The proof of this generalization relies on the regularity method for hypergraphs.
Video-based Metrology of Water Droplet Spreading on Nanostructured Surfaces
Authors: S. Cheng, X. Luo, S. M. Bhandarkar, J. Fan, Y. Zhao
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Dynamic wettability of a nanostructured surface is an important property for many liquid-related applications of nanostructures. The dynamic wettability analysis is performed by measuring the evolution of the precursor (outer rim) contour of a water droplet as it spreads on a nanostructured surface. A video-based metrological system based on the snake active contour model which is capable of precisely tracking the precursor contour of a spreading water droplet in a high frame-rate video is developed. The radius of the precursor contour is empirically observed to obey a power law with respect to time. Experiments show reasonable agreement between the results of the metrological system and those obtained via manual measurement.
Analysis of selection methods for cost-reference particle filtering with applications to maneuvering target tracking and dynamic optimization
Authors: Joaquín Míguez
Venue: Digital Signal Processing (2007)

Cost-reference particle filtering (CRPF) is a recently proposed sequential Monte Carlo (SMC) methodology aimed at estimating the state of a discrete-time dynamic random system. The estimation task is carried out through the dynamic optimization of a user-defined cost function which is not necessarily tied to the statistics of the signals in the system. In this paper, we first revisit the basics of the CRPF methodology, introducing a generalization of the original algorithm that enables the derivation of some common particle filters within the novel framework, as well as a new and simple convergence analysis. Then, we propose and analyze a particle selection algorithm for CRPF that is suitable for implementation with parallel computing devices and, therefore, circumvents the main drawback of the conventional resampling techniques for particle filters. We illustrate the application of the methodology with two examples. The first one is an instance of one class of problems typically addressed using SMC algorithms, namely the tracking of a maneuvering target using a sensor network. The second example is the application of CRPF to solve a dynamic optimization problem.
Adaptive graphical approach to entity resolution
Authors: Zhaoqi Chen, Dmitri V. Kalashnikov, Sharad Mehrotra
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Entity resolution is a very common Information Quality (IQ) problem with many different applications. In digital libraries, it is related to problems of citation matching and author name disambiguation; in Natural Language Processing, it is related to coreference matching and object identity; in Web application, it is related to Web page disambiguation. The problem of Entity Resolution arises because objects/entities in real world datasets are often referred to by descriptions, which might not be unique identifiers of these entities, leading to ambiguity. The goal is to group all the entity descriptions that refer to the same real world entities. In this paper we present a graphical approach for entity resolution. It complements the traditional methodology with the analysis of the entity-relationship graph constructed for the dataset being analyzed. The paper demonstrates that a technique that measures the degree of interconnectedness between various pairs of nodes in the graph can significantly improve the quality of entity resolution. Furthermore, the paper presents an algorithm for making that technique self-adaptive to the underlying data, thus minimizing the required participation from the domain-analyst and potentially further improving the disambiguation quality.
Transformation-based interpretation of implicit parallel structures: reconstructing the meaning of vice versa and similar linguistic operators
Authors: Helmut Horacek, Magdalena Wolska
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Successful participation in dialogue as well as understanding written text requires, among others, interpretation of specifications implicitly conveyed through parallel structures. While those whose reconstruction requires insertion of a missing element, such as gapping and ellipsis, have been addressed to a certain extent by computational approaches, there is virtually no work addressing parallel structures headed by vice versa-like operators, whose reconstruction requires transformation. In this paper, we address the meaning reconstruction of such constructs by an informed reasoning process. The applied techniques include building deep semantic representations, application of categories of patterns underlying a formal reconstruction, and using pragmatically-motivated and empirically justified preferences. We present an evaluation of our algorithm conducted on a uniform collection of texts containing the phrases in question.
IkeWiki: A Semantic Wiki for Collaborative Knowledge Management
Authors: Sebastian Schaffert
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

This article describes the architecture and design principles of IkeWiki, a Semantic Wiki we developed at Salzburg Research. Outstanding features of IkeWiki are its support for collaborative knowledge engineering, its ease of use, its support for different levels of formalisation ranging from informal texts to formal ontologies, and its sophisticated, interactive user interface. While IkeWiki has been developed primarily as a tool for ontology engineering, it can be used in a variety of application scenarios. We briefly present some of these at the end of the article.
Predicting alarms in supermarket refrigeration systems using evolved neural networks and evolved rulesets
Authors: D. W. Taylor, D. W. Corne, D. L. Taylor, J. Harkness
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Supermarkets suffer serious financial losses owing to problems with their refrigeration systems. Most refrigeration units have controllers which output "high-temperature" and similar alarms. We describe a system developed to predict alarm volumes from this data in advance, and compare evolved and backpropagation-trained neural networks, and evolved rulesets for this task.
On Construction of Holistic Synopses under the Duplicate Semantics of Streaming Queries
Authors: David Toman
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

Transaction-time temporal databases and query languages provide a solid framework for analyzing properties of queries over data streams. In this paper we focus on issues connected with the construction of space-bounded synopses that enable answering of continuous queries over unbounded data streams while requiring only limited space. We link the problem to the problem of query-driven data expiration in append-only temporal databases and study space bounds on synopses that are sufficient and necessary for query answering under duplicate semantics.
Verifying Identifier-Authenticity in Ubiquitous Computing Environment
Authors: Tetsuo Kamina, Toshinori Aoki, Yoshiteru Eto, Noboru Koshizuka, Jun Yamada, Ken Sakamura
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In ubiquitous computing environment, identification of objects and places in the real world is important, and 2-D printing code is useful to store identifiers of them. However, since it is easy to modify the content stored in the 2-D code, we must verify whether the identifier written in the 2-D code is indeed issued by the authorized organization. In this paper, we propose a verification method for identifiers stored in the 2-D code. Our system makes sure that the identifier is indeed issued by the authorized organization, and the size of pair of identifier and its authenticator is small enough to be written in a 2-D code. Furthermore, the proposed system has compatibility with the existing 2-D code reading software. Our system is now operated in practical use, and some services based on this mechanism have been developed.
An Effective Starvation Avoidance Mechanism to Enhance the Token Coherence Protocol
Authors: Blas Cuesta, Antonio Robles, Jose Duato
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Shared-memory multiprocessors are becoming to be formed by an increasingly larger number of nodes. In these systems, implementing cache coherence is a key issue. Token Coherence is a low latency cache coherence protocol that avoids indirection for cache-to-cache misses and which does not require a totally-ordered interconnect. When races are rare, the protocol performs well thanks to the performance policy. Unfortunately, some medium/large systems and some applications that often access the same data simultaneously make races more common. As a result, the protocol does not perform as well as it could because it uses the persistent request mechanism to prevent starvation. This mechanism is too slow and inflexible because it overrides the performance policy. In consequence, the protocol slows down the system and does not take advantage of the flexibility and speed of the common case. We propose a new mechanism, namely priority requests, which replaces the persistent request one. Our mechanism solves races, while still respecting the performance policy, simply by ordering and giving a higher priority to requests suffering from starvation. Thus, our mechanism handles the tokens more efficiently and reduces the network traffic.
Optimizing Events Traffic in Event-based Systems by means of Evolutionary Algorithms
Authors: Jiri Kubalik, Richard Mordinyi
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

This paper presents a new approach for solving network flow optimization problems. In particular, the goal is to optimize the traffic in the network structured event-driven systems as well as to provide means for efficient adaptation of the system to changes in the environment - i.e. when some nodes and/or links fail. Many network flow optimization problems belong to the class of NP hard problems, which can only be solved by using some heuristic approach. In this paper we describe an application of a recently introduced iterative optimization algorithm with evolved improvement steps. This algorithm is well suited for solving hard discrete combinatorial problems as well as rescheduling-like problems; thus it fits the addressed adaptability issue very well.
Boxwood: abstractions as the foundation for storage infrastructure
Authors: John MacCormick, Nick Murphy, Marc Najork, Chandramohan A. Thekkath, Lidong Zhou
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

Writers of complex storage applications such as distributed file systems and databases are faced with the challenges of building complex abstractions over simple storage devices like disks. These challenges are exacerbated due to the additional requirements for fault-tolerance and scaling. This paper explores the premise that high-level, fault-tolerant abstractions supported directly by the storage infrastructure can ameliorate these problems. We have built a system called Boxwood to explore the feasibility and utility of providing high-level abstractions or data structures as the fundamental storage infrastructure. Boxwood currently runs on a small cluster of eight machines. The Boxwood abstractions perform very close to the limits imposed by the processor, disk, and the native networking subsystem. Using these abstractions directly, we have implemented an NFSv2 file service that demonstrates the promise of our approach.
How will future learning work in the third dimension?
Authors: Martin Leidl, Guido Rößling
Venue: ACM SIGCSE Bulletin (2007)

In this paper, we describe the possibilities of virtual worlds for educational purposes, and justify the need for special design and usability concepts for learning applications within these worlds.
Games for science and engineering education
Authors: Merrilea J. Mayo
Venue: Communications of the ACM (2007)

Video games can teach science and engineering better than lectures. Are they a cure for a numbing 200-person class?
Graph theory: linking online musical creativity to concert hall performance
Authors: Jason Freeman
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

Graph Theory links the creative music-making activities of web site visitors to the dynamic generation of an instrumental score for solo violin. Participants use a web-based interface to navigate among short, looping musical fragments to create their own unique path through the open-form composition. Before each concert performance, the violinist prints out a new copy of the score that orders the fragments based on the decisions made by web visitors.
Implementation of a mobile, low-cost, wireless network for problem solving in the classroom
Authors: J. C. Chen
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The goals for the project presented are to implement a mobile wireless network of laptop computers for problem solving in engineering courses. Motivation for this project include the existing low cost of hardware and software to realize such a network, the benefits for student learning when computing power is readily available in the classroom, and the poor access and suitability of conventional computer laboratories as a teaching environment. Successful completion of this pilot study will have a high local impact, given our engineering school's desire to make computing resources more widely available to students while containing the cost of the initiative. This same issue is being faced by many engineering schools across the country, and this project can serve as a model of efficient use of computing resources.
An Algorithm of State-Space Precomputation Allowing Non-linear Haptic Deformation Modelling Using Finite Element Method
Authors: Igor Peterlik, Ludek Matyska
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

After presenting the mathematical background of modelling elastic deformations together with finite element formulation, we propose a new algorithm allowing haptic interaction with soft tissues having both non-linear geometric and physical properties. The algorithm consists of two phases-first the configuration space is precomputed in a high-performance possibly distributed environment, then the precomputed data are used during the haptic interaction. In the paper we focus mainly on sequential description of the first phase of the algorithm. We present some preliminary experimental results concerning the accuracy of the proposed method as well and the sketch of further extensions.
A two-step neural-network based algorithm for fast image super-resolution
Authors: Carlos Miravet, Francisco B. Rodrıguez
Venue: Image and Vision Computing (2007)

We propose a novel, learning-based algorithm for image super-resolution. First, an optimal distance-based weighted interpolation of the image sequence is performed using a new neural architecture, hybrid of a multi-layer perceptron and a probabilistic neural network, trained on synthetic image data. Secondly, a linear filter is applied with coefficients learned to restore residual interpolation artifacts in addition to low-resolution blurring, providing noticeable improvements over lens-detector Wiener restorations. Our method has been evaluated on real visible and IR sequences with widely different contents, providing significantly better results that a two-step method with high computational requirements. Results were similar or better than those of a maximum-a-posteriori estimator, with a reduction in processing time by a factor of almost 300. This paves the way to high-quality, quasi-real time applications of super-resolution techniques.