ppxscal/embedding_network huggingface dataset:
Robust color-to-gray via nonlinear global mapping
Authors: Yongjin Kim, Cheolhun Jang, Julien Demouth, Seungyong Lee
Venue: ACM Transactions on Graphics (TOG) (2009)

This paper presents a fast color-to-gray conversion algorithm which robustly reproduces the visual appearance of a color image in grayscale. The conversion preserves feature discriminability and reasonable color ordering, while respecting the original lightness of colors, by simple optimization of a nonlinear global mapping. Experimental results show that our method produces convincing results for a variety of color images. We further extend the method to temporally coherent color-to-gray video conversion.
The Perception of Cultural Differences in Online Self-presentation
Authors: Yifan Jiang, Oscar Bruijn, Antonella Angeli
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

Online self-presentation, defined as the way people present themselves through profiles, blogs, photo albums, etc., forms the basis of much of the interpersonal relationship building taking place in social networking platforms such as Windows Live Space. However, little is known about how people make sense of this information, particularly if presenter and audience do not have a common cultural background. This study investigated the effectiveness of cross-cultural online communication by measuring the cross-cultural social perception of specially constructed online representations of a typical British and a typical Chinese person. The representations were based on a 7-dimensional characterization of cultural differences derived from a review of the literature. The findings suggested that cultural characterization embedded in online communication affects the social perception of others, that it can trigger stereotypes, and that it has consequences for establishing relationships. Implications for the design of social networking platforms are discussed.
Query-Based Model Checking of Ad Hoc Network Protocols
Authors: Anu Singh, C. R. Ramakrishnan, Scott A. Smolka
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the square of the number of nodes. To combat this instance explosion problem, we present a query-based verification framework for AHN protocols that utilizes symbolic reachability analysis. Specifically we consider AHN nodes of the form P:I, where P is a process and I is an interface: a set of groups, where each group represents a multicast port. Two processes can communicate if their interfaces share a common group. To achieve a symbolic representation of network topologies, we treat process interfaces as variables and introduce a constraint language for representing topologies. Terms of the language are simply conjunctions of connection and disconnection constraints of the form $conn({\mathcal{J}}_i,{\mathcal{J}}_j)$ and $dconn({\mathcal{J}}_i, {\mathcal{J}}_j)$, where ${\mathcal{J}}_i$ and ${\mathcal{J}}_j$ are interface variables. Our symbolic reachability algorithm explores the symbolic state space of an AHN in breadth-first order, accumulating topology constraints as multicast-transmit and multicast-receive transitions are encountered. We demonstrate the practical utility of our framework by applying it to the problem of detecting unresolved collisions in the LMAC protocol for sensor networks.
The Basis Digraphs of p-schemes
Authors: A. Rahnamai Barghi, Ilia Ponomarenko
Venue: Graphs and Combinatorics (2009)

It is proved that association schemes with bipartite basis graphs are exactly 2-schemes. This result follows from a characterization of p-schemes for an arbitrary prime p in terms of basis digraphs.
Aligning Risk Management and Compliance Considerations with Business Process Development
Authors: Martijn Zoet, Richard Welke, Johan Versendaal, Pascal Ravesteyn
Venue: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (2009)

