Present status of perch fishery resources in India and its prospects

The perch resources and fisheries In India have been dealt with. As seen from the statewise perch production during 1969-19Q1, on an average 27,184 tonnes of parches were landed in India with fluctuation from 12,865 In 1969 to 49,312 in 1978. The gearwise and statewise perch production from 1982-83 to 1984-85 indicates that the mechanised units contributed 72.4 % and nonmechanised 27.6 %. Among mechanised units, the trawlers have landed the major portion of the catch (68 4 % ) . The State wise species composition of perch landings indicate that the threadtin breams formed more than 50% of the catch- During 1982-83 and 1S83-84. the perch production of Tamil Nadu was higher than all other states whereas during 1984 85, Kerala was the first in perch production followed by Andhrapradesh and Tamil Nadu- The different groups of perches landed by trawl and gill net units at different important landing centres on the east and west coast of Indian show that in all the centres the catch rates of trawlers were higher. The higher catch rate in trawl net operations In Sasoons Dock and New ferry Wharf was due to voyage fishing for more than a da

Geometry of the 3-Qubit State, Entanglement and Division Algebras

We present a generalization to 3-qubits of the standard Bloch sphere representation for a single qubit and of the 7-dimensional sphere representation for 2 qubits presented in Mosseri {\it et al.}\cite{Mosseri2001}. The Hilbert space of the 3-qubit system is the 15-dimensional sphere $S^{15}$, which allows for a natural (last) Hopf fibration with $S^8$ as base and $S^7$ as fiber. A striking feature is, as in the case of 1 and 2 qubits, that the map is entanglement sensitive, and the two distinct ways of un-entangling 3 qubits are naturally related to the Hopf map. We define a quantity that measures the degree of entanglement of the 3-qubit state. Conjectures on the possibility to generalize the construction for higher qubit states are also discussed.Comment: 12 pages, 2 figures, final versio

Marine fish calendar. 6. Tuticorin

Tuticorin is one of the well known, age old, fishery ports of India especially by virtue of the production of valuable, good quality, natural pearls and chanks in addition to marine fish production. Early in the 19I1-'15 periods the marine fish production here was to the tune of 663,592 pounds (296.3 tonnes). The fishermen strength was 520 who operated conventional 'valavalai', 'kolavalai', 'madivalai', offshore lining, inshore lining, trolling and other minor nets with the traditional fishing crafts like Tuticorin type of plank built boats called 'Vallam' and 'catamarans'. Over the two decades, mechanized fishing has changed not only the fishing pattern but also the constituent catches. The progress of fishing industry can still be augmented by motorising the plank built boats and 'catamarans'. Present assessment of fishery resources reveals that in a year 19,850 t of fish are landed by trawlers and 9,275 t by traditional fishing units

Quantum complexities of ordered searching, sorting, and element distinctness

We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all distinct. Letting N be the number of elements in the input list, we prove a lower bound of \frac{1}{\pi}(\ln(N)-1) accesses to the list elements for ordered searching, a lower bound of \Omega(N\log{N}) binary comparisons for sorting, and a lower bound of \Omega(\sqrt{N}\log{N}) binary comparisons for element distinctness. The previously best known lower bounds are {1/12}\log_2(N) - O(1) due to Ambainis, \Omega(N), and \Omega(\sqrt{N}), respectively. Our proofs are based on a weighted all-pairs inner product argument. In addition to our lower bound results, we give a quantum algorithm for ordered searching using roughly 0.631 \log_2(N) oracle accesses. Our algorithm uses a quantum routine for traversing through a binary search tree faster than classically, and it is of a nature very different from a faster algorithm due to Farhi, Goldstone, Gutmann, and Sipser.Comment: This new version contains new results. To appear at ICALP '01. Some of the results have previously been presented at QIP '01. This paper subsumes the papers quant-ph/0009091 and quant-ph/000903

Evolving rules for document classification

We describe a novel method for using Genetic Programming to create compact classification rules based on combinations of N-Grams (character strings). Genetic programs acquire fitness by producing rules that are effective classifiers in terms of precision and recall when evaluated against a set of training documents. We describe a set of functions and terminals and provide results from a classification task using the Reuters 21578 dataset. We also suggest that because the induced rules are meaningful to a human analyst they may have a number of other uses beyond classification and provide a basis for text mining applications

Autonomous three-dimensional formation flight for a swarm of unmanned aerial vehicles

This paper investigates the development of a new guidance algorithm for a formation of unmanned aerial vehicles. Using the new approach of bifurcating potential fields, it is shown that a formation of unmanned aerial vehicles can be successfully controlled such that verifiable autonomous patterns are achieved, with a simple parameter switch allowing for transitions between patterns. The key contribution that this paper presents is in the development of a new bounded bifurcating potential field that avoids saturating the vehicle actuators, which is essential for real or safety-critical applications. To demonstrate this, a guidance and control method is developed, based on a six-degreeof-freedom linearized aircraft model, showing that, in simulation, three-dimensional formation flight for a swarm of unmanned aerial vehicles can be achieved

Quantum state transfer and entanglement distribution among distant nodes in a quantum network

We propose a scheme to utilize photons for ideal quantum transmission between atoms located at spatially-separated nodes of a quantum network. The transmission protocol employs special laser pulses which excite an atom inside an optical cavity at the sending node so that its state is mapped into a time-symmetric photon wavepacket that will enter a cavity at the receiving node and be absorbed by an atom there with unit probability. Implementation of our scheme would enable reliable transfer or sharing of entanglement among spatially distant atoms.Comment: 4 pages, 3 postscript figure

Entanglement and the SU(2) phase states in atomic systems

We show that a system of 2n identical two-level atoms interacting with n cavity photons manifests entanglement and that the set of entangled states coincides with the so-called SU(2) phase states. In particular, violation of classical realism in terms of the GHZ and GHSH conditions is proved. We discuss a new property of entanglement expressed in terms of local measurements. We also show that generation of entangled states in the atom-photon systems under consideration strongly depends on the choice of initial conditions and that the parasitic influence of cavity detuning can be compensated through the use of Kerr medium.Comment: 10 pages, 1 figur

Massive creation of entangled exciton states in semiconductor quantum dots

An intense laser pulse propagating in a medium of inhomogeneously broadened quantum dots massively creates entangled exciton states. After passage of the pulse all single-exciton states remain unpopulated (self-induced transparency) whereas biexciton coherence (exciton entanglement) is generated through two-photon transitions. We propose several experimental techniques for the observation of such unexpected behavior

Quantum Cryptography Based on the Time--Energy Uncertainty Relation

A new cryptosystem based on the fundamental time--energy uncertainty relation is proposed. Such a cryptosystem can be implemented with both correlated photon pairs and single photon states.Comment: 5 pages, LaTex, no figure