37 resultados para Anisotropic Analytical Algorithm

em Cochin University of Science


Relevância:

20.00% 20.00%

Publicador:

Resumo:

A genetic algorithm has been used for null steering in phased and adaptive arrays . It has been shown that it is possible to steer the array null s precisely to the required interference directions and to achieve any prescribed null depths . A comparison with the results obtained from the analytic solution shows the advantages of using the genetic algorithm for null steering in linear array patterns

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Design equations are presented for calculating the resonance frequencies for a compact dual frequency arrow-shaped microstrip antenna. This provides a fast and simple way to predict the resonant frequencies of the antenna. The antenna is also analyzed using the IE3D simulation package. The theoretical predictions are found to be very close to the IE3D results and thus establish the validity of the design formulae

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An attempt is made to determine the relative power distribution in a step-index parabolic cylindrical waveguide (PCW) with high deformation across the direction of propagation. The guide is assumed to be made of silica. The scalar field approximation is employed for the analysis under which a vanishing refractive-index (RI) difference in the waveguide materials is considered. Further, no approximation for folds- is used in the analytical treatment. Due to the geometry of such waceguides, PCWs lose the well-defined modal discreteness, and a kind of mode bunching is observed instead, which becomes much more prominent in PCWs with high bends. However, with the increase in cross-sectional size, the mode-bunching tendency is slightly reduced. The general expressions for power in the guiding and nonguiding sections are obtained, and the fractional power patterns in all of the sections are presented for PCWs of various cross-sectional dimensions. It is observed that the confinement of power in the core section is increased for PCWs of larger cross-sectional size. Moreover, a fairly uniform distribution of power is seen over the modes having intermediate values of propagation constants

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Submarine hull structure is a watertight envelope, under hydrostatic pressure when in operation. Stiffened cylindrical shells constitute the major portion of these submarine hulls and these thin shells under compression are susceptible to buckling failure. Normally loss of stability occurs at the limit point rather than at the bifurcation point and the stability analysis has to consider the change in geometry at each load step. Hence geometric nonlinear analysis of the shell forms becomes. a necessity. External hydrostatic pressure will follow the deformed configuration of the shell and hence follower force effect has to be accounted for. Computer codes have been developed based on all-cubic axisymmetric cylindrical shell finite element and discrete ring stiffener element for linear elastic, linear buckling and geometric nonIinear analysis of stiffened cylindrical shells. These analysis programs have the capability to treat hydrostatic pressure as a radial load and as a follower force. Analytical investigations are carried out on two attack submarine cylindrical hull models besides standard benchmark problems. In each case, the analysis has been carried out for interstiffener, interdeepframe and interbulkhead configurations. The shell stiffener attachment in each of this configuration has been represented by the simply supported-simply supported, clamped-clamped and fixed-fixed boundary conditions in this study. The results of the analytical investigations have been discussed and the observations and conclusions are described. Rotation restraint at the ends is influential for interstiffener and interbulkhead configurations and the significance of axial restraint becomes predominant in the interbulkhead configuration. The follower force effect of hydrostatic pressure is not significant in interstiffener and interdeepframe configurations where as it has very high detrimental effect on buckling pressure on interbulkhead configuration. The geometric nonlinear interbulkhead analysis incorporating follower force effect gives the critical value of buckling pressure and this analysis is recommended for the determination of collapse pressure of stiffened cylindrical submarine shells.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This thesis Entitled Internet Utilization and Academic Activities of Faculty Members in the Universities of kerala: an analytical study. Today, scientific research is throwing up new discoveries, inventions and vistas by the hour. We are witnessing a veritable knowledge explosion. It is important for members of university faculty members to keep abreast of it for giving up-t-date information to their students about the new development in the subject of their study. The internet is an invaluable tool for achieving it. Most of the universities have sufficient internet facility, but the accessibility to all the faculty members is not adequate. University Libraries also provides standard supplementary service in the internet area. This study indicates differential level of awareness and utilization of the internet services by the faculty members in the areas of teaching, research and publication. However the overall impression is that the awareness and utilization is inadequate. This point to the urgent need to devise programs and schemes to promote internet utilization among the faculty members. The suggestions indicate the key areas that deserve attention by policy makers and administrators. Thanks to the internet, every new development in every field of study is just a click away for faculty members, research scholars and students.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The study of simple chaotic maps for non-equilibrium processes in statistical physics has been one of the central themes in the theory of chaotic dynamical systems. Recently, many works have been carried out on deterministic diffusion in spatially extended one-dimensional maps This can be related to real physical systems such as Josephson junctions in the presence of microwave radiation and parametrically driven oscillators. Transport due to chaos is an important problem in Hamiltonian dynamics also. A recent approach is to evaluate the exact diffusion coefficient in terms of the periodic orbits of the system in the form of cycle expansions. But the fact is that the chaotic motion in such spatially extended maps has two complementary aspects- - diffusion and interrnittency. These are related to the time evolution of the probability density function which is approximately Gaussian by central limit theorem. It is noticed that the characteristic function method introduced by Fujisaka and his co-workers is a very powerful tool for analysing both these aspects of chaotic motion. The theory based on characteristic function actually provides a thermodynamic formalism for chaotic systems It can be applied to other types of chaos-induced diffusion also, such as the one arising in statistics of trajectory separation. It was noted that there is a close connection between cycle expansion technique and characteristic function method. It was found that this connection can be exploited to enhance the applicability of the cycle expansion technique. In this way, we found that cycle expansion can be used to analyse the probability density function in chaotic maps. In our research studies we have successfully applied the characteristic function method and cycle expansion technique for analysing some chaotic maps. We introduced in this connection, two classes of chaotic maps with variable shape by generalizing two types of maps well known in literature.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The present thesis deals with the theoretical investigations on the effect of anisotropy on various properties of magnetically doped superconductors described by fihiba — Rusinov model.Chapter 1 is introductory. It contains a brief account of the current status of theory of superconductivity. In’ chapter 2 we give the formulation of the problem. Chapter 2.1 gives the BCS theory. The effect of magnetic impurities in superconductors as described by A8 theory is given in chapter 2.2A and that described by SR model is discussed in chapter 2.28. Chapter 2.2c deals with Kondo effect. In chapter 2.3 the anisotropy problem is reviewed. Our calculations, results and discussions are given in chapter 3. Chapter 3.1 deals with Josephson tunnel effect. In chapter 3.2 the thermodynamic critical field H62 is described. Chtpter 3.3 deals with the density of states. The ultrasonic attenuation coefficient and ufitlear spin relaxation are given in chapter 3.4 and 3.5 respectively. In chapter 3.6 we give the upper critical field calculations and chapter 3.7 deals with the response function. The Kondo effect is given in chapter 3.8. In chapter 4 we give the sumary of our results

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Assembly job shop scheduling problem (AJSP) is one of the most complicated combinatorial optimization problem that involves simultaneously scheduling the processing and assembly operations of complex structured products. The problem becomes even more complicated if a combination of two or more optimization criteria is considered. This thesis addresses an assembly job shop scheduling problem with multiple objectives. The objectives considered are to simultaneously minimizing makespan and total tardiness. In this thesis, two approaches viz., weighted approach and Pareto approach are used for solving the problem. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. Two metaheuristic techniques namely, genetic algorithm and tabu search are investigated in this thesis for solving the multiobjective assembly job shop scheduling problems. Three algorithms based on the two metaheuristic techniques for weighted approach and Pareto approach are proposed for the multi-objective assembly job shop scheduling problem (MOAJSP). A new pairing mechanism is developed for crossover operation in genetic algorithm which leads to improved solutions and faster convergence. The performances of the proposed algorithms are evaluated through a set of test problems and the results are reported. The results reveal that the proposed algorithms based on weighted approach are feasible and effective for solving MOAJSP instances according to the weight assigned to each objective criterion and the proposed algorithms based on Pareto approach are capable of producing a number of good Pareto optimal scheduling plans for MOAJSP instances.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