The improvement of business processes, to date, primarily focuses on effectiveness and efficiency, thereby creating additional value for the organization and its stakeholders. The design of processes should also ensure that its result and the value obtained compensates for the risks affecting this value. In this paper the different kinds of risk affecting a business process are introduced, after which solutions to the problem of risk mitigation are discussed, resulting in a proposed framework to mollify these risks by incorporating a class of risk-mitigation rules into business process development.
Leveraging User Search Behavior to Design Personalized Browsing Interfaces for Healthcare Web Sites
Authors: Malika Mahoui, Josette F. Jones, Derek Zollinger, Kanitha Andersen
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Understanding and leveraging user search behavior is increasingly becoming a key component towards improving web sites functionality for the health care consumer and provider. Hence, the development and improvement of any interactive browser-based information system, such as those used by digital libraries, requires consideration of the type of individuals utilizing the system, an understanding of available content and inclusion of a way to measure user interactivity. Information systems not only need to provide useful content, they must also present content in a way that results in an efficient, effective and satisfying user experience. Functional interface design is assumed to take in consideration the overall environment of the user to support users in their search tasks. Web logs --- access logs and search logs - record user interactions with the interface, and as thus provide insight in user search behavior in a natural environment. The present study measures the usability of a digital library through an in depth analysis of the web logs. The study also leverages user interaction with the digital library to propose a use driven browsing interface to improve user interaction with the system.
Deriving Syntax and Axioms for Quantitative Regular Behaviours
Authors: Filippo Bonchi, Marcello Bonsangue, Jan Rutten, Alexandra Silva
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative systems. Our quantitative systems include weighted versions of automata and transition systems, in which transitions are assigned a value in a monoid that represents cost, duration, probability, etc. Such systems are represented as coalgebras and (1) and (2) above are derived in a modular fashion from the underlying (functor) type of these coalgebras.In previous work, we applied a similar approach to a class of systems (without weights) that generalizes both the results of Kleene (on rational languages and DFA's) and Milner (on regular behaviours and finite LTS's), and includes many other systems such as Mealy and Moore machines.In the present paper, we extend this framework to deal with quantitative systems. As a consequence, our results now include languages and axiomatizations, both existing and new ones, for many different kinds of probabilistic systems.
PROSIS: An isoarchic structure for HMS control
Authors: Patrick Pujo, Nicolas Broissin, Fouzia Ounnar
Venue: Engineering Applications of Artificial Intelligence (2009)

This paper presents a holonic and isoarchic approach to the Flexible Manufacturing System (FMS) control. This approach is based on a flat holonic form, where each holon is a model for each entity of the FMS, with a unifying level of communication between holons. After description of this model, called PROSIS, the interaction protocol and decision rules are presented. The objective is to increase the FMS productivity and flexibility, particularly on responsiveness aspects. This responsiveness is achieved through decentralized generation of the production tasks. The reactive behaviour of the FMS control is illustrated by the example of a flexible turning cell, upon occurrence of a failure or of an urgent batch order, and the resulting Gantt charts are shown.
Simulation Study on Constructed Wetland Treatment on Villages and Small Towns' Sewage
Authors: Baoping Song, Yanxia Zheng, Xuyang Zhao
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Constructed wetland, one of technologies of wastewater treatment, is developing recently. There are many advantages for this technology: high removal capacity, simple technology of construction operation and maintenance, and low costs in investment, maintenance and operation. Therefore it is adapted to sewage treatment of village and small town short of fund and technician. In this paper, the effective specific surface area (αS) and area factor (δ) of constructed wetland with different depths are calculated to study the location of aerobic microorganism according to the slab geometry theory. The simulation results indicated that αs in different depths of wetland is different, that is, αs of the upper layer is threefold as the wetland bed. The contamination is removed mainly in the upper 25 cm where microorganism is active.
Feature Selection Algorithm Based on Association Rules Mining Method
Authors: Jianwen Xie, Jianhua Wu, Qingquan Qian
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

This paper presents a novel feature selection algorithm based on the technique of mining association rules. The main idea of the proposed algorithm is to find the features that are closely correlative with the class attribute by association rules mining method. Experimental results on several real and artificial data sets demonstrate that the proposed feature selection algorithm is able to obtain a smaller and satisfactory feature subset when compared with other existing feature selection algorithms. It is a new feature selection algorithm with vast of application prospect and research value.
Mind the Gap
Authors: Simon Winwood, Gerwin Klein, Thomas Sewell, June Andronick, David Cock, Michael Norrish
Venue: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (2009)

This paper presents the formal Isabelle/HOL framework we use to prove refinement between an executable, monadic specification and the C implementation of the seL4 microkernel. We describe the refinement framework itself, the automated tactics it supports, and the connection to our previous C verification framework. We also report on our experience in applying the framework to seL4. The characteristics of this microkernel verification are the size of the target (8,700 lines of C code), the treatment of low-level programming constructs, the focus on high performance, and the large subset of the C programming language addressed, which includes pointer arithmetic and type-unsafe code.
Shallow post morphological processing with KURD
Authors: Michael Carl, Antje Schmidt-Wigger
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

