Thesis (M.S.)--Georgia State University, 2006. / Rajshekhar Sunderraman, committee chair; Sushil Prasad, Alex Zelikovsky, committee members. Electronic text (58 p.) : digital, PDF file. Description based on contents viewed Aug. 13, 2007. Includes bibliographical references (p. 58).

Thesis (D. Ed.)--Ball State University, 2008. / Title from PDF t.p. (viewed on Nov. 09, 2009). Includes bibliographical references (p. 116-118).

Report (M.S.)--Virginia Polytechnic Institute and State University, 1994. / Abstract. Includes bibliographical references (leaf 36). Also available via the Internet.

A number of essential issues in translating Smalltalk to Java are addressed. The fIrst chapter gives a brief overview of Smalltalk and Java with respect to the relevant language features that will be translated. In the next section a convention is proposed for mapping Smalltalk method selectors to Java method names. The dynamic nature of Smalltalk instance methods is compared with Java's static type model as well as a solution to simulate the dynamic nature of Smalltalk in Java. A Java class hierarchy that parallels the Smalltalk class hierarchy (including the metaclass objects) is suggested. A further proposal is given for translating the dynamic attributes of Smalltalk class methods to the same behaviour to Java. These proposals are used to support ways of mapping both Smalltalk instance methods, as well as Smalltalk class methods to their Java counterparts. Ways of translating Smalltalk class variables, Smalltalk class instance variables and Smalltalk global variables are illustrated. A method for translating Smalltalk blocks to Java inner classes is implemented using Java exceptions to unwind the call stack. Various types of Small talk blocks are translated with increasing complexity. The various types of blocks translated are simple blocks; blocks with references to variables in the enclosing context; blocks with block arguments; blocks that need to refer to their own context executed from other contexts; blocks with multiple exit points as well as nested blocks. Some performance tests to illustrate the impact of using exceptions in Java are also reported. The next section introduces the Small talk grammar with the necessary productions used to implement a parser. Lexical and syntax analysis are explained. A brief overview of a recursive descent parser is given where an example of Smalltalk source code is parsed and all the relevant parse nodes illustrated. The encoding in each parse node to Java source is shown. The last section focuses on similar initiatives being pursued and compares the solutions in the dissertation against them. This dissertation focuses on key areas of the Smalltalk to Java translation process, but a few peculiar and unique Smalltalk features are not addressed. These are discussed in the last section and some suggestions are made on how the translations can be achieved. / Dissertation (MSc (Computer Science))--University of Pretoria, 2006. / Computer Science / unrestricted

No description available.

The purpose of this research report is to compare two simulation languages; GASP and GPSS. An economical comparison was performed by simulating the same system in each language and examine parameters such as run time, core size, program time, and debug time. A statistical comparison of the results of the system simulation was also performed using a 90% confidence level testing procedure. The system simulated was the proposed Orlando Police Department Automatic Vehicle Locator (AVL) Operational System.

Thesis (M.Sc. (Computer Science)) - Rhodes University, 2008.

Call number: LD2668 .T4 1985 B62 / Master of Science

Implementation of the Fletcher-Reeves optimization strategy into the GOSPEL optimization package is examined. An explanation of the GOSPEL package is provided, followed by the presentation of the Fletcher-Reeves strategy. Performance of all strategies in the updated GOSPEL package are compared for nine test cases. A user manual for GOSPEL operation as well as the source code are also included.

No description available.