Entity

Time filter

Source Type

West Bengal, India

Banerjee S.,West Bengal State University | Sensarma D.,West Bengal State University | Basuli K.,West Bengal State University | Naskar S.,Sarsuna College | Sarma S.S.,University of Calcutta
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering | Year: 2012

The Reconstruction Conjecture is one of the most engaging problems under the domain of Graph Theory. The conjecture proposes that every graph with at least three vertices can be uniquely reconstructed given the multiset of subgraphs produced by deleting each vertex of the original graph one by one. This conjecture has been proven true for several infinite classes of graphs, but the general case remains unsolved. In this paper we will outline the problem and give a practical method for reconstructing a graph from its node-deleted. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering. Source


Naskar S.,Sarsuna College | Basuli K.,WBSU | Sarma S.S.,University of Calcutta
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering | Year: 2012

Many problems in science and engineering [1, 3, 8, 10] can be formulated in terms of graphs. There are problems where spanning trees are necessary to be computed from the given graphs. Connected subgraph with all the n vertices of the graph G(V,E), where |V|=n, having exactly of n(1 edges called the spanning tree of the given graph. The major bottleneck of any tree generation algorithm is the prohibitively large cost of testing whether a newly born tree is twin of a previously generated one and also there is a problem that without checking for circuit generated subgraph is tree or non-tree. This problem increases the time complexity of the existing algorithms. The present approach avoids this problem with a simple but efficient procedure and at the same time ensures that a large number of non-tree subgraphs are not generated at all. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering. Source


Dey A.,Sarsuna College
Nanotechnology Reviews | Year: 2015

Conducting polymer-wide band gap semiconductor nanocomposites are prepared by polymerizing pyrrole in the presence of colloidal titanium dioxide (TiO2) sol. Characterizations of nanocomposites are carried out by Fourier transform infrared spectroscopy (FTIR), transmission electron microscopy (TEM) and X-ray diffraction (XRD). Direct current (dc) and alternating current (ac) conductivities of nanocomposites have been investigated as a function of temperature and frequency for different concentrations of polypyrrole (PPY). The temperature dependence of ac conductivity suggests that small polaron tunneling occurs in the charge transfer process. A very large dielectric constant of about 13,000 at room temperature has been observed. The interface between PPY and TiO2 plays an important role in yielding a large dielectric constant in the composite. © 2015 by De Gruyter 2015. Source


Gupta S.K.,Sarsuna College | De S.,General Motors | Chatterjee A.,University of Calcutta
Reliability Engineering and System Safety | Year: 2014

Warranty modelling with incomplete data is a major issue in reliability analysis. The incomplete failure region characterized by warranty field data may be classified into several domains representing failures from manufacturing/assembly defects, usage or fatigue. In the present paper a data driven approach has been suggested to demark the regions optimally through estimation of the change point in a hazard function. In the perspective of bivariate warranty analysis, as relevant in automobiles, we have assumed the lifetime distribution to be a mixture of distributions corresponding to the burn-in period and the useful life period. The proportions of observations in different regions demarketed by the warranty policy in the bivariate plane have been estimated by considering mileage along with age. The estimation scheme has been verified and validated through extensive simulation studies. The utilities of the results have been demonstrated by addressing several issues through a real life synthetic warranty data set from a large automobile company. © 2014 Elsevier Ltd. All rights reserved. Source


Sensarma D.,West Bengal State University | Banerjee S.,West Bengal State University | Basuli K.,West Bengal State University | Naskar S.,Sarsuna College | Sarma S.S.,University of Calcutta
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering | Year: 2012

Two-level logic minimization is a central problem in logic synthesis, and has applications in reliability analysis and automated reasoning. This paper represents a method of minimizing Boolean sum of products function with binary decision diagram and with disjoint sum of product minimization. Due to the symbolic representation of cubes for large problem instances, the method is orders of magnitude faster than previous enumerative techniques. But the quality of the approach largely depends on the variable ordering of the underlying BDD. The application of Binary Decision Diagrams (BDDs) as an efficient approach for the minimization of Disjoint Sums-of-Products (DSOPs). DSOPs are a starting point for several applications. The use of BDDs has the advantage of an implicit representation of terms. Due to this scheme the algorithm is faster than techniques working on explicit representations and the application to large circuits that could not be handled so far becomes possible. Theoretical studies on the influence of the BDDs to the search space are carried out. In experiments the proposed technique is compared to others. The results with respect to the size of the resulting DSOP are as good or better as those of the other techniques. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering. Source

Discover hidden collaborations