Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 30 of 102
Full-Text Articles in Physical Sciences and Mathematics
Randomized Algorithms For Resource Allocation In Device To Device Communication., Subhankar Ghosal Dr.
Randomized Algorithms For Resource Allocation In Device To Device Communication., Subhankar Ghosal Dr.
Doctoral Theses
In device to device (D2D) communication, two users residing in close proximity can directly communicate between them, through a common channel, without the need of a base station. A pair of D2D users forms a link and a channel needs to be allocated to it. The interference relationship among the active links at time t is modelled as an interference graph g(t). To establish interference-free communication, we have to assign a channel vector C(t) and a power vector corresponding to the active links such that the required signal to interference plus noise ratio (SINR) is satisfied for each link. Since …
Constructions And Analyses Of Efficient Symmetric-Key Primitives For Authentication And Encryption., Sebati Ghosh Dr.
Constructions And Analyses Of Efficient Symmetric-Key Primitives For Authentication And Encryption., Sebati Ghosh Dr.
Doctoral Theses
In symmetric key cryptography there are two fundamental objectives, viz. 1. confidentiality or secrecy of message from unexpected party and 2. authentication of message which includes authenticating the source of the message as well as integrity of the message against any unwanted modification. Let us first concentrate on confidentiality. In classical symmetric key cryptography two parties, say Alice and Bob, first secretly exchange a key-pair (e, d). Later, if Alice wishes to send a secret message m ∈ M to Bob, she computes c = Ee(m) and transmits c to Bob. Upon receiving c, Bob computes Dd(c) = m and …
Morphological Network: Network With Morphological Neurons., Ranjan Mondal Dr.
Morphological Network: Network With Morphological Neurons., Ranjan Mondal Dr.
Doctoral Theses
Image processing with traditional approaches mainly use the tools of linear systems. However, linear approaches are not well suited and may even fail to solve problems involving geometrical aspects of the image. Thus, nonlinear geometric approaches like morphological operations are very popular in those cases. Morphological operations are nonlinear operations based on a set and lattice-theoretic methodology for image analysis that are capable of describing the geometrical structure of image objects quantitatively. It is suitable for various problems in image processing, computer vision, and pattern recognition. While solving problems with morphology, a particular structuring element is defined. Structuring elements have …
Computing Well-Structured Subgraphs In Geometric Intersection Graphs., Satyabrata Jana Dr.
Computing Well-Structured Subgraphs In Geometric Intersection Graphs., Satyabrata Jana Dr.
Doctoral Theses
For a set of geometric objects, the associative geometric intersection graph is the graph with a vertex for each object and an edge between two vertices if and only if the corresponding objects intersect. Geometric intersection graphs are very important due to their theoretical properties and applicability. Based on the different geometric objects, several types of geometric intersection graphs are defined. Given a graph G, an induced (either vertex or edge) subgraph H ⊆ G is said to be an well-structured subgraph if H satisfies certain properties among the vertices in H. This thesis studies some well-structured subgraphs finding problems …
Efficient Handover Mechanisms For Heterogeneous Networks., Shankar Kumar Ghosh Dr.
Efficient Handover Mechanisms For Heterogeneous Networks., Shankar Kumar Ghosh Dr.
Doctoral Theses
In this thesis, some analytical frameworks have been developed to analyze the effect of different system parameters on handover performances in heterogeneous network (HetNet) and based on such frameworks, some efficient handover algorithms have been proposed. The study starts with an analytical framework to investigate the effect of resource allocation mechanisms, upper layer mobility management protocols (MMPs) and handover decision metrics on user perceived throughput. This analysis reveals that among other factors, handover decision metric plays a crucial role in determining user perceived throughput in HetNet. Subsequently, we develop two handover decision metrics for ultra dense networks (UDN) and unlicensed …
Zero-Knowledge Proof, Deniability And Their Applications In Blockchain, E-Voting And Deniable Secret Handshake Protocols., Somnath Panja Dr.
Zero-Knowledge Proof, Deniability And Their Applications In Blockchain, E-Voting And Deniable Secret Handshake Protocols., Somnath Panja Dr.
Doctoral Theses
In this thesis, we propose a cryptographic technique for an authenticated, end-to-end verifiable and secret ballot election. Currently, almost all verifiable e-voting systems require trusted authorities to perform the tallying process except for the DRE-i and DRE-ip systems. We have shown a weaknesses in the DRE-ip system and proposed a solution. We have modified the DRE-ip system so that no adversary can create and post a valid ballot on the public bulletin board without detection. We provide security proofs to prove the security properties of the proposed scheme. We propose two methods to store these ballots using blockchain and cloud …
Many-Objective Evolutionary Algorithms: Objective Reduction, Decomposition And Multi-Modality., Monalisa Pal Dr.
Many-Objective Evolutionary Algorithms: Objective Reduction, Decomposition And Multi-Modality., Monalisa Pal Dr.
Doctoral Theses
Evolutionary Algorithms (EAs) for Many-Objective Optimization (MaOO) problems are challenging in nature due to the requirement of large population size, difficulty in maintaining the selection pressure towards global optima and inability of accurate visualization of high-dimensional Pareto-optimal Set (in decision space) and Pareto-Front (in objective space). The quality of the estimated set of Pareto-optimal solutions, resulting from the EAs for MaOO problems, is assessed in terms of proximity to the true surface (convergence) and uniformity and coverage of the estimated set over the true surface (diversity). With more number of objectives, the challenges become more profound. Thus, better strategies have …
Mathematical Formulations For Complex Resource Scheduling Problems., T. R. Lalita Dr.
Mathematical Formulations For Complex Resource Scheduling Problems., T. R. Lalita Dr.
Doctoral Theses
This thesis deals with development of effective models for large scale real-world resource scheduling problems. Efficient utilization of resources is crucial for any organization or industry as resources are often scarce. Scheduling them in an optimal way can not only take care of the scarcity but has potential economic benefits. Optimal utilization of resources reduces costs and thereby provides a competitive edge in the business world. Resources can be of different types such as human (personnel-skilled and unskilled), financial(budgets), materials, infrastructures(airports and seaports with designed facilities, windmills, warehouses’ area, hotel rooms etc) and equipment (microprocessors, cranes, machinery, aircraft simulators for …
On Class Imbalanced Learning:Design Of Non-Parametricclassifiers, Performance Indices, And Deep Oversampling Strategies., Sankha Mullick Dr.
On Class Imbalanced Learning:Design Of Non-Parametricclassifiers, Performance Indices, And Deep Oversampling Strategies., Sankha Mullick Dr.
Doctoral Theses
The relevance of classification is almost endless in the everyday application of machine learning. However, the performance of a classifier is only limited to the fulfillment of the inherent assumptions it makes about the training examples. For example, to facilitate unbiased learning a classifier is expected to be trained with an equal number of labeled data instances from all of the classes. However, in a large number of practical applications such as anomaly detection, semantic segmentation, disease prediction, etc. it may not be possible to gather an equal number of diverse training points for all the classes. This results in …
Optimal Eavesdropping In Quantum Cryptography, Atanu Acharyya Dr.
Optimal Eavesdropping In Quantum Cryptography, Atanu Acharyya Dr.
Doctoral Theses
Quantum key distribution (QKD) has raised some promise for more secured communication than its classical counterpart. It allows the legitimate parties to detect eavesdropping which introduces error in the channel. If disturbed, there are ways to distill a secure key within some threshold error-rate. The amount of information gained by an attacker is generally quantified by (Shannon) mutual information. Knowing the maximum amount of information that an intruder can gain is important for post-processing purposes, and we mainly focus on that side in the thesis. Renyi information is also useful especially when post-processing is considered. The scope of this thesis …
Secret Sharing And Its Variants, Matroids,Combinatorics., Shion Samadder Chaudhury Dr.
Secret Sharing And Its Variants, Matroids,Combinatorics., Shion Samadder Chaudhury Dr.
Doctoral Theses
The main focus of this thesis is secret sharing. Secret Sharing is a very basic and fundamental cryptographic primitive. It is a method to share a secret by a dealer among different parties in such a way that only certain predetermined subsets of parties can together reconstruct the secret while some of the remaining subsets of parties can have no information about the secret. Secret sharing was introduced independently by Shamir [139] and Blakely [20]. What they introduced is called a threshold secret sharing scheme. In such a secret sharing scheme the subsets of parties that can reconstruct a secret …
Some Nonparametric Hybrid Predictive Models : Asymptotic Properties And Applications., Tanujit Chakraborty Dr.
Some Nonparametric Hybrid Predictive Models : Asymptotic Properties And Applications., Tanujit Chakraborty Dr.
Doctoral Theses
Prediction problems like classification, regression, and time series forecasting have always attracted both the statisticians and computer scientists worldwide to take up the challenges of data science and implementation of complicated models using modern computing facilities. But most traditional statistical and machine learning models assume the available data to be well-behaved in terms of the presence of a full set of essential features, equal size of classes, and stationary data structures in all data instances, etc. Practical data sets from the domain of business analytics, process and quality control, software reliability, and macroeconomics, to name a few, suffer from various …
Dealing With Classification Irregularities In Real-World Scenarios., Payel Sadhukhan Dr.
Dealing With Classification Irregularities In Real-World Scenarios., Payel Sadhukhan Dr.
Doctoral Theses
Data processing by the human sensory system comes naturally. This processing, commonly denoted as pattern recognition and analysis are carried out spontaneously by humans. In day to day life, in most cases, decision making by humans come without any conscious effort. From the middle of the past century, humans have shown interest to render their abstraction capabilities (pattern recognition and analysis) to the machine. The abstraction capability of the machine is ’machine intelligence’ or ’machine learning’ [87].The primary goal of machine learning methods is to extract some meaningful information from the ’data’. Data refers to the information or attributes that …
Studies On Diagnostic Coverage And X-Sensitivity In Logic Circuits., Manjari Pradhan Dr.
Studies On Diagnostic Coverage And X-Sensitivity In Logic Circuits., Manjari Pradhan Dr.
Doctoral Theses
Today’s integrated circuits comprise billions of interconnected transistors assembled on a tiny silicon chip, and testing them to ensure functional and timing correctness continues to be a major challenge to designers and test engineers with further downscaling of transistors. Although substantial progress has been witnessed during the last five decades in the area of algorithmic test generation and fault diagnosis, applications of combinatorial and machinelearning (ML) techniques to solve these problems remain largely unexplored till date. In this thesis, we study three problems in the context of digital logic test and diagnosis. The first problem is that of fault diagnosis …
Essays In Social Choice Theory., Dipjyoti Majumdar Dr.
Essays In Social Choice Theory., Dipjyoti Majumdar Dr.
Doctoral Theses
The purpose of this thesis is to explore some issues in social choice theory and decision theory. Social choice theory provides the theoretical foundations for the field of public choice and welfare economics. It tries to bring together normative aspects like perspective value judgements and positive aspects, like strategic con- siderations. The second feature which is our focus, is closely related to the problem of providing appropriate incentives to agents, an issue of prime importance in eco- nomics.Consider for example, a set of agents who must elect one among a set of can- didates. These candidates may be physical agents …
In Silicoidentification Of Toxins And Their Effect Onhost Pathways: Feature Extraction, Classificationand Pathway Prediction., Rishika Sen Dr.
In Silicoidentification Of Toxins And Their Effect Onhost Pathways: Feature Extraction, Classificationand Pathway Prediction., Rishika Sen Dr.
Doctoral Theses
Identification of toxins, which are either proteins or small molecules, from pathogens is of paramount importance due to their crucial role as first-line invaders infiltrating a host, often leading to infection of the host. These toxins can affect specific proteins, like enzymes that catalyze metabolic pathways, affect metabolites that form the basis of metabolic reactions, and prevent the progression of those pathways, or more generally they may affect the regular functioning of other proteins in signaling pathways in the host. In this regard, the thesis addresses the problem of identification of toxins, and the effect of perturbations by toxins on …
Provable Security Of Symmetric-Key Cryptographic Schemes., Ashwin Jha Dr.
Provable Security Of Symmetric-Key Cryptographic Schemes., Ashwin Jha Dr.
Doctoral Theses
In this thesis, we provide quantitative and/or qualitative improvements in the provable security of several symmetric-key schemes, encompassing major information security goals, viz. data authentication, encryption, and authenticated encryption.AUTHENTICATION AND INTEGRITY: Among authentication schemes, we analyze the CBC-MAC family and counter-based MACs (XMACC, XMACR, PCS, LightMAC etc.), referred as the XMAC family. First, we revisit the security proofs for CBC-MAC and EMAC, and identify a critical flaw in the state-of-the-art results. We revise the security proofs and obtain significantly better bounds in case of EMAC, ECBC and FCBC. Second, we study the security of CBC-MAC family, when the underlying primitive …
Image Dehazing From The Perspective Of Environmental Illumination., Sanchayan Santra Dr.
Image Dehazing From The Perspective Of Environmental Illumination., Sanchayan Santra Dr.
Doctoral Theses
Haze and fog are atmospheric phenomena where the particles suspended in the air obscure visibility by scattering the light propagating through the atmosphere. As a result only a part of the reflected light reaches the observer. So, the apparent intensity of the objects get reduced. Apart from that, the in-scatter of the atmospheric light creates a translucent veil, which is a common sight during haze. Image dehazing methods try to recover a haze-free version of a given image by removing the effects of haze.Although attempts have been made to accurately estimate the scene transmittance, the estimation of environmental illumination has …
Mechanism Design In Sequencing Problems., Parikshit De Dr.
Mechanism Design In Sequencing Problems., Parikshit De Dr.
Doctoral Theses
Collective decision making is an important social issue, since it depends on individual preferences that are not publicly observable. Therefore, the question is, whether it is possible to elicit the private information available to individuals and then how to extract the private information in various strategic environment; Mechanism design deals with these questions. The difference between game theory and mechanism design is that, the former tries to predict the outcome of a strategic environment in some “equilibrium” but the latter tries to design or restrict the environment in such a way that the desired objective is attained, that is, the …
Some Contemporary Issues In Software Reliability., Vignesh Subrahmaniam Dr.
Some Contemporary Issues In Software Reliability., Vignesh Subrahmaniam Dr.
Doctoral Theses
No abstract provided.
Digital Circles And Balls: Characterization, Properties, And Applications To Image Analysis., Sahadev Bera Dr.
Digital Circles And Balls: Characterization, Properties, And Applications To Image Analysis., Sahadev Bera Dr.
Doctoral Theses
In this thesis, we have reported some new theoretical findings, empirical formulations, useful heuristics, and efficient algorithms related to digital circle, digital disc, and digital sphere, along with their practical applications to the analysis of geometric information embedded in a digital image. Detecting digital circles and circular arcs from a digital image is very important in shape recognition. Several image processing techniques were proposed over the years to extract circles and circular arc from a digital image and to interpret related issues. We have proposed a novel technique for the segmentation of a digital circle, which is based on a …
Some Results On Analysis And Implementation Of Hc-128 Stream Cipher., Shashwat Raizada Dr.
Some Results On Analysis And Implementation Of Hc-128 Stream Cipher., Shashwat Raizada Dr.
Doctoral Theses
The HC-128 stream cipher is a successful entrant in the eStream candidate list (software profile) and is the lighter variant of HC-256 stream cipher. Apart from the analysis by the designer of the cipher (Hongjun Wu) to conjecture the security of this cipher, there are only a few other observations on this cipher despite being the focus of researchers during the three phases of eStream evaluation and later efforts in the community. Till date none of the security claims in favor of HC-128 by the designer could be broken. One may expect HC-128 stream cipher to be popular in commercial …
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 …
Coverage And Detection In Wireless Sensor Networks., Mrinal Nandi Dr.
Coverage And Detection In Wireless Sensor Networks., Mrinal Nandi Dr.
Doctoral Theses
A Wireless Sensor Networks (WSNs), which are two or three dimensional systems, usually consist of a large number of small sensors equipped with some processing circuit, and a wireless transceiver. The sensors have small size, low battery capacity, non-renewable power supply, small processing power, limited buffer capacity and low-power radio. They may measure distance, direction, speed, humidity, wind speed, soil makeup, temperature, chemicals, light, and various other parameters. The sensors are autonomous devices with integrated sensing, processing, and communication capabilities.In this thesis, we consider ‘coverage problem’ and ‘detection problem’ in Wireless Sensor Networks (WSNs) in grid as well as in …
Enhancing Effective Depth-Of-Field By Multi-Focus Image Fusion Using Morphological Techniques., Ishita De Ghosh Dr.
Enhancing Effective Depth-Of-Field By Multi-Focus Image Fusion Using Morphological Techniques., Ishita De Ghosh Dr.
Doctoral Theses
A scene to be photographed, usually includes objects at varying distances from the camera. Depth-of-field of a digital camera is the range of distance, all objects within which appear to be sharp in the image. Due to the low depth-of-field of the camera, images acquired by them often suffer from degradation called out-of-foc us blur. One way to enhance the effective depth-of-field is to acquire se veral images of a scene with focus on different parts of it and then combine these images into a single image in such a way that all regions of the scene are in focus. …
Blackbox Reduction Of Some Cryptographic Constructions., Rishiraj Bhattacharyya Dr.
Blackbox Reduction Of Some Cryptographic Constructions., Rishiraj Bhattacharyya Dr.
Doctoral Theses
No abstract provided.
Some Results On Cryptanalysis Of Rsa And Factorization., Santanu Sarkar Dr.
Some Results On Cryptanalysis Of Rsa And Factorization., Santanu Sarkar Dr.
Doctoral Theses
In this thesis, we propose some new results in Cryptanalysis of RSA and related Factorization problems. Till date, the best known algorithm to solve the Integer Factorization problem is the Number Field Sieve, which has a runtime greater than exp(log1/3 N) for factoring an integer N. However, if one obtains certain information about the RSA parameters, there are algorithms which can factor the RSA modulus N = pq quite efficiently. The intention of this thesis is to identify such weaknesses of the RSA cryptosystem and its variants. Further we study results related to factorization.In Africacrypt 2008, Nitaj presented a class …