Computer Science Technical Reports
2000
- CS-2000-1 (pdf)
Title Implementations of Bidirectional Reordering Algorithms Authors Steve Atkin and Ryan Stansifer Contact Email Address Faculty Sponsor Ryan Stansifer TR number assignment date October 4, 2000 Abstract
The goal of this paper is to contribute to a deeper understanding of the Unicode Bidirectional Reference Algorithm. We have provided an alternative reference algorithm written in the functional language Haskell. The advantage of Haskell is it allows for a short, clear description of a complex problem.
We have run our algorithm, the two Unicode reference implementations, and the four others (ICU, PGBA, FriBidi, JDK 1.2) to test for compliance with the published standard. Conclusions are difficult to reach, but problems were found in the implementations and descriptions and above all with a character-stream to character-stream interpretations of the display of bidirectional text.
-
CS-2000-2 (pdf)
Abstract
Client-server software is becoming more common as the Internet grows. To ease the burden of repeatedly writing low-level communication and protocol code, we seek to design a protocol language, My Simple Protocol Language (MSPL), that produces the corresponding communication functions. The programmer then supplies the rest of the application-specific code but never modifies the generated code. Besides saving development time, this approach also reduces programming errors. The potential to develop more efficient code also exists once the technique of generating code is mastered. The main contribution, however, is that unlike RPC, Corba or RMI, we provide the user with not only functions that take care of lower level communication data structures, but also the ordering and format of messages (protocol) which are specified in MSPL programs. The MSPL programs are then passed to the MSPL Compiler, which produces the low-level communication and protocol modules. These protocol modules are then linked to other user-written modules to produce the final software application.
-
CS-2000-3 (pdf)
Title Enabling Mobile Agents Communication Authors Mohammad Samarah and Philip Chan Contact Email Address
Faculty Sponsor Philip Chan TR number assignment date October 23, 2000 Abstract
In this paper, we investigate the need for well-suited remote communication architectures to address communication issues in mobile agent environments. We study the implication of mobility for agent architectures - specifically, ways in which the architecture may facilitate agent communication. We present an architecture for inter-agent communication suitable for remote messaging, agent monitoring, agent tracing, and agent debugging for mobile agent environments. The architecture allows for the dynamic adaptation of communication components. It provides for a seamless and continuous active communication during the agent migration process. We have implemented an agent framework simulator that conforms to all these requirements. The paper presents the results illustrating the framework dynamic behavior.
Keywords: Agent models and architectures, mobile agents, communication languages and protocols, performance evaluation, distributed location registry.