OpenRaiser/Intern-Atlas huggingface dataset:
Extending the adverbial coverage of a NLP oriented resource for French
Venue: arXiv cs.CL 2011
Year: 2011

This paper presents a work on extending the adverbial entries of LGLex: a NLP oriented syntactic resource for French. Adverbs were extracted from the Lexicon-Grammar tables of both simple adverbs ending in -ment '-ly' (Molinier and Levrier, 2000) and compound adverbs (Gross, 1986; 1990). This work relies on the exploitation of fine-grained linguistic information provided in existing resources. Various features are encoded in both LG tables and they haven't been exploited yet. They describe the relations of deleting, permuting, intensifying and paraphrasing that associate, on the one hand, the simple and compound adverbs and, on the other hand, different types of compound adverbs. The resulting syntactic resource is manually evaluated and freely available under the LGPL-LR license.
Preliminary Analysis of Google+'s Privacy
Venue: arXiv cs.SI 2011
Year: 2011

In this paper we provide a preliminary analysis of Google+ privacy. We identified that Google+ shares photo metadata with users who can access the photograph and discuss its potential impact on privacy. We also identified that Google+ encourages the provision of other names including maiden name, which may help criminals performing identity theft. We show that Facebook lists are a superset of Google+ circles, both functionally and logically, even though Google+ provides a better user interface. Finally we compare the use of encryption and depth of privacy control in Google+ versus in Facebook.
An Experimental Investigation of SIMO, MIMO, Interference-Alignment (IA) and Coordinated Multi-Point (CoMP)
Venue: arXiv cs.IT 2011
Year: 2011

In this paper we present experimental implementations of interference alignment (IA) and coordinated multi-point transmission (CoMP). We provide results for a system with three base-stations and three mobile-stations all having two antennas. We further employ OFDM modulation, with high-order constellations, and measure many positions both line-of-sight and non-line-of-sight under interference limited conditions. We find the CoMP system to perform better than IA at the cost of a higher back-haul capacity requirement. During the measurements we also logged the channel estimates for off-line processing. We use these channel estimates to calculate the performance under ideal conditions. The performance estimates obtained this way is substantially higher than what is actually observed in the end-to-end transmissions---in particular in the CoMP case where the theoretical performance is very high. We find the reason for this discrepancy to be the impact of dirty-RF effects such as phase-noise and non-linearities. We are able to model the dirty-RF effects to some extent. These models can be used to simulate more complex systems and still account for the dirty-RF effects (e.g., systems with tens of mobiles and base-stations). Both IA and CoMP perform better than reference implementations of single-user SIMO and MIMO in our measurements.
CBLOCK: An Automatic Blocking Mechanism for Large-Scale De-duplication Tasks
Venue: arXiv cs.DB 2011
Year: 2011

De-duplication---identification of distinct records referring to the same real-world entity---is a well-known challenge in data integration. Since very large datasets prohibit the comparison of every pair of records, {\em blocking} has been identified as a technique of dividing the dataset for pairwise comparisons, thereby trading off {\em recall} of identified duplicates for {\em efficiency}. Traditional de-duplication tasks, while challenging, typically involved a fixed schema such as Census data or medical records. However, with the presence of large, diverse sets of structured data on the web and the need to organize it effectively on content portals, de-duplication systems need to scale in a new dimension to handle a large number of schemas, tasks and data sets, while handling ever larger problem sizes. In addition, when working in a map-reduce framework it is important that canopy formation be implemented as a {\em hash function}, making the canopy design problem more challenging. We present CBLOCK, a system that addresses these challenges. CBLOCK learns hash functions automatically from attribute domains and a labeled dataset consisting of duplicates. Subsequently, CBLOCK expresses blocking functions using a hierarchical tree structure composed of atomic hash functions. The application may guide the automated blocking process based on architectural constraints, such as by specifying a maximum size of each block (based on memory requirements), impose disjointness of blocks (in a grid environment), or specify a particular objective function trading off recall for efficiency. As a post-processing step to automatically generated blocks, CBLOCK {\em rolls-up} smaller blocks to increase recall. We present experimental results on two large-scale de-duplication datasets at Yahoo!---consisting of over 140K movies and 40K restaurants respectively---and demonstrate the utility of CBLOCK.
Diversity of the MMSE receiver in flat fading and frequency selective MIMO channels at fixed rate
Venue: arXiv cs.IT 2011
Year: 2011

