Proximate composition of 17 species of Indian fish

Miscellaneous fish from the catches of shrimp trawlers constitute a major portion of the marine fish catch in India, its quantity in annual landing being of the order of 50,000 tons. At present it is often not brought to the shore since it fetches only very low price. It consists of several species and is a cheap source of animal protein. Attempts are made in India in various centres (Anon. 1972-73) to utilise them effectively by formulating various speciality products acceptable to consumers

Revisiting Path Contraction and Cycle Contraction

The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge contractions in $G$. We revisit these NP-complete problems and prove the following results. Path Contraction admits an algorithm running in $\mathcal{O}^*(2^{k})$ time. This improves over the current algorithm known for the problem [Algorithmica 2014]. Cycle Contraction admits an algorithm running in $\mathcal{O}^*((2 + \epsilon_{\ell})^k)$ time where $0 < \epsilon_{\ell} \leq 0.5509$ is inversely proportional to $\ell = n - k$. Central to these results is an algorithm for a general variant of Path Contraction, namely, Path Contraction With Constrained Ends. We also give an $\mathcal{O}^*(2.5191^n)$-time algorithm to solve the optimization version of Cycle Contraction. Next, we turn our attention to restricted graph classes and show the following results. Path Contraction on planar graphs admits a polynomial-time algorithm. Path Contraction on chordal graphs does not admit an algorithm running in time $\mathcal{O}(n^{2-\epsilon} \cdot 2^{o(tw)})$ for any $\epsilon > 0$, unless the Orthogonal Vectors Conjecture fails. Here, $tw$ is the treewidth of the input graph. The second result complements the $\mathcal{O}(nm)$-time, i.e., $\mathcal{O}(n^2 \cdot tw)$-time, algorithm known for the problem [Discret. Appl. Math. 2014]

NICNET - a Hierarchic distributed computer-communication network for decision support in the Indian Government

A decision support information system for the Indian Government is being evolved, based on the design of a predominantly query-based computer network with hierarchric distributed databases and random access communication. The four level hierarchy spans 439 districts at the lowest level, the Central Government headquarters in New Delhi, the set of 32 State Capitals and Union Territories, and the set of four Regional Centres. With interference tolerance and random access as two guiding principles behind the choice, Spread Spectrum transmission and Code Division Multiple Access system of satellite communication was adopted. Each node of the network is a 32-bit computer which is capable of local bulk storage of up to three units of 300 megabytes each for purposes of queryaccessible distributed databases. The design and implementation of such a distributed database has endowed the network with the capability to distribute the data related to such databases over various nodes in the network so as to be able to accept a query from any of the nodes

Insilico modeling of chitosan as a drug delivery system

Computational modeling of polymeric nanoparticles as drug carriers have been extensively studied due to their varied functionalities, tunable structures and the capability of controlled drug release. Nano particulate polymeric drug delivery systems enable a cell specific targeting with negligible side effects and drug release based on change in physiological conditions. Eight common polymers are modeled and the various properties have been predicted. ADMET, QSAR, thermodynamic and electronic properties have been predicted and compared using SAR as well as quantum mechanical density functional methods. Comparison of the predicted properties suggests that chitosan, which is a natural polymer and has some advantages over others is a promising drug carrier candidate for tumor