OpenRaiser/Intern-Atlas huggingface dataset:
Coding for Computing Irreducible Markovian Functions of Sources with Memory
Venue: arXiv cs.IT 2013
Year: 2013

One open problem in source coding is to characterize the limits of representing losslessly a non-identity discrete function of the data encoded independently by the encoders of several correlated sources with memory. This paper investigates this problem under Markovian conditions, namely either the sources or the functions considered are Markovian. We propose using linear mappings over finite rings as encoders. If the function considered admits certain polynomial structure, the linear encoders can make use of this structure to establish "implicit collaboration" and boost the performance. In fact, this approach universally applies to any scenario (arbitrary function) because any discrete function admits a polynomial presentation of required format. There are several useful discoveries in the paper. The first says that linear encoder over non-field ring can be equally optimal for compressing data generated by an irreducible Markov source. Secondly, regarding the previous function-encoding problem, there are infinitely many circumstances where linear encoder over non-field ring strictly outperforms its field counterpart. To be more precise, it is seen that the set of coding rates achieved by linear encoder over certain non-field rings is strictly larger than the one achieved by the field version, regardless which finite field is considered. Therefore, in this sense, linear coding over finite field is not optimal. In addition, for certain scenarios where the sources do not possess the ergodic property, our ring approach is still able to offer a solution.
New Index for Quantifying an Individual's Scientific Research Output
Venue: arXiv cs.DL 2013
Year: 2013

Classifying researchers according to the quality of their published work rather than the quantity is a curtail issue. We attempt to introduce a new formula of the percentage range to be used for evaluating qualitatively the researchers' production. The suggested equation depends on the number of the single-author published papers and their citations to be added as a new factor to the known h-index. These factors give an advantage and make a clear evidence of innovative authors and reduce the known h-index for authors who are gaining citations by adding their names to multi-author papers. It is shown that various dimensions of ethical integrity and originality will be effective in this new index. An important scenario arising from the analysis is shown in terms of examples. It refers to larger differences between the h- and the new index which comes from the whole work and the one comes from the single-author papers only, is shown.
On the Structure and Complexity of Rational Sets of Regular Languages
Venue: arXiv cs.FL 2013
Year: 2013

In a recent thread of papers, we have introduced FQL, a precise specification language for test coverage, and developed the test case generation engine FShell for ANSI C. In essence, an FQL test specification amounts to a set of regular languages, each of which has to be matched by at least one test execution. To describe such sets of regular languages, the FQL semantics uses an automata-theoretic concept known as rational sets of regular languages (RSRLs). RSRLs are automata whose alphabet consists of regular expressions. Thus, the language accepted by the automaton is a set of regular expressions. In this paper, we study RSRLs from a theoretic point of view. More specifically, we analyze RSRL closure properties under common set theoretic operations, and the complexity of membership checking, i.e., whether a regular language is an element of a RSRL. For all questions we investigate both the general case and the case of finite sets of regular languages. Although a few properties are left as open problems, the paper provides a systematic semantic foundation for the test specification language FQL.
Faster Compact On-Line Lempel-Ziv Factorization
Venue: arXiv cs.DS 2013
Year: 2013

We present a new on-line algorithm for computing the Lempel-Ziv factorization of a string that runs in $O(N\log N)$ time and uses only $O(N\logσ)$ bits of working space, where $N$ is the length of the string and $σ$ is the size of the alphabet. This is a notable improvement compared to the performance of previous on-line algorithms using the same order of working space but running in either $O(N\log^3N)$ time (Okanohara & Sadakane 2009) or $O(N\log^2N)$ time (Starikovskaya 2012). The key to our new algorithm is in the utilization of an elegant but less popular index structure called Directed Acyclic Word Graphs, or DAWGs (Blumer et al. 1985). We also present an opportunistic variant of our algorithm, which, given the run length encoding of size $m$ of a string of length $N$, computes the Lempel-Ziv factorization on-line, in $O\left(m \cdot \min \left\{\frac{(\log\log m)(\log \log N)}{\log\log\log N}, \sqrt{\frac{\log m}{\log \log m}} \right\}\right)$ time and $O(m\log N)$ bits of space, which is faster and more space efficient when the string is run-length compressible.
Bounded Choice Queries for Logic Programming
Venue: arXiv cs.PL 2013
Year: 2013

Adding versatile interactions to goals and queries in logic programming is an essential task. Unfortunately, existing logic languages can take input from the user only via the $read$ construct. We propose to add a new interactive goal to allow for more controlled and more guided participation from the user. We illustrate our idea via \muprolog, an extension of Prolog with bounded choice goals.
Relaxing Behavioural Inheritance
Venue: arXiv cs.SE 2013
Year: 2013

