12. SAC 1997: San Jose, California

• Adele Goldberg:
  Virtual teams virtual projects = real learning (abstract only). 1
  
• Elliot Soloway, Cathleen A. Norris:
  The future of computers in education: learning 10 lessons from the past (abstract only). 2
  
• Perry Cheng, Danny Kilis, Graeme Knight:
  Knowledge assessment using fuzzy conceptual representation. 3-9
  
• Bryn Lewis, Andrew Stranieri, John Zeleznikow:
  Scaling of neural network inferencing by efficient storage and retrieval of outputs. 10-14
  
• Domenico M. Pisanelli, Fabrizio Consorti:
  Support to the management of clinical activities in the context of protocol-based care. 15-19
  
• Ray R. Hashemi, F. Fred Choobineh, John R. Talburt, William Slikker, Merle G. Paule:
  A diagnostic system based on a multi-decision approximate rules model. 20-24
  
• Olga Shumsky, Ralph W. Wilkerson, William McCune, Fikret Erçal:
  Direct finite first-order model generation with negative constraint propagation heuristic. 25-29
  
• David Binkley, Bradley M. Kuhn:
  Crozzle: an NP-complete problem. 30-34
  
• Walid Mostafa, Mukesh Singhal:
  A reliable multicast session protocol for collaborative continuous-feed applications. 35-39
  
• Zhizhang Shen:
  The average diameter of binary tree structures. 40-44
  
• Chang-Hyun Jo, Phil Sun Kim, Hyeung Sik Im, Eui Hyun Paik, Byung-Sun Lee:
  A design and prototyping of an object-oriented program debugger. 45-51
  
• Rami M. Khasawneh, Mohammad S. Obaidat:
  An evaluation study of protocols used in cable TV networks. 52-57
  
• Graeme Knight, Danny Kilis, Perry Cheng:
  An architecture for an integrated active help system. 58-64
  
• Atsuyuki Morishima, Hiroyuki Kitagawa:
  World Wide Web based grades management. 65-69
  
• Antonio Si, Hong Va Leong, Rynson W. H. Lau:
  CHECK: a document plagiarism detection system. 70-77
  
• Antonio Si, Hong Va Leong, Rynson W. H. Lau:
  A data modeling approach to the seamless information exchange among structured documents and databases. 78-87
  
• Keith C. C. Chan, Wai-Ho Au:
  An effective algorithm for mining interesting quantitative association rules. 88-90
  
• Keiko Shimazu, Koichi Furukawa:
  Knowledge discovery in database by Progol-design, implementation and its application to expert system building. 91-93
  
• Taoufiq Dkaki:
  Science watch by knowledge discovery in bibliographic databases. 94-95
  
• Toshiyuki Seto, Takuhiro Nagafuji, Motomichi Toyama:
  Generating HTML sources with TFE enhanced SQL. 96-100
  
• Gary D. Walborn, Panos K. Chrysanthis:
  PRO-MOTION : Management of Mobile Transactions. 101-108
  
• Oliver M. Duschka, Michael R. Genesereth:
  Query Planning in Infomaster. 109-111
  
• Yooshin Lee, Ling Liu, Calton Pu:
  Towards Interoperable Heterogeneous Information Systems: An Experiment Using the DIOM Approach. 112-114
  
• Michael Björn, Christoph Neumann:
  Pre-processed, multilingual communication on the World-Wide Web. 115-117
  
• Parvathi Chundi, Daniel J. Rosenkrantz, S. S. Ravi:
  Multi-site distributed database transactions utilizing deferred update. 118-122
  
• Takahiro Hara, Kaname Harumoto, Masahiko Tsukamoto, Shojiro Nishio:
  Location Management Methods of Migratory Data Resources in ATM Networks. 123-130
  
• Yousef J. Al-Houmaily, Panos K. Chrysanthis, Steven P. Levitan:
  Enhancing the performance of presumed commit protocol. 131-133
  
• Brajendra Panda:
  An alternative approach to serialization of multilevel secure Transactions. 134-135
  
• Wen-Syan Li, K. Selçuk Candan, Kyoji Hirata:
  SEMCOG: an integration of SEMantics and COGnition-based approaches for image retrieval. 136-143
  
• Francesca Coppa, Enrico Nardelli, Maurizio Talamo:
  A formal model for the discrete representation of spatial objects. 144-151
  
• Xiao Weiqi, Yucai Feng:
  Spatial index based on multiple interval segments. 152-154
  
