OpenRaiser/Intern-Atlas huggingface dataset:
Mr. Moo's First RPG: Rules, Discussion and the Instructional Implications of Collective Intelligence on the Open Web
Venue: arXiv cs.CY 2013
Year: 2013

For a moment, imagine an active online learning community of writers, artists, and designers, many spending more than eight hours a week composing projects. In this community, young people, primarily between the ages of 18-26, regularly critique, facilitate, and support each other in their composition activities. They are motivated to participate by their shared interest and affinity for their creative work. In the age of Wikipedia, this might not seem particularly novel, but what I am actually describing is an online discussion board, RPGmakerVX.net. Elsewhere, I have presented a general outline of the kinds of individuals involved in this community and the way that the site as a whole functions as an open learning environment (Owens, 2010). In this essay, I present a case study of one participant in this community. His user name is Mr. Moo, and at the time I interviewed him, he was a 19 year old college student from Calgary, Canada. When he created his first role-playing game, Prelude of Identity, he was eighteen. After providing a conceptual context for this case study in work on collective intelligence, I draw out the relationship between the technical system of the discussion boards and the creative process of engaging with peers in the production of a video game. I suggest that the discussion board rules and interaction enable a dialogue around composition that ultimately leaves Mr. Moo with a valuable learning experience while also producing a role-playing game. Thinking about this system from the perspective of collective intelligence enables us to use these kinds of interest-driven, online affinity communities as tools in an open education tool kit for educators in more formal learning environments. Ultimately, discussion boards in gaming communities, both the technical and social systems they represent, could be thought of as instructional tools.
Deployment of VoIP Technology: QoS Concerns
Venue: arXiv cs.NI 2013
Year: 2013

Voice over IP (VoIP) is an emerging communication service allowing voice transmission over a private or a public IP network. VoIP allows significant benefits for customers and service providers including cost savings, phone and service portability, mobility, and the integration with other applications. Nevertheless, the deployment of the VoIP technology encounters many challenges such as interoperability issues, security issues, and QoS concerns. Among these disadvantages, QoS issues are considered the most serious due to the QoS problems that may arise on IP networks, and the stringent QoS requirements of voice traffic. The aim of this paper is carry out a deep analysis of the QoS concerns of the VoIP technology. Firstly, we present a brief overview about the VoIP technology. Then, we discuss the QoS issues related to the use of the IP networking technology for voice traffic transmission. After that, we present the QoS concerns related voice clarity. Finally, we present the QoS mechanisms proposed to make the IP technology able to support voice traffic QoS requirements in terms of voice clarity, voice packet delay, packet delay variation, and packet loss.
DRSP : Dimension Reduction For Similarity Matching And Pruning Of Time Series Data Streams
Venue: arXiv cs.DB 2013
Year: 2013

Similarity matching and join of time series data streams has gained a lot of relevance in today's world that has large streaming data. This process finds wide scale application in the areas of location tracking, sensor networks, object positioning and monitoring to name a few. However, as the size of the data stream increases, the cost involved to retain all the data in order to aid the process of similarity matching also increases. We develop a novel framework to addresses the following objectives. Firstly, Dimension reduction is performed in the preprocessing stage, where large stream data is segmented and reduced into a compact representation such that it retains all the crucial information by a technique called Multi-level Segment Means (MSM). This reduces the space complexity associated with the storage of large time-series data streams. Secondly, it incorporates effective Similarity Matching technique to analyze if the new data objects are symmetric to the existing data stream. And finally, the Pruning Technique that filters out the pseudo data object pairs and join only the relevant pairs. The computational cost for MSM is O(l*ni) and the cost for pruning is O(DRF*wsize*d), where DRF is the Dimension Reduction Factor. We have performed exhaustive experimental trials to show that the proposed framework is both efficient and competent in comparison with earlier works.
Analysis & Prediction of Sales Data in SAP-ERP System using Clustering Algorithms
Venue: arXiv cs.DB 2013
Year: 2013

