ppxscal/embedding_network huggingface dataset:
Polymorphic variants in Haskell
Authors: Koji Kagawa
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Haskell (2006)

In languages that support polymorphic variants, a single variant value can be passed to many contexts that accept different sets of constructors. Polymorphic variants can be used in order to introduce extensible algebraic datatypes into functional programming languages and are potentially useful for application domains such as interpreters, graphical user interface (GUI) libraries and database interfaces, where the number of necessary constructors cannot be determined in advance. Very few functional languages, however, have a mechanism to extend existing datatypes by adding new constructors. In general, for polymorphic variants to be useful, we would need some mechanisms to reuse existing functions and extend them for new constructors.Actually, the type system of Haskell, when extended with parametric type classes (or multi-parameter type classes with functional dependencies), has enough power not only to mimic polymorphic variants but also to extend existing functions for new constructors.This paper, first, explains how to do this in Haskell's type system (Haskell 98 with popular extensions). However, this encoding of polymorphic variants is difficult to use in practice. This is because it is quite tedious for programmers to write mimic codes by hand and because the problem of ambiguous overloading resolution would embarrass programmers. Therefore, the paper proposes an extension of Haskell's type classes that supports polymorphic variants directly. It has a novel form of instance declarations where records and variants are handled symmetrically.This type system can produce vanilla Haskell codes as a result of type inference. Therefore it behaves as a preprocessor which translates the extended language into plain Haskell. Programmers would be able to use polymorphic variants without worrying nasty problems such as ambiguities.
A Comparative Study of Four Ontology Visualization Techniques in Protege: Experiment Setup and Preliminary Results
Authors: Katifori Akrivi, Torou Elena, Halatsis Constantin, Lepouras Georgios, Vassilakis Costas
Venue: Proceedings of the conference on Information Visualization (2006)

The continuing need for more effective information retrieval has lead to the creation of the notions of the semantic web and personalized information management, areas of study that very often employ ontologies to represent the semantic context of a domain. Consequently, the need for effective ontology visualization for design, management and browsing has arisen. There are several ontology visualizations available through the existing ontology management tools, but not as many evaluations to determine their advantages and disadvantages and their suitability for various ontologies and user groups. This work presents the preliminary results of an evaluation of four visualization methods in Protege.
Implementation and Performance Evaluation of LT and Raptor Codes for Multimedia Applications
Authors: Pasquale Cataldi, Miquel Pedros Shatarski, Marco Grangetto, Enrico Magli
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Digital fountains have changed the standard transmission paradigm. A digital fountain can encode and transmit an unlimited number of data packets until every user gets enough information to guarantee correct decoding. Multimedia broadcasting, emerging peer-to-peer applications are only two examples of many other scenarios where digital fountains can be successfully applied. In this paper practical implementation issues of two class of digital fountain codes, namely LT and Raptor codes, are analyzed. Moreover, the performance in terms of coding and decoding complexity is measured experimentally.
MPEG-21 Based Temporal Adaptation of Live H.264 Video
Authors: Razib Iqbal, Shervin Shirmohammadi, Chris Joslin
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

The diversity of devices in both wired and wireless networks via which multimedia contents are desired to be accessed and interacted with has grown significantly. Applications like video conferencing, surveillance and chatting is challenged by this diversity which requires live adaptation to meet user requirements and device specifications. In this paper, we present an architecture for temporal adaptation of ITU-T H.264 video conforming to ISO/IEC MPEG-21 DIA for live video stream along with the adaptation module implementation detail. Adaptation is performed on demand directly from the live bitstream and its generic Bitstream Syntax Description (gBSD) avoiding conventional approaches seen in traditional transcoders. As a result, any MPEG-21 compliant host can adapt the stream without requiring the video codec. A prototype, based on the proposed architecture, and experimental evaluations of the system and its performance supporting the architecture are also presented.
Implementation of Intelligent Agents with Mobility in Educational Robotics Settings
Authors: Ilkka Jormanainen, Chiara Moroni, Yuejun Zhang, Erkki Sutinen
Venue: Proceedings of the Fourth IEEE International Workshop on Wireless, Mobile and Ubiquitous Technology in Education (2006)

Teachers working in robotics classes face a major problem: how to keep track of individual students' or even small groups' progress in a class of 30-40 students. A multi-agent environment to help teachers with this problem is based on having pedagogical agents to monitor students' interaction, robots' movements, and the construction and programming process of robots. Mobile interaction agents move in network delivering agents' observations to teacher's visualization agent. Results of a linguistic analysis show the possible problems in educational robotics settings where the proposed agent-based system could help.
Inner-Circle Consistency for Wireless Ad Hoc Networks
Authors: Claudio Basile, Zbigniew Kalbarczyk, Ravishankar K. Iyer
Venue: IEEE Transactions on Mobile Computing (2007)

