Severity: Warning
Message: file_get_contents(https://...@pubfacts.com&api_key=b8daa3ad693db53b1410957c26c9a51b4908&a=1): Failed to open stream: HTTP request failed! HTTP/1.1 429 Too Many Requests
Filename: helpers/my_audit_helper.php
Line Number: 176
Backtrace:
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 176
Function: file_get_contents
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 250
Function: simplexml_load_file_from_url
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 1034
Function: getPubMedXML
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 3152
Function: GetPubMedArticleOutput_2016
File: /var/www/html/application/controllers/Detail.php
Line: 575
Function: pubMedSearch_Global
File: /var/www/html/application/controllers/Detail.php
Line: 489
Function: pubMedGetRelatedKeyword
File: /var/www/html/index.php
Line: 316
Function: require_once
The individual leaves of a multileaf collimator (MLC) have a tongue-and-groove or stepped-edge design to minimize leakage radiation between adjacent leaves. This design element has a drawback in that it creates areas of underdosages in intensity-modulated photon beams unless a leaf trajectory is specifically designed such that for any two adjacent leaf pairs, the direct exposure under the tongue-and-groove is equal to the lower of the direct exposures of the leaf pairs. In this work, we present a systematic study of the optimization of a leaf sequencing algorithm for segmental multileaf collimator beam delivery that completely eliminates areas of underdosages due to tongue-and-groove or stepped-edge design of the MLC. Simultaneous elimination of tongue-and-groove effect and leaf interdigitation is also studied. This is an extension of our previous work (Kamath et al 2003a Phys. Med. Biol. 48 307) in which we described a leaf sequencing algorithm that is optimal for monitor unit (MU) efficiency under most common leaf movement constraints that include minimum leaf separation. Compared to our previously published algorithm (without constraints), the new algorithms increase the number of sub-fields by approximately 21% and 25%, respectively, but are optimal in MU efficiency for unidirectional schedules.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1088/0031-9155/49/3/n01 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!