Object-oriented (OO) inheritance allows the definition of families of classes in a hierarchical way. In behavioural inheritance, a strong version, it should be possible to substitute an object of a subclass for an object of its superclass without any observable effect on the system. Behavioural inheritance is related to formal refinement, but, as observed in the literature, the refinement constraints are too restrictive, ruling out many useful OO subclassings. This paper studies behavioural inheritance in the context of ZOO, an object-oriented style for Z. To overcome refinement's restrictions, this paper proposes relaxations to the behavioural inheritance refinement rules. The work is presented for Z, but the results are applicable to any OO language that supports design-by-contract.
Building Internal Cloud at NIC : A Preview
Venue: arXiv cs.DC 2013
Year: 2013

The most of computing environments in the IT support organization like NIC are designed to run in centralized datacentre. The centralized infrastructure of various development projects are used to deploy their services on it and connecting remotely to that datacentre from all the stations of organization. Currently these servers are mostly underutilized due to the static and conventional approaches used for accessing and utilizing of these resources. The cloud patterns is much needful for optimizing resource utilization and reducing the investments on unnecessary costs. So, we build up and prototyped a private cloud system called nIC(NIC Internal Cloud) to leverage the benefits of cloud environment. For this system we adopted the combination of various techniques from open source software community. The user-base of nIC consists developers, web and database admins, service providers and desktop users from various projects in NIC. We can optimize the resource usage by customizing the user based template services on these virtualized infrastructure. It will also increases the flexibility of the managing and maintenance of the operations like archiving, disaster recovery and scaling of resources. The open-source approach is further decreases the enterprise costs. In this paper, we describe the design and analysis of implementing issues on internal cloud environments in NIC and similar organizations.
Problems on q-Analogs in Coding Theory
Venue: arXiv cs.IT 2013
Year: 2013

The interest in $q$-analogs of codes and designs has been increased in the last few years as a consequence of their new application in error-correction for random network coding. There are many interesting theoretical, algebraic, and combinatorial coding problems concerning these q-analogs which remained unsolved. The first goal of this paper is to make a short summary of the large amount of research which was done in the area mainly in the last few years and to provide most of the relevant references. The second goal of this paper is to present one hundred open questions and problems for future research, whose solution will advance the knowledge in this area. The third goal of this paper is to present and start some directions in solving some of these problems.
Dynamic Management Techniques for Increasing Energy Efficiency within a Data Center
Venue: arXiv cs.DC 2013
Year: 2013

In ours days data centers provide the global community an indispensable service: nearly unlimited access to almost any kind of information we can imagine by supporting most Internet services such as: Web hosting and E-commerce services. Because of their capacity and their work, data centers have various impacts on the environment, but those related with the electricity use are by far the most important. In this paper, we present several power and energy management techniques for data centers and we will focus our attention on techniques that are explicitly tailored to servers and their workloads.
Development of a Hindi Lemmatizer
Venue: arXiv cs.CL 2013
Year: 2013

We live in a translingual society, in order to communicate with people from different parts of the world we need to have an expertise in their respective languages. Learning all these languages is not at all possible; therefore we need a mechanism which can do this task for us. Machine translators have emerged as a tool which can perform this task. In order to develop a machine translator we need to develop several different rules. The very first module that comes in machine translation pipeline is morphological analysis. Stemming and lemmatization comes under morphological analysis. In this paper we have created a lemmatizer which generates rules for removing the affixes along with the addition of rules for creating a proper root word.
On some interrelations of generalized $q$-entropies and a generalized Fisher information, including a Cramér-Rao inequality
Venue: arXiv cs.IT 2013
Year: 2013

In this communication, we describe some interrelations between generalized $q$-entropies and a generalized version of Fisher information. In information theory, the de Bruijn identity links the Fisher information and the derivative of the entropy. We show that this identity can be extended to generalized versions of entropy and Fisher information. More precisely, a generalized Fisher information naturally pops up in the expression of the derivative of the Tsallis entropy. This generalized Fisher information also appears as a special case of a generalized Fisher information for estimation problems. Indeed, we derive here a new Cramér-Rao inequality for the estimation of a parameter, which involves a generalized form of Fisher information. This generalized Fisher information reduces to the standard Fisher information as a particular case. In the case of a translation parameter, the general Cramér-Rao inequality leads to an inequality for distributions which is saturated by generalized $q$-Gaussian distributions. These generalized $q$-Gaussians are important in several areas of physics and mathematics. They are known to maximize the $q$-entropies subject to a moment constraint. The Cramér-Rao inequality shows that the generalized $q$-Gaussians also minimize the generalized Fisher information among distributions with a fixed moment. Similarly, the generalized $q$-Gaussians also minimize the generalized Fisher information among distributions with a given $q$-entropy.
Extended Lambek calculi and first-order linear logic
Venue: arXiv cs.CL 2013
Year: 2013

