{"id":11736,"date":"2021-10-14T15:12:52","date_gmt":"2021-10-14T19:12:52","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=11736"},"modified":"2021-11-21T17:12:49","modified_gmt":"2021-11-21T22:12:49","slug":"technical-reports-1995","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/","title":{"rendered":"Technical Reports 1995"},"content":{"rendered":"\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Technical Reports 1995<\/td>\n

Number<\/strong><\/td>\nTitle<\/strong><\/td>\nAuthors<\/strong><\/td>\nDate<\/strong><\/td>\nDownload<\/strong><\/td>\n<\/tr>\n
TR-95-01<\/td>\n\n
Pattern Recognition of Strings with Substitution, Insertions, Deletions<\/a><\/div>\n<\/td>\n
\n
B.J. Oommen & R.K.S. Loke<\/div>\n<\/td>\n
\n
January 1995<\/div>\n<\/td>\n
TR-95-01.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-02<\/div>\n<\/td>\n
\n
Stochastic Searching on the Line and its Applications to Parameter Learning in Nonlinear Optimization<\/a><\/div>\n<\/td>\n
\n
B.J. Oommen<\/div>\n<\/td>\n
\n
January 1995<\/div>\n<\/td>\n
TR-95-02.pdf<\/a><\/td>\n<\/tr>\n
TR-95-03<\/td>\n\n
Red-Black Balanced Trie Hashing<\/a><\/div>\n<\/td>\n
\n
E. J. Otoo<\/div>\n<\/td>\n
\n
February 1995<\/div>\n<\/td>\n
TR-95-03.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-04<\/div>\n<\/td>\n
\n
\n
Hop-Congestion Tradeoffs for ATM Networks<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Evangelos Kranakis, Danny Krizanc, Andrzej Pelc<\/div>\n<\/div>\n<\/td>\n
\n
\n
March 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-04.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-05<\/div>\n<\/td>\n
\n
\n
Noisy Subsequence Recognition using Constrained String Editing involving Arbitrary Operations<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
B. J. Oommen & R.K.S. Loke<\/div>\n<\/div>\n<\/td>\n
\n
\n
March 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-05.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-06<\/div>\n<\/td>\n
\n
\n
Planar Stage Graphs: Characterizations and Applications<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Frank Bauernoppel, Evangelos Kranakis,, Danny Krizanc, Anil Maheshwari, Jorg-Rudiger Sack, Jorge Urrutia<\/div>\n<\/div>\n<\/td>\n
\n
\n
March 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-06.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-07<\/div>\n<\/td>\n
\n
\n
Stage-Graph Representations<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jorg-Rudiger Sack, Jorge Urrutia<\/div>\n<\/div>\n<\/td>\n
\n
\n
March 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-07.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-08<\/div>\n<\/td>\n
\n
\n
Implicit Routing and Shortest Path Information<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Evangelos Kranakis, Danny Krizanc, Jorge Urrutia<\/div>\n<\/div>\n<\/td>\n
\n
\n
April 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-08.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-09<\/div>\n<\/td>\n
\n
\n
Ray Shooting from Convex Ranges<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Evangelos Kranakis, Danny Krizanc, A. Maheshwari, J.R. Sack, J. Urrutia<\/div>\n<\/div>\n<\/td>\n
\n
\n
April 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-09.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-10<\/div>\n<\/td>\n
\n
\n
Sense of Direction: Definitions, Properties, and Classes<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Paola Flocchini, Bernard Mans, Nicola Santoro<\/div>\n<\/div>\n<\/td>\n
\n
\n
May 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-10.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-11<\/div>\n<\/td>\n
\n
\n
Minimizing Congestion of Layouts for ATM Networks with Faulty Links<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc<\/div>\n<\/div>\n<\/td>\n
\n
\n
May 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-11.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-12<\/div>\n<\/td>\n
\n
\n
An Improved Maximum Matching Algorithm in a Permutation Graph<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Frank Bauernoppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jorg-Rudiger Sack, Jorge Urrutia<\/div>\n<\/div>\n<\/td>\n
\n
\n
May 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-12.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-13<\/div>\n<\/td>\n
\n
\n
Efficient Computation of Implicit Representations of Sparse Graph<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Srinivasa R. Arikati, Anil Maheshwari, Christos D. Zaroliagis<\/div>\n<\/div>\n<\/td>\n
\n
\n
May 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-13.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-14<\/div>\n<\/td>\n
\n
\n
A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Frank Dehne, Xiaotie Deng, Patrick Dymond, Andreas Fabri, Ashfaq A. Khokhar<\/div>\n<\/div>\n<\/td>\n
\n
\n
June 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-14.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-15<\/div>\n<\/td>\n
\n
\n
PAS: A Printer Accounting System for Linux<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Murali Thiyagarajah<\/div>\n<\/div>\n<\/td>\n
\n
\n
June 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-15.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-16<\/div>\n<\/td>\n
\n
\n
Multipacket Hot-Potato Routing on Processor Arrays<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Christos Kaklamanis & Danny Krizanc<\/div>\n<\/div>\n<\/td>\n
\n
\n
June 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-16.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-17<\/div>\n<\/td>\n
\n
\n
Complexity of Boolean Routing<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Evangelos Kranakis, Danny Krizanc, Jorge Urrutia<\/div>\n<\/div>\n<\/td>\n
\n
\n
July 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-17.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-18<\/div>\n<\/td>\n
\n
\n
Lower Bounds for Compact Routing<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Evangelos Kranakis & Danny Krizanc<\/div>\n<\/div>\n<\/td>\n
\n
\n
July 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-18.pdf<\/a><\/td>\n<\/tr>\n
TR-95-19<\/td>\n\n
\n
Vector Quantization for Arbitrary Distance Function Estimation<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
I. Kuban Altinel, John Oommen, Necati Aras<\/div>\n<\/div>\n<\/td>\n
\n
\n
July 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-19.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-20<\/div>\n<\/td>\n
\n
\n
Multi-Dimensional Spatial Index Encoding Device<\/div>\n<\/div>\n<\/td>\n
\n
\n
Y. Gao, E.J. Otoo, M. Thiyagarajah<\/div>\n<\/div>\n<\/td>\n
\n
\n
October 1995<\/div>\n<\/div>\n<\/td>\n
N\/A<\/td>\n<\/tr>\n
\n
TR-95-21<\/div>\n<\/td>\n
\n
\n
Reducing Contention for Run Queue in Shared-Memory Multiprocessor Systems<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Sivarama P. Dandamudi<\/div>\n<\/div>\n<\/td>\n
\n
\n
October 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-21.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-22<\/div>\n<\/td>\n
\n
\n
Approximate Maxima Finding of Continuous Functions under Restricted Budget<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg<\/div>\n<\/div>\n<\/td>\n
\n
\n
November 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-22.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-23<\/div>\n<\/td>\n
\n
\n
Performance Impact of Run Queue Organization and Synchronization on Large-Scale NUMA Multiprocessor Systems<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Sivarama P. Dandamudi & S. P. Cheng<\/div>\n<\/div>\n<\/td>\n
\n
\n
November 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-23.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-24<\/div>\n<\/td>\n
\n
\n
The Impact of Program Structure on the Performance of Scheduling Policies in Multiprocessor Systems<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Sivarama P.Dandamudi<\/div>\n<\/div>\n<\/td>\n
\n
\n
November 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-24.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-25<\/div>\n<\/td>\n
\n
\n
The Effect of Scheduling Discipline on Sender-Initiated and Receiver-Initiated Adaptive Load Sharing in Homogeneous Distributed Systems<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Sivarama P. Dandamudi<\/div>\n<\/div>\n<\/td>\n
\n
\n
December 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-25.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-95-26<\/div>\n<\/td>\n
\n
\n
Approximating the Unsatisfiability Threshold of Random Formulas<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc<\/div>\n<\/div>\n<\/td>\n
\n
\n
December 1995<\/div>\n<\/div>\n<\/td>\n
TR-95-26.pdf<\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"

Technical Reports 1995 Number Title Authors Date Download TR-95-01 Pattern Recognition of Strings with Substitution, Insertions, Deletions B.J. Oommen & R.K.S. Loke January 1995 TR-95-01.pdf TR-95-02 Stochastic Searching on the Line and its Applications to Parameter Learning in Nonlinear Optimization B.J. Oommen January 1995 TR-95-02.pdf TR-95-03 Red-Black Balanced Trie Hashing E. J. Otoo February 1995 […]<\/p>\n","protected":false},"author":7,"featured_media":0,"parent":11593,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_relevanssi_hide_post":"","_relevanssi_hide_content":"","_relevanssi_pin_for_all":"","_relevanssi_pin_keywords":"","_relevanssi_unpin_keywords":"","_relevanssi_related_keywords":"","_relevanssi_related_include_ids":"","_relevanssi_related_exclude_ids":"","_relevanssi_related_no_append":"","_relevanssi_related_not_related":"","_relevanssi_related_posts":"","_relevanssi_noindex_reason":"","_mi_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":"","_links_to":"","_links_to_target":""},"yoast_head":"\nTechnical Reports 1995 - School of Computer Science<\/title>\n<meta name=\"description\" content=\"Technical Reports 1995 Number Title Authors Date Download TR-95-01 Pattern Recognition of Strings with Substitution, Insertions, Deletions B.J. Oommen\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"3 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/\",\"url\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/\",\"name\":\"Technical Reports 1995 - School of Computer Science\",\"isPartOf\":{\"@id\":\"https:\/\/carleton.ca\/scs\/#website\"},\"datePublished\":\"2021-10-14T19:12:52+00:00\",\"dateModified\":\"2021-11-21T22:12:49+00:00\",\"description\":\"Technical Reports 1995 Number Title Authors Date Download TR-95-01 Pattern Recognition of Strings with Substitution, Insertions, Deletions B.J. Oommen\",\"breadcrumb\":{\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/carleton.ca\/scs\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Research\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"SCS Technical Reports\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"Technical Reports 1995\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/carleton.ca\/scs\/#website\",\"url\":\"https:\/\/carleton.ca\/scs\/\",\"name\":\"School of Computer Science\",\"description\":\"Carleton University\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/carleton.ca\/scs\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Technical Reports 1995 - School of Computer Science","description":"Technical Reports 1995 Number Title Authors Date Download TR-95-01 Pattern Recognition of Strings with Substitution, Insertions, Deletions B.J. Oommen","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/","twitter_misc":{"Est. reading time":"3 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/","url":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/","name":"Technical Reports 1995 - School of Computer Science","isPartOf":{"@id":"https:\/\/carleton.ca\/scs\/#website"},"datePublished":"2021-10-14T19:12:52+00:00","dateModified":"2021-11-21T22:12:49+00:00","description":"Technical Reports 1995 Number Title Authors Date Download TR-95-01 Pattern Recognition of Strings with Substitution, Insertions, Deletions B.J. Oommen","breadcrumb":{"@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/carleton.ca\/scs\/"},{"@type":"ListItem","position":2,"name":"Research","item":"https:\/\/carleton.ca\/scs\/research\/"},{"@type":"ListItem","position":3,"name":"SCS Technical Reports","item":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/"},{"@type":"ListItem","position":4,"name":"Technical Reports 1995"}]},{"@type":"WebSite","@id":"https:\/\/carleton.ca\/scs\/#website","url":"https:\/\/carleton.ca\/scs\/","name":"School of Computer Science","description":"Carleton University","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/carleton.ca\/scs\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"}]}},"acf":{"banner_image_type":"upload","banner_uploaded_image":{"ID":8983,"id":8983,"title":"Coding screen","filename":"laptop-code-1600.jpg","filesize":154356,"url":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600.jpg","link":"https:\/\/carleton.ca\/scs\/tech-support\/laptop-code-1600\/","alt":"Coding screen","author":"7","description":"Coding screen","caption":"","name":"laptop-code-1600","status":"inherit","uploaded_to":6535,"date":"2021-02-10 15:47:55","modified":"2021-11-25 20:57:39","menu_order":0,"mime_type":"image\/jpeg","type":"image","subtype":"jpeg","icon":"https:\/\/carleton.ca\/scs\/wp\/wp-includes\/images\/media\/default.png","width":1600,"height":700,"sizes":{"thumbnail":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-160x70.jpg","thumbnail-width":160,"thumbnail-height":70,"medium":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-240x105.jpg","medium-width":240,"medium-height":105,"medium_large":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-768x336.jpg","medium_large-width":768,"medium_large-height":336,"large":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-400x175.jpg","large-width":400,"large-height":175,"gallery-thumb":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-300x230.jpg","gallery-thumb-width":300,"gallery-thumb-height":230,"1536x1536":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-1536x672.jpg","1536x1536-width":1536,"1536x1536-height":672,"2048x2048":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600.jpg","2048x2048-width":1600,"2048x2048-height":700,"banner":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600.jpg","banner-width":1600,"banner-height":700,"people":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-200x200.jpg","people-width":200,"people-height":200,"post-thumb":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-300x230.jpg","post-thumb-width":300,"post-thumb-height":230,"rotator-image":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-800x600.jpg","rotator-image-width":800,"rotator-image-height":600,"video-thumb":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-360x158.jpg","video-thumb-width":360,"video-thumb-height":158}},"banner_button":"no","banner_opacity":"dark"},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11736"}],"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\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=11736"}],"version-history":[{"count":4,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11736\/revisions"}],"predecessor-version":[{"id":12812,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11736\/revisions\/12812"}],"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=11736"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}