Recent advances in multicasting present new opportunities for improving communication performance for clusters of workstations. The standard IP multicast, however, only supports unreliable multicast, which is diffcult to use for building high level message passing routines. Thus, reliable multicast primitives must be implemented over the standard IP multicast to facilitate the use of multicast for high performance communication on clussters of workstations. In this paper, we present the design, implementation, and evaluation of a reliable multicast protocol, called M-ary Tree-based Reliable Multicast Protocol(MTRMP), that we develop for efficient reliable multicast on Ethernet switched clusters. MTRMP eliminates the ACK-implosion problem and achieves scalability by organizing receivers in a logical tree structure. To achieve high throughput, MTRMP distributes the error recovery task to receivers and allows the sender to move ahead without ensuring that all receivers receive a packet. The results of our evaluation show that MTRMP performs better than other existing reliable multicast protocols on Ethernet switched networks. / A Thesis submitted to the Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Science. / Degree Awarded: Summer Semester, 2003. / Date of Defense: July 3, 2003. / ACK-Implosion, Improved Communication Performance / Includes bibliographical references. / Xin Yuan, Professor Directing Thesis; Xiuwen Liu, Committee Member; Robert van Engelen, Committee Member.

As the gap between CPU speed and memory speed widens, it is appropriate to investigate alternative storage systems. One approach is to use a large data register file. Registers, in general, offer several advantages when accessing data, including: faster access time, accessing multiple values in a single cycle, reduced power consumption, and small indices. Traditionally, registers only have been used to hold the values of scalar variables and temporaries; this necessarily excludes global structures and in particular arrays, which tend to exhibit high spatial locality. Although large register files have been explored, prior studies did not resolve complexities that limited their usefulness. In this thesis, we present a large data register file, which employs block movement of registers for efficient access and is able to support composite data structures, such as arrays and structs. The performance benefits realized – from this approach – include access to data values earlier in the pipeline, removal of many loads and stores, decreased contention within the data cache, and decreased energy consumption. / A Thesis submitted to the Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Science. / Degree Awarded: Fall Semester, 2006. / Date of Defense: September 29, 2006. / Memory Hierarchy, Compiler, Register File / Includes bibliographical references. / David Whalley, Professor Co-Directing Thesis; Gary Tyson, Professor Co-Directing Thesis; Xin Yuan, Committee Member.

This thesis describes the Language Abstraction for Rule-based Knowledge-systems (LARK) Engine. The goal of this engine is to process various expert system rulesets and generate the required semantics for multiple production systems – thus creating true portability for expert systems such as M.1 and CLIPS. Specifically, LARK provides ruleset translation from Lark Markup Language (LarkML, an XML language defined herein), to CLIPS and M.1 expert system rules, as well as an implementation of rules written in natural language. LARK also demonstrates the ability to parse and convert basic CLIPS and M.1 rules to LarkML. In addition to describing the LARK Engine, this thesis also outlines an overview of significant expert system, UML, and business ruleset portability efforts. Ruleset portability is quickly evolving as the combined efforts of many organizations push the technology forward. Significant ruleset portability efforts include the Production Rule Representation (PRR) as defined by the Object Management Group (OMG), the Rule Interchange Format (RIF) as specified by W3C, the Rule Markup Language (RuleML) Initiative composed of a large group of industry and academia participants, and the Natural Rule Language (NRL), an effort sponsored by SourceForge. / A Thesis submitted to the Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Science. / Degree Awarded: Fall Semester, 2008. / Date of Defense: October 28, 2008. / CLIPS, M.1, XSL Transform, XML, LarkML, LARK, Ruleset Conversion, Ruleset Portability, Expert Systems / Includes bibliographical references. / R. C. Lacher, Professor Directing Thesis; Daniel G. Schwartz, Outside Committee Member; Sara F. Stoecklin, Committee Member.

Instant messaging has been and still is a revolutionary technology, bringing people in communication with each other faster and easier. Its characteristic as sending messaging in real-time make it even more appealing than e-mail itself. It is of no surprise then that it is a popular application found not only in personal computers, but portable and mobile devices. While it contains rich and exciting features such as the ability to monitor the status of friends or to send other forms of data besides text, it lacks one important security feature: confidentiality. Messages that are transferred are not protected in any way. With the availability of network sniffers and related programs that can capture this data, anyone with access to the network can read these messages. In addition, the fact that companies have adopted this technology and employees share confidential information make this an even greater threat. We propose a framework and method that secures and fortifies the instant messaging design. This combines an elliptic curve integrated encryption scheme and an identity-based, centralized public key infrastructure to ensure that privacy is preserved. This thesis provides a thorough overview of the cryptographic concepts necessary to discuss these two powerful components, while a sample implementation verifies its feasibility. In the end, several goals are fulfilled. The first is that the current structure of instant messaging have not changed. Second, this new system handles a range of hardware capabilities, from desktop PCs to PDAs. Finally, when put in action, the system works transparently, making its confidentiality feature a default setting for a popular form of communication. / A Thesis submitted to the Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Science. / Degree Awarded: Spring Semester, 2008. / Date of Defense: January 30, 2008. / Instant Messaging, Ecc, Elliptic Curve Cryptography, Java, IM Ecies, Yahoo, Elliptic Curve Integrated Encryption Scheme / Includes bibliographical references. / Mike Burmester, Professor Directing Thesis; Alec Yasinsac, Committee Member; Sudhir Aggarwal, Committee Member.

Biological databases are growing at an exponential rate. Designing algorithms to deal with the inherent redundancy in these databases which can cope with the overwhelming amount of data returned from similarity searches is an active area of research. This paper presents an overview of a real-world problem related to biological database searching, outlining how a human expert solves this problem. Then, several bioinformatics approaches are presented from the literature, forming a "utility belt" which might be used to solve the problem computationally. / A Thesis submitted to the Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Science. / Degree Awarded: Spring Semester, 2003. / Date of Defense: April 1, 2003. / Biological Databases, Bioinformatics / Includes bibliographical references. / Robert van Engelen, Professor Directing Thesis; David Swofford, Committee Member; Theodore Baker, Committee Member; Steven M. Thompson, Committee Member.

Source: Dissertation Abstracts International, Volume: 31-09, Section: B, page: 5308. / Thesis (Ph.D.)--The Florida State University, 1970.

Source: Dissertation Abstracts International, Volume: 31-09, Section: B, page: 5309. / Thesis (Ph.D.)--The Florida State University, 1970.

No description available.

No description available.

No description available.