OpenRaiser/Intern-Atlas huggingface dataset:
Community-Quality-Based Player Ranking in Collaborative Games with no Explicit Objectives
Venue: arXiv cs.GT 2012
Year: 2012

Player ranking can be used to determine the quality of the contributions of a player to a collaborative community. However, collaborative games with no explicit objectives do not support player ranking, as there is no metric to measure the quality of player contributions. An implicit objective of such communities is not being disruptive towards other players. In this paper, we propose a parameterizable approach for real-time player ranking in collaborative games with no explicit objectives. Our method computes a ranking by applying a simple heuristic community quality function. We also demonstrate the capabilities of our approach by applying several parameterizations of it to a case study and comparing the obtained results.
Using Superposition Codebooks and Partial Decode and Forward in Low SNR Parallel Relay Networks
Venue: arXiv cs.IT 2012
Year: 2012

A new communication scheme for Gaussian parallel relay networks based on superposition coding and partial decoding at the relays is presented. Some specific examples are proposed in which two codebook layers are superimposed. The first level codebook is constructed with symbols from a binary or ternary alphabet while the second level codebook is composed of codewords chosen with Gaussian symbols. The new communication scheme is a generalization of decode-and-forward, amplify-and-forward, and bursty-amplify-and-forward. The asymptotic low SNR regime is studied using achievable rates and minimum energy-per-bit as performance metrics. It is shown that the new scheme outperforms all previously known schemes for some channels and parameter ranges.
A Joint Model for IEEE 802.15.4 Physical and Medium Access Control Layers
Venue: arXiv cs.NI 2012
Year: 2012

Many studies have tried to evaluate wireless networks and especially the IEEE 802.15.4 standard. Hence, several papers have aimed to describe the functionalities of the physical (PHY) and medium access control (MAC) layers. They have highlighted some characteristics with experimental results and/or have attempted to reproduce them using theoretical models. In this paper, we use the first way to better understand IEEE 802.15.4 standard. Indeed, we provide a comprehensive model, able more faithfully to mimic the functionalities of this standard at the PHY and MAC layers. We propose a combination of two relevant models for the two layers. The PHY layer behavior is reproduced by a mathematical framework, which is based on radio and channel models, in order to quantify link reliability. On the other hand, the MAC layer is mimed by an enhanced Markov chain. The results show the pertinence of our approach compared to the model based on a Markov chain for IEEE 802.15.4 MAC layer. This contribution allows us fully and more precisely to estimate the network performance with different network sizes, as well as different metrics such as node reliability and delay. Our contribution enables us to catch possible failures at both layers.
Arabic Language Learning Assisted by Computer, based on Automatic Speech Recognition
Venue: arXiv cs.CL 2012
Year: 2012

This work consists of creating a system of the Computer Assisted Language Learning (CALL) based on a system of Automatic Speech Recognition (ASR) for the Arabic language using the tool CMU Sphinx3 [1], based on the approach of HMM. To this work, we have constructed a corpus of six hours of speech recordings with a number of nine speakers. we find in the robustness to noise a grounds for the choice of the HMM approach [2]. the results achieved are encouraging since our corpus is made by only nine speakers, but they are always reasons that open the door for other improvement works.
A Note on Extending Taylor's Power Law for Characterizing Human Microbial Communities: Inspiration from Comparative Studies on the Distribution Patterns of Insects and Galaxies, and as a Case Study for Medical Ecology
Venue: arXiv cs.CE 2012
Year: 2012

Many natural patterns, such as the distributions of blood particles in a blood sample, proteins on cell surfaces, biological populations in their habitat, galaxies in the universe, the sequence of human genes, and the fitness in evolutionary computing, have been found to follow power law. Taylor's power law (Taylor 1961: Nature, 189:732-) is well recognized as one of the fundamental models in population ecology. A fundamental property of biological populations, which Taylor's power law reveals, is the near universal heterogeneity of population abundance distribution in habitat. Obviously, the heterogeneity also exists at the community level, where not only the distributions of population abundances but also the proportions of the species composition in the community are often heterogeneous. Nevertheless, existing community diversity indexes such as Shannon index and Simpson index can only measure "local" or "static" diversity in the sense that they are computed for each habitat at a specific time point, and the indexes alone do not reflect the diversity changes. In this note, I propose to extend the application scope of Taylor's power law to the studies of human microbial communities, specifically, the community heterogeneity at both population and community levels. I further suggested that population dispersion models such as Taylor (1980: Nature, 286, 53-), which is known to generate population distribution patterns consistent with the power law, should also be very useful for analyzing the distribution patterns of human microbes within the human body. Overall, I hope that the approach to human microbial community with the power law offers an example that ecological theories can play an important role in the emerging medical ecology, which aims at studying the ecology of human microbiome and its implications to human diseases and health, as well as in personalized medicine.
Finite State Machine based Vending Machine Controller with Auto-Billing Features
Venue: arXiv cs.OH 2012
Year: 2012

