OpenRaiser/Intern-Atlas huggingface dataset:
A New Path to Construct Parametric Orientation Field: Sparse FOMFE Model and Compressed Sparse FOMFE Model
Venue: arXiv cs.CV 2014
Year: 2014

Orientation field, representing the fingerprint ridge structure direction, plays a crucial role in fingerprint-related image processing tasks. Orientation field is able to be constructed by either non-parametric or parametric methods. In this paper, the advantages and disadvantages regarding to the existing non-parametric and parametric approaches are briefly summarized. With the further investigation for constructing the orientation field by parametric technique, two new models - sparse FOMFE model and compressed sparse FOMFE model are introduced, based on the rapidly developing signal sparse representation and compressed sensing theories. The experiments on high-quality fingerprint image dataset (plain and rolled print) and poor-quality fingerprint image dataset (latent print) demonstrate their feasibilities to construct the orientation field in a sparse or even compressed sparse mode. The comparisons among the state-of-art orientation field modeling approaches show that the proposed two models have the potential availability in big data-oriented fingerprint indexing tasks.
Cooperative Games with Overlapping Coalitions: Charting the Tractability Frontier
Venue: arXiv cs.GT 2014
Year: 2014

In many multiagent scenarios, agents distribute resources, such as time or energy, among several tasks. Having completed their tasks and generated profits, task payoffs must be divided among the agents in some reasonable manner. Cooperative games with overlapping coalitions (OCF games) are a recent framework proposed by Chalkiadakis et al. (2010), generalizing classic cooperative games to the case where agents may belong to more than one coalition. Having formed overlapping coalitions and divided profits, some agents may feel dissatisfied with their share of the profits, and would like to deviate from the given outcome. However, deviation in OCF games is a complicated matter: agents may decide to withdraw only some of their weight from some of the coalitions they belong to; that is, even after deviation, it is possible that agents will still be involved in tasks with non-deviators. This means that the desirability of a deviation, and the stability of formed coalitions, is to a great extent determined by the reaction of non-deviators. In this work, we explore algorithmic aspects of OCF games, focusing on the core in OCF games. We study the problem of deciding if the core of an OCF game is not empty, and whether a core payoff division can be found in polynomial time; moreover, we identify conditions that ensure that the problem admits polynomial time algorithms. Finally, we introduce and study a natural class of OCF games, Linear Bottleneck Games. Interestingly, we show that such games always have a non-empty core, even assuming a highly lenient reaction to deviations.
Towards a Practical Architecture for India Centric Internet of Things
Venue: arXiv cs.HC 2014
Year: 2014

An effective architecture for the Internet of Things (IoT), particularly for an emerging nation like India with limited technology penetration at the national scale, should be based on tangible technology advances in the present, practical application scenarios of social and entrepreneurial value, and ubiquitous capabilities that make the realization of IoT affordable and sustainable. Humans, data, communication and devices play key roles in the IoT ecosystem that we perceive. In a push towards this sustainable and practical IoT Architecture for India, we synthesize ten design paradigms to consider.
Spatially Coupled Turbo Codes: Principles and Finite Length Performance
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we give an overview of spatially coupled turbo codes (SC-TCs), the spatial coupling of parallel and serially concatenated convolutional codes, recently introduced by the authors. For presentation purposes, we focus on spatially coupled serially concatenated codes (SC-SCCs). We review the main principles of SC-TCs and discuss their exact density evolution (DE) analysis on the binary erasure channel. We also consider the construction of a family of rate-compatible SC-SCCs with simple 4-state component encoders. For all considered code rates, threshold saturation of the belief propagation (BP) to the maximum a posteriori threshold of the uncoupled ensemble is demonstrated, and it is shown that the BP threshold approaches the Shannon limit as the coupling memory increases. Finally we give some simulation results for finite lengths.
Non-Cooperativity in Bayesian Social Learning
Venue: arXiv cs.SI 2014
Year: 2014

