Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (13)
- Applied Mathematics (3)
- Other Computer Sciences (3)
- Physics (3)
- Arts and Humanities (2)
-
- Discrete Mathematics and Combinatorics (2)
- Engineering (2)
- Geometry and Topology (2)
- Other Mathematics (2)
- Algebra (1)
- Analysis (1)
- Art and Design (1)
- Computer Engineering (1)
- Education (1)
- Electrical and Computer Engineering (1)
- Elementary Education (1)
- Gifted Education (1)
- Higher Education (1)
- Information Security (1)
- Interactive Arts (1)
- Music (1)
- Music Theory (1)
- Numerical Analysis and Scientific Computing (1)
- Other Physics (1)
- Robotics (1)
- Scholarship of Teaching and Learning (1)
- Science and Mathematics Education (1)
- Secondary Education (1)
- Institution
- Publication Year
- Publication
-
- Doctoral Theses (102)
- Bookshelf (3)
- Mathematics & Computer Science Student Scholarship (3)
- Doctoral Dissertations (2)
- CCAC Theses and Dissertations (1)
-
- Computer Science: Faculty Publications and Other Works (1)
- Dartmouth Scholarship (1)
- Dissertations (1)
- Dissertations (1934 -) (1)
- Honors Projects in Data Science (1)
- Journal of Humanistic Mathematics (1)
- Mathematics and Statistics Faculty Publications and Presentations (1)
- Mathematics, Statistics, and Computer Science Honors Projects (1)
- Michigan Tech Publications, Part 1 (1)
- NEXUS: The Liberty Journal of Interdisciplinary Studies (1)
- Transformations (1)
- Publication Type
Articles 31 - 60 of 122
Full-Text Articles in Mathematics
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 …
Algorithmic Foundations Of Heuristic Search Using Higher-Order Polygon Inequalities, Newton Henry Campbell Jr.
Algorithmic Foundations Of Heuristic Search Using Higher-Order Polygon Inequalities, Newton Henry Campbell Jr.
CCAC Theses and Dissertations
The shortest path problem in graphs is both a classic combinatorial optimization problem and a practical problem that admits many applications. Techniques for preprocessing a graph are useful for reducing shortest path query times. This dissertation studies the foundations of a class of algorithms that use preprocessed landmark information and the triangle inequality to guide A* search in graphs. A new heuristic is presented for solving shortest path queries that enables the use of higher order polygon inequalities. We demonstrate this capability by leveraging distance information from two landmarks when visiting a vertex as opposed to the common single landmark …
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 …
Conditional Tests On Basins Of Attraction With Finite Fields, Ian H. Dinwoodie
Conditional Tests On Basins Of Attraction With Finite Fields, Ian H. Dinwoodie
Mathematics and Statistics Faculty Publications and Presentations
An iterative method is given for computing the polynomials that vanish on the basin of attraction of a steady state in discrete polynomial dynamics with finite field coefficients. The algorithm is applied to dynamics of a T cell survival network where it is used to compare transition maps conditional on a basin of attraction.
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 …
Characterizing Conflict In Wikipedia, Nathaniel Miller
Characterizing Conflict In Wikipedia, Nathaniel Miller
Mathematics, Statistics, and Computer Science Honors Projects
Wikipedia serves as the Internet's most widely viewed reference. In order to ensure its success, editors who create and maintain articles must resolve conflicts over appropriate article content. Previous research has measured Wikipedia conflict at two levels: single articles and categories of pages. I observe conflicts within small groups of articles, identifying their frequency, size, and intensity. Additionally, I identify individual conflicts spanning multiple articles and effects of conflict upon users' editing habits. I analyze cross-article conflict in three stages. First, I cluster a group of 1.4 million Wikipedia articles. Next, I find individual user conflicts within each article cluster …
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.
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 …
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.