Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 31 - 60 of 102
Full-Text Articles in Physical Sciences and Mathematics
Distributed Algorithms For Initialization And Topology Control In Wireless Ad Hoc Networks., Subhasis Bhattacharjee Dr.
Distributed Algorithms For Initialization And Topology Control In Wireless Ad Hoc Networks., Subhasis Bhattacharjee Dr.
Doctoral Theses
Wireless ad hoc networking is an upcoming communication technology that makes exchange of information possible without any pre-existing infrastructure. Over the last decade it has grabbed tremendous interest in the research community due to its easy deployability and high flexibility, with numerous applications to social, industrial and personal uses. In this thesis, we designed effcient light weight distributed algorithms based on minimal local information to resolve the problems related to the initialization and topology configuration of wireless ad hoc networks with special emphasis on optimal utilization of limited resources. Once the ad hoc nodes with in-built radio transceivers are deployed …
Studies On Public Key And Identity-Based Cryptographic Primitives., Mahabir Prasad Jhanwar Dr.
Studies On Public Key And Identity-Based Cryptographic Primitives., Mahabir Prasad Jhanwar Dr.
Doctoral Theses
No abstract provided.
Single And Multiobjective Approaches To Clustering With Point Symmetry., Sriparna Saha Dr.
Single And Multiobjective Approaches To Clustering With Point Symmetry., Sriparna Saha Dr.
Doctoral Theses
In our every day life, we make decisions consciously or unconsciously. This decision can be very simple such as selecting the color of dress or deciding the menu for lunch, or may be as difficult as those involved in designing a missile or in selecting a career. The former decision is easy to take, while the latter one might take several years due to the level of complexity involved in it. The main goal of most kinds of decision-making is to optimize one or more criteria in order to achieve the desired result. In other words, problems related to optimization …
Fast Placement And Floorplanning Methods In Modern Reconfigurable Fpgas., Pritha Baneerjee Dr.
Fast Placement And Floorplanning Methods In Modern Reconfigurable Fpgas., Pritha Baneerjee Dr.
Doctoral Theses
FPGA Field-programmable gate-arrays (FPGA) are programmable hardware platforms with pre-fabricated logic and interconnects, which are electrically programmed by the user to realize a variety of circuits frequently required in a wide range of applications. Unlike application-specific integrated-circuits (ASICs), where realization of a circuit design takes several man-hours and enormous effort, the pre-fabricated logic and interconnects can be quickly programmed according to the design specification and made functional. Thus, in contrast to the ASICs, FPGAs can be customized and reconfigured depending on the need of the user. A basic FPGA chip consists of a set of configurable logic blocks (CLB) and …
Application Of Combinatorial Structures To Key Predistribution In Sensor Networks And Traitor Tracing., Sushmita Ruj Dr.
Application Of Combinatorial Structures To Key Predistribution In Sensor Networks And Traitor Tracing., Sushmita Ruj Dr.
Doctoral Theses
From time immemorial people have used cryptography for secure communication. Cryptography has decided the fate of many kings and queens as well as the outcome of various wars. It has become all the more important nowadays, with the growing need of electronic communication. We now live in a society where electronic networks pervade all aspects of our professional and private lives. We all use cryptography when we do bank transfers by ATM, or SWIFT, while using the mobile phones and i-phones, SSL protocols or using password protected machines. Though electronic communication is fast and easy, it is vulnerable to security …
Geometric Characterization Of Digital Objects: Algorithms And Applications To Image Analysis., Arindam Biswas Dr.
Geometric Characterization Of Digital Objects: Algorithms And Applications To Image Analysis., Arindam Biswas Dr.
Doctoral Theses
Several problems of characterizing a digital object, and particularly, those related to boundary description, have been studied in this thesis. New algorithms and their applications to various aspects of image analysis and retrieval have been reported. A combinatorial technique for constructing the outer and inner isothetic covers of a digital object has been developed. The resolution of the background 2D grid can be changed by varying the grid spacing, and this procedure can be used to extract shape and topological information about the object. Next, an algorithm has been designed for constructing the orthogonal (convex) hull of a digital object …
Normal Surfaces And Heegaard Splittings Of 3-Manifolds., Tejas Kalelkar Dr.
Normal Surfaces And Heegaard Splittings Of 3-Manifolds., Tejas Kalelkar Dr.
Doctoral Theses
This thesis deals with various questions regarding normal surfaces and Heegaard splittings of 3-manifolds.Chapter 1The first chapter is divided into two parts. In the first, we give an outline of normal surface theory and mention some of its important applications. The second part gives an overview of the theory of Heegaard splitting surfaces and a few of its applications. None of the material covered in this chapter is original and it is meant solely as an exposition of known results.Chapter 2In this chapter, we give a lower bound on the Euler characteristic of a normal surface, a topological invariant, in …
Certain Pattern Recognition Tasks Using Genetic Programming., Durga Muni Dr.
Certain Pattern Recognition Tasks Using Genetic Programming., Durga Muni Dr.
Doctoral Theses
No abstract provided.
Studies On Construction And List Decoding Of Codes On Some Towers Of Function Fields., M. Prem Laxman Das Dr.
Studies On Construction And List Decoding Of Codes On Some Towers Of Function Fields., M. Prem Laxman Das Dr.
Doctoral Theses
In everyday life, there arise many situations where two parties, sender and receiver, need to communicate. The channel through which they communicate is assumed to be binary symmetric, that is, it changes 0 to 1 and vice versa with equal probability. At the receiver’s end, the sent message has to be recovered from the corrupted received word using some reasonable mechanism. This real life problem has attracted a lot of research in the past few decades. A solution to this problem is obtained by adding redundancy in a systematic manner to the message to construct a codeword. The collection of …
Image And Video Compression Using Block Truncation Coding And Pattern Fitting For Fast Decoding., Bibhas Chandra Dhara Dr.
Image And Video Compression Using Block Truncation Coding And Pattern Fitting For Fast Decoding., Bibhas Chandra Dhara Dr.
Doctoral Theses
In the present era of multimedia, the requirement of image/video storage and transmission for video conferencing, image and video retrieval, video playback, etc. are increasing exponentially. As a result, the need for better compression technology is always in demand. The limited bandwidth of internet also asks for transmission of desired objects only. Progressive image transmission provides such facilities, where transmission is done in steps and the transmission of undesired image can be stopped at an early stage. Modern applications, in addition to high compression ratio, also demand for efficient encoding and decoding processes, so that computational constraint of many real-time …
Web Surfer Models: Preprocessing, Page Ranking, And Quantitative Evaluation., Narayan L. Bhamidipati Dr.
Web Surfer Models: Preprocessing, Page Ranking, And Quantitative Evaluation., Narayan L. Bhamidipati Dr.
Doctoral Theses
The World Wide Web [12] (usually referred to as the Web, WWW or W3) is an enormous collection of data available over the Internet, which is a vast network of computers. It was created in the year 1990 by Tim Berners-Lee, while he worked at CERN, Switzerland, and was made available over the Internet in 1991. The World Wide Web Consortium [136] authoritatively defines the Web as the universe of network-accessible information, the embodiment of human knowledge. The Web consists of objects, also called documents or pages in a generic sense, that are identified using a Uniform Resource Identifier (URI), …
Placement And Range Assignment In Power-Aware Radio Networks., Gautam Kumar Das Dr.
Placement And Range Assignment In Power-Aware Radio Networks., Gautam Kumar Das Dr.
Doctoral Theses
Due to the extraordinary growth of demand in mobile communication facility, design of efficient systems for providing specialized services has become an important issue in wireless mobility research. Broadly speaking, there are two major models for wireless networking: single-hop and multi-hop. The single-hop model [110] is based on the cellular network, and it provides one-hop wireless connectivity between the host and the static nodes known as base stations. single-hop networks rely on a fixed backbone infrastructure that interconnects all the base stations by high speed wired links. On the other hand, the multi-hop model requires neither fixed wired infrastructure nor …
Algorithms For Some Geometric Facility Location And Path Planning Problems., Sasanka Roy Dr.
Algorithms For Some Geometric Facility Location And Path Planning Problems., Sasanka Roy Dr.
Doctoral Theses
The facility location problem is a resource allocation problem that mainly deals with adequate placement of various types of facilities to serve a distributed set of demands satisfying the nature of interactions between the demands and facilities and optimizing the cost of placing/maintaining the facilities and the quality of services.The facility location problem is well-studied in the Operations Research literature and recently has received a lot of attention in the Computer Science community. For a company, the facility location problem provides more strategic decisions than just giving importance to locate the lowest cost space for storing its products. While identifying …
Geometric Primitives In Digital Images: Analyses And Applications Using Digital Geometry., Partha Bhowmick Dr.
Geometric Primitives In Digital Images: Analyses And Applications Using Digital Geometry., Partha Bhowmick Dr.
Doctoral Theses
No abstract provided.
Some Necessary Conditions Of Boolean Functions To Resist Algebraic Attacks., Deepak Dalai Dr.
Some Necessary Conditions Of Boolean Functions To Resist Algebraic Attacks., Deepak Dalai Dr.
Doctoral Theses
No abstract provided.
Construction Of (Hierarchical) Identity-Based Encryption Protocols Using Bilinear Pairing., Sanjit Chatterjee Dr.
Construction Of (Hierarchical) Identity-Based Encryption Protocols Using Bilinear Pairing., Sanjit Chatterjee Dr.
Doctoral Theses
Science, it is argued [65], advances through paradigm shifts. Concepts emerge that open-up new vistas of research, fundamentally changing the way we are used to looking at things. Between these paradigm shifts remain the periods of consolidation. Periods when human mind explores the newly found territory, shedding light on hitherto unknown dimensions. If radical changes are the hallmarks of paradigm shifts, the period within witnesses small but continuous developments, occasionally marked by its own milestones. It is in these periods that human faculty tries to grasp the full significance of the new concepts, consolidates its gains and thereby pushes the …
A Study On Time/Memory Trade-Off Cryptanalysis., Sourav Mukhopadhyay Dr.
A Study On Time/Memory Trade-Off Cryptanalysis., Sourav Mukhopadhyay Dr.
Doctoral Theses
At the beginning of 2003, I was searching for a suitable area to do my PhD. My respected guide Prof. Palash Sarkar assigned me to do a survey work on block cipher cryptanalysis. I found myself very interested in this area. I am very lucky that I joined into a golden group – Cryptology Research Group of India formed by our beloved teacher Prof. Bimal Roy and had the opportunity to work with Prof. Palash Sarkar, Dr. Subhomoy Maitra, Prof. Rana Barua and many others. I have been inspired by many persons during my PhD work.I would like to begin …
On Edge Detection And Object Recognition In Color Images., Sarif Kumar Naik Dr.
On Edge Detection And Object Recognition In Color Images., Sarif Kumar Naik Dr.
Doctoral Theses
No abstract provided.
Concatenative Text-To-Speech Synthesis: A Study On Standard Colloquial Bengali., Soumen Chowdhury Dr.
Concatenative Text-To-Speech Synthesis: A Study On Standard Colloquial Bengali., Soumen Chowdhury Dr.
Doctoral Theses
The primary communication process between human beings is Speech. Speech synthesis is the automatic and artificial generation of the speech signal by a machine. A TTS (Text-To-Speech) synthesis system is one which can generate speech signal from a string of text in a given language. The development in the speech synthesis systems in various languages has been going on for several decades. With the unprecedented expansion of IT (Information Technology) invading the life of the common man it is highly desirable that at least the information dissemination be made via the speech mode which is the most natural mode of …
Some Geometrical Aspects Of The Cone Linear Complementarity Problem., Madhur Malik Dr.
Some Geometrical Aspects Of The Cone Linear Complementarity Problem., Madhur Malik Dr.
Doctoral Theses
Cone Linear Complementarity ProblemLet V be a finite dimensional real inner product space and K be a closed convex cone in V. Given a linear transformation L : V → V and a vector q ∈ V the cone linear complementarity problem or linear complementarity problem over K, denoted as LCP(K, L, q), is to find a vector x ∈ K such thatL(x) + q ∈ K+ and hx, L(x) + qi = 0,where h., .i denotes an inner product on V and K is the dual cone of K defined as:K∗ := {y ∈ V : hx, yi ≥ …
Properties Of Some Matrix Classes In Linear Complementarity Theory., Arup Kumar Das Dr.
Properties Of Some Matrix Classes In Linear Complementarity Theory., Arup Kumar Das Dr.
Doctoral Theses
The linear complementarity problem is a fundamental problem that arises in optimization, game theory, economics, and engineering. It can be stated as follows:Given a square matrix A of order n with real entries and an n dimensional vector q, find n dimensional vectors w and z satisfying w − Az = q, w ≥ 0, z ≥ 0 (1.1.1) w t z = 0. (1.1.2)This problem is denoted as LCP(q, A). The name comes from the condition (1.1.2), the complementarity condition which requires that at least one variable in the pair (wj , zj ) should be equal to 0 …
Design Of Iteration On Hash Functions And Its Cryptanalysis., Mridul Nandi Dr.
Design Of Iteration On Hash Functions And Its Cryptanalysis., Mridul Nandi Dr.
Doctoral Theses
No abstract provided.
Studies On Pairing-Based And Constant Round Dynamic Group Key Agreement., Ratna Dutta Dr.
Studies On Pairing-Based And Constant Round Dynamic Group Key Agreement., Ratna Dutta Dr.
Doctoral Theses
This thesis describes research that I conducted during the course of my Ph.D. study at Indian Statistical Institute (ISI), Kolkata. I hope that this work is of use and will be carried on.I would like to begin by thanking my supervisor, Prof. Rana Barua for his support and endless patience. He has provided me background in Cryptography, Combinatorics and Theory of Automata during the period 2000-2002 of my course work of M.Tech in Computer Science at Indian Statistical Institute. I really appreciate his extraordinary patience in reading my numerous inferior drafts, for listening and analyzing all my ideas, forcing me …
Some Nonparametric And Semiparametric Methods For Discriminant Analysis., Anil Kumar Ghosh Dr.
Some Nonparametric And Semiparametric Methods For Discriminant Analysis., Anil Kumar Ghosh Dr.
Doctoral Theses
Discriminant analysis (see e.g., Devijver and Kittler, 1982; Duda, Hart and Stork, 2000; Hastle, Tibahirani and Friedman, 2001) deals with the separation of different groups of obaervationa and allocation of a new oboervation to one of the previously delined grouga. In a J-class discriminant analysis problem, we usually hae a training sample of the form {(xk, ck) : k = 1,2,...,N}, where xk = (Ik1,Ik2,...J) is a d-dimensional measarement vector, and ca € {1,2,...,J} is its class label. On the basis of thia training sample, one aims to form a decision rule d(x) : Rd + (1,2,...,J} for clasifying the …
Morphological Tower: A Tool For Multi-Scale Image Processing., Susanta Mukhopadhyay Dr.
Morphological Tower: A Tool For Multi-Scale Image Processing., Susanta Mukhopadhyay Dr.
Doctoral Theses
An image is a recorded replication of natural scene or objects using suitable sensor and recording media. The visual quality of the recorded image may be enhanced using various types of low-level processing namely noise smoothing, contrast enhancement. The images of the same scene recorded by several sensors reveal more inforination but in their own respective ways. This advantage of multi-sensor imaging system is real- ized through the fusion of the multimodal images. One more important higher-level processing is segmentation where the image is decomposed into a set of meaningful regions ( e.g. objects and background). An image, in general, …
Cryptographic And Combinatorial Properties Of Boolean Functions And S-Boxes., Kishan Chand Gupta Dr.
Cryptographic And Combinatorial Properties Of Boolean Functions And S-Boxes., Kishan Chand Gupta Dr.
Doctoral Theses
In this thesis we study combinatorial aspects of Boolean functions and S-boxes with impor- tant cryptographic properties and construct new functions possesing such properties. These have possible applications in the design of private key (symmetric key) cryptosystems.Symmetric key cryptosystems are broadly divided into two classes.1. Stream Ciphers,2. Block Ciphers.Some recent proposals of stream ciphers are SNOW [37], SCREAM [52], TURING (98], MUGI (117), HBB (102], RABBIT (9), HELIX (38] and some proposals of block ciphers are DES, AES, RC6 [97), MARS (12], SERPENT (6], TWOFISH (104].In stream cipher cryptography a pseudorandom sequence of bits of length cqual to the message …
On Some Generalized Transforms For Signal Decomposition And Reconstruction., Yumnam Singh Dr.
On Some Generalized Transforms For Signal Decomposition And Reconstruction., Yumnam Singh Dr.
Doctoral Theses
In this thesis, we propose two new subband transforms entitled ISITRA and YKSK transforms and their possible applications in image compression and encryption. Both these transforms are developed based on a common model of multiplication known as Bino’s model of multiplication. ISITRA is a convolution based transforms i.e., that both forward and inverse transform of ISITRA is based on convolution as in DWT or 2-channel filter bank. However, it is much more general than the existing DWT or 2-channel filter bank scheme in the sense that it we can get different kinds of filters in addition to the filters specified …
Some Statistical Contributions To The Analysis Of Human Genome Diversity And Evolution., Analabha Basu Dr.
Some Statistical Contributions To The Analysis Of Human Genome Diversity And Evolution., Analabha Basu Dr.
Doctoral Theses
The work embodied in this thesis pertains to human population genetics. In particular, the overarching goals of this thesis are to contribute to the understanding of genomic diversity of human populations and to the development of statistical methods for making inferences in genome diversity studies. With these two goals in mind, we have carried out a detailed statistical analysis of genomic data on a large number of ethnic populations of India, generated in the laboratory of the Anthropology & Human Genetics Unit, Indian Statistical Institute, Kolkata. Additionally, wherever relevant, we have compared our data with those collated from the published …
Some Combinatorial Design In Vlsi Architectures And Statistics., Soumen Maity Dr.
Some Combinatorial Design In Vlsi Architectures And Statistics., Soumen Maity Dr.
Doctoral Theses
In this dissertation, we consider the following combinatorial problems: some character- ization, enumeration, construction and optimization problems in both VLSI linear and VLSI two-dimensional arrays; and construction of two combinatorial designs as used by statisticians: nearly strongly balanced uniform repeated measurements designs (NSBUR- MDs) and balanced near uniform repeated measurements designs (BNURMDS). We give below, chapter-wise, the problems considered and a brief outline of the solutions.1.1 Enumerating Catastrophic Fault Patterns in VLSI Linear Arrays with Bidirectional or Unidirectional LinksSystolic systems consist, of a large mimber of identical and elementary processing element locally conuccted in a regular fashion. Each element receives …
Essays On Minimum Cost Spanning Tree Games., Anirban Kar Dr.
Essays On Minimum Cost Spanning Tree Games., Anirban Kar Dr.
Doctoral Theses
There is a wide range of economic contexts in which aggregate costs have to be allocated amongst individual agents or components who derive t he benefits from a common project. A firm has to allocate overheard costs atmongst its different divisions. Regulatory authorities have to set taxes or fees on individual users for a variety of services. Partners in a joint venture must share costs (and benefits) of the joint venture. For example, when two doctors share an office they need to divide the cost of office space, medical equipment and secretarial help. If several municipalities use a common water …