Parts Of Speech Tagger and Chunker for Malayalam: Statistical Approach

Parts of Speech Tagger (POS) is the task of assigning to each word of a text the proper POS tag in its context of appearance in sentences. The Chunking is the process of identifying and assigning different types of phrases in sentences. In this paper, a statistical approach with the Hidden Markov Model following the Viterbi algorithm is described. The corpus both tagged and untagged used for training and testing the system is in the Unicode UTF-8 format

Parts Of Speech Tagger and Chunker for Malayalam: Statistical Approach

Parts of Speech Tagger (POS) is the task of assigning to each word of a text the proper POS tag in its context of appearance in sentences. The Chunking is the process of identifying and assigning different types of phrases in sentences. In this paper, a statistical approach with the Hidden Markov Model following the Viterbi algorithm is described. The corpus both tagged and untagged used for training and testing the system is in the Unicode UTF-8 format

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

Non-Gravitating Scalar Field in the FRW Background

We study interacting scalar field theory non-minimally coupled to gravity in the FRW background. We show that for a specific choice of interaction terms, the energy-momentum tensor of the scalar field vanishes, and as a result the scalar field does not gravitate. The naive space dependent solution to equations of motion gives rise to singular field profile. We carefully analyze the energy-momentum tensor for such a solution and show that the singularity of the solution gives a subtle contribution to the energy-momentum tensor. The space dependent solution therefore is not non-gravitating. Our conclusion is applicable to other space-time dependent non-gravitating solutions as well. We study hybrid inflation scenario in this model when purely time dependent non-gravitating field is coupled to another scalar field.Comment: 7 Pages, 2 figures, RevTeX4, v2:added a section on regularized energy-momentum tensor, references and conclusions modifie

Sustainable Livelihood and Sustainable Development: the Experience of Collective Farming by Kudumbashree in Keralam, India

One of the most alarming impacts of development experienced by Third world economies in the contemporary era of globalization is the fast depletion of agricultural land. This is especially so in countries in the Third world where the rapidly increasing population and unplanned growth of economies have decreased the size of croplands to highly threatened levels. There has also been a significant shift in the meaning of land in several of these locations to being an object that can be sold and bought like any other commodity. One dangerous outcome of this was that most of the land thus sold was fertile paddy fields, which play a central role in ground water conservation as well as in sustaining its rich biodiversity. The changing equations over land and its utility have considerably contributed to the changing ecological balances within the region. The need to reinvent sustainable forms of development specific to the conditions of the state was felt acutely amidst such transformations. There was a sudden demand to reinvent the productive capacity of land, especially paddy fields, in the state by both involving more people in this area as well as by resuming farming in land that otherwise remain fallow waiting for real estate agents. Kudumbasree was an organization that commenced its operations in the State in 1998 with the intention of engaging in women empowerment and poverty alleviation programmes. Its successful career has motivated its workers, basically housewives and women from different walks, to focus on non-traditional sectors in the state. As part of this, Kudumbashree started to intervene in the agriculture sector in 2002 with the objective of ensuring sustainable livelihood to poor families by bringing back fallow land to cultivation and women to agriculture. This was the context against which the idea of collective farming was introduced by the organisation. This not only ensured a new, albeit unconventional, and sustainable source of livelihood for women in the community but also has been considerably contributing to food and nutritional security of the state. This has literally revolutionized the development concepts in the society where women empowerment and livelihood programmes were combined to reinvent the idea of sustainability

Membership Questions for Timed and Hybrid Automata

Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for these automata are well studied and have been implemented in verification tools. In this paper, for the purpose of effective error reporting and testing, we consider the membership problems for such automata. We consider different types of membership problems depending on whether the path (i.e. edge-sequence), or the trace (i.e. event-sequence), or the timed trace (i.e. timestamped event-sequence), is specified. We give comprehensive results regarding the complexity of these membership questions for different types of automata, such as timed automata and linear hybrid automata, with and without ε-transitions. In particular, we give an efficient O (n.m2) algorithm for generating timestamps corresponding a path of length n in a timed automaton with m clocks. This algorithm is implemented in the verifier COSPAN to improve its diagnostic feedback during timing verification. Second, we show that for automata without ε-transitions, the membership question is NP-complete for different types of automata whether or not the timestamps are specified along with the trace. Third, we show that for automata with ε-transitions, the membership question is as hard as the reachability question even for timed traces: it is PSPACE-complete for timed automata, and undecidable for slight generalizations