As the application of polymeric complexes is enormous, there exists a continuing interest in the synthesis and characterization of these complexes. The synthetic and characterization parts are very important in an academic point of view. Further in an application point of view also polymeric ligands/complexes are gaining attention.The thesis is divided in to six chapters, in which the first chapter gives an introduction along with a brief review on polymeric ligands/ complexes. The second chapter explains the different procedure adopted for the whole work along with the details of the reagents/ instruments used. The third chapter gives a report of the detailed study regarding the synthesis and characterization of eighteen complexes. While the fourth chapter is a report of the ion removal studies using three polymeric ligands, the fifth chapter explains the development of a polymeric complex as ion selective electrode material for the fabrication of a CC ion selective electrode. The sixth chapter presents the summary and tables, figures and references are given separately at the end.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Decimal multiplication is an integral part of financial, commercial, and internet-based computations. A novel design for single digit decimal multiplication that reduces the critical path delay and area for an iterative multiplier is proposed in this research. The partial products are generated using single digit multipliers, and are accumulated based on a novel RPS algorithm. This design uses n single digit multipliers for an n × n multiplication. The latency for the multiplication of two n-digit Binary Coded Decimal (BCD) operands is (n + 1) cycles and a new multiplication can begin every n cycle. The accumulation of final partial products and the first iteration of partial product generation for next set of inputs are done simultaneously. This iterative decimal multiplier offers low latency and high throughput, and can be extended for decimal floating-point multiplication.