OpenRaiser/Intern-Atlas huggingface dataset:
Video Inpainting of Complex Scenes
Venue: arXiv cs.CV 2015
Year: 2015

We propose an automatic video inpainting algorithm which relies on the optimisation of a global, patch-based functional. Our algorithm is able to deal with a variety of challenging situations which naturally arise in video inpainting, such as the correct reconstruction of dynamic textures, multiple moving objects and moving background. Furthermore, we achieve this in an order of magnitude less execution time with respect to the state-of-the-art. We are also able to achieve good quality results on high definition videos. Finally, we provide specific algorithmic details to make implementation of our algorithm as easy as possible. The resulting algorithm requires no segmentation or manual input other than the definition of the inpainting mask, and can deal with a wider variety of situations than is handled by previous work. 1. Introduction. Advanced image and video editing techniques are increasingly common in the image processing and computer vision world, and are also starting to be used in media entertainment. One common and difficult task closely linked to the world of video editing is image and video " inpainting ". Generally speaking, this is the task of replacing the content of an image or video with some other content which is visually pleasing. This subject has been extensively studied in the case of images, to such an extent that commercial image inpainting products destined for the general public are available, such as Photoshop's " Content Aware fill " [1]. However, while some impressive results have been obtained in the case of videos, the subject has been studied far less extensively than image inpainting. This relative lack of research can largely be attributed to high time complexity due to the added temporal dimension. Indeed, it has only very recently become possible to produce good quality inpainting results on high definition videos, and this only in a semi-automatic manner. Nevertheless, high-quality video inpainting has many important and useful applications such as film restoration, professional post-production in cinema and video editing for personal use. For this reason, we believe that an automatic, generic video inpainting algorithm would be extremely useful for both academic and professional communities.
Phrase database Approach to structural and semantic disambiguation in English-Korean Machine Translation
Venue: arXiv cs.CL 2015
Year: 2015

In machine translation it is common phenomenon that machine-readable dictionaries and standard parsing rules are not enough to ensure accuracy in parsing and translating English phrases into Korean language, which is revealed in misleading translation results due to consequent structural and semantic ambiguities. This paper aims to suggest a solution to structural and semantic ambiguities due to the idiomaticity and non-grammaticalness of phrases commonly used in English language by applying bilingual phrase database in English-Korean Machine Translation (EKMT). This paper firstly clarifies what the phrase unit in EKMT is based on the definition of the English phrase, secondly clarifies what kind of language unit can be the target of the phrase database for EKMT, thirdly suggests a way to build the phrase database by presenting the format of the phrase database with examples, and finally discusses briefly the method to apply this bilingual phrase database to the EKMT for structural and semantic disambiguation.
Entropy-scaling search of massive biological data
Venue: arXiv cs.DS 2015
Year: 2015

Many datasets exhibit a well-defined structure that can be exploited to design faster search tools, but it is not always clear when such acceleration is possible. Here, we introduce a framework for similarity search based on characterizing a dataset's entropy and fractal dimension. We prove that searching scales in time with metric entropy (number of covering hyperspheres), if the fractal dimension of the dataset is low, and scales in space with the sum of metric entropy and information-theoretic entropy (randomness of the data). Using these ideas, we present accelerated versions of standard tools, with no loss in specificity and little loss in sensitivity, for use in three domains---high-throughput drug screening (Ammolite, 150x speedup), metagenomics (MICA, 3.5x speedup of DIAMOND [3,700x BLASTX]), and protein structure search (esFragBag, 10x speedup of FragBag). Our framework can be used to achieve "compressive omics," and the general theory can be readily applied to data science problems outside of biology.
BitSim: An Algebraic Similarity Measure for Description Logics Concepts
Venue: arXiv cs.AI 2015
Year: 2015

In this paper, we propose an algebraic similarity measure σBS (BS stands for BitSim) for assigning semantic similarity score to concept definitions in ALCH+ an expressive fragment of Description Logics (DL). We define an algebraic interpretation function, I_B, that maps a concept definition to a unique string (ω_B) called bit-code) over an alphabet Σ_B of 11 symbols belonging to L_B - the language over P B. IB has semantic correspondence with conventional model-theoretic interpretation of DL. We then define σ_BS on L_B. A detailed analysis of I_B and σ_BS has been given.
The Lock-free $k$-LSM Relaxed Priority Queue
Venue: arXiv cs.DS 2015
Year: 2015

