33. ACM Southeast Regional Conference 1995: Clemson, South Carolina, USA

Systems modeling

• Darrell Suggs, Robert G. Reynolds:
  Constructing multiprocessor workload characterizations. 3-12
  
• A. V. Ramesh, Kishor S. Trivedi:
  Semi-numerical transient analysis of Markov models. 13-23
  
• Sunil Hingorani, Oliver Heim:
  A test suite for exposing design and implementation details in petri net simulators. 24-29
  

Database systems I

• Olivier Brissac:
  An optimal algorithm for similarity based entity association. 30-36
  
• Christopher R. Senhouse:
  An entity-relationship design system for graphical software development. 37-41
  
• A. Wesley Wear, Yu Gong, Kai H. Chang:
  Database management for multimedia distributed collaborative writing. 42-51
  

Glenda

• Denzil Lobo:
  Network Glenda software design. 52-57
  
• Jerry L. Bickham:
  Parallel ocean modeling using Glenda. 58-63
  

Object oriented analysis and design I

• David A. Sykes:
  Culturing objects to achieve efficient implementations and entity interactions in object-oriented programming. 64-72
  
• Zhonghua Li, Chris C. Kirkham:
  Efficient implementation of aggregates in united functions and objects. 73-82
  

Graphics

• Edward T. Hammerand, Gidget R. Smith:
  Analysis of primary extent algorithms for ray tracing. 83-91
  
• Lori Postner:
  Human perception of halftoned images. 92-100
  
• A. Brandon Smith:
  Using virtual reality for the simulation of infrared environments for human training. 101-109
  

Software engineering I

• Mary Jean Harrold, Loren Larsen, John Lloyd, David Nedved, Melanie Page, Gregg Rothermel, Manvinder Singh, Michael Smith:
  Aristotle: a system for development of program analysis based tools. 110-119
  
• D. E. Stevenson:
  Software engineering frontiers in computational science and engineering. 120-126
  
• Donald Gotterbarn, Robert Riser, Suzanne Smith:
  The inverted functional matrix: a new approach to project intensive software engineering courses. 127-135
  

Visualization

• Yun Wang:
  Facets: a new algorithm for extracting 3-D surface from volume data. 136-142
  
• Ryan Gene Benton:
  Using genetic algorithms to improve interpretation of satellite data. 143-145
  

Paging

• Thomas J. Murray, A. Wayne Madison, James Westall:
  Lookahead page placement. 146-155
  
• Vidyadhar Phalke:
  A time invariant working set model for independent reference. 156-164
  
• Stephen Hughes:
  A new bound for space bounded server algorithms. 165-169
  

Computer science education

• Mark A. Holliday:
  Incremental game development in an introductory programming course. 170-175
  
• Steve Benford, Edmund K. Burke, Eric Foxley, Christopher A. Higgins:
  The Ceilidh system for the automatic grading of students on programming courses. 176-182
  
• Marguerite Saacks-Giguette:
  An undergraduate research and mentoring program in computer science. 183-186
  
• Judith A. Hankins, Brenda C. Parker:
  The impact of accreditation on CS1 and CS2. 187-194
  

Algorithms

• John McCalpin, Mark Smotherman:
  Automatic benchmark generation for cache optimization of matrix operations. 195-204
  
• Luke Olszewski:
  A timing comparison of the conjugate gradient and Gauss-Seidel parallel algorithms in a one-dimensional flow equation using PVM. 205-212
  
• Fenglien Lee, Richard Jou:
  Efficient parallel geometric algorithms on a mesh of trees. 213-218
  
• Kequin Li:
  Probabilistic analysis of an approximation algorithm for maximum subset sum using recurrence relations. 219-226
  

Distributed systems

• Nacira Guerroudji:
  Logical model for administration policy specification. 227-232
  

Database systems II

• Vram Kouramajian, Ramez Elmasri:
  The TI/R--Tree: a temporal--spatial access structure. 233-239
  
• Rajiv Bagai, Mehmet A. Orgun:
  A temporal paraconsistent relational algebra for incomplete and inconsistent information. 240-248
  

Applications

• Sridhar Narayan:
  Generating nonlinear class boundaries using distributed encodings. 249-253
  
• W. Rick Smith:
  A prototype and algorithms for tree ring area measurement. 254-259
  

Panel discussion

• Allen S. Parrish, David W. Cordes, James Cross, Brian Malloy:
  Ada in the undergraduate curriculum. 261
  
• James H. Cross II, T. Dean Hendrix, Mark Sadler, Brian Randles:
  Reengineering a program visualization tool. 265-266
  
• Robert A. Allen, John Abbas Youssefi:
  Teaching the internet: a protocol for interactive learning. 267-268
  

Languages

• Warren X. Li:
  Building efficient incremental LL parser by augmenting LL table and threading parse tree. 269-270
  
• James M. Bateman:
  Two constructions of C++ subclasses from functions. 271-272
  
• Stephen M. Jodis:
  Experiences and successes in teaching a language many CS students didn't want to learn: COBOL. 273-274
  
• Frank Hadlock:
  A tabular parsing algorithm with error recovery. 275-276
  
• Evelyn Stiller, Gregory A. Riccardi:
  A heuristic approach to RNA secondary structure prediction. 277-278
  

Object oriented analysis and design II

• Fatma Dandashi, James Acquah, Sudhanshu Killedar, Hadon Nash, William Pritchette, David Rine:
  Concurrent engineering of an object-oriented particle-in-cell simulations environment for physicists. 279-280
  
• Sau-Ming Lau:
  The HOOL: an object-oriented environment for parallel programming in workstation clusters. 281-282
  
• Noureddine Kara Zaitri, Xavier Castellani:
  A process and a tool to map communication components of data flows to objects. 283-284
  

Software engineering II

• Gerald F. Gattis, Thomas J. Cheatham:
  Testing object-oriented software. 285-286
  
• Patricia A. McQuaid:
  Profiling software complexity. 287-288
  
• O. Hammami:
  Fighting space complexity of compile time cache management schemes. 289-290