What we do?

  • We help people act with insight.
  • We help companies grow from the inside.
  • We help employees turn into thinkers.

We ignite thought

If nature has made any one thing less susceptible than all others of exclusive property, it is the action of the thinking power called an idea, which an individual may exclusively possess as long as he keeps it to himself; but the moment it is divulged, it forces itself into the possession of every one, and the receiver cannot dispossess himself of it. Its peculiar character, too, is that no one possesses the less, because every other possesses the whole of it. He who receives an idea from me, receives instruction himself without lessening mine; as he who lights his taper at mine, receives light without darkening me.

--Thomas Jefferson
on Patents and Freedom of Ideas

Services > Super-internship

Internship programs in India are generally ineffective. Acadinnet can help an organization turn such programs into an opportunity by screening and identifying its star interns (free-thinking, curiosity-driven individuals with potential for innovation) and mentoring them so that they become potential future assets for the organization. Acadinnet's super-internship program is a highly customized program for each intern and is one of Acadinnet's premiere programs. We call it our super-internship program because it is very close to our hearts-the nurturing of free-thinking, curiosity-driven individuals with potential for innovation. The organization hosting a super-intern is likely to benefit most if it views the program as a strategic investment in growing an internal team of S&T leaders for its future growth. Senior management of the host organization is expected to be closely involved with the super-intern during the internship period. This program is not suitable for organizations seeking short-term returns on investment.

Preferred clients for the super-internship program

This program is particularly suited for start-ups wishing to reduce risks of failure by getting potential innovators on board early in the game.

Insights in Science Lecture Abstracts
From hunter-gatherer to knowledge-worker
In very broad terms, the world's economic development can be divided into four stages: hunter-gatherer (till about 12,000 years ago; more than 99% of our time on earth), agricultural (beginning about 12,000 years ago till about 1500 AD), industrial (from about 1500 AD to later half of 20th century), and postindustrial (later half of 20th century and continuing)1 , although a substantial comingling of two or more stages can be seen even today in many countries, including the world's most advanced nations. The hunter-gatherer stage can support only about one inhabitant per square mile and demands a nomadic life involving extraordinary land-intensive activity. In the post-industrial information (knowledge-gatherer) age, we are primarily concerned about creating knowledge and using it to produce marketable products and services as quickly and economically as possible. The focus is therefore on knowledge workers. The knowledge-gatherer stage can support several orders of magnitude more inhabitants per square mile than was possible in the hunter-gatherer stage.
Axiomatic mathematics
Euclid's geometry is the first specific evidence of an axiomatic treatment of mathematics. Some 2000 years after Euclid, several mathematicians reexamined its axioms and discovered non-Euclidean geometry. One such geometry forms the space-time geometry of Einstein's general theory of relativity. The discovery of non-Euclidean geometry was a revolution in mathematics, which led to what now forms the heart of mathematics-formal axiomatic systems. Formal systems form the basis of reasoning in mathematics and of all the computations we do on digital computers.
How reliably can we compute?
Several simple computations, as implemented on digital computers, will be examined. Their surprising common feature is that while there is no flaw in the coded logic, the computations fail. The reason for their failure and their remedies will be discussed. The lesson: programming is not about coding; it is about algorithms and their error propagation characteristics. We shall also take a look at some unusual ways humans prove mathematical propositions.
On symmetry
The notion of symmetry plays a central role in theoretical physics. The central theme of this lecture is the Emmy Nöther theorem, which states that for every observable symmetry in Nature there is a corresponding entity that is conserved. And for every conservation law there is a corresponding symmetry. For example, the law of conservation of angular momentum is a consequence of the isotropy of space.
Quantum cryptography and quantum teleportation
The world of quantum mechanics is truly magical. In this lecture we will look at the basic mathematical framework around which QM is built, and then look at the amazingly simple solutions to two problems: (i) the safe exchange of keys for encrypted messages, and (ii) the teleportation of matter. In both these solutions, Charles Bennett, a distinguished IBM researcher, played a pioneering role.
Chief Mentor's Corner
  1. Bera, R. K., Method and system for processing of allocation and deallocation requests in a computing environment, Patent No. US 8,195,802 (issued June 5, 2012).
  2. Bera, R. K., Method, apparatus and computer program product for network design and analysis, Patent No. US 8,176,108 (issued May 8, 2012).
  3. Bera, R. K., Listing and modifying groups of blocks in the editing of a document, Patent No. US 8,122,349 (issued February 21, 2012).
  4. Bera, R. K., Run-Time parallelization of loops in computer programs using bit vectors, Patent No. US 8,028,281 (issued September 27, 2011).
  5. Bera, R. K., Compiler optimization of source code by determination and utilization of the equivalence of algebraic expressions in the source code, Patent No. US 8,028,280 (issued September 27, 2011).
  6. Bera, R. K., Concurrent editing of a file by multiple authors, Patent No. US 7,954,043 (issued May 31, 2011).
  7. Bera, R. K., Restructuring computer programs, Patent No. US 7,934,205 (issued Apr 26, 2011).
  8. Bera, R. K., Method, system and program product for data searching, JP3832821 (B2), (issued October 11, 2006).