We describe a Bayesian model for social learning of a random variable in which agents might observe each other over a directed network. The outcomes produced are compared to those from a model in which observations occur randomly over a complete graph. In both cases we observe a nontrivial level of observation which maximizes learning, though individuals have strong incentive to defect from the societal optimum. The implications of such competition over information commons are discussed.
Analysis of the Decoupled Access for Downlink and Uplink in Wireless Heterogeneous Networks
Venue: arXiv cs.NI 2014
Year: 2014

Wireless cellular networks evolve towards a heterogeneous infrastructure, featuring multiple types of Base Stations (BSs), such as Femto BSs (FBSs) and Macro BSs (MBSs). A wireless device observes multiple points (BSs) through which it can access the infrastructure and it may choose to receive the downlink (DL) traffic from one BS and send uplink (UL) traffic through another BS. Such a situation is referred to as decoupled DL/UL access. Using the framework of stochastic geometry, we derive the association probability for DL/UL. In order to maximize the average received power, as the relative density of FBSs initially increases, a large fraction of devices chooses decoupled access, i.e. receive from a MBS in DL and transmit through a FBS in UL. We analyze the impact that this type of association has on the average throughput in the system.
Performance Analysis of Micro Unmanned Airborne Communication Relays for Cellular Networks
Venue: arXiv cs.NI 2014
Year: 2014

This paper analyses the potential of utilising small unmanned-aerial-vehicles (SUAV) as wireless relays for assisting cellular network performance. Whilst high altitude wireless relays have been investigated over the past 2 decades, the new class of low cost SUAVs offers new possibilities for addressing local traffic imbalances and providing emergency coverage.We present field-test results from an SUAV test-bed in both urban and rural environments. The results show that trough-to-peak throughput improvements can be achieved for users in poor coverage zones. Furthermore, the paper reinforces the experimental study with large-scale network analysis using both stochastic geometry and multi-cell simulation results.
Cortical spatio-temporal dimensionality reduction for visual grouping
Venue: arXiv cs.CV 2014
Year: 2014

The visual systems of many mammals, including humans, is able to integrate the geometric information of visual stimuli and to perform cognitive tasks already at the first stages of the cortical processing. This is thought to be the result of a combination of mechanisms, which include feature extraction at single cell level and geometric processing by means of cells connectivity. We present a geometric model of such connectivities in the space of detected features associated to spatio-temporal visual stimuli, and show how they can be used to obtain low-level object segmentation. The main idea is that of defining a spectral clustering procedure with anisotropic affinities over datasets consisting of embeddings of the visual stimuli into higher dimensional spaces. Neural plausibility of the proposed arguments will be discussed.
BiofilmQuant: A Computer-Assisted Tool for Dental Biofilm Quantification
Venue: arXiv cs.CV 2014
Year: 2014

Dental biofilm is the deposition of microbial material over a tooth substratum. Several methods have recently been reported in the literature for biofilm quantification; however, at best they provide a barely automated solution requiring significant input needed from the human expert. On the contrary, state-of-the-art automatic biofilm methods fail to make their way into clinical practice because of the lack of effective mechanism to incorporate human input to handle praxis or misclassified regions. Manual delineation, the current gold standard, is time consuming and subject to expert bias. In this paper, we introduce a new semi-automated software tool, BiofilmQuant, for dental biofilm quantification in quantitative light-induced fluorescence (QLF) images. The software uses a robust statistical modeling approach to automatically segment the QLF image into three classes (background, biofilm, and tooth substratum) based on the training data. This initial segmentation has shown a high degree of consistency and precision on more than 200 test QLF dental scans. Further, the proposed software provides the clinicians full control to fix any misclassified areas using a single click. In addition, BiofilmQuant also provides a complete solution for the longitudinal quantitative analysis of biofilm of the full set of teeth, providing greater ease of usability.
Impact of Mobile phone in the Air and Random Access Channel RACH with Time Division Multiple Access TDMA Noise in Aircraft Avionics
Venue: arXiv cs.SY 2014
Year: 2014