In this contribution, the evaluation of the diversity of the MIMO MMSE receiver is addressed for finite rates in both flat fading channels and frequency selective fading channels with cyclic prefix. It has been observed recently that in contrast with the other MIMO receivers, the MMSE receiver has a diversity depending on the aimed finite rate, and that for sufficiently low rates the MMSE receiver reaches the full diversity - that is, the diversity of the ML receiver. This behavior has so far only been partially explained. The purpose of this paper is to provide complete proofs for flat fading MIMO channels, and to improve the partial existing results in frequency selective MIMO channels with cyclic prefix.
Good Pairs of Adjacency Relations in Arbitrary Dimensions
Venue: arXiv cs.CV 2011
Year: 2011

In this text we show, that the notion of a "good pair" that was introduced in the paper "Digital Manifolds and the Theorem of Jordan-Brouwer" has actually known models. We will show, how to choose cubical adjacencies, the generalizations of the well known 4- and 8-neighborhood to arbitrary dimensions, in order to find good pairs. Furthermore, we give another proof for the well known fact that the Khalimsky-topology implies good pairs. The outcome is consistent with the known theory as presented by T.Y. Kong, A. Rosenfeld, G.T. Herman and M. Khachan et.al and gives new insights in higher dimensions.
A Tool for Model-Based Language Specification
Venue: arXiv cs.SE 2011
Year: 2011

Formal languages let us define the textual representation of data with precision. Formal grammars, typically in the form of BNF-like productions, describe the language syntax, which is then annotated for syntax-directed translation and completed with semantic actions. When, apart from the textual representation of data, an explicit representation of the corresponding data structure is required, the language designer has to devise the mapping between the suitable data model and its proper language specification, and then develop the conversion procedure from the parse tree to the data model instance. Unfortunately, whenever the format of the textual representation has to be modified, changes have to propagated throughout the entire language processor tool chain. These updates are time-consuming, tedious, and error-prone. Besides, in case different applications use the same language, several copies of the same language specification have to be maintained. In this paper, we introduce a model-based parser generator that decouples language specification from language processing, hence avoiding many of the problems caused by grammar-driven parsers and parser generators.
The Numerical Generalized Least-Squares Estimator of an Unknown Constant Mean of Random Field
Venue: arXiv cs.NA 2011
Year: 2011

We constraint on computer the best linear unbiased generalized statistics of random field for the best linear unbiased generalized statistics of an unknown constant mean of random field and derive the numerical generalized least-squares estimator of an unknown constant mean of random field. We derive the third constraint of spatial statistics and show that the classic generalized least-squares estimator of an unknown constant mean of the field is only an asymptotic disjunction of the numerical one.
A Single Euler Number Feature for Multi-font Multi-size Kannada Numeral Recognition
Venue: arXiv cs.CV 2011
Year: 2011

In this paper a novel approach is proposed based on single Euler number feature which is free from thinning and size normalization for multi-font and multi-size Kannada numeral recognition system. A nearest neighbor classification is used for classification of Kannada numerals by considering the Euclidian distance. A total 1500 numeral images with different font sizes between (10..84) are tested for algorithm efficiency and the overall the classification accuracy is found to be 99.00% .The said method is thinning free, fast, and showed encouraging results on varying font styles and sizes of Kannada numerals.
Full Restoration of Visual Encrypted Color Images
Venue: arXiv cs.CR 2011
Year: 2011

