Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
On The Analysis Of Some Recursive Equations In Probability., Arunangshu Biswas Dr.
On The Analysis Of Some Recursive Equations In Probability., Arunangshu Biswas Dr.
Doctoral Theses
This thesis deals with recursive systems used in theoretical and applied probability. Recursive systems are stochastic processes {Xn}n≥1 where the Xn depends on the earlier Xn−1 and also on some increment process which is uncorrelated with the process Xn. The simplest example of a recursive system is the Random Walk, whose properties have been extensively studied. Mathematically a recursive system takes the form Xn = f(Xn−1, n), is the increment/ innovation procedure and f(·, ·) is a function on the product space of xn and n. We first consider a recursive system called Self-Normalized sums (SNS) corresponding to a sequence …
Some Issues In Unsupervised Feature Selection Using Similarity., Partha Pratim Kundu Dr.
Some Issues In Unsupervised Feature Selection Using Similarity., Partha Pratim Kundu Dr.
Doctoral Theses
Pattern recognition is what humans do most of the time, without any conscious effort, and fortunately excel in. Information is received through various sensory organs, processed simultaneously in the brain, and its source is instantaneously identified without any perceptible effort. The interesting issue is that recognition occurs even under non-ideal conditions, i.e., when information is vague, imprecise or incomplete. In reality, most human activities depend on the success in performing various pattern recognition tasks. Let us consider an example. Before boarding a train or bus, we first select the appropriate one by identifying either the route number or its destination …
On Supervised And Unsupervised Methodologies For Mining Of Text Data., Tanmay Basu Dr.
On Supervised And Unsupervised Methodologies For Mining Of Text Data., Tanmay Basu Dr.
Doctoral Theses
The supervised and unsupervised methodologies of text mining using the plain text data of English language have been discussed. Some new supervised and unsupervised methodologies have been developed for effective mining of the text data after successfully overcoming some limitations of the existing techniques.The problems of unsupervised techniques of text mining, i.e., document clustering methods are addressed. A new similarity measure between documents has been designed to improve the accuracy of measuring the content similarity between documents. Further, a hierarchical document clustering technique is designed using this similarity measure. The main significance of the clustering algorithm is that the number …
Generic Constructions Of Different Cryptographic Primitives Over Various Public Key Paradigms., Sumit Kumar Pandey Dr.
Generic Constructions Of Different Cryptographic Primitives Over Various Public Key Paradigms., Sumit Kumar Pandey Dr.
Doctoral Theses
In this thesis, we study the generic construction of some cryptographic primitives over various public key paradigms like traditional Public Key Cryptosystems and Identity Based Cryptosystems. It can be broadly divided into two categories1. Generic construction of some highly secure cryptographic primitives from less secure cryptographic primitives, and2. Generic construction of some complex cryptographic primitives from basic cryptographic primitives. Mathematical tools provide a way to achieve cryptographic functionality like confidentiality, authentication, data-integrity, non-repudiation etc., but in the case of complex cryptographic functionality like achieving confidentiality and authentication at the same time or confidentiality, authentication and non-repudiation at the same time …