Overcoming India’s Food Security Challenges: The Role of Intellectual Property Management and Technology Transfer Capacity Building

The growth of the Indian economy after Independence has had little impact on the food security of the country. The paper analyses the development of advanced crop varieties through the use of agricultural technologies (hereinafter agbiotech ) within the technology transfer system, a framework which comprises of the interactions of intellectual property rights law and agricultural research and development in India. Through this, the author argues that agricultural innovation in India is failing due to the absence of connections within the technology transfer system and advocates for the creation of a national program aimed at advancing IP and tech-transfer capacity in agbiotech

How to Securely Compute the Modulo-Two Sum of Binary Sources

In secure multiparty computation, mutually distrusting users in a network want to collaborate to compute functions of data which is distributed among the users. The users should not learn any additional information about the data of others than what they may infer from their own data and the functions they are computing. Previous works have mostly considered the worst case context (i.e., without assuming any distribution for the data); Lee and Abbe (2014) is a notable exception. Here, we study the average case (i.e., we work with a distribution on the data) where correctness and privacy is only desired asymptotically. For concreteness and simplicity, we consider a secure version of the function computation problem of K\"orner and Marton (1979) where two users observe a doubly symmetric binary source with parameter p and the third user wants to compute the XOR. We show that the amount of communication and randomness resources required depends on the level of correctness desired. When zero-error and perfect privacy are required, the results of Data et al. (2014) show that it can be achieved if and only if a total rate of 1 bit is communicated between every pair of users and private randomness at the rate of 1 is used up. In contrast, we show here that, if we only want the probability of error to vanish asymptotically in block length, it can be achieved by a lower rate (binary entropy of p) for all the links and for private randomness; this also guarantees perfect privacy. We also show that no smaller rates are possible even if privacy is only required asymptotically.Comment: 6 pages, 1 figure, extended version of submission to IEEE Information Theory Workshop, 201

Techno-Economic Analysis of Hybrid Layered Manufacturing

Subtractive manufacturing (CNC machining) has high quality of geometric and material properties but is slow, costly and infeasible in some cases; additive manufacturing (RP) is just the opposite. Total automation and hence speed is achieved in RP by compromising on quality. Hybrid Layered Manufacturing (HLM) developed at IIT Bombay combines the best features of both these approaches. It uses arc welding for building near-net shapes which are finish machined to final dimensions. High speed of HLM surpasses all other processes for tool making by eliminating NC programming and rough machining. The techno-economic viability of HLM process has been proved through a real life case study. Time and cost of tool making using HLM promises to be substantially lower than that of CNC machining and other RP methods. Interestingly, the material cost in HLM was also found to be lower. HLM is a cheaper retrofitment to any 3 or 5 axis CNC milling machine or machining center.Mechanical Engineerin