Avadhut Sardeshmukh
          avadhut at cse dot iitb dot ac dot in
         

Projects and Semimnar

R&D Projects
Supervisor : Dr Krishna S
Reports : R&D Project-I | R&D Project-II

I was always fascinated by theoretical aspect of computer science and hence did majority of my courses in theory. After doing the course "Natural Computing", I got initiated to the area of formal languages and automata. My R&D Project-I was a reading seminar, in which I studied P Systems .
In R&D Project-II, I studied in detail the computing power of a variant of the basic P systems, called P Systems with worm objects. The best result so far in this regard was that P Systems with worm objects having 6 or more membranes were equivalent to Turing Machines, i.e. universal. But proving universality with fewer number of membranes is of special theoretical interest because number of membranes is a measure of descriptional complexity. In fact, determining the minimum number of membranes needed for getting universal model is an open research problem.
In this project, I was able to prove an improvement to this result, as in, only 4 membranes suffice for getting universality.
Systems with 2 membranes are already known to be strictly sub-linear, so to close this open problem, one now needs to define the computing power of systems with 3 membranes.

Master's Thesis
Supervisor : Dr Krishnas S
Report | Slides

The affair with P systems continued even after the two R&D Projects. In my MTech Project, I started out with studying a new variant of P systems called the SN P systems. They borrow ideas from spiking neurons as in Petri Nets. Under the assumption of synchronization, they become universal, but synchronization plays an important role in proving this. My objective was to define the computing power without assuming synchronization, ans hence find out if there is a loss of power due to loss of synnchronization. And if there is such a loss, then which system features can make up for this loss? Cavaliere et.al. proposed the notion of reliability of asynchronous SN P systems as a measure of there ability to correctly simulate Turing Machines (i.e to become unoversal) against growing asynchronism (controlled by a probability distribution) and suggested ways to improve reliability. So now there were two ways to proceed -- Although in conclusion, I got only partial success in both cases, I gained significant insights regarding the computing power of SN P systems and the role of synchroonization.

Seminar
Supervisor : Dr A A Diwan
Report | Slides

The even cycle problem for directed graphs is stated as follows --
What is the necessary and sufficient condition for a given a directed graph G = (V,E) to contain a cycle of even length. Some cousins of this problem are the odd-cycle problem for directed graph and the even cycle problem for undirected graphs. Although both of these problems are polynomial-time decidable, there aren't any known efficient algorithms for this particular case. So what is so special about the "directed" and "even cycle" case? Thomassen et.al. proved necessary and sufficient condition for even di-cycle case. I studied this proof as well as the connection to other known hard problems like sign-nonsingular matrices and how they become easy because of this proof.

Academics

Semester Courses Taken SPI CPI
Sem1
Algorithms and Complexity
Implementation Techniques for database systems
Software Lab
Formal Specification and Verification of Software
Seminar
8.15 8.15
Sem2
Embedded Systems
Natrual Computing
Foundations of Parallel Computation
6.25 7.24
Sem3
R&D Project-I
Linear Algebra
8.0 7.39
Sem4
R&D Project-II
Combinatorics
MTech Project Stage I
7.5 7.77
Sem5 MTech Project Stage II 8.0 7.82
Sem6 MTech Project Stage III 9.0 8.11

The Sys-Admin Stuff (a.k.a. Sysadgiri)

During the three years of MTech, I was assigned RA to the Software Lab, CSE.So I worked as the system administrator for CSE department along with 5 others. On the campus, everyone used to call "us" by the name "sys-ad" (an acronym for the acronym "sys-admin"!Voila!!). Now as we were sysads, what we do had to be called "sysadgiri" (as per the Mumbaiyya Hindi grammar). Simillarly, what a TA (Teaching Assistant, luckier than RA) does is called "TAGiri" Ok. That was some lingo.
All we sysads used to live
here. We were mainly involved in following tasks --

Some tips and tricks:
Finally, sysadgiri @cse.iitb was awesome, I enjoyed it a lot.

Associations