ON (s,S) inventory policy with/without retrial and interruption of services/production

In this thesis we have developed a few inventory models in which items are served to the customers after a processing time. This leads to a queue of demand even when items are available. In chapter two we have discussed a problem involving search of orbital customers for providing inventory. Retrial of orbital customers was also considered in that chapter; in chapter 5 also we discussed retrial inventory model which is sans orbital search of customers. In the remaining chapters (3, 4 and 6) we did not consider retrial of customers, rather we assumed the waiting room capacity of the system to be arbitrarily large. Though the models in chapters 3 and 4 differ only in that in the former we consider positive lead time for replenishment of inventory and in the latter the same is assumed to be negligible, we arrived at sharper results in chapter 4. In chapter 6 we considered a production inventory model with production time distribution for a single item and that of service time of a customer following distinct Erlang distributions. We also introduced protection of production and service stages and investigated the optimal values of the number of stages to be protected.

Economic Impacts Of Air Pollution on Human Health and Property Values

The objectives of the present study are to provide a systematic descriptive documentation of the nature of air pollution of the Cochin industrial agglomeration, estimate the willingness to pay for morbidity reduction due to air pollution in observed and hypothetical markets and to estimate the value of welfare loss in the purchase of property due to reduced air quality. This study is an attempt to examine economic impacts of air pollution on the human health and property values in the industrial capital of Kerala. The process of industrialization in Kerala and the increase in air pollution created damages to human, natural and economic resources in the state. The study documents the extent of air pollution and applied econometric approaches to estimate economic impacts of air pollution on human health and property values. The Important sources of air pollution identified in Cochin are emissions from industries and automobiles.

INVESTIGATIONS ON THE RECOVERY OF TITANIUM VANADIUM AND IRON VALUES FROM THE WASTE CHILORIDE LIQUORS OF TITANIA INDUSTRY

The thesis entitled INVESTIDGATIONS ON THE RECOVERY OF TITANIUM VANADIUM AND IRON VALUES FROM THE WASTE CHILORIDE LIQUORS OF TITANIA INDUSTRY embodies the results of the investigations carried out on the solvent extraction separation of iron (III) vanadium(V) and titanium (IV) chlorides from the waste chloride liquors of titanium minerals processing industry by employing tributylphosphate (TBT) as an extractant. The objective of this study is to generate the knowledge base to achieve the recovery of iron, vanadium and titanium cvalues from multi- metal waste chloride liquors originating from ilmenite mineral beneficiation industries through selective separation and value added material development

OPTIMAL UTILIZATION OF SERVICE FACILITY FOR A k-OUT-OF-n SYSTEM WITH REPAIR BY EXTENDING SERVICE TO EXTERNAL CUSTOMERS IN A RETRIAL QUEUE

In this paper, we study a k-out-of-n system with single server who provides service to external customers also. The system consists of two parts:(i) a main queue consisting of customers (failed components of the k-out-of-n system) and (ii) a pool (of finite capacity M) of external customers together with an orbit for external customers who find the pool full. An external customer who finds the pool full on arrival, joins the orbit with probability and with probability 1− leaves the system forever. An orbital customer, who finds the pool full, at an epoch of repeated attempt, returns to orbit with probability (< 1) and with probability 1 − leaves the system forever. We compute the steady state system size probability. Several performance measures are computed, numerical illustrations are provided.

Analysis and Optimization of Machining Process Using Evolutionary Algorithms

