The basic building blockss of all graphical output are primitives such as polyline, polymarker, text, cell array and fill area. These primitives have additional data associated with them to render visual effect on the display surface of a workstation. I have explored and analyzed these primitives and implemented them by routines written in C language for IBM and IBM Compatible Personal Computers. Some of the algoriths for these routines were integrated and implemented in the Extensible Graphics Software(EGS). EGS is a prototype graphics system developed by the faculty and students of Ball State University to study and research graphics systems.I have created a font for English alphabets and digit characters. The font and any algorithms created in this thesis would be included and implemented for further development of EGS.An effective attempt is made in this thesis to show how a graphics system could be developed with a minimal dependency on hardware of computers. / Department of Computer Science

Ray tracing is a very powerful yet simple approach to image synthesis. It has generated some of the most realistic scenes to date. A comparative study of classical ray tracing, ray tracing with cones, and distributed ray tracing is made.The ray tracing techniques, classical ray tracing, ray tracing with cones, and distributed ray tracing, are explained, their differences are emphasized, and their approaches to modeling various lighting effects are explained and compared. / Department of Computer Science

Software development for both compositional systems and computer graphics has been extensive in the computer music field. Compositional systems employ different techniques in supporting the global strategies of composers, and they require alphanumeric input. Programs in computer graphics have been concerned primarily with the representation of common music notation. A System for Interactive Music Composition Through Computer Graphics was developed to provide a composer with an interactive, compositional, graphics environment.Musical constructs are not depicted in the system through common music notation, but through line-segment graphs. Since music is a temporal art, any musical parameter can be represented as a function of time. The process of visually/aurally perceiving structure is enhanced by using graphs instead of strings or tables of numbers as traditionally used in computer music. There are also no notational restrictions on frequency and rhythm like those encountered with common music notation. The system provides a way for the composer to organize the large amount of data needed in computer music composition.There are visual transformations in computer graphics which correlate to aural transformations in music. Algorithms for translation, scaling, and rotation support the musical transformations of transposition, augmentation, diminution, inversion, retrograde, and retrograde-inversion. The windowing algorithm is used throughout the system for inserting and extracting structures. This algorithm is also used in editing a portion of a structure in which that section is displayed on the graph for a finer level of detail. Structures can be created through entering points interactively, generating transformations of an existing structure, realizing a statistical distribution, or extracting a section from an existing structure. Editing possibilities include inserting or deleting points, lines, and curves, inserting one structure within another, or generating transformations of one structure within each line segment of another. These options help make the system both efficient and flexible.When the composer becomes familiar with the system, a large amount of data can be generated in a short time. It is a very powerful tool for organizing and manipulating musical constructs. The system can be used with relative ease by beginning as well as advanced composers.

<p> Keeping track of requirements from eliciting data to making decision needs an effective path from data to decision [43]. Visualization science helps to create this path by extracting insights from flood of data. Model helps to shape the transformation of data to visualization. Defect Detection and Prevention model was created to assess quality assurance activities. We selected DDP and started enhancing user interactivity with requirements visualization over basic DDP with implementing a visual requirements analytics framework. By applying GQM table to our framework, we added six visualization features to the existing visual requirements visualization approaches. We applied this framework to technical and non-technical stakeholder scenarios to gain the operational insights of requirements-driven risk mitigation in practice. The combination of the first and second scenarios' result presented the multiple stakeholders scenario result which was a small number of strategies from kept tradespase with common mitigations that must deploy to the system.</p>

