| 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) |
| Abstract: | 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. |
| Description: | Department of Mathematics, Cochin University of Science And Technology. |
| URI: | http://dyuthi.cusat.ac.in/purl/3108 |
| Files | Size |
|---|---|
| Dyuthi-T1082.pdf | (4.972Mb) |
| Abstract: | Zinc aluminate nanoparticles with average particle size of 40 nm were synthesized using a sol–gel combustion method. X-ray diffractometry result was analysed by Rietveld refinement method to establish the phase purity of the material. Different stages of phase formation of the material during the synthesis were investigated using differential scanning calorimetry and differential thermogravimetric analysis. Particle size was determined with transmission electron microscopy and the optical bandgap of the nanoparticles was determined by absorption spectroscopy in the ultraviolet-visible range. Dielectric permittivity and a.c. conductivity of the material were measured for frequencies from 100 kHz to 8 MHz in the temperature range of 30–120◦C. The presence of Maxwell– Wagner type interfacial polarization was found to exist in the material and hopping of electron by means of quantum mechanical tunneling is attributed as the reason for the observed a.c. conductivity |
| Description: | Bull. Mater. Sci., Vol. 34, No. 2, April 2011, pp. 251–259 |
| URI: | http://dyuthi.cusat.ac.in/purl/4374 |
| Files | Size |
|---|---|
| On structural, ... luminate nanoparticles.pdf | (577.6Kb) |
| Abstract: | This study is to look the effect of change in the ordering of the Fourier system on Szegö’s classical observations of asymptotic distribution of eigenvalues of finite Toeplitz forms.This is done by checking proofs and Szegö’s properties in the new set up.The Fourier system is unconditional [19], any arbitrary ordering of the Fourier system forms a basis for the Hilbert space L2 [-Π, Π].Here study about the classical Szegö’s theorem.Szegö’s type theorem for operators in L2(R+) and check its validity for certain multiplication operators.Since the trigonometric basis is not available in L2(R+) or in L2(R) .This study discussed about the classes of orderings of Haar System in L2 (R+) and in L2(R) in which Szegö’s Type TheoreT Am is valid for certain multiplication operators.It is divided into two sections. In the first section there is an ordering to Haar system in L2(R+) and prove that with respect to this ordering, Szegö’s Type theorem holds for general class of multiplication operators Tƒ with multiplier ƒ ε L2(R+), subject to some conditions on ƒ.Finally in second section more general classes of ordering of Haar system in L2(R+) and in L2(R) are identified in such a way that for certain classes of multiplication operators the asymptotic distribution of eigenvalues exists. |
| URI: | http://dyuthi.cusat.ac.in/purl/66 |
| Files | Size |
|---|---|
| Dyuthi-T0213.pdf | (1.645Mb) |
| URI: | http://dyuthi.cusat.ac.in/purl/5299 |
| Files | Size |
|---|---|
| Dyuthi T-2335.pdf | (4.009Mb) |
| Abstract: | For a set S of vertices and the vertex v in a connected graph G, max x2S d(x, v) is called the S-eccentricity of v in G. The set of vertices with minimum S-eccentricity is called the S-center of G. Any set A of vertices of G such that A is an S-center for some set S of vertices of G is called a center set. We identify the center sets of certain classes of graphs namely, Block graphs, Km,n, Kn −e, wheel graphs, odd cycles and symmetric even graphs and enumerate them for many of these graph classes. We also introduce the concept of center number which is defined as the number of distinct center sets of a graph and determine the center number of some graph classes |
| Description: | arXiv preprint arXiv:1312.3182 |
| URI: | http://dyuthi.cusat.ac.in/purl/4226 |
| Files | Size |
|---|---|
| On The Center S ... of Some Graph Classes.pdf | (198.9Kb) |
| URI: | http://dyuthi.cusat.ac.in/purl/1232 |
| Files | Size |
|---|---|
| Suneela S S 1989.PDF | (435.3Kb) |
| Abstract: | Activation energy for crystallization (Ec) is a pertinent parameter that decides the application potential of many metallic glasses and is proportional to the crystallization temperature. Higher crystallization temperatures are desirable for soft magnetic applications, while lower values for data storage purposes. In this investigation, from the heating rate dependence of peak crystallization temperature Tp, the Ec values have been evaluated by three different methods for metglas 2826 MB (Fe40Ni38B18Mo4) accurately. The Ec values are correlated with the morphological changes, and the structural evolution associated with annealing temperatures is discussed. |
| URI: | http://dyuthi.cusat.ac.in/purl/2842 |
| Files | Size |
|---|---|
| Dyuthi-P00395.pdf | (452.8Kb) |
| Abstract: | The temperature and frequency dependence of dielectric permittivity and dielectric loss of nanosized Mn1−xZnxFe2O4 (for x = 0, 0.2, 0.4, 0.6, 0.8, 1) were investigated. The impact of zinc substitution on the dielectric properties of the mixed ferrite is elucidated. Strong dielectric dispersion and broad relaxation were exhibited by Mn1−xZnxFe2O4. The variation of dielectric relaxation time with temperature suggests the involvement of multiple relaxation processes. Cole–Cole plots were employed as an effective tool for studying the observed phenomenon. The activation energies were calculated from relaxation peaks and Cole–Cole plots and found to be consistent with each other and indicative of a polaron conduction |
| Description: | J. Phys.: Condens. Matter 21 (2009) 146006 (12pp) |
| URI: | http://dyuthi.cusat.ac.in/purl/4393 |
| Files | Size |
|---|---|
| On the dielectr ... se zinc mixed ferrites.pdf | (4.818Mb) |
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.