Leaders in Learning: Publications of Faculty & Staff

*The* University *of* Western Ontario

Computer Science: 1997-1998

ANDREWS, J.

**Andrews, J.** 1997. Executing Formal Specifications by Translation to Higher Order Logic Programming. *Theorem Proving in Higher Order Logics. 10th International Conference, TPHOLs '97, Proceedings. Murray Hill, NJ*: * August 1997*. E.L. G
unter, and A. Felty. Lecture Notes in Computer Science, 1275. Springer Verlag. 17-32.

**Andrews, J.** 1997. A Logical Semantics for Depth-First Prolog with Ground Negation. *Theoretical Computer Science* 184: 105-143.

**Andrews, J. ** 1998. *Theory and Practice of Log File Analysis.* Technical Report #524. Department of Computer Science, The University of Western Ontario: London, ON. 41 pp.

**Andrews, J., N.A. Day, and J.J. Joyce**. 1997. Using a Formal Description Technique to Model Aspects of a Global Air Traffic Telecommunications Network (Chapter 26). *Formal Description Techniques and Protocol Specification, Testing and Verifica
tion. International Federation for Information Processing (IFIP) TC6 WG6.1 Joint International conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (
PSTV XVII). Osaka, Japan*: * 18 November 1997-21 November 1997*. T. Mizuno, N. Shiratori, T. Higashino, and A. Togashi. London: Chapman & Hall. 417-432.

DUNHAM, C.

**Dunham, C. ** 1998. *Betweeness and Interpolation.* Technical Report #510. Department of Computer Science, The University of Western Ontario: London, ON. 6 pp.

**Dunham, C. ** 1998. *Difficulties In Interpolatary Processes on Computers.* Technical Report #515. Department of Computer Science, The University of Western Ontario: London, ON. 1 pp.

**Dunham, C. ** 1998. *A Difficulty With Integrating Approximating Families, II.* Technical Report #514. Department of Computer Science, The University of Western Ontario: London, ON. 1 pp.

**Dunham, C. ** 1997. *Failure of Monotonicity.* Technical Report #505. Department of Computer Science, The University of Western Ontario: London, ON. 2 pp.

**Dunham, C. ** 1998. *Failure of Monotonicity.* Technical Report #516. Department of Computer Science, The University of Western Ontario: London, ON. 3 pp.

**Dunham, C. ** 1997. *Fitting Approximations With Fixed Components at Zero.* Technical Report #508. Department of Computer Science, The University of Western Ontario: London, ON. 2 pp.

**Dunham, C. ** 1998. *Problems in Best Approximation, X.* Technical Report #511. Department of Computer Science, The University of Western Ontario: London, ON. 4 pp.

**Dunham, C. ** 1998. *Problems in Best Approximation, XI.* Technical Report #520. Department of Computer Science, The University of Western Ontario: London, ON. 1 pp.

**Dunham, C. ** 1998. *Problems in Best Approximation, XI, Revised.* Technical Report #525. Department of Computer Science, The University of Western Ontario: London, ON. 2 pp.

**Dunham, C. ** 1998. *Problems in Best Approximation, XII.* Technical Report #526. Department of Computer Science, The University of Western Ontario: London, ON. 1 pp.

**Dunham, C. ** 1997. *Some Ill-Posed Best Approximation Problems.* Technical Report #502. Department of Computer Science, The University of Western Ontario: London, ON. 32 pp.

**Dunham, C. ** 1998. *Truth in Numerical Programming.* Technical Report #519. Department of Computer Science, The University of Western Ontario: London, ON. 4 pp.

**Dunham, C. ** 1998. *Wilkinson-Type Error Analysis Applied to Double-Precision Accumulation Under Contamination.* Technical Report #512. Department of Computer Science, The University of Western Ontario: London, ON. 4 pp.

**Dunham, C. ** 1997. *Writing a Monotone (Convex) Subroutine.* Technical Report #504. Department of Computer Science, The University of Western Ontario: London, ON. 3 pp.

**Dunham, C. ** 1997. *Writing a Monotone Subroutine.* Technical Report #503. Department of Computer Science, The University of Western Ontario: London, ON. 2 pp.

GARGANTINI, I.

**Gargantini, I., and J.-Y. Liu**. 1998. Finding Voxels Shared by a Ray and a Linear Octree. *8th International Colloquium on Differential Equations. Plovdiv, Bulgaria*: D. Bainov. VSP. 179-185.

**Gargantini, I., and L.-Y. Liu. ** 1997. *Finding the Voxels Shared by a Ray and a Linear Octree.* Technical Report #506. Department of Computer Science, The University of Western Ontario: London, ON.

**Gargantini, I., and L.-Y. Liu. ** 1997. *Lists of Displayable Voxels and Footprints for Linear Octrees.* Technical Report #507. Department of Computer Science, The University of Western Ontario: London, ON.

JÜRGENSEN, H.

**Bogue, T., M. Gössel, H. Jürgensen, and Y. Zorian. ** 1997. *Built-in Self-Test with an Alternating Output.* Technical Report #509. Department of Computer Science, The University of Western Ontario: London, ON. 7 pp.

**Brzozowski, J., and H. Jürgensen**. 1996. Applications of Automata and Languages to Testing. *Publicationes Mathematicae Debrecen* 48 (3-4): 201-215.

**David, R., J. Brzozowski, and H. Jürgensen**. 1997. Testing for Bounded Faults in RAMs. *Journal of Electronic Testing: Theory and Applications* 10: 197-214.

**de Carvalho, J.W.W., and H. Jürgensen. ** 1998. *Dynamic Multi-Purpose Mathematics Notation.* Technical Report #521. Department of Computer Science, The University of Western Ontario: London, ON. 14 pp
.