This paper proposes and evaluates strategies to build reliable and secure wireless ad hoc networks. Our contribution is based on the notion of inner-circle consistency, where local node interaction is used to neutralize errors/attacks at the source, both preventing errors/attacks from propagating in the network and improving the fidelity of the propagated information. We achieve this goal by combining statistical (a proposed fault-tolerant cluster algorithm) and security (threshold cryptography) techniques with application-aware checks to exploit the data/computation that is partially and naturally replicated in wireless applications. We have prototyped an inner-circle framework and used it to demonstrate the idea of inner-circle consistency in two significant wireless scenarios: 1) the neutralization of black hole attacks in AODV networks and 2) the neutralization of sensor errors in a target detection/localization application executed over a wireless sensor network.
Model SelectionWithin a Bayesian Approach to Extraction of Walker Motion
Authors: Ziheng Zhou, Robert I. Damper, Adam Prugel-Bennett
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Extracting articulated motion of walking people in image sequences remains a challenge, particularly when we take into account the changes caused by carried objects or the severe motion occlusions by clothing (e.g., a long skirt, a trench coat, etc). In this paper, we propose a Bayesian framework capable of handling such uncertainties by exploiting our strong prior knowledge of how humans walk. In this work, the strong prior is built from a simple articulated model, which can be easily modified to cater for situations such as walkers wearing clothing that obscures the limbs. A model selection process is built into the framework to determine the body configuration of the walker in the given sequence automatically. The statistics of the parameters describing a basic walker are learned from data and the Bayesian framework then allows us to 'bootstrap' to accurate motion extraction on the images of walkers with extra body configurations. We demonstrate our approach on the data of walkers with rucksacks, skirts and trench coats. Results are quantified in terms of average pixel error between automatically extracted body points and corresponding points labelled by hand.
Processing Syntactic Relations in Language and Music: An Event-Related Potential Study
Authors: Aniruddh D. Patel, Edward Gibson, Jennifer Ratner, Mireille Besson, Phillip J. Holcomb
Venue: Journal of Cognitive Neuroscience (1998)

In order to test the language-specificity of a known neural correlate of syntactic processing &lsqb;the P600 event-related brain potential (ERP) component&rsqb;, this study directly compared ERPs elicited by syntactic incongruities in language and music. Using principles of phrase structure for language and principles of harmony and key-relatedness for music, sequences were constructed in which an element was either congruous, moderately incongruous, or highly incongruous with the preceding structural context. A within-subjects design using 15 musically educated adults revealed that linguistic and musical structural incongruities elicited positivities that were statistically indistinguishable in a specified latency range. In contrast, a music-specific ERP component was observed that showed antero-temporal right-hemisphere lateralization. The results argue against the language-specificity of the P600 and suggest that language and music can be studied in parallel to address questions of neural specificity in cognitive processing.
Toward Standards for Integration of Instruments into Grid Computing Environments
Authors: Donald F. McMullen, Ian M. Atkinson, Ken Chiu, Peter Turner, Kianosh Huffman, Romain Quilici, Matthew Wyatt
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Instruments and sensors are the primary sources of data driving science and the development and refinement of theory. A critical component of eresearch yet to be clarified is the role of instruments in cyberinfrastructure. Are instruments, sensors and other real-time data sources to be mediated by file systems, or can they be fully integrated into computing and storage grids with appropriate protocol standards? Our position is that they can and must become regular grid resources and that standards for doing so represent an important research topic. Our approach, the Common Instrument Middleware Architecture, and a model application, X-ray crystallography, are described here in order to stimulate a broader discussion of requirements for grid-enabling instruments and sensors.
Thermal-Aware Scheduling: A Solution for Future Chip Multiprocessors Thermal Problems
Authors: Kyriakos Stavrou, Pedro Trancoso
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

