Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 13 of 13
Full-Text Articles in Entire DC Network
On Three Dimensional Digital Topology And Its Application To Image Processing., Punam Kumar Saha Dr.
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.
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
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.
A Reverse Engineering Methodology For Extracting Parallelism From Design Abstractions., Ravi Chandra Erraguntla
A Reverse Engineering Methodology For Extracting Parallelism From Design Abstractions., Ravi Chandra Erraguntla
LSU Historical Dissertations and Theses
Migration of code from sequential environments to the parallel processing environments is often done in an ad hoc manner. The purpose of this research is to develop a reverse engineering methodology to facilitate systematic migration of code from sequential to the parallel processing environments. The research results include the development of a three-phase methodology and the design and development of a reverse engineering toolkit (abbreviated as RETK) which serves to establish a working model for the methodology. The methodology consists of three phases: Analysis, Synthesis, and Transformation. The Analysis phase uses concepts from reverse engineering research to recover the sequential …
A Reusability Model That Creates Design Frameworks Using A Formal Specification Clustering Approach., Youwen Ouyang
A Reusability Model That Creates Design Frameworks Using A Formal Specification Clustering Approach., Youwen Ouyang
LSU Historical Dissertations and Theses
Software reuse has been advocated as a technique with great potential to increase software development productivity, reduce development cycle time, and improve product quality. Challenges for successful reuse include populating the repository with the right type of components, representing and organizing the components in a way that the components are easy to be retrieved, and providing mechanisms to compare the candidate components with the requirement of the new component and to assist adaptation. While many existing researches are emphasizing one or two challenges, this research proposes a reusability model that targets all challenges in reuse. The inspiration for the model …
Time- And Cost-Optimal Parallel Algorithms For The Dominance And Visibility Graphs, D. Bhagavathi, H. Gurla, S. Olariu, J. L. Schwing, J. Zhang
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.
Dynamic Storage Allocation Using Simon's Model Of Information Usage., Rachelle Folse Cope
Dynamic Storage Allocation Using Simon's Model Of Information Usage., Rachelle Folse Cope
LSU Historical Dissertations and Theses
In today's rapidly changing field of Management Information Systems (MIS) one problem faced by organizations is the consumption of storage capacity due to the growing base of software assets. Research has shown that very few firms effectively monitor program usage. Storage management issues arise due to the fact that many of the programs occupying valuable storage space are used infrequently. In this dissertation, we apply Simon's model of information usage in order to model the dynamic behavior of program usage. This methodology enables organizations to identify the changing usage frequencies of software assets. We propose a classification scheme which MIS …
Designing Diagnosable Distributed Programs., Amit Anil Nanavati
Designing Diagnosable Distributed Programs., Amit Anil Nanavati
LSU Historical Dissertations and Theses
The difficulty in debugging distributed programs motivates the development of formal methods for designing distributed programs that are easier to debug and maintain. We address state identification problem for distributed systems using the finite state I/O automaton model. A state S is identified based on the unique event sequences starting at S, called distinguishing sequences. An automaton is diagnosable if every state has a distinguishing sequence. A distributed program may not be diagnosable even if its components are diagnosable. Non-dignosable automata can, in some cases, be converted to a diagnosable form by relabelling some of its transitions in a way …
Virtual Central Control., Raghuram A. Yedatore
Virtual Central Control., Raghuram A. Yedatore
LSU Historical Dissertations and Theses
A distributed system is a set of cooperating computers (processes) communicating with each other to achieve a common goal. They are broadly classified as centralized and decentralised systems. In a centralized system, a single computer plays the role of central coordinator and controls all the system activities. Whereas in a decentralized system, all the cooperating processes have an equal role to play, therefore solutions to problems involve instructing all the processes and coordinating their actions. Although a centralized system facilitates program development, it has serious drawbacks. If the coordinator fails, the system effectively breaks down. Also, the coordinator can become …
From Object-Oriented Specification To Implementation: A Formal Refinement Methodology., Moonsung Yoo
From Object-Oriented Specification To Implementation: A Formal Refinement Methodology., Moonsung Yoo
LSU Historical Dissertations and Theses
Traditionally, software development models use different methods and techniques in each phase from specification through design to implementation. Significant changes in the representations between phases have been common. The formal development method based on formal specification and stepwise development has been suggested to reduce the change in representation. The formal development method consists of a formal specification and verified design. In the formal specification step, a formal specification language is used to specify an accurate, consistent, and complete system. Vienna Development Method (VDM) is one of the most widely used formal specification languages. A verified design guides the development of …
Infrared Wireless Communication, Noor Haq
Infrared Wireless Communication, Noor Haq
Theses
Infrared wireless communication has already proven to be commercial success in the Television (TV) and Video Cassette Recorder (VCR) remote markets and is poised to become a key technology in a number of business markets. Over the next few years, we may witness an explosive growth of Infrared based "walk-up" data access and seamless indoor mobile data networking. The protocol architecture proposed by Infrared Data Association (IrDA), a non-profit organization founded in the summer of 1993, is very rapidly emerging as an industry wide infrared standard for "walk-up", point-to-point communication The paper examines the IrDA protocol model and how the …
A Search Tool To Enhance The Selection And Utilisation Of Reusable Software Modules Within The Object-Oriented Paradigm, Robert H. Cross
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 …
Putting Type Annotations To Work, Martin Odersky, Konstantin Laufer
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.