Abstract: | Optical Character Recognition plays an important role in Digital Image Processing and Pattern Recognition. Even though ambient study had been performed on foreign languages like Chinese and Japanese, effort on Indian script is still immature. OCR in Malayalam language is more complex as it is enriched with largest number of characters among all Indian languages. The challenge of recognition of characters is even high in handwritten domain, due to the varying writing style of each individual. In this paper we propose a system for recognition of offline handwritten Malayalam vowels. The proposed method uses Chain code and Image Centroid for the purpose of extracting features and a two layer feed forward network with scaled conjugate gradient for classification |
Description: | Emerging Trends in Electrical and Computer Technology (ICETECT), 2011 International Conference on |
URI: | http://dyuthi.cusat.ac.in/purl/4196 |
Files | Size |
---|---|
Offline Handwri ... n Chain Code Histogram.pdf | (1.324Mb) |
Abstract: | The main objective of the present study is to have a detailed investigation on the gelation properties, morphology and optical properties of small π-conjugated oligomers. For this purpose we have chosen oligo(p-phenylenevinylene)s (OPVs), a class of molecules which have received considerable attention due to their unique optical and electronic properties. Though a large number of reports are available in the literature on the self-assembly properties of tailor made OPVs, none of them pertain to the design of nanostructures based on organogels. In view of this, we aimed at the creation of functional chromophoric assemblies of π-conjugated OPVs through the formation of organogels, with the objective of crafting nanoscopic assemblies of different size and shape thereby modulating their optical and electronic properties.In order to fulfill the above objectives, the design and synthesis of a variety of OPVs with appropriate structural variations were planned. The design principle involves the derivatization of OPVs with weak H-bonding hydroxymethyl end groups and with long aliphatic hydrocarbon side chains. The noncovalent interactions in these molecules were expected to lead the formation of supramolecular assembly and gels in hydrocarbon solvents. In such an event, detailed study of gelation and extensive analysis of the morphology of the gel structures were planned using advanced microscopic techniques. Since OPVs are strongly fluorescent molecules, gelation is expected to perturb the optical properties. Therefore, detailed study on the gelation induced optical properties as a way to probe the nature and stability of the selfassembly was planned. Apart from this, the potential use of the modulation of the optical properties for the purpose of light harvesting was aimed. The approach to this problem was to entrap an appropriate energy trap to the OPV gel matrix which may lead to the efficient energy transfer from the OPV gel based donor to the entrapped acceptor. The final question that we wanted to address in this investigation was the creation of helical nanostructures through proper modification of the OPV backbone With chiral handles.The present thesis is a detailed and systematic approach to the realization of the above objectives which are presented in different chapters of the thesis. |
URI: | http://dyuthi.cusat.ac.in/purl/2795 |
Files | Size |
---|---|
Dyuthi-T0816.pdf | (12.70Mb) |
URI: | http://dyuthi.cusat.ac.in/purl/948 |
Files | Size |
---|---|
ABSTRACT 1.pdf | (13.56Mb) |
abstracts.htm | (112.8Kb) |
FRONT1.pdf | (1.136Mb) |
index.htm | (5.083Kb) |
Description: | Department of Mathematics, Cochin University of Science and Technology |
URI: | http://dyuthi.cusat.ac.in/xmlui/purl/1975 |
Files | Size |
---|---|
Dyuthi-T0435.pdf | (609.3Kb) |
Synopsis.pdf | (91.39Kb) |
Abstract: | The present study on chaos and fractals in general topological spaces. Chaos theory originated with the work of Edward Lorenz. The phenomenon which changes order into disorder is known as chaos. Theory of fractals has its origin with the frame work of Benoit Mandelbrot in 1977. Fractals are irregular objects. In this study different properties of topological entropy in chaos spaces are studied, which also include hyper spaces. Topological entropy is a measures to determine the complexity of the space, and compare different chaos spaces. The concept of fractals can’t be extended to general topological space fast it involves Hausdorff dimensions. The relations between hausdorff dimension and packing dimension. Regular sets in Metric spaces using packing measures, regular sets were defined in IR” using Hausdorff measures. In this study some properties of self similar sets and partial self similar sets. We can associate a directed graph to each partial selfsimilar set. Dimension properties of partial self similar sets are studied using this graph. Introduce superself similar sets as a generalization of self similar sets and also prove that chaotic self similar self are dense in hyper space. The study concludes some relationships between different kinds of dimension and fractals. By defining regular sets through packing dimension in the same way as regular sets defined by K. Falconer through Hausdorff dimension, and different properties of regular sets also. |
URI: | http://dyuthi.cusat.ac.in/purl/880 |
Files | Size |
---|---|
Dyuthi-T0216.pdf | (1.261Mb) |
Abstract: | Materials belonging to the family of manganites are technologically important since they exhibit colossal magneto resistance. A proper understanding of the transport properties is very vital in tailoring the properties. A heavy rare earth doped manganite like Gd0·7Sr0·3MnO3 is purported to be exhibiting unusual properties because of smaller ionic radius of Gd. Gd0·7Sr0·3MnO3 is prepared by a wet solid state reaction method. The conduction mechanism in such a compound has been elucidated by subjecting the material to low temperature d.c. conductivity measurement. It has been found that the low band width material follows a variable range hopping (VRH) model followed by a small polaron hopping (SPH) model. The results are presented here |
Description: | Bull. Mater. Sci., Vol. 35, No. 1, February 2012, pp. 41–45. |
URI: | http://dyuthi.cusat.ac.in/purl/4432 |
Files | Size |
---|---|
On conduction m ... of Gd basedmanganites.pdf | (148.3Kb) |
Abstract: | The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) is the sum of the absolute values of its D-eigenvalues. Two graphs are said to be D-equienergetic if they have the same D-energy. In this note we obtain bounds for the distance spectral radius and D-energy of graphs of diameter 2. Pairs of equiregular D-equienergetic graphs of diameter 2, on p = 3t + 1 vertices are also constructed. |
URI: | http://dyuthi.cusat.ac.in/purl/626 |
Files | Size |
---|---|
7) ON DISTANCE ENERGY OF GRAPHS.pdf | (2.976Mb) |
Abstract: | The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) is the sum of the absolute values of its D-eigenvalues. Two graphs are said to be D-equienergetic if they have the same D-energy. In this note we obtain bounds for the distance spectral radius and D-energy of graphs of diameter 2. Pairs of equiregular D-equienergetic graphs of diameter 2, on p = 3t + 1 vertices are also constructed. |
URI: | http://dyuthi.cusat.ac.in/purl/1537 |
Files | Size |
---|---|
On distance energy of graphs.PDF | (2.514Mb) |
Description: | Department of Statistics, Cochin University of Science and Technology |
URI: | http://dyuthi.cusat.ac.in/purl/2755 |
Files | Size |
---|---|
Dyuthi-T0780.pdf | (4.626Mb) |
Abstract: | A feasible way of implementing a temporal database is by mapping temporal data model onto a conventional data model followed by a commercial database management system. Even though extensions were proposed to standard SQL for supporting temporal databases, such proposals have not yet come across standardization processes. This paper attempts to implement database operators such as aggregates and universal quantifier for temporal databases, implemented on top of relational database systems, using currently available SQL standards. |
URI: | http://dyuthi.cusat.ac.in/xmlui/purl/2006 |
Files | Size |
---|---|
On Implementing Joins....pdf | (261.1Kb) |
Abstract: | This thesis Entitled On Infinite graphs and related matrices.ln the last two decades (iraph theory has captured wide attraction as a Mathematical model for any system involving a binary relation. The theory is intimately related to many other branches of Mathematics including Matrix Theory Group theory. Probability. Topology and Combinatorics . and has applications in many other disciplines..Any sort of study on infinite graphs naturally involves an attempt to extend the well known results on the much familiar finite graphs. A graph is completely determined by either its adjacencies or its incidences. A matrix can convey this information completely. This makes a proper labelling of the vertices. edges and any other elements considered, an inevitable process. Many types of labelling of finite graphs as Cordial labelling, Egyptian labelling, Arithmetic labeling and Magical labelling are available in the literature. The number of matrices associated with a finite graph are too many For a study ofthis type to be exhaustive. A large number of theorems have been established by various authors for finite matrices. The extension of these results to infinite matrices associated with infinite graphs is neither obvious nor always possible due to convergence problems. In this thesis our attempt is to obtain theorems of a similar nature on infinite graphs and infinite matrices. We consider the three most commonly used matrices or operators, namely, the adjacency matrix |
Description: | Department of mathematics, Cochin University of Science and Technology |
URI: | http://dyuthi.cusat.ac.in/purl/3142 |
Files | Size |
---|---|
Dyuthi-T1116.pdf | (1.999Mb) |
Abstract: | This paper presents a novel approach to recognize Grantha, an ancient script in South India and converting it to Malayalam, a prevalent language in South India using online character recognition mechanism. The motivation behind this work owes its credit to (i) developing a mechanism to recognize Grantha script in this modern world and (ii) affirming the strong connection among Grantha and Malayalam. A framework for the recognition of Grantha script using online character recognition is designed and implemented. The features extracted from the Grantha script comprises mainly of time-domain features based on writing direction and curvature. The recognized characters are mapped to corresponding Malayalam characters. The framework was tested on a bed of medium length manuscripts containing 9-12 sample lines and printed pages of a book titled Soundarya Lahari writtenin Grantha by Sri Adi Shankara to recognize the words and sentences. The manuscript recognition rates with the system are for Grantha as 92.11%, Old Malayalam 90.82% and for new Malayalam script 89.56%. The recognition rates of pages of the printed book are for Grantha as 96.16%, Old Malayalam script 95.22% and new Malayalam script as 92.32% respectively. These results show the efficiency of the developed system |
Description: | (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 3, No. 7, 2012 |
URI: | http://dyuthi.cusat.ac.in/purl/4106 |
Files | Size |
---|---|
An Online Chara ... ha Script to Malayalam.pdf | (548.4Kb) |
Abstract: | This paper presents an efficient Online Handwritten character Recognition System for Malayalam Characters (OHR-M) using Kohonen network. It would help in recognizing Malayalam text entered using pen-like devices. It will be more natural and efficient way for users to enter text using a pen than keyboard and mouse. To identify the difference between similar characters in Malayalam a novel feature extraction method has been adopted-a combination of context bitmap and normalized (x, y) coordinates. The system reported an accuracy of 88.75% which is writer independent with a recognition time of 15-32 milliseconds |
Description: | 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC 2009) |
URI: | http://dyuthi.cusat.ac.in/purl/4314 |
Files | Size |
---|---|
On-Line Handwri ... using Kohonen Networks.pdf | (379.0Kb) |
Abstract: | Queueing Theory is the mathematical study of queues or waiting lines. Queues abound in every day life - in computer networks, in tra c islands, in communication of electro-magnetic signals, in telephone exchange, in bank counters, in super market checkouts, in doctor's clinics, in petrol pumps, in o ces where paper works to be processed and many other places. Originated with the published work of A. K. Erlang in 1909 [16] on congestion in telephone tra c, Queueing Theory has grown tremendously in a century. Its wide range applications includes Operations Research, Computer Science, Telecommunications, Tra c Engineering, Reliability Theory, etc. |
URI: | http://dyuthi.cusat.ac.in/purl/5064 |
Files | Size |
---|---|
Dyuthi-T 2129.pdf | (748.9Kb) |
Abstract: | Queueing theory is the mathematical study of ‘queue’ or ‘waiting lines’ where an item from inventory is provided to the customer on completion of service. A typical queueing system consists of a queue and a server. Customers arrive in the system from outside and join the queue in a certain way. The server picks up customers and serves them according to certain service discipline. Customers leave the system immediately after their service is completed. For queueing systems, queue length, waiting time and busy period are of primary interest to applications. The theory permits the derivation and calculation of several performance measures including the average waiting time in the queue or the system, mean queue length, traffic intensity, the expected number waiting or receiving service, mean busy period, distribution of queue length, and the probability of encountering the system in certain states, such as empty, full, having an available server or having to wait a certain time to be served. |
URI: | http://dyuthi.cusat.ac.in/purl/5109 |
Files | Size |
---|---|
Dyuthi-T 2174.pdf | (2.321Mb) |
URI: | http://dyuthi.cusat.ac.in/purl/5001 |
Files | Size |
---|---|
Dyuthi-T2070.pdf | (2.425Mb) |
Abstract: | This thesis entitled' On Queues with Interruptions and Repeat or Resumption of Service' introduces several new concepts into queues with service interruption. It is divided into Seven chapters including an introductory chapter. The following are keywords that we use in this thesis: Phase type (PH) distribution, Markovian Arrival Process (MAP), Geometric Distribution, Service Interruption, First in First out (FIFO), threshold random variable and Super threshold random variable. In the second chapter we introduce a new concept called the 'threshold random variable' which competes with interruption time to decide whether to repeat or resume the interrupted service after removal of interruptions. This notion generalizes the work reported so far in queues with service interruptions. In chapter 3 we introduce the concept of what is called 'Super threshold clock' (a random variable) which keeps track of the total interruption time of a customer during his service except when it is realized before completion of interruption in some cases to be discussed in this thesis and in other cases it exactly measures the duration of all interruptions put together. The Super threshold clock is OIl whenever the service is interrupted and is deactivated when service is rendered. Throughout this thesis the first in first out service discipline is followed except for priority queues. |
Description: | Department of Mathematics, Cochin University of Science and Technology |
URI: | http://dyuthi.cusat.ac.in/purl/2431 |
Files | Size |
---|---|
Dyuthi-T0658.pdf | (4.985Mb) |
Abstract: | Nature is full of phenomena which we call "chaotic", the weather being a prime example. What we mean by this is that we cannot predict it to any significant accuracy, either because the system is inherently complex, or because some of the governing factors are not deterministic. However, during recent years it has become clear that random behaviour can occur even in very simple systems with very few number of degrees of freedom, without any need for complexity or indeterminacy. The discovery that chaos can be generated even with the help of systems having completely deterministic rules - often models of natural phenomena - has stimulated a lo; of research interest recently. Not that this chaos has no underlying order, but it is of a subtle kind, that has taken a great deal of ingenuity to unravel. In the present thesis, the author introduce a new nonlinear model, a ‘modulated’ logistic map, and analyse it from the view point of ‘deterministic chaos‘. |
Description: | Department of Physics, Cochin University of Science and Technology |
URI: | http://dyuthi.cusat.ac.in/purl/3565 |
Files | Size |
---|---|
Dyuthi-T1546.pdf | (2.902Mb) |
URI: | http://dyuthi.cusat.ac.in/purl/1656 |
Files | Size |
---|---|
Dyuthi-T0223.pdf | (1.046Mb) |
Abstract: | The present study on some infinite convex invariants. The origin of convexity can be traced back to the period of Archimedes and Euclid. At the turn of the nineteenth centaury , convexicity became an independent branch of mathematics with its own problems, methods and theories. The convexity can be sorted out into two kinds, the first type deals with generalization of particular problems such as separation of convex sets[EL], extremality[FA], [DAV] or continuous selection Michael[M1] and the second type involved with a multi- purpose system of axioms. The theory of convex invariants has grown out of the classical results of Helly, Radon and Caratheodory in Euclidean spaces. Levi gave the first general definition of the invariants Helly number and Radon number. The notation of a convex structure was introduced by Jamison[JA4] and that of generating degree was introduced by Van de Vel[VAD8]. We also prove that for a non-coarse convex structure, rank is less than or equal to the generating degree, and also generalize Tverberg’s theorem using infinite partition numbers. Compare the transfinite topological and transfinite convex dimensions |
URI: | http://dyuthi.cusat.ac.in/purl/89 |
Files | Size |
---|---|
Dyuthi-T0214.pdf | (971.6Kb) |
Dyuthi Digital Repository Copyright © 2007-2011 Cochin University of Science and Technology. Items in Dyuthi are protected by copyright, with all rights reserved, unless otherwise indicated.