Sastha Sriram

Bio: Sastha Sriram is an academic researcher from Shanmugha Arts, Science, Technology & Research Academy. The author has contributed to research in topics: Membrane computing & Vertex (geometry). The author has an hindex of 2, co-authored 12 publications receiving 11 citations. Previous affiliations of Sastha Sriram include Vels University & K L University.

An Overview of 2D Picture Array Generating Models Based on Membrane Computing

Abstract: A variety of two-dimensional array grammar models generating picture array languages have been introduced and investigated, utilizing and extending the well-established notions and techniques of formal string language theory. On the other hand the versatile computing model with a generic name of P system in the area of membrane computing, has turned out to be a rich framework for different kinds of problems in a variety of fields. Picture array generation in the field of two-dimensional (2D) languages is one such area where P systems with array objects and array rewriting, referred to as array P systems, have been fruitfully employed in increasing the generating power of the 2D grammar models. A variety of array P systems have been proposed in the literature. The objective of this survey is to review and describe the salient features of the major types of array P systems, which have served as the basis for developing other kinds of array P systems. Applications of these array P systems are also briefly described besides indicating possible new directions of investigation.

On Eccentric Connectivity Index of Eccentric Graph of Regular Dendrimer

Abstract: The eccentric connectivity index \(\xi ^c(G)\) of a connected graph G is defined as \(\xi ^c(G) =\sum _{v \in V(G)}{deg(v) e(v)},\) where deg( v) is the degree of vertex v and e( v) is the eccentricity of v. The eccentric graph, \(G_e\), of a graph G has the same set of vertices as G; with two vertices u; v adjacent in Ge if and only if either u is an eccentric vertex of v or v is an eccentric vertex of u: In this paper, we obtain a formula for the eccentric connectivity index of the eccentric graph of a regular dendrimer. We also derive a formula for the eccentric connectivity index for the second iteration of eccentric graph of regular dendrimer.

Algebraic Properties of Parikh Matrices of Binary Picture Arrays

Abstract: A word is a finite sequence of symbols. Parikh matrix of a word is an upper triangular matrix with ones in the main diagonal and nonnegative integers above the main diagonal which are counts of certain scattered subwords in the word. On the other hand, a picture array, which is a rectangular arrangement of symbols, is an extension of the notion of a word to two dimensions. Parikh matrices associated with a picture array have been introduced, and their properties have been studied. Here, we obtain certain algebraic properties of Parikh matrices of binary picture arrays based on the notions of power, fairness, and a restricted shuffle operator extending the corresponding notions studied in the case of words. We also obtain properties of Parikh matrices of arrays formed by certain geometric operations.

Wiener-type indices of Parikh word representable graphs

Abstract: A new class of graphs G(w), called Parikh word representable graphs (PWRG), corresponding to words $w$ that are finite sequence of symbols, was considered in the recent past. Several properties of these graphs have been established. In this paper, we consider these graphs corresponding to binary core words of the form $aub$ over a binary alphabet {a,b}. We derive formulas for computing the Wiener index of the PWRG of a binary core word. Sharp bounds are established on the value of this index in terms of different parameters related to binary words over {a,b} and the corresponding PWRGs. Certain other Wiener-type indices that are variants of Wiener index are also considered. Formulas for computing these indices in the case of PWRG of a binary core word are obtained.

Membrane computing and image processing: a short survey

Abstract: Membrane computing is a well-known research area in computer science inspired by the organization and behavior of live cells and tissues. Their computational devices, called P systems, work in parallel and distributed mode and the information is encoded by multisets in a localized manner. All these features make P systems appropriate for dealing with digital images. In this paper, some of the open research lines in the area are presented, focusing on segmentation problems, skeletonization and algebraic-topological aspects of the images. An extensive bibliography about the application of membrane computing to the study of digital images is also provided.

Dendrimers And Dendrons Concepts Syntheses Applications

Abstract: Thank you very much for reading dendrimers and dendrons concepts syntheses applications. Maybe you have knowledge that, people have look numerous times for their chosen readings like this dendrimers and dendrons concepts syntheses applications, but end up in malicious downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they cope with some harmful virus inside their computer.

Unsupervised Segmentation of Choroidal Neovascularization for Optical Coherence Tomography Angiography by Grid Tissue-Like Membrane Systems

Abstract: Accurate segmentation of choroidal neovascularization (CNV) patterns is vital for precise lesion size quantification in age-related macular degeneration. In this paper, we develop a method for unsupervised and parallel segmentation of CNV in optical coherence tomography based on a grid tissue-like membrane (GTM) system. A GTM system incorporates a modified Clustering In QUEst (CLIQUE) algorithm into tissue-like membrane systems. Exploiting CLIQUE's aptitude for unsupervised clustering, GTM systems can detect CNV of different shapes, positions and density without the need of a training stage. The average dice ratio is 0.84±0.04, outperforms both baseline and the state-of-the-art methods. Besides, being a parallel computational paradigm, GTM systems can handle all scans under analysis simultaneously and therefore they are less time consuming, completing CNV detection on 48 scans in 0.56 seconds.

Parallel contextual array P systems

Abstract: Contextual array P systems generate two-dimensional picture arrays by sequential application of contextual array rules on picture arrays. Here we consider a parallel mode of application of the contextual array rules in the regions of such an array P system. We call the resulting array P system as parallel contextual array P system (PCAP) and we study the generative power of these systems. A main advantage is that the number of membranes needed in the constructions of the PCAP for picture array generation is reduced in comparison with the sequential counterpart.

3D-Array Token Petri Nets Generating Tetrahedral Picture Languages.

Abstract: The study of two-dimensional picture languages has a wide application in image analysis and pattern recognition [5, 7, 13, 17]. There are various models such as grammars, automata, P systems and Petri Nets to generate different picture languages available in the literature [1, 2, 3, 4, 6, 8, 10, 11, 12, 14, 15, 18]. In this paper we consider Petri Nets generating tetrahedral picture languages. The patterns generated are interesting, new and are applicable in floor design, wall design and tiling. We compare the generative power of these Petri Nets with that of other recent models [9, 16] developed by our group.