Manpower information

A description of the NAL nominal roll database (listing basic information about NAL employees) created using the Ingres relational database software. Using this database it is possible to provide a wide variety of reports about NAL staff, respond to a wide assortment of queries and undertake elementary statistical analysis to tabulate (and pictorially depict) the average age of NAL scientists, the future retirement pattern of NAL employees etc

The Disappearance of Roddam Narasimha

Roddam Narasimha (1933-2020), a great scientist and scholar, will be remembered in India for his contributions to the development of computing, aerospace technology as the initiator of the LCA programme, the space programme as the longest-serving member of the Space Commission, and in drafting the country’s nuclear doctrine

CLASSES OF HYPERGRAPHS, THE STRONG PERFECT GRAPH CONJECTURE AND RELATIONAL DATABASES

Several classes of hypergraphs have been defined, or characterised, in terms of cycles. Such a formulation can be very attractive. For example, to verify that a given13; class of graphs satisfies the Strong Perfect Graph13; Conjecture, one is really required to verify a certain13; condition involving cycles. A formulation using hypergraphs13; can sometimes make this much simpler instead of considering cycles of a 'given graph, G, one looks at cycles of the quot;Helly hypergraphquot; H of G (L(H)=G). We discuss examples where the hypergraphic formulation appears to be superior, and also use this formulation13; to discover new classes of graphs verifying the Strong13; Conjecture.13; 13; Research workers in relational databases, which can be viewed as hypergraphs, are presently studying various13; definitions of acyclicity. It turns out that acyclic13; databases correspond to the well -characterised subtree13; hypergraphs. So can we meaningfully interpret other known classes of hypergraphs in the context of relational13; databases

A proof of lobb revisited

The Strong Perfect Graph Conjecture of Claude Berge is now nearly 25 years old. Efforts to resolve the conjecture almost always use an approach which is quot;graphicalquot; in spirit. A proof by Lobb threw open the interesting possibility that the hypergraph, instead of the graph, could be employed to resolve the conjecture. Here, we study Lobb's theorem in some detail, propose a simpler proof, but end up discovering that this approach can at best help verify the strong conjecture for special classes of graphs. The winning proof is, probably, still very far away

Lectures on Information Systems

A compilation of lectures on information systems delivered13; to fourth semester MCA students of Bangalore University during13; November 1995 to May 1996

A procedure to handle mailing lists

The computer is a willing ally as we develop programs using the dBase III package to handle NAL's mailing lis

Lectures on Networks, Internet and the World13; Wide Web

This publication compiles the lectures I delivered to four13; batches of NAL staff members at different times in 1999. Each round involved nine lectures (with tutorials) spanning about 20 hours

An introduction to operations research

An information introduction to operations research and its techniques is presented. Chaos, queuing theory, and network analysis are briefly examine