Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and 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.
CCE 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 …