ppxscal/embedding_network huggingface dataset:
A fast method for parallel document identification
Authors: Jessica Enright, Grzegorz Kondrak
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

We present a fast method to identify homogeneous parallel documents. The method is based on collecting counts of identical low-frequency words between possibly parallel documents. The candidate with the most shared low-frequency words is selected as the parallel document. The method achieved 99.96% accuracy when tested on the EUROPARL corpus of parliamentary proceedings, failing only in anomalous cases of truncated or otherwise distorted documents. While other work has shown similar performance on this type of dataset, our approach presented here is faster and does not require training. Apart from proposing an efficient method for parallel document identification in a restricted domain, this paper furnishes evidence that parliamentary proceedings may be inappropriate for testing parallel document identification systems in general.
Weight-Based Facial Expression Recognition from Near-Infrared Video Sequences
Authors: Matti Taini, Guoying Zhao, Matti Pietikäinen
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

This paper presents a novel weight-based approach to recognize facial expressions from the near-infrared (NIR) video sequences. Facial expressions can be thought of as specific dynamic textures where local appearance and motion information need to be considered. The face image is divided into several regions from which local binary patterns from three orthogonal planes (LBP-TOP) features are extracted to be used as a facial feature descriptor. The use of LBP-TOP features enables us to set different weights for each of the three planes (appearance, horizontal motion and vertical motion) inside the block volume. The performance of the proposed method is tested in the novel NIR facial expression database. Assigning different weights to the planes according to their contribution improves the performance. NIR images are shown to deal with illumination variations comparing with visible light images.
Modeling and visualization of lifecycle building performance assessment
Authors: Ipek Gursel, Sevil Sariyildiz, Ömer Akin, Rudi Stouffs
Venue: Advanced Engineering Informatics (2009)

Lifecycle building performance assessment (LBPA) ensures that buildings perform and operate as intended during building lifecycle. Such assessment activities are typically multi-phase and multi-disciplinary, and generate large amounts of information that need efficient management. During the lifecycle of one building, multiple assessment methods are employed semi-concurrently and with a great deal of information overlap between successive phases. This information is semantically rich and context-dependent, reflecting the local perspective that it exists within. Usage of separate and disconnected tools for each method results in information fragmentation and redundancy, posing problems for well-informed decision making. The objective of this research is to develop an integral reference model, CLIP (Computational support for Lifecycle Integral Performance assessment), that aims to improve the efficiency and quality of existing performance assessment practices. The model provides flexible, modular, and extensible data structures and algorithms for the representation, transformation, integration, and visualization of performance information. The initial results support the CLIP model's ability to deal with the local volatility and variation in the processes and information content that is being managed, while requiring further refinement and extension work to achieve a customized solution to fit in different contextual settings.
An approach for data-driven and logic-based complex Event Processing
Authors: Darko Anicic, Paul Fodor, Nenad Stojanovic, Roland Stühmer
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

In this paper, we present a powerful logic-based approach for Complex Event Processing (CEP). The approach is founded on a logical transformation of event processing into logic programs. Many systems for event processing have ad-hoc semantics with unexpected behaviors. Further on, many formal approaches (with well defined semantics) cannot effectively be used in CEP, due to their inability to compute events in the data-driven fashion. Our approach enables both logic-based and data-driven complex event detection. Moreover, the backward chaining approach allows for very efficient reasoning of complex events and actions triggered by these events.
Refinement of Trace Abstraction
Authors: Matthias Heizmann, Jochen Hoenicke, Andreas Podelski
Venue: Proceedings of the 16th International Symposium on Static Analysis (2009)

We present a new counterexample-guided abstraction refinement scheme. The scheme refines an over-approximation of the set of possible traces. Each refinement step introduces a finite automaton that recognizes a set of infeasible traces. A central idea enabling our approach is to use interpolants (assertions generated, e.g., by the infeasibility proof for an error trace) in order to automatically construct such an automaton. A data base of interpolant automata has an interesting potential for reuse of theorem proving work (from one program to another).
Detect Digital Image Splicing with Visual Cues
Authors: Zhenhua Qu, Guoping Qiu, Jiwu Huang
Venue: Information Hiding: 11th International Workshop, IH 2009, Darmstadt, Germany, June 8-10, 2009, Revised Selected Papers (2009)

