Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 6 of 6

Full-Text Articles in Physical Sciences and Mathematics

On Three Dimensional Digital Topology And Its Application To Image Processing., Punam Kumar Saha Dr. Jul 1996

On Three Dimensional Digital Topology And Its Application To Image Processing., Punam Kumar Saha Dr.

Doctoral Theses

Digital topology provides a sound mathematical basis for object classification, counting and labeling, border tracking, contour filling, thinning, segmentation and many other image processing applications. An important characteristic of topo- logical properties is that they are invariant under translation, rotation, and more generally under any elastic deformation. The analysis of three dimensional (3D) digital images has generated increasing interest with the rapid growth of 3D image processing applications including computer vision. 3D digital images are common input/output media in the several application domains of image processing, pattern recognition and computer vision among which 3D medical imaging is of particular interest. …


Design,Analysis And Routing In Static Interconnection Networks., Rajib Kumar Das Dr. Jul 1996

Design,Analysis And Routing In Static Interconnection Networks., Rajib Kumar Das Dr.

Doctoral Theses

Many real-life applications such as image processing, weather forecasting, digital signal processing, etc., require large amount of computations. By distributing the task among several processors, one can appreciably reduce the computation time. To solve complex problems, several computer architectures using multiple processors have been introduced. Recent developments in IC technology have made it economically feasible to construct multiple processor systems consisting of hundreds or thousands of processors.There are two types of multiprocessor systems (PS87). One is tightly coupled, where the processors share a common clock and/or memory. The other is loosely coupled, where each processor runs independently with a local …


Teaching Ethical Issues In Computer Science: What Worked And What Didn't, Kay G. Schulze, Frances Grodzinsky Mar 1996

Teaching Ethical Issues In Computer Science: What Worked And What Didn't, Kay G. Schulze, Frances Grodzinsky

School of Computer Science & Engineering Faculty Publications

It is the role of computer science educators to ensure that students have a firm foundation in the social and ethical issues of the discipline.


Putting Type Annotations To Work, Martin Odersky, Konstantin Laufer Jan 1996

Putting Type Annotations To Work, Martin Odersky, Konstantin Laufer

Computer Science: Faculty Publications and Other Works

We study an extension of the Hindley/Milner system with explicit type scheme annotations and type declarations. The system can express polymorphic function arguments, user-defined data types with abstract components, and structure types with polymorphic fields. More generally, all programs of the polymorphic lambda calculus can be encoded by a translation between typing derivations. We show that type reconstruction in this system can be reduced to the decidable problem of first-order unification under a mixed prefix.


Time- And Cost-Optimal Parallel Algorithms For The Dominance And Visibility Graphs, D. Bhagavathi, H. Gurla, S. Olariu, J. L. Schwing, J. Zhang Jan 1996

Time- And Cost-Optimal Parallel Algorithms For The Dominance And Visibility Graphs, D. Bhagavathi, H. Gurla, S. Olariu, J. L. Schwing, J. Zhang

Computer Science Faculty Publications

The compaction step of integrated circuit design motivates associating several kinds of graphs with a collection of non-overlapping rectangles in the plane. These graphs are intended to capture various visibility relations amongst the rectangles in the collection. The contribution of this paper is to propose time- and cost-optimal algorithms to construct two such graphs, namely, the dominance graph (DG, for short) and the visibility graph (VG, for short). Specifically, we show that with a collection of n non-overlapping rectangles as input, both these structures can be constructed in θ (log n) time using n processors in the CREW model.


A Search Tool To Enhance The Selection And Utilisation Of Reusable Software Modules Within The Object-Oriented Paradigm, Robert H. Cross Jan 1996

A Search Tool To Enhance The Selection And Utilisation Of Reusable Software Modules Within The Object-Oriented Paradigm, Robert H. Cross

Theses: Doctorates and Masters

The affinity for reuse within the object-oriented paradigm may enable high levels of productivity; however, gains will become realisable only if a systems developer has access to tools which aid in the selection of classes. A method for object-oriented analysis and design is detailed and its process is assisted by an object-oriented search tool based on reference and corporate library technology. The search tool contributes to the determination of suitable existing inheritable classes and an explanation of its construction and use is included. A practical demonstration of the method, using the search tool, is elaborated. The thesis demonstrates that text …