Leaders in Learning: Publications of Faculty & Staff

ANDREWS, J.H.

Andrews, J.H. 2001. Process-Algebraic Foundations of Aspect-Oriented Programming. Metalevel Architechtures and Separation of Crosscutting Concerns. A. Yonezawa, and S. Matsuoka. Springer. 187-209.
 
 

BARRON, J.L.

Barron, J.L., and R. Klette. 2001. Experience with Optical Flow in Colour Vido Image Sequences. Image and Vision Computing 2001(ICVNZ2001). Aukland, New Zealand: 195-200.

Chen, X., J.L. Barron, R.E. Mercer, and P. Joe. 2001. 3D Regularized Velocity from 3D Doppler Radial Velocity. International Conference on Image Processing 2001 3: 664-667.

Chen, Y., D.H. Barron, D.H. Taves, and R.E. Martin. 2001. Computer measurement of oral movement in swallowing. Dysphagia 16: 97-109.

Mercer, R.E., J.L. Barron, A.A. Bruen, and D. Cheng. 2002. Fuzzy points: Algebra and application. Pattern Recognition 35 (5): 1153-1166.

Qiu, W., R.E. Mercer, J.L. Barron, and P. Joe. 2001. 3D Storm Tracking in 3D Doppler Atmospheric Water Precipitation Datasets. Irish Machine Vision and Image Processing conference. Maynooth, Ireland: IMVIP 2001. 79-86.

Spies, H., and J.L. Barron. 2002. Estimating Expansion Rates from Range Data Sequences. Proceedings of Vision Interface (VI2002). S6. 339-346. http://www.cipprs.org/vi2002/toc.html.

Spies, H., B. Jähne, and J.L. Barron. 2002. Range Flow Estimation. Computer Vision Image Understanding 85 (3): 209-231.

Spies, H., B. Jähne, and J.L. Barron. 2001. Surface expansion from range data sequences. Pattern Recognition. 23rd DAGM Symposium. Munich, Germany: Lecture Notes in Computer Science 2191. Springer-Verlag. 163-169.
 
 

EL-SAKKA, M.R.

El Badawy, O., M.R. El-Sakka, K. Hassanein, and M.S. Kamel. 2001. Image Data Mining from Financial Documents Based on Wavelet Features. International Conference on Image Processing, ICIP '2001. Greece: IEEE. 1. 1078-1081.

Ouda, A.H., and M.R. El-Sakka. 2001. Correlation Watermark for Image Authentication and Alternation Locations Detection. SPIE conference on Mathematics of Data/Image Coding, Compression, and Encryption IV. California: SPIE. 4475. 234-241.
 
 

ILIE, L.

Harju, T., and L. Ilie. 2001. Forbidden Subsequences and Permutations Sortable on Two Parallel Stacks. Words, Sequences, Languages:Where Computer Science, Biology, and Linguistics come Across. M. Martin-Vide, and V. Mitrana. Dordrecht: Kluwer. 267-275.

Ilie, L. 2001. On Generalized Slenderness of Context-Free Languages. Words, Semigroups, & Transductions. M. Ito, G. Paun, and S. Yu. Singapore: World Scientific Publishing. 189-202.

Ilie, L., and S. Yu. 2002. Constructing NFAs by Optimal Use of Positions in Regular Expressions. Combinatorial Pattern Matching. A. Apostolico, and M. Takeda. Germany: Springer-Verlag. 279-288.
 
 

JURGENSEN, H.

Jurgensen, H., L. Kari, and G. Thierrin. 2001. Morphisms Preserving Densities. International Journal of Computer Mathematics 78 (2): 165-322.
 
 

KARI, L.

Hussini, S., L. Kari, and S. Konstantinidis. 2002. Coding Properties of DNA Languages. DNA Computing. N. Jonoska, and N.C. Seeman. Berlin: Springer. 57-69.

Jurgensen, H., L. Kari, and G. Thierrin. 2001. Morphisms Preserving Densities. International Journal of Computer Mathematics 78 (2): 165-322.