While strictly black and white images have been the basis for visual cryptography, there has been a lack of an easily implemented format for colour images. This paper establishes a simple, yet secure way of implementing visual cryptography with colour, assuming a binary data representation.
Parametrized Stochastic Multi-armed Bandits with Binary Rewards
Venue: arXiv cs.LG 2011
Year: 2011

In this paper, we consider the problem of multi-armed bandits with a large, possibly infinite number of correlated arms. We assume that the arms have Bernoulli distributed rewards, independent across time, where the probabilities of success are parametrized by known attribute vectors for each arm, as well as an unknown preference vector, each of dimension $n$. For this model, we seek an algorithm with a total regret that is sub-linear in time and independent of the number of arms. We present such an algorithm, which we call the Two-Phase Algorithm, and analyze its performance. We show upper bounds on the total regret which applies uniformly in time, for both the finite and infinite arm cases. The asymptotics of the finite arm bound show that for any $f \in ω(\log(T))$, the total regret can be made to be $O(n \cdot f(T))$. In the infinite arm case, the total regret is $O(\sqrt{n^3 T})$.
Multi-variate Quickest Detection of Significant Change Process
Venue: arXiv cs.GT 2011
Year: 2011

The paper deals with a mathematical model of a surveillance system based on a net of sensors. The signals acquired by each node of the net are Markovian process, have two different transition probabilities, which depends on the presence or absence of an intruder nearby. The detection of the transition probability change at one node should be confirmed by a detection of similar change at some other sensors. Based on a simple game the model of a fusion center is then constructed. The aggregate function defined on the net is the background of the definition of a non-cooperative stopping game which is a model of the multivariate disorder detection.
Greening File Distribution: Centralized or Distributed?
Venue: arXiv cs.NI 2011
Year: 2011

Despite file-distribution applications are responsible for a major portion of the current Internet traffic, so far little effort has been dedicated to study file distribution from the point of view of energy efficiency. In this paper, we present a first approach at the problem of energy efficiency for file distribution. Specifically, we first demonstrate that the general problem of minimizing energy consumption in file distribution in heterogeneous settings is NP-hard. For homogeneous settings, we derive tight lower bounds on energy consumption, and we design a family of algorithms that achieve these bounds. Our results prove that collaborative p2p schemes achieve up to 50% energy savings with respect to the best available centralized file distribution scheme. Through simulation, we demonstrate that in more realistic cases (e.g., considering network congestion, and link variability across hosts) we validate this observation, since our collaborative algorithms always achieve significant energy savings with respect to the power consumption of centralized file distribution systems.
On the Transience of Linear Max-Plus Dynamical Systems
Venue: arXiv cs.DM 2011
Year: 2011

We study the transients of linear max-plus dynamical systems. For that, we consider for each irreducible max-plus matrix A, the weighted graph G(A) such that A is the adjacency matrix of G(A). Based on a novel graph-theoretic counterpart to the number-theoretic Brauer's theorem, we propose two new methods for the construction of arbitrarily long paths in G(A) with maximal weight. That leads to two new upper bounds on the transient of a linear max-plus system which both improve on the bounds previously given by Even and Rajsbaum (STOC 1990, Theory of Computing Systems 1997), by Bouillard and Gaujal (Research Report 2000), and by Soto y Koelemeijer (PhD Thesis 2003), and are, in general, incomparable with Hartmann and Arguelles' bound (Mathematics of Operations Research 1999). With our approach, we also show how to improve the latter bound by a factor of two. A significant benefit of our bounds is that each of them turns out to be linear in the size of the system in various classes of linear max-plus system whereas the bounds previously given are all at least quadratic. Our second result concerns the relationship between matrix and system transients: We prove that the transient of an NxN matrix A is, up to some constant, equal to the transient of an A-linear system with an initial vector whose norm is quadratic in N. Finally, we study the applicability of our results to the well-known Full Reversal algorithm whose behavior can be described as a min-plus linear system.
A self-portrait of young Leonardo
Venue: arXiv cs.CV 2011
Year: 2011