Nowadays, Vending Machines are well known among Japan, Malaysia and Singapore. The quantity of machines in these countries is on the top worldwide. This is due to the modern lifestyles which require fast food processing with high quality. This paper describes the designing of multi select machine using Finite State Machine Model with Auto-Billing Features. Finite State Machine (FSM) modelling is the most crucial part in developing proposed model as this reduces the hardware. In this paper the process of four state (user Selection, Waiting for money insertion, product delivery and servicing) has been modelled using MEALY Machine Model. The proposed model is tested using Spartan 3 development board and its performance is compared with CMOS based machine.
Parameterized Domination in Circle Graphs
Venue: arXiv cs.DS 2012
Year: 2012

A circle graph is the intersection graph of a set of chords in a circle. Keil [Discrete Applied Mathematics, 42(1):51-63, 1993] proved that Dominating Set, Connected Dominating Set, and Total Dominating Set are NP-complete in circle graphs. To the best of our knowledge, nothing was known about the parameterized complexity of these problems in circle graphs. In this paper we prove the following results, which contribute in this direction: - Dominating Set, Independent Dominating Set, Connected Dominating Set, Total Dominating Set, and Acyclic Dominating Set are W[1]-hard in circle graphs, parameterized by the size of the solution. - Whereas both Connected Dominating Set and Acyclic Dominating Set are W[1]-hard in circle graphs, it turns out that Connected Acyclic Dominating Set is polynomial-time solvable in circle graphs. - If T is a given tree, deciding whether a circle graph has a dominating set isomorphic to T is NP-complete when T is in the input, and FPT when parameterized by |V(T)|. We prove that the FPT algorithm is subexponential.
A reduced integer programming model for the ferry scheduling problem
Venue: arXiv cs.DM 2012
Year: 2012

We present an integer programming model for the ferry scheduling problem, improving existing models in various ways. In particular, our model has reduced size in terms of the number of variables and constraints compared to existing models by a factor of approximately O(n), where n being the number of ports. The model also handles efficiently load/unload time constraints, crew scheduling and passenger transfers. Experiments using real world data produced high quality solutions in 12 hours using CPLEX 12.4 with a performance guarantee of within 15% of optimality, on average. This establishes that using a general purpose integer programming solver is a viable alternative in solving the ferry scheduling problem of moderate size.
Efficient Topology-Controlled Sampling of Implicit Shapes
Venue: arXiv cs.CV 2012
Year: 2012

Sampling from distributions of implicitly defined shapes enables analysis of various energy functionals used for image segmentation. Recent work describes a computationally efficient Metropolis-Hastings method for accomplishing this task. Here, we extend that framework so that samples are accepted at every iteration of the sampler, achieving an order of magnitude speed up in convergence. Additionally, we show how to incorporate topological constraints.
Social Turing Tests: Crowdsourcing Sybil Detection
Venue: arXiv cs.SI 2012
Year: 2012

As popular tools for spreading spam and malware, Sybils (or fake accounts) pose a serious threat to online communities such as Online Social Networks (OSNs). Today, sophisticated attackers are creating realistic Sybils that effectively befriend legitimate users, rendering most automated Sybil detection techniques ineffective. In this paper, we explore the feasibility of a crowdsourced Sybil detection system for OSNs. We conduct a large user study on the ability of humans to detect today's Sybil accounts, using a large corpus of ground-truth Sybil accounts from the Facebook and Renren networks. We analyze detection accuracy by both "experts" and "turkers" under a variety of conditions, and find that while turkers vary significantly in their effectiveness, experts consistently produce near-optimal results. We use these results to drive the design of a multi-tier crowdsourcing Sybil detection system. Using our user study data, we show that this system is scalable, and can be highly effective either as a standalone system or as a complementary technique to current tools.
Automating embedded analysis capabilities and managing software complexity in multiphysics simulation part II: application to partial differential equations
Venue: arXiv cs.MS 2012
Year: 2012

A template-based generic programming approach was presented in a previous paper that separates the development effort of programming a physical model from that of computing additional quantities, such as derivatives, needed for embedded analysis algorithms. In this paper, we describe the implementation details for using the template-based generic programming approach for simulation and analysis of partial differential equations (PDEs). We detail several of the hurdles that we have encountered, and some of the software infrastructure developed to overcome them. We end with a demonstration where we present shape optimization and uncertainty quantification results for a 3D PDE application.
Some drastic improvements found in the analysis of routing protocol for the Bluetooth technology using scatternet
Venue: arXiv cs.NI 2012
Year: 2012