Priority queues are data structures which store keys in an ordered fashion to allow efficient access to the minimal (maximal) key. Priority queues are essential for many applications, e.g., Dijkstra's single-source shortest path algorithm, branch-and-bound algorithms, and prioritized schedulers. Efficient multiprocessor computing requires implementations of basic data structures that can be used concurrently and scale to large numbers of threads and cores. Lock-free data structures promise superior scalability by avoiding blocking synchronization primitives, but the \emph{delete-min} operation is an inherent scalability bottleneck in concurrent priority queues. Recent work has focused on alleviating this obstacle either by batching operations, or by relaxing the requirements to the \emph{delete-min} operation. We present a new, lock-free priority queue that relaxes the \emph{delete-min} operation so that it is allowed to delete \emph{any} of the $ρ+1$ smallest keys, where $ρ$ is a runtime configurable parameter. Additionally, the behavior is identical to a non-relaxed priority queue for items added and removed by the same thread. The priority queue is built from a logarithmic number of sorted arrays in a way similar to log-structured merge-trees. We experimentally compare our priority queue to recent state-of-the-art lock-free priority queues, both with relaxed and non-relaxed semantics, showing high performance and good scalability of our approach.
Neural Network-Based Active Learning in Multivariate Calibration
Venue: arXiv cs.NE 2015
Year: 2015

In chemometrics, data from infrared or near-infrared (NIR) spectroscopy are often used to identify a compound or to analyze the composition of amaterial. This involves the calibration of models that predict the concentration ofmaterial constituents from the measured NIR spectrum. An interesting aspect of multivariate calibration is to achieve a particular accuracy level with a minimum number of training samples, as this reduces the number of laboratory tests and thus the cost of model building. In these chemometric models, the input refers to a proper representation of the spectra and the output to the concentrations of the sample constituents. The search for a most informative new calibration sample thus has to be performed in the output space of the model, rather than in the input space as in conventionalmodeling problems. In this paper, we propose to solve the corresponding inversion problem by utilizing the disagreements of an ensemble of neural networks to represent the prediction error in the unexplored component space. The next calibration sample is then chosen at a composition where the individual models of the ensemble disagree most. The results obtained for a realistic chemometric calibration example show that the proposed active learning can achieve a given calibration accuracy with less training samples than random sampling.
Achieving Multiple Goals via Voluntary Efforts and Motivation Asymmetry
Venue: arXiv cs.GT 2015
Year: 2015

The achievement of common goals through voluntary efforts of members of a group can be challenged by the high temptation of individual defection. Here, two-person one-goal assurance games are generalized to N-person, M-goal achievement games in which group members can have different motivations with respect to the achievement of the different goals. The theoretical performance of groups faced with the challenge of multiple simultaneous goals is analyzed mathematically and computationally. For two-goal scenarios one finds that "polarized" as well as "biased" groups perform well in the presence of defectors. A special case, called individual purpose games (N-person, N-goal achievements games where there is a one-to-one mapping between actors and goals for which they have a high achievement motivation) is analyzed in more detail in form of the "importance of being different theorem". It is shown that in some individual purpose games, groups of size N can successfully accomplish N goals, such that each group member is highly motivated towards the achievement of one unique goal. The game-theoretic results suggest that multiple goals as well as differences in motivations can, in some cases, correspond to highly effective groups.
Weighted Efficient Domination in Classes of $P_6$-free Graphs
Venue: arXiv cs.DM 2015
Year: 2015

In a graph $G$, an efficient dominating set is a subset $D$ of vertices such that $D$ is an independent set and each vertex outside $D$ has exactly one neighbor in $D$. The Minimum Weight Efficient Dominating Set (Min-WED) problem asks for an efficient dominating set of total minimum weight in a given vertex-weighted graph; the Maximum Weight Efficient Dominating Set (Max-WED) problem is defined similarly. The Min-WED/Max-WED is known to be $NP$-complete for $P_7$-free graphs, and is known to be polynomial time solvable for $P_5$-free graphs. However, the computational complexity of the Min-WED/Max-WED problem is unknown for $P_6$-free graphs. In this paper, we show that the Min-WED/Max-WED problem can be solved in polynomial time for two subclasses of $P_6$-free graphs, namely for ($P_6,S_{1,1,3}$)-free graphs, and for ($P_6$, bull)-free graphs.
Characterizing the Heterogeneity of the OpenStreetMap Data and Community
Venue: arXiv cs.SI 2015
Year: 2015

OpenStreetMap (OSM) constitutes an unprecedented, free, geographic information source contributed by millions of individuals, resulting in a database of great volume and heterogeneity. In this study, we characterize the heterogeneity of the entire OSM database and historical archive in the context of big data. We consider all users, geographic elements, and user contributions from an eight-year data archive, at a size of 692 GB. We rely on some nonlinear methods such as power-law statistics and head/tail breaks to uncover and illustrate the underlying scaling properties. All three aspects (users, elements, and contributions) demonstrate striking power laws or heavy-tailed distributions. The heavy-tailed distributions imply that there are far more small elements than large ones, far more inactive users than active ones, and far more lightly edited elements than heavily edited ones. Furthermore, about 500 users in the core group of the OSM are highly networked in terms of collaboration. Keywords: OpenStreetMap, big data, power laws, head/tail breaks, ht-index
A Multi-Agent System of Project Bidding Management Simulation
Venue: arXiv cs.MA 2015
Year: 2015