Image splicing detection has been considered as one of the most challenging problems in passive image authentication. In this paper, we propose an automatic detection framework to identify a spliced image. Distinguishing from existing methods, the proposed system is based on a human visual system (HVS) model in which visual saliency and fixation are used to guide the feature extraction mechanism. An interesting and important insight of this work is that there is a high correlation between the splicing borders and the first few fixation points predicted by a visual attention model using edge sharpness as visual cues. We exploit this idea to develope a digital image splicing detection system with high performance. We present experimental results which show that the proposed system outperforms the prior arts. An additional advantage offered by the proposed system is that it provides a convenient way of localizing the splicing boundaries.
IT-Enabled Survey and Its Problems: Analyses of an Australian Internet Poll
Authors: Memiko Ootsuki, Tetsuro Kobayashi, Noboru Sonehara
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

The use of web-based surveys has expanded rapidly during the past few years as the number of Internet users increased. However, lack of representativeness cause hesitation in utilizing data collected via the internet as compared to more conventional sampling methodology. This paper analyses the problem of non-representativeness in open online surveys using a passive sampling method, taking as an example the results of the ANU Internet Opinion Poll (ANU Poll) conducted in research on the 2004 Australian federal election. It clarifies that the sampling bias in online polls causes inaccurate statistical inferences.
UTH: SVM-based semantic relation classification using physical sizes
Authors: Eiji Aramaki, Takeshi Imai, Kengo Miyo, Kazuhiko Ohe
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

Although researchers have shown increasing interest in extracting/classifying semantic relations, most previous studies have basically relied on lexical patterns between terms. This paper proposes a novel way to accomplish the task: a system that captures a physical size of an entity. Experimental results revealed that our proposed method is feasible and prevents the problems inherent in other methods.
Games, Virtual Reality, and the Pursuit of Happiness
Authors: Marientina Gotsis
Venue: IEEE Computer Graphics and Applications (2009)

This short article describes the author's personal views and experiences with games and VR. The author outlines a skeptical, yet hopeful, review of health applications and a philosophical perspective on sustainable innovation. For every technological innovation there comes a time of disillusionment. This was the case with VR, which was presented to the world with the promise of an incredible future but never reached the masses owing to cost. Games weren't diverse enough to appeal to the masses but have come a long way, enough so that VR affordances are slowly becoming mainstream, such as sensor-based tracking and stereoscopy. In an era of a weakened global economy and healthcare in crisis mode, games focused on health topics such as exercise seem all the rage. Can computer graphics applications reduce suffering in the world and bring us closer to happiness?
Deriving a discrete approximate solution for a nonlinear dynamic system of two-phase soil media
Authors: V. V. Skopetskii, O. A. Marchenko, T. A. Samoilenko
Venue: Cybernetics and Systems Analysis (2009)

A discrete approximate generalized solution is derived for a nonlinear differential model of the dynamics of two-phase soil media and its convergence is estimated for the corresponding generalized solution in the space W 2 1 (¿).
The Impact of Reliability Evaluation on a Semi-supervised Learning Approach
Authors: Pasquale Foggia, Gennaro Percannella, Carlo Sansone, Mario Vento
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

In self-training methods, unlabeled samples are first assigned a provisional label by the classifier, and then used to extend the training set of the classifier itself. For this latter step it is important to choose only the samples whose classification is likely to be correct, according to a suitably defined reliability measure.In this paper we want to study to what extent the choice of a particular technique for evaluating the classification reliability can affect the learning performance. To this aim, we have compared five different reliability evaluators on four publicly available datasets, analyzing and discussing the obtained results.
An Improved Image Re-indexing Technique by Self Organizing Motor Maps
Authors: Sebastiano Battiato, Francesco Rundo, Filippo Stanco
Venue: Computational Color Imaging: Second International Workshop, CCIW 2009, Saint-Etienne, France, March 26-27, 2009. Revised Selected Papers (2009)

The paper presents a novel Motor Map neural network for re-indexing color mapped images. The overall learning process is able to smooth the local spatial redundancy of the indexes of the input image. Differently than before, the proposed optimization process is specifically devoted to re-organize the matrix of differences of the indexes computed according to some predefined patterns. Experimental results show that the proposed approach achieves good performances both in terms of compression ratio and zero order entropy of local differences. Also its computational complexity is competitive with previous works in the field.
Models of Culture for Virtual Human Conversation
Authors: David Traum
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

