{"id":11785,"date":"2021-10-15T11:53:22","date_gmt":"2021-10-15T15:53:22","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=11785"},"modified":"2026-06-10T10:01:07","modified_gmt":"2026-06-10T14:01:07","slug":"technical-reports-1983","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1983\/","title":{"rendered":"Technical Reports 1983"},"content":{"rendered":"\n
\n
\n\n
\n
\n
\n

\n Technical Reports 1983\n <\/h1>\n \n \n \n\n
\n
Search Reports by Year<\/a><\/div>\n<\/div>\n\n\n <\/header>\n\n <\/div>\n\n <\/div>\n\n <\/div>\n<\/section>\n\n\n\n
Number<\/th>Title<\/th>Authors<\/th>Date<\/th>Download<\/th><\/tr><\/thead>
TR-14<\/td>A Common Basis for Similarity Measures Involving Two Strings<\/a><\/td>R.L. Kashyap & B.J. Oommen<\/td>January 1983<\/td>TR-14.pdf<\/a><\/td><\/tr>
TR-15<\/td>Similarity Measures for Sets of String<\/a><\/td>R.L. Kashyap & B.J. Oommen<\/td>January 1983<\/td>TR-15.pdf<\/a><\/td><\/tr>
TR-16<\/td>The Noisy Substring Matching Problem<\/a><\/td>R.L. Kashyap & B.J. Oommen<\/td>January 1983<\/td>TR-16.pdf<\/a><\/td><\/tr>
TR-17<\/td>Distributed Election in a Circle Without a Global Sense of Orientation<\/td>E. Korach, D. Rotem, N. Santoro<\/td>January 1983<\/td>N\/A<\/td><\/tr>
TR-18<\/td>A Geometrical Approach to Polygonal Dissimilarity and the Classification of Closed Boundaries<\/a><\/td>R.L. Kashyap & B.J. Oommen<\/td>January 1983<\/td>TR-18.p<\/a>df<\/a><\/td><\/tr>
TR-19<\/td>Scale Preserving Smoothing of Polygons<\/a><\/td>R.L. Kashyap & B.J. Oommen<\/td>January 1983<\/td>TR-19.pdf<\/a><\/td><\/tr>
TR-20<\/td>Not-Quite-Linear Random Access Memories<\/a><\/td>Jim des Rivieres & Wilf R. LaLonde<\/td>March 1983<\/td>TR-20.pdf<\/a><\/td><\/tr>
TR-21<\/td>Shout Echo Selection in Distributed Files<\/td>D. Rotem, N. Santoro, J.B. Sidney<\/td>March 1983<\/td>N\/A<\/td><\/tr>
TR-22<\/td>Distributed Ranking<\/td>E. Korach, D. Rotem, N. Santoro<\/td>March 1983<\/td>N\/A<\/td><\/tr>
TR-23<\/td>A Reduction Technique for Selection in Distributed Files : I<\/td>N. Santoro & J.B. Sidney<\/td>April 1983<\/td>N\/A<\/td><\/tr>
TR-24<\/td>Learning Automata Possessing Ergodicity of the Mean : The Two Action Case<\/a><\/td>M.A.L. Thathachar & B.J. Oommen<\/td>May 1983<\/td>TR-24.pdf<\/a><\/td><\/tr>
TR-25<\/td>Actors \u2013 The Stage is Set<\/a><\/td>John R. Pugh<\/td>June 1983<\/td>TR-25.pdf<\/a><\/td><\/tr>
TR-26<\/td>On the Essential Equivalence of Two Families of Learning Automata<\/a><\/td>M.A.L. Thathachar & B.J. Oommen<\/td>May 1983<\/td>TR-26.pdf<\/a><\/td><\/tr>
TR-27<\/td>Generalized Krylov Automata and their Applicability to Learning in Nonstationary Environments<\/td>B.J. Oommen<\/td>June 1983<\/td>N\/A<\/td><\/tr>
TR-28<\/td>Actor Systems: Selected Features<\/td>Wilf R. LaLonde<\/td>July 1983<\/td>N\/A<\/td><\/tr>
TR-29<\/td>Another Addendum to Kronecker\u2019s Theory of Pencils<\/a><\/td>M.D. Atkinson<\/td>August 1983<\/td>TR-29.pdf<\/a><\/td><\/tr>
TR-30<\/td>Some Techniques for Group Character Reduction<\/a><\/td>M.D. Atkinson & R.A. Hassan<\/td>August 1983<\/td>TR-30.pdf<\/a><\/td><\/tr>
TR-31<\/td>An Optimal Algorithm for Geometrical Congruence<\/td>M.D. Atkinson<\/td>August 1983<\/td>N\/A<\/td><\/tr>
TR-32<\/td>Multi-Action Learning Automata Possessing Ergodicity of the Mean<\/a><\/td>B.J. Oommen & M.A.L. Thathachar<\/td>August 1983<\/td>TR-32.<\/a>pdf<\/a><\/td><\/tr>
TR-33<\/td>Fibonacci Graphs, Cyclic Permutations and Extremal Points<\/td>N. Santoro & J. Urrutia<\/td>December 1983<\/td>N\/A<\/td><\/tr>
TR-34<\/td>Distributed Sorting<\/td>D. Rotem, N. Santoro, J.B. Sidney<\/td>December 1983<\/td>N\/A<\/td><\/tr>
TR-35<\/td>A Reduction Technique for Selection in Distributed Files: II<\/td>N. Sanatoro, M. Scheutzow, J.B. Sidney<\/td>December 1983<\/td>N\/A<\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"

Number Title Authors Date Download TR-14 A Common Basis for Similarity Measures Involving Two Strings R.L. Kashyap & B.J. Oommen January 1983 TR-14.pdf TR-15 Similarity Measures for Sets of String R.L. Kashyap & B.J. Oommen January 1983 TR-15.pdf TR-16 The Noisy Substring Matching Problem R.L. Kashyap & B.J. Oommen January 1983 TR-16.pdf TR-17 Distributed Election […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11593,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[89],"class_list":["post-11785","page","type-page","status-publish","hentry","cu_page_type-technical-reports-by-year"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11785","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=11785"}],"version-history":[{"count":5,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11785\/revisions"}],"predecessor-version":[{"id":24635,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11785\/revisions\/24635"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11593"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=11785"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=11785"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}