Deep-sea shrimp fishery off Kerala coast with emphasis on biology and population characteristics of Plesionika quasigrandis Chace, 1985

The present study is the first attempt to understand population characteristics of the deep-sea pandalid shrimp, P. quasigrandis and to assess the status of these resources off Kerala coast.Total mortality coefficient (Z) of P. quasigrandis estimated by various methods.Natural mortality coefficient (M) calculated was 0.65 and 1.02 by Pauly‟sempirical formula and Srinaths‟s formula respectively The deep-sea shrimp P. quasigrandis exploited from the present fishing ground and their monetary return has started showing a declining trend. By observing the current yield and economic return, there is no further scope for increasing the catch from the present fishing ground. The study indicated that majority of the deep-sea shrimp trawlers, especially targeted for pandalid shrimps still concentrated off Kollam area (Quilon Bank). Even though researchers had located several potential deep-sea fishing grounds based on exploratory surveys in Indian EEZ , fishermen are unaware of these fishing grounds located and hence sharing the information about new potential deep-sea fishing grounds could avert the possible stock decline due to the intensive targeted deep-sea shrimp fishery in the Quilon Bank. Hence, the present study recommended that part of the effort from existing fishing grounds may be shifted to newly located deep-sea fishing grounds which will help in a sustainableexploitation of deep-sea resources off Kerala coast.

Studies on Selected Myctophid Fishes in Arabian Sea with respect to their Status in Deep Sea Trawl Bycatch, Length-Weight Relationship, Reproductive Biology and Population Dynamics

Available information on abundance of myctophids and their utilisation indicate that there is excellent scope for development of myctophid fisheries in Indian Ocean. Most of the conventional fish stocks have reached a state of full exploitation or over-exploitation. Hence there is need to locate new and conventional fishery resources in order to fill in the supply-demand gap, in the face of increasing demand for fish. Information on length-weight relationship, age and growth, spawning season, fecundity and age at maturity and information on bycatch discards are required for sustainable utilization of myctophid resource in the Indian Ocean

A Computational Model for Observation in Quantum Mechanics

A computational model of observation in quantum mechanics is presented. The model provides a clean and simple computational paradigm which can be used to illustrate and possibly explain some of the unintuitive and unexpected behavior of some quantum mechanical systems. As examples, the model is used to simulate three seminal quantum mechanical experiments. The results obtained agree with the predictions of quantum mechanics (and physical measurements), yet the model is perfectly deterministic and maintains a notion of locality.

Computational Structure of Human Language

The central thesis of this report is that human language is NP-complete. That is, the process of comprehending and producing utterances is bounded above by the class NP, and below by NP-hardness. This constructive complexity thesis has two empirical consequences. The first is to predict that a linguistic theory outside NP is unnaturally powerful. The second is to predict that a linguistic theory easier than NP-hard is descriptively inadequate. To prove the lower bound, I show that the following three subproblems of language comprehension are all NP-hard: decide whether a given sound is possible sound of a given language; disambiguate a sequence of words; and compute the antecedents of pronouns. The proofs are based directly on the empirical facts of the language user's knowledge, under an appropriate idealization. Therefore, they are invariant across linguistic theories. (For this reason, no knowledge of linguistic theory is needed to understand the proofs, only knowledge of English.) To illustrate the usefulness of the upper bound, I show that two widely-accepted analyses of the language user's knowledge (of syntactic ellipsis and phonological dependencies) lead to complexity outside of NP (PSPACE-hard and Undecidable, respectively). Next, guided by the complexity proofs, I construct alternate linguisitic analyses that are strictly superior on descriptive grounds, as well as being less complex computationally (in NP). The report also presents a new framework for linguistic theorizing, that resolves important puzzles in generative linguistics, and guides the mathematical investigation of human language.