Leaders in Learning: Publications of Faculty & Staff

*The* University *of* Western Ontario

Computer Science: 1995-1996

BARRON, J.L.

**Barron, J.L., and R. Eagleson**. 1995. Motion and Structure Estimation from Long Binocular Sequences with Observer Rotation. *IEEE International Conference on Image Processing (ICIP95), Volume 2. Washington, DC*: * October 1995*. IEEE. 193-196.

**Barron, J.L., and R. Eagleson**. 1996. Recursive Estimation of Time-Varying Motion and Structure Parameters. *Pattern Recognition* 29 (5): 797-818.

**Liptay, A., J.L. Barron, T. Jewett, and I. van Wesenbeeck**. 1995. Oscillations in Corn Seedling Growth as Measured by Optical Flow. *Journal of the American Society for Horticultural Science* 120 (3): 379-385.

DUNHAM, C.

**Dunham, C.** January 1996. *Approximation by Function Differences.* Technical Report #475. Department of Computer Science, UWO: London, ON. 9 pp.

**Dunham, C.** January 1996. *Chebyshev Approximation by A*ø (Bx), II.* Technical Report #476. Department of Computer Science, UWO: London, ON. 8 pp.

**Dunham, C.** January 1996. *Chebyshev Approximation by ø (AX).* Technical Report #471. Department of Computer Science, UWO: London, ON. 5 pp.

**Dunham, C.** Janaury 1996. *Chebyshev Approximation by Exponential Differences.* Technical Report #479. Department of Computer Science, UWO: London, ON. 3 pp.

**Dunham, C.** January 1996. *Chebyshev Approximation by Logarithmic Families Vanishing at Zero.* Technical Report #473. Department of Computer Science, UWO: London, ON. 8 pp.

**Dunham, C.** January 1996. *Chebyshev Approximation by Logarithmic-Polynomial Families.* Technical Report #480. Department of Computer Science, UWO: London, ON. 5 pp.

**Dunham, C.** January 1996. *Chebyshev Approximation by Sums of Arctangents.* Technical Report #474. Department of Computer Science, UWO: London, ON. 13 pp.

**Dunham, C.** February 1996. *Concrete Approximating Forms - 1996.* Technical Report #485. Department of Computer Science, UWO: London, ON. 10 pp.

**Dunham, C.** Janaury 1996. *Degeneracy in Non-Linear Complex Mean Square and Mean Approximation.* Technical Report #478. Department of Computer Science, UWO: London, ON. 13 pp.

**Dunham, C.** January 1996. *Families Satisfying the Haar Condition.* Technical Report #472. Department of Computer Science, UWO: London, ON. 29 pp.

**Dunham, C.** February 1996. *Monotone Approximation.* Technical Report #483. Department of Computer Science, UWO: London, On. 6 pp.

**Dunham, C.** August 1995. *Nonlinear Monotone Uniform Approximation.* Technical Report #463. Department of Computer Science, UWO: London, ON. 3 pp.

**Dunham, C.** January 1996. *On Local Minima in Non-Linear Chebyshev Approximation by Watson.* Technical Report #477. Department of Computer Science, UWO: London, ON. 5 pp.

**Dunham, C.** November 1995. *Problems in Best Approximation VI.* Technical Report #469. Department of Computer Science, UWO: London, On. 4 pp.

**Dunham, C.** February 1996. *Problems VII, Observations, Publications '65-'95.* Technical Report #486. Department of Computer Science, UWO: London, ON. 25 pp.

**Dunham, C.** March 1996. *Studies in Nonlinear Approximation with Constraints.* Technical Report #490. Department of Computer Science, UWO: London, ON. 18 pp.

**Dunham, C., and C.Z. Zhu**. July 1995. *Attempt at Best 4 Exponential Approximation.* Technical Report #462. Department of Computer Science, UWO: London, ON. 9 pp.

**Dunham, C., and C.Z. Zhu**. July 1995. *A Case of Best 2 Exponential Approximation with Endpoints Deleted.* Technical Report #460. Department of Computer Science, UWO: London, ON. 6 pp.

**Dunham, C., and C.Z. Zhu**. July 1995. *Two Cases of Best 3 Exponential Approximation with One Endpoint Deleted.* Technical Report #461. Department of Computer Science, UWO: London, ON. 15 pp.

GARGANTINI, I.

**Gargantini, I., and J. Liu**. January 1996. *Pictorial Repositories for Plants: A Reference Manual, Part 1.* Technical Report #470. Department of Computer Science, UWO: London, ON. 9 pp.