To ensure quality of machined products at minimum machining costs and maximum machining effectiveness, it is very important to select optimum parameters when metal cutting machine tools are employed. Traditionally, the experience of the operator plays a major role in the selection of optimum metal cutting conditions. However, attaining optimum values each time by even a skilled operator is difficult. The non-linear nature of the machining process has compelled engineers to search for more effective methods to attain optimization. The design objective preceding most engineering design activities is simply to minimize the cost of production or to maximize the production efficiency. The main aim of research work reported here is to build robust optimization algorithms by exploiting ideas that nature has to offer from its backyard and using it to solve real world optimization problems in manufacturing processes.In this thesis, after conducting an exhaustive literature review, several optimization techniques used in various manufacturing processes have been identified. The selection of optimal cutting parameters, like depth of cut, feed and speed is a very important issue for every machining process. Experiments have been designed using Taguchi technique and dry turning of SS420 has been performed on Kirlosker turn master 35 lathe. Analysis using S/N and ANOVA were performed to find the optimum level and percentage of contribution of each parameter. By using S/N analysis the optimum machining parameters from the experimentation is obtained.Optimization algorithms begin with one or more design solutions supplied by the user and then iteratively check new design solutions, relative search spaces in order to achieve the true optimum solution. A mathematical model has been developed using response surface analysis for surface roughness and the model was validated using published results from literature.Methodologies in optimization such as Simulated annealing (SA), Particle Swarm Optimization (PSO), Conventional Genetic Algorithm (CGA) and Improved Genetic Algorithm (IGA) are applied to optimize machining parameters while dry turning of SS420 material. All the above algorithms were tested for their efficiency, robustness and accuracy and observe how they often outperform conventional optimization method applied to difficult real world problems. The SA, PSO, CGA and IGA codes were developed using MATLAB. For each evolutionary algorithmic method, optimum cutting conditions are provided to achieve better surface finish.The computational results using SA clearly demonstrated that the proposed solution procedure is quite capable in solving such complicated problems effectively and efficiently. Particle Swarm Optimization (PSO) is a relatively recent heuristic search method whose mechanics are inspired by the swarming or collaborative behavior of biological populations. From the results it has been observed that PSO provides better results and also more computationally efficient.Based on the results obtained using CGA and IGA for the optimization of machining process, the proposed IGA provides better results than the conventional GA. The improved genetic algorithm incorporating a stochastic crossover technique and an artificial initial population scheme is developed to provide a faster search mechanism. Finally, a comparison among these algorithms were made for the specific example of dry turning of SS 420 material and arriving at optimum machining parameters of feed, cutting speed, depth of cut and tool nose radius for minimum surface roughness as the criterion. To summarize, the research work fills in conspicuous gaps between research prototypes and industry requirements, by simulating evolutionary procedures seen in nature that optimize its own systems.

Studies on Production of Bacterial Xylanases

Xylanases with hydrolytic activity on xylan, one of the hemicellulosic materials present in plant cell walls, have been identified long back and the applicability of this enzyme is constantly growing. All these applications especially the pulp and paper industries require novel enzymes. There has been lot of documentation on microbial xylanases, however, none meeting all the required characteristics. The characters being sought are: higher production, higher pH and temperature optima, good stabilities under these conditions and finally the low associated cellulase and protease production. The present study analyses various facets of xylanase biotechnology giving emphasis on bacterial xylanases. Fungal xylanases are having problems like low pH values for both enzyme activity and growth. Moreover, the associated production of cellulases at significant levels make fungal xylanases less suitable for application in paper and pulp industries.Bacillus SSP-34 selected from 200 isolates was clearly having xylan catabolizing nature distinct from earlier reports. The stabilities at higher temperatures and pH values along with the optimum conditions for pH and temperature is rendering Bacillus SSP-34 xylanase more suitable than many of the previous reports for application in pulp and paper industries.Bacillus SSP-34 is an alkalophilic thertmotolerant bacteria which under optimal cultural conditions as mentioned earlier, can produce 2.5 times more xylanase than the basal medium.The 0.5% xylan concentration in the medium was found to the best carbon source resulting in 366 IU/ml of xylanase activity. This induction was subjected to catabolite repression by glucose. Xylose was a good inducer for xylanase production. The combination of yeast extract and peptone selected from several nitrogen sources resulted in the highest enzyme production (379+-0.2 IU/ml) at the optimum final concentration of 0.5%. All the cultural and nutritional parameters were compiled and comparative study showed that the modified medium resulted in xylanase activity of 506 IU/ml, 5 folds higher than the basal medium.The novel combination of purification techniques like ultrafiltraton, ammonium sulphate fractionation, DEAE Sepharose anion exchange chromatography, CM Sephadex cation exchange chromatography and Gel permeation chromatography resulted in the purified xylanase having a specific activity of 1723 U/mg protein with 33.3% yield. The enzyme was having a molecular weight of 20-22 kDa. The Km of the purified xylanase was 6.5 mg of oat spelts xylan per ml and Vmax 1233 µ mol/min/mg protein.Bacillus SSP-34 xylanase resulted in the ISO brightness increase from 41.1% to 48.5%. The hydrolytic nature of the xylanase was in the endo-form.Thus the organism Bacillus SSP-34 was having interesting biotechnological and physiological aspects. The SSP-34 xylanase having desired characters seems to be suited for application in paper and pulp industries.

Mean Squared Residue Based Biclustering Algorithms for the Analysis of Gene Expression Data