Mobile phone 1800MHz band already allowed to be used in some airlines. Many studies talked about lower the mobile phone output power to the lowest of 0dBm, but seldom talk about the Random Access Channel RACH, which will emit at the highest power of 30dBm at the instant of call making and is not controllable until the connection between the Base Station and mobile is made.Hence the impact of RACH and TDMA noise generated in the aircraft.
Reducing Offline Evaluation Bias in Recommendation Systems
Venue: arXiv cs.IR 2014
Year: 2014

Recommendation systems have been integrated into the majority of large online systems. They tailor those systems to individual users by filtering and ranking information according to user profiles. This adaptation process influences the way users interact with the system and, as a consequence, increases the difficulty of evaluating a recommendation algorithm with historical data (via offline evaluation). This paper analyses this evaluation bias and proposes a simple item weighting solution that reduces its impact. The efficiency of the proposed solution is evaluated on real world data extracted from Viadeo professional social network.
The Gamification Design Problem
Venue: arXiv cs.HC 2014
Year: 2014

Under the assumptions that (i) gamification consists of various types of users that experience game design elements differently; and (ii) gamification is deployed in order to achieve some goal in the broadest sense, we pose the gamification problem as that of assigning each user a game design element that maximizes their expected contribution in order to achieve that goal. We show that this problem reduces to a statistical learning problem and suggest matrix factorization as one solution when user interaction data is given. The hypothesis is that predictive models as intelligent tools for supporting users in decision-making may also have potential to support the design process in gamification.
AIOCJ: A Choreographic Framework for Safe Adaptive Distributed Applications
Venue: arXiv cs.PL 2014
Year: 2014

We present AIOCJ, a framework for programming distributed adaptive applications. Applications are programmed using AIOC, a choreographic language suited for expressing patterns of interaction from a global point of view. AIOC allows the programmer to specify which parts of the application can be adapted. Adaptation takes place at runtime by means of rules, which can change during the execution to tackle possibly unforeseen adaptation needs. AIOCJ relies on a solid theory that ensures applications to be deadlock-free by construction also after adaptation. We describe the architecture of AIOCJ, the design of the AIOC language, and an empirical validation of the framework.
n-Valued Refined Neutrosophic Logic and Its Applications to Physics
Venue: arXiv cs.AI 2014
Year: 2014

In this paper we present a short history of logics: from particular cases of 2-symbol or numerical valued logic to the general case of n-symbol or numerical valued logic. We show generalizations of 2-valued Boolean logic to fuzzy logic, also from the Kleene and Lukasiewicz 3-symbol valued logics or Belnap 4-symbol valued logic to the most general n-symbol or numerical valued refined neutrosophic logic. Two classes of neutrosophic norm (n-norm) and neutrosophic conorm (n-conorm) are defined. Examples of applications of neutrosophic logic to physics are listed in the last section. Similar generalizations can be done for n-Valued Refined Neutrosophic Set, and respectively n- Valued Refined Neutrosopjhic Probability.
Control of nonlinear systems: a model inversion approach
Venue: arXiv cs.SY 2014
Year: 2014

A novel control design approach for general nonlinear systems is presented in this paper. The approach is based on the identification of a polynomial model of the system to control and on the on-line inversion of this model. An efficient technique is developed to perform the inversion, which allows an effective control implementation on real-time processors.
On the Capacity of Decode-and-Forward Relaying over Rician Fading Channels
Venue: arXiv cs.IT 2014
Year: 2014

In this letter, we derive the probability density function (PDF) and cumulative distribution function (CDF) of the minimum of two non-central Chi-square random variables with two degrees of freedom in terms of power series. With the help of the derived PDF and CDF, we obtain the exact ergodic capacity of the following adaptive protocols in a decode-and-forward (DF) cooperative system over dissimilar Rician fading channels: (i) constant power with optimal rate adaptation; (ii) optimal simultaneous power and rate adaptation; (iii) channel inversion with fixed rate. By using the analytical expressions of the capacity, it is observed that the optimal power and rate adaptation provides better capacity than the optimal rate adaptation with constant power from low to moderate signal-to-noise ratio values over dissimilar Rician fading channels. Despite low complexity, the channel inversion based adaptive transmission is shown to suffer from significant loss in capacity as compared to the other adaptive transmission based techniques over DF Rician channels.
Recognition of Isolated Words using Zernike and MFCC features for Audio Visual Speech Recognition
Venue: arXiv cs.CV 2014
Year: 2014