**Gargantini, I., and J.-Y. Liu**. March 1996. *Progress Report on the System PLANTA.* Technical Report #489. Department of Computer Science, UWO: London, ON. 10 pp.

**Gargantini, I., and J.H.G. Redekop**. 1995. Evaluating Exact Intersections of an Octree with Full Rays Using Only Radix-Sort and Meet Operations. *Edugraphics '95 Second International Conference on Graphics Education. Alvor, Portugal*: * December 1995*. 278-284.

**Gargantini, I., T.R.S. Walsh, and T. Yiu**. February 1996. *A Theoretical Result on Star-Polygons and its Application to Triangulation.* Technical Report #481. Department of Computer Science, UWO: London, ON. 10 pp.

JÜRGENSEN, H.

**Bogue, T., M. Gössel, and H. Jürgensen**. 1995. BIST with Negligible Aliasing through Random Cover Circuits. *Proceedings of the ASP-DAC'95/CHDL'95/VLSI'95; Asia and South Pacific Design Automation Conference, IFIP International Conference on Computer Hardware Description Languages and Their Applications, IFIP International Conference on Very Large Scale Integration. Makuhari Messe, Chiba, Japan*: * 29 August 1995-1 September 1995*. IEEE. 223-228.

**Brzozowski, J.A., and H. Jürgensen**. 1996. An Algebra of Multiple Faults in RAMs. *Journal of Electronic Testing, Theory and Applications* 8: 129-142.

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

**Brzozowski, J.A., and H. Jürgensen**. 1995. Composition of Multiple Faults in RAMs. *Records of the 1995 IEEE International Workshop on Memory Technology, Design, and Testing. San Jose*: * 1995*. Los Alamitos: IEEE Computer Society Press. 123-128.

**Dassow, J., and H. Jürgensen**. 1995. The Transition Monoids of Soliton Trees. *Mathematical Linguistics and Related Topics. *G. Paun. Bucuresti: Editura Academiei Române. 76-87.

**Gécseg, F., and H. Jürgensen**. 1996. Dependence in Algebras. *Fundamenta Informaticae* 25: 247-256.

**Jürgensen, H., and S. Konstantinidis**. February 1996. *Codes.* Technical Report #484. Department of Computer Science, UWO: London, On. 87 pp.

**Jürgensen, H., and S. Konstantinidis**. 1996. Error-Correction for Chammels with Substitutions, Insertions, and Deletions. *Information Theory and Applications 2, Fourth Canadian Workshop on Information Theory. *J.-Y. Chouinard, P. Fortier, and T.A. Gulliver. Lecture Notes in Computer Science, Vol. 1133. Berlin: Springer-Verlag. 149-163.

**Jürgensen, H., and S. Konstantinidis**. October 1995. *Error Correction for Channels with Substitutions, Insertions and Deletions.* Technical Report #467. Department of Computer Science, UWO: London, ON. 14 pp.

**Jürgensen, H., and S. Konstantinidis**. 1995. Variable-Length Codes for Error Correction. *Automata, Languages and Programming, 22nd International Colloquium (ICALP95), Proceedings. *Z. Fülöp, and F. Gécseg. Lecture Notes in Computer Science, Vol. 944. Berlin: Springer-Verlag. 581-592.

**Jürgensen, H., and L. Robbins**. October 1995. *Perfect Secrecy?* Technical Report #468. Department of Computer Science, UWO: London, ON. 12 pp.

**Jürgensen, H., and L. Robbins**. 1996. Towards Foundations of Cryptography: Investigation of Perfect Secrecy. *J. UCS* 2: 347-379.

**Jürgensen, H., and L. Robbins**. June 1996. *Towards Foundations of Cryptography: Investigation of Perfect Secrecy.* Technical Report #492. Department of Computer Science, UWO: London, On. 32 pp.

**Jürgensen, H., and L. Staiger**. 1995. Local Hausdorff Dimension. *Acta Informatica* 32: 491-507.

KARI, L.

**Csuhaj-Varjú, E., L. Kari, and G. Paun**. 1996. Test Tube Distributed Systems Based on Splicing. *Computers and Artificial Intelligence* 15 (2-3): 211-232.

**Kari, L.** June 1996. DNA Computers: tomorrow's reality. *Bulletin of the European Association for Theoretical Computer Science (EATCS)* 59: 256-266.

**Kari, L., A. Mateescu, G. Paun, and A. Salomaa**. 1995. Multi-pattern languages. *Theoretical Computer Science* 141: 253-268.

**Kari, L., A. Mateescu, G. Paun, and A. Salomaa**. 1995. On Parallel Deletions Applied to a Word. *Theoretical Informatics and Applications* 29 (2): 129-144.