Bluetooth is a promising wireless technology that enables portable devices to form short-range wireless ad hoc networks. Unlike wireless LAN, the communication of Bluetooth devices follow a strict master slave relationship, that is, it is not possible for a slave device to directly communicate with another slave device even though they are within the radio coverage of each other. For inter piconet communication, a scatternet has to be formed, in which some Bluetooth devices have to act as bridge nodes between piconets. The Scatternet formed have following properties in which they are connected i.e every Bluetooth device can be reached from every other device, Piconet size is limited to eight nodes [1]. The author of this research paper have studied different type of routing protocol and have made efforts to improve throughput and reduce packet loss due to failure in the routing loop and increased mobility and improve the cohesive network structure, resolve the change topology conflicts [2], and a successful & efficient transfer of packet from source to destination.
Neural Networks for Handwritten English Alphabet Recognition
Venue: arXiv cs.AI 2012
Year: 2012

This paper demonstrates the use of neural networks for developing a system that can recognize hand-written English alphabets. In this system, each English alphabet is represented by binary values that are used as input to a simple feature extraction system, whose output is fed to our neural network system.
SD-AREE: A New Modified Caesar Cipher Cryptographic Method Along with Bit-Manipulation to Exclude Repetition from a Message to be Encrypted
Venue: arXiv cs.CR 2012
Year: 2012

In this paper the author presents a new cryptographic technique to exclude the repetitive terms in a message, when it is to be encrypted, so that it becomes almost impossible for a person to retrieve or predict the original message from the encrypted message. In modern world, cryptography hackers try to break a code or cryptographic algorithm or try to retrieve the key, which is needed to encrypt a message, by analyzing the insertion or presence of repetitive bits / characters (bytes) in the message and encrypted message to find out the encryption algorithm or the key used for it. So it is must for a good encryption method to exclude the repetitive terms such that no trace of repetitions can be tracked down. For this reason we apply SD-AREE cryptographic method to exclude repetitive terms from a message, which is to be encrypted. In SD-AREE method the repetitive bits / characters are removed and there is no trace of any repetition in the message.
Mpls Overlay Network Sinthesis Method With Multilayer Graph Usage
Venue: arXiv cs.NI 2012
Year: 2012

l. Introduction Modern network are multi-layer by their structure. This requires the development of new mathematical models, which would allow to adequately describe the existing physical and logical connections between the elements on its different levels, and to effectively solve the problems of design. The paper formulates the problem of synthesis of structure of MPLS network layered with the transport SDH network or WDM and suggests the method of its solving. The solving is based on the application of mathematical model of multi-layer graph. II, III, IV. Main Part During the planning of MPLS networks it is necessary to determine the topology of both the networks: that of transport one and that of MPLS one. This means that one needs to determine: - what nodes of the transport network should support the MPLS functionality; - in what way the LSR nodes should be connected via the transport network; - what should be the bandwidth between LSR links. According to the general method for solving the problem of synthesis of multiservice telecommunication systems with the usage of multi-layer graphs, we have to synthesize the initial redundant . The solving of the task above can be reduced to the finding of the multi-layer minimum weight subgraph that provides the transfer of information flows with the consideration of the requirements to the structure of the multilayer graph [5] and the flows on its edges [6] observed at the applying of constraints to the bandwidth of the edges of the multi-layer graph. V. Conclusion The paper reduces the problem of design of multiservice telecommunication system with the transferred flows to the problem of finding a multilayer minimum weight subgraph with the consideration of constraints to the graph edges bandwidth. It is shown that application of given method provide to reduce MPLS network cost to 10 - 16 %.
Precision-biased Parsing and High-Quality Parse Selection
Venue: arXiv cs.CL 2012
Year: 2012

We introduce precision-biased parsing: a parsing task which favors precision over recall by allowing the parser to abstain from decisions deemed uncertain. We focus on dependency-parsing and present an ensemble method which is capable of assigning parents to 84% of the text tokens while being over 96% accurate on these tokens. We use the precision-biased parsing task to solve the related high-quality parse-selection task: finding a subset of high-quality (accurate) trees in a large collection of parsed text. We present a method for choosing over a third of the input trees while keeping unlabeled dependency parsing accuracy of 97% on these trees. We also present a method which is not based on an ensemble but rather on directly predicting the risk associated with individual parser decisions. In addition to its efficiency, this method demonstrates that a parsing system can provide reasonable estimates of confidence in its predictions without relying on ensembles or aggregate corpus counts.
A Hybrid Approach Towards Intrusion Detection Based on Artificial Immune System and Soft Computing
Venue: arXiv cs.CR 2012
Year: 2012