• Sunil Prabhakar, Divyakant Agrawal, Amr El Abbadi, Ambuj K. Singh:
  A brief survey of tertiary storage systems and research. 155-157
  
• Norbert Ritter:
  Group-authoring in CONCORDA DB-based approach. 158-165
  
• Peter Baumann, Paula Furtado, Roland Ritsch, Norbert Widmann:
  The RasDaMan approach to multidimensional database management. 166-173
  
• Hans Schuster, Petra Heinl:
  A workflow data distribution strategy for scalable workflow management systems. 174-176
  
• Reiner Siebert, Thomas Kindler, Tobias Soyez:
  Integrated workflow and telecooperation support for the German government. 177-179
  
• Mary Ann Robbert, Christopher Rouff, Christian Burkhardt:
  A cooperative mission development environment for crossplatform integration. 180-181
  
• David C. Rine:
  Success factors for software reuse that are applicable across domains and businesses. 182-186
  
• Lawrence J. Mazlack:
  Developing a focus in unsupervised database mining. 187-191
  
• F. Benjamin Zhan:
  Topological relations between fuzzy regions. 192-196
  
• Patrick Bosc:
  On the primitivity of the division of fuzzy relations. 197-201
  
• Francesca Arcelli Fontana, Ferrante Formato:
  Using fuzzy grammars for the evaluation of SGML-based documents. 202-203
  
• Ernesto Damiani, Ahn D. Ta:
  Dynamic clustering for technology-based domain analysis (TDA). 204-206
  
• John R. Koza, Forrest H. Bennett III, David Andre, Martin A. Keane:
  Evolution using genetic programming of a low-distortion, 96 decibel operational amplifier. 207-216
  
• Thomas Haynes:
  Collective memory search. 217-222
  
• Sami Khuri:
  Computing with Haar functions. 223-227
  
• Fulvio Corno, Paolo Prinetto, Maurizio Rebaudengo, Matteo Sonza Reorda:
  SAARA: a simulated annealing algorithm for test pattern generation for digital circuits. 228-232
  
• Bryant A. Julstrom:
  Adaptive operator probabilities in a genetic algorithm that applies three operators. 233-238
  
• Sam Chung, Rafael Perez:
  Why is problem-dependent and high-level representation scheme better in a genetic algorithm? 239-246
  
• Sami Khuri, Teresa Chiu:
  Heuristic algorithms for the terminal assignment problem. 247-251
  
• Harald Feiel, Sub Ramakrishnan:
  A genetic approach to color image compression. 252-256
  
• Luiz Satoru Ochi, Lúcia Maria de A. Drummond, Rosa M. V. Figueiredo:
  Design and implementation of a parallel genetic algorithm for the travelling purchaser problem. 257-262
  
• Heather L. Christensen, Roger L. Wainwright, Dale A. Schoenefeld:
  A hybrid algorithm for the point to multipoint routing problem. 263-268
  
• Roy P. Pargas, Jennifer Ludwick, S. Alexander Spoon:
  Hybrid search algorithms. 269-273
  
• Byung Ro Moon, Yoon-Sik Lee, Chun-Kyung Kim:
  Genetic VLSI circuit partitioning with two-dimensional geographic crossover and zigzag mapping. 274-278
  
• Charles E. Kaiser, Gary B. Lamont, Laurence D. Merkle, George H. Gates Jr., Ruth Pachter:
  Polypeptide structure prediction: real-value versus binary hybrid genetic algorithms. 279-286
  
• Stuart Morton, Omran A. Bukhres:
  Utilizing mobile computing in the Wishard Memorial Hospital ambulatory service. 287-294
  
• Robert O'Hara:
  Microsoft Windows CE: a new handheld computing platform. 295-296
  
• Jie Li, Hisao Kameda, Hideto Itoh:
  Balanced assignment of cells in PCS networks. 297-301
  
• Hong Va Leong, Antonio Si:
  On adaptive caching in mobile databases. 302-309
  
• Olaf Zukunft:
  Rule based adaptation in mobile database systems. 310-317
  
• Kathleen Neumann, Martin Maskarinec:
  Mobile computing within a distributed deductive database. 318-322
  
• William Perrizo, Zhili Zhang, Stephen Krebsbach:
  A query processing method for data warehouses which contain multimedia. 323-327
  
• Venkat N. Gudivada, Jay N. Bhuyan, Ramesh Adusumilli:
  A retrieval technique for virtual reality databases. 328-333
  