**Kari, L., A. Mateescu, G. Paun, and A. Salomaa**. 1995. Teams in cooperating grammar systems. *Journal of Experimental and Theoretical Artificial Intelligence* 7: 347-359.

**Kari, L., G. Rozenberg, and A. Salomaa**. 1995. Generalized DOL trees. *Acta Cybernetica* 12 (1): 1-9.

**Kari, L., and G. Thierrin**. 1995. *K* -catenation and applications: *k*-prefix codes. *Journal of Information and Optimization Sciences* 16 (2): 263-276.

**Kari, L., and G. Thierrin**. October 1995. *K*-Insertion and *K*-Deletion Closure of Languages. *Soochow Journal of Mathematics* 21 (4): 479-495.

**Kari, L., and G. Thierrin**. September 1995. Languages and Compatible Relations on Monoids. *Mathematical Linguistics and Related Topics* : 212-220.

**Kari, L., and G. Thierrin**. 1995. Languages and Monoids with Disjunctive Identity. *Collectanea Mathematica* 46 (1-2): 97-107.

**Kari, L., and G. Thierrin**. July 1995. Morphisms and Associated Congruences. *Proceedings of the Second International Conference Developments in Language Theory. *Singapore: World Scientific Publishing Company. 119-128.

**Kari, L., and G. Thierrin**. 1996. Omega-Syntactic Congruences. *Journal of Automata, Languages and Combinatorics* 1 (1): 13-26.

**Prusinkiewicz, P., and L. Kari**. 1996. Subapical Bracketed L-systems. *Graph Grammars and their Applications to Computer Science: 5th International Workshop, Selected Papers. Williamsburg, VA*: * 13 November 1994-18 November 1994*. J. Cuny, H. Ehrig, and G. Engles. Lecture Notes in Computer Science, No. 1073. New York, NY: Springer-Verlag. 550-564.

MERCER, R.E.

**Dent, M.J., and R.E. Mercer**. June 1996. *Improvements to the Minimal Forward Checking Algorithm.* Technical Report #458. Department of Computer Science, UWO: London, ON. 24 pp.

OSBORN, S.L.

**Nyanchama, M., and S.L. Osborn**. 1996. Modeling Mandatory Access Control in Role-Based Security Systems (Chapter 9). *Database Security IX: Status and Prospects. Proceedings of the Ninth Annual IFIP TC11 Working Conference on Database Security. August 1995*. D.L. Spooner, S.A. Demurjian, and J.E. Dobson. London, UK: Chapman and Hall. 129-144.

**Osborn, S.L., and L. Yu**. 1996. Unifying data, behaviours, and messages in object-oriented databases. *Data and Knowledge Engineering* 18: 29-54.

SALOMAA, A.

**Kari, L., A. Mateescu, G. Paun, and A. Salomaa**. 1995. Multi-pattern languages. *Theoretical Computer Science* 141: 253-268.

**Kari, L., A. Mateescu, G. Paun, and A. Salomaa**. 1995. On Parallel Deletions Applied to a Word. *Theoretical Informatics and Applications* 29 (2): 129-144.

**Kari, L., A. Mateescu, G. Paun, and A. Salomaa**. 1995. Teams in cooperating grammar systems. *Journal of Experimental and Theoretical Artificial Intelligence* 7: 347-359.

**Kari, L., G. Rozenberg, and A. Salomaa**. 1995. Generalized DOL trees. *Acta Cybernetica* 12 (1): 1-9.

**Mateescu, A., A. Salomaa, K. Salomaa, and S. Yu**. September 1995. P, NP, and the Post Correspondence Problem. *Information and Computation* 121 (2): 135-142.

SALOMAA, K.

**Mateescu, A., A. Salomaa, K. Salomaa, and S. Yu**. September 1995. P, NP, and the Post Correspondence Problem. *Information and Computation* 121 (2): 135-142.

**Salomaa, K., D. Wood, and S. Yu**. 1996. Structural equivalence and ETOL grammars. *Theoretical Computer Science* 164: 123-140.

**Salomaa, K., and S. Yu**. February 1996. *Loop-Free Alternating Finite Automata.* Technical Report #482. Department of Computer Science, UWO: London, ON. 12 pp.

**Salomaa, K., and S. Yu**. June 1996. *NFA to DFA Transformation for Finite Languages.* Technical Report #493. Department of Computer Science, UWO: London, ON. 10 pp.

THIERRIN, G.