In this paper, we survey different types of Models of culture for virtual humans. Virtual humans are artificial agents that include both a visual human-like body and intelligent cognition driving action of the body. Culture covers a wide range of common knowledge of behavior and communication that can be used in a number of ways including interpreting the meaning of action, establishing identity, expressing meaning, and inference about the performer. We look at several examples of existing cultural models and point out remaining steps for a more full model of culture.
The Optimized Design and Application of Circular Morphological Filter
Authors: Che Hong, Sun Longhe
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

With an optimized structure, morphological filter is more effective to detect moving spot target in infrared image sequences. Based on the real convex figure, Morphological Filter with circular structureis designed in this paper. The neural network is introduced to optimize the filter element.The adaptive detection threshold is built based on the statistical characters. Experimental results to real data show that the detection probability of images (SNR≈2) can reach more than 98% with 1% false alarm with the optimized circular morphological filter, which detection probability is better than that with fixed element morphological filter and square morphological filter.
Non-contact Low Power EEG/ECG Electrode for High Density Wearable Biopotential Sensor Networks
Authors: Yu M. Chi, Stephen R. Deiss, Gert Cauwenberghs
Venue: Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks (2009)

A non-contact capacitive biopotential electrode with a common-mode noise suppression circuit is presented. The sensor network utilizes a single conductive sheet to establish a common body wide reference line, eliminating the need for an explicit signal ground connection. Each electrode senses the local biopotential with a differential gain of 46dB over a 1-100Hz bandwidth. Signals are digitized directly on board with a 16-bit ADC. The coin sized electrode consumes 285uA from a single 3.3V supply, and interfaces with a serial data bus for daisy-chain integration in body area sensor networks.
Detection of Pilot Errors in Data by Combining Task Modeling and Model Checking
Authors: Florian Frische, Tomasz Mistrzyk, Andreas Lüdtke
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

In this paper we show a consistent approach of using Hierarchical Task Analysis together with model checking to identify pilot errors during the interaction with cockpit automation systems in aircraft. Task analysis is used to model flight procedures which describe how to operate a specific system in a particular situation. Afterwards model checking is used to identify deviations from these procedures in empirical simulator data. We envision applying this method to automatically detect pilot errors during flight tests or pilot training.
Conflict Detection Algorithm to Minimize Locking for MPI-IO Atomicity
Authors: Saba Sehrish, Jun Wang, Rajeev Thakur
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

Many scientific applications require high-performance concurrent I/O accesses to a file by multiple processes. Those applications rely indirectly on atomic I/O capabilities in order to perform updates to structured datasets, such as those stored in HDF5 format files. Current support for atomicity in MPI-IO is provided by locking around the operations, imposing lock overhead in all situations, even though in many cases these operations are non-overlapping in the file. We propose to isolate non-overlapping accesses from overlapping ones in independent I/O cases, allowing the non-overlapping ones to proceed without imposing lock overhead. To enable this, we have implemented an efficient conflict detection algorithm in MPI-IO using MPI file views and datatypes. We show that our conflict detection scheme incurs minimal overhead on I/O operations, making it an effective mechanism for avoiding locks when they are not needed.
Postprocessing, readout and packaging methods for integrated gas flow sensors
Authors: P. Bruschi, M. Piotto, N. Bacci
Venue: Microelectronics Journal (2009)

Two different architectures of integrated thermal flow meters based on a differential temperature configuration are investigated. A standard structure made up of a heater placed between two temperature probes has been compared to a recently proposed variant equipped with a double heater. The latter has shown a different dependence of the response on gas type when driven in a closed loop fashion. The possibility of using this architecture to compensate the intrinsic sensor offset has also been proposed. Devices have been fabricated by means of a simple and low cost postprocessing technique applied to chips fabricated with two distinct commercial processes. Postprocessing variants, imposed by the sophistication of modern processes, have been proposed and discussed. A compact gas flow sensor with the readout electronics integrated on the same chip has been fabricated and characterized. Experimental results on this device and new data on double heater structures have been discussed and compared with the reviewed data of previously presented devices.
Computing deep facet-defining disjunctive cuts for mixed-integer programming
Authors: Florent Cadoux
Venue: Mathematical Programming: Series A and B (2009)

