Computer and information sciences topic list of research papers
-
Facebook Literacy in Education
Abstract Recently there have been lots of development in technology. These developments create a base of information society. Especially social networks are one of the stone that help to create a base of information society. Facebook is widely used...
2014 / Nazire Burçin Hamutoğlu, Mubin Kiyici, Aytekin Işman -
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Abstract In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for...
2013 / Igor Chikalov, Shahid Hussain, Mikhail Moshkov -
Data Intensive Design for Multi-core Era
Abstract Modern multi-core design will continue Moore's law and facilitate platforms for both wired and wireless communications. It is also predicted that multi-core, as a popular computing platform, will need to have the capability to process “big...
2013 / He Zhou, Linda S. Powers, Janet M. Roveda -
Unit Commitment Using Embedded Systems
Abstract Unit commitment problem helps in deciding which electricity generation unit should be running in each period so as to satisfy a predictably varying demand for electricity. Unit Commitment enables uninterruptible power to be delivered to...
2015 / R. Jayabarathi, M. Jisma, A. Suyampulingam -
A Framework for Negotiating Service Level Agreement of Cloud-based Services
Abstract Cloud-based services have become the backbone of IT industry nowadays and the promising technology that offers a commoditized service to the software, the platform and the infrastructure where they are delivered as a service. Because...
2015 / Radwa El-Awadi, Mohamed Abu-Rizka -
Path-based Security for Mobile Agents2004 / Gerald Knoll, Niranjan Suri, Jeffrey M. Bradshaw
-
A Rewriting Logic Implementation of Erlang
Abstract This paper provides a contribution to the formal verification of programs written in the concurrent functional programming language Erlang, which is designed for telecommunication applications. It presents a formal description of this...
2004 / Thomas Noll -
On Improving Backwards Verification of Timed Automata (Extended Abstract)
Abstract Verification techniques for Timed Automata [2] built in tools like Kronos [7] are based on the fixpoint calculus of an appropriate operator. In this work, we present different alternatives to calculate that fixpoint, which have direct...
2004 / Victor Braberman, Carlos López Pombo, Alfredo Olivero -
Induction, Coinduction, and Adjoints
Abstract We investigate the reasons for which the existence of certain right adjoints implies the existence of some final coalgebras, and vice-versa. In particular we prove and discuss the following theorem which has been partially available in the...
2004 / Robin Cockett, Luigi Santocanale -
Solving Binary CSP Using Computational Systems
Abstract In this paper we formalise CSP solving as an inference process. Based on the notion of Computational Systems we associate actions with rewriting rules and control with strategies that establish the order of application of the inferences....
2004 / Carlos Castro -
Security Issues in Component-based Design
Abstract We propose a behavioural extension of the concept of interface of components. We aim to uniformly reason about correctness properties of both closed and open component-based systems. The characterizing feature of our approach is that we...
2004 / A. Bracciali, A. Brogi, G. Ferrari, E. Tuosto -
Study of ADS-B Data Evaluation
Abstract In western China, the terrain and meteorological conditions are so complex that it is not suitable to construct new radar stations. Automatic dependent surveillance-broadcast (ADS-B) is a totally new surveillance method, so before...
2011 / Jun ZHANG, Wei LIU, Yanbo ZHU -
A Logic for Modular Descriptions of Asynchronous and Synchronized Concurrent Systems
Abstract Tile logic is a framework to reason about the dynamic evolution of concurrent systems in a modular way, and it extends rewriting logic (in the unconditional case) by rewriting synchronization and side effects. The...
2005 / Roberto Bruni -
Shortest Path Problem for Public Transportation Using GPS and Map Service
Abstract Area of a city tends to be larger. Along with the expansion of the scope of a town, public cruising range will be more widespread, so the ability to remember the location of the nearest public facility will be decreased. Another reason...
2012 / Esther Irawati Setiawan, Gunawan, Indra Maryati, Joan Santoso, Rossy Prabowo Chandra -
Lowness Properties of Reals and Hyper-Immunity
Abstract Ambos-Spies and Kučera [1, Problem 4.5] asked if there is a non-computable set A which is low for the computably random reals. We show that no such A is of hyper-immune degree. Thus, each g ≤ T ...
2004 / Benjamín René Callejas Bedregal, André Nies -
Some algebraic laws for spans (and their connections with multirelations)1 1Research partly supported by the EC TMR Network getgrats and by the Italian MURST Project tosca.
Abstract This paper investigates some key algebraic properties of the categories of spans and cospans (up to isomorphic supports) over the category Set of (small) sets and functions, analyzing the monoidal structures induced over both spans and...
2004 / Roberto Bruni, Fabio Gadducci -
Some Challenging Typing Issues in Object-Oriented Languages
Abstract In this paper we discuss some of the remaining problems in the design of static type systems for object-oriented programming languages. We look at typing problems involved in writing a simple interpreter as a good example of a simple...
2004 / Kim B. Bruce -
Strict Lower Bounds for Model Checking BPA
Abstract We show strict lower bounds for the complexity of several model checking problems for BPA (Basic Process Algebra). Model checking BPA with Hennessy-Milner Logic is PSPACE-hard, while model checking BPA with the (alternation-free) modal...
2005 / Richard Mayr -
Precategories for Combining Probabilistic Automata
Abstract A relaxed notion of category is presented having in mind the categorical caracterization of the mechanisms for combining probabilistic automata, since the composition of the appropriate morphisms is not always defined, A detailed discussion ...
2005 / Paulo Mateus, Amílcar Sernadas, Cristina Sernadas -
Preface
Abstract This volume contains the Proceedings of A Tutorial Workshop on Realizability Semantics and Applications. The workshop was associated to the 1999 Federated Logic Conference, held in Trento, Italy, from June 30 to July 1, 1999. ...
2005 / Birkedal Lars, Oosten Jaap van, Rosolini Giuseppe, Dana S. Scott