In this paper we describe a constraint based formalism that manipulates sequences of morphological analyses in order to Kill, Unify, Replace or Delete parts of the structure. We compare the formalism to a similar approach (CGP) and describe two applications.
Research on Optimizing Embedding Space Dimension in Network Coordinate System
Authors: Changyou Xing, Ming Chen
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Network coordinate system provides a method to predict distances between network nodes by geometric space embedding, which can help distributed applications such as P2P and Grid select the best node to transfer data. However, how to select the suitable embedding space dimension is still an open problem. In this paper, firstly we give an experimental study on the relationship between distance prediction accuracy and embedding space dimension, and then discuss the cluster feature of Internet distance, which has an important influence on embedding space dimension selection. Then based on such feature, we propose an embedding space dimension optimization selection algorithm. Analysis result shows that this algorithm can select the best embedding space dimension and landmarks, and provide a mechanism for network coordinate system to implement accurate distance prediction with low system cost.
Research of CMLD-CFAR Detecting Algorithm in Radar Reconnaissance Receiver
Authors: Shuhua Wei, Xiaojun Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

In radar signal reconnaissance digital receiver based on DFT (Discrete Fourier Transform), automatic CFAR (Constant False Alarm Rate) detection in frequency domain is necessary in processing of peak-seek algorithm. A CMLD-CFAR (Censored Mean Level Detector CFAR) algorithm in frequency domain is presented. By researching the threshold generating algorithm of pulse radar signals’ spectrum under clutter background, a threshold generating algorithm based on the structure of CMLD-CFAR detector is provided, the detection probability and false alarm rate of the algorithm under the nominal factor T is derived in detail. At last, confirms the validity of the algorithm via computer simulation.
Adaptable Probabilistic Transmission Framework for Wireless Sensor Networks
Authors: Chih-Kuang Lin, Vladimir Zadorozhny, Prashant Krishnamurthy
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

We propose a novel framework that combines probabilistic transmission with Latin Squares characteristics to tune channel access, meeting various demands in network performance (Energy vs. Delay). The proposed technique is decentralized, scalable, and has low overhead. We develop an analytical model to estimate the network performance and validate the benefits of the proposed framework via simulation-based experiments.
The Maximum Communication Complexity of Multi-Party Pointer Jumping
Authors: Joshua Brody
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

We study the one-way number-on-the-forhead (NOF) communication complexity of the $k$-layer pointer jumping problem. Strong lower bounds for this problem would have important implications in circuit complexity. All of our results apply to myopic protocols (where players see only one layer ahead, but can still see arbitrarily far behind them.) Furthermore, our results apply to the maximum communication complexity, where a protocol is charged for the maximum communication sent by a single player rather than the total communication sent by all players. Our main result is a lower bound of $n/2$ bits for deterministic protocols, independent of the number of players. We also provide a matching upper bound, as well as an $\Omega(n/k\log n)$ lower bound for randomized protocols, improving on the bounds of Chakrabarti. In the non-Boolean version of the problem, we give a lower bound of $n (\log^{(k-1)} n)(1-o(1))$ bits, essentially matching the upper bound from Damm et al.
CABAC Accelerator Architectures for Video Compression in Future Multimedia: A Survey
Authors: Yahya Jan, Lech Jozwiak
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

The demands for high quality, real-time performance and multi-format video support in consumer multimedia products are ever increasing. In particular, the future multimedia systems require efficient video coding algorithms and corresponding adaptive high-performance computational platforms. The H.264/AVC video coding algorithms provide high enough compression efficiency to be utilized in these systems, and multimedia processors are able to provide the required adaptability, but the algorithms complexity demands for more efficient computing platforms. Heterogeneous (re-)configurable systems composed of multimedia processors and hardware accelerators constitute the main part of such platforms. In this paper, we survey the hardware accelerator architectures for Context-based Adaptive Binary Arithmetic Coding (CABAC) of Main and High profiles of H.264/AVC. The purpose of the survey is to deliver a critical insight in the proposed solutions, and this way facilitate further research on accelerator architectures, architecture development methods and supporting EDA tools. The architectures are analyzed, classified and compared based on the core hardware acceleration concepts, algorithmic characteristics, video resolution support and performance parameters, and some promising design directions are discussed. The comparative analysis shows that the parallel pipeline accelerator architecture seems to be the most promising.
Nonself Detection in a Two-Component Cellular Frustrated System
Authors: F. Vistulo Abreu, P. Mostardinha
Venue: Proceedings of the 8th International Conference on Artificial Immune Systems (2009)