The increased complexity and operating frequency in current microprocessors is resulting in a decrease in the performance improvements. In order to keep up with the expected performance gains, major manufacturers have started to offer chip-multiprocessor architectures. Nevertheless, the integration of several cores on the same chip leads to increased heat dissipation and consequently additional costs, decrease of the reliability, and performance loss, among others. In this paper we propose Thermal-Aware Scheduling (TAS) a technique that aims to minimize all these problems. When assigning processes to cores, TAS takes their temperature into account avoiding thermal violation events. As a side effect, the performance is improved. Simulation results show that for a 25-core CMP, a simple TAS heuristic reduces the performance loss that is introduced by excessive temperature, from 52% to 18%. At the same time, TAS decreases the chip's temperature by 2.6^oC.
Bispectral techniques for spherical functions
Authors: R. Kakarala, B. M. Bennett, G. J. Iverson, M. D'Zmura
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors address two problems involving spherical functions: determining when two spherical functions are 3-D rotated copies of each other; and averaging several noisy observations of a rotating spherical function. The solution to both problems uses the spherical bispectrum, which is the generalization of the well-known Euclidean bispectrum. The spherical bispectrum is formulated and it is shown that it is invariant under 3-D rotation of the underlying Gaussian noise. An algorithm for recovering spherical functions from their bispectra is demonstrated.
Hardware/Software Co-Design of an FPGA-based Embedded Tracking System
Authors: Jason Schlessman, Cheng-Yao Chen, Wayne Wolf, Burak Ozer, Kenji Fujino, Kazurou Itoh
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper discusses a practical design experience pertaining to a tracking system employing optical flow. The system was previously extracted from an existing software implementation and modified for FPGA deployment. Details are provided regarding transference of the resulting high-level design to a usable form for FPGA fabrics. Furthermore, discussion is given for obstacles made manifest in embedded vision design and the methods employed for overcoming them. This is attempted with the intent of maintaining a consistent level of vision algorithm performance as well as meeting real-time requirements. The system discussed differs from previous embedded systems employing optical flow in that it consists strictly of fully disclosed nonproprietary transferable components while providing performance measures for power consumption, latency, and area. The system was synthesized onto a Xilinx Virtex-II Pro XC2VP30 FPGA utilizing less than 25% of system resources, performing with a maximum operating frequency of 67MHz without pipelining, and consuming 497mW of power.
A User Preference Model and a Query Language that allow Semantic Retrieval and Filtering of Multimedia Content
Authors: Chrisa Tsinaraki, Stavros Christodoulakis
Venue: Proceedings of the First International Workshop on Semantic Media Adaptation and Personalization (2006)

We present in this paper MP7QL, a powerful query language that we are developing for querying MPEG-7 descriptions, and a user preference model that allows for expressing preferences about every aspect of an MPEG-7 multimedia content description. The MP7QL queries may utilize the user preferences as context, thus allowing for personalized multimedia content retrieval. The user preference model supports multimedia Filtering and Search Preferences (FASP) that allow for expressing semantic preferences, preferences regarding the low-level visual features and preferences regarding media-related aspects (creation, classification, source etc). The proposed FASPs essentially are MP7QL queries, allow for the systematic integration of domain knowledge in the semantic preferences of the users and have the standard MPEG-7 FASPs as a special case. The MP7QL and the FASP model have been expressed using both XML Schema and OWL syntax. An implementation on top of an XML Repository is currently under way.
Existence, uniqueness, and algorithmic computation of general lilypond systems
Authors: Matthias Heveling, Günter Last
Venue: Random Structures Algorithms (2006)

The lilypond system based on a locally finite subset &phiv; of the Euclidean space &Ropf;n is defined as follows. At time 0 every point of &phiv; starts growing with unit speed in all directions to form a system of balls in which any particular ball ceases its growth at the instant that it collides with another ball. Based on a more formal definition of lilypond systems given in [1], we will prove that these systems exist and are uniquely determined. Our approach applies to the far more general setting, where &phiv; is a locally finite subset of some space &Xopf; equipped with a pseudo-metric d. We will also derive an algorithm approximating the system with at least linearly decreasing error. Several examples will illustrate our general results. &copy; 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006
A Contribution to Theory Building for Mobile Marketing: Categorizing Mobile Marketing Campaigns through Case Study Research
Authors: Key Pousttchi, Dietmar G. Wiedemann
Venue: Proceedings of the International Conference on Mobile Business (2006)

Marketing experts consider the mobile device as an extremely promising marketing tool as it supports them to cope with their major challenge: getting time and attention from customers. Current mobile marketing research mostly covers success factors and acceptance analysis. Categorization, when addressed, lacks in appropriate foundation and is not linked to objectives at all. In this article we examine 55 case studies in order to identify relevant characteristics of mobile marketing campaigns. The outcome of the paper is the derivation of four mobile marketing standard types and an examination of campaign objectives that can be addressed by mobile marketing. The proposed scheme allows to unambiguously characterize any given mobile marketing campaign and to identify the respective objectives.
Boosted ARTMAP: Modifications to fuzzy ARTMAP motivated by boosting theory
Authors: Stephen J. Verzi, Gregory L. Heileman, Michael Georgiopoulos
Venue: Neural Networks (2006)