The problem of separation is to find an affine hyperplane, or &#x201c;cut&#x201d;, that lies between the origin O and a given closed convex set Q in a Euclidean space. We study cuts which are deep in a well-defined geometrical sense, and facet-defining. The cases when the deepest cut is decomposable as a combination of facet-defining cuts are characterized using the reverse polar set. When Q is a disjunctive polyhedron, a description of the reverse polar, linked to the so-called cut generating linear program of lift-and-project techniques, is given. A successive projections algorithm onto the reverse polar is proposed that computes the decomposition of the deepest cut into facet-defining cuts. Illustrative numerical experiments show how these cuts compare with the deepest cut, and with the most violated cut. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Effects of Information Architecture and Atmosphere Style on the Usability of an Ecology Education Website
Authors: Chao-Jen Ku, Ji-Liang Doong, Li-Chieh Chen
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Ecology education is an important issue nowadays. But not everyone has equal opportunities to learn relevant topics through direct access to the great nature. In such a case, the platform of Web becomes the potential channel for people to learn ecological topics. Therefore, the key to success is to enhance the platform so that the performance is close to that of experiencing the great nature in person. In this study, expert interview was first conducted. The participants pointed out the differences in information architectures, atmosphere styles, the differences in learners' backgrounds were important factors needed to be considered while designing such a system. Therefore, several experiment websites were constructed based on different atmosphere styles. The results revealed that there were significant differences in browsing behaviors and the usability of websites between people from rural and urban. Websites with breadth architecture and natural atmosphere could reduce user's pressure and perceived workload.
SemEval-2007 task 09: multilevel semantic annotation of Catalan and Spanish
Authors: Lluís Màrquez, Luis Villarejo, M. A. Martí, Mariona Taulé
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

In this paper we describe SemEval-2007 task number 9 (Multilevel Semantic Annotation of Catalan and Spanish). In this task, we aim at evaluating and comparing automatic systems for the annotation of several semantic linguistic levels for Catalan and Spanish. Three semantic levels are considered: noun sense disambiguation, named entity recognition, and semantic role labeling.
Cost-driven autonomous mobility
Authors: Xiao Yan Deng, Greg Michaelson, Phil Trinder
Venue: Computer Languages, Systems and Structures (2010)

Autonomous mobile programs (AMPs) offer a novel decentralised load management technology where periodic use is made of cost models to decide where to execute in a network. In this paper we demonstrate how sequential programs can be automatically converted into AMPs. The AMPs are generated by an automatic continuation cost analyser that replaces iterations with costed autonomous mobility skeletons (CAMS) that encapsulate autonomous mobility. The CAMS cost model uses an entirely novel continuation cost semantics to predict both the cost of the current iteration and the continuation cost of the remainder of the program. We show that CAMS convey significant performance advantages, e.g. reducing execution time by up to 53%; that the continuation cost models are consistent with the existing AMP cost models; and that the overheads of collecting and utilising the continuation costs are relatively small. We discuss example AMPs generated by the analyser and demonstrate that they have very similar performance to hand-costed CAMS programs.
Fast Loads and Fast Queries
Authors: Goetz Graefe
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

For efficient query processing, a relational table should be indexed in multiple ways; for efficient database loading, indexes should be omitted. Moerkotte's "small materialized aggregates" can be used to alleviate this tension, notably in the form of Netezza's "zone maps." Their most significant advantageous characteristics are that (i) load bandwidth is maximized by avoiding the cost of index maintenance, (ii) there is no need for complex index tuning, and (iii) scans for typical queries are very fast. Their most significant limiting characteristics are that (iv) they are effective only for query predicates on columns correlated with the load sequence, (v) individual outlier values can sharply reduce their effectiveness, and (vi) they fail to improve search performance within a zone.In this research, we introduce zone filters and zone indexes that address these limitations without reducing the advantages. The new data structures can be created as side effects of the load process, with all required analyses accomplished while a moderate amount of new data still remains in the buffer pool. Traditional sorting and indexing are not required. Nonetheless, query performance matches that of zxone maps where those apply, exceeds it for predicates for which zone maps are ineffective, and can be comparable to query processing in a database with traditional indexing, as demonstrated in our simulations.
Graph Reachability and Pebble Automata over Infinite Alphabets
Authors: Tony Tan
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

We study the graph reachability problem as a language over an infinite alphabet. Namely, we view a word of even lengtha0 b0 ... an b_n over an infinite alphabet as a directed graph with the symbols that appear in a0 b0 ... an bn as the vertices and (a0, b0),...,(an, bn) as the edges. We prove that for any positive integer k, k pebbles are sufficient for recognizing the existence of a path of length 2^k-1 from the vertex a0 to the vertex bn, but are not sufficient for recognizing the existence of a path of length 2^{k+1} - 2 from the vertex a0 to the vertex bn. Based on this result, we establish a number of relations among some classes of languages over infinite alphabets.