
{"id":93,"date":"2016-04-28T18:57:44","date_gmt":"2016-04-28T18:57:44","guid":{"rendered":"http:\/\/labs.la.utexas.edu\/gilden\/?page_id=93"},"modified":"2016-04-28T19:10:05","modified_gmt":"2016-04-28T19:10:05","slug":"visual-search-code","status":"publish","type":"page","link":"https:\/\/labs.la.utexas.edu\/gilden\/visual-search-code\/","title":{"rendered":"Visual Search Code"},"content":{"rendered":"<p><big><big>VISUAL SEARCH CODE<\/big><\/big><\/p>\n<p><big>(<a href=\"http:\/\/labs.la.utexas.edu\/gilden\/visual-search-data\/\">Click here for Visual Search Data<\/a>)<\/big><\/p>\n<p>This Fortran code was created to simulate runs of parallel and serial visual search processes using a range of parameter values.\u00a0 It ran in August 2007 on the Lonestar Dell Linux cluster at the Texas Advanced Computing Center.\u00a0 The code is designed to simulate 2000 runs at each unique parameter combination for each set size and target number.<\/p>\n<p>A separate set of code was created for each set size\/target number combination.\u00a0 This page contains the code for set size 1, target number 0, which can be modified to represent any of the nine cells by altering the input file.<\/p>\n<h3><a href=\"http:\/\/labs.la.utexas.edu\/gilden\/serial-code\/\">Serial code<\/a><\/h3>\n<h3><a href=\"http:\/\/labs.la.utexas.edu\/gilden\/parallel-code\/\">Parallel code<\/a><\/h3>\n<h3><a href=\"http:\/\/labs.la.utexas.edu\/gilden\/serial-input-file\/\">Serial input file<\/a><\/h3>\n<h3><a href=\"http:\/\/labs.la.utexas.edu\/gilden\/parallel-input-file\/\">Parallel input file<\/a><\/h3>\n","protected":false},"excerpt":{"rendered":"<p>VISUAL SEARCH CODE (Click here for Visual Search Data) This Fortran code was created to simulate runs of parallel and serial visual search processes using a range of parameter values.\u00a0 It ran in August 2007 on the Lonestar Dell Linux cluster at the Texas Advanced Computing Center.\u00a0 The code is designed to simulate 2000 runs [&hellip;]<\/p>\n","protected":false},"author":107,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_uag_custom_page_level_css":"","footnotes":""},"class_list":["post-93","page","type-page","status-publish","hentry","entry"],"uagb_featured_image_src":{"full":false,"thumbnail":false,"medium":false,"medium_large":false,"large":false,"1536x1536":false,"2048x2048":false,"site-graphic":false},"uagb_author_info":{"display_name":"ecw255","author_link":"https:\/\/labs.la.utexas.edu\/gilden\/author\/ecw255\/"},"uagb_comment_info":0,"uagb_excerpt":"VISUAL SEARCH CODE (Click here for Visual Search Data) This Fortran code was created to simulate runs of parallel and serial visual search processes using a range of parameter values.\u00a0 It ran in August 2007 on the Lonestar Dell Linux cluster at the Texas Advanced Computing Center.\u00a0 The code is designed to simulate 2000 runs&hellip;","_links":{"self":[{"href":"https:\/\/labs.la.utexas.edu\/gilden\/wp-json\/wp\/v2\/pages\/93","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/labs.la.utexas.edu\/gilden\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/labs.la.utexas.edu\/gilden\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/labs.la.utexas.edu\/gilden\/wp-json\/wp\/v2\/users\/107"}],"replies":[{"embeddable":true,"href":"https:\/\/labs.la.utexas.edu\/gilden\/wp-json\/wp\/v2\/comments?post=93"}],"version-history":[{"count":4,"href":"https:\/\/labs.la.utexas.edu\/gilden\/wp-json\/wp\/v2\/pages\/93\/revisions"}],"predecessor-version":[{"id":129,"href":"https:\/\/labs.la.utexas.edu\/gilden\/wp-json\/wp\/v2\/pages\/93\/revisions\/129"}],"wp:attachment":[{"href":"https:\/\/labs.la.utexas.edu\/gilden\/wp-json\/wp\/v2\/media?parent=93"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}