Computer and information sciences topic list of research papers
-
Research on Airworthiness Management System and Personalized Information Service of Civil Aviation
Abstract In view of the importance and onerous of civil aviation airworthiness management, an airworthiness management system, which is based on the architecture of C/S and B/S, has been designed and developed. A personalized information service...
2012 / Li Zhifang, Huang Binwen -
A Survey on Energy Management in the Wireless Sensor Networks
Abstract The problem of energy in the wireless sensor networks is the key problem of relation with the network survival time; also it is the primary objective to be solved in the wireless sensor networks design. In this paper, the author summarizes...
2012 / Fangxin Chen, Lejiang Guo, Chang Chen -
The dynamics of information exchange dialogues
Abstract A simple model of cooperative information exchange between multiple participants is defined, using propositional update semantics. The model is presented in the form of a reduction system. Several properties of the system are proven,...
2005 / Balder ten Cate -
A Categorical Semantics of Higher Order Store
Abstract We give a categorical description of a class of sound and adequate models of a functional language with assignable variables. This is based on a notion of “sequoidal category”, a symmetric monoidal category with an additional...
2004 / J. Laird -
Rule Discovery Based on New Attributes Construction
Abstract This paper presents a method of constructing new attributes as a linear combination of original ones. Decision table based on n classification attributes and containing k-objects is seen in this paper as a collection of k points in...
2004 / -
Flow Analytic Type System for Array Bound Checks
Abstract It is widely recognized that formulating program analysis by a type system is a promising approach because of its clarity and rigidity. However, there remains much to be done for applying them to practical use. One of the problems is that...
2004 / MATSUNO Yutaka, Hiroyuki SATO -
Scoped Metatheorems
Abstract Proof development systems traditionally structure theories hierarchically: Theorems established in a subtheory hold in all supertheories. While often effective, this is sometimes too restrictive as there are certain facts that are true of...
2005 / David Basin, Seán Matthews -
A calculus of Kells
Abstract This paper introduces the Kell calculus, a new process calculus that retains the original insights of the M-calculus (local actions, higher-order processes and programmable membranes) in a much simpler setting. The calculus is shown...
2005 / Jean-Bernard Stefani -
Concurrent Computing: from Petri Nets to Graph Grammars
Abstract Petri nets are widely accepted as a specification formalism for concurrent and distributed systems. One of the reasons of their success is the fact that they are equipped with a rich theory, including well-understood concurrent semantics;...
2005 / Andrea Corradini -
Prototyping of Hybrid Systems – From HyCharts to Hybrid Data-Flow Graphs
Abstract In this paper, a translation of the visual description technique HyCharts to Hybrid Data-Flow Graphs (HDFG) is given. While HyCharts combine a data-flow and a control-flow oriented formalism for the specification of the architecture and the ...
2005 / Thomas Stauner, Christoph Grimm -
Zooming-out on Higraph-based diagrams
Abstract Computing system representations based on Harel's notion of hierarchical graph, or higraph, have become popular since the invention of Statecharts. Such hierarchical representations support a useful filtering operation, called...
2004 / Stuart Anderson, John Power, Konstantinos Tourlas -
Well-behaved Translations between Structural Operational Semantics
Abstract We examine two versions of maps between distributive laws as candidates for well-behaved translations between structural operational semantics, and validate that by using simple coalgebraic arguments. We give some concrete examples of...
2004 / Hiroshi Watanabe -
A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras
Abstract In [19] Rutten introduced the notion of weak bisimulations and weak bisimilarity for coalgebras of the functor F(X) = X + O. In the present paper I will introduce a notion of weak bisimulation for coalgebras based on the syntax of their...
2004 / Jan Rothe -
Analyzing Structural & Temporal Characteristics of Keyword System in Academic Research Articles
Abstract Keyword networks, formed from keywords occurring in scholarly articles provide a useful mechanism for understanding academic research trends. In keyword networks, keywords are represented as nodes and a link is formed between a pair of...
2013 / Arjun Duvvuru, Srinivasan Radhakrishnan, Deepali More, Sagar Kamarthi, Sivarit Sultornsanee -
Optimized Video Steganography Using Genetic Algorithm (GA)
Abstract This paper proposes a novel video steganography scheme for efficient and effective information hiding. In this era of Internet communication video is considered to be an effective and important tool for communication. Video steganography...
2014 / Kousik Dasgupta, Jyotsna Kumar Mondal, Paramartha Dutta -
An Efficient Overlay Infrastructure for Privacy-Preserving Communication on the Internet
Abstract This paper presents Mist2 (Mist 2nd generation), an overlay infrastructure for privacy-preserving communication. Nodes are arranged in concentric rings, which reduce average overlay hop latencies. Mist2 builds on the strengths of previous...
2013 / Jalal Al-Muhtadi -
PMG: Multi-core Metabolite Identification
Abstract Distributed computing has been considered for decades as a promising way of speeding up software execution, resulting in a valuable collection of safe and efficient concurrent algorithms. With the pervasion of multi-core processors,...
2013 / Mohammad Mahdi Jaghoori, Sung-Shik T.Q. Jongmans, Frank de Boer, Julio Peironcely, Jean-Loup Faulon, et al. -
Preface2013 / Martin Fränzle, Antonios Tsourdos
-
Distributed Probabilistic and Quantum Strategies
Abstract Building on a new definition and characterization of probabilistic event structures, a general definition of distributed probabilistic strategies is proposed. Probabilistic strategies are shown to compose, with probabilistic copy-cat...
2013 / Glynn Winskel -
Soft Computing Approaches in Traffic Control Systems: A Review
Abstract Handling congestion in urban traffic through next generation artificial intelligence techniques is an important research area. Various models and approaches have been developed using soft computing techniques to tackle with this problem....
2013 / Shailendra Tahilyani, Manuj Darbari, Praveen Kumar Shukla