CLXXX. Vegetable Proteins. I. The Proteins of Dolichos Lab Lab

The field bean (Dolichos lab lab ; Tamil name, Mochai ; Kanarese, Avarai) is a legume which is widely cultivated in South India often as a mixed crop with cereals. The kernel of the seed enters into the diet of may South Indian households, and in the Mysore State the seed are used as a delicacy when they are green for over four months in the year. The haulm, husk and pods are commonly used a fodder. As the kernel which is widely used as an article of food and considered to be very nutritious, contains about 24% of protein hitherto uninvestigated and as the quality of protein plays an important role in nutrition, the present work was undertaken.

Spray characterization of straight vegetable oils at high injection pressures

We present results of high pressure spray characterization of Straight Vegetable Oils (SVOs) which are potential diesel fuel substitutes. SVO sprays are visualized at high injection pressures (up to 1600 bar) to study their atomization characteristics. Spray structure studies are reported for the first time for Jatropha and Pongamia vegetable oils, under atmospheric conditions. Jatropha and Pongamia SVO sprays are found to be poorly atomized and intact liquid cores are observed even at an injection pressure of 1600 bar. Non-Newtonian behavior of Jatropha and Pongamia oil is shown to be the reason for observed spray structure. (C) 2012 Elsevier Ltd. All rights reserved.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.