Clustering is an important data mining technique where we will be interested in maximizing intracluster distance and also minimizing intercluster distance. We have utilized clustering techniques for detecting deviation in product sales and also to identify and compare sales over a particular period of time. Clustering is suited to group items that seem to fall naturally together, when there is no specified class for any new item. We have utilizedannual sales data of a steel major to analyze Sales Volume & Value with respect to dependent attributes like products, customers and quantities sold. The demand for steel products is cyclical and depends on many factors like customer profile, price,Discounts and tax issues. In this paper, we have analyzed sales data with clustering algorithms like K-Means&EMwhichrevealed many interesting patternsuseful for improving sales revenue and achieving higher sales volume. Our study confirms that partition methods like K-Means & EM algorithms are better suited to analyze our sales data in comparison to Density based methods like DBSCAN & OPTICS or Hierarchical methods like COBWEB.
Embedding Session Types in HML
Venue: arXiv cs.DC 2013
Year: 2013

Recent work on the enhancement of multiparty session types with logical annotations enable the effective verification of properties on (1) the structure of the conversations, (2) the sorts of the messages, and (3) the actual values exchanged. In [3] we extend this work to enable the specification and verification of mutual effects of multiple cross-session interactions. Here we give a sound and complete embedding into the Hennessy-Milner logic to justify the expressiveness of the approach in [3] and to provide it with a logical background that will enable us to compare it with similar approaches.
The Glasgow Parallel Reduction Machine: Programming Shared-memory Many-core Systems using Parallel Task Composition
Venue: arXiv cs.DC 2013
Year: 2013

We present the Glasgow Parallel Reduction Machine (GPRM), a novel, flexible framework for parallel task-composition based many-core programming. We allow the programmer to structure programs into task code, written as C++ classes, and communication code, written in a restricted subset of C++ with functional semantics and parallel evaluation. In this paper we discuss the GPRM, the virtual machine framework that enables the parallel task composition approach. We focus the discussion on GPIR, the functional language used as the intermediate representation of the bytecode running on the GPRM. Using examples in this language we show the flexibility and power of our task composition framework. We demonstrate the potential using an implementation of a merge sort algorithm on a 64-core Tilera processor, as well as on a conventional Intel quad-core processor and an AMD 48-core processor system. We also compare our framework with OpenMP tasks in a parallel pointer chasing algorithm running on the Tilera processor. Our results show that the GPRM programs outperform the corresponding OpenMP codes on all test platforms, and can greatly facilitate writing of parallel programs, in particular non-data parallel algorithms such as reductions.
Static Application-Level Race Detection in STM Haskell using Contracts
Venue: arXiv cs.LO 2013
Year: 2013

Writing concurrent programs is a hard task, even when using high-level synchronization primitives such as transactional memories together with a functional language with well-controlled side-effects such as Haskell, because the interferences generated by the processes to each other can occur at different levels and in a very subtle way. The problem occurs when a thread leaves or exposes the shared data in an inconsistent state with respect to the application logic or the real meaning of the data. In this paper, we propose to associate contracts to transactions and we define a program transformation that makes it possible to extend static contract checking in the context of STM Haskell. As a result, we are able to check statically that each transaction of a STM Haskell program handles the shared data in a such way that a given consistency property, expressed in the form of a user-defined boolean function, is preserved. This ensures that bad interference will not occur during the execution of the concurrent program.
Improving circuit miniaturization and its efficiency using Rough Set Theory
Venue: arXiv cs.LG 2013
Year: 2013

High-speed, accuracy, meticulousness and quick response are notion of the vital necessities for modern digital world. An efficient electronic circuit unswervingly affects the maneuver of the whole system. Different tools are required to unravel different types of engineering tribulations. Improving the efficiency, accuracy and low power consumption in an electronic circuit is always been a bottle neck problem. So the need of circuit miniaturization is always there. It saves a lot of time and power that is wasted in switching of gates, the wiring-crises is reduced, cross-sectional area of chip is reduced, the number of transistors that can implemented in chip is multiplied many folds. Therefore to trounce with this problem we have proposed an Artificial intelligence (AI) based approach that make use of Rough Set Theory for its implementation. Theory of rough set has been proposed by Z Pawlak in the year 1982. Rough set theory is a new mathematical tool which deals with uncertainty and vagueness. Decisions can be generated using rough set theory by reducing the unwanted and superfluous data. We have condensed the number of gates without upsetting the productivity of the given circuit. This paper proposes an approach with the help of rough set theory which basically lessens the number of gates in the circuit, based on decision rules.
An efficient length- and rate-preserving concatenation of polar and repetition codes
Venue: arXiv cs.IT 2013
Year: 2013