**Jürgensen, H., and S. Konstantinidis**. 1997. Codes. *Handbook of Formal Languages, Vol. 1: Word, Language, Grammar. *G. Rozenberg, and A. Salomaa. Berlin: Springer-Verlag. 511-607.

MERCER, R.

**Merkle, L., and R. Mercer**. 1997. Cognitive Science, Human-Computer Interaction and Semiotics: Subliming multifolded boundaries. *Proceedings of 6th Congress of the International Association for Semiotic Studies. *

**Silver, D., and R. Mercer. ** 1998. *The Functional Transfer of Knowledge Using a Measure of Relatedness.* Technical Report #518. Department of Computer Science, The University of Western Ontario: London, ON.

**Silver, D., and R. Mercer**. 1998. The Parallel Transfer of Task Knowledge Using Dynamic Learning Rates Based on a Measure of Relatedness (Chapter 9). *Learning to Learn. *S. Thrun, and L. Pratt. Boston, Mass.: Kluwer Academic Publishers. 21
3-233.

**Silver, D., and R. Mercer. ** 1998. *The Task Rehearsal Method of Sequential Learning.* Technical Report #517. Department of Computer Science, The University of Western Ontario: London, ON. 38 pp.

**Silver, D., R. Mercer, and G. Hurwitz. ** 1998. *The Functional Transfer of Knowledge for Coronary Artery Disease Diagnosis.* Technical Report #513. Department of Computer Science, The University of Western Ontario: London, ON. 20 pp.

OSBORN, S.

**Hua, L., and S. Osborn**. 1998. Modeling UNIX Access Control with a Role Graph. *ICCI'98: The 9th International Conference on Computing and Information. Winnipeg, Manitoba*: * 17 June 1998-20 June 1998*. K. Karlapalem, A.Y. Noaman, and K.
Barker. 131-138.

**Osborn, S.** 1997. Mandatory Access Control and Role-Based Access Control Revisited. *Proceedings of Second ACM Workshop on Role-Based Access Control. Fairfax, Virginia*: * 6 November 1997-7 November 1997*. New York, NY: Association for
Computing Machinery (ACM) Special Interest Group in Security, Audit, and Control (SIGSAC). 31-40.

SALOMAA, K.

**Mateescu, A., K. Salomaa, and S. Yu**. 1997. Decidability of Fairness for Context-free Languages. *Proceedings of the Third International Conference on Developments in Language Theory, DLT'97. Thessaloniki, Greece*: * 20 July 1997-23 July 199
7*. S. Bozapalidis. Aristotle University of Thessaloniki. 351-364.

**Rahonis, G., and K. Salomaa**. 1997. Hierarchies of Synchronized and Algebraic Forests. *Proceedings of the Third International Conference on Developments in Language Theory, DLT'97. Thessaloniki, Greece*: * 20 July 1997-23 July 1997*.
S. Bozapalidis. Artistotle University of Thessaloniki. 447-460.

**Salomaa, K., X. Wu, and S. Yu**. 1997. Efficient Implementation of Regular Languages Using R-AFA. *Automata Implementation: Second International Workshop on Implementing Automata, WIA'97. London, Ontario*: * September 1997*. D. Wood, an
d S. Yu. Lecture Notes in Computer Science, 1436. Springer Verlag. 176-184.

**Salomaa, K., and S. Yu**. 1997. NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets. *Journal of Automata, Languages and Combinatorics* 2 (3): 177-186.

**Salomaa, K., and S. Yu**. 1997. Rewriting Rules for Synchronization Languages. *Structures in Logic and Computer Science. A Selection of Essays in Honor of A. Ehrenfeucht. *J. Mycielski, G. Rozenberg, and A. Salomaa. Springer Verlag. 322-338
. Lecture Notes in Computer Science, 1261.

WU, X.

**Salomaa, K., X. Wu, and S. Yu**. 1997. Efficient Implementation of Regular Languages Using R-AFA. *Automata Implementation: Second International Workshop on Implementing Automata, WIA'97. London, Ontario*: * September 1997*. D. Wood, and S
. Yu. Lecture Notes in Computer Science, 1436. Springer Verlag. 176-184.

YU, S.

**Calude, C., E. Calude, K. Svozil, and S. Yu**. 1997. Physical Versus Computational Complementarity. I. *Intermational Journal of Theoretical Physics* 36 (7): 1495-1523.

**Calude, C., and S. Yu**. 1997. Language-theoretic complexity of disjunctive sequences. *Discrete Applied Mathematics* 80: 203-209.

**Mateescu, A., K. Salomaa, and S. Yu**. 1997. Decidability of Fairness for Context-free Languages. *Proceedings of the Third International Conference on Developments in Language Theory, DLT'97. Thessaloniki, Greece*: * 20 July 1997-23 July
1997*. S. Bozapalidis. Aristotle University of Thessaloniki. 351-364.

**Salomaa, K., X. Wu, and S. Yu**. 1997. Efficient Implementation of Regular Languages Using R-AFA. *Automata Implementation: Second International Workshop on Implementing Automata, WIA'97. London, Ontario*: * September 1997*. D. Wood, an
d S. Yu. Lecture Notes in Computer Science, 1436. Springer Verlag. 176-184.

**Salomaa, K., and S. Yu**. 1997. NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets. *Journal of Automata, Languages and Combinatorics* 2 (3): 177-186.

**Salomaa, K., and S. Yu**. 1997. Rewriting Rules for Synchronization Languages. *Structures in Logic and Computer Science. A Selection of Essays in Honor of A. Ehrenfeucht. *J. Mycielski, G. Rozenberg, and A. Salomaa. Springer Verlag. 322-338
. Lecture Notes in Computer Science, 1261.