Computer and information sciences topic list of research papers
-
Review and comparative analysis of geometric semantic crossovers2014 / Tomasz P. Pawlak, Bartosz Wieloch, Krzysztof Krawiec
-
The Making of Lingala Corpus: An Under-resourced Language and the Internet
Abstract Lingala is now the most widespread language in Congo. The Internet provides a great amount of data. This paper has attempted to elucidate the issues that are involved with building a corpus for an under-resourced language where access to...
2015 / Bienvenu Sene-Mongaba -
Plagiarism Detection by Identifying the Equations
Abstract In academia Plagiarism means copying of other work without author's permission. Presently available system mainly focuses on software plagiarism. They mainly based on token analysis, linguistic patterns, taxonomy and textual features. In...
2014 / Debotosh Bhattacharjee, Sandipan Dutta -
Definition of an Approach for the Development of Product-Service Systems
Abstract The concept of Product-Service Systems (PSS) allows companies to offer customer focused products by matching classical product concepts with service concepts. This results in new challenges for the development phase. This publication aims...
2015 / Uwe Moser, Sebastian Maisenbacher, Daniel Kasperek, Maik Maurer -
Two-way pebble transducers for partial functions and their composition2015 / Joost Engelfriet
-
A New Technique for Generating Minimal Cut Sets in Nontrivial Network
Abstract Network reliability analysis problem is the center of many scientific productions. It consists of evaluating the all-terminal reliability of networks. Two classes have emerged; exact and approximate methods. The aim of this paper is to...
2013 / Mohamed-Larbi Rebaiaia, Daoud Ait-Kadi -
Ultrasonic Multiple-Access Ranging System Using Spread Spectrum and MEMS Technology for Indoor Localization2014 / Laurent Segers, Jelmer Tiete, An Braeken, Abdellah Touhafi
-
User Activity Recognition in Smart Homes Using Pattern Clustering Applied to Temporal ANN Algorithm2015 / Serge Bourobou, Younghwan Yoo
-
AMA: Asynchronous Management of Accelerators for Task-based Programming Models
Abstract Computational science has benefited in the last years from emerging accelerators that increase the performance of scientific simulations, but using these devices hinders the programming task. This paper presents AMA: a set of optimization...
2015 / Judit Planas, Rosa M. Badia, Eduard Ayguade, Jesus Labarta -
System-level protection and hardware Trojan detection using weighted voting
Abstract The problem of hardware Trojans is becoming more serious especially with the widespread of fabless design houses and design reuse. Hardware Trojans can be embedded on chip during manufacturing or in third party intellectual property cores...
2013 / Hany A.M. Amin, Yousra Alkabani, Gamal M.I. Selim -
Randomness Criteria of the RMT-test Compared to the NIST
Abstract In this article, we report a new result of the error limit to be used for the RMT-test, which we have proposed earlier in order to measure the randomness of one-dimensional data sequence based on the comparison to the theoretical value...
2013 / Yuuta Mikamori, Xin Yang, Ryota Itoi, Mieko Tanaka-Yamawaki -
Arguments and Misunderstandings
Abstract In this paper, we develop the notion of fuzzy unification and incorporate it into a novel fuzzy argumentation framework for extended logic programming. We make the following contributions: The argumentation framework is defined by a...
2004 / Michael Schroeder, Ralf Schweimeier -
Memoization-Based Proof Search in LF
Abstract Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Proof search in this framework is based on the operational semantics of logic...
2004 / Brigitte Pientka -
Exhausting Strategies, Joker Games and Full Completeness for IMLL with Unit (Preliminary Version)
Abstract We present a game description of free symmetric monoidal closed categories, which can also be viewed as a fully complete model for the Intuitionistic Multiplicative Linear Logic with the tensor unit. We model the unit by a distinguished...
2005 / A.S. Murawski, C.-H.L. Ong -
Generation of Exhaustive Set of Rules within Dominance-based Rough Set Approach
Abstract The rough sets theory has proved to be a useful mathematical tool for the analysis of a vague description of objects. One of extensions of the classic theory is the Dominance-based Set Approach (DRSA) that allows analysing...
2004 / Krzysztof Dembczyński, Roman Pindur, Robert Susmaga -
Weaknesses of Margulis and Ramanujan-Margulis Low-Density Parity-Check Codes
Abstract We report weaknesses in two algebraic constructions of low-density parity-check codes based on expander graphs. The Margulis construction gives a code with near-codewords, which cause problems for the sum-product decoder; The...
2004 / David J.C. MacKay, Michael S. Postol -
A Compositional Approach to Structuring and Refinement of Typed Graph Grammars
Abstract Based on a categorical semantics that has been developed for typed graph grammars we uses colimits (pushouts) to model composition and (reverse) graph grammar morphisms to describe refinements of typed graph grammars. Composition of graph...
2005 / Andrea Corradini, Reiko Heckel -
The Tabular Method for Relational Documentation
Abstract The basic mathematical laws of relations can be presented and verified using compact abstract notation. However, descriptions of specific relations, such as those that arise in describing software, must be done in terms of a a state...
2004 / David L. Parnas -
Monads, Effects and Transformations
Abstract We define a typed compiler intermediate language, MIL-lite, which incorporates computational types refined with effect information. We characterise MIL-lite observational congruence by using Howe's method to prove a ciu theorem for the...
2005 / Nick Benton, Andrew Kennedy -
Zero-Safe Nets, or Transition Synchronization Made Simple
Abstract In addition to ordinary places, called stable, zero-safe nets are equipped with zero places, which in a stable marking cannot contain any token. An evolution between two stable markings, instead, can be a complex computation called stable...
2005 / Roberto Bruni, Ugo Montanari