We improve the method in \cite{Seidl:10} for increasing the finite-lengh performance of polar codes by protecting specific, less reliable symbols with simple outer repetition codes. Decoding of the scheme integrates easily in the known successive decoding algorithms for polar codes. Overall rate and block length remain unchanged, the decoding complexity is at most doubled. A comparison to related methods for performance improvement of polar codes is drawn.
Personalized real time weather forecasting
Venue: arXiv cs.OH 2013
Year: 2013

Temperature forecasting and rain forecasting in today's environment is playing a major role in many fields like transportation, tour planning and agriculture. The purpose of this paper is to provide a real time forecasting to the user according to their current position and requirement. The simplest method of forecasting the weather, persistence, relies upon today's conditions to forecast the conditions tomorrow i.e. analyzing historical data for predicting future weather conditions. The weather data used for the DM research include daily temperature, daily pressure and monthly rainfall.
Energy-Efficient Cell Partition of 3D Space for Sensor Networks with Location Information
Venue: arXiv cs.DC 2013
Year: 2013

In the wireless sensor networks composed of battery-powered sensor nodes, one of the main issues is how to save power consumption on each node. The usual approach to this problem is to activate only necessary nodes (e.g., those nodes which compose a backbone network), and to put other nodes to sleep. One such algorithm using location information is GAF (Geographical Adaptive Fidelity), and GAF is enhanced to HGAF (Hierarchical Geographical Adaptive Fidelity). In this paper, we study the energy-efficient partition of a 3 dimensional sensor field into cells. Further, we give a theoretical upper bound on cell size for this problem.
Covering Partial Cubes with Zones
Venue: arXiv cs.DM 2013
Year: 2013

A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension of a hypercube in which the graph can be embedded. We consider the problem of covering the vertices of a partial cube with the minimum number of zones. The problem admits several special cases, among which are the problem of covering the cells of a line arrangement with a minimum number of lines, and the problem of finding a minimum-size fibre in a bipartite poset. For several such special cases, we give upper and lower bounds on the minimum size of a covering by zones. We also consider the computational complexity of those problems, and establish some hardness results.
mARC: Memory by Association and Reinforcement of Contexts
Venue: arXiv cs.IR 2013
Year: 2013

This paper introduces the memory by Association and Reinforcement of Contexts (mARC). mARC is a novel data modeling technology rooted in the second quantization formulation of quantum mechanics. It is an all-purpose incremental and unsupervised data storage and retrieval system which can be applied to all types of signal or data, structured or unstructured, textual or not. mARC can be applied to a wide range of information clas-sification and retrieval problems like e-Discovery or contextual navigation. It can also for-mulated in the artificial life framework a.k.a Conway "Game Of Life" Theory. In contrast to Conway approach, the objects evolve in a massively multidimensional space. In order to start evaluating the potential of mARC we have built a mARC-based Internet search en-gine demonstrator with contextual functionality. We compare the behavior of the mARC demonstrator with Google search both in terms of performance and relevance. In the study we find that the mARC search engine demonstrator outperforms Google search by an order of magnitude in response time while providing more relevant results for some classes of queries.
A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies (extended version)
Venue: arXiv cs.LO 2013
Year: 2013

In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to multi-modal logic enriched with features largely used in description logics: transitivity and relation inclusion assertions. The separate addition of either transitive relations or relation hierarchies to the considered decidable fragment of multi-modal hybrid logic can easily be shown to stay decidable, by resorting to results already proved in the literature. However, such results do not directly allow for concluding whether the logic including both features is still decidable. The existence of a terminating, sound and complete calculus for the considered logic proves that the addition of transitive relations and relation hierarchies to such an expressive decidable fragment of hybrid logic does not endanger decidability. A further result proved in this work is that the logic extending the considered fragment with the addition of graded modalities (the modal counterpart of number restrictions of description logics) has an undecidable satisfiability problem, unless further syntactical restrictions are placed on the universal graded modality.
Win-Move is Coordination-Free (Sometimes)
Venue: arXiv cs.DB 2013
Year: 2013

