TEMPLATE

Leaders in Learning: Publications of Faculty & Staff

Computer Science 2003-2004

ANDREWS, J.

Andrews, J. 2003. Cut Elimination for a Weakly-Typed Higher Order Logic. Department of Computer Science, UWO, Technical Report 611: 1-19.

Andrews, J.H. 2004. Deriving State-Based Test Oracles for Conformance Testing. Proceedings of the Second International Workshop on Dynamic Analysis (WODA 2004) . 9-16 .

Andrews, J.H., and Y. Zhang. 2003. General Test Result Checking with Log File Analysis. IEEE Transactions on Software Engineering 29 (7): 634-648.

Huang, G., and J.H. Andrews. 2004. Learning and Initial Use of a Software Testing Technology: An Exploratory Study. The Eighth International Conference on Empirical Assessment in Software Engineering (EASE 2004). 77-86 .

BARRON, J.

Barron, J. 2003. The Integration of Optical Flow into Tinatool. Department of Computer Science, UWO, Technical Report 601: 1-58.

BAUER, M.

Katchabaw, M., H. Lutfiyya, and M. Bauer. 2003. Administrative Policies to Regulate Quality of Service Management in Distributed Multimedia Applications. Department of Computer Science, UWO, Technical Report 596 : 1-20.

Katchabaw, M., H. Lutfiyya, and M. Bauer. 2003. More on Usage Based Service Differentiation for End-to-End Quality of Service Management. Department of Computer Science, UWO, Technical Report 608: 1-10.

EL-SAKKA, M.

Abdel-Dayem, A.R., and M.R. El-Sakka. 2004. A Novel Morphological-Based Carotid Artery Contour Extraction. IEEE Canadian Conference on Electrical and Computer Engineering, CCECE'04 . IEEE . 4. 1873-1876.

Hamou, A.K., and M.R. El-Sakka. 2004. A Novel Segmentation Technique for Carotid Ultrasound Images. IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2004 . IEEE . 3. 521-524.

Ouda, A., and M. El-Sakka. 2003. Methods to Correct Wong-Memon Image Watermarking Scheme. Department of Computer Science, UWO, Technical Report 603: 1-30.

Qin, J., and M.R. El-Sakka. 2003. A New Wavelet-Based Method for Contrast/Edge Enhancement. IEEE International Conference on Image Processing, ICIP 2003. IEEE . 3. 397-400.

JURGENSEN, H.

Bordihn, H., and H. Jurgensen. 2004. Pushdown Information. Department of Computer Science, UWO, Technical Report 623: 1-11.

KARI, L.

Daley, M., O.H. Ibarra, and L. Kari. 2003. Closure and decidability properties of some language classes with respect to ciliate bio-operations. Theoretical Computer Science, Algorithms, Automata, Complexity and Games 306 (1): 19-38.

Daley, M., O.H. Ibarra, L. Kari, I. McQuillan, and K. Nakano. 2003. The ld and dlad bio-operations on formal languages. Journal of Automata, Languages and Combinatorics 8 (3): 477-498.

Daley, M., L. Kari, and I. McQuillan. 2004. Families of languages defined by ciliate bio-operations. Theoretical Computer Science Theory of Natural Computing, Elsevier 320 (1): 51-69.

Kari, L., S. Konstantinidis, E. Losseva, and G. Wozniak. 2003. Sticky-free and overhang-free DNA languages. Acta Informatica 40 : 119-157.

Kari, L., S. Konstantinidis, and P. Sosik. 2004. Bond-free Languages: Formalizations, Maximality and Construction Methods. International Journal of Foundations of Computer Science. C. Ferretti, G. Mauri, and C. Zandron. DNA10 Tenth International Meeting on DNA Computing, Preliminary Proceedings. 16-25 .

Kari, L., S. Konstantinidis, and P. Sosik. 2003. On Properties of Bond-free DNA Languages. Department of Computer Science Technical Report 609 : 1-28.

Kari, L., S. Konstantinidis, and P. Sosik. 2004. Preventing Undesirable Bonds between DNA Codewords. International Journal of Foundations of Computer Science. C. Ferretti, G. Mauri, and C. Zandron. DNA10 Tenth International Meeting on DNA Computing, Preliminary Proceedings .

Kari, L., S. Konstantinidis, and P. Sosik. 2004. Substitution on Trajectories. Lecture Notes in Computer Science, Special Edition: Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday 3113: 145-158.

Kari, L., and L.F. Landweber. 2004. Biocomputation in Ciliates. Cellular Computing. M. Amos. Oxford: Oxford University Press. 202-216.

Kari, L., C. Martin-Vide, and A. Paun. 2004. On the Universality of P Systems with Minimal Symport/Antiport Rules. Aspects of Molecular Computing, Essays Dedicated to Tom Head on the Occasion of His 70th Birthday, Lecture Notes in Computer Science 2950: 254-266.

Kari, L., and P. Sosik. 2003. Language deletion on trajectories. Department of Computer Science Technical Report 606: 1-22.

Kari, L., and P. Sosik. 2004. On Language Equations with Deletion. Bulletin of the European Association for Theoretical Computer Science EATCS 83: 173-180.

KATCHABAW, M.

LUTFIYYA, H.

MADHAVJI, N.H.

Madhavji, N.H., and J. Turgeon. 2003. A Case for Establishing Evolutionary Policies and their Support Mechanisms, with Examples. International Workshop on Evolution of Large-scale Industrial Software Applications (ELISA). Amsterdam: Available at http://prog.vub.ac.be/FFSE/Workshops/ELISA-Workshop.html.

Madhavji, N.H., and J. Turgeon. 2003. Policy-guided Software Evolution. Proceedings of the International Conference on Software Maintenance (ICSM'03). Amsterdam: IEEE Computer Society. 75-82.

MORENO MAZA, M.

Bronstein, M. and M. Moreno Maza. Release of Algebra 1.0.2. Aldor. Available: http://www.aldor.org [cited May 19, 2004].

Cai, J., M. Moreno Maza, S. Watt, and M. Dunstan. 2004. Debugging a high level language via a unified interpreter and compiler runtime environment. Proceedings of the Tenth International Conference on Applications of Computer Algebra. Q.-N. Tran. Beaumont, Texas: International Scientific Committee for Applications of Computer Algebra. 125-138.

PERRY, M.

Perry, M. 2003. Digital Propertization of the New Artifacts: The Application of Technologies for "Soft" Representations of the Physical and Metaphysical. Cardozo Journal of International and Comparative Law 11 (2): 671-705.

SOLIS-OBA, R.

Jansen, K., and R. Solis-Oba. 2003. Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints. Lecture Notes in Computer Science, PPAM 2003 3019: 105-112.

Jansen, K., R. Solis-Oba, and M. Sviridenko. 2003. Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. Society for Industrial and Applied Mathematics (SIAM), Journal of Discrete Math 16 (2): 288-300.

Solis-Oba, R. 2003. A Framework for Designing Approximation Algorithms for Scheduling Problems. Lecture Notes in Computer Science, WEA 2003 2647: 253-260.

WATT, S.