One of the most famous drawings by Leonardo da Vinci is a self-portrait in red chalk, where he looks quite old. In fact, there is a sketch in one of his notebooks, partially covered by written notes, that can be a self-portrait of the artist when he was young. The use of image processing, to remove the handwritten text and improve the image, allows a comparison of the two portraits.
Facial Asymmetry and Emotional Expression
Venue: arXiv cs.CV 2011
Year: 2011

This report is about facial asymmetry, its connection to emotional expression, and methods of measuring facial asymmetry in videos of faces. The research was motivated by two factors: firstly, there was a real opportunity to develop a novel measure of asymmetry that required minimal human involvement and that improved on earlier measures in the literature; and secondly, the study of the relationship between facial asymmetry and emotional expression is both interesting in its own right, and important because it can inform neuropsychological theory and answer open questions concerning emotional processing in the brain. The two aims of the research were: first, to develop an automatic frame-by-frame measure of facial asymmetry in videos of faces that improved on previous measures; and second, to use the measure to analyse the relationship between facial asymmetry and emotional expression, and connect our findings with previous research of the relationship.
Compiler Optimization: A Case for the Transformation Tool Contest
Venue: arXiv cs.PL 2011
Year: 2011

An optimizing compiler consists of a front end parsing a textual programming language into an intermediate representation (IR), a middle end performing optimizations on the IR, and a back end lowering the IR to a target representation (TR) built of operations supported by the target hardware. In modern compiler construction graph-based IRs are employed. Optimization and lowering tasks can then be implemented with graph transformation rules. This case provides two compiler tasks to evaluate the participating tools regarding performance.
Solving the TTC 2011 Compiler Optimization Case with QVTR-XSLT
Venue: arXiv cs.SE 2011
Year: 2011

In this short paper we present our solution for the Compiler Optimization case study of the Transformation Tool Contest (TTC) 2011 using the QVTR-XSLT tool. The tool supports editing and execution of the graphical notation of QVT Relations language
Solving the TTC 2011 Reengineering Case with GReTL
Venue: arXiv cs.SE 2011
Year: 2011

This paper discusses the GReTL reference solution of the TTC 2011 Reengineering case. Given a Java syntax graph, a simple state machine model has to be extracted. The submitted solution covers both the core task and the two extension tasks.
Saying Hello World with GReTL - A Solution to the TTC 2011 Instructive Case
Venue: arXiv cs.SE 2011
Year: 2011

This paper discusses the GReTL solution of the TTC 2011 Hello World case. The submitted solution covers all tasks including the optional ones.
Saying Hello World with UML-RSDS - A Solution to the 2011 Instructive Case
Venue: arXiv cs.SE 2011
Year: 2011

In this paper we apply the UML-RSDS notation and tools to the "Hello World" case studies and explain the underlying development process for this model transformation approach.
Renewal-Theoretical Dynamic Spectrum Access in Cognitive Radio Networks with Unknown Primary Behavior
Venue: arXiv cs.NI 2011
Year: 2011

Dynamic spectrum access in cognitive radio networks can greatly improve the spectrum utilization efficiency. Nevertheless, interference may be introduced to the Primary User (PU) when the Secondary Users (SUs) dynamically utilize the PU's licensed channels. If the SUs can be synchronous with the PU's time slots, the interference is mainly due to their imperfect spectrum sensing of the primary channel. However, if the SUs have no knowledge about the PU's exact communication mechanism, additional interference may occur. In this paper, we propose a dynamic spectrum access protocol for the SUs confronting with unknown primary behavior and study the interference caused by their dynamic access. Through analyzing the SUs' dynamic behavior in the primary channel which is modeled as an ON-OFF process, we prove that the SUs' communication behavior is a renewal process. Based on the Renewal Theory, we quantify the interference caused by the SUs and derive the corresponding close-form expressions. With the interference analysis, we study how to optimize the SUs' performance under the constraints of the PU's communication quality of service (QoS) and the secondary network's stability. Finally, simulation results are shown to verify the effectiveness of our analysis.
Leveraging User Profile and Behaviour to Design Practical Spreadsheet Controls for the Finance Function
Venue: arXiv cs.SE 2011
Year: 2011