In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog${}^\neg$ program and the number of "coordination stages" required for its distributed computation. Indeed, Ameloot et al. [9] showed that a query can be computed by a coordination-free relational transducer network iff it is monotone, thus answering in the affirmative a variant of Hellerstein's CALM conjecture, based on a particular definition of coordination-free computation. In this paper, we present three additional models for declarative networking. In these variants, relational transducers have limited access to the way data is distributed. This variation allows transducer networks to compute more queries in a coordination-free manner: e.g., a transducer can check whether a ground atom $A$ over the input schema is in the "scope" of the local node, and then send either $A$ or $\neg A$ to other nodes. We show the surprising result that the query given by the well-founded semantics of the unstratifiable win-move program is coordination-free in some of the models we consider. We also show that the original transducer network model [9] and our variants form a strict hierarchy of classes of coordination-free queries. Finally, we identify different syntactic fragments of Datalog${}^{\neg\neg}_{\forall}$, called semi-monotone programs, which can be used as declarative network programming languages, whose distributed computation is guaranteed to be eventually consistent and coordination-free.
Deterministic and stochastic analysis of distributed order systems using operational matrix
Venue: arXiv cs.SY 2013
Year: 2013

The fractional order system, which is described by the fractional order derivative and integral, has been studied in many engineering areas. Recently, the concept of fractional order has been generalized to the distributed order concept, which is a parallel connection of fractional order integrals and derivatives taken to the infinitesimal limit in delta order. On the other hand, there are very few numerical methods available for the analysis of distributed order systems, particularly under stochastic forcing. This paper first proposes a numerical scheme for analyzing the behavior of a SISO linear system with a single term distributed order differentiator/integrator using an operational matrix in the time domain under both deterministic and random forcing. To assess the stochastic distributed order system, the existing Monte-Carlo, polynomial chaos and frequency methods are first adopted to the stochastic distributed order system for comparison. The numerical examples demonstrate the accuracy and computational efficiency of the proposed method for analyzing stochastic distributed order systems.
Various models of process of the learning, based on the numerical solution of the differential equations
Venue: arXiv cs.OH 2013
Year: 2013

The principles on which can be based computer model of process of training are formulated. Are considered: 1) the unicomponent model, which is recognizing that educational information consists of equal elements; 2) the multicomponent model, which is considering that knowledge is assimilate with a various strength, and on lesson weak knowledge becomes strong; 3) the generalized multicomponent model which considers change of working capacity of the pupil and various complexity of studied elements of a training material. Typical results of imitating modeling of learning process are presented in article.
An analysis of Internet Banking in Portugal: the antecedents of mobile banking adoption
Venue: arXiv cs.CY 2013
Year: 2013

In recent years, mobile operations have gained wide popularity among mainstream users, and banks tend to follow this trend. But are bank customers ready to move forward? Mobile banking appears to be a natural extension of Internet banking. Thus, to predict consumer decisions to adopt mobile banking, it is useful to understand the pattern of adoption of Internet banking (IB). This investigation seeks contribute to an expansion of the knowledge regarding this matter by researching Portuguese consumers patterns and behaviors concerning the acceptance and use intention of IB as a foundation for establishing growth strategies of mobile banking. For data collection, we used an online snowball process. The statistical treatment used included a factor analysis in order to allow examination of the interrelationships between the original variables. The analysis was made possible by developing a set of factors that expresses the common traits between them. The results revealed that the majority of respondents did not identify problems with the use of and interaction with the IB service. The study generated some interesting findings. First, the data generally supports the conceptual framework presented. However, some points need to be made: trust and convenience, from all the elements referenced in the literature as relevant from the client perspective, continue to be a very important elements; the results did not support the paradigm that the characteristics of individuals affect their behavior as consumers, individual technological characteristics affect consumer adoption of IB service; consumer perceptions about the IB service affect their use, as reveal by the existence of three types of customers that show different practices and perceptions of IB; and intention to use IB is dependent upon attitudes and subjective norms regarding the use of IB.
Semantic Types, Lexical Sorts and Classifiers
Venue: arXiv cs.CL 2013
Year: 2013

We propose a cognitively and linguistically motivated set of sorts for lexical semantics in a compositional setting: the classifiers in languages that do have such pronouns. These sorts are needed to include lexical considerations in a semantical analyser such as Boxer or Grail. Indeed, all proposed lexical extensions of usual Montague semantics to model restriction of selection, felicitous and infelicitous copredication require a rich and refined type system whose base types are the lexical sorts, the basis of the many-sorted logic in which semantical representations of sentences are stated. However, none of those approaches define precisely the actual base types or sorts to be used in the lexicon. In this article, we shall discuss some of the options commonly adopted by researchers in formal lexical semantics, and defend the view that classifiers in the languages which have such pronouns are an appealing solution, both linguistically and cognitively motivated.