biblicit 1.0 → 2.0.3

Sign up to get free protection for your applications and to get access to all the features.
Files changed (406) hide show
  1. data/.gitmodules +3 -0
  2. data/Gemfile +1 -1
  3. data/README.md +125 -30
  4. data/Rakefile +22 -0
  5. data/biblicit.gemspec +9 -7
  6. data/lib/biblicit/cb2bib.rb +10 -11
  7. data/lib/biblicit/citeseer.rb +14 -26
  8. data/lib/biblicit/extractor.rb +40 -19
  9. data/lib/biblicit/parscit.rb +38 -0
  10. data/parscit/.gitignore +8 -0
  11. data/parscit/CHANGELOG +125 -0
  12. data/parscit/COPYING +674 -0
  13. data/parscit/COPYING.LESSER +165 -0
  14. data/parscit/INSTALL +105 -0
  15. data/parscit/README +97 -0
  16. data/{perl/ParsCit/README.TXT → parscit/USAGE} +25 -15
  17. data/parscit/bin/archtest.pl +31 -0
  18. data/parscit/bin/citeExtract.pl +562 -0
  19. data/parscit/bin/conlleval.pl +315 -0
  20. data/parscit/bin/headExtract.pl +40 -0
  21. data/parscit/bin/parsHed/convert2TokenLevel.pl +138 -0
  22. data/parscit/bin/parsHed/keywordGen.pl +308 -0
  23. data/parscit/bin/parsHed/parseXmlHeader.pl +141 -0
  24. data/parscit/bin/parsHed/redo.parsHed.pl +198 -0
  25. data/parscit/bin/parsHed/tr2crfpp_parsHed.pl +521 -0
  26. data/parscit/bin/parseRefStrings.pl +102 -0
  27. data/parscit/bin/phOutput2xml.pl +223 -0
  28. data/parscit/bin/redo.parsCit.pl +105 -0
  29. data/parscit/bin/sectExtract.pl +149 -0
  30. data/parscit/bin/sectLabel/README +110 -0
  31. data/parscit/bin/sectLabel/README.txt +110 -0
  32. data/parscit/bin/sectLabel/genericSect/crossValidation.rb +98 -0
  33. data/parscit/bin/sectLabel/genericSect/extractFeature.rb +104 -0
  34. data/parscit/bin/sectLabel/genericSectExtract.rb +53 -0
  35. data/parscit/bin/sectLabel/getStructureInfo.pl +156 -0
  36. data/parscit/bin/sectLabel/processOmniXML.pl +1427 -0
  37. data/parscit/bin/sectLabel/processOmniXML_new.pl +1025 -0
  38. data/parscit/bin/sectLabel/processOmniXMLv2.pl +1529 -0
  39. data/parscit/bin/sectLabel/processOmniXMLv3.pl +964 -0
  40. data/parscit/bin/sectLabel/redo.sectLabel.pl +219 -0
  41. data/parscit/bin/sectLabel/simplifyOmniXML.pl +382 -0
  42. data/parscit/bin/sectLabel/single2multi.pl +190 -0
  43. data/parscit/bin/sectLabel/tr2crfpp.pl +158 -0
  44. data/parscit/bin/tr2crfpp.pl +260 -0
  45. data/parscit/bin/xml2train.pl +193 -0
  46. data/parscit/lib/CSXUtil/SafeText.pm +130 -0
  47. data/parscit/lib/Omni/Config.pm +93 -0
  48. data/parscit/lib/Omni/Omnicell.pm +263 -0
  49. data/parscit/lib/Omni/Omnicol.pm +292 -0
  50. data/parscit/lib/Omni/Omnidd.pm +328 -0
  51. data/parscit/lib/Omni/Omnidoc.pm +153 -0
  52. data/parscit/lib/Omni/Omniframe.pm +223 -0
  53. data/parscit/lib/Omni/Omniline.pm +423 -0
  54. data/parscit/lib/Omni/Omnipage.pm +282 -0
  55. data/parscit/lib/Omni/Omnipara.pm +232 -0
  56. data/parscit/lib/Omni/Omnirun.pm +303 -0
  57. data/parscit/lib/Omni/Omnitable.pm +336 -0
  58. data/parscit/lib/Omni/Omniword.pm +162 -0
  59. data/parscit/lib/Omni/Traversal.pm +313 -0
  60. data/parscit/lib/ParsCit/.PostProcess.pm.swp +0 -0
  61. data/parscit/lib/ParsCit/Citation.pm +737 -0
  62. data/parscit/lib/ParsCit/CitationContext.pm +220 -0
  63. data/parscit/lib/ParsCit/Config.pm +35 -0
  64. data/parscit/lib/ParsCit/Controller.pm +653 -0
  65. data/parscit/lib/ParsCit/PostProcess.pm +505 -0
  66. data/parscit/lib/ParsCit/PreProcess.pm +1041 -0
  67. data/parscit/lib/ParsCit/Tr2crfpp.pm +1195 -0
  68. data/parscit/lib/ParsHed/Config.pm +49 -0
  69. data/parscit/lib/ParsHed/Controller.pm +143 -0
  70. data/parscit/lib/ParsHed/PostProcess.pm +322 -0
  71. data/parscit/lib/ParsHed/Tr2crfpp.pm +448 -0
  72. data/{perl/ParsCit/lib/ParsCit/Tr2crfpp.pm → parscit/lib/ParsHed/Tr2crfpp_token.pm} +22 -21
  73. data/parscit/lib/SectLabel/AAMatching.pm +1949 -0
  74. data/parscit/lib/SectLabel/Config.pm +88 -0
  75. data/parscit/lib/SectLabel/Controller.pm +332 -0
  76. data/parscit/lib/SectLabel/PostProcess.pm +425 -0
  77. data/parscit/lib/SectLabel/PreProcess.pm +116 -0
  78. data/parscit/lib/SectLabel/Tr2crfpp.pm +1246 -0
  79. data/parscit/resources/parsCit.model +0 -0
  80. data/parscit/resources/parsCit.split.model +0 -0
  81. data/{perl/ParsCit → parscit}/resources/parsCitDict.txt +205 -0
  82. data/parscit/resources/parsHed/bigram +10 -0
  83. data/parscit/resources/parsHed/keywords +10 -0
  84. data/parscit/resources/parsHed/parsHed.model +0 -0
  85. data/parscit/resources/parsHed/parsHed.template +178 -0
  86. data/parscit/resources/sectLabel/affiliation.model +0 -0
  87. data/parscit/resources/sectLabel/author.model +0 -0
  88. data/parscit/resources/sectLabel/funcWord +320 -0
  89. data/parscit/resources/sectLabel/genericSect.model +0 -0
  90. data/parscit/resources/sectLabel/sectLabel.config +42 -0
  91. data/parscit/resources/sectLabel/sectLabel.configXml +42 -0
  92. data/parscit/resources/sectLabel/sectLabel.model +0 -0
  93. data/sh/convert_to_text.sh +20 -0
  94. data/spec/biblicit/extractor_spec.rb +121 -0
  95. data/spec/fixtures/Review_of_Michael_Tyes_Consciousness_Revisited.docx +0 -0
  96. data/spec/fixtures/critical-infrastructures.ps +63951 -0
  97. data/spec/fixtures/txt/E06-1050.txt +867 -0
  98. data/spec/fixtures/txt/sample1.txt +902 -0
  99. data/spec/fixtures/txt/sample2.txt +394 -0
  100. data/spec/spec_helper.rb +3 -0
  101. data/{perl → svm-header-parse}/HeaderParseService/lib/HeaderParse/API/Function.pm +2 -20
  102. data/{perl → svm-header-parse}/HeaderParseService/lib/HeaderParse/API/MultiClassChunking.pm +0 -7
  103. data/{perl → svm-header-parse}/HeaderParseService/lib/HeaderParse/API/Parser.pm +0 -2
  104. data/{perl → svm-header-parse}/HeaderParseService/lib/HeaderParse/API/ParserMethods.pm +0 -7
  105. data/{perl → svm-header-parse}/HeaderParseService/lib/HeaderParse/Config/API_Config.pm +6 -1
  106. data/svm-header-parse/HeaderParseService/tmp/.gitignore +4 -0
  107. data/svm-header-parse/extract.pl +75 -0
  108. metadata +351 -317
  109. data/perl/DocFilter/lib/DocFilter/Config.pm +0 -35
  110. data/perl/DocFilter/lib/DocFilter/Filter.pm +0 -51
  111. data/perl/FileConversionService/README.TXT +0 -11
  112. data/perl/FileConversionService/converters/PDFBox/pdfbox-app-1.7.1.jar +0 -0
  113. data/perl/FileConversionService/lib/CSXUtil/SafeText.pm +0 -140
  114. data/perl/FileConversionService/lib/FileConverter/CheckSum.pm +0 -77
  115. data/perl/FileConversionService/lib/FileConverter/Compression.pm +0 -137
  116. data/perl/FileConversionService/lib/FileConverter/Config.pm +0 -57
  117. data/perl/FileConversionService/lib/FileConverter/Controller.pm +0 -191
  118. data/perl/FileConversionService/lib/FileConverter/JODConverter.pm +0 -61
  119. data/perl/FileConversionService/lib/FileConverter/PDFBox.pm +0 -69
  120. data/perl/FileConversionService/lib/FileConverter/PSConverter.pm +0 -69
  121. data/perl/FileConversionService/lib/FileConverter/PSToText.pm +0 -88
  122. data/perl/FileConversionService/lib/FileConverter/Prescript.pm +0 -68
  123. data/perl/FileConversionService/lib/FileConverter/TET.pm +0 -75
  124. data/perl/FileConversionService/lib/FileConverter/Utils.pm +0 -130
  125. data/perl/HeaderParseService/lib/CSXUtil/SafeText.pm +0 -140
  126. data/perl/HeaderParseService/resources/data/EbizHeaders.txt +0 -24330
  127. data/perl/HeaderParseService/resources/data/EbizHeaders.txt.parsed +0 -27506
  128. data/perl/HeaderParseService/resources/data/EbizHeaders.txt.parsed.old +0 -26495
  129. data/perl/HeaderParseService/resources/data/tagged_headers.txt +0 -40668
  130. data/perl/HeaderParseService/resources/data/test_header.txt +0 -31
  131. data/perl/HeaderParseService/resources/data/test_header.txt.parsed +0 -31
  132. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test1 +0 -23
  133. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test10 +0 -23
  134. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test11 +0 -23
  135. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test12 +0 -23
  136. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test13 +0 -23
  137. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test14 +0 -23
  138. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test15 +0 -23
  139. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test2 +0 -23
  140. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test3 +0 -23
  141. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test4 +0 -23
  142. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test5 +0 -23
  143. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test6 +0 -23
  144. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test7 +0 -23
  145. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test8 +0 -23
  146. data/perl/HeaderParseService/tmp/tmpVec_1156237246.08016_test9 +0 -23
  147. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test1 +0 -23
  148. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test10 +0 -23
  149. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test11 +0 -23
  150. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test12 +0 -23
  151. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test13 +0 -23
  152. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test14 +0 -23
  153. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test15 +0 -23
  154. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test2 +0 -23
  155. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test3 +0 -23
  156. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test4 +0 -23
  157. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test5 +0 -23
  158. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test6 +0 -23
  159. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test7 +0 -23
  160. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test8 +0 -23
  161. data/perl/HeaderParseService/tmp/tmpVec_914027525.276114_test9 +0 -23
  162. data/perl/ParsCit/crfpp/traindata/parsCit.template +0 -60
  163. data/perl/ParsCit/crfpp/traindata/parsCit.train.data +0 -12104
  164. data/perl/ParsCit/crfpp/traindata/tagged_references.txt +0 -500
  165. data/perl/ParsCit/lib/CSXUtil/SafeText.pm +0 -140
  166. data/perl/ParsCit/lib/ParsCit/Citation.pm +0 -462
  167. data/perl/ParsCit/lib/ParsCit/CitationContext.pm +0 -132
  168. data/perl/ParsCit/lib/ParsCit/Config.pm +0 -46
  169. data/perl/ParsCit/lib/ParsCit/Controller.pm +0 -306
  170. data/perl/ParsCit/lib/ParsCit/PostProcess.pm +0 -367
  171. data/perl/ParsCit/lib/ParsCit/PreProcess.pm +0 -333
  172. data/perl/ParsCit/resources/parsCit.model +0 -0
  173. data/perl/extract.pl +0 -199
  174. data/spec/biblicit/cb2bib_spec.rb +0 -48
  175. data/spec/biblicit/citeseer_spec.rb +0 -40
  176. /data/{perl → svm-header-parse}/HeaderParseService/README.TXT +0 -0
  177. /data/{perl/DocFilter → svm-header-parse/HeaderParseService}/lib/CSXUtil/SafeText.pm +0 -0
  178. /data/{perl → svm-header-parse}/HeaderParseService/lib/HeaderParse/API/AssembleXMLMetadata.pm +0 -0
  179. /data/{perl → svm-header-parse}/HeaderParseService/lib/HeaderParse/API/LoadInformation.pm +0 -0
  180. /data/{perl → svm-header-parse}/HeaderParseService/lib/HeaderParse/API/NamePatternMatch.pm +0 -0
  181. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/50states +0 -0
  182. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/AddrTopWords.txt +0 -0
  183. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/AffiTopWords.txt +0 -0
  184. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/AffiTopWordsAll.txt +0 -0
  185. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/ChineseSurNames.txt +0 -0
  186. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/Csurnames.bin +0 -0
  187. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/Csurnames_spec.bin +0 -0
  188. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/DomainSuffixes.txt +0 -0
  189. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/LabeledHeader +0 -0
  190. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/README +0 -0
  191. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/TrainMulClassLines +0 -0
  192. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/TrainMulClassLines1 +0 -0
  193. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/abstract.txt +0 -0
  194. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/abstractTopWords +0 -0
  195. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/addr.txt +0 -0
  196. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/affi.txt +0 -0
  197. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/affis.bin +0 -0
  198. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/all_namewords_spec.bin +0 -0
  199. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/allnamewords.bin +0 -0
  200. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/cities_US.txt +0 -0
  201. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/cities_world.txt +0 -0
  202. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/city.txt +0 -0
  203. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/cityname.txt +0 -0
  204. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/country_abbr.txt +0 -0
  205. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/countryname.txt +0 -0
  206. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/dateTopWords +0 -0
  207. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/degree.txt +0 -0
  208. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/email.txt +0 -0
  209. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/excludeWords.txt +0 -0
  210. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/female-names +0 -0
  211. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/firstNames.txt +0 -0
  212. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/firstnames.bin +0 -0
  213. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/firstnames_spec.bin +0 -0
  214. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/intro.txt +0 -0
  215. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/keyword.txt +0 -0
  216. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/keywordTopWords +0 -0
  217. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/male-names +0 -0
  218. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/middleNames.txt +0 -0
  219. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/month.txt +0 -0
  220. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/mul +0 -0
  221. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/mul.label +0 -0
  222. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/mul.label.old +0 -0
  223. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/mul.processed +0 -0
  224. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/mulAuthor +0 -0
  225. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/mulClassStat +0 -0
  226. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/nickname.txt +0 -0
  227. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/nicknames.bin +0 -0
  228. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/note.txt +0 -0
  229. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/page.txt +0 -0
  230. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/phone.txt +0 -0
  231. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/postcode.txt +0 -0
  232. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/pubnum.txt +0 -0
  233. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/statename.bin +0 -0
  234. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/statename.txt +0 -0
  235. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/states_and_abbreviations.txt +0 -0
  236. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/stopwords +0 -0
  237. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/stopwords.bin +0 -0
  238. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/surNames.txt +0 -0
  239. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/surnames.bin +0 -0
  240. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/surnames_spec.bin +0 -0
  241. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/A.html +0 -0
  242. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/B.html +0 -0
  243. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/C.html +0 -0
  244. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/D.html +0 -0
  245. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/E.html +0 -0
  246. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/F.html +0 -0
  247. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/G.html +0 -0
  248. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/H.html +0 -0
  249. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/I.html +0 -0
  250. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/J.html +0 -0
  251. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/K.html +0 -0
  252. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/L.html +0 -0
  253. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/M.html +0 -0
  254. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/N.html +0 -0
  255. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/O.html +0 -0
  256. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/P.html +0 -0
  257. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/Q.html +0 -0
  258. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/R.html +0 -0
  259. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/S.html +0 -0
  260. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/T.html +0 -0
  261. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/U.html +0 -0
  262. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/V.html +0 -0
  263. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/W.html +0 -0
  264. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/WCSelect.gif +0 -0
  265. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/X.html +0 -0
  266. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/Y.html +0 -0
  267. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/Z.html +0 -0
  268. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ae.html +0 -0
  269. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/am.html +0 -0
  270. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ar.html +0 -0
  271. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/at.html +0 -0
  272. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/au.html +0 -0
  273. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/bd.html +0 -0
  274. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/be.html +0 -0
  275. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/bg.html +0 -0
  276. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/bh.html +0 -0
  277. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/blueribbon.gif +0 -0
  278. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/bm.html +0 -0
  279. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/bn.html +0 -0
  280. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/br.html +0 -0
  281. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ca.html +0 -0
  282. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ch.html +0 -0
  283. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/cl.html +0 -0
  284. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/cn.html +0 -0
  285. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/co.html +0 -0
  286. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/cr.html +0 -0
  287. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/cy.html +0 -0
  288. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/cz.html +0 -0
  289. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/de.html +0 -0
  290. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/dean-mainlink.jpg +0 -0
  291. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/dk.html +0 -0
  292. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ec.html +0 -0
  293. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ee.html +0 -0
  294. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/eg.html +0 -0
  295. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/es.html +0 -0
  296. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/et.html +0 -0
  297. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/faq.html +0 -0
  298. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/fi.html +0 -0
  299. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/fj.html +0 -0
  300. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/fo.html +0 -0
  301. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/fr.html +0 -0
  302. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/geog.html +0 -0
  303. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/gr.html +0 -0
  304. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/gu.html +0 -0
  305. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/hk.html +0 -0
  306. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/hr.html +0 -0
  307. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/hu.html +0 -0
  308. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/id.html +0 -0
  309. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ie.html +0 -0
  310. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/il.html +0 -0
  311. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/in.html +0 -0
  312. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/is.html +0 -0
  313. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/it.html +0 -0
  314. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/jm.html +0 -0
  315. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/jo.html +0 -0
  316. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/jp.html +0 -0
  317. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/kaplan.gif +0 -0
  318. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/kr.html +0 -0
  319. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/kw.html +0 -0
  320. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/lb.html +0 -0
  321. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/linkbw2.gif +0 -0
  322. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/lk.html +0 -0
  323. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/lt.html +0 -0
  324. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/lu.html +0 -0
  325. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/lv.html +0 -0
  326. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ma.html +0 -0
  327. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/maczynski.gif +0 -0
  328. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/mirror.tar +0 -0
  329. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/mk.html +0 -0
  330. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/mo.html +0 -0
  331. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/mseawdm.gif +0 -0
  332. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/mt.html +0 -0
  333. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/mx.html +0 -0
  334. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/my.html +0 -0
  335. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ni.html +0 -0
  336. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/nl.html +0 -0
  337. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/no.html +0 -0
  338. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/nz.html +0 -0
  339. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/pa.html +0 -0
  340. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/pe.html +0 -0
  341. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ph.html +0 -0
  342. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/pl.html +0 -0
  343. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/pointcom.gif +0 -0
  344. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/pr.html +0 -0
  345. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ps.html +0 -0
  346. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/pt.html +0 -0
  347. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/recognition.html +0 -0
  348. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/results.html +0 -0
  349. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ro.html +0 -0
  350. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ru.html +0 -0
  351. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/sd.html +0 -0
  352. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/se.html +0 -0
  353. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/sg.html +0 -0
  354. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/si.html +0 -0
  355. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/sk.html +0 -0
  356. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/th.html +0 -0
  357. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/tr.html +0 -0
  358. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/tw.html +0 -0
  359. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ua.html +0 -0
  360. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/uk.html +0 -0
  361. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/univ-full.html +0 -0
  362. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/univ.html +0 -0
  363. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/uy.html +0 -0
  364. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/ve.html +0 -0
  365. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/yu.html +0 -0
  366. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/za.html +0 -0
  367. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list/zm.html +0 -0
  368. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/university_list.txt +0 -0
  369. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/url.txt +0 -0
  370. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/webTopWords +0 -0
  371. /data/{perl → svm-header-parse}/HeaderParseService/resources/database/words +0 -0
  372. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/10ContextModelfold1 +0 -0
  373. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/10Modelfold1 +0 -0
  374. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/11ContextModelfold1 +0 -0
  375. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/11Modelfold1 +0 -0
  376. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/12ContextModelfold1 +0 -0
  377. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/12Modelfold1 +0 -0
  378. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/13ContextModelfold1 +0 -0
  379. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/13Modelfold1 +0 -0
  380. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/14ContextModelfold1 +0 -0
  381. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/14Modelfold1 +0 -0
  382. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/15ContextModelfold1 +0 -0
  383. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/15Modelfold1 +0 -0
  384. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/1ContextModelfold1 +0 -0
  385. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/1Modelfold1 +0 -0
  386. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/2ContextModelfold1 +0 -0
  387. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/2Modelfold1 +0 -0
  388. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/3ContextModelfold1 +0 -0
  389. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/3Modelfold1 +0 -0
  390. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/4ContextModelfold1 +0 -0
  391. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/4Modelfold1 +0 -0
  392. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/5ContextModelfold1 +0 -0
  393. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/5Modelfold1 +0 -0
  394. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/6ContextModelfold1 +0 -0
  395. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/6Modelfold1 +0 -0
  396. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/7ContextModelfold1 +0 -0
  397. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/7Modelfold1 +0 -0
  398. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/8ContextModelfold1 +0 -0
  399. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/8Modelfold1 +0 -0
  400. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/9ContextModelfold1 +0 -0
  401. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/9Modelfold1 +0 -0
  402. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/NameSpaceModel +0 -0
  403. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/NameSpaceTrainF +0 -0
  404. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/WrapperBaseFeaDict +0 -0
  405. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/WrapperContextFeaDict +0 -0
  406. /data/{perl → svm-header-parse}/HeaderParseService/resources/models/WrapperSpaceAuthorFeaDict +0 -0