Kari, J., and L. Kari. 2001. Context-Free Recombinations (Chapter 32). Where Mathematics, Computer Science, Linguistics and Biology Meet. C. Marin-Vide, and V. Mitrana. The Netherlands: Kluwer Academic Publishers. 361-375.

Kari, L. 2001. Biocomputing:An Application for Mirco-arrays? Sigbio Newsletter 21 (1): 10-15.

Kari, L., R. Kitto, and G. Gloor. 2001. A Computer Scientist's Guide to Molecular Biology. Soft Computing 5 (2): 95-101.

Kari, L., R. Kitto, and G. Thierrin. 2002. Codes, Involutions, and DNA Encodings. Formal and Natural Computing. W. Brauer, H. Ehrig, J. Karhumaki, and A. Salomaa. Germany: Springer. 376-393.

Kari, L., and A. Paun. 2001. String Operations Suggested by DNA Biochemistry:The Balanced Cut Operation. Words, Semigroups, & Transductions : 275-289.
 
 

MERCER, R.E.

Chen, X., J.L. Barron, R.E. Mercer, and P. Joe. 2001. 3D Regularized Velocity from 3D Doppler Radial Velocity. International Conference on Image Processing 2001 3: 664-667.

Mercer, R.E., J.L. Barron, A.A. Bruen, and D. Cheng. 2002. Fuzzy points: Algebra and application. Pattern Recognition 35 (5): 1153-1166.

Qiu, W., R.E. Mercer, J.L. Barron, and P. Joe. 2001. 3D Storm Tracking in 3D Doppler Atmospheric Water Precipitation Datasets. Irish Machine Vision and Image Processing conference. Maynooth, Ireland: IMVIP 2001. 79-86.
 
 

OSBORN, S.L.

Osborn, S.L. 2002. Information Flow Analysis of an RBAC System. Proceedings of Seventh ACM Symposium on Access Control Models and Technologies. SACMAT 2002. New York: The Association for Computing Machinery. 163-168.
 
 

PERRY, M.

Hunter, T., T. Smith, M. Crossan, M.A. Wilkinson, and M. Perry. 2002. Napster and MP3:Redefining The Music Industry. Teaching Note. 8B01M02. London: Richard Ivey School of Business. 1.

Hunter, T., T. Smith, M.M. Crossan, M.A. Wilkinson, and M. Perry. 2001. Napster and MP3:Redefining Music Industry (Case 8). Strategic Management:A Casebook. 6 ed. V. Tomaiuolo. Toronto, Canada: Pearson Education Canada Inc. 129-145.

Perry, M. 2001. Why we should worry. Technology Law Forum 1 (9): 185-186.

Perry, M., and Q. Zhang. 2001. Hosts. Mobile Agents for Telecommunication Applications. S. Pierre, and R. Glitho. Germany: Springer-Verlag.
 
 

SOLIS-OBA, R.

Jansen, K., M. Mastrolili, and R. Solis-Oba. 2001. Job Shop Scheduling Problems with Controllable Processing Times. Theoretical Computer Science. A. Restivo, S. Ronchi Della Rocca, and L. Roversi. Lecture Notes in Computer Science. Springer. 2202. 107-122.

Sanders, P., and R. Solis-Oba. 2001. How helpers hasten h-relations. Journal of Algorithms 41: 86-98.
 
 

YU, S.

Campeanu, C., A. Paun, and S. Yu. 2002. An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. International Journal of Foundations of Computer Science 13 (1): 83-97.

Campeanu, C., N. Santean, and S. Yu. 2001. Minimal cover-automata for finite languages. Theoretical Computer Science 267: 3-16.

Dassow, J., G. Paun, G. Thierrin, and S. Yu. 2001. Tree-systems of morphisms. Acta Informatica 38: 131-153.

Ilie, L., and S. Yu. 2002. Constructing NFAs by Optimal Use of Positions in Regular Expressions. Combinatorial Pattern Matching. A. Apostolico, and M. Takeda. Germany: Springer-Verlag. 279-288.

Yu, S. 2001. State Complexity of Regular Languages. Journal of Automata, Languages and Combinatorics 6 (2): 221-234.