This paper presents a simulation model based on the general framework of Multi-Agent System (MAS) that can be used to investigate construction project bidding process. Specifically, it can be used to investigate different strategies in project bidding management from the general contractors' perspective. The effectiveness of the studied management strategies is evaluated by the quality, time and cost of bidding activities. As an implementation of MAS theory, this work is expected to test the suitability of MAS in studying construction management related problems.
Applying a formula for generator redispatch to damp interarea oscillations using synchrophasors
Venue: arXiv cs.SY 2015
Year: 2015

If an interarea oscillatory mode has insufficient damping, generator redispatch can be used to improve its damping. We explain and apply a new analytic formula for the modal sensitivity to rank the best pairs of generators to redispatch. The formula requires some dynamic power system data and we show how to obtain that data from synchrophasor measurements. The application of the formula to damp interarea modes is explained and illustrated with interarea modes of the New England 10-machine power system.
A decentralized scalable approach to voltage control of DC islanded microgrids
Venue: arXiv cs.SY 2015
Year: 2015

We propose a new decentralized control scheme for DC Islanded microGrids (ImGs) composed by several Distributed Generation Units (DGUs) with a general interconnection topology. Each local controller regulates to a reference value the voltage of the Point of Common Coupling (PCC) of the corresponding DGU. Notably, off-line control design is conducted in a Plug-and-Play (PnP) fashion meaning that (i) the possibility of adding/removing a DGU without spoiling stability of the overall ImG is checked through an optimization problem; (ii) when a DGU is plugged in or out at most neighbouring DGUs have to update their controllers and (iii) the synthesis of a local controller uses only information on the corresponding DGU and lines connected to it. This guarantee total scalability of control synthesis as the ImG size grows or DGU gets replaced. Yes, under mild approximations of line dynamics, we formally guarantee stability of the overall closed-loop ImG. The performance of the proposed controllers is analyzed simulating different scenarios in PSCAD.
Effective Handling of Urgent Jobs - Speed Up Scheduling for Computing Applications
Venue: arXiv cs.PF 2015
Year: 2015

A queue is required when a service provider is not able to handle jobs arriving over the time. In a highly flexible and dynamic environment, some jobs might demand for faster execution at run-time especially when the resources are limited and the jobs are competing for acquiring resources. A user might demand for speed up (reduced wait time) for some of the jobs present in the queue at run time. In such cases, it is required to accelerate (directly sending the job to the server) urgent jobs (requesting for speed up) ahead of other jobs present in the queue for an earlier completion of urgent jobs. Under the assumption of no additional resources, such acceleration of jobs would result in slowing down of other jobs present in the queue. In this paper, we formulate the problem of Speed Up Scheduling without acquiring any additional resources for the scheduling of on-line speed up requests posed by a user at run-time and present algorithms for the same. We apply the idea of Speed Up Scheduling to two different domains -Web Scheduling and CPU Scheduling. We demonstrate our results with a simulation based model using trace driven workload and synthetic datasets to show the usefulness of Speed Up scheduling. Speed Up provides a new way of addressing urgent jobs, provides a different evaluation criteria for comparing scheduling algorithms and has practical applications.
A Remark on Formation Control with Triangulated Laman Graphs: Genericity of Equivariant Morse Functions
Venue: arXiv cs.SY 2015
Year: 2015

This paper, as a continuing work of [1], focus on establishing the fact that if we equip a reciprocal multi-agent (RMA) system with a triangulated Laman graph (TLG), then the associated potential function is generically an equivariant Morse function, i.e, there are only finitely many critical orbits each of which is nondegenerate. Though this assumption on the potential function of being an equivariant Morse function has been used, and in fact indispensable, in several occasions. But it is actually still an open question whether it is true for a given RMA system. Thus, in this paper we will provide a confirmative answer to the question for the class of RMA systems with TLGs. The main result, as well as the analysis of this paper, has many implications for other difficult problems.
Using MongoDB for Social Networking Website
Venue: arXiv cs.DB 2015
Year: 2015

Social media is a biggest successful buzzword used in the recent time. Its success opened various opportunities for the developers. Developing any application requires storage of large data into databases. Many databases are available for the developers, Choosing the right one make development easier. MongoDB is a cross platform document oriented, schema-less database eschewed the traditional table based relational database structure in favor of JSON like documents. This article discusses various pros and cons encountered with the use of the MongoDB so that developers would be helped while choosing it wisely.
The Emergence and Dynamical Evolution of Complex Transport Networks from Simple Low-Level Behaviours
Venue: arXiv cs.ET 2015
Year: 2015

