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 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 …
Combinatorial Techniques For Digital Image Charecterization And Retrieval:Algorithms,Architectures,And Applications., Arijit Bishnu Dr.
Combinatorial Techniques For Digital Image Charecterization And Retrieval:Algorithms,Architectures,And Applications., Arijit Bishnu Dr.
Doctoral Theses
Interest in digital images stems mostly from its application to various areas of computer vision [33, 57] and pattern recognition [145). Problems include robotic vision and con- trol, geographic and topographic map matching, target recognition, space applications, character recognition, scene analysis, fingerprint and face recognition, etc. Lately, with the advent of content-based image retrieval (CBIR) and proliferation of the Internet, digital imaging applications are in vogue now than ever before. In almost all the cases, the data size is enormously large, and at the same time, fast on-line as well as real- time computation is needed. For example, in fingerprint …
On The Approximability Of Linear Ordering And Related Np-Optimization Problems., Sounaka Mishra Dr.
On The Approximability Of Linear Ordering And Related Np-Optimization Problems., Sounaka Mishra Dr.
Doctoral Theses
We investigate approximability of both maximum and minimum linear ordering problems (MAX-LOP and MIN-LOP) and several related problems such as the well known feedback set problems, acyclie subdigraph problem and several others and their variants.We show that both MAX-LOP and MIN-LOP are strongly NP-complete, and MIN- LOP, MIN-QAP(S) (a special case of minimum quadratic assignment problem) and MIN-W-FAS are equivalent with respect to strict-reduction. The strict-equivalence is also established among these problems as well as MIN-W-FVS, with weights on arcs/vertices bounded by a polynomial, and the unweighted versions of the feedback set. problems. We also show that MAX-LOP is strict-equivalent …