Informatics

A Fast Hierarchical Method for Multi-script and Arbitrary Oriented Scene Text Extraction
Typography and layout lead to the hierarchical organisation of text in words,text lines, paragraphs. This inherent structure is a key property of text inany script and language, which has nonetheless been minimally leveraged byexisting text detection methods. This paper addresses the problem of textsegmentation in natural scenes from a hierarchical perspective. Contrary toexisting methods, we m...


Directed Multicut with linearly ordered terminals
Motivated by an application in network security, we investigate the following"linear" case of Directed Mutlicut. Let $G$ be a directed graph which includessome distinguished vertices $t_1, ldots, t_k$. What is the size of thesmallest edge cut which eliminates all paths from $t_i$ to $t_j$ for all $i ...
Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom
We consider the problem of verifying deadlock freedom for symmetric cachecoherence protocols. In particular, we focus on a specific form of deadlockwhich is useful for the cache coherence protocol domain and consistent with theinternal definition of deadlock in the Murphi model checker: we refer to thisdeadlock as a system- wide deadlock (s-deadlock). In s-deadlock, the entiresystem gets blocke...


An Optimal Game Theoretical Framework for Mobility Aware Routing in Mobile Ad hoc Networks
Selfish behaviors are common in self-organized Mobile Ad hoc Networks(MANETs) where nodes belong to different authorities. Since cooperation ofnodes is essential for routing protocols, various methods have been proposed tostimulate cooperation among selfish nodes. In order to provide sufficientincentives, most of these methods pay nodes a premium over their actual costsof participation. However...
A Fast Synchronization Clustering Algorithm
This paper presents a Fast Synchronization Clustering algorithm (FSynC),which is an improved version of SynC algorithm. In order to decrease the timecomplexity of the original SynC algorithm, we combine grid cell partitioningmethod and Red-Black tree to construct the near neighbor point set of everypoint. By simulated experiments of some artificial data sets and several realdata sets, we observ...


Parallelism-Aware Memory Interference Delay Analysis for COTS Multicore Systems
In modern Commercial Off-The-Shelf (COTS) multicore systems, each core cangenerate many parallel memory requests at a time. The processing of theseparallel requests in the DRAM controller greatly affects the memoryinterference delay experienced by running tasks on the platform. In this paper,we model a modern COTS multicore system which has a nonblocking last-levelcache (LLC) and a DRAM control...
Property-Driven Fence Insertion using Reorder Bounded Model Checking
Modern architectures provide weaker memory consistency guarantees thansequential consistency. These weaker guarantees allow programs to exhibitbehaviours where the program statements appear to have executed out of programorder. Fortunately, modern architectures provide memory barriers (fences) toenforce the program order between a pair of statements if needed. Due to theintricate semantics of w...

Vertex 2-coloring without monochromatic cycles
In this paper we study a problem of vertex two-coloring of undirected graphsuch that there is no monochromatic cycle of given length. We show that thisproblem is hard to solve. We give a proof by presenting a reduction fromvariation of satisfiability (SAT) problem. We show nice properties of coloringcliques with two colors which plays pivotal role in the reduction construction.
'Almost Sure' Chaotic Properties of Machine Learning Methods
It has been demonstrated earlier that universal computation is 'almostsurely' chaotic. Machine learning is a form of computational fixed pointiteration, iterating over the computable function space. We showcase someproperties of this iteration, and establish in general that the iteration is'almost surely' of chaotic nature. This theory explains the observation in thecounter intuitive properties...

A Numerical Optimization Algorithm Inspired by the Strawberry Plant
This paper proposes a new numerical optimization algorithm inspired by thestrawberry plant for solving complicated engineering problems. Plants likestrawberry develop both runners and roots for propagation and search for waterresources and minerals. In these plants, runners and roots can be thought of astools for global and local searches, respectively. The proposed algorithm hasthree main diff...
Text Classification Using Association Rules, Dependency Pruning and Hyperonymization
We present new methods for pruning and enhancing item- sets for textclassification via association rule mining. Pruning methods are based ondependency syntax and enhancing methods are based on replacing words by theirhyperonyms of various orders. We discuss the impact of these methods, comparedto pruning based on tfidf rank of words.

A Taxonomy and Survey on eScience as a Service in the Cloud
Cloud computing has recently evolved as a popular computing infrastructurefor many applications. Scientific computing, which was mainly hosted in privateclusters and grids, has started to migrate development and deployment to thepublic cloud environment. eScience as a service becomes an emerging andpromising direction for science computing. We review recent efforts indeveloping and deploying sc...
Analysis of Timed and Long-Run Objectives for Markov Automata
Markov automata (MAs) extend labelled transition systems with random delaysand probabilistic branching. Action-labelled transitions are instantaneous andyield a distribution over states, whereas timed transitions impose a randomdelay governed by an exponential distribution. MAs are thus a nondeterministicvariation of continuous-time Markov chains. MAs are compositional and are usedto provide a ...
A Digital Watermarking Approach Based on DCT Domain Combining QR Code and Chaotic Theory
This paper proposes a robust watermarking approach based on Discrete CosineTransform domain that combines Quick Response Code and chaotic system.
Price of Anarchy of Innovation Diffusion in Social Networks
There have been great efforts in studying the cascading behavior in socialnetworks such as the innovation diffusion, etc. Game theoretically, in a socialnetwork where individuals choose from two strategies: A (the innovation) and B(the status quo) and get payoff from their neighbors for coordination, it haslong been known that the Price of Anarchy (PoA) of this game is not 1, sincethe Nash equi...