The true slime mould Physarum polycephalum is a recent well studied example of how complex transport networks emerge from simple auto-catalytic and self- organising local interactions, adapting structure and function against changing environmental conditions and external perturbation. Physarum networks also exhibit computationally desirable measures of transport efficiency in terms of overall path length, minimal connectivity and network resilience. Although significant progress has been made in mathematically modelling the behaviour of Physarum networks (and other biological transport networks) based on observed features in experimental settings, their initial emergence - and in particular their long-term persistence and evolution - is still poorly understood. We present a low-level, bottom-up, approach to the modelling of emergent transport networks. A population of simple particle-like agents coupled with paracrine chemotaxis behaviours in a dissipative environment results in the spontaneous emergence of persistent, complex structures. Second order emergent behaviours, in the form of network surface minimisation, are also observed contributing to the long term evolution and dynamics of the networks. The framework is extended to allow data presentation and the population is used to perform a direct (spatial) approximation of network minimisation problems. Three methods are employed, loosely relating to behaviours of Physarum under different environmental conditions. Finally, the low-level approach is summarised with a view to further research.
Walking through a library remotely - Why we need maps for collections and how KnoweScape can help us to make them?
Venue: arXiv cs.DL 2015
Year: 2015

There is no escape from the expansion of information, so that structuring and locating meaningful knowledge becomes ever more difficult. The question of how to order our knowledge is as old as the systematic acquisition, circulation, and storage of knowledge. Classification systems have been known since ancient times. On the Internet, one finds both classifications and taxonomies designed by information professionals and folksonomies based on social tagging. Nevertheless, a user navigating through large information spaces is still confronted with a text based search interface and a list of hits as outcome. There is still an obvious gap between a physical encounter with, for example, a librarys collection and browsing its content through an on-line catalogue. This paper starts from the need of digital scholarship for effective knowledge inquiry, revisits traditional ways to support knowledge ordering and information retrieval, and introduces into a newly funded research network where five different communities from all corners of the scientific landscape join forces in a quest for knowledge maps. It can be read as a manifesto for a newly funded specific research network KnoweScape. At the same time it is a general reflection about what one has to take into account when representing structure and evolution of data, information and knowledge and designing instruments to help scholars and others to navigate across the lands and oceans of knowledge.
Factorization of View-Object Manifolds for Joint Object Recognition and Pose Estimation
Venue: arXiv cs.CV 2015
Year: 2015

Due to large variations in shape, appearance, and viewing conditions, object recognition is a key precursory challenge in the fields of object manipulation and robotic/AI visual reasoning in general. Recognizing object categories, particular instances of objects and viewpoints/poses of objects are three critical subproblems robots must solve in order to accurately grasp/manipulate objects and reason about their environments. Multi-view images of the same object lie on intrinsic low-dimensional manifolds in descriptor spaces (e.g. visual/depth descriptor spaces). These object manifolds share the same topology despite being geometrically different. Each object manifold can be represented as a deformed version of a unified manifold. The object manifolds can thus be parameterized by its homeomorphic mapping/reconstruction from the unified manifold. In this work, we develop a novel framework to jointly solve the three challenging recognition sub-problems, by explicitly modeling the deformations of object manifolds and factorizing it in a view-invariant space for recognition. We perform extensive experiments on several challenging datasets and achieve state-of-the-art results.
Apuntes sobre teoría del comportamiento corrupto: nociones cibernéticas e informáticas para una actualización de la ecuación de Klitgaard
Venue: arXiv cs.IT 2015
Year: 2015

This essay presents an exploration of elements from information theory and cibernetics on the struggle against corruption behavior in public sector and beyond; the existence of an exemplary or corrupt ethical equilibriums are explored by updating Klitgaard corruption formula along with the presence of information pressure, entropy and cibernetics servomechanisms in digital societies, including alternatives and sistemics approaches for further anti-corruption policies implementation.
New Classes of Partial Geometries and Their Associated LDPC Codes
Venue: arXiv cs.IT 2015
Year: 2015

The use of partial geometries to construct parity-check matrices for LDPC codes has resulted in the design of successful codes with a probability of error close to the Shannon capacity at bit error rates down to $10^{-15}$. Such considerations have motivated this further investigation. A new and simple construction of a type of partial geometries with quasi-cyclic structure is given and their properties are investigated. The trapping sets of the partial geometry codes were considered previously using the geometric aspects of the underlying structure to derive information on the size of allowable trapping sets. This topic is further considered here. Finally, there is a natural relationship between partial geometries and strongly regular graphs. The eigenvalues of the adjacency matrices of such graphs are well known and it is of interest to determine if any of the Tanner graphs derived from the partial geometries are good expanders for certain parameter sets, since it can be argued that codes with good geometric and expansion properties might perform well under message-passing decoding.