Recognizing that the use of spreadsheets within finance will likely not subside in the near future, this paper discusses a major barrier that is preventing more organizations from adopting enterprise spreadsheet management programs. But even without a corporate mandated effort to improve spreadsheet controls, finance functions can still take simple yet effective steps to start managing the risk of errors in key spreadsheets by strategically selecting controls that complement existing user practice
A Theory for Optical flow-based Transport on Image Manifolds
Venue: arXiv cs.CV 2011
Year: 2011

An image articulation manifold (IAM) is the collection of images formed when an object is articulated in front of a camera. IAMs arise in a variety of image processing and computer vision applications, where they provide a natural low-dimensional embedding of the collection of high-dimensional images. To date IAMs have been studied as embedded submanifolds of Euclidean spaces. Unfortunately, their promise has not been realized in practice, because real world imagery typically contains sharp edges that render an IAM non-differentiable and hence non-isometric to the low-dimensional parameter space under the Euclidean metric. As a result, the standard tools from differential geometry, in particular using linear tangent spaces to transport along the IAM, have limited utility. In this paper, we explore a nonlinear transport operator for IAMs based on the optical flow between images and develop new analytical tools reminiscent of those from differential geometry using the idea of optical flow manifolds (OFMs). We define a new metric for IAMs that satisfies certain local isometry conditions, and we show how to use this metric to develop a new tools such as flow fields on IAMs, parallel flow fields, parallel transport, as well as a intuitive notion of curvature. The space of optical flow fields along a path of constant curvature has a natural multi-scale structure via a monoid structure on the space of all flow fields along a path. We also develop lower bounds on approximation errors while approximating non-parallel flow fields by parallel flow fields.
A New IRIS Normalization Process For Recognition System With Cryptographic Techniques
Venue: arXiv cs.CV 2011
Year: 2011

Biometric technologies are the foundation of personal identification systems. It provides an identification based on a unique feature possessed by the individual. This paper provides a walkthrough for image acquisition, segmentation, normalization, feature extraction and matching based on the Human Iris imaging. A Canny Edge Detection scheme and a Circular Hough Transform, is used to detect the iris boundaries in the eye's digital image. The extracted IRIS region was normalized by using Image Registration technique. A phase correlation base method is used for this iris image registration purpose. The features of the iris region is encoded by convolving the normalized iris region with 2D Gabor filter. Hamming distance measurement is used to compare the quantized vectors and authenticate the users. To improve the security, Reed-Solomon technique is employed directly to encrypt and decrypt the data. Experimental results show that our system is quite effective and provides encouraging performance. Keywords: Biometric, Iris Recognition, Phase correlation, cryptography, Reed-Solomon
Robot Companions: Technology for Humans
Venue: arXiv cs.RO 2011
Year: 2011

Creation of devices and mechanisms which help people has a long history. Their inventors always targeted practical goals such as irrigation, harvesting, devices for construction sites, measurement, and, last but not least, military tasks for different mechanical and later mechatronic systems. Development of such assisting mechanisms counts back to Greek engineering, came through Middle Ages and led finally in XIX and XX centuries to autonomous devices, which we call today "Robots". This chapter provides overview of several robotic technologies, introduces bio-/chemo- hybrid and collective systems and discuss their applications in service areas.
A New Proposed Technique to Improve Software Regression Testing Cost
Venue: arXiv cs.SE 2011
Year: 2011

In this article, we describe the regression test process to test and verify the changes made on software. A developed technique use the automation test based on decision tree and test selection process in order to reduce the testing cost is given. The developed technique is applied to a practical case and the result show its improvement.