The cellular frustration concept was first introduced in an ICARIS conference [1] as an alternative approach to accomplish specific and prompt intrusion detection in highly diverse systems. Cellular frustration uses two main assumptions: 1) that cells' activation are better modeled as cellular decisions and 2) that these cells' decisions require a finite amount of time to be triggered. These two assumptions have been gaining experimental support. It is now well established that T cells activation requires a considerable amount of time [2]. Experimental observations also suggest that interactions of T cells with APCs could be better modeled as cellular decisions rather than conventional probabilistic reactions [3],[4]. As a result from these assumptions the cellular frustration framework (CFF) is capable of reconciling two apparently opposing phenomena, namely high reactivity against nonself with total tolerance towards self [4].
VSD: A Framework of Stackable Virtual Snapshot Device
Authors: Na Wen-wu, Zhu Xu-dong, Ke Jian, Xu Jin-ping, Zhang Jun-wei, Bu Qing-zhong, Xu Lu
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

On demand of various applications for storage virtualization, this paper presents a stackable block-level virtual snapshot device (VSD) based on the virtual storage pool. With the strategy of stackable block device, VSD employs a read-only snapshot model with serial connection, and a tree model mixed with serial and parallel connection for writable snapshot. Moreover, two data updating schemes, Copy on Write and Realloc on Write, are integrated into VSD. Thus, VSD supports various applications such as data backup and recovery, data version management and volume clone and so on. Finally, the storage requirements and I/O performance of VSD are evaluated.
Adaptive Learning from Evolving Data Streams
Authors: Albert Bifet, Ricard Gavaldà
Venue: Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII (2009)

We propose and illustrate a method for developing algorithms that can adaptively learn from data streams that drift over time. As an example, we take Hoeffding Tree, an incremental decision tree inducer for data streams, and use as a basis it to build two new methods that can deal with distribution and concept drift: a sliding window-based algorithm, Hoeffding Window Tree, and an adaptive method, Hoeffding Adaptive Tree. Our methods are based on using change detectors and estimator modules at the right places; we choose implementations with theoretical guarantees in order to extend such guarantees to the resulting adaptive learning algorithm. A main advantage of our methods is that they require no guess about how fast or how often the stream will drift; other methods typically have several user-defined parameters to this effect.In our experiments, the new methods never do worse, and in some cases do much better, than CVFDT, a well-known method for tree induction on data streams with drift.
A Generic User Modeling Component for Hybrid Recommendation Strategies
Authors: Markus Jessenitschnig, Markus Zanker
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Over the last decade, recommendation systems (RS) have matured into a valuable approach for assisting online customers in navigating through large product or information spaces. The associated research has described and evaluated a variety of different techniques for proposing items of interest to customers. However, each of these techniques also suffers from several shortcomings. Therefore, depending on the application domain and the availability of background knowledge some algorithms and hybrid variants may be more applicable than others. However, most commercial recommendation systems are monolithic in the sense that they support only a limited subset of recommendation techniques.In this paper we therefore present ISeller, a proven industrial-strength recommendation framework for personalizing small to medium-scale e-commerce platforms. ISeller supports all basic recommendation techniques and, due to its modular architecture, hybrid variants as well. This paper focuses in particular on the generic user modelingcomponent of ISeller as it is the prerequisite for supporting different recommendation techniques within the same application infrastructure. Furthermore, we present an application scenario showing the generic nature and wide applicability of the described user modeling component in the domain of map-based recommendations.
Improved side information generation for distributed video coding by exploiting spatial and temporal correlations
Authors: Shuiming Ye, Mourad Ouaret, Frederic Dufaux, Touradj Ebrahimi
Venue: Journal on Image and Video Processing (2009)

Distributed video coding (DVC) is a video coding paradigm allowing low complexity encoding for emerging applications such as wireless video surveillance. Side information (SI) generation is a key function in the DVC decoder, and plays a key-role in determining the performance of the codec. This paper proposes an improved SI generation for DVC, which exploits both spatial and temporal correlations in the sequences. Partially decoded Wyner-Ziv (WZ) frames, based on initial SI bymotion compensated temporal interpolation, are exploited to improve the performance of the whole SI generation. More specifically, an enhanced temporal frame interpolation is proposed, including motion vector refinement and smoothing, optimal compensation mode selection, and a new matching criterion for motion estimation. The improved SI technique is also applied to a new hybrid spatial and temporal error concealment scheme to conceal errors in WZ frames. Simulation results show that the proposed scheme can achieve up to 1.0 dB improvement in rate distortion performance in WZ frames for video with high motion, when compared to state-of-the-art DVC. In addition, both the objective and perceptual qualities of the corrupted sequences are significantly improved by the proposed hybrid error concealment scheme, outperforming both spatial and temporal concealments alone.