In this paper, several modifications to the Fuzzy ARTMAP neural network architecture are proposed for conducting classification in complex, possibly noisy, environments. The goal of these modifications is to improve upon the generalization performance of Fuzzy ART-based neural networks, such as Fuzzy ARTMAP, in these situations. One of the major difficulties of employing Fuzzy ARTMAP on such learning problems involves over-fitting of the training data. Structural risk minimization is a machine-learning framework that addresses the issue of over-fitting by providing a backbone for analysis as well as an impetus for the design of better learning algorithms. The theory of structural risk minimization reveals a trade-off between training error and classifier complexity in reducing generalization error, which will be exploited in the learning algorithms proposed in this paper. Boosted ART extends Fuzzy ART by allowing the spatial extent of each cluster formed to be adjusted independently. Boosted ARTMAP generalizes upon Fuzzy ARTMAP by allowing non-zero training error in an effort to reduce the hypothesis complexity and hence improve overall generalization performance. Although Boosted ARTMAP is strictly speaking not a boosting algorithm, the changes it encompasses were motivated by the goals that one strives to achieve when employing boosting. Boosted ARTMAP is an on-line learner, it does not require excessive parameter tuning to operate, and it reduces precisely to Fuzzy ARTMAP for particular parameter values. Another architecture described in this paper is Structural Boosted ARTMAP, which uses both Boosted ART and Boosted ARTMAP to perform structural risk minimization learning. Structural Boosted ARTMAP will allow comparison of the capabilities of off-line versus on-line learning as well as empirical risk minimization versus structural risk minimization using Fuzzy ARTMAP-based neural network architectures. Both empirical and theoretical results are presented to enhance the understanding of these architectures.
An Interactive Environment for Generating Sequential Information
Authors: Mariko Sasakura, Kenichi Iwata, Susumu Yamasaki
Venue: Proceedings of the conference on Information Visualization (2006)

We propose an interactive environment in which we can generate sequential information. Sequential information is a sequence of movements which makes changes of situations. The system allows a user to construct an environment for generating sequential information. We provide interactions and visualization for sequential information generation based on theoretical grounds.
Toward Human-Level Machine Intelligence
Authors: Lotfi A. Zadeh
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Can machines think? This question has been an object of discussion and debate for over half-a-century. My interest in the question goes back to the beginning of my academic career. Officially, AI was born in l956. At its birth there was widespread expectation that within a few years it will be possible to build machines that could think like humans. I did not share that belief. To the pioneers, symbolic logic was all that was needed. Anything that involved numerical computations was unwelcome. It took close to thirty years for probability theory to gain grudging acceptance. Clearly, adding probability theory to the armamentarium of AI is a step in the right direction. But is it sufficient? In my view, the answer is: No.
Sustained Emerging Spatio-Temporal Co-occurrence Pattern Mining: A Summary of Results
Authors: Mete Celik, Shashi Shekhar, James P. Rogers, James A. Shine
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Sustained emerging spatio-temporal co-occurrence patterns (SECOPs) represent subsets of object-types that are increasingly located together in space and time. Discovering SECOPs is important due to many applications, e.g., predicting emerging infectious diseases, predicting defensive and offensive intent from troop movement patterns, and novel predator-prey interactions. However, mining SECOPs is computationally very expensive because the interest measures are computationally complex, datasets are larger due to the archival history, and the set of candidate patterns is exponential in the number of object-types. We propose a monotonic interest measure for mining SECOPs and a novel SECOP mining algorithm. Analytical and experimental results show that the proposed algorithm is correct, complete, and computationally faster than related approaches. Results also show the proposed algorithm is computationally more efficient than naïve alternatives.
Lossless watermarking of compressed media using reversibly decodable packets
Authors: Bijan G. Mobasseri, Domenick Cinalli
Venue: Signal Processing (2006)

Entropy coded multimedia signals such as JPEG and MPEG-1 and 2 have little or no error resiliency. To counter this situation, researchers have proposed using reversible VLCs (RVLC) to identify and limit error propagation. To bring error resiliency to Huffman-coded streams, a bidirectionally decodable packet has been introduced. This packet can be decoded in both directions to trap corrupted VLCs. Recognizing that watermark bits can be injected into the bitstream as forced bit errors, we have developed a watermarking algorithm around this decoder. The original decoder, however, is not able to track bit errors down to individual bits. We have developed an algorithm to restore the original unwatermarked bitstream. As a result of introducing watermark bits in the stream, serious synchronization issues arise at the decoder. The two-way decoding algorithm is capable of resolving and identifying existing resync markers and reestablishing synchronization. The algorithm has been successfully applied to several MPEG-2 video streams.