How to get started with Giraph

Posted on April 14, 2016
get-started-with-giraph

Giraph is powerful Big data processing distributed computing platform. Facebook extensively uses Giraph for their graph processing and Facebook engineers have heavily contributed to this open source project. It sits on top of Hadoop. Giraph works using message passing and it's installation is very easy. It's the exact same procedure that they explain in their site. However once we you are done with the setup and want to do your own customization, then it's a real pain as there is no good documentation available. You have to rely on the mailing list and go through many trials and errors. In this article I will explain with a detailed example how to do your own customization and safely ride the Giraph.
Read More

Theory of Computation - 8 (Primes are not Regular)

Posted on Feb. 27, 2016
theory-of-computation-8-primes-not-regular

In this Lecture I will prove that Language/Set of Strings where length of the string is a prime number is not Regular using the Pumping Lemma. We will then try to use the Pumping Lemma to prove that Language/Set of Strings where length of the string is a composite number is not Regular and we will see the limitation of the Pumping Lemma in doing so.
Read More

The impatient new Blogger in search of Organic Traffic

Posted on Feb. 17, 2016
new-blogger-organic-traffic-search

I have recently started a blog. Since the day I have started the blog, I am worried about traffic and wondering why the heck people are not coming to check out my awesome content. Every now and then like a soldier in alert, I peek into the Google Analytics live feed to check if some active user is there in my blog or not. I get impatient when I don't see any organic traffic flowing into my blog. I repeatedly search the web for best practices for SEO and how to get some back-links. After doing research and following some awesome articles, I have come to some conclusions on how a new blogger must NOT try to generate traffic for her blog and what are the good ways that will generate steady growing traffic to your blog.
Read More

Theory of Computation - 7 (Palindromes are not Regular)

Posted on Feb. 16, 2016
theory-of-computation-7-palindromes-not-regular

In this Lecture I will prove that Language/Set of Palindromes is not Regular using Pumping Lemma. Therefore, you cannot construct a DFA which accepts only Palindromes. I will first explain the proof informally taking concrete example and then we will see how to write formal proofs.
Read More

Theory of Computation - 5 (DFA closure properties)

Posted on Feb. 16, 2016
theory-of-computation-5-DFA-closure-properties

In the previous lecture I gave you a hint about closure properties of DFA or Deterministic Finite state machine. In this lecture, I will discuss the closure properties of DFA and towards the end I will leave you with the teaser of the famous Pumping Lemma. Let's get started.
Read More

Theory of Computation part -2 (FSM)

Posted on Feb. 14, 2016
theory-of-computation-2

This is the second lecture of the course Theory of Computation. In this lecture I will discuss some more examples of Finite state machines so that you become comfortable with it. Then we will dive into Non deterministic Finite State Machine (NFA) and we will see if it gives us any extra power. Let's get started.
Read More

Theory of Computation part -1 (FSM)

Posted on Feb. 14, 2016
theory-of-computation-1

‚ÄčThis is the most abstract course in computer science. Because of this course itself, we call computer science a science. This course is not going to teach you how to write a program for say. This course is about what we can compute and what we cannot. In this first lesson I will discuss how to build a Finite State Machine and concepts associated with it.
Read More

Theory of Computation - 4 (Reversing a DFA)

Posted on Feb. 14, 2016
theory-of-computation-4

In the previous lecture we saw how to convert a NFA to DFA. In this lecture we will reverse a DFA and will see how non determinism pops up. We will also discuss the "e" moves with example. Finally we will convert the reversed NFA to a DFA.
Read More

Theory of Computation - 3 (NFA)

Posted on Feb. 14, 2016
theory-of-computation-3

In this lecture we will dive into non deterministic machines and compare it with Deterministic Finite Automata. We will see whether non determinism gives us any extra power or it just gives us convenience. We will also discuss very intuitive approach to convert a NFA to DFA.
Read More

How I got AdSense activated for my 7 days old blog

Posted on Feb. 14, 2016
adsense-activated-for-7-days-old-blog

I have seen many articles floating around regarding Google AdSense activation. Different people are putting different opinions. I have started my blog on 29th Jan 2016 and applied for AdSense on 6th Feb and got it activated on 8th Feb. In this article I will explain how to get AdSense activated really quick and will expose the myth surrounding it.
Read More

profile image

Kaushik Baruah

Research Engineer @XRCI


ABOUT

My name is Kaushik Baruah and I am the chief blogger on this Blog and here I like to share my experience as software engineer and research engineer with my online readers. I will try to focus on career planning, latest emerging technologies and tutorials on various computer science subjects. You can follow me on Twitter, Facebook and Google+

GET FREE UPDATES

POPULAR POSTS