Automatic Speech Recognition (ASR) by machine is an attractive research topic in signal processing domain and has attracted many researchers to contribute in this area. In recent year, there have been many advances in automatic speech reading system with the inclusion of audio and visual speech features to recognize words under noisy conditions. The objective of audio-visual speech recognition system is to improve recognition accuracy. In this paper we computed visual features using Zernike moments and audio feature using Mel Frequency Cepstral Coefficients (MFCC) on vVISWa (Visual Vocabulary of Independent Standard Words) dataset which contains collection of isolated set of city names of 10 speakers. The visual features were normalized and dimension of features set was reduced by Principal Component Analysis (PCA) in order to recognize the isolated word utterance on PCA space.The performance of recognition of isolated words based on visual only and audio only features results in 63.88 and 100 respectively.
Toward Software Measurement and Quality Analysis of MARF and GIPSY Case Studies, a Team 8 SOEN6611-S14 Project Report
Venue: arXiv cs.SE 2014
Year: 2014

Measurement is an important criterion to improve the performance of a product. This paper presents a comparative study involving measurements between two frameworks MARF and GIPSY. Initially it establishes a thorough understanding of these frameworks and their applications. MARF comprises of a number of algorithms for voice and speech processing etc. GIPSY on the contrary provides a multi lingual platform for developing compiler components. These frameworks are meant to provide an open source environment for the programmers or users and implement them in applications. Several metrics are used for object-oriented design quality assessment. We use these metrics to evaluate the code quality of both MARF and GIPSY. We describe how tools can be used to analyze these metric values and categorize the quality of the code as excellent or worse. Based on these values we interpret the results in terms of quality attributes achieved. Quantitative and qualitative analysis of metric values is made in this regard to elaborate the impact of design parameters on the quality of the code.
Analysis of RSA algorithm using GPU programming
Venue: arXiv cs.CR 2014
Year: 2014

Modern-day computer security relies heavily on cryptography as a means to protect the data that we have become increasingly reliant on. The main research in computer security domain is how to enhance the speed of RSA algorithm. The computing capability of Graphic Processing Unit as a co-processor of the CPU can leverage massive-parallelism. This paper presents a novel algorithm for calculating modulo value that can process large power of numbers which otherwise are not supported by built-in data types. First the traditional algorithm is studied. Secondly, the parallelized RSA algorithm is designed using CUDA framework. Thirdly, the designed algorithm is realized for small prime numbers and large prime number . As a result the main fundamental problem of RSA algorithm such as speed and use of poor or small prime numbers that has led to significant security holes, despite the RSA algorithm's mathematical soundness can be alleviated by this algorithm.
Narrowing the Complexity Gap for Colouring ($C_s$,$P_t$)-Free Graphs
Venue: arXiv cs.CC 2014
Year: 2014

For a positive integer $k$ and graph $G=(V,E)$, a $k$-colouring of $G$ is a mapping $c: V\rightarrow\{1,2,\ldots,k\}$ such that $c(u)\neq c(v)$ whenever $uv\in E$. The $k$-Colouring problem is to decide, for a given $G$, whether a $k$-colouring of $G$ exists. The $k$-Precolouring Extension problem is to decide, for a given $G=(V,E)$, whether a colouring of a subset of $V$ can be extended to a $k$-colouring of $G$. A $k$-list assignment of a graph is an allocation of a list -a subset of $\{1,\ldots,k\}$- to each vertex, and the List $k$-Colouring problem is to decide, for a given $G$, whether $G$ has a $k$-colouring in which each vertex is coloured with a colour from its list. We continued the study of the computational complexity of these three decision problems when restricted to graphs that contain neither a cycle on $s$ vertices nor a path on $t$ vertices as induced subgraphs (for fixed positive integers $s$ and~$t$).
Sub-homogeneous positive monotone systems are insensitive to heterogeneous time-varying delays
Venue: arXiv cs.SY 2014
Year: 2014