A number of works in the field of intrusion detection have been based on Artificial Immune System and Soft Computing. Artificial Immune System based approaches attempt to leverage the adaptability, error tolerance, self- monitoring and distributed nature of Human Immune Systems. Whereas Soft Computing based approaches are instrumental in developing fuzzy rule based systems for detecting intrusions. They are computationally intensive and apply machine learning (both supervised and unsupervised) techniques to detect intrusions in a given system. A combination of these two approaches could provide significant advantages for intrusion detection. In this paper we attempt to leverage the adaptability of Artificial Immune System and the computation intensive nature of Soft Computing to develop a system that can effectively detect intrusions in a given network.
Sparse Signal Recovery in the Presence of Intra-Vector and Inter-Vector Correlation
Venue: arXiv cs.IT 2012
Year: 2012

This work discusses the problem of sparse signal recovery when there is correlation among the values of non-zero entries. We examine intra-vector correlation in the context of the block sparse model and inter-vector correlation in the context of the multiple measurement vector model, as well as their combination. Algorithms based on the sparse Bayesian learning are presented and the benefits of incorporating correlation at the algorithm level are discussed. The impact of correlation on the limits of support recovery is also discussed highlighting the different impact intra-vector and inter-vector correlations have on such limits.
Streaming Algorithms for Pattern Discovery over Dynamically Changing Event Sequences
Venue: arXiv cs.LG 2012
Year: 2012

Discovering frequent episodes over event sequences is an important data mining task. In many applications, events constituting the data sequence arrive as a stream, at furious rates, and recent trends (or frequent episodes) can change and drift due to the dynamical nature of the underlying event generation process. The ability to detect and track such the changing sets of frequent episodes can be valuable in many application scenarios. Current methods for frequent episode discovery are typically multipass algorithms, making them unsuitable in the streaming context. In this paper, we propose a new streaming algorithm for discovering frequent episodes over a window of recent events in the stream. Our algorithm processes events as they arrive, one batch at a time, while discovering the top frequent episodes over a window consisting of several batches in the immediate past. We derive approximation guarantees for our algorithm under the condition that frequent episodes are approximately well-separated from infrequent ones in every batch of the window. We present extensive experimental evaluations of our algorithm on both real and synthetic data. We also present comparisons with baselines and adaptations of streaming algorithms from itemset mining literature.
Examining the Impact of Platform Properties on Quality Attributes
Venue: arXiv cs.SE 2012
Year: 2012

We examine and bring out the architecturally significant characteristics of various virtualization and cloud oriented platforms. The impact of such characteristics on the ability of guest applications to achieve various quality attributes (QA) has also been determined by examining existing body of architecture knowledge. We observe from our findings that efficiency, resource elasticity and security are among the most impacted QAs, and virtualization platforms exhibit the maximum impact on various QAs.
On the discriminating power of tests in resource lambda-calculus
Venue: arXiv cs.LO 2012
Year: 2012

Since its discovery, differential linear logic (DLL) inspired numerous domains. In denotational semantics, categorical models of DLL are now commune, and the simplest one is Rel, the category of sets and relations. In proof theory this naturally gave birth to differential proof nets that are full and complete for DLL. In turn, these tools can naturally be translated to their intuitionistic counterpart. By taking the co-Kleisly category associated to the ! comonad, Rel becomes MRel, a model of the \Lcalcul that contains a notion of differentiation. Proof nets can be used naturally to extend the \Lcalcul into the lambda calculus with resources, a calculus that contains notions of linearity and differentiations. Of course MRel is a model of the \Lcalcul with resources, and it has been proved adequate, but is it fully abstract? That was a strong conjecture of Bucciarelli, Carraro, Ehrhard and Manzonetto. However, in this paper we exhibit a counter-example. Moreover, to give more intuition on the essence of the counter-example and to look for more generality, we will use an extension of the resource \Lcalcul also introduced by Bucciarelli et al for which $\Minf$ is fully abstract, the tests.
Issues of Architectural Description Languages for Handling Dynamic Reconfiguration
Venue: arXiv cs.SE 2012
Year: 2012

Dynamic reconfiguration is the action of modifying a software system at runtime. Several works have been using architectural specification as the basis for dynamic reconfiguration. Indeed ADLs (architecture description languages) let architects describe the elements that could be reconfigured as well as the set of constraints to which the system must conform during reconfiguration. In this work, we investigate the ADL literature in order to illustrate how reconfiguration is supported in four well-known ADLs: pi-ADL, ACME, C2SADL and Dynamic Wright. From this review, we conclude that none of these ADLs: (i) addresses the issue of consistently reconfiguring both instances and types; (ii) takes into account the behaviour of architectural elements during reconfiguration; and (iii) provides support for assessing reconfiguration, e.g., verifying the transition against properties.