Archive for the ‘Research’ Category

Social Analytics for Online Communities

January 10, 2014

This is the first post of 2014. Happy new year to one and all………..

A recent discussion on knome (TCS’ internal social platform) related to managing online communities, controlling spam, making the best out of an enterprise social platform of the scale of ~200K members made me study the application of Social Analytics to achieve these objectives.

As I research on the internet, came across this paper –… titled “Scalable Social Analytics for Online Communities” by Marcel Karnstedt, Digital Enterprise Research Institute (DERI), National University of Ireland, Galway Email:

This post is to summarize the contents of the paper and some of my thoughts around it.

Success of a social platform depends on strength of analytics understanding and driving the dynamics of the network built by the platform.

To achieve these goals we need to have a set of tools that can perform multidimensional analysis of the structure, behavioural, content/semantic and cross community analysis.

Structural Analysis: Analyse all the communities, memberships, sub-communities based on strong relations between the members, influencers/leaders and followers.

Behavioural Analysis: Analyse the interactions to identify the helpful experts (or sub-groups) who provide information and newbies who are seeking information that are benefited by the interactions. Both a micro-level or individual level and a macro-level analysis is needed.

Content / Semantic analysis: Use text mining to detect, track and quantitatively measure current interest and shift in interest in topic and sentiment within the community.

Cross community dynamics: Understand how the community structure and sub structures are influencing each other to detect redundancies and complementary to merge and link them together.

There is a need to sufficiently combine all the analysis from all four dimensions in a scalable real-time model to achieve best understanding, control and utility of socially generated data. (rather knowledge!)

New solutions for new problems! Have a nice weekend………..

Transfer orbits, low-energy transfers and 20 years of career!

October 11, 2013

This day 20 years back (11th October 1993), a young graduate with a bag full of science books and few pairs of cloths landed here in Bangalore to pursue a career. Born in Andhra Pradesh, studied in Tamilnadu it is the third south Indian state Karnataka, I came to join Indian Space Research Organization as ‘Scientific Assistant – B’.

It was a long selection process to get to the job. I had to qualify a written test, an interview with a big panel of ISRO and IISc scientists, a police verification to join central government of India. With the planned Mangalyaan launch on 28th October, would like to give some science behind travelling beyond Earth’s orbit.

If we want to go to moon or mars we can’t aim a rocket towards the target and fire it. As the distance between earth and moon is about 4 million kilometers and to that of mars it is 400 million km. So, we need slightly intelligent way of going there. One way of going there is using Hohmann Transfer Orbit In simple terms, the spacecraft is placed in a highly elliptical orbit around earth and using a delta-v at right point transferred into another elliptical orbit at a suitable time to the target orbit.

There is another low-energy transfer using Lagrange points which will probably take longer transit time. The Interplanetary Transport Network (ITN) formed for deep space missions that travel purely using solar energy or very little fuel to fire the thrusters.

Mangalyaan is taking the first method of Hohmann Transfer Orbit between Earth and Mars to start it journey in this opportunity window to reach mars by November 2014. I wish all the best to my first employer in this mission which is going to prove the technology and ISRO’s ability to apply the science to take the satellite into orbit mars. There are challenges of handling the launch, orbit maneuvers, deep space communication network for both payload data and machine control (it is 20 light minutes distance between earth and mars at the maximum so the two way communication takes 40 minutes making it complex to manage the communications!) It is only unfortunate to see critics criticizing the cost of this mission which is around 450 crores Indian Rupees where as ONE Fodder scam is 950 Crores worth loss to nation; not to mention any other scams of recent past in India.

How is it related to my career? Even I ended up using the high energy transfer orbits and low energy transfers during this journey around different companies and quantum leaps to different roles on working on orbits to orbitals, providing management solutions to energy grids and computing grids, optimizing satellite operations to smart metering operations handling data movements in and out of commercial ERP systems and geospatial databases, deriving forecasts of orbits of satellites to insights from big data using analytics in these 20 years.

