Samar Sen Sarma

An Insight Into The Z-number Approach To CWW

The Z-number is a new fuzzy-theoretic concept, proposed by Zadeh in 2011. It extends the basic philosophy of Computing With Words CWW to include the perception of uncertainty of the information conveyed by a natural language statement. The Z-number thus, serves as a model of linguistic summarization of natural language statements, a technique to merge human-affective perspectives with CWW, and consequently can be envisaged to play a radical role in the domain of CWW-based system design and Natural Language Processing NLP. This article presents a comprehensive investigation of the Z-number approach to CWW. We present here: a an outline of our understanding of the generic architecture, algorithm and challenges underlying CWW in general; b a detailed study of the Z-number methodology-where we propose an algorithm for CWW using Z-numbers, define a Z-number based operator for the evaluation of the level of requirement satisfaction, and describe simulation experiments of CWW utilizing Z-numbers; and c analyse the strengths and the challenges of the Z-numbers, and suggest possible solution strategies. We believe that this article would inspire research on the need for inclusion of human-behavioural aspects into CWW, as well as the integration of CWW and NLP.

Comparative Performance of Modified Simulated Annealing with Simple Simulated Annealing for Graph Coloring Problem

The problems which are NP-complete in nature are always attracting the computer scientists to develop some heuristic algorithms, generating optimal solution in time-space efficient manner compared to the existing ones. Coloring of the vertices of a graph with minimum number of colours belongs to the same category, where the algorithm designers are trying to propose some new algorithms for better result. Here, we have designed modified Simulated Annealing (MSA) for optimal vertex coloring of a simple, symmetric and connected graph (GCP). The algorithm has been tested upon a series of benchmarks including large scale test case and has shown better output than the simple or non-modified version of the same algorithm. This paper describes the advancement of performance of simple SA applied upon the problem of graph coloring using a specially designed operator called random change operator instead of the general change operator. Our work is still going on for designing better algorithms generating optimal solutions.

An internet-based IP protection scheme for circuit designs using linear feedback shift register (LFSR)-based locking

IP reuse is rapidly proliferating recent automated circuit design. It is facing serious challenges like forgery, theft and misappropriation of intellectual property (IP) of the design. Thus, protection of design IP is a matter of prime concern. In this paper, we propose a novel Internet-based scheme to tackle this problem. Input to the proposed scheme is a graph corresponding to a digital system design. Watermarking of the graph and its encryption are achieved using a new linear feedback shift register(LFSR)-based locking scheme. The proposed scheme makes unauthorized disclosure of valuable design almost infeasible, and can easily detect any alteration of the design file during transmission. It ensures authentication of the original designer as well as non-repudiation between the seller and the buyer. Empirical evidences on several benchmark problem sets are encouraging.

Minimizing Boolean Sum of Products Functions Using Binary Decision Diagram

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.

Computer Network Topology Design in Limelight of Pascal Graph Property

Constantly growing demands of high productivity and security of computer systems and computer networks call the interest of specialists in the environment of construction of optimum topologies of computer mediums. In earliest phases of design, the study of the topological influence of the processes that happen in computer systems and computer networks allows to obtain useful information which possesses a significant value in the subsequent design. It has always been tried to represent the different computer network topologies using appropriate graph models. Graphs have huge contributions towards the performance improvement factor of a network. Some major contributors are de-Bruijn, Hypercube, Mesh and Pascal. They had been studied a lot and different new features were always a part of research outcome. As per the definition of interconnection network it is equivalent that a suitable graph can represent the physical and logical layout very efficiently. In this present study Pascal graph is researched again and a new characteristics has been discovered. From the perspective of network topologies Pascal graph and its properties were first studied more than two decades back. Since then, a numerous graph models have emerged with potentials to be used as network topologies. This new property is guaranteed to make an everlasting mark towards the reliability of this graph to be used as a substantial contributor as a computer network topology. This shows its credentials over so many other topologies. This study reviews the characteristics of the Pascal graph and the new property is established using appropriate algorithm and the results.

The Reconstruction Conjecture

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.

Generation of All Spanning Trees

This paper deals with all spanning tree generation of a simple, symmetric and connected graph. Since, number of spanning trees of a graph is asymptotically exponential it is our endeavor to generate, all trees in reasonable amount of time and space[10]. The method here is qualitatively and quantitatively better than existing methods. The reason behind the claim is minimum number of duplicate tree comparison and no circuit testing at all for its realization[10,4,5,7,8,9,12,13]. We are hopeful that betterment of the algorithm lies in the target of no duplicate tree generation.

Serial port data communication using MODBUS protocol

Serial communication is the process of sending data sequentially one bit at a time, over a communication channel or computer bus [5,6,7]. RS-232 is a standard for serial binary data transfer between a data terminal equipment (DTE) and a data circuit-terminating equipment (DCE), commonly used in computer serial ports.

On degree sequence

I ndi got her BS in Computer Science from Cal Poly and began her masters at Colorado State. She then worked as a software engineer, later managing Web applications that focused on the user. Her concepts in mental models derive from attempting to bridge the developer-user gap. Her expertise ranges from structuring crossfunctional teams, to managing participant recruiting, and conducting user interviews, thereby creating effective tools for exchanging results.

Generation of All Spanning Trees in the Limelight

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.