Shiladitya Munshi

An analytical formulation for cellular automata (CA) based solution of density classification task (DCT)

This paper presents an analytical solution for Density Classification Task (DCT) with an n cell inhomogeneous Cellular Automata represented by its Rule Vector (RV) , where rule Ri is employed on ith cell (i=0,1,2,⋯(n-1)) It reports the Best Rule Vector (BRV) for solution of DCT The concept of Rule Vector Graph (RVG) has provided the framwork for the solution RVG derived from the RV of a CA can be analyzed to derive the Best Rule Vector (BRV) consisting of only rule 232 and 184 (or 226) for 3-neighborhood CA and their equivalent rules for k-neighborhood CA (k>3) The error analysis of the solution has been also reported.

A hybrid graph based framework for integrating information from RDF and topic map: a proposal

This paper presents a proposal of a new hybrid graph based framework for integrating information within two semantic web information exchange format RDF and Topic Map. The disagreement on common information meta-model in semantic web arena, which is characterized by two mostly used information standards (RDF and Topic Map), is aimed to be hurdled across through the development of an integrated platform. On the background of limitations of the previously proposed solutions which address the issues of interoperability between RDF and Topic Map, we propose a novel hybrid graph based information integration platform for semantic web which can efficiently address the concerns of RDF and Topic Map interoperability. The hybrid nature of the proposed graph based model is characterized by the integration of equivalent semantic relations in a hyper graph - graph data structure framework. Critical theoretical aspects of this model are discussed with respect to the requirements and the methodologies.

An Adaptive Server Side Software Authentication Framework Based on User's Activity Pattern

The current paper presents an activity pattern based session specific server side software authentication framework which exploits the fact that software usage pattern of each user has a unique signature. This uniqueness in behavior or activity pattern of a user is described to be a potentially better candidate for software authentication. The identification of signature usage pattern has been developed with adaptive approach. Based on this adaptive signature pattern, the authentication decision has been taken through a statistical computational model. The risk factor of an activity pattern based software authentication has been mitigated byan approach reported as activity transfer.

A Cellular Automata Based Network Security Model

The current paper presents a symmetric key based network security system where Cellular Automata domain functions have been used for key management purpose. A special class of Cellular Automata referred to as Max Length Cellular Automata has been reported as a potential candidate for such key management. A CA codebook based key generation, encryption and decryption algorithms are presented. The complexity analysis of the session specific security system has been discussed in support of the fact that simple, modular hardware oriented design of CA based security is ideally suited for heavy traffic closed network.

Searching and Establishment of S-P-O Relationships for Linked RDF Graphs: An Adaptive Approach

In the coming era of semantic web linked data analysis is a very burning issue for efficient searching and retrieval of information. One way of establishing this link is to implement subject-predicate-object relationship through Set Theory approach which is already done in our previous work. For analyzing inter-relationship between two RDF Graphs, RDFSchema(RDFS) should also be taken care of. In the present paper, an adaptive combination rule based framework has been proposed for establishment of S-P-O (Subject-Predicate-Object)relationship and RDF Graph searching is reported. Hence the identification of criteria for inter-relationship of RDF Graphs opens up new road in semantic search.

Theories of Hypergraph-Graph (HG(2)) Data Structure

Current paper introduces a Hyper graph-Graph (HG(2)) model of data storage which can be represented as a hybrid data structure based on Hyper graph and Graph. The proposed data structure is claimed to realize complex combinatorial structures. The formal definition of the data structure is presented along with the proper justification from real world scenarios. The paper reports some elementary concepts of Hyper graph and presents theoretical aspects of the proposed data structure including the concepts of Path, Cycle etc. The detailed analysis of weighted HG(2) is presented along with discussions on Cost involved with HG(2) paths.

Constraint Driven Stratification of RDF with Hypergraph Graph (HG(2)) Data Structure

Current paper introduces a Constraint Driven Stratificatified Model for RDF with Hypergraph-Graph (HG(2)) model of data storage which can be represented as a hybrid data structure based on Hypergraph and Graph. In general, the schema component of RDF i,e RDFS is unstratified in nature. In order to establish a sustained information integration of RDF and Topic Map or other stratified semantic metamodel, imposing some constraints on RDF (without any semantic loss) evolves as an imperative pre condition. While HG(2) data structure is claimed to realize complex combinatorial structures, the current investigation reports a novel HG(2) based model for constraint driven stratification of RDF without any loss of semantic expressiveness.

Integrating RDF into Hypergraph-Graph (HG(2)) Data Structure

Current paper discusses the methodologies involved in integrating Resource Description Framework (RDF) into a Hyper Graph - Graph (HG(2)) data structure in order to preserve the semantics of the information contained in RDF document for dealing future cross platform information portability issues. The entire semantic web is mostly dominated by few information frameworks like RDF, Topic Map, OWL etc. Hence semantic web currently faces the problem of non existence of common information meta-model which can integrate them all for expanded semantic search. On the background of development of Hyper Graph - Graph (HG(2)) data structure, an RDF document if integrated to it, maintains the original semantics and exposes some critical semantic and object mapping lift as well which could further be exploited for semantic search and information transitional problems. The focus of the paper is to present the mapping constructs between RDF elements and Hyper Graph - Graph (HG(2)) elements.