• Venkata N. Rao Goli, William Perrizo:
  Application of domain vector perfect hash join for multimedia data mining. 334-339
  
• Aomar Maddi:
  Token based solutions to M resources allocation problem. 340-344
  
• Dorota M. Huizinga, Ewa Kubicko:
  A tree generating algorithm for designing optimal hierarchical distributed systems. 345-353
  
• Dingchao Li, Akira Mizuno, Yuji Iwahori, Naohiro Ishii:
  Booking heterogeneous processor resources to reduce communication overhead. 354-360
  
• Woei-Jiunn Tsaur, Shi-Jinn Horng, Chia-Ho Chen:
  An authentication-combined access control scheme using a geometric approach in distributed systems. 361-365
  
• Arun K. Jagota, Rina Dechter:
  Simple distributed algorithms for the cycle cutset problem. 366-373
  
• David R. Surma, Edwin Hsing-Mean Sha:
  Hybrid static-dynamic communication scheduling for parallel systems. 374-379
  
• Fadi N. Sibai:
  Multi-node communication in hyper-ring networks. 380-383
  
• Fadi N. Sibai:
  On the impact of pipelined communication in hierarchical ring multicomputers. 384-388
  
• Fadi N. Sibai:
  Distributed routing in the recursive diamond network. 389-392
  
• Kevin H. Liu:
  Performance evaluation of processor allocation algorithms for parallel query execution. 393-402
  
• Hong Liu, Wei-Ming Lin, Yongsheng Song:
  An efficient processor partitioning and thread mapping strategy for mesh-connected multiprocessor systems. 403-412
  
• Yongsheng Song, Wei-Ming Lin:
  Performance prediction based loop scheduling for heterogeneous computing environment. 413-421
  
• Wei-Ming Lin, Wei Xie, Bo Yang:
  Performance analysis for parallel solutions to generic search problems. 422-430
  
• Sukumar Ghosh, Arobinda Gupta, Sriram V. Pemmaraju:
  Fault-containing network protocols. 431-437
  
• Nodari Vakhania:
  Sequencing jobs with readiness times and tails on parallel machines. 438-446
  
• Chin Lu, Sau-Ming Lau:
  A negotiation protocol for batch task assignments in dynamic load distribution. 447-453
  
• Venu K. Murthy, E. V. Krishnamurthy:
  Heterogeneous programming with concurrent objects. 454-463
  
• Fenglien Lee:
  Constructing the constrained Delaunay triangulation on the Intel paragon. 464-467
  
• Chang-hoon Choi, Sung-Chun Kim:
  Hierarchical multistage interconnection network for shared-memory multiprocessor system. 468-472
  
• Weizhen Mao:
  A parallel multi-operation scheduling problem with machine order constraints. 473-477
  
• Keqin Li:
  An efficient and effective performance evaluation method for multiprogrammed multiprocessor systems. 478-487
  
• Keqin Li:
  Analyzing the expected execution times of parallel programs. 488-495
  
• Keqin Li:
  On dynamic tree growing in hypercubes. 496-503
  
• James D. Shuler, Henry R. Bauer:
  Look-ahead allocation in the presence of branches. 504-508
  
• Richard Banach, George A. Papadopoulos:
  Implementing interaction nets in MONSTR. 509-514
  
• Chaman L. Sabharwal, Brian Quandt:
  An efficient algorithm for direct computation of adjacent block coefficients in the transformed domain. 515-520
  
• Wanglung Chung, John M. Lewis, S. Lakshmivarahan, Sudarshan K. Dhall:
  Effect of data distribution in data assimilation using Burgers' equation. 521-526
  
• Sami Khuri, Frederick Stern, Teresa Chiu:
  Randomness of finite strings: a reconstructive approach. 527-531
  
• Patrick Theobald, Susanne Wetzel, Werner Backes:
  Design concepts for matrices and lattices in LiDIA. 532-536
  
• Philip Feinsilver, Uwe Granz, René Schott:
  On the computation of polynomial representations of nilpotent Lie groups: a symbolic mathematical approach. 537-539
  
• Barbara Simons, Pamela Samuelson, Mark Stefik, Gio Wiederhold:
  Copyright and the net: is legislation the answer? (panel session). 540
  
• Pradip Peter Dey, David Benyon, Gene Golovchinsky, Santosh Mathan, Dewey Rundus, Arnold Smith, Robert C. Williges:
  Human computer interaction models and application development (panel session). 541