First-order multiplicative intuitionistic linear logic (MILL1) can be seen as an extension of the Lambek calculus. In addition to the fragment of MILL1 which corresponds to the Lambek calculus (of Moot & Piazza 2001), I will show fragments of MILL1 which generate the multiple context-free languages and which correspond to the Displacement calculus of Morrilll e.a.
Using Visual Aids as a Motivational Tool in Enhancing Students Interest in Reading Literary Texts
Venue: arXiv cs.CY 2013
Year: 2013

This study aims to investigate the teachers perceptions on the use of visual aids (e.g., animation videos, pictures, films and projectors) as a motivational tool in enhancing students interest in reading literary texts. To achieve the aim of the study, the mixed-method approach was used to collect the required data. Therefore, 52 English teachers from seven national secondary schools in Kapit, Sarawak, Malaysia were selected. Five of the respondents were also randomly selected for the interview. The analysis of the data indicated that the majority of the teachers had positive perceptions of the use of visual aids. The use of visual aids enable the teachers to engage their students closely with the literary texts despite of being able to facilitate students of different English proficiency level in reading the texts with interest. This aspect is vital as literature helps to generate students creative and critical thinking skills. Although the teachers had positive attitudes towards the use of visual aids, the study suggests that it will be more interesting and precise if it includes students perceptions as well.
From Parametric Model-based Optimization to robust PID Gain Scheduling
Venue: arXiv cs.SY 2013
Year: 2013

In chemical process applications, model predictive control effectively deals with input and state constraints during transient operations. However, industrial PID controllers directly manipulates the actuators, so they play the key role in small perturbation robustness. This paper considers the problem of augmenting the commonplace PID with the constraint handling and optimization functionalities of MPC. First, we review the MPC framework, which employs a linear feedback gain in its unconstrained region. This linear gain can be any preexisting multiloop PID design, or based on the two stabilizing PI or PID designs for multivariable systems proposed in the paper. The resulting controller is a feedforward PID mapping, a straightforward form without the need of tuning PID to fit an optimal input. The parametrized solution of MPC under constraints further leverages a familiar PID gain scheduling structure. Steady state robustness is achieved along with the PID design so that additional robustness analysis is avoided.
Configurable Strategies for Work-stealing
Venue: arXiv cs.DC 2013
Year: 2013

Work-stealing systems are typically oblivious to the nature of the tasks they are scheduling. For instance, they do not know or take into account how long a task will take to execute or how many subtasks it will spawn. Moreover, the actual task execution order is typically determined by the underlying task storage data structure, and cannot be changed. There are thus possibilities for optimizing task parallel executions by providing information on specific tasks and their preferred execution order to the scheduling system. We introduce scheduling strategies to enable applications to dynamically provide hints to the task-scheduling system on the nature of specific tasks. Scheduling strategies can be used to independently control both local task execution order as well as steal order. In contrast to conventional scheduling policies that are normally global in scope, strategies allow the scheduler to apply optimizations on individual tasks. This flexibility greatly improves composability as it allows the scheduler to apply different, specific scheduling choices for different parts of applications simultaneously. We present a number of benchmarks that highlight diverse, beneficial effects that can be achieved with scheduling strategies. Some benchmarks (branch-and-bound, single-source shortest path) show that prioritization of tasks can reduce the total amount of work compared to standard work-stealing execution order. For other benchmarks (triangle strip generation) qualitatively better results can be achieved in shorter time. Other optimizations, such as dynamic merging of tasks or stealing of half the work, instead of half the tasks, are also shown to improve performance. Composability is demonstrated by examples that combine different strategies, both within the same kernel (prefix sum) as well as when scheduling multiple kernels (prefix sum and unbalanced tree search).
Type-based Dependency Analysis for JavaScript
Venue: arXiv cs.PL 2013
Year: 2013

Dependency analysis is a program analysis that determines potential data flow between program points. While it is not a security analysis per se, it is a viable basis for investigating data integrity, for ensuring confidentiality, and for guaranteeing sanitization. A noninterference property can be stated and proved for the dependency analysis. We have designed and implemented a dependency analysis for JavaScript. We formalize this analysis as an abstraction of a tainting semantics. We prove the correctness of the tainting semantics, the soundness of the abstraction, a noninterference property, and the termination of the analysis.
Low-Rate Machine-Type Communication via Wireless Device-to-Device (D2D) Links
Venue: arXiv cs.IT 2013
Year: 2013