<p> In recent years there has been a proliferation of research on a number of wireless multi-hop networks that include mobile ad-hoc networks, wireless mesh networks, and wireless sensor networks (WSNs). Routing protocols in such networks are often required to meet design objectives that include a combination of factors such as throughput, delay, energy consumption, network lifetime etc. In addition, many modern wireless networks are equipped with multi-channel radios, where channel selection plays an important role in achieving the same design objectives. Consequently, addressing the routing problem together with <i>cross-layer</i> adaptations such as channel selection is an important issue in such networks. In this work, we study the joint routing and channel selection problem that spans two domains of wireless networks. The first is a cost-effective and scalable wireless-optical access networks which is a combination of high-capacity optical access and unethered wireless access. The joint routing and channel selection problem in this case is addressed under an anycasting paradigm. In addition, we address two other problems in the context of wireless-optical access networks. The first is on optimal gateway placement and network planning for serving a given set of users. And the second is the development of an analytical model to evaluate the performance of the IEEE 802.11 DCF in radio-over- fiber wireless LANs. The second domain involves resource constrained WSNs where we focus on route and channel selection for network lifetime maximization. Here, the problem is further exacerbated by distributed power control, that introduces additional design considerations. Both problems involve cross-layer adaptations that must be solved together with routing. Finally, we present an analytical model for lifetime calculation in multi-channel, asynchronous WSNs under optimal power control.</p>

<p> Provisioning of rich routing building blocks to mobile ad-hoc networking applications has been of high interest. Several multi-hop wireless network applications need flexibility in describing paths their traffic will follow. To accommodate this need, previous work has proposed several viable routing schemes such as Dynamic Source Routing (DSR) and Trajectory-Based Routing (TBR). However, tradeoffs involved in the interaction of these routing schemes and the application-specific requirements or constraints have not been explored. Particularly, techniques to help the application to do the right routing choices based on a desired metric are much needed. Depending on the application's goals, routing choices should be steered for different metrics rather than the traditional notion of shortest-path in terms of distance. For instance, obstacle or hostility avoidance would require "accurate" paths, end-to-end traffic engineering/balancing would require "minimum utilization" paths, low delay routing for multimedia traffic would require "short distance" paths, and, finally, low loss routing for reliable end-to-end transfers would require "minimum congestion" paths. Our focus in this dissertation is the "accuracy" of paths. </p><p> First, we consider techniques that minimize routing protocol state costs under application-based constraints. We study the constraint of "accuracy" of the application's desired route, as this constraint provides a range of choices to the applications. As a crucial part of this optimization framework, we investigate the tradeoff between the packet header size and the network state. We, then, apply our framework to the case of TBR with application-based accuracy constraints in obeying a given trajectory and show that approximating trajectories under such accuracy constraints is NP-hard. We develop heuristics solving this problem and illustrate their performance. </p><p> Second, we take our TBR framework to a more general solution by adding automated trajectory generator and end-to-end traffic engineering support. We focus on the context of multi-hop wireless protocols for which application-specific needs are emphasized along with a highly dynamic underlying network environment. We propose a framework supporting a standardized way of interfacing between the network routing and the wireless applications. We use this framework to develop a roadmap-based trajectory planning scheme to engineer the end-to-end traffic over multi-hop wireless networks. We illustrate how our roadmap-based approach can automate the process of planning/selecting the trajectories so that better balancing of the traffic is achieved. We compare our roadmap-based trajectory planning approach to its shortest-path routing counterpart, Greedy Parameter Stateless Routing (GPSR), and show that beneficial tradeoffs can be attained.</p>

As modern information systems become more complex, linking up multiple and divers users from different organizations distributed around the globe, system documentation such as the Software Requirements Specification (SRS) have, correspondingly, become more technical and bulky. Consequently, project stakeholders become less motivated to read such documents and participate in project activities thus impacting on the success of the project Hence, this study aims at obtaining s clearer understanding of this project management challenge by examinig how stakeholders view the relevance of SRS contents. / Thesis (DBusinessAdministration)--University of South Australia, 2007.

Thesis (PhDBusinessandManagement)--University of South Australia, 2002.

Thesis (M.F.A.)--Rochester Institute of Technology, 1989. / Includes bibliographical references (leaves 56-57).

Thesis (M.F.A.)--Rochester Institute of Technology, 1989. / Includes bibliographical references (leaves 29-32).