Computational Biology is the research are that contributes to the analysis of biological data through the development of algorithms which will address significant research problems.The data from molecular biology includes DNA,RNA ,Protein and Gene expression data.Gene Expression Data provides the expression level of genes under different conditions.Gene expression is the process of transcribing the DNA sequence of a gene into mRNA sequences which in turn are later translated into proteins.The number of copies of mRNA produced is called the expression level of a gene.Gene expression data is organized in the form of a matrix. Rows in the matrix represent genes and columns in the matrix represent experimental conditions.Experimental conditions can be different tissue types or time points.Entries in the gene expression matrix are real values.Through the analysis of gene expression data it is possible to determine the behavioral patterns of genes such as similarity of their behavior,nature of their interaction,their respective contribution to the same pathways and so on. Similar expression patterns are exhibited by the genes participating in the same biological process.These patterns have immense relevance and application in bioinformatics and clinical research.Theses patterns are used in the medical domain for aid in more accurate diagnosis,prognosis,treatment planning.drug discovery and protein network analysis.To identify various patterns from gene expression data,data mining techniques are essential.Clustering is an important data mining technique for the analysis of gene expression data.To overcome the problems associated with clustering,biclustering is introduced.Biclustering refers to simultaneous clustering of both rows and columns of a data matrix. Clustering is a global whereas biclustering is a local model.Discovering local expression patterns is essential for identfying many genetic pathways that are not apparent otherwise.It is therefore necessary to move beyond the clustering paradigm towards developing approaches which are capable of discovering local patterns in gene expression data.A biclusters is a submatrix of the gene expression data matrix.The rows and columns in the submatrix need not be contiguous as in the gene expression data matrix.Biclusters are not disjoint.Computation of biclusters is costly because one will have to consider all the combinations of columans and rows in order to find out all the biclusters.The search space for the biclustering problem is 2 m+n where m and n are the number of genes and conditions respectively.Usually m+n is more than 3000.The biclustering problem is NP-hard.Biclustering is a powerful analytical tool for the biologist.The research reported in this thesis addresses the problem of biclustering.Ten algorithms are developed for the identification of coherent biclusters from gene expression data.All these algorithms are making use of a measure called mean squared residue to search for biclusters.The objective here is to identify the biclusters of maximum size with the mean squared residue lower than a given threshold. All these algorithms begin the search from tightly coregulated submatrices called the seeds.These seeds are generated by K-Means clustering algorithm.The algorithms developed can be classified as constraint based,greedy and metaheuristic.Constarint based algorithms uses one or more of the various constaints namely the MSR threshold and the MSR difference threshold.The greedy approach makes a locally optimal choice at each stage with the objective of finding the global optimum.In metaheuristic approaches particle Swarm Optimization(PSO) and variants of Greedy Randomized Adaptive Search Procedure(GRASP) are used for the identification of biclusters.These algorithms are implemented on the Yeast and Lymphoma datasets.Biologically relevant and statistically significant biclusters are identified by all these algorithms which are validated by Gene Ontology database.All these algorithms are compared with some other biclustering algorithms.Algorithms developed in this work overcome some of the problems associated with the already existing algorithms.With the help of some of the algorithms which are developed in this work biclusters with very high row variance,which is higher than the row variance of any other algorithm using mean squared residue, are identified from both Yeast and Lymphoma data sets.Such biclusters which make significant change in the expression level are highly relevant biologically.

A Reinforcement Learning Approach to Economic Dispatch using Neural Networks

This paper presents a Reinforcement Learning (RL) approach to economic dispatch (ED) using Radial Basis Function neural network. We formulate the ED as an N stage decision making problem. We propose a novel architecture to store Qvalues and present a learning algorithm to learn the weights of the neural network. Even though many stochastic search techniques like simulated annealing, genetic algorithm and evolutionary programming have been applied to ED, they require searching for the optimal solution for each load demand. Also they find limitation in handling stochastic cost functions. In our approach once we learn the Q-values, we can find the dispatch for any load demand. We have recently proposed a RL approach to ED. In that approach, we could find only the optimum dispatch for a set of specified discrete values of power demand. The performance of the proposed algorithm is validated by taking IEEE 6 bus system, considering transmission losses

Optimal Design of a Surface Mounted Permanent-Magnet BLDC Motor for Spacecraft Applications

This paper presents the optimal design of a surface mounted permanent-magnet (PM) Brushless direct-current (BLDC) motor meant for spacecraft applications. The spacecraft applications requires the choice of a motor with high torque density, minimum cogging torque, better positional stability and high torque to inertia ratio. Performance of two types of machine configurations viz Slotted PMBLDC and Slotless PMBLDC with Halbach array are compared with the help of analytical and finite element (FE) methods. It is found that unlike a Slotted PMBLDC motor, the Slotless type with Halbach array develops zero cogging torque without reduction in the developed torque. Moreover, the machine being coreless provides high torque to inertia ratio and zero magnetic stiction

THE CHANGING CONCEPT OF POLITICAL VALUES IN THE HINDI NOVELS OF POST-SIXTIES

Hindi