**Kari, L., and G. Thierrin**. 1995. *K* -catenation and applications: *k*-prefix codes. *Journal of Information and Optimization Sciences* 16 (2): 263-276.

**Kari, L., and G. Thierrin**. October 1995. *K*-Insertion and *K*-Deletion Closure of Languages. *Soochow Journal of Mathematics* 21 (4): 479-495.

**Kari, L., and G. Thierrin**. September 1995. Languages and Compatible Relations on Monoids. *Mathematical Linguistics and Related Topics* : 212-220.

**Kari, L., and G. Thierrin**. 1995. Languages and Monoids with Disjunctive Identity. *Collectanea Mathematica* 46 (1-2): 97-107.

**Kari, L., and G. Thierrin**. July 1995. Morphisms and Associated Congruences. *Proceedings of the Second International Conference Developments in Language Theory. *Singapore: World Scientific Publishing Company. 119-128.

**Kari, L., and G. Thierrin**. 1996. Omega-Syntactic Congruences. *Journal of Automata, Languages and Combinatorics* 1 (1): 13-26.

WOOD, D.

**Raymond, D., and D. Wood**. March 1996. *The Grail Papers.* Technical Report #491. Department of Computer Science, UWO: London, ON. 172 pp.

**Salomaa, K., D. Wood, and S. Yu**. 1996. Structural equivalence and ETOL grammars. *Theoretical Computer Science* 164: 123-140.

**Schuirer, S., and D. Wood**. September 1995. *Multiple-Guard Kernels of Simple Polygons.* Technical Report #466. Department of Computer Science, UWO: London, ON. 24 pp.

**Schuirer, S., and D. Wood**. September 1995. *Visibility in Semi-Convex Spaces.* Technical Report #464. Department of Computer Science, UWO: London, ON. 24 pp.

YU, S.

**Calude, C., and S. Yu**. 1996. Language-Theoretic Complexity of Disjunctive Sequences. *CATS'96. Computing: The Australasian Theory Symposium Proceedings. Melbourne, Australia*: * 29 1996*. M.E. Houle, and P. Eades. Australian Computer Science Communications, Vol. 18, No. 3. The University of Melbourne: Australian Computer Science Communications. 175-179.

**Mateescu, A., A. Salomaa, K. Salomaa, and S. Yu**. September 1995. P, NP, and the Post Correspondence Problem. *Information and Computation* 121 (2): 135-142.

**Salomaa, K., D. Wood, and S. Yu**. 1996. Structural equivalence and ETOL grammars. *Theoretical Computer Science* 164: 123-140.

**Salomaa, K., and S. Yu**. February 1996. *Loop-Free Alternating Finite Automata.* Technical Report #482. Department of Computer Science, UWO: London, ON. 12 pp.

**Salomaa, K., and S. Yu**. June 1996. *NFA to DFA Transformation for Finite Languages.* Technical Report #493. Department of Computer Science, UWO: London, ON. 10 pp.

**Yu, S.** February 1996. *Regular Languages.* Technical Report #487. Department of Computer Science, UWO: London, ON. 76 pp.

**Yu, S., and Q. Zhuang**. 1995. Algorithmic abstraction in object-oriented languages. *Object Oriented Systems* 2: 217-236.

**Yu, S., and Q. Zhuang**. 1996. Software Reuse via Algorithmic Abstraction. *Technology of Object-Oriented Languages and Systems TOOLS 17. Proceedings of the Seventeenth International Conference TOOLS Santa Barbara 1995. Santa Barbara*: R. Ege, M. Singh, and B. Meyer. Toronto, ON: Prentice Hall. 277-292.

**Zhuang, Q., and S. Yu**. 1996. Program Reuse via Kind-Bounded Polymorphism. *Journal of Computing and Information* 2 (1): 1163-1181. Special Issue: Proceedings of Eighth International Conference of Computing and Information (ICCI'96), University of Waterloo, Waterloo, Ontario, Canada, June 19-22, 1996.

ZHU, C.Z.

**Dunham, C., and C.Z. Zhu**. July 1995. *Attempt at Best 4 Exponential Approximation.* Technical Report #462. Department of Computer Science, UWO: London, ON. 9 pp.

**Dunham, C., and C.Z. Zhu**. July 1995. *A Case of Best 2 Exponential Approximation with Endpoints Deleted.* Technical Report #460. Department of Computer Science, UWO: London, ON. 6 pp.

**Dunham, C., and C.Z. Zhu**. July 1995. *Two Cases of Best 3 Exponential Approximation with One Endpoint Deleted.* Technical Report #461. Department of Computer Science, UWO: London, ON. 15 pp.