Development of Bioreactors for Nitrifying Water In Closed System Hatcheries Of Penaeid And Non-Penaeid Prawns

In the present study the development of bioreactors for nitrifying water in closed system hatcheries of penaeid and non-penaeid prawns. This work is an attempt in this direction to cater to the needs of aquaculture industry for treatment and remediation of ammonia and nitrate in penaeid and non-penaeid hatcheries, by developing nitrifying bacteria allochthonous to the particular environment under consideration, and immobilizing them on an appropriately designed support materials configured as reactors. Ammonia toxicity is the major limiting factors in penaeid and non-penaeid hatchery systems causing lethal and sublethal effects on larvae depending on the pH values. Pressing need of the aquaculture industry to have a user friendly and economically viable technology for the removal of ammonia, which can be easily integrated to the existing hatchery designs without any major changes or modifications. Only option available now is to have biological filters through which water can be circulated for the oxidation of ammonia to nitrate through nitrite by a group of chemolithotrophs known as nitrifying bacteria. Two types of bioreactors have been designed and developed. The first category named as in situ stringed bed suspended bioreactor(SBSBR) was designed for use in the larval rearing tanks to remove ammonia and nitrite during larval rearing on a continuous basis, and the other to be used for nitrifying freshly collected seawater and spent water named as ex situ packed bed bioreactior(PBBR). On employing the two reactors together , both penaeid and non-penaeid larval rearing systems can be made a closed recirculating system at least for a season. A survey of literature revealed that the in situ stringed bed suspended reactor developed here is unique in its design, fabrication and mode of application.

Energies of some non-regular graphs

The energy of a graph G is the sum of the absolute values of its eigenvalues. In this paper, we study the energies of some classes of non-regular graphs. Also the spectrum of some non-regular graphs and their complements are discussed.

A study on semigroup action on fuzzy subsets, inverse fuzzy automata and related topics

This thesis comprises five chapters including the introductory chapter. This includes a brief introduction and basic definitions of fuzzy set theory and its applications, semigroup action on sets, finite semigroup theory, its application in automata theory along with references which are used in this thesis. In the second chapter we defined an S-fuzzy subset of X with the extension of the notion of semigroup action of S on X to semigroup action of S on to a fuzzy subset of X using Zadeh's maximal extension principal and proved some results based on this. We also defined an S-fuzzy morphism between two S-fuzzy subsets of X and they together form a category S FSETX. Some general properties and special objects in this category are studied and finally proved that S SET and S FSET are categorically equivalent. Further we tried to generalize this concept to the action of a fuzzy semigroup on fuzzy subsets. As an application, using the above idea, we convert a _nite state automaton to a finite fuzzy state automaton. A classical automata determine whether a word is accepted by the automaton where as a _nite fuzzy state automaton determine the degree of acceptance of the word by the automaton. 1.5. Summary of the Thesis 17 In the third chapter we de_ne regular and inverse fuzzy automata, its construction, and prove that the corresponding transition monoids are regular and inverse monoids respectively. The languages accepted by an inverse fuzzy automata is an inverse fuzzy language and we give a characterization of an inverse fuzzy language. We study some of its algebraic properties and prove that the collection IFL on an alphabet does not form a variety since it is not closed under inverse homomorphic images. We also prove some results based on the fact that a semigroup is inverse if and only if idempotents commute and every L-class or R-class contains a unique idempotent. Fourth chapter includes a study of the structure of the automorphism group of a deterministic faithful inverse fuzzy automaton and prove that it is equal to a subgroup of the inverse monoid of all one-one partial fuzzy transformations on the state set. In the fifth chapter we define min-weighted and max-weighted power automata study some of its algebraic properties and prove that a fuzzy automaton and the fuzzy power automata associated with it have the same transition monoids. The thesis ends with a conclusion of the work done and the scope of further study.