Apart from the science, math & technology, these 20 years took me around this little globe physically from India to Singapore to various European Countries (Belgium, Germany, France, Netherlands, Luxemburg) to UK then to USA, Japan, Korea; provided an opportunity to work with large enterprises from Australia, China, South Africa etc., to make me meet exceptional personalities from varied cultures, walks of life to interact and learn about the most colorful part of God’s creation.

A majority of the orbiting been with TCS, (which was my second employer between 1996 and 2006 for 10 years) followed by Oracle Corporation and IBM India Pvt. Ltd. to come back to TCS in 2011.

I take this opportunity to thank one and all who helped me through this journey, who have challenged me and those who have been neutral towards me; each of those gestures gave me immense experience and made the journey very colorful and interesting.

With entry and re-entry tested, I hope to go along on the orbit for few more years continuing my learning until the mission retires….

Satellite Scheduling & Genetic Algorithms

January 23, 2008

During the beginning of my career, I have spent approximately two years on a complex scheduling problem.

This link is a paper related to the original work:

Later, the same problem was analyzed and improved to use Genetic Algorithms by IIT professors. This link for the Genetic paper on the same subject:

After studying both the papers, I feel the original work has indeed used a “Genetic Algorithm”

Simple looking Complex problem

September 18, 2007

Approximately a decade back, after spending nearly two years on an optimization problem, I have ended up with the following problem.

Assume that there are ‘m’ groups with each group will have ‘nelem(i)’ elements where i = 1 to m and nelem(i) > 0 (zero)

The problem is to find out all the possible combinations picking exactly one element from each group. [each element in a group is distinct and imagine it is numbered 1, 2, … nelem(i)]

It looks very simple in the first look but takes time to solve this problem. If you are a programmer try to solve it for yourself. Just try to write an algorithm for this and you will realize the complexity of this problem.

So, there are certain things look very simple when you first see them. Only when coming to implement the solution the real complexity will appear.

Example output 1:
Number of Groups : 4
Number of Elements in Group 1 : 3
Number of Elements in Group 2 : 2
Number of Elements in Group 3 : 1
Number of Elements in Group 4 : 2
G1:1 G2:1 G3:1 G4:1
G1:1 G2:1 G3:1 G4:2
G1:1 G2:2 G3:1 G4:1
G1:1 G2:2 G3:1 G4:2
G1:2 G2:1 G3:1 G4:1
G1:2 G2:1 G3:1 G4:2
G1:2 G2:2 G3:1 G4:1
G1:2 G2:2 G3:1 G4:2
G1:3 G2:1 G3:1 G4:1
G1:3 G2:1 G3:1 G4:2
G1:3 G2:2 G3:1 G4:1
G1:3 G2:2 G3:1 G4:2

Example Output 2:
Number of Groups : 3
Number of Elements in Group 1 : 5
Number of Elements in Group 2 : 3
Number of Elements in Group 3 : 2
G1:1 G2:1 G3:1
G1:1 G2:1 G3:2
G1:1 G2:2 G3:1
G1:1 G2:2 G3:2
G1:1 G2:3 G3:1
G1:1 G2:3 G3:2
G1:2 G2:1 G3:1
G1:2 G2:1 G3:2
G1:2 G2:2 G3:1
G1:2 G2:2 G3:2
G1:2 G2:3 G3:1
G1:2 G2:3 G3:2
G1:3 G2:1 G3:1
G1:3 G2:1 G3:2
G1:3 G2:2 G3:1
G1:3 G2:2 G3:2
G1:3 G2:3 G3:1
G1:3 G2:3 G3:2
G1:4 G2:1 G3:1
G1:4 G2:1 G3:2
G1:4 G2:2 G3:1
G1:4 G2:2 G3:2
G1:4 G2:3 G3:1
G1:4 G2:3 G3:2
G1:5 G2:1 G3:1
G1:5 G2:1 G3:2
G1:5 G2:2 G3:1
G1:5 G2:2 G3:2
G1:5 G2:3 G3:1
G1:5 G2:3 G3:2