We show that a sub-homogeneous positive monotone system with bounded heterogeneous time-varying delays is globally asymptotically stable if and only if the corresponding delay-free system is globally asymptotically stable. The proof is based on an extension of a delay-independent stability result for monotone systems under constant delays by Smith to systems with bounded heterogeneous time-varying delays. Under the additional assumption of positivity and sub-homogeneous vector fields, we establish the aforementioned delay insensitivity property and derive a novel test for global asymptotic stability. If the system has a unique equilibrium point in the positive orthant, we prove that our stability test is necessary and sufficient. Specialized to positive linear systems, our results extend and sharpen existing results from the literature.
On the Computation of Distances for Probabilistic Context-Free Grammars
Venue: arXiv cs.FL 2014
Year: 2014

Probabilistic context-free grammars (PCFGs) are used to define distributions over strings, and are powerful modelling tools in a number of areas, including natural language processing, software engineering, model checking, bio-informatics, and pattern recognition. A common important question is that of comparing the distributions generated or modelled by these grammars: this is done through checking language equivalence and computing distances. Two PCFGs are language equivalent if every string has identical probability with both grammars. This also means that the distance (whichever norm is used) is null. It is known that the language equivalence problem is interreducible with that of multiple ambiguity for context-free grammars, a long-standing open question. In this work, we prove that computing distances corresponds to solving undecidable questions: this is the case for the L1, L2 norm, the variation distance and the Kullback-Leibler divergence. Two more results are less negative: 1. The most probable string can be computed, and, 2. The Chebyshev distance (where the distance between two distributions is the maximum difference of probabilities over all strings) is interreducible with the language equivalence problem.
Information Gathering in Ad-Hoc Radio Networks with Tree Topology
Venue: arXiv cs.DS 2014
Year: 2014

We study the problem of information gathering in ad-hoc radio networks without collision detection, focussing on the case when the network forms a tree, with edges directed towards the root. Initially, each node has a piece of information that we refer to as a rumor. Our goal is to design protocols that deliver all rumors to the root of the tree as quickly as possible. The protocol must complete this task within its allotted time even though the actual tree topology is unknown when the computation starts. In the deterministic case, assuming that the nodes are labeled with small integers, we give an O(n)-time protocol that uses unbounded messages, and an O(n log n)-time protocol using bounded messages, where any message can include only one rumor. We also consider fire-and-forward protocols, in which a node can only transmit its own rumor or the rumor received in the previous step. We give a deterministic fire-and- forward protocol with running time O(n^1.5), and we show that it is asymptotically optimal. We then study randomized algorithms where the nodes are not labelled. In this model, we give an O(n log n)-time protocol and we prove that this bound is asymptotically optimal.
Large-Scale Multi-Label Learning with Incomplete Label Assignments
Venue: arXiv cs.LG 2014
Year: 2014

Multi-label learning deals with the classification problems where each instance can be assigned with multiple labels simultaneously. Conventional multi-label learning approaches mainly focus on exploiting label correlations. It is usually assumed, explicitly or implicitly, that the label sets for training instances are fully labeled without any missing labels. However, in many real-world multi-label datasets, the label assignments for training instances can be incomplete. Some ground-truth labels can be missed by the labeler from the label set. This problem is especially typical when the number instances is very large, and the labeling cost is very high, which makes it almost impossible to get a fully labeled training set. In this paper, we study the problem of large-scale multi-label learning with incomplete label assignments. We propose an approach, called MPU, based upon positive and unlabeled stochastic gradient descent and stacked models. Unlike prior works, our method can effectively and efficiently consider missing labels and label correlations simultaneously, and is very scalable, that has linear time complexities over the size of the data. Extensive experiments on two real-world multi-label datasets show that our MPU model consistently outperform other commonly-used baselines.