Wireless cellular networks feature two emerging technological trends. The first is the direct Device-to-Device (D2D) communications, which enables direct links between the wireless devices that reutilize the cellular spectrum and radio interface. The second is that of Machine-Type Communications (MTC), where the objective is to attach a large number of low-rate low-power devices, termed Machine-Type Devices (MTDs) to the cellular network. MTDs pose new challenges to the cellular network, one if which is that the low transmission power can lead to outage problems for the cell-edge devices. Another issue imminent to MTC is the \emph{massive access} that can lead to overload of the radio interface. In this paper we explore the opportunity opened by D2D links for supporting MTDs, since it can be desirable to carry the MTC traffic not through direct links to a Base Station, but through a nearby relay. MTC is modeled as a fixed-rate traffic with an outage requirement. We propose two network-assisted D2D schemes that enable the cooperation between MTDs and standard cellular devices, thereby meeting the MTC outage requirements while maximizing the rate of the broadband services for the other devices. The proposed schemes apply the principles Opportunistic Interference Cancellation and the Cognitive Radio's underlaying. We show through analysis and numerical results the gains of the proposed schemes.
Ovopub: Modular data publication with minimal provenance
Venue: arXiv cs.DL 2013
Year: 2013

With the growth of the Semantic Web as a medium for creating, consuming, mashing up and republishing data, our ability to trace any statement(s) back to their origin is becoming ever more important. Several approaches have now been proposed to associate statements with provenance, with multiple applications in data publication, attribution and argumentation. Here, we describe the ovopub, a modular model for data publication that enables encapsulation, aggregation, integrity checking, and selective-source query answering. We describe the ovopub RDF specification, key design patterns and their application in the publication and referral to data in the life sciences.
Towards an Ontology based integrated Framework for Semantic Web
Venue: arXiv cs.AI 2013
Year: 2013

This Ontologies are widely used as a means for solving the information heterogeneity problems on the web because of their capability to provide explicit meaning to the information. They become an efficient tool for knowledge representation in a structured manner. There is always more than one ontology for the same domain. Furthermore, there is no standard method for building ontologies, and there are many ontology building tools using different ontology languages. Because of these reasons, interoperability between the ontologies is very low. Current ontology tools mostly use functions to build, edit and inference the ontology. Methods for merging heterogeneous domain ontologies are not included in most tools. This paper presents ontology merging methodology for building a single global ontology from heterogeneous eXtensible Markup Language (XML) data sources to capture and maintain all the knowledge which XML data sources can contain
Fault-tolerant multipath routing scheme for energy efficient wireless sensor networks
Venue: arXiv cs.NI 2013
Year: 2013

The main challenge in wireless sensor network is to improve the fault tolerance of each node and also provide an energy efficient fast data routing service. In this paper we propose an energy efficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant multipath routing scheme for energy efficient wireless sensor network (FTMRS).The FTMRS is based on multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic on main channel. Shortest path data routing ensures energy efficient data routing. The performance analysis of FTMRS shows better results compared to other popular fault tolerant techniques in wireless sensor networks.
Lensless Imaging by Compressive Sensing
Venue: arXiv cs.CV 2013
Year: 2013

In this paper, we propose a lensless compressive imaging architecture. The architecture consists of two components, an aperture assembly and a sensor. No lens is used. The aperture assembly consists of a two dimensional array of aperture elements. The transmittance of each aperture element is independently controllable. The sensor is a single detection element. A compressive sensing matrix is implemented by adjusting the transmittance of the individual aperture elements according to the values of the sensing matrix. The proposed architecture is simple and reliable because no lens is used. The architecture can be used for capturing images of visible and other spectra such as infrared, or millimeter waves, in surveillance applications for detecting anomalies or extracting features such as speed of moving objects. Multiple sensors may be used with a single aperture assembly to capture multi-view images simultaneously. A prototype was built by using a LCD panel and a photoelectric sensor for capturing images of visible spectrum.
Harmony search to solve the container storage problem with different container types
Venue: arXiv cs.AI 2013
Year: 2013

This paper presents an adaptation of the harmony search algorithm to solve the storage allocation problem for inbound and outbound containers. This problem is studied considering multiple container type (regular, open side, open top, tank, empty and refrigerated) which lets the situation more complicated, as various storage constraints appeared. The objective is to find an optimal container arrangement which respects their departure dates, and minimize the re-handle operations of containers. The performance of the proposed approach is verified comparing to the results generated by genetic algorithm and LIFO algorithm.
A hybrid approach for semantic enrichment of MathML mathematical expressions
Venue: arXiv cs.DL 2013
Year: 2013

In this paper, we present a new approach to the semantic enrichment of mathematical expression problem. Our approach is a combination of statistical machine translation and disambiguation which makes use of surrounding text of the mathematical expressions. We first use Support Vector Machine classifier to disambiguate mathematical terms using both their presentation form and surrounding text. We then use the disambiguation result to enhance the semantic enrichment of a statistical-machine-translation-based system. Experimental results show that our system archives improvements over prior systems.