@@ -1,500 +0,0 @@
1
- <author> A. Cau, R. Kuiper, and W.-P. de Roever. </author> <title> Formalising Dijkstra's development strategy within Stark's formalism. </title> <editor> In C. B. Jones, R. C. Shaw, and T. Denvir, editors, </editor> <booktitle> Proc. 5th. BCS-FACS Refinement Workshop, </booktitle> <date> 1992. </date>
2
- <author> M. Kitsuregawa, H. Tanaka, and T. Moto-oka. </author> <title> Application of hash to data base machine and its architecture. </title> <journal> New Generation Computing, </journal> <volume> 1(1), </volume> <date> 1983. </date>
3
- <author> Alexander Vrchoticky. </author> <title> Modula/R language definition. </title> <tech> Technical Report TU Wien rr-02-92, version 2.0, </tech> <institution> Dept. for Real-Time Systems, Technical University of Vienna, </institution> <date> May 1993. </date>
4
- <author> Marc Shapiro and Susan Horwitz. </author> <title> Fast and accurate flow-insensitive points-to analysis. </title> <booktitle> In Proceedings of the 24th Annual ACM Symposium on Principles of Programming Languages, </booktitle> <date> January 1997. </date>
5
- <author> W. Landi and B. G. Ryder. </author> <title> Aliasing with and without pointers: A problem taxonomy. </title> <institution> Center for Computer Aids for Industrial Productivity </institution> <tech> Technical Report CAIP-TR-125, </tech> <institution> Rutgers University, </institution> <date> September 1990. </date>
6
- <author> W. H. Enright. </author> <title> Improving the efficiency of matrix operations in the numerical solution of stiff ordinary differential equations. </title> <journal> ACM Trans. Math. Softw., </journal> <volume> 4(2), </volume> <pages> 127-136, </pages> <date> June 1978. </date>
7
- <author> Gmytrasiewicz, P. J., Durfee, E. H., & Wehe, D. K. </author> <date> (1991a). </date> <title> A decision theoretic approach to coordinating multiagent interaction. </title> <booktitle> In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, </booktitle> <pages> pp. 62-68 </pages> <location> Sydney, Australia. </location>
8
- <author> A. Bookstein and S. T. Klein, </author> <title> Detecting content-bearing words by serial clustering, </title> <booktitle> Proceedings of the Nineteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, </booktitle> <pages> pp. 319327, </pages> <date> 1995. </date>
9
- <author> U. Dayal, H. Garcia-Molina, M. Hsu, B. Kao, and M.- C. Shan. </author> <title> Third generation TP monitors: A database challenge. </title> <booktitle> In ACM SIGMOD Conference on Management of Data, </booktitle> <pages> pages 393-397, </pages> <location> Washington, D. C., </location> <date> May 1993. </date>
10
- <author> C. Qiao and R. Melhem, </author> <title> "Reducing Communication Latency with Path Multiplexing in Optically Interconnected Multiprocessor Systems", </title> <booktitle> Proc. of HPCA-1, </booktitle> <date> 1995. </date>
11
- <author> Ramadge, P., & Wonham, W. </author> <date> (1989). </date> <title> The Control of Discrete Event Systems. </title> <booktitle> Proceedings of the IEEE, </booktitle> <volume> 77 (1), </volume> <pages> 81-98. </pages>
12
- <author> Schaal, S., & Atkeson, C. </author> <date> (1994). </date> <title> Robot juggling: An implementation of memory-based learning. </title> <journal> Control Systems, </journal> <volume> 14, </volume> <pages> 57-71. </pages>
13
- <author> Hinton, G. E., & Nowlan, S. J. </author> <date> (1987). </date> <title> How learning can guide evolution. </title> <journal> Complex Systems, </journal> <volume> 1, </volume> <pages> 495-502. </pages>
14
- <author> Cameron-Jones, R. M., & Quinlan, J. R. </author> <date> (1994). </date> <title> Efficient top-down induction of logic programs. </title> <journal> SIGART Bulletin, </journal> <volume> 5 (1), </volume> <pages> 33-42. </pages>
15
- <author> D. Ourston and R. J. Mooney. </author> <title> Changing the Rules: A Comprehensive Approach to Theory Refinement. </title> <booktitle> In Proceedings of the Eighth International Conference on Machine Learning, </booktitle> <pages> pages 485-489, </pages> <date> 1991. </date>
16
- <author> E. Styer, </author> <title> "Improving Fast Mutual Exclusion", </title> <booktitle> Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, </booktitle> <date> 1992, </date> <pages> pp. 159-168. </pages>
17
- <author> Pearl, J. </author> <date> (1988). </date> <title> Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. </title> <publisher> Morgan Kaufmann. </publisher>
18
- <author> Larry D. Wittie, Gudjun Hermannsson, and Ai Li. </author> <title> Eager sharing for efficient massive parallelism. </title> <booktitle> In 1992 International Conference on Parallel Processing, </booktitle> <pages> pages 251-255, </pages> <location> St. Charles, IL, </location> <date> August 1992. </date> <pages> 11 </pages>
19
- <author> Bylander, T. </author> <date> (1992). </date> <title> Complexity results for serial decomposability. </title> <booktitle> In Proceedings of National Conference on Artificial Intelligence, </booktitle> <pages> pp. 729-734. </pages> <location> San Jose, CA. </location> <publisher> AAAI Press. </publisher>
20
- <editor> A. Elmagarmid, editor. </editor> <title> Transaction Models for Advanced Database Applications. </title> <publisher> Morgan-Kaufmann, </publisher> <date> 1992. </date>
21
- <author> T. Fahringer, R. Blasko, and H. Zima. </author> <title> Automatic performance prediction to support parallelization of Fortran programs for massively parallel systems. </title> <booktitle> In Proceedings of the 1992 ACM International Conference on Supercomputing, </booktitle> <location> Washington, DC, </location> <date> July 1992. </date>
22
- <author> A. D. Kallis and D. Klappholz, </author> <title> ``Reaching definitions analysis on code containing array references,'' </title> <booktitle> Conf. Rec. of the 4th Workshop on Languages and Compilers for Parallel Computing, </booktitle> <date> Aug. 1991. </date>
23
- <author> R. Fletcher. </author> <title> Practical Methods of Optimization. </title> <publisher> John Wiley & Sons, </publisher> <date> 1987. </date>
24
- <author> Clark, K. L., </author> <title> Negation as Failure, </title> <editor> in: H. Gallaire and J. Minker (eds.), </editor> <booktitle> Logic and Data Bases, </booktitle> <publisher> Plenum Press, </publisher> <location> New York, </location> <date> 1978. </date>
25
- <author> Gent, I. P., & Walsh, T. </author> <date> (1994a). </date> <title> Easy problems are sometimes hard. </title> <journal> Artificial Intelligence, </journal> <volume> 70, </volume> <pages> 335-345. </pages>
26
- <author> P. D. Alevizos. </author> <title> A linear time algorithm for labeling planar projections of polyhedra. </title> <booktitle> IEEE/RSJ IROS '91 </booktitle> <location> (Osaka, Japan), </location> <date> 1991. </date>
27
- <author> Ancona, D., and Zucca, E. </author> <title> An algebraic approach to mixins and modularity. </title> <booktitle> In Proc. Conference on Algebraic and Logic Programming </booktitle> <location> (Berlin, </location> <date> 1996), </date>
28
- <author> P. Yang and J. H. Chern </author> <title> "Design for Reliability: The Major Challenge for VLSI," </title> <journal> Proceedings of IEEE, </journal> <volume> Vol. 81, No. 5, </volume> <pages> pp. 730-744, </pages> <date> May 1993. </date>
29
- <author> M. Gupta and P. Banerjee. </author> <title> Automatic data partitioning on distributed memory multiprocessors. </title> <booktitle> In Proceedings of the 6th Distributed Memory Computing Conference, </booktitle> <location> Portland, OR, </location> <date> April 1991. </date>
30
- <author> Harry Heffes and David Lucantoni. </author> <title> A markov modulated characterization of voice and data traffic and related statistical multiplexer performance. </title> <journal> IEEE J.Select.Areas Commun., </journal> <volume> SAC- 4, </volume> <pages> 856-867, </pages> <date> September 1986. </date>
31
- <author> C. Ghezzi, D. Mandriolli, and A. Morzenti. </author> <title> Trio: A logic language for executable specifications of real-time systems. </title> <journal> Journal of Systems and Software, </journal> <volume> 12(2), </volume> <pages> 107-123, </pages> <date> May 1990. </date>
32
- <author> Cohen, W. W. </author> <date> (1992). </date> <title> Compiling knowledge into an explicit bias. </title> <booktitle> In Proceedings of the Ninth International Conference on Machine Learning. </booktitle>
33
- <author> Winston, P. H., Binford, T. O., Katz, B., & Lowry, M. </author> <date> (1983). </date> <title> "Learning physical descriptions from functional definitions, examples, and precedents". </title> <booktitle> National Conference on Artificial Intelligence, </booktitle> <pages> 433-439. </pages>
34
- <author> Domingos, P. </author> <date> (1996b). </date> <title> Using partitioning to speed up specific-to-general rule induction. </title> <booktitle> In Proceedings of the AAAI-96 Workshop on Integrating Multiple Learned Models, </booktitle> <pages> pp. 29-34. </pages>
35
- <author> P. T. Harker and J.-S. Pang. </author> <title> Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms, and applications. </title> <booktitle> Mathematical Programming, </booktitle> <volume> 48(2), </volume> <pages> 161-220, </pages> <date> September 1990. </date>
36
- <author> Knopfmacher, A., and Warlimont, R. </author> <title> Distinct degree factorizations for polynomials over a finite field. </title> <journal> Trans. Amer. Math. Soc. </journal> <volume> 347, </volume> <date> (1995), </date> <pages> 2235-2243. </pages>
37
- <author> Feferman, S., </author> <title> Transfinite Recursive Progressions of Axiomatic Theories, </title> <journal> J. Symbolic Logic, </journal> <volume> 27, </volume> <pages> 259-316 </pages> <date> (1962). </date>
38
- <author> K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. </author> <title> Memory consistency and event ordering in scalable shared-memory multiprocessors. </title> <booktitle> In Proceedings of the 17th Annual International Symposium on Computer Architecture, </booktitle> <pages> pages 15-26, </pages> <date> May 1990. </date>
39
- <author> Etzioni, O. and Weld, D. </author> <date> (1994) </date> <title> A Softbot-based Interface to the Internet, </title> <journal> Comm. of th e ACM, </journal> <volume> 37(7), </volume> <pages> pages 72-76. </pages>
40
- <author> S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, and C. Tseng. </author> <title> An overview of the fortran d programming system. </title> <tech> Technical Report CRPC-TR91121, </tech> <institution> Dept of computer Science, Rice University, </institution> <date> 1991. </date>
41
- <author> R. Chandra, S. Devine, B. Verghese, A. Gupta, M. Rosenblum, </author> <title> Scheduling and Page Migration for Multiprocessor Compute Servers. </title> <booktitle> Proc. 6th Int'l. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI), </booktitle> <location> San Jose, CA, </location> <pages> pp. 12-24, </pages> <date> October 1994. </date>
42
- <author> R. S. Zemel, M. C. Mozer, and G. E. Hinton. </author> <title> TRAFFIC: Recognizing objects using hierarchical reference frame transformations. </title> <editor> In D. S. Touretzky, editor, </editor> <booktitle> Neural Information Processing Systems, </booktitle> <volume> Vol. 2, </volume> <pages> pages 266-273. </pages> <publisher> Morgan Kaufmann, </publisher> <location> San Mateo, CA, </location> <date> 1990. </date>
43
- <author> Corkill, D. D. </author> <date> (1979). </date> <title> Hierarchical planning in a distributed environment. </title> <booktitle> In Proceedings of the Sixth International Joint Conference on Artificial Intelligence, </booktitle> <pages> pp. 168-175 </pages> <location> Tokyo. </location>
44
- <author> D. Callahan, S. Carr, and K. Kennedy. </author> <title> Improving register allocation for subscripted variables. </title> <booktitle> In Proceedings of the SIGPLAN '90 Conference on Program Language Design and Implementation, </booktitle> <location> White Plains, NY, </location> <date> June 1990. </date>
45
- <author> Forsyth, C. H., </author> <title> Implementation of the Worst-Case Execution Time Analyser </title> <date> June 1992, </date> <institution> York Software Engineering Ltd., </institution> <location> University of York: </location> <booktitle> Task 8 Volume E Deliverable on ESTEC contract 9198/90/NL/SF </booktitle>
46
- <author> J. Tromp, </author> <title> "How to Construct an Atomic Variable", </title> <booktitle> Proceedings of the Third International Workshop on Distributed Algorithms, Lecture Notes in Computer Science 392, </booktitle> <publisher> Springer Verlag, </publisher> <date> 1989, </date> <pages> pp. 292-302. </pages>
47
- <institution> Hughes Network Systems, DirecPC Home Page, </institution> <location> http://www.direcpc.com/, </location> <date> Oct, 1996. </date>
48
- <author> T. E. Anderson, H. M. Levy, B. N. Bershad, and E. D. Lazowska. </author> <title> "The interaction of architecture and operating system design". </title> <booktitle> In ASPLOS IV, </booktitle> <pages> pages 108-122, </pages> <date> 1991. </date>
49
- <author> F. Jahanian and Al Mok. </author> <title> Safety analysis of timing properties in real-time systems. </title> <journal> IEEE Transactions on Software Engineering, </journal> <volume> 12(9), </volume> <pages> 890-904, </pages> <date> September 1986. </date>
50
- <author> Hughes, G. E., & Cresswell, J. M. </author> <date> (1968). </date> <title> An Introduction to Modal Logic. </title> <publisher> Methuen and Co. Ltd. </publisher>
51
- <author> Ostroff, J. S., </author> <title> "Temporal Logic for Real-Time Systems", </title> <booktitle> Advanced Software Development Series, </booktitle> <location> England, </location> <date> 1989. </date>
52
- <author> T. Imielinski, S. Viswanathan, </author> <title> Adaptive Wire less Information Systems, </title> <booktitle> Proc. of SIGDBS Conf., </booktitle> <location> Tokyo, </location> <date> October, 1994. </date>
53
- <author> Pagallo, G., & Haussler, D. </author> <date> (1990). </date> <title> Boolean feature discovery in empirical learning. </title> <booktitle> Machine Learning, </booktitle> <volume> 5 (1), </volume> <pages> 71-99. </pages>
54
- <author> D. Waltz. </author> <title> Understanding line-drawings of scenes with shadows. </title> <journal> Artificial Intelligence, </journal> <volume> 2, </volume> <pages> 79-116, </pages> <date> 1971. </date>
55
- <author> Cheeseman, P., Kanefsky, B., & Taylor, W. </author> <date> (1991). </date> <title> Where the really hard problems are. </title> <booktitle> 12th International Joint Conference on Artificial Intelligence, </booktitle> <pages> 163-169. </pages>
56
- <author> Cleveland, W. S., and C. Loader, </author> <date> (1994). </date> <title> Computational Methods for Local Regression. </title> <tech> Technical Report 11, </tech> <location> Murray Hill, NJ: </location> <institution> AT&T Bell Laboratories, Statistics Department. </institution>
57
- <author> T. W. Sandholm and V. R. Lesser, </author> <title> "An Exchange Protocol Without Enforcement", </title> <booktitle> in the Proceedings of 13th International Distributed Artificial Intelligence Workshop, </booktitle> <location> Seattle, WA., </location> <date> July 1994. </date>
58
- <author> Mozer, M. C. & Smolensky, P. </author> <date> (1988). </date> <title> Skeletonization: A technique for trimming the fat from a network via relevance assessment. </title> <booktitle> Advances in Neural Information Processing Systems </booktitle> <volume> (Vol. 1), </volume> <pages> (pp. 107-115). </pages> <location> Denver, CO: </location> <publisher> Morgan Kaufmann. </publisher>
59
- <author> A. Gupta, I. Mumick, and V. Subrahmanian. </author> <title> Maintaining views incrementally. </title> <booktitle> In Preceedings of the 1993 ACM SIGMOD International Conference on Management of Data, </booktitle> <pages> pages 157-166, </pages> <location> Washington, D. C., </location> <date> May 1993. </date>
60
- <author> Dietterich, T. G., & Bakiri, G. </author> <date> (1995). </date> <title> Solving multiclass learning problems via error-correcting output codes. </title> <journal> Journal of Artificial Intelligence Research, </journal> <volume> 2, </volume> <pages> 263-286. </pages>
61
- <author> A. P. Witkin. </author> <title> Scale-space filtering. </title> <booktitle> In Proc. Intl. Joint Conf. Art. Intell., </booktitle> <pages> pages 1019-1023, </pages> <date> 1983. </date>
62
- <author> Fink, E., & Veloso, M. </author> <date> (1994). </date> <title> Formalizing the prodigy planning algorithm. </title> <tech> CMU CS Tech Report CMU-CS-94-123. </tech>
63
- <author> Langley, P., & Simon, H. A. </author> <date> (1995). </date> <title> Applications of machine learning and rule induction. </title> <journal> Communications of the ACM, </journal> <volume> 38 (11), </volume> <pages> 55-64. </pages>
64
- <author> Kirkpatrick, S., Gelatt, C., & Vecchi, M. </author> <date> (1983). </date> <title> Optimization by simulated annealing. </title> <journal> Science, </journal> <volume> 220 (4598), </volume> <pages> 671-680. </pages>
65
- <author> C. Rosene, </author> <title> ``Incremental dependence analysis,'' </title> <booktitle> Ph.D. thesis, </booktitle> <institution> Rice University, </institution> <date> March 1990. </date>
66
- <author> Michalski, R. </author> <date> (1983). </date> <title> A theory and methodology of inductive learning. </title> <journal> Artificial Intelligence, </journal> <volume> 20, </volume> <pages> 111-161. </pages>
67
- <author> David R. Cheriton, Hendrik A. Goosen, and Philip Machanick. </author> <title> Restructuring a Parallel Simulation to Improve Cache Behavior in a Shared-Memory Multiprocessor: A First Experience. </title> <booktitle> In International Symposium on Shared Memory Multiprocessing, </booktitle> <pages> pages 109-118, </pages> <date> April 1991. </date>
68
- <author> Gmytrasiewicz, P. J., & Durfee, E. H. </author> <date> (1992). </date> <title> A logic of knowledge and belief for recursive modeling: Preliminary report. </title> <booktitle> In Proceedings of the Tenth National Conference on Artificial Intelligence, </booktitle> <pages> pp. 628-634 </pages> <location> San Jose, California. </location>
69
- <author> Baader, F. </author> <date> (1991). </date> <title> Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. </title> <booktitle> In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI-91) </booktitle> <location> Sydney, Australia. </location>
70
- <author> E. Dantsin and A. Voronkov. </author> <title> Complexity of query answering in logic databases with complex values. </title> <editor> In S. Adian and A. Nerode, editors, </editor> <booktitle> Logical Foundations of Computer Science. 4th International Symposium, LFCS'97, </booktitle> <volume> volume 1234, </volume> <booktitle> of Lecture Notes in Computer Science, </booktitle> <pages> pages 56-66, </pages> <location> Yaroslavl, Russia, </location> <date> July 1997. </date>
71
- <author> M. Peot and D. E. Smith. </author> <title> Threat-removal strategies for partial-order planning. </title> <booktitle> In Proceedings of the Eleventh National Conference on Artificial Intelligence, </booktitle> <pages> pages 492-499, </pages> <location> Washington, D. C., </location> <date> 1993. </date>
72
- <author> Burton, Robert P. and Sutherland, Ivan E. </author> <title> "Twinkle Box: A Three-dimensional Computer Input Device". </title> <booktitle> in Proceedings of the National Computer Conference </booktitle> <date> (1974) </date> <pages> pp. 513-520. </pages>
73
- <author> Barry Wilkinson, </author> <booktitle> Digital System Design </booktitle> <publisher> Prentice Hall </publisher> <date> 1987. </date>
74
- <author> Andreas Ermedahl and Jan Gustafsson. </author> <title> Deriving annotations for tight calculation of execution time. </title> <institution> Department of Computer Systems, University of Uppsala and Department of Computer Engineering, Malardalen University, Sweden. </institution> <note> Submitted to EuroPar'97, </note> <date> February 1997. </date>
75
- <author> Horn, B. </author> <date> (1986). </date> <title> Robot Vision, </title> <publisher> MIT Press. </publisher>
76
- <author> J. Dongarra, J. Bunch, C. Moler, and G. Stewart. </author> <title> LINPACK User's Guide. </title> <publisher> SIAM Publications, </publisher> <location> Philadelphia, PA, </location> <date> 1979. </date>
77
- <author> Dempster, A. P., Laird, N. M., & Rubin, D. B. </author> <date> (1977). </date> <title> Maximum-likelihood from incomplete data via the EM algorithm. </title> <journal> Journal of Royal Statistical Society B, </journal> <volume> 39, </volume> <pages> 1-38. </pages>
78
- <author> Peter Puschner and Anton Schedl. </author> <title> A tool for the computation of worst case task execution times. </title> <booktitle> In Proc. of the 5th EUROMICRO Workshop on Real-Time Systems, </booktitle> <date> 1993. </date>
79
- <author> Rivest, R. L., & Schapire, R. E. </author> <date> (1989). </date> <title> Inference of Finite Automata Using Homing Sequences. </title> <booktitle> In Proceedings of the 21th ACM Symp. on Theory of Computing, </booktitle> <pages> pp. 411-420. </pages>
80
- <author> D. M. Chiarulli, S. P. Levitan, R. G. Melhem, and C. Qiao. </author> <title> Locality based control algorithms for reconfigurable optical interconnection networks. </title> <journal> Applied Optics, </journal> <note> to appear. </note>
81
- <author> W. Sterling, F. Carino and C. Boss, </author> <title> "Multimedia Databases and Servers," </title> <journal> AT&T Technical Journal, </journal> <volume> Vol. 74, No. 5, </volume> <date> September / October 1995, </date> <pages> pp. 54-67. </pages>
82
- <author> Salomons, O. </author> <date> (1994). </date> <title> Computer support in the design of mechanical products. </title> <tech> Ph.D. Thesis, </tech> <institution> Universiteit Twente, </institution> <location> Netherlands. </location>
83
- <author> S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta. </author> <title> The SPLASH-2 Programs: Characterization and Methodological Considerations. </title> <booktitle> In Proceedings of the 22nd International Symposium on Computer Architecture, </booktitle> <pages> pages 24-36, </pages> <date> June 1995. </date>
84
- <author> J. E. Dennis and R. B. Schnabel. </author> <title> Numerical Methods for Unconstrained Optimization and Nonlinear Equations. </title> <booktitle> Prentice-Hall Series in Computational Mathematics. </booktitle> <publisher> Prentice-Hall, Inc, </publisher> <location> Englewood Cliffs, New Jersey, </location> <date> 1983. </date>
85
- <author> J. Borenstein and Y. Koren, </author> <title> "Obstacle avoidance with ultrasonic sensors," </title> <journal> IEEE J. Robotics Automation </journal> <volume> 4, </volume> <pages> pp. 213-218, </pages> <date> 1988. </date>
86
- <author> V. Lifschitz. </author> <title> On the semantics of STRIPS. </title> <booktitle> In Reasoning about Actions and Plans: Proceedings of the 1986 Workshop, </booktitle> <location> Timberline, OR, </location> <date> 1987. </date> <note> Reprinted in Readings in Planning, </note> <editor> J. Allen, J. Hendler, A. Tate (eds.), </editor> <publisher> Morgan-Kaufmann, </publisher> <date> 1990, </date> <pages> 523-530. </pages>
87
- <author> W. Li. </author> <title> Linearly convergent descent methods for unconstrained minimization of convex quadratic splines. </title> <tech> Technical Report TR93-3, </tech> <institution> Department of Mathematics and Statistics, Old Dominion University, </institution> <location> Norfolk, VA 23529, </location> <date> 1993. </date> <journal> Journal of Optimization Theory and Applications, </journal> <note> to appear. </note>
88
- <author> Moggi, E. </author> <title> Computational lambda-calculus and monads. </title> <booktitle> In Proc. Symposium on Logic in Computer Science, </booktitle> <date> 1989, </date> <pages> 14-23. </pages>
89
- <author> K. Smith, W. Appelbe, and K. Stirewalt. </author> <title> Incremental dependence analysis for interactive parallelization. </title> <booktitle> In Proceedings of the 1990 ACM International Conference on Supercomputing, </booktitle> <location> Amsterdam, The Netherlands, </location> <date> June 1990. </date>
90
- <author> A. S. Acampora and M. J. Karol, </author> <title> "An Overview of Lightwave Packet Network." </title> <journal> IEEE Network Mag. </journal> <volume> 3(1), </volume> <pages> pages 29-41, </pages> <date> 1989. </date>
91
- <author> Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. </author> <date> (1989). </date> <title> Learnability and the Vapnik-Chervonenkis dimension. </title> <journal> Journal of the ACM, </journal> <volume> 36 (4), </volume> <pages> 929-965. </pages>
92
- <author> Tim Watson. </author> <title> A new representation technique for genetic algorithms. </title> <editor> In Keane et al. </editor> <volume> [4], </volume> <pages> pages 233-246. </pages>
93
- <author> Hermenegildo, M. V., </author> <title> An Abstract Machine for Restricted AND-parallel Execution of Logic Programs, </title> <booktitle> in Third International Conference on Logic Programming, </booktitle> <publisher> Springer-Verlag, </publisher> <location> Berlin, </location> <date> 1986. </date>
94
- <author> L. G. Valiant. </author> <title> A Bridging Model for Parallel Computation. </title> <journal> Communications of the ACM, </journal> <volume> 33(8), </volume> <pages> 103-111, </pages> <date> 1990. </date>
95
- <author> Ling, C. X. </author> <date> (1995). </date> <tech> Personal communication. </tech>
96
- <author> Albert R. Meyer and Mitchell Wand. </author> <title> Continuation semantics in typed lambda calculi (summary). </title> <editor> In Rohit Parikh, editor, </editor> <booktitle> Logics of Programs, </booktitle> <volume> volume 193, </volume> <booktitle> of Lecture Notes in Computer Science, </booktitle> <pages> pages 219-224. </pages> <publisher> Springer-Verlag, </publisher> <date> 1985. </date>
97
- <author> S. E. Conry, K. Kuwabara, V. R. Lesser and R. A. Meyer. </author> <date> (1991) </date> <title> Multistage Negotiation for Distributed Satisfaction, </title> <journal> IEEE Transactions on Systems, Man, and Cybernetics, Special Issue on Distributed Artificial Intelligence, </journal> <volume> 21(6), </volume> <pages> 1462-1477 </pages>.
98
- <author> Chernoff, H. </author> <date> (1952). </date> <title> A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations. </title> <journal> Annals of Mathematical Statistics, </journal> <volume> 23, </volume> <pages> 493-509. </pages>
99
- <author> Flajolet, P., Gourdon, X., and Panario, D. </author> <title> Random polynomials and polynomial factorization. </title> <booktitle> In Automata, Languages, and Programming </booktitle> <date> (1996), </date> <editor> F. Meyer auf der Heide and B. Monien, Eds., </editor> <volume> vol. 1099, </volume> <booktitle> of Lecture Notes in Computer Science, </booktitle> <publisher> Springer-Verlag, </publisher> <pages> pp. 232-243. </pages> <booktitle> Proceedings of the 23rd ICALP Conference, Paderborn, </booktitle> <date> July 1996. </date>
100
- <author> Lars Ole Andersen. </author> <title> Program Analysis and Specialization for the C Programming Language. </title> <tech> PhD thesis, </tech> <institution> DIKU, University of Copenhagen, </institution> <date> May 1994. </date>
101
- <author> L. G. Votta and M. L. Zajac. </author> <title> Design process improvement case study using process waiver data. </title> <booktitle> In Proceedings of the Fifth European Conference in Software Engineering, </booktitle> <volume> volume 989 </volume> <booktitle> of Lecture Notes in Computer Science, </booktitle> <pages> pages 44-58. </pages> <publisher> Springer-Verlag, </publisher> <date> September 1995. </date>
102
- <author> J. B. Kam and J. D. Ullman, </author> <title> ``Monotone data flow analysis frameworks,'' </title> <journal> Acta Informatica, </journal> <volume> vol. 7, no. 3, </volume> <pages> pp. 305-317, </pages> <date> Jul. 1977. </date>
103
- <author> Cooper, G. F. </author> <date> (1990). </date> <title> The computational complexity of probabilistic inference using Bayesian belief networks. </title> <journal> Artificial Intelligence, </journal> <volume> 42(2-3), </volume> <pages> 393-405. </pages>
104
- <author> C. Pedregal-Martin and K. Ramamritham. </author> <title> Delegation: Efficiently Rewriting History. </title> <tech> TR95-90 </tech> <institution> Computer Science Dept., University of Massachusetts, </institution> <location> Amherst, </location> <date> October 1995. </date>
105
- <author> W. Cohen. </author> <title> Learning from textbook knowledge: A case study. </title> <booktitle> In AAAI-90, </booktitle> <date> 1990. </date>
106
- <author> M. Reiman, and B. Simon. </author> <title> An Interpolation Approximation for Queueing Systems with Poisson Input. </title> <journal> Operations Research </journal> <volume> 36, 3 </volume> <date> (1988), </date> <pages> 454-469. </pages>
107
- <author> M. Herlihy and J. Wing, </author> <title> "Axioms for Concurrent Objects", </title> <booktitle> Proceedings of the 14th ACM Symposium on Principles of Programming Languages, </booktitle> <pages> pp. 13-26, </pages> <date> 1987. </date>
108
- <author> Linden, A., & Weber, F. </author> <date> (1993). </date> <title> Implementing inner drive by competence reflection. </title> <editor> In Roitblat, H. (Ed.), </editor> <booktitle> Proceedings of the 2nd International Conference on Simulation of Adaptive Behavior. </booktitle> <publisher> MIT Press, </publisher> <location> Cambridge, MA. </location>
109
- <author> Holte, R. C., Acker, L. E., & Porter, B. W. </author> <date> (1989). </date> <title> Concept learning and the problem of small disjuncts. </title> <booktitle> In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, </booktitle> <pages> pp. 813-818 </pages> <location> Detroit. </location> <publisher> Morgan Kaufmann. </publisher> <pages> 415 </pages>
110
- <author> I. Meilijson and U. Yechiali, </author> <title> "On optimal right-of-way policies at a single-server station when insertion of idles times is permitted," </title> <journal> Stoch. Proc. and their Appl. </journal> <volume> 6, </volume> <pages> 25-32, </pages> <date> 1977. </date>
111
- <author> Hopcroft, J., & Ullman, J. </author> <date> (1979). </date> <title> Introduction to Automata Theory, Languages, and Computation. </title> <publisher> Addison-Wesley. </publisher>
112
- <author> S. Aditya, C. Flood, and J. Hicks. </author> <title> Garbage collection for strongly-typed languages using run-time type reconstruction. </title> <booktitle> In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, </booktitle> <pages> pages 12-23, </pages> <location> Orlando, FL, </location> <date> June 1994. </date>
113
- <author> Arthur M. Keller and Julie Basu. </author> <title> A predicate-based caching scheme for client-server database architectures. </title> <booktitle> In Proceedings of PDIS-94, </booktitle> <date> 1994. </date>
114
- <author> P. T. Zellweger. </author> <title> Interactions between high-level debugging and optimised code. </title> <tech> PhD thesis, </tech> <institution> Computer Science Division, University of California, Berkeley, </institution> <date> 1984. </date> <note> Published as Xerox PARC Technical Report CSL-84-5. </note>
115
- <author> Oliker, S., Furst, M., & Maimon, O. </author> <date> (1992). </date> <title> A distributed genetic algorithm for neural network design and training. </title> <journal> Complex Systems, </journal> <volume> 6, </volume> <pages> 459-477. </pages>
116
- <author> B. K. P. Horn. </author> <title> Robot Vision. </title> <publisher> MIT Press, </publisher> <location> Cambridge, MA, </location> <date> 1986. </date>
117
- <author> M. J. Feeley and H. M. Levy. </author> <title> Distributed shared memory with versioned objects. </title> <booktitle> In OOPSLA '92 Conference Proceedings, </booktitle> <pages> pages 247-262, </pages> <date> October 1992. </date>
118
- <author> Gardenfors, Peter </author> <date> (1988). </date> <title> Knowledge in Flux. </title> <publisher> The MIT Press, </publisher> <location> Cambridge, MA. </location>
119
- <author> De Raedt, L., & Bruynooghe, M. </author> <date> (1990). </date> <title> Indirect relevance and bias in inductive concept learning. </title> <journal> Knowledge Acquisition, </journal> <volume> 2, </volume> <pages> 365-390. </pages> <editor> desJardins, M., & Gordon, D. F. (Eds.). </editor> <date> (1995). </date>
120
- <author> Reilly, W. S. </author> <date> (1996). </date> <title> Believable Emotional and Social Agents. </title> <tech> Ph.D. thesis, </tech> <institution> School of Computer Science, Carnegie Mellon University. </institution>
121
- <author> Arun Garg. </author> <title> Parallel STREAMS: A multi-processor implementation. </title> <booktitle> In Proceedings of the Winter 1990 USENIX Conference, </booktitle> <pages> pages 163-176, </pages> <location> Washington, D. C., </location> <date> January 1990. </date>
122
- <author> J. C. Butcher. </author> <title> Diagonally implicit general linear methods for ordinary differential equations. </title> <tech> Technical report, </tech> <institution> University of Auckland, </institution> <date> 1993. </date> <note> Submitted for publication. </note>
123
- <author> Bederson, B. B., & Hollan, J. D., </author> <title> Pad++: A zooming graphical interface for exploring alternate interface physics, </title> <booktitle> Proceedings of User Interface Software and Technology (UIST 94) 1726, ACM, </booktitle> <location> New York, </location> <date> 1994. </date>
124
- <author> Gmytrasiewicz, P. J., Durfee, E. H., & Wehe, D. K. </author> <date> (1991b). </date> <title> The utility of communication in coordinating intelligent agents. </title> <booktitle> In Proceedings of the Ninth National Conference on Artificial Intelligence, </booktitle> <pages> pp. 166-172. </pages>
125
- <author> A. Gupta, V Harinarayan, D. Quass. </author> <title> "Aggregate-Query Processing in Data Warehousing Environments", </title> <booktitle> Proceedings of the 21st VLDB Conference, </booktitle> <location> Zurich, Swizerland, </location> <date> 1995. </date>
126
- <author> Ling Tony Chen, R. Drach, M. Keating, S . Louis, Doron Rotem, Arie Shoshani, </author> <title> Efficient organization and access of multidimensional datasets on tertiary storage systems, </title> <journal> Information Systems </journal> <volume> 20(2), </volume> <pages> pp. 155-183 </pages> <date> (1995). </date>
127
- <author> Deransart, P., Jourdan, M., and Lorho, B., </author> <title> Attribute Grammars: Definitions, Systems and Bibliography, </title> <booktitle> Lecture Notes in Computer Science, </booktitle> <volume> Vol. 323, </volume> <publisher> Springer-Verlag, </publisher> <location> New York, NY </location> <date> (1988). </date>
128
- <author> E. Mohr, D. A. Kranz, and R. H. Halstead. </author> <title> Lazy Task Creation: a Technique for Increasing the Granularity of Parallel Programs. </title> <booktitle> In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, </booktitle> <pages> pages 185-197, </pages> <date> June 1990. </date>
129
- <editor> Richter (Eds.), </editor> <title> Topics in Case-Based Reasoning. </title> <location> Berlin: </location> <publisher> Springer-Verlag, </publisher> <pages> pp. 167-181. </pages>
130
- <author> Scott, D., and de Souza, C. S. </author> <date> 1990. </date> <title> Getting the message across in RST-based text generation. </title> <editor> In Dale, R.; Mellish, C.; and Zock, M., eds., </editor> <booktitle> Current Research in Natural Language Generation. </booktitle> <location> New York: </location> <publisher> Academic Press. </publisher> <pages> 47-73. </pages>
131
- <author> Poole, David </author> <date> (1988). </date> <title> A logical framework for default reasoning. </title> <journal> Artificial Intelligence, </journal> <volume> 36(1), </volume> <pages> 27-47 </pages>.
132
- <author> S. J. Eggers, D. R. Keppel, E. J. Koldinger, and H. M. Levy. </author> <title> Techniques for efficient inline tracing on a shared-memory multiprocessor. </title> <booktitle> In Proceedings of the International Conference on Measurement and Modeling of Computer Systems, </booktitle> <pages> pages 37-47, </pages> <date> May 1990. </date>
133
- <author> S. Abiteboul and V. Vianu. </author> <title> Datalog extensions for database queries and updates. </title> <journal> Journal of Computer and System Sciences, </journal> <volume> 43, </volume> <pages> 62-124, </pages> <date> 1991. </date>
134
- <author> R. Lipsett, C. Schaefer, C. Ussery, </author> <title> VHDL: Hardware Description and Design, </title> <publisher> Kluwer Academic Publishers, </publisher> <date> 1989. </date>
135
- <author> S. Majumdar, D. Eager, and R. Bunt. </author> <title> Scheduling in Multiprogrammed Parallel Systems. </title> <booktitle> Proc. of the ACM SIGMETRICS Conf. on Measurement & Modeling of Computer Systems </booktitle> <volume> 16, 1, </volume> <date> (May 1988), </date> <pages> 104-113. </pages>
136
- <author> S. Carr, K. S. McKinley, and C.-W. Tseng. </author> <title> Compiler optimizations for improving data locality. </title> <booktitle> In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI), </booktitle> <location> San Jose, CA, </location> <date> October 1994. </date>
137
- <author> Fikes, R. E., & Nilsson, N. J. </author> <date> (1971). </date> <title> STRIPS: A new approach to the application of theorem proving to problem solving. </title> <journal> Artificial Intelligence, </journal> <volume> 2, </volume> <pages> 189-208. </pages> <note> Also in </note> <author> (Allen et al., </author> <date> 1990). </date> <title> Planning for Contingencies: A Decision-based Approach </title>
138
- <author> Felleisen, M. </author> <title> Programming languages and lambda calculi. </title> <location> URL: www.cs.rice.edu/~matthias/411web/mono.ps. </location>
139
- <author> M. Herlihy and J. Wing, </author> <title> "Linearizability: A Correctness Condition for Concurrent Objects", </title> <journal> ACM Transactions on Programming Languages and Systems, </journal> <volume> Vol. 12, No. 3, </volume> <date> 1990, </date> <pages> pp. 463-492. </pages>
140
- <author> M. J. Wolfe and U. Banerjee. </author> <title> Data dependence and its application to parallel processing. </title> <journal> International Journal of Parallel Programming, </journal> <volume> 16(2), </volume> <pages> 137-178, </pages> <date> April 1987. </date>
141
- <author> Raab, F. H., </author> <title> "Remote object position locator". </title> <tech> US patent 4 0054 881 </tech> <date> October 18, 1977. </date>
142
- <author> Jinxin Lin and Alberto O. Mendelzon. </author> <title> Merging databases under constraints. </title> <tech> Manuscript, </tech> <date> 1995. </date>
143
- <author> R. T. Snodgrass. </author> <title> The Temporal Query Language TQuel. </title> <journal> ACM TODS, </journal> <volume> 12(2), </volume> <pages> 247-298, </pages> <date> June 1987. </date>
144
- <author> Harandi, M. T., Ning, J. Q., </author> <date> (1990), </date> <title> Knowledge Based Program Analysis", </title> <journal> IEEE Software. </journal>
145
- <author> Vander Linden, K.; Cumming, S.; and Martin, J. </author> <date> 1992. </date> <title> Expressing local rhetorical relations in instructional text. </title> <tech> Technical Report 92-43, </tech> <institution> University of Colorado. </institution> <note> To appear in Computational Linguistics. </note>
146
- <author> Witten, I. H., Neal R. M., and Cleary J. G. </author> <date> (1987). </date> <title> Arithmetic coding for data compression. </title> <journal> Communications of the ACM </journal> <volume> 30, </volume> <pages> 520-540. </pages>
147
- <author> Emihovich, C., & Miller, G. E. </author> <date> (1988). </date> <title> Talking to the turtle: A discourse analysis of Logo instruction. </title> <booktitle> Discourse Processes, </booktitle> <volume> 11, </volume> <pages> 183-201. </pages>
148
- <author> R. Harper and G. Morrisett. </author> <title> Compiling polymorphism using intensional type analysis. </title> <booktitle> In Conference Record of the 22nd Annual ACM Symposium on Principles of Programming Languages, </booktitle> <location> San Francisco, CA, </location> <date> Jan. 1995. </date>
149
- <author> A. Romanow and S. Floyd. </author> <title> The Dynamics of TCP Traffic over ATM Networks. </title> <journal> IEEE Journal on Selected Areas in Communication, </journal> <volume> 13(4), </volume> <date> May 1995. </date>
150
- <author> Knopfmacher, A. </author> <title> On the number of distinct degree sizes of a polynomial over a finite field. </title> <tech> Preprint, </tech> <date> 1996. </date>
151
- <author> S. Amarasinghe and M. Lam. </author> <title> Communication optimization and code generation for distributed memory machines. </title> <booktitle> In Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation, </booktitle> <location> Albuquerque, NM, </location> <date> June 1993. </date>
152
- <author> C. Amza, A. L. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, and W. Zwaenepoel. </author> <title> Tread-Marks: Shared memory computing on networks of workstations. </title> <journal> IEEE Computer, </journal> <volume> 29(2), </volume> <pages> 18-28, </pages> <date> February 1996. </date>
153
- <author> Srinivasan, A., Muggleton, S. H., Sternberg, M. J. E., & King, R. D. </author> <date> (1996). </date> <title> Theories for mutagenicity: a study in first-order and feature-based induction. </title> <journal> Artificial Intelligence, </journal> <volume> 84, </volume> <pages> 277-299. </pages>
154
- <author> B. Berthomieu and M. Diaz. </author> <title> Modeling and verification of time dependent systems using time Petri nets. </title> <journal> IEEE Trans. Softw. Eng., </journal> <volume> 17 </volume> <pages> 259-273, </pages> <date> 1991. </date>
155
- <author> A. Agarwal, B.-H. Lim, D. Kranz, and J. Kubiatowicz. </author> <title> APRIL: a processor architecture for multiprocessing. </title> <booktitle> In Proceedings of the 17th Annual International Symposium on Computer Architecture, </booktitle> <pages> pages 104-114, </pages> <date> May 1990. </date>
156
- <author> Serra, J. </author> <date> (1982). </date> <title> Image Analysis and Mathematical Morphology. </title> <publisher> Academic Press, </publisher> <location> London. </location>
157
- <editor> D. Borman, Editor, </editor> <title> ``Telnet Encryption Option,'' </title> <tech> Internet-Draft, </tech> <institution> Internet Engineering Task Force, Telnet Working Group </institution> <date> (July 1991). </date>
158
- <author> Catlett, J. </author> <date> (1991b). </date> <title> Megainduction: Machine Learning on Very Large Databases. </title> <tech> Ph.D. thesis, </tech> <institution> Basser Department of Computer Science, University of Sydney. </institution>
159
- <author> Quinlan, J. R. </author> <date> (1990). </date> <title> Learning logical definitions from relations. </title> <booktitle> Machine Learning, </booktitle> <volume> 5, </volume> <pages> 239-266. </pages>
160
- <author> Felleisen, M. </author> <title> The theory and practice of first-class prompts. </title> <booktitle> Proceedings of the 15th Annual Symposium on Principles of Programming Languages </booktitle> <date> (1988), </date> <pages> 180-190. </pages>
161
- <author> Narayana, K. T. and Aaby, A. A., </author> <title> "Specification of Real-Time Systems in Real-Time Temporal Interval Logic", </title> <booktitle> Proceedings of Real-Time Systems Symposium, </booktitle> <date> December 1988. </date>
162
- <author> Adorni, G., Broggi, A., Conte, G., & D'Andrea, V. </author> <date> (1993). </date> <title> A self-tuning system for real-time Optical Flow detection. </title> <booktitle> In Proceedings IEEE System, Man, and Cybernetics Conf, </booktitle> <volume> Vol. 3, </volume> <pages> pp. 7-12. </pages>
163
- <author> Ripley, B. </author> <date> (1992). </date> <title> Statistical aspects of neural networks. </title> <tech> Invited lectures for SemStat (Seminaire Europeen de Statistique, </tech> <location> Sandbjerg, Denmark, </location> <date> 25-30 April 1992). </date>
164
- <author> Umrigar, Zerksis D. and Pitchumani, Vijay </author> <date> (1985). </date> <title> An experiment in programming with full first-order logic. </title> <booktitle> In Symposium of Logic Programming, </booktitle> <location> Boston, MA. </location> <publisher> IEEE Computer Society Press. </publisher>
165
- <author> van Arragon, Paul </author> <date> (1990). </date> <title> Nested Default Reasoning for User Modeling. </title> <tech> PhD thesis, </tech> <institution> Department of Computer Science, University of Waterloo, </institution> <location> Waterloo, Ontario. </location> <note> Published by the department as Research Report CS-90-25. </note>
166
- <author> Eifrig, J., Smith, S., Trifonov, V., and Zwarico, A. </author> <title> Application of OOP type theory: State, decid-ability, integration. </title> <booktitle> In Proc. Conference on Object-Oriented Programming Systems, Languages, and Applications </booktitle> <date> (Oct. 1994), </date> <pages> pp. 16-30. </pages>
167
- <author> MacWhinney, B. </author> <date> (1993). </date> <title> Connections and symbols: closing the gap. </title> <journal> Cognition, </journal> <volume> 49 (3), </volume> <pages> 291-296. </pages>
168
- <author> L. Lovasz and N. Young. </author> <title> Lecture notes on evasiveness of graph properties. </title> <tech> Technical Report CS-TR-317-91, </tech> <institution> Computer Science Department, Princeton University, </institution> <date> 1991. </date>
169
- <author> Azer Bestavros and Carlos Cunha. </author> <title> Server-initiated document dissemination for the www. </title> <journal> IEEE Data Engineering Bulletin, </journal> <date> September 1996. </date> <pages> Page 15 </pages>
170
- <author> Bunke, H., & Allermann, G. </author> <date> (1983). </date> <title> Inexact graph matching for structural pattern recognition. </title> <journal> Pattern Recognition Letters, </journal> <volume> 1 (4), </volume> <pages> 245-253. </pages>
171
- <author> Kyriazis, G. C., </author> <title> Approximation Orders of Principal Shift-Invariant Spaces Generated by Box Splines, </title> <tech> Preprint. </tech>
172
- <author> A. Bricker, M. Litzkow, and M. Livny. </author> <title> Condor Technical Summary. </title> <tech> TR 1069, </tech> <institution> Computer Sciences Dept., Univ. of Wisconsin-Madison, </institution> <date> January 1992. </date>
173
- <author> Laird, J. E., Jones, R. M., & Nielsen, P. E. </author> <date> (1994). </date> <title> Coordinated behavior of computer generated forces in tacair-soar. </title> <booktitle> In Proceedings of the Fourth Conference on Computer Generated Forces and Behavioral Representation. </booktitle> <location> Orlando, Florida: </location> <institution> Institute for Simulation and Training, University of Central Florida. </institution>
174
- <author> Peot, M. A., & Smith, D. E. </author> <date> (1993). </date> <title> Threat-removal strategies for partial-order planning. </title> <booktitle> In Proceedings of the Eleventh National Conference of the American Association for Artificial Intelligence (AAAI-93), </booktitle> <pages> pp. 492-499 </pages> <location> Washington, D. C. </location> <publisher> Morgan Kaufmann. </publisher>
175
- <author> J. Demmel, I. Dhillon, and H. Ren. </author> <title> On the correctness of parallel bisection in floating point. </title> <journal> ETNA, </journal> <volume> 3 </volume> <pages> 116-149, </pages> <date> 1995. </date> <note> (See also LAPACK Working Note No.70). </note>
176
- <author> Sarita V. Adve. </author> <title> Using information from the programmer to implement system optimizations without violating sequential consistency. </title> <tech> Technical Report Technical report TR 9603 </tech> <note> (Submitted for publication), </note> <institution> Department of Electrical and Computer Engineering, Rice University, </institution> <date> March 1996. </date>
177
- <author> Jia, R.-Q., and J. Lei, </author> <title> Approximation by Multiinteger Translates of Functions Having Global Support, </title> <journal> J. Approx. Theory </journal> <volume> 72 </volume> <date> (1993), </date> <pages> 2-23. </pages>
178
- <editor> Rees, J. and W. Clinger (Eds.). </editor> <title> The revised 3 report on the algorithmic language Scheme. </title> <journal> SIGPLAN Notices </journal> <volume> 21(12), </volume> <date> 1986, </date> <pages> 37-79. </pages>
179
- <author> Wettschereck, Dietrich, and Thomas G. Dietterich, </author> <date> (1995). </date> <title> An Experimental Comparison of Nearest-Neighbor and Nearest-Hyperrectangle Algorithms. </title> <journal> Machine Learning, </journal> <volume> Vol. 19, No. 1, </volume> <pages> pp. 5-28. </pages>
180
- <author> C. K. I. Williams. </author> <title> Combining deformable models and neural networks for handprinted digit recognition. </title> <tech> PhD thesis, </tech> <institution> Dept. of Computer Science, University of Toronto, </institution> <date> 1994. </date>
181
- <author> Mostow, J., & Bhatnagar, N. </author> <date> (1987). </date> <title> Failsafe: A floor planner that uses ebg to learn from its failures. </title> <booktitle> In Proceedings IJCAI-87. </booktitle>
182
- <author> H. Raiffa. </author> <title> The Art and Science of Negotiation. </title> <publisher> Harvard Univ. Press, </publisher> <location> Cambridge, Mass., </location> <date> 1982. </date>
183
- <author> Plotkin, G. D. </author> <date> (1971a). </date> <title> Automatic Methods of Inductive Inference. </title> <tech> Ph.D. thesis, </tech> <institution> Edinburgh University. </institution>
184
- <author> T. E. Hull, T. F. Fairgrieve, and P. T. P. Tang. </author> <title> Implementing complex elementary functions using exception handling. </title> <journal> ACM Trans. Math. Softw., </journal> <volume> 20(2) </volume> <pages> 215-244, </pages> <date> 1994. </date>
185
- <author> Anoop Gupta, Andrew Tucker, and Shigeru Urushibara. </author> <title> The impact of operating system scheduling policies and synchro nization methods on the performance of parallel applications. </title> <booktitle> In Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, </booktitle> <pages> pages 120-132, </pages> <date> May 1991. </date>
186
- <author> Aaron Kershenbaum, David Musser, and Alexander Stepanov. </author> <title> Higher order imperative programming. </title> <tech> Technical report, </tech> <institution> Computer Science Department, Rensselaer Polytechnic Institute, </institution> <date> 1988. </date>
187
- <author> Card, S. K., Robertson, G. G., Mackinlay, J. D., </author> <title> The Information Visualizer, an Information Workspace, </title> <booktitle> Proceedings of Human Factors in Computing Systems (CHI91), 181188, ACM, </booktitle> <location> New York, </location> <date> 1991. </date>
188
- <author> M. Wolfe, </author> <title> ``Optimizing supercompilers for supercomputers,'' </title> <publisher> Pitman Publishing Company, </publisher> <location> London, </location> <publisher> MIT Press, </publisher> <location> Cambridge, Massachusets, </location> <date> 1989. </date>
189
- <author> Plunkett, K., & Marchman, V. </author> <date> (1991). </date> <title> U-shaped learning and frequency effects in a multilayered perceptron: Implications for child language acquisition. </title> <journal> Cognition, </journal> <volume> 38, </volume> <pages> 43 - 102. </pages>
190
- <author> William G. Cochran. </author> <title> Sampling Techniques. </title> <publisher> John Wiley and Sons, Inc., </publisher> <location> New York, New York, 3 edition, </location> <date> 1977. </date>
191
- <author> Renals, Steve, and Richard Rohwer, </author> <date> (1989). </date> <title> Phoneme Classification Experiments Using Radial Basis Functions. </title> <booktitle> In Proceedings of the IEEE International Joint Conference on Neural Networks (IJCNN89), </booktitle> <volume> Vol. 1, </volume> <pages> pp. 461-467. </pages>
192
- <author> Selman, B., Levesque, H., & Mitchell, D. </author> <date> (1992). </date> <title> A new method for solving hard satisfiability problems. </title> <booktitle> In Proceedings of AAAI-92, </booktitle> <pages> pp. 440-446. </pages> <publisher> AAAI/MIT Press. </publisher>
193
- <author> Rivest, R. L. </author> <date> (1987). </date> <title> Learning decision lists. </title> <booktitle> Machine Learning, </booktitle> <volume> 2 (3), </volume> <pages> 229-246. </pages>
194
- <author> McKinsey, J. C. C. </author> <date> (1943). </date> <title> The decision problem for some classes of sentences without quantifier. </title> <journal> Journal of Symbolic Logic, </journal> <volume> 8 (3), </volume> <pages> 61-76. </pages>
195
- <author> Schaffer, C. </author> <date> (1992). </date> <title> Sparse data and the effect of overfitting avoidance in decision tree induction. </title> <booktitle> In AAAI-92 Proceedings of the Tenth National Conference on Artificial Intelligence, </booktitle> <pages> pp. 147-152 </pages> <location> San Jose, CA. </location> <publisher> AAAI Press. </publisher>
196
- <author> C. Thekkath, H. Levy, and E. Lazowska. </author> <title> Efficient Support for Multicomputing on ATM Networks. </title> <tech> Technical Report TR93-04-03, </tech> <institution> Department of Computer Science and Engineering, University of Washington, </institution> <date> April 1993. </date>
197
- <author> Mahadevan, S., & Connell, J. </author> <date> (1991). </date> <title> "Automatic Programming of Behavoir-Based Robots Using Reinforcement Learning". </title> <booktitle> In AAAI, </booktitle> <pages> pp. 768-773. </pages>
198
- <author> Robert A. Ballance, Arthur B. Maccabe, and Karl J. Ottenstein. </author> <title> The program dependence web: A representation supporting control-, data-, and demand-driven interpretation of imperative languages. </title> <booktitle> In Proc. of Sigplan '90 Conf. on Programming Language Design and Implementation, </booktitle> <pages> pages 257-271, </pages> <date> 1990. </date>
199
- <author> Y. L. Chang and M. E. Marhic. </author> <title> Fiber-optic ladder networks for inverse decoding coherent CDMA. </title> <journal> Journal of Lightwave Technology, </journal> <volume> 10(12) </volume> <pages> 1952-1962, </pages> <date> December 1992. </date>
200
- <author> J. H. M. J. Daily and K. Reiser, </author> <title> "Detecting obstacles in range imagery," </title> <booktitle> Proc. of [ARPA] Image Understanding Workshop, </booktitle> <pages> pp. 87-97, </pages> <date> 1987. </date>
201
- <author> Cousot, P. and Cousot, R. </author> <date> 1978. </date> <title> Static determination of dynamic properties of recursive procedures. </title> <booktitle> In Proceedings of the IFIP Conference on Programming Concepts, </booktitle> <editor> E. Neuhold, Ed. </editor> <publisher> North-Holland Pub. Co., </publisher> <pages> 237-277. </pages>
202
- <author> Oded Shmueli. </author> <title> Decidability and expressiveness aspects of logic queries. </title> <booktitle> In Proceedings of the Sixth Symposium on Principles of Database Systems (PODS), </booktitle> <pages> pages 237-249, </pages> <location> San Diego, CA, </location> <date> March 1987. </date>
203
- <author> Conklin, D., Fortier, S., & Glasgow, J. </author> <date> (1993a). </date> <title> Knowledge discovery in molecular databases. </title> <journal> IEEE Transactions on Knowledge and Data Engineering, </journal> <pages> 985-987. </pages> <note> Special Issue on Learning and Discovery in Knowledge-Based Databases. </note>
204
- <author> Huffman, D. A. </author> <date> (1952). </date> <title> A method for the construction of minimum redundancy codes. </title> <booktitle> Proceedings of the Institute of Radio Engineers </booktitle> <volume> 40, </volume> <pages> 1098-1101. </pages>
205
- <author> Baffes, P., & Mooney, R. </author> <date> (1993). </date> <title> Symbolic revision of theories with M-of-N rules. </title> <booktitle> In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, </booktitle> <pages> pp. 1135-1140, </pages> <location> Chambery, France. </location> <publisher> Morgan Kaufmann. </publisher>
206
- <author> Lamaire, R. O, and D. N. Serpanos, </author> <title> Two Dimensional Round Robin Schedulers for Packet Switches with Multiple Input Queues, </title> <journal> IEEE/ACM Tr ans. on Networking, </journal> <pages> pp. 471-482. </pages> <date> (October 94). </date>
207
- <author> McCarthy, J. </author> <date> (1958). </date> <title> Programs with common sense. </title> <booktitle> In Proceedings of the Symposium on the Mechanization of Thought Processes, </booktitle> <volume> Vol. 1, </volume> <pages> pp. 77-84. </pages> <institution> National Physical Laboratory. </institution> <note> Reprinted in </note> <editor> Minsky`s (ed.) </editor> <booktitle> Semantic Information Processing, </booktitle> <publisher> MIT Press </publisher> <date> (1968), </date> <pages> 403-409. </pages> <note> Also in </note> <author> R. Brachman and H. Levesque, </author> <booktitle> Readings in Knowledge Representation, </booktitle> <date> 1985. </date>
208
- <author> K. D. Cooper, </author> <title> ``Analyzing aliases of reference formal parameters'', </title> <booktitle> Proc. Twelfth POPL, </booktitle> <date> Jan. 1985. </date>
209
- <author> Miller, G. </author> <date> 1995. </date> <title> WordNet: A lexical database for English. </title> <journal> Communications of the ACM </journal> <volume> 38 </volume> <pages> 39-41 </pages>.
210
- <author> A. Louri and H. Sung. </author> <title> "A Compiler Directed Cache Coherence Scheme With Fast and Parallel Explicit Invalidation." </title> <booktitle> In Proc. of the 1992 International Conference on Parallel Processing, </booktitle> <pages> pages 2-9, </pages> <date> Aug 1992. </date>
211
- <author> G. Patnaik. </author> <tech> Personal communication, </tech> <date> September 1995. </date>
212
- <author> Kennedy, A. D. </author> <date> (1990) </date> <title> "The theory of hybrid stochastic algorithms", </title> <editor> in P. H. Damgaard, et al. (editors) </editor> <booktitle> Probabilistic Methods in Quantum Field Theory and Quantum Gravity, </booktitle> <location> New York: </location> <publisher> Plenum Press. </publisher>
213
- <author> J. Singh and J. Hennessy. </author> <title> An empirical investigation of the effectiveness of and limitations of automatic parallelization. </title> <booktitle> In Proceedings of the International Symposium on Shared Memory Multiprocessors, </booktitle> <location> Tokyo, Japan, </location> <date> April 1991. </date>
214
- <author> D. J. Burr. </author> <title> Elastic matching of line drawings. </title> <journal> IEEE Trans. Pattern Analysis and Machine Intelligence, </journal> <volume> 3(6), </volume> <pages> 708-713, </pages> <date> 1981. </date>
215
- <author> Wermuth, N., & Lauritzen, S. L. </author> <date> (1983). </date> <title> Graphical and recursive models for contingency tables. </title> <journal> Biometrika, </journal> <volume> 70, </volume> <pages> 537-552. </pages>
216
- <author> D. Lomet and Mark R. Tuttle. </author> <title> Redo Recovery after System Crashes. </title> <booktitle> In Proc. of the 21st International Conference on Very Large Data Bases, </booktitle> <location> Zurich, </location> <date> Sept. 1995. </date>
217
- <author> A. V. Aho, R. Sethi, and J. Ullman. </author> <booktitle> Compilers: Principles, Techniques, and Tools. </booktitle> <publisher> Addison-Wesley, </publisher> <location> Reading, MA, </location> <note> second edition, </note> <date> 1986. </date>
218
- <author> B. Shneiderman. </author> <title> Tree visualization with tree-maps: A 2-d space filling approach. </title> <journal> ACM Transactions on Graphics, </journal> <volume> 11(1) </volume> <pages> 1-39, </pages> <date> Jan. 1992. </date>
219
- <author> Murthy, S. K., Kasif, S., Salzberg, S., & Beigel, R. </author> <date> (1993). </date> <title> OC 1 Randomized induction of oblique decision trees. </title> <booktitle> In Proceedings of the Eleventh National Conference on Artificial Intelligence, </booktitle> <pages> pp. 322-327. </pages> <location> Washington, D. C. </location> <publisher> MIT Press. </publisher>
220
- <author> Leroy, X. </author> <title> Typage polymorphe d'un langage algorithmique. </title> <tech> PhD thesis, </tech> <institution> Universite Paris </institution> <date> 7, 1992. </date>
221
- <author> Millroth, H., </author> <title> Reforming Compilation of Logic Programs, </title> <tech> Ph.D. Thesis, </tech> <institution> Computing Science Department, Uppsala University, </institution> <date> 1990. </date>
222
- <author> Angrist, J., Imbens, G., & Rubin, D. </author> <date> (1995). </date> <title> Identification of causal effects using instrumental variables. </title> <journal> Journal of the American Statistical Association, </journal> <note> in press. </note>
223
- <author> D. Padua and M. J. Wolfe. </author> <title> Advanced compiler optimizations for supercomputers. </title> <journal> Communications of the ACM, </journal> <volume> 29(12) </volume> <pages> 1184-1201, </pages> <date> December 1986. </date>
224
- <author> Wellman Kephart, J. O., Hogg, T., & Huberman, B. A. </author> <date> (1989). </date> <title> Dynamics of computational ecosystems. </title> <journal> Physical Review A, </journal> <volume> 40, </volume> <pages> 404-421. </pages>
225
- <author> Jeffrey Kuskin, David Ofelt, Mark Heinrich, John Heinlein, Richard Simoni, Kourosh Gharachorloo, John Chapin, David Nakahira, Joel Baxter, Mark Horowitz, Anoop Gupta, Mendel Rosenbaum, and John Hennessy. </author> <title> The Stanford FLASH multiprocessor. </title> <booktitle> In Proceedings of the 21st Annual International Conference on Computer Architecture, </booktitle> <pages> pages 302-313, </pages> <date> April 1994. </date>
226
- <author> T. A. Cook and E. A. Harcourt. </author> <title> A functional specification language for instruction set architectures. </title> <booktitle> In Proc. 1994 International Conference on Computer Languages, </booktitle> <pages> pages 11-19, </pages> <date> 1994. </date>
227
- <author> A. L. Yuille. </author> <title> Deformable templates for face recognition. </title> <journal> Journal of Cognitive Neuroscience, </journal> <volume> 3(1) </volume> <pages> 59-70, </pages> <date> 1991. </date>
228
- <author> F. Facchinei and C. Kanzow. </author> <title> On unconstrained and constrained stationary points of the implicit Lagrangian. </title> <journal> Journal of Optimization Theory and Applications, </journal> <volume> 92 </volume> <pages> 99-115, </pages> <date> 1997. </date>
229
- <author> N. A. Lorentzos and Y. G. Mitsopoulos. </author> <title> SQL Extension for Interval Data. </title> <journal> IEEE TKDE, </journal> <volume> 9(3) </volume> <pages> 480-499, </pages> <date> May 1997. </date>
230
- <author> M. J. Harrold and M. L. Soffa, </author> <title> "An Incremental Approach to Unit Testing During Maintenance," </title> <booktitle> Proc. of the Conference on Software Maintenance, </booktitle> <pages> pages 362-367, </pages> <date> 1988. </date>
231
- <author> Friedman, J. H., & Stuetzle, W. </author> <date> (1981). </date> <title> Projection pursuit regression. </title> <journal> Journal of the American Statistics Association, </journal> <volume> 76, </volume> <pages> 817-823. </pages>
232
- <author> R. Fikes, M. Cutkosky, T. Gruber, and J. V. Baalen. </author> <title> Knowledge Sharing Technology Project Overview. </title> <tech> Technical Report KSL-91-71, </tech> <institution> Knowledge Systems Laboratory, Stanford University, </institution> <date> 1991. </date>
233
- <author> J. Adams, W. Brainerd, J. Martin, B. Smith, and J. Wagener. </author> <title> Fortran 90 Handbook. </title> <publisher> McGraw-Hill, </publisher> <location> New York, NY, </location> <date> 1992. </date>
234
- <author> Ruth Shapira. </author> <title> A note on Sugihara's claim. </title> <journal> IEEE Transactions on Pattern Analysis and Machine Intelligence, </journal> <volume> 6(1) </volume> <pages> 122-123, </pages> <date> 1984. </date>
235
- <author> Howard Turtle and W. Bruce Croft. </author> <title> Inference networks for document retrieval. </title> <editor> In Jean-Luc Vidick, editor, </editor> <booktitle> Proceedings of the 13th Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval, </booktitle> <pages> pages 1-24, </pages> <location> Brussels, Belgium, </location> <date> September 1990. </date>
236
- <author> Dwork, C., Kanellakis, P. C., and Mitchell, J. C., </author> <title> On the sequential nature of unification, </title> <journal> Journal of Logic Programming </journal> <volume> 1 </volume> <pages> pp. 35-50 </pages> <date> (1984). </date>
237
- <author> Jin-yi Cai </author> <date> (1990), </date> <title> A Note on the Determinant and Permanent Problem, </title> <journal> Information and Computation, </journal> <volume> 84, No. 1, </volume> <pages> 119-127. </pages>
238
- <author> Rao, A. S., Georgeff, M. P., & Sonenberg, E. </author> <date> (1991). </date> <title> Social plans: a preliminary report. </title> <booktitle> In Pre-Proceedings of the Third European Workshop on Modeling Autonomous Agents and Multi-Agent Worlds </booktitle> <location> Germany. </location>
239
- <author> Gentner, D. and Markman, A. B. </author> <date> (1992). </date> <title> Analogy Watershed or Waterloo? Structural alignment and the development of connectionist models of analogy. </title> <editor> In Giles, C. L., Hanson, S. J., and Cowan, J. D., editors, </editor> <booktitle> Advances in Neural Information Processing Systems 5 (NIPS*92), </booktitle> <pages> pages 855-862, </pages> <location> San Mateo, CA. </location> <publisher> Morgan Kaufmann. </publisher>
240
- <editor> Paul Hudak, Simon Peyton Jones, and Philip Wadler (Editors). </editor> <title> Report on the Programming Language Haskell, version 1.2. </title> <journal> ACM SIGPLAN Notices, </journal> <volume> 27(5), </volume> <date> 1992. </date>
241
- <author> Hill, P. M. and Lloyd, J. W., </author> <title> The Godel Programming Language, </title> <publisher> MIT Press, </publisher> <location> Cambridge, Mass., </location> <date> 1994. </date>
242
- <author> Shoham, Y. </author> <date> (1988). </date> <title> Reasoning about Change. Cambridge, </title> <location> MA: </location> <publisher> MIT Press. </publisher> <editor> van Benthem, J. F. A. K. </editor> <date> (1989). </date> <booktitle> Semantic parallels in natural language and computation. </booktitle>
243
- <author> T. J. Sabin, C. A. L. Bailer-Jones, S. M. Roberts, D. J. C. MacKay, P. J. Withers, </author> <note> to be presented at THERMEC 97 (International Conference on Thermomechanical Processing), </note> <date> July 1997. </date>
244
- <author> Roland Wismuller. </author> <title> Debugging of globally optimized programs using data flow analysis. </title> <booktitle> In Proceedings of the ACM/SIGPLAN Conference on Programming Language Design and Implementation, </booktitle> <pages> pages 278-289. </pages> <publisher> ACM, </publisher> <date> June 1994. </date> <note> Available via WWW from http://wwwbode.informatik.tu-muenchen.de/~wismuell/publications.html </note>
245
- <author> P. Evripidou and J-L. Gaudiot, </author> <title> "The USC decoupled multilevel data-flow execution model," </title> <editor> In Jean-Luc Gaudiot and Lubomir Bic, editors, </editor> <booktitle> Advanced Topics in Data-Flow Computing, </booktitle> <pages> pages 347-379. </pages> <location> New Jersey: </location> <publisher> Prentice Hall, </publisher> <date> 1991. </date>
246
- <author> Cherri M. Pancake and Sue Utter. </author> <title> Models for visualization in parallel debuggers. </title> <booktitle> In Proceedings Supercomputing '89, </booktitle> <date> November 1989. </date>
247
- <author> Gupta, R., Smolka, S., & Bhaskar, S. </author> <date> (1994). </date> <title> On randomization in sequential and distributed algorithms. </title> <journal> ACM Computing Surveys, </journal> <volume> 26 (1), </volume> <pages> 7-86. </pages>
248
- <author> H. Lu, S. Dwarkadas, A. Cox, and W. Zwaenepoel. </author> <title> Message passing versus distributed shared memory on networks of workstations. </title> <booktitle> In Proceedings SuperComputing '95, </booktitle> <date> Dec. 1995. </date>
249
- <author> A. Garvey and V. R. Lesser, </author> <title> "Design-to-time Real-Time Scheduling", </title> <journal> IEEE Transactions on Systems, Man, and Cybernetics: Special Issue on Scheduling, Planning, and Control, </journal> <volume> 23(6), </volume> <date> 1993. </date>
250
- <author> Gertz M., Lipeck U. W. </author> <title> Deriving Integrity Maintaining Triggers from Transition Graphs. </title> <booktitle> In International Conference on Data Engineering, </booktitle> <date> 1993. </date>
251
- <author> D. G. Bradlee, S. J. Eggers and R. R. Henry, </author> <title> Integrating Register Allocation and Instruction Scheduling for RISCs, </title> <booktitle> Proc. Fourth International Conf. on ASPLOS, </booktitle> <location> Santa Clara, CA, </location> <date> April 8-11, 1991, </date> <pages> pp. 122-131. </pages>
252
- <author> B. Ryder and M. Paull. </author> <title> Incremental data flow analysis algorithms. </title> <journal> ACM Transactions on Programming Languages and Systems, </journal> <volume> 10(1) </volume> <pages> 1-50, </pages> <date> January 1988. </date>
253
- <author> Weiss, S., & Indurkhya, N. </author> <date> (1993a). </date> <title> Optimized Rule Induction. </title> <journal> IEEE Expert, </journal> <volume> 8 (6), </volume> <pages> 61-69. </pages>
254
- <author> Sutherland, I. </author> <title> Sketchpad: A Man-Machine Graphical Communication System, </title> <tech> Tech Report #296, </tech> <institution> MIT Lincoln Labs, </institution> <location> Cambridge, MA, </location> <date> 1963. </date>
255
- <author> Zhai, S. & Milgram, P. </author> <date> (1991). </date> <title> A telerobotic virtual control system. </title> <booktitle> Proceedings of SPIE 1612, Cooperative Intelligent Robotics in Space II, </booktitle> <pages> (pp. 311-320). </pages> <location> Boston, MA. </location>
256
- <author> J. Anderson, </author> <title> "Composite Registers", </title> <journal> Distributed Computing, </journal> <volume> 6(3), </volume> <date> 1993, </date> <pages> pp. 141-154. </pages>
257
- <author> Ventura, Dan, </author> <date> (1995). </date> <title> On Discretization as a Preprocessing Step for Supervised Learning Models, </title> <tech> Masters Thesis, </tech> <institution> Department of Computer Science, Brigham Young University. </institution>
258
- <author> Amdur, E. S. </author> <title> On the Message Complexity of Byzantine Agreement. </title> <tech> Master's Thesis, </tech> <institution> Department of Computer Science, University of Toronto, </institution> <date> September 1988. </date>
259
- <author> Plunkett, K., & Marchman, V. </author> <date> (1991). </date> <title> U-shaped learning and frequency effects in a mul-tilayered perceptron: Implications for child language acquisition. </title> <journal> Cognition, </journal> <volume> 38, </volume> <pages> 43 - 102. </pages>
260
- <editor> In Wrobel, S. (Ed.), </editor> <booktitle> Proceedings of the Fourth International Workshop on Inductive Logic Programming </booktitle> <location> Bad Honnef/Bonn, Germany. </location>
261
- <author> K. Keeton, B. A. Mah, S. Seshan, R. H. Katz, and D. Ferrari. </author> <title> Providing Connection-Oriented Service to Mobile Hosts. </title> <booktitle> In Proceedings of the First USENIX Symposium on Mobile and Location-Independent Computing, </booktitle> <date> August 1993. </date>
262
- <author> Parr, R., & Russell, S. </author> <date> (1995). </date> <title> Approximating optimal polices for partially observable stochastic domains. </title> <booktitle> In Proceedings of IJCAI-95, </booktitle> <pages> 1088-1094. </pages>
263
- <author> Bennett, K. H., Bull, T. and Yang, H., </author> <title> "A Transformation System for Maintenance | Turning Theory into Practice", </title> <booktitle> IEEE Conference on Software Maintenance-1992, </booktitle> <location> Orlando, Florida, </location> <date> November, 1992. </date>
264
- <author> J. M. Lalouel. </author> <title> GEMINI a computer program for optimization of general nonlinear functions. </title> <tech> Technical Report 14, </tech> <institution> University of Utah, Department of Medical Biophysics and Computing, </institution> <location> Salt Lake City, Utah, </location> <date> 1979. </date>
265
- <author> Cau, A. and Zedan, H., </author> <title> "Refining Interval Temporal Logic specifications", </title> <tech> Draft Paper, </tech> <date> November 1996. </date>
266
- <author> Dempster, A., Laird, N., and Rubin, D. </author> <date> (1977) </date> <title> Maximum likelihood from incomplete data via the EM algorithm. </title> <journal> Journal of the Royal Statistical Society B39, </journal> <pages> 1-38. </pages>
267
- <author> Michalski, Ryszard S., Robert E. Stepp, and Edwin Diday, </author> <date> (1981). </date> <title> A Recent Advance in Data Analysis: Clustering Objects into Classes Characterized by Conjunctive Concepts. </title> <booktitle> Progress in Pattern Recognition, </booktitle> <volume> Vol. 1, </volume> <editor> Laveen N. Kanal and Azriel Rosenfeld (Eds.). </editor> <location> New York: </location> <publisher> North-Holland, </publisher> <pages> pp. 33-56. </pages>
268
- <author> Tambe, M. </author> <date> (1996). </date> <title> Tracking dynamic team activity. </title> <booktitle> In Proceedings of the National Conference on Artificial Intelligence (AAAI). </booktitle>
269
- <author> Valiant, L. G. </author> <date> (1984). </date> <title> A theory of the learnable. </title> <journal> Communications of the ACM, </journal> <volume> 27 (11). </volume>
270
- <author> D. Georgakopoulos, M. Rusinkiewicz, and A. Sheth. </author> <title> Using tickets to enforce the serializability of multidatabase transactions. </title> <journal> IEEE Trans. on Knowledge and Data Eng., </journal> <volume> 6(1) </volume> <pages> 166, </pages> <date> February 1994. </date>
271
- <author> J. Kim and P. Khosla, </author> <title> "Real-time obstacle avoidance using harmonic potential functions," </title> <tech> Tech. Report COMPSI T-RA 8, </tech> <pages> pp. 338-349, </pages> <date> 1992. </date>
272
- <author> Surajit Chaudhuri and Moshe Vardi. </author> <title> On the equivalence of recursive and nonrecursive data-log programs. </title> <booktitle> In The Proceedings of the PODS-92, </booktitle> <pages> pages 55-66, </pages> <date> 1992. </date>
273
- <author> Verlinden, J., Bolter, J. D., & van der Mast, C. </author> <title> Voice Annotation in Virtual Environments, </title> <note> paper submitted to ESS '93. </note>
274
- <author> Lisa F. Rau. </author> <title> Extracting company names from text. </title> <booktitle> In Proceedings of the Sixth IEEE Conference on Artificial Intelligence Applications, </booktitle> <date> 1991. </date>
275
- <author> C. Norris and L. Pollock, </author> <title> "A scheduler-sensitive global register allocator," </title> <booktitle> In Proc. of Supercomputing, </booktitle> <pages> pages 804-813, </pages> <date> 1993. </date>
276
- <author> Jeffay, K., Stone, D. L., Smith, F. D., </author> <title> Kernel Support for Live Digital Audio and Video, </title> <journal> Computer Communications, </journal> <volume> Vol. 15, No. 6 </volume> <date> (July / August 1992), </date> <pages> pp. 388-395. </pages>
277
- <author> A. Demers, S. Keshav, and S. Shenker. </author> <title> Analysis and simulation of a fair queueing algorithm. </title> <journal> Internetworking:Research and Experience, </journal> <volume> 1 </volume> <pages> 3-26 </pages>.
278
- <author> Fikes, R. E., Hart, P. E., & Nilsson, N. J. </author> <date> (1972). </date> <title> Learning and executing generalized robot plans. </title> <journal> Artificial Intelligence, </journal> <volume> 3, </volume> <pages> 251-288. </pages>
279
- <author> Zhang, Z., & Faugeras, O. </author> <date> (1992). </date> <title> 3D Dynamic Scene Analysis. </title> <publisher> Springer-Verlag. </publisher>
280
- <author> Hawley, D. K., & McClure, W. R. </author> <date> (1983). </date> <title> Compilation and analysis of escherichia coli promoter DNA sequences. </title> <journal> Nucleic Acids Research, </journal> <volume> 11 (8), </volume> <pages> 2237-2255. </pages>
281
- <author> M. Kamath and K. Ramamritham. </author> <title> Modeling, Correctness & Systems Issues in Supporting Advanced Database Applications using Workflow Management Systems. </title> <tech> Technical Report TR 95-50, </tech> <institution> University of Massachusetts, Computer Science Dept., </institution> <date> 1995. </date>
282
- <author> M. J. Harrold and M. L. Soffa, </author> <title> ``An incremental approach to unit testing during maintenance,'' </title> <booktitle> Proceedings of the International Conference on Software Maintenance, </booktitle> <pages> pp. 362-367, </pages> <date> October 1988. </date>
283
- <author> VanLehn, K., Jones, R. M., & Chi, M. T. H. </author> <date> (1992). </date> <title> A model of the self-explanation effect. </title> <journal> Journal of the Learning Sciences, </journal> <volume> 2 (1), </volume> <pages> 1-59. </pages>
284
- <author> Boddy, M., </author> <date> 1991. </date> <title> Any Time Problem Solving Using Dynamic Programming. </title> <booktitle> In Proceedings AAAI-91. </booktitle> <publisher> AAAI. </publisher>
285
- <author> Jurafsky, D., Wooters, C., Tajchman, G., Segal, J., Stolcke, A., Fosler, E., & Morgan, N. </author> <date> (1994a). </date> <title> The Berkeley Restaurant Project. </title> <booktitle> In Proceedings of the International Conference on Speech and Language Processing. </booktitle> <pages> pp. 2139-2142, </pages> <location> Yokohama, Japan. </location>
286
- <author> Alon Y. Levy, Divesh Srivastava, and Thomas Kirk. </author> <title> Data model and query evaluation in global information systems. </title> <journal> Journal of Intelligent Information Systems, </journal> <date> 1995. </date> <note> Special Issue on Networked Information Discovery and Retrieval (to appear). </note>
287
- <author> Sussman, G. J. </author> <date> (1975). </date> <title> A Computer Model of Skill Acquisition. </title> <location> New York: </location> <publisher> American Elsevier. </publisher>
288
- <author> Crawford, J., & Auton, L. </author> <date> (1993). </date> <title> Experimental results on the crossover point in satisfiability problems. </title> <booktitle> Proceedings of the 11th National Conference on Artificial Intelligence, </booktitle> <pages> 21-27. </pages>
289
- <author> Hermans, J., Habbema, J. D. F., & Van der Burght, A. T. </author> <date> (1974). </date> <title> Cases of doubt in allocation problems, k populations. </title> <journal> Bulletin of the International Statistics Institute, </journal> <volume> 45, </volume> <pages> 523-529. </pages>
290
- <author> Reichman, R. </author> <date> (1985). </date> <title> Getting Computers to Talk Like You and Me: Discourse Context, Focus, and Semantics. </title> <location> Cambridge, MA: </location> <publisher> MIT Press. </publisher>
291
- <author> K. Chandy and J. Misra, </author> <title> Parallel Program Design: A Foundation, </title> <publisher> Addison-Wesley, </publisher> <date> 1988. </date>
292
- <author> S. L. Peyton Jones & P. L. Wadler </author> <date> [Jan 1993], </date> <title> "Imperative functional programming," </title> <booktitle> in 20th ACM Symposium on Principles of Programming Languages, </booktitle> <location> Charleston, </location> <publisher> ACM, </publisher> <pages> 71-84. </pages>
293
- <author> Nishida, T., & et al. </author> <date> (1991). </date> <title> Automated phase portrait analysis by integrating qualitative and quantitative analysis. </title> <booktitle> In Proceedings of AAAI. </booktitle>
294
- <author> Kosslyn, S. M. </author> <date> (1994). </date> <title> Image and Brain: the resolution of the imagery debate. </title> <publisher> MIT Press. </publisher>
295
- <author> Shoham, Y., & Tennenholtz, M. </author> <date> (1994). </date> <title> Co-learning and the evolution of social activity. </title> <tech> Tech. rep. STAN-CS-TR-94-1511, </tech> <institution> Dept. of Computer Science, Stanford University. </institution>
296
- <author> Reiter, R. </author> <date> (1980). </date> <title> A logic for default reasoning. </title> <journal> Artificial Intelligence, </journal> <volume> 13, </volume> <pages> 81-132. </pages>
297
- <author> L. Hernquist, </author> <title> "Vectorization of Tree Traversals," </title> <journal> Journal of Computational Physics, </journal> <volume> vol. 87, </volume> <date> 1990. </date>
298
- <author> Kibler, D., and David W. Aha, </author> <date> (1987). </date> <title> Learning representative exemplars of concepts: An initial case study. </title> <booktitle> Proceedings of the Fourth International Workshop on Machine Learning. </booktitle> <location> Irvine, CA: </location> <publisher> Morgan Kaufmann, </publisher> <pages> pp. 24-30. </pages>
299
- <author> Kohonen, Teuvo, </author> <date> (1990). </date> <title> The Self-Organizing Map. </title> <booktitle> In Proceedings of the IEEE, </booktitle> <volume> Vol. 78, No. 9, </volume> <pages> pp. 1464-1480. </pages>
300
- <author> F. Allen, M. Burke, P. Charles, R. Cytron, and J. Ferrante. </author> <title> An overview of the PTRAN analysis system for multiprocessing. </title> <booktitle> In Proceedings of the First International Conference on Supercomputing. </booktitle> <publisher> Springer-Verlag, </publisher> <location> Athens, Greece, </location> <date> June 1987. </date>
301
- <author> M. Burke and R. Cytron, </author> <title> ``Interprocedural dependence analysis and parallelization'', </title> <booktitle> Proc. SIGPLAN 86 Symposium on Compiler Construction, SIGPLAN Notices </booktitle> <volume> 21(7), </volume> <date> July 1986. </date>
302
- <author> D. Haussler. </author> <title> Quantifying inductive bias: AI learning algorithms and Valiant's learning framework. </title> <journal> Artificial Intelligence, </journal> <date> 1988. </date>
303
- <author> Litman, D., & Hirschberg, J. </author> <date> (1990). </date> <title> Disambiguating cue phrases in text and speech. </title> <booktitle> In Proceedings of the Thirteenth International Conference on Computational Linguistics (COLING). </booktitle>
304
- <author> Jaswinder Pal Singh, Wolf-Dietrich Weber, and Anoop Gupta. </author> <title> SPLASH: Stanford Parallel Applications for Shared Memory. </title> <journal> Computer Architecture News, </journal> <volume> 20(1), </volume> <pages> 5-44, </pages> <date> March 1992. </date>
305
- <author> Forbus, K. D. </author> <date> (1989). </date> <title> Introducing Actions in Qualitative Simulation. </title> <booktitle> Proceedings of IJCAI-89, </booktitle> <pages> 1273-1278. </pages>
306
- <author> M. C. Rinard and M. S. Lam. </author> <title> Semantic foundations of Jade. </title> <booktitle> In Record of the Nineteenth Annual ACM Symposium on Principles of Programming Languages, </booktitle> <pages> pages 105-118, </pages> <date> January 1992. </date>
307
- <author> Webber, Bonnie Lynn and Mays, </author> <title> Eric </title> <date> (1983). </date> <title> Varieties of user misconceptions: Detection and correction. </title> <booktitle> In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, </booktitle> <location> Karlsruhe. </location> <pages> pages 650-652. </pages>
308
- <author> C. Baru, O. Frieder, D. Kandlur, and M. Segal. </author> <title> Join on a cube: Analysis, simulation, and implementation. </title> <editor> In M. Kitsuregawa and H. Tanaka, editors, </editor> <booktitle> Database Machines and Knowledge Base Machines. </booktitle> <publisher> Kluwer Academic Publishers, </publisher> <date> 1987. </date>
309
- <author> Pryor, L., & Collins, G. </author> <date> (1993). </date> <title> Cassandra: Planning with contingencies. </title> <tech> Technical report 41, </tech> <institution> Institute for the Learning Sciences, Northwestern University. </institution>
310
- <author> Harper, M. P., & Helzerman, R. A. </author> <date> (1995b). </date> <title> Managing multiple knowledge sources in constraint-based parsing of spoken language. </title> <journal> Fundamenta Informaticae, </journal> <volume> 23 (2, 3, 4), </volume> <pages> 303-353. </pages>
311
- <author> Mark Friedell, Mark LaPolla, Sandeep Kochhar, Steve Sistare, and Janusz Juda. </author> <title> Visualizing the behavior of massively parallel programs. </title> <booktitle> In Proceedings Supercomputing '91, </booktitle> <date> November 1991. </date>
312
- <author> Michael Stonebraker, Anant Jhingaran, Jef-frey Goh, and Spyros Potamianos. </author> <title> On rules, procedures, caching and views in databases. </title> <tech> Technical Report UCB/ERL M90/36, </tech> <institution> University of California, Berkeley, </institution> <date> April 1990. </date>
313
- <author> Arvind Krishnamurthy and Katherine Yelick. </author> <title> Optimizing parallel programs with explicit synchronization. </title> <booktitle> In Proceedings of the ACM SIG-PLAN '95 Conference on Programming Language Design and Implementation, </booktitle> <date> July 1995. </date>
314
- <author> I. Koren and A. D. Singh, </author> <title> "Fault Tolerance in VLSI Circuits," </title> <journal> Computer, Special Issue on Fault-Tolerant Systems, </journal> <volume> Vol. 23, No. 7, </volume> <pages> pp. 73-83, </pages> <date> July 1990. </date>
315
- <author> Krogh, A., & Vedelsby, J. </author> <date> (1995). </date> <title> Neural network ensembles, cross validation, and active learning. </title> <editor> In Tesauro, G., Touretzky, D., & Leen, T. (Eds.), </editor> <booktitle> Advances in Neural Information Processing Systems, </booktitle> <volume> Vol. 7, </volume> <pages> pp. 231-238, </pages> <location> Cambridge, MA. </location> <publisher> MIT Press. </publisher>
316
- <author> Stephen Lindell </author> <date> (1992), </date> <title> A Purely Logical Characterization of Circuit Uniformity, </title> <booktitle> Seventh IEEE Structure in Complexity Theory, </booktitle> <pages> 185-192. </pages>
317
- <author> Brieman, L., Friedman, J., Olshen, R., & Stone, C. </author> <date> (1984). </date> <title> Classification and Regression Trees. </title> <location> Monterey, CA: </location> <publisher> Wadsworth and Brooks. </publisher>
318
- <author> S. P. Amarasinghe, J. M. Anderson, C. S. Wilson, S.-W. Liao, B. M. Murphy, R. S. French, M. S. Lam, and M. W. Hall. </author> <title> Multiprocessors from a software perspective. </title> <journal> IEEE Micro, </journal> <pages> pages 5261, </pages> <date> June 1996. </date>
319
- <author> Y. Breitbart, A. Silberschatz, and G. R. Thompson. </author> <title> An approach to recovery management in a multidatabase system. </title> <journal> The VLDB Journal, </journal> <volume> 1(11), </volume> <date> July 1992. </date>
320
- <author> D. R. Helman, D. A. Bader, and J. JaJa. </author> <title> Parallel Algorithms for Personalized Communication and Sorting With an Experimental Study. </title> <booktitle> In Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, </booktitle> <pages> pages 211-220, </pages> <location> Padua, Italy, </location> <date> June 1996. </date>
321
- <author> Frank Kappe, Hermann Maurer, and Nick Sherbakov. </author> <title> Hyper-G a universal hypermedia system. </title> <booktitle> Journal of Educational Multimedia and Hypermedia, </booktitle> <volume> 2(1) </volume> <pages> 39-66, </pages> <date> 1993. </date>
322
- <author> Dyn, N. and A. Ron </author> <date> (1993) </date> <title> "Radial basis function approximation: from gridded centres to scattered centres", </title> <tech> CMS Technical Summary Report #94-3, </tech> <institution> University of Wisconsin-Madison. </institution>
323
- <author> J. Wiener, H. Gupta, W. Labio, Y. Zhuge, H. Garcia-Molina, and J. Widom. </author> <title> A system prototype for warehouse view maintenance. </title> <booktitle> In The Workshop on Materialized Views, </booktitle> <pages> pages 26-33, </pages> <date> June 1996. </date>
324
- <author> Albert Croker and David Maier. </author> <title> A Dynamic Tree-Locking Protocol. </title> <booktitle> In Proceedings of the International Conference in Data Engineering, </booktitle> <pages> pages 49-56, </pages> <location> Los Angeles, CA, </location> <date> 1986. </date>
325
- <author> R. Graham. </author> <title> Bounds on multiprocessing timing anomalies. </title> <journal> SIAM Journal of Computing, </journal> <volume> 17 </volume> <pages> 416 - 429, </pages> <date> 1969. </date>
326
- <author> M. Holliday and M. Stumm. </author> <title> Performance evaluation of hierarchical ring-based shared memory mutliprocessors. </title> <tech> Technical Report CS-1992-18, </tech> <institution> Computer Science Department, Duke University, </institution> <date> 1992. </date>
327
- <author> C. Forsyth. </author> <title> Implementation of the worst-case execution analyser. </title> <tech> Technical Report Hard Real-Time Operating System Kernel Study Task 8, </tech> <volume> Volume E, </volume> <institution> York Software Engineering Ltd, </institution> <date> July 1992. </date>
328
- <author> J. P. Callan, </author> <title> "Document Filtering With Inference Networks," </title> <booktitle> Proceedings of SIGIR, </booktitle> <pages> 262-269, </pages> <date> 1996. </date>
329
- <author> Deutsch, A. </author> <title> Modeles Operationnels de Language de Programmation et Representations de Relations sue des Languages Rationnels avec Application a la Determination Statique de Proprietes de Partages Dy-namiques de Donnees. </title> <tech> PhD thesis, </tech> <institution> Universite Paris VI, </institution> <date> 1992. </date>
330
- <author> J.-S. Pang and S. A. Gabriel, </author> <title> NE/SQP: A robust algorithm for the nonlinear complementarity problem, </title> <journal> Math. Programming, </journal> <volume> 60 </volume> <date> (1993), </date> <pages> pp. 295-337. </pages>
331
- <author> Allen, James F. </author> <date> (1979). </date> <title> A Plan-Based Approach to Speech Act Recognition. </title> <tech> PhD thesis, </tech> <institution> Department of Computer Science, University of Toronto, </institution> <location> Toronto, Canada. </location> <note> Published as </note> <institution> University of Toronto, Department of Computer Science </institution> <tech> Technical Report No. 131. </tech>
332
- <author> Danvy, O. and A. Filinski. </author> <title> Representing control: A study of the CPS transformation. </title> <tech> Tech. Rpt. CIS-91-2. </tech> <institution> Kansas State University, </institution> <date> 1991. </date>
333
- <author> E. Allender, N. Immerman, J. Balcazar </author> <date> (1993), </date> <title> A First-Order Isomor-phism Theorem, </title> <booktitle> STACS, </booktitle> <pages> 163-174. </pages>
334
- <author> Milgrom, P., & Roberts, J. </author> <date> (1991). </date> <title> Adaptive and sophisticated learning in normal form games. </title> <journal> Games and Economic Behavior, </journal> <volume> 3, </volume> <pages> 82-100. </pages>
335
- <author> Lovejoy, W. S. </author> <date> (1991b). </date> <title> Computationally feasible bounds for partially observed Markov decision processes. </title> <journal> Operations Research, </journal> <volume> 39 (1), </volume> <pages> 162-175. </pages>
336
- <author> Spirtes, P., Glymour, C., & Scheines, R. </author> <date> (1993). </date> <title> Causation, Prediction, and Search. </title> <publisher> Springer-Verlag, </publisher> <location> New York. </location>
337
- <author> Hadzilacos, V. </author> <title> Issues of Fault Tolerance in Concurrent Computations. </title> <tech> Ph.D. dissertation, </tech> <institution> Harvard University, </institution> <date> June 1984. </date>
338
- <author> R. B. Kieburtz, B. Agapiev and J. Hook. </author> <title> Three Monads for Continuations. </title> <booktitle> In Proceedings of the ACM SIGPLAN Workshop on Continuations, </booktitle> <institution> Department of Computer Science, Stanford University, </institution> <tech> Report No. STAN-CS-92-1462, </tech> <date> June 1992. </date>
339
- <author> Y. Robert. </author> <title> The Impact of Vector and Parallel Architectures on the Gaussian Elimination Algorithm. </title> <publisher> Halsted Press, </publisher> <location> New York, </location> <date> 1990. </date>
340
- <author> Halpern, J. Y., & Moses, Y. </author> <date> (1990). </date> <title> Knowledge and common knowledge in a distributed environment. </title> <journal> Journal of the ACM, </journal> <volume> 37 (3), </volume> <pages> 549-587. </pages>
341
- <author> Buntine, W. </author> <date> (1994). </date> <title> Operations for learning with graphical models. </title> <journal> Journal of Artificial Intelligence Research, </journal> <volume> 2, </volume> <pages> 159-225. </pages>
342
- <author> A. J. Bernstein. </author> <title> Analysis of programs for parallel processing. </title> <journal> IEEE Transactions on Electronic Computers, </journal> <pages> pages 757-763, </pages> <date> October 1966. </date>
343
- <author> Debray, S. K. and Warren, D. S., </author> <title> Automatic Mode Inference for Logic Programs, </title> <journal> J. Logic Programming, </journal> <volume> 5 </volume> <pages> 207-229 </pages> <date> (1988). </date>
344
- <author> Whittaker, J. </author> <date> (1991). </date> <title> Graphical Models in Applied Multivariate Statistics. </title> <publisher> Chichester: Wiley. </publisher>
345
- <author> Henderson, D. A. Jr. And Card, S. K. </author> <title> Rooms: The Use of Multiple Virtual Workspaces to Reduce Space Contention in a Window-Based Graphical User Interface, </title> <journal> IEEE Transactions on Graphics, </journal> <volume> 5 (3), </volume> <pages> 211-243, </pages> <date> 1987. </date>
346
- <author> Mooney, R. J., & Califf, M. E. </author> <date> (1995). </date> <title> Induction of first-order decision lists: results on learning the past tense of english verbs. </title> <journal> Journal of Artificial Intelligence Research, </journal> <volume> 3, </volume> <pages> 1-24. </pages>
347
- <author> Hooman, J., </author> <title> "Specification and Compositional Verification of Real-Time Systems", </title> <tech> PhD Thesis, </tech> <location> Eindhoven, the Netherlands, </location> <date> 1991. </date>
348
- <author> Hauptman, H., & Karle, J. </author> <date> (1953). </date> <title> Solution of the Phase Problem, 1. The Centrosymmetric Crystal, </title> <journal> ACA Monograph </journal> <volume> No. 3. </volume> <location> Wilmington: </location> <publisher> Polycrystal Book Service. </publisher>
349
- <author> D. A. Patterson and J. L. Hennessy. </author> <title> Computer Architecture A Quantitative Approach, </title> <pages> page 346. </pages> <publisher> Morgan Kaufman Publishers Inc., </publisher> <location> San Mateo, California, </location> <note> second edition, </note> <date> 1994. </date> <note> Uncorrected preliminary manuscript. </note>
350
- <author> Mooney, R. J. </author> <date> (1990). </date> <title> Learning plan schemata from observation: Explanation-based learning for plan recognition. </title> <journal> Cognitive Science, </journal> <volume> 14, </volume> <pages> 483-509. </pages>
351
- <author> S. Hiranandani, K. Kennedy, and C. Tseng. </author> <title> Compiling Fortran D for MIMD distributed-memory machines. </title> <journal> Communications of the ACM, </journal> <volume> 35(8) </volume> <pages> 66-80, </pages> <date> Aug. 1992. </date>
352
- <author> F. Rabiti, E. Brtino, W. Kim, D. Woelk, </author> <title> A Model of Authorization for Next-Generation Database Systems, </title> <note> to appear in ACM Transactions on Database Systems. </note>
353
- <author> Crammond, J., </author> <title> Scheduling and Variable Assignment in the Parallel Parlog Implementation, </title> <booktitle> in Proceedings of the North American Conference on Logic Programming, </booktitle> <location> Austin, </location> <publisher> MIT Press, </publisher> <location> Cambridge, Mass., </location> <date> 1990. </date>
354
- <author> Aumann, R., & Maschler, M. </author> <date> (1995). </date> <title> Repeated Games with Incomplete Information. </title> <publisher> The MIT Press. </publisher>
355
- <author> N. J. Nilsson. </author> <title> Probabilistic logic. </title> <journal> Artificial Intelligence, </journal> <volume> 28(1) </volume> <pages> 71-87, </pages> <date> 1986. </date>
356
- <author> Neil Immerman </author> <date> (1989), </date> <title> Expressibility and Parallel Complexity, </title> <journal> SIAM J. of Comput </journal> <volume> 18, </volume> <pages> 625-638. </pages>
357
- <author> N. Benvenuto and F. Piazza. </author> <title> On the Complex Backpropagation Algorithm. </title> <journal> IEEE Transactions on Signal Processing, </journal> <volume> 40(4) </volume> <pages> 967-969, </pages> <date> 1992. </date>
358
- <author> E. Granston and A. Veidenbaum. </author> <title> Detecting redundant accesses to array data. </title> <booktitle> In Proceedings of Supercomputing '91, </booktitle> <location> Albuquerque, NM, </location> <date> November 1991. </date>
359
- <author> Guziec, A., & Ayache, N. </author> <date> (1992). </date> <title> Smoothing and matching of 3-d space curves. </title> <booktitle> Visualization in Biomedical Computing, Proc. SPIE, </booktitle> <volume> 1808, </volume> <pages> 259-273. </pages>
360
- <author> P. Havlak and K. Kennedy. </author> <title> An implementation of inter procedural bounded regular section analysis. </title> <journal> IEEE Transactions on Parallel and Distributed Systems, </journal> <volume> 2(3) </volume> <pages> 350-360, </pages> <date> July 1991. </date>
361
- <author> Berlekamp, E. </author> <title> Algebraic coding theory. </title> <publisher> McGraw Hill, </publisher> <location> New York NY, </location> <date> 1968. </date>
362
- <author> Milner, R., M. Tofte, and R. Harper. </author> <title> The Definition of Standard ML. </title> <publisher> The MIT Press, </publisher> <location> Cambridge, Massachusetts and London, England, </location> <date> 1990. </date>
363
- <editor> Mark Keane, Padraig Cunningham, Mike Brady, and Ruth Byrne, editors. </editor> <booktitle> Proc. Seventh Irish Annual Conference of AI and Cognitive Science. </booktitle> <publisher> Dublin University Press, </publisher> <date> 1994. </date>
364
- <author> Odlyzko, A. </author> <title> Asymptotic enumeration methods. </title> <booktitle> In Handbook of Combinatorics, </booktitle> <editor> R. Graham, M. Grotschel, and L. Lovasz, Eds., </editor> <volume> vol. 2. </volume> <publisher> Elsevier, </publisher> <date> 1995, </date> <pages> pp. 1063-1229. </pages>
365
- <author> K. Decker and V. Lesser, </author> <title> "Designing a Family of Coordination Algorithms", </title> <booktitle> in the Proceedings of 13th International Distributed Artificial Intelligence Workshop, </booktitle> <location> Seattle, WA., </location> <date> July 1994. </date>
366
- <author> J. Choi, R. Cytron, and J. Ferrante. </author> <title> Automatic construction of sparse data flow evaluation graphs. </title> <booktitle> In Proceedings of the Eighteenth Annual ACM Symposium on the Principles of Programming Languages, </booktitle> <pages> pages 55-66, </pages> <location> Orlando, FL, </location> <date> January 1991. </date>
367
- <editor> M. C. Ferris and J.-S. Pang (editors). </editor> <title> Complementarity and variational problems : State of the Art. </title> <publisher> SIAM Publications, </publisher> <date> 1997. </date>
368
- <author> Bourdoncle, F. </author> <title> Abstract debugging of higher-order imperative languages. </title> <booktitle> In ACM SIGPLAN Conference on Programming Language Design and Implementation, </booktitle> <pages> pages 46-55, </pages> <date> 1993. </date>
369
- <author> D. Callahan, K. D. Cooper, K. Kennedy, and L. Torczon, </author> <title> ``Interprocedural constant propagation'', </title> <booktitle> Proc. SIGPLAN 86 Symposium on Compiler Construction, SIGPLAN Notices, </booktitle> <volume> 21(7), </volume> <date> July 1986. </date>
370
- <author> Bengio, Y., & Frasconi, P. </author> <date> (1994). </date> <title> Credit assignment through time: Alternatives to backpropagation. </title> <editor> In Cowan, J. D., Tesauro, G., & Alspector, J. (Eds.), </editor> <booktitle> Advances in Neural Information Processing Systems 6. </booktitle> <publisher> Morgan Kaufmann. </publisher>
371
- <author> Bengio, Y., & Frasconi, P. </author> <date> (1995a). </date> <title> Diffusion of credit in Markovian models. </title> <editor> In Tesauro, G., Touretzky, D. S., & Alspector, J. (Eds.), </editor> <booktitle> Advances in Neural Information Processing Systems 7. </booktitle> <publisher> MIT Press. </publisher>
372
- <author> T. Carpenter, K. Driscoll, K. Hoyme, and J. Carciofini. </author> <title> ARINC659 acheduling: Problem definition. </title> <booktitle> In Proceedings of the Real Time Systems Symposium, </booktitle> <pages> pages 165-169, </pages> <date> December 1994. </date>
373
- <author> M. J. Zekauskas, W. A. Sawdon, and B. N. Bershad. </author> <title> Software write detection for distributed shared memory. </title> <booktitle> In Proceedings of the First USENIX Symposium on Operating System Design and Implementation, </booktitle> <pages> pages 87-100, </pages> <date> November 1994. </date> <pages> 27 </pages>
374
- <author> Ware, C. & Slipp, L. </author> <date> (1991). </date> <title> Using velocity control to navigate 3D graphical environments: a comparison of three interfaces. </title> <booktitle> Proceedings of the Human Factors Society 35th annual meeting. </booktitle>
375
- <author> David A. Wood, Satish Chandra, Babak Falsafi, Mark D. Hill, James R. Larus, Alvin R. Lebeck, James C. Lewis, Shubhendu S. Mukherjee, Subbarao Palacharla, and Steven K. Reinhardt. </author> <title> Mechanisms for Cooperative Shared Memory. </title> <booktitle> In Proceedings of the 20th Annual International Symposium on Computer Architecture, </booktitle> <pages> pages 156-168, </pages> <date> May 1993. </date>
376
- <author> Morgenstern, L. </author> <date> (1990). </date> <title> A formal theory of multiple agent nonmonotonic reasoning. </title> <booktitle> In Proceedings of the Eighth National Conference on Artificial Intelligence, </booktitle> <pages> pp. 538-544 </pages> <location> Boston, Massachusetts. </location>
377
- <author> Bergamaschi, S., & Sartori, C. </author> <date> (1992). </date> <title> On taxonomic reasoning in conceptual design. </title> <journal> ACM Transaction on Database Systems, </journal> <volume> 17 (3), </volume> <pages> 385-422. </pages>
378
- <author> J. J. Koenderink. </author> <title> The structure of images. </title> <journal> Biological Cybernetics, </journal> <volume> 50 </volume> <pages> 363-396, </pages> <date> 1984. </date>
379
- <author> V. Guarna, D. Gannon, Y. Gaur, and D. Jablonowski. </author> <title> Faust: An environment for programming parallel scientific applications. </title> <booktitle> In Proceedings of Supercomputing '88, </booktitle> <location> Orlando, FL, </location> <date> November 1988. </date>
380
- <author> Thrun, T., Schwartz, A. </author> <date> (1995) </date> <title> "Finding Structure in Reinforcement Learning," </title> <booktitle> in Advances in Neural Information Processing Systems, 7. </booktitle> <location> San Mateo: </location> <publisher> Morgan Kaufmann. </publisher>
381
- <author> Rumelhart, D. E., Hinton, G. E., & Williams, R. J. </author> <date> (1986). </date> <title> Learning internal representations by error propagation. </title> <editor> In Rumelhart, D. E., McClelland, J. L., & The PDP research group (Eds.), </editor> <booktitle> Parallel Distributed Processing, </booktitle> <volume> Vol. 1., </volume> <pages> pp. 318-362. </pages> <publisher> MIT Press, </publisher> <location> Cambridge, MA. </location>
382
- <author> Tim Berners-Lee, Robert Cailliau, Jean-Francois Groff, and Bernd Pollermann. </author> <title> WorldWideWeb: the information universe. </title> <booktitle> Electronic Networking: Research, Applications and Policy, </booktitle> <volume> 2(1) </volume> <pages> 52-58, </pages> <date> Spring 1992. </date>
383
- <author> Georgeff, M. P. </author> <date> (1987). </date> <title> Actions, processes, and causality. </title> <editor> In Georgeff, M. P., & Lansky, A. L. (Eds.), </editor> <booktitle> Reasoning About Actions & Plans, </booktitle> <pages> pp. 99-122. </pages> <publisher> Morgan Kaufmann Publishers, Inc., </publisher> <location> Los Altos, California. </location>
384
- <author> H. Johnson and P. Johnson, </author> <title> Designers-identified requirements for tools to support task analyses, </title> <booktitle> INTERACT 90 Proceedings, </booktitle> <date> August 1990, </date> <pages> pp. 259-264. </pages>
385
- <author> Card, S. K., Mackinlay, J. D. and Robertson, G. G. </author> <title> "The Design Space of Input Devices", </title> <booktitle> in Proceedings of CHI 90 </booktitle> <location> (Seattle, Washington, </location> <date> April 1-5, 1990). </date> <publisher> ACM, </publisher> <location> New York </location> <date> 1990, </date> <pages> pp. 117-124. </pages>
386
- <author> Brady, J. M., Agre, P. E., Braunegg, D. J., & Connell, J. H. </author> <date> (1984). </date> <title> The mechanic's mate. </title> <booktitle> In Proceedings of the 1984 European Conference on Artificial Intelligence </booktitle> <location> Pisa, Italy. </location>
387
- <author> J. K. Peir and R. Cytron. </author> <title> Minimum distance a method for partitioning recur-resnces for multiprocessors. </title> <booktitle> In Proceedings of the 1987 International Conference on Parallel Processing, </booktitle> <pages> pages 217-224, </pages> <date> 1987. </date>
388
- <author> Kambhampati, S., Knoblock, C., & Yang, Q. </author> <date> (1995). </date> <title> Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning. </title> <journal> Artificial Intelligence, </journal> <volume> 76, </volume> <pages> 167-238. </pages>
389
- <author> W. W. Carlson and J. M. Draper. </author> <title> AC for the T3D. </title> <tech> Technical Report SRC-TR-95-141, </tech> <institution> Supercomputing Research Center, </institution> <location> Bowie, MD, </location> <date> February 1995. </date>
390
- <author> Ventura, Dan, </author> <date> (1995). </date> <title> On Discretization as a Preprocessing Step for Supervised Learning Models, </title> <tech> Masters Thesis, </tech> <institution> Department of Computer Science, Brigham Young University. </institution>
391
- <author> Rosenbloom, P. S., Laird, J. E., & Newell, A. </author> <date> (1988). </date> <title> The chunking of skill and knowledge. </title>
392
- <author> Genesereth, M., & Nourbakhsh, I. R. </author> <date> (1993). </date> <title> Time Saving Tips for Problem Solving with Incomplete Information. </title> <booktitle> In Proceedings of AAAI-93. </booktitle>
393
- <author> Muggleton, S., & De Raedt, L. </author> <date> (1994). </date> <title> Inductive logic programming: Theory and methods. </title> <journal> Journal of Logic Programming, </journal> <volume> 19, </volume> <pages> 629-679. </pages>
394
- <author> J. J Koenderink and A. J. van Doorn. </author> <title> Representation of local geometry in the visual system. </title> <journal> Biological Cybernetics, </journal> <volume> 55 </volume> <pages> 367-375, </pages> <date> 1987. </date>
395
- <author> R. Reiter. </author> <title> A theory of diagnosis from first principles. </title> <journal> Artificial Intelligence, </journal> <volume> 33(1) </volume> <pages> 57-95, </pages> <date> 1987. </date>
396
- <author> J. T. Hecht, Y. Wang, B. Connor, S. H. Blanton, and S. P. Daiger. </author> <title> Non-syndromic cleft lip and palate: No evidence of linkage to HLA or factor 13a. </title> <journal> American Journal of Human Genetics, </journal> <volume> 52 </volume> <pages> 1230-1233, </pages> <date> 1993. </date>
397
- <author> Strang, G. and G. Fix, </author> <title> A Fourier analysis of the finite element variational method, Constructive Aspects of Functional Analysis </title> <editor> (G. Geymonat, ed.), </editor> <journal> C. I. M. E., </journal> <date> 1973, </date> <pages> pp. 793-840. </pages>
398
- <author> E. Berlekamp. </author> <title> "Factoring polynomials over large finite fields," </title> <journal> Mathematics of Computation, </journal> <volume> Vol. 24, No. 111, </volume> <pages> pp. 713-735 </pages> <date> (1970). </date>
399
- <author> J. Allen and J. Koomen. </author> <title> Planning using a temporal world model. </title> <booktitle> In Proc. IJCAI, </booktitle> <pages> pages 741-747, </pages> <date> 1983. </date>
400
- <author> D. Terzopoulos, </author> <title> "Image Analysis using Multigrid Relaxation Methods," </title> <journal> IEEE Trans. Patt. Anal. Mach. Intell., </journal> <volume> Vol. 8, </volume> <pages> pp. 129-139, </pages> <date> March 1986. </date>
401
- <author> Narendra, K., & Thathachar, M. A. L. </author> <date> (1989). </date> <title> Learning Automata: An Introduction. </title> <publisher> Prentice Hall. </publisher>
402
- <author> J. Hafner and K. McCurley. </author> <title> "On the distribution of running times of certain integer factoring algorithms," </title> <tech> preprint </tech> <date> (1987). </date>
403
- <editor> In Bouma, H., & Elsendoorn, A. G. (Eds.), </editor> <title> Working Models of Human Perception, </title> <pages> pp. 391-410. </pages> <publisher> Academic Press, </publisher> <location> London, England. </location>
404
- <author> J. Fortes and B. Wah, </author> <title> Systolic Arrays | from Concept to Implementation, </title> <journal> Computer </journal> <volume> 20 </volume> <date> (1987), </date>
405
- <author> A. Borgida and T. Imielinski. </author> <title> Decision making in committees-a framework for dealing with inconsistency and non-monotonicity. </title> <booktitle> In Proceedings Nonmono-tonic Reasoning Workshop, </booktitle> <pages> pages 21-32, </pages> <date> 1984. </date>
406
- <author> De Schreye, D. and Martens, B., </author> <title> A Sensible Least Herbrand Semantics for Untyped Vanilla Meta-Programming and its Extension to a Limited Form of Amalgamation, </title> <editor> in: A. Pettorossi (ed.), </editor> <booktitle> Meta-Programming in Logic, LNCS 649, </booktitle> <publisher> Springer-Verlag, </publisher> <location> Berlin, </location> <date> 1992. </date>
407
- <author> Warren, D. H. D. </author> <date> (1976). </date> <title> Generating Conditional Plans and Programs. </title> <booktitle> In Proceedings of the Summer Conference on AI and Simulation of Behavior, </booktitle> <location> Edinburgh. </location>
408
- <author> McDermott, J. </author> <date> (1982). </date> <title> R1: A rule-based configurer of computer systems. </title> <journal> Artificial Intelligence, </journal> <volume> 19. </volume>
409
- <author> Chapman, D. </author> <date> (1987). </date> <title> Planning for conjunctive goals. </title> <journal> Artificial Intelligence, </journal> <volume> 32, </volume> <pages> 333-377. </pages>
410
- <author> Thomas von Eicken, David E. Culler, Seth Copen Goldstein, and Karl Erik Schauser. </author> <title> Active messages: A mechanism for integrated communication and computation. </title> <booktitle> In Proceedings of the 19th Annual International Symposium on Computer Architecture, </booktitle> <pages> pages 256-266, </pages> <date> May 1992. </date>
411
- <author> K. Li and P. Hudak. </author> <title> Memory coherence in shared virtual memory systems. </title> <journal> ACM Transactions on Computer Systems, </journal> <volume> 7(4) </volume> <pages> 321-359, </pages> <date> November 1989. </date>
412
- <author> Quinlan, J. R., & Cameron-Jones, R. M. </author> <date> (1993). </date> <title> FOIL: A midterm report. </title> <booktitle> In Proceedings of the European Conference on Machine Learning, </booktitle> <pages> pp. 3-20 </pages> <location> Vienna. </location>
413
- <author> Asahiro, Y., Iwama, K., & Miyano, E. </author> <date> (1993). </date> <title> Random generation of test instances with controlled attributes. </title> <booktitle> In Second DIMACS Challenge Workshop. </booktitle>
414
- <author> Leroy, X. </author> <title> The Objective Caml system, documentation and user's guide, </title> <date> 1997. </date>
415
- <author> Thomas F. LaPorta and Mischa Schwartz. </author> <title> Performance analysis of MSP: Feature-rich high-speed transport protocol. </title> <journal> IEEE/ACM Transactions on Networking, </journal> <volume> 1(6) </volume> <pages> 740-753, </pages> <date> December 1993. </date>
416
- <author> U. Kremer, H. Zima, H.-J. Bast, and M. Gerndt. </author> <title> Advanced tools and techniques for automatic parallelization. </title> <journal> Parallel Computing, </journal> <volume> 7 </volume> <pages> 387-393, </pages> <date> 1988. </date>
417
- <author> J. S. Huang and Y. C. Chow. </author> <title> Parallel Sorting and Data Partitioning by Sampling. </title> <booktitle> In Proceedings of the 7th Computer Software and Applications Conference, </booktitle> <pages> pages 627-631, </pages> <date> November 1983. </date>
418
- <author> Hume, D., & Sammut, C. </author> <date> (1991). </date> <title> Using inverse resolution to learn relations from experiments. </title> <booktitle> In Proceedings of the Eighth International Workshop on Machine Learning. </booktitle> <publisher> Morgan Kaufmann. </publisher>
419
- <author> Baral, C., & Subrahmanian, V. </author> <date> (1991). </date> <title> Duality between alternative semantics of logic programs and nonmonotonic formalisms. </title> <booktitle> In Proc. Intl. Workshop on Logic Programming and Nonmonotonic Reasoning. </booktitle> <publisher> Springer. </publisher>
420
- <author> M. Galles and E. Williams. </author> <title> Performance optimizations, implementation, and verification of the SGI Challenge multiprocessor. </title> <booktitle> In Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences, volume I: Architecture, </booktitle> <pages> pages 134-143, </pages> <date> January 1994. </date>
421
- <author> Deerwester, S., Dumais, S., Furnas, G., Landauer, T., & Harshman, R. </author> <date> (1990). </date> <title> Indexing by latent semantic analysis. </title> <journal> Journal of the American Society for Information Science, </journal> <volume> 41, </volume> <pages> 391-407. </pages>
422
- <author> Geddes, K., Czapor, S., and Labahn, G. </author> <title> Algorithms for Computer Algebra. </title> <publisher> Kluwer Academic Publishers, </publisher> <location> Boston, </location> <date> 1992. </date>
423
- <author> Warren R. Greiff. </author> <title> Computationally tractable, conceptually plausible classes of link matrices for the inquery inference network. </title> <tech> Technical Report CmpSci TR-96-66, </tech> <institution> University of Massachusetts, </institution> <location> Amherst, Massachusetts, </location> <date> September 1996. </date>
424
- <author> Puterman, M. L. </author> <date> (1994). </date> <title> Markov Decision Problems. </title> <publisher> Wiley, </publisher> <location> New York. </location>
425
- <author> Hel-Or, Y., & Werman, M. </author> <date> (1992). </date> <title> Absolute orientation from uncertain data: A unified approach. </title> <booktitle> In Proc. Intern. Conference on Computer Vision and Pattern Recognition, </booktitle> <pages> pp. 77-82. </pages>
426
- <author> Foley, J. D., van Dam, A., Feiner, S. K., Hughes, J. F., </author> <title> Computer Graphics: Principles and Practice, </title> <pages> pp. 992-996, </pages> <publisher> Addison-Wesley, </publisher> <location> Massachusetts </location> <date> 1990. </date>
427
- <author> A. V. Aho, J. E. Hopcroft, and J. D. Ullman, </author> <title> The Design and Analysis of Computer Algorithms, </title> <publisher> Addison-Wesley, </publisher> <location> Reading, MA, </location> <date> 1974. </date>
428
- <author> Panario, D., Gourdon, X., and Flajolet, P. </author> <title> An analytic approach to smooth polynomials. </title> <note> Submitted, </note> <date> 1998. </date>
429
- <author> H. Wachter and A. Reuter. </author> <title> The ConTract model. </title> <note> In [24], chapter 7, </note> <pages> pages 220-263. </pages> <date> 1992. </date>
430
- <author> J. McCarthy. </author> <title> Circumscription a form of non-monotonic reasoning. </title> <journal> Artificial Intelligence, </journal> <volume> 13 </volume> <pages> 27-39, 171-172, </pages> <date> 1980. </date>
431
- <author> O. Shechory and S. Kraus. </author> <title> Feasible formation of stable coalitions among autonomous agents in general environments. </title> <journal> Computational Intelligence Journal, </journal> <date> 1995. </date> <note> Submitted. </note>
432
- <author> R. R. Jueneman, S. M. Matyas, and C. H. Meyer, </author> <title> ``Message Authentication,'' </title> <journal> IEEE Communications </journal> <volume> 23(9), </volume> <pages> pp. 29-40 </pages> <date> (September 1985). </date>
433
- <author> Korf, R. </author> <date> (1985). </date> <title> Macro-operators: a weak method for learning. </title> <journal> Artificial Intelligence, </journal> <volume> 26, </volume> <pages> 35-77. </pages>
434
- <author> Michalski, R. S. </author> <date> (1983). </date> <title> "A theory and methodology of inductive learning". </title> <editor> In Michalski, R. S., Carbonell, J. G., & Mitchell, T. M. (Eds.), </editor> <booktitle> Machine Learning: An Artificial Intelligence Approach. </booktitle> <publisher> Tioga Publishing Company, </publisher> <location> Palo Alto, CA. </location>
435
- <author> R. Gupta, </author> <title> "Optimizing Array Bound Checks using Flow Analysis," </title> <journal> ACM Letters on Programming Languages and Systems, </journal> <volume> Vol. 2, Nos. 1-4, </volume> <pages> pages 135-150, </pages> <date> March - December 1994. </date>
436
- <institution> Sun Microsystems. </institution> <title> Java (tm): Programming for the Internet. </title> <location> http://java.sun.com. </location>
437
- <author> Golomb, S., & Baumert, L. </author> <date> (1965). </date> <title> Backtrack programming. </title> <journal> J. ACM, </journal> <volume> 12, </volume> <pages> 516-524. </pages>
438
- <author> MacWhinney, B. </author> <date> (1990). </date> <title> The CHILDES Project: Tools for Analyzing Talk. </title> <location> Hillsdale, NJ: </location> <publisher> Erlbaum. </publisher>
439
- <author> L. Sha, R. Rajkumar, and J. Lehoczky, </author> <title> "Priority Inheritance Protocols: An Approach to RealTime System Synchronization", </title> <journal> IEEE Transactions on Computers, </journal> <volume> Vol. 39, No. 9, </volume> <date> 1990, </date> <pages> pp. 1175-1185. </pages>
440
- <author> P. Keleher, S. Dwarkadas, A. Cox, and W. Zwaenepoel. </author> <title> Treadmarks: Distributed shared memory on standard workstations and operating systems. </title> <booktitle> In Proc. 1994 Winter USENIX Conference, </booktitle> <pages> pages 115-131, </pages> <date> 1994. </date>
441
- <author> De Raedt, L., Lavrac, N., & Dzeroski, S. </author> <date> (1993). </date> <title> Multiple predicate learning. </title> <booktitle> In Proceedings of the Third International Workshop on Inductive Logic Programming Bled, </booktitle> <location> Slovenia. </location>
442
- <author> Whitley, D., & Gruau, F. </author> <date> (1993). </date> <title> Adding learning to the cellular development of neural networks: Evolution and the Baldwin effect. </title> <journal> Evolutionary Computation, </journal> <volume> 1, </volume> <pages> 213-233. </pages>
443
- <author> Wellman, M. </author> <date> (1985). </date> <title> Reasoning about preference models. </title> <tech> Tech. rep. MIT/LCS/TR-340, </tech> <institution> Laboratory for Computer Science, MIT. </institution>
444
- <author> Soskin, William F. </author> <date> (1963). </date> <title> Verbal Interactions in a Young Married Couple. </title> <publisher> University of Kansas Publications, </publisher> <location> Lawrence, Kansas. </location>
445
- <author> T. E. Hull and M. S. Cohen. </author> <title> Toward an ideal computer arithmetic. </title> <editor> In M. J. Irwin and R. Stafanelli, editors, </editor> <booktitle> Proceedings of the 8th Symposium on Computer Arithmetic, </booktitle> <pages> pages 131-138. </pages> <publisher> IEEE Computer Society, </publisher> <location> Los Angeles, </location> <date> 1987. </date>
446
- <author> Grosz, B. J., and Sidner, C. L. </author> <date> 1986. </date> <title> Attention, intention, and the structure of discourse. </title> <journal> Computational Linguistics </journal> <volume> 12(3) </volume> <pages> 175-204 </pages>.
447
- <author> Wilke, W. </author> <date> (1993). </date> <title> Entwurf und Implementierung eines Algorithmus zum wissensintensiven Lernen von Planabstraktionen nach der PABS-Methode. </title> <tech> Projektarbeit, </tech> <institution> Universitat Kaiserslautern. </institution>
448
- <author> J. M. Ponte and W. B. Croft, </author> <title> Text Segmentation by Topic, </title> <booktitle> in Proceedings of the First European Conference on Research and Advanced Technology for Digitial Libraries, </booktitle> <pages> pp. 120-129, </pages> <date> 1997. </date>
449
- <author> McCarthy, J. F., & Lehnert, W. G. </author> <date> (1995). </date> <title> Using decision trees for coreference resolution. </title> <booktitle> In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI). </booktitle>
450
- <author> Dario Giarrizzo, Matthias Kaiserswerth, Thomas Wicki, and Robin C. Williamson. </author> <title> High-speed parallel protocol implementation. </title> <booktitle> First IFIP WG6.1/WG6.4 International Workshop on Protocols for High-Speed Networks, </booktitle> <pages> pages 165-180, </pages> <date> May 1989. </date>
451
- <author> Abelson, H., G. J. Sussman and J. Sussman. </author> <title> Structure and Interpretation of Computer Programs. </title> <publisher> MIT Press, </publisher> <date> 1985. </date>
452
- <author> G. E. Blelloch, S. Chatterjee, J. C. Hardwick, J. Sipelstein, and M. Zagha. </author> <title> Implementation of a portable nested data-parallel language. </title> <booktitle> In 4th Symposium on Principles and Practice of Parallel Programming. ACM SIGPLAN, </booktitle> <date> 1993. </date>
453
- <author> S. Keshav H. Zhang. </author> <title> Comparison of rate-based service disciplines. </title> <booktitle> In SIGCOMM. </booktitle>
454
- <author> Lewis, D. </author> <date> (1973). </date> <title> Counterfactuals. </title> <publisher> Harvard University Press, </publisher> <location> Cambridge, MA. </location>
455
- <author> Lapedes, A., Steeg, E., & Farber, R. </author> <date> (1995). </date> <title> Use of adaptive networks to evolve highly predictable protein secondary-structure classes. </title> <booktitle> Machine Learning, </booktitle> <volume> 21, </volume> <pages> 103-124. </pages>
456
- <author> V. Faber </author> <date> (1993): </date> <title> Global communication algorithms for hypercubes and other Cayley coset graphs. </title> <journal> SIAM J. Discr. Math., </journal> <note> to appear. </note>
457
- <author> Marinari, E. and Parisi, G. </author> <date> (1992) </date> <title> "Simulated tempering: A new Monte Carlo Scheme", </title> <journal> Europhysics Letters, </journal> <volume> vol. 19, </volume> <pages> pp. 451-458. </pages>
458
- <author> P. K. Chrysanthis and K. Ramamritham. </author> <title> Synthesis of extended transaction models using ACTA. </title> <journal> ACM Transactions on Database Systems, </journal> <volume> 19(3) </volume> <pages> 450-491, </pages> <date> September 1994. </date>
459
- <institution> CONVEX Computer Corporation, </institution> <title> "Exemplar Programming Guide," </title> <location> Richardson, TX, </location> <date> 1993. </date>
460
- <author> R. White, F. Muller, C. Healy, D. Whalley, and M. Harmon. </author> <title> Timing analysis for data caches and set-associative caches. </title> <booktitle> In Proceedings of the IEEE Real-Time Technology and Applications Symposium, </booktitle> <pages> pages 192-202, </pages> <date> June 1997. </date>
461
- <author> Wright, A. K. </author> <title> Simple imperative polymorphism. </title> <booktitle> Lisp and Symbolic Computation </booktitle> <volume> 8, 4 </volume> <date> (Dec. 1995), </date> <pages> 343-356. </pages>
462
- <author> Hirschberg, J. </author> <date> (1990). </date> <title> Accent and discourse context: Assigning pitch accent in synthetic speech. </title> <booktitle> In Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI). </booktitle>
463
- <author> Jennings, N. </author> <date> (1994). </date> <title> Commitments and conventions: the foundation of coordination in multi-agent systems. </title> <journal> The Knowledge Engineering Review, </journal> <volume> 8. </volume>
464
- <author> Weigend, A. </author> <date> (1993). </date> <title> Measuring the effective number of dimensions during backpropagation training. </title> <booktitle> In Proceedings of the 1993 Connectionist Models Summer School, </booktitle> <pages> pp. 335-342. </pages> <publisher> Morgan Kaufmann, </publisher> <location> San Francisco, CA. </location>
465
- <author> David Chapman. </author> <title> Planning for conjunctive goals. </title> <journal> Artificial Intelligence, </journal> <volume> 32, </volume> <date> 1987. </date>
466
- <author> P. Hsu and E. Davidson, </author> <title> "Highly Concurrent Scalar Processing," </title> <booktitle> 13th Annual International Symposium on Computer Architecture, </booktitle> <pages> pages 386-395, </pages> <date> 1986. </date>
467
- <author> LeBlanc, M., & Tibshirani, R. </author> <date> (1993). </date> <title> Combining estimates in regression and classification. </title> <tech> Tech. rep., </tech> <institution> Department of Statistics, U. of Toronto. </institution>
468
- <author> H. Shin, C.-C. King and C. Hu, </author> <title> "Thin Oxide Damage by Plasma Etching and Ashing Process," </title> <booktitle> Proc. IEEE/IRPS, </booktitle> <pages> pp. 37-41, </pages> <date> 1992. </date>
469
- <author> Rubinstein, A. </author> <date> (1982). </date> <title> Perfect equilibrium in a bargaining model. </title> <journal> Econometrica, </journal> <volume> 50 (1), </volume> <pages> 97-109. </pages>
470
- <author> Selman, B., & Kautz, H. A. </author> <date> (1996). </date> <title> Knowledge Compilation and Theory Approximation. </title> <journal> Journal of the ACM, </journal> <volume> Vol. 43, No. 2, </volume> <pages> 193-224. </pages>
471
- <author> Fisher, D. H. </author> <date> (1987). </date> <title> Knowledge acquisition via incremental conceptual clustering. </title> <booktitle> Machine Learning, </booktitle> <volume> 2 (2), </volume> <pages> 139-172. </pages>
472
- <author> K. H. Wolf, K. Froitzheim and P. Schulthess, </author> <date> (1995) </date> <title> Multimedia Application Sharing in a Heterogeneous Environment, </title> <journal> ACM Multimedia 95, </journal> <pages> Pages 57-64. </pages>
473
- <author> P. Perez and F. Heitz, </author> <title> "Multiscale Markov Random Fields and Constrained Relaxation in Low Level Image Analysis," </title> <booktitle> IEEE International Conf. on Acoustics, Speech, and Signal Processing, </booktitle> <volume> Vol. 3, </volume> <pages> pp. 61-64, </pages> <date> 1992. </date>
474
- <author> R. Fagin, J. Halpern, and M. Vardi. </author> <title> A model-theoretic analysis of knowledge. </title> <journal> Journal of the ACM, </journal> <volume> 38(2), </volume> <pages> 382-428, </pages> <date> 1991. </date>
475
- <author> W. Enkelmann, </author> <title> "Obstacle detection by evaluation of optical flow fields from image sequence," </title> <journal> Image and Vision Computing 9, </journal> <pages> pp. 160-168, </pages> <date> 1991. </date>
476
- <author> D. Callahan and K. Kennedy. </author> <title> Compiling programs for distributed-memory multiprocessors. </title> <journal> Journal of Supercomputing, </journal> <volume> 2 </volume> <pages> 151-169, </pages> <date> October 1988. </date>
477
- <author> Remler, Jane E. </author> <date> (1978). </date> <title> Some repairs on the notion of repairs in the interest of relevance. </title> <editor> In Farkas, Donka, Jacobsen, Wesley M., and Todrys, Karol W., editors, </editor> <booktitle> Papers from the Fourteenth Regional Meeting of the Chicago Linguistic Society, </booktitle> <location> Chicago, IL. </location> <publisher> Chicago Linguistic Society, </publisher> <pages> pages 391-502. </pages>
478
- <author> S. Lakshmanan and H. Derin, </author> <title> "Gaussian Markov Random Fields at Multiple Resolutions," </title> <booktitle> in Markov Random Fields: Theory and Applications </booktitle> <editor> (R. Chellappa, ed.), </editor> <pages> pp. 131-157, </pages> <publisher> Academic Press, </publisher> <date> 1993. </date>
479
- <author> Ting, Kai Ming, </author> <date> (1996). </date> <title> Discretisation in Lazy Learning. </title> <note> To appear in </note> <journal> the special issue on Lazy Learning in Artificial Intelligence Review. </journal>
480
- <author> J. C. Butcher. </author> <title> General linear method: A survey. </title> <journal> Appl. Numer. Math., </journal> <volume> 1 </volume> <pages> 273, </pages> <date> 1985. </date>
481
- <author> M. C. Speer, L. H. Yamaoka, J. H. Gilchrist, C. P. Gaskell, J. M. Stajich, J. M. Vance, Z. Kazantsev, A. Lastra, C. S. Haynes, J. S. Beckmann, D. Cohen, J. L. Weber, A. D. Roses, and M. A. Pericak-Vance. </author> <title> Confirmation of genetic heterogeneity in limb-girdle muscular dystrophy: Linkage of an autosomal dominant form to chromosome 5q. </title> <journal> Am. J. Hum. Genet., </journal> <volume> 50 </volume> <pages> 1211-1217, </pages> <date> 1992. </date>
482
- <author> Flanagan, C., and Felleisen, M. </author> <title> Modular and polymorphic set-based analysis: Theory and practice. </title> <tech> Technical Report TR-96-266, </tech> <institution> Rice University, </institution> <date> 1996. </date>
483
- <author> Marr, D., & Nishihara, H. </author> <date> (1978). </date> <title> Representation and recognition of the spatial organisation of three-dimensional shapes. </title> <journal> Proceedings of the Royal Society of London, </journal> <volume> B200, </volume> <pages> 269-294. </pages>
484
- <author> Barendregt, H. P. </author> <title> The Lambda Calculus: Its Syntax and Semantics. Revised Edition. </title> <booktitle> Studies in Logic and the Foundations of Mathematics 103. </booktitle> <publisher> North-Holland, </publisher> <location> Amsterdam, </location> <date> 1984. </date>
485
- <author> Dechter, R. </author> <date> (1992). </date> <title> From local to global consistency. </title> <journal> Artificial Intelligence, </journal> <volume> 55, </volume> <pages> 87-107. </pages>
486
- <author> Beeri, C. </author> <date> (1990). </date> <title> A formal approach to object-oriented databases. </title> <journal> Data and Knowledge Engineering, </journal> <volume> 5, </volume> <pages> 353-382. </pages>
487
- <author> Y. Sagiv and M. Yannakakis. </author> <title> Equivalence among relational expressions with the union and difference operators. </title> <journal> In J. ACM </journal> <volume> 27(4) </volume> <pages> pp. 633-655, </pages> <date> 1981. </date>
488
- <author> M. V. Solodov. </author> <title> Some optimization reformulations of the extended linear complementarity problems, </title> <date> 1997. </date> <journal> Computational Optimization and Applications, </journal> <note> to appear. </note>
489
- <author> W. Chen. </author> <title> Declarative specification and evaluation of database updates. </title> <booktitle> In Intl. Conference on Deductive and Object-Oriented Databases (DOOD), </booktitle> <volume> volume 566 </volume> <booktitle> of Lecture Notes in Computer Science, </booktitle> <pages> pages 147-166. </pages> <publisher> Springer-Verlag, </publisher> <date> December 1991. </date>
490
- <author> D. Gannon, W. Jalby, and K. Gallivan. </author> <title> Strategies for cache and local memory management by global program transformation. </title> <journal> Journal of Parallel and Distributed Computing, </journal> <volume> 5(5) </volume> <pages> 587-616, </pages> <date> October 1988. </date>
491
- <author> S. M. Robinson. </author> <title> Some continuity properties of polyhedral multifunctions. </title> <journal> Mathematical Programming Study, </journal> <volume> 14 </volume> <pages> 206-214, </pages> <date> 1981. </date>
492
- <author> Weiss, S., & Kapouleas, I. </author> <date> (1989). </date> <title> An empirical comparison of pattern recognition, neural nets, and machine learning classification methods. </title> <booktitle> In Proceedings of the 11th International Joint Conference of Artificial Intelligence, </booktitle> <pages> pp. 781-787. </pages> <location> Detroit, MI. </location> <publisher> Morgan Kaufmann. </publisher>
493
- <author> R. von Hanxleden and K. Kennedy. </author> <title> Give-N-Take a balanced code placement framework. </title> <booktitle> In Proceedings of the ACM SIGPLAN 91 Conference on Programming Language Design and Implementation, </booktitle> <date> June 1994. </date>
494
- <author> DeWitt, D. J., </author> <title> "DIRECT A Multiprocessor Organization for Supporting Relational Database Management Systems," </title> <journal> IEEE Transactions on Computers, </journal> <date> June, 1979. </date>
495
- <author> I. Lee, P. Bremond-Gregoire, and R. Gerber. </author> <title> A Process Algebraic Approach to the Specification and Analysis of Resource-Bound Real-Time Systems. </title> <booktitle> IEEE Proceedings, </booktitle> <volume> 82(1), </volume> <date> January 1994. </date>
496
- <author> van Benthem, J. F. A. K. </author> <date> (1989) </date> <title> Semantic parallels in natural language and computation. </title> <editor> In Ebbinghaus, H. D., & al. (Eds.), </editor> <booktitle> Logic Colloquium'87, Granada, </booktitle> <pages> pp. 331-375. </pages> <location> Amsterdam: </location> <publisher> North-Holland. </publisher>
497
- <author> Koppel, M., Feldman, R., & Segre, A. M. </author> <date> (1994b). </date> <title> Bias-driven revision of logical domain theories. </title> <journal> Journal of Artificial Intelligence Research, </journal> <volume> 1, </volume> <pages> 159-208. </pages>
498
- <author> Webb, G. I., & Brkic, N. </author> <date> (1993). </date> <title> Learning decision lists by prepending inferred rules. </title> <booktitle> In Proceedings of the Australian Workshop on Machine Learning and Hybrid Systems, </booktitle> <pages> pp. 6-10 </pages> <location> Melbourne, Australia. </location>
499
- <author> Barklund, J., Costantini, S., Dell'Acqua, P. and Lanzarone, G. A., </author> <title> Integrating Reflection into SLD-Resolution, </title> <editor> in: A. Momigliano and M. Ornaghi (eds.), </editor> <booktitle> Proc. Post-Conf. Ws. on Proof-Theoretical Extensions of Logic Programming, </booktitle> <date> 1994. </date>
500
- <author> R. Rosenfeld and D. S. Touretzky. </author> <title> Coarse-coded symbol memories and their properties. </title> <journal> Complex Systems, </journal> <volume> 2(4) </volume> <pages> 463-484, </pages> <date> 1988. </date>