Search NASA⌕ Search

SEARCH · Search NASA

Results for “Nodes”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7

Error recovery to enable error-free message transfer between nodes of a computer network

An error-recovery method to enable error-free message transfer between nodes of a computer network. A first node of the network sends a packet to a second node of the network over a link between the nodes, and the first node keeps a copy of the packet on a sending end of the link until the first node receives acknowledgment from the second node that the packet was received without error. The second node tests the packet to determine if the packet is error free. If the packet is not error free, the second node sets a flag to mark the packet as corrupt. The second node returns acknowledgement to the first node specifying whether the packet was received with or without error. When the packet is received with error, the link is returned to a known state and the packet is sent again to the second node.

97 MATHEMATICS AND COMPUTING↗

Magnetic Resonance Lymphography-Guided Selective High-Dose Lymph Node Irradiation in Prostate Cancer

Purpose: To demonstrate the feasibility of magnetic resonance lymphography (MRL) -guided delineation of a boost volume and an elective target volume for pelvic lymph node irradiation in patients with prostate cancer. The feasibility of irradiating these volumes with a high-dose boost to the MRL-positive lymph nodes in conjunction with irradiation of the prostate using intensity-modulated radiotherapy (IMRT) was also investigated. Methods and Materials: In 4 prostate cancer patients with a high risk of lymph node involvement but no enlarged lymph nodes on CT and/or MRI, MRL detected pathological lymph nodes in the pelvis. These lymph nodes were identified and delineated on a radiotherapy planning CT to create a boost volume. Based on the location of the MRL-positive lymph nodes, the standard elective pelvic target volume was individualized. An IMRT plan with a simultaneous integrated boost (SIB) was created with dose prescriptions of 42 Gy to the pelvic target volume, a boost to 60 Gy to the MRL-positive lymph nodes, and 72 Gy to the prostate. Results: All MRL-positive lymph nodes could be identified on the planning CT. This information could be used to delineate a boost volume and to individualize the pelvic target volume for elective irradiation. IMRT planning delivered highly acceptable radiotherapy plans with regard to the prescribed dose levels and the dose to the organs at risk (OARs). Conclusion: MRL can be used to select patients with limited lymph node involvement for pelvic radiotherapy. MRL-guided delineation of a boost volume and an elective pelvic target volume for selective high-dose lymph node irradiation with IMRT is feasible. Whether this approach will result in improved outcome for these patients needs to be investigated in further clinical studies.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Occult Pelvic Lymph Node Involvement in Bladder Cancer: Implications for Definitive Radiation

Purpose: To inform radiation treatment planning for clinically staged, node-negative bladder cancer patients by identifying clinical factors associated with the presence and location of occult pathologic pelvic lymph nodes. Methods and Materials: The records of patients with clinically staged T1-T4N0 urothelial carcinoma of the bladder undergoing radical cystectomy and pelvic lymphadenectomy at a single institution were reviewed. Logistic regression was used to evaluate associations between preoperative clinical variables and occult pathologic pelvic or common iliac lymph nodes. Percentages of patient with involved lymph node regions entirely encompassed within whole bladder (perivesicular nodal region), small pelvic (perivesicular, obturator, internal iliac, and external iliac nodal regions), and extended pelvic clinical target volume (CTV) (small pelvic CTV plus common iliac regions) were calculated. Results: Among 315 eligible patients, 81 (26%) were found to have involved pelvic lymph nodes at the time of surgery, with 38 (12%) having involved common iliac lymph nodes. Risk of occult pathologically involved lymph nodes did not vary with clinical T stage. On multivariate analysis, the presence of lymphovascular invasion (LVI) on preoperative biopsy was significantly associated with occult pelvic nodal involvement (odds ratio 3.740, 95% confidence interval 1.865-7.499, P<.001) and marginally associated with occult common iliac nodal involvement (odds ratio 2.307, 95% confidence interval 0.978-5.441, P=.056). The percentages of patients with involved lymph node regions entirely encompassed by whole bladder, small pelvic, and extended pelvic CTVs varied with clinical risk factors, ranging from 85.4%, 95.1%, and 100% in non-muscle-invasive patients to 44.7%, 71.1%, and 94.8% in patients with muscle-invasive disease and biopsy LVI. Conclusions: Occult pelvic lymph node rates are substantial for all clinical subgroups, especially patients with LVI on biopsy. Extended coverage of pelvic lymph nodes up to the level of the common iliac nodes may be warranted in subsets of patients.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Operation of the Planetary Plasma Interactions Node of the Planetary Data System

Five years ago NASA selected the Planetary Plasma Interactions (PPI) Node at UCLA to help the scientific community locate, access and preserve particles and fields data from planetary missions. We propose to continue to serve for 5 more years. During the first five years we have served the scientific community by providing them with high quality data products. We worked with missions and individual scientists to secure the highest quality data possible and to thoroughly document it. We validated the data, placed it on long lasting media and made sure it was properly archived for future use. So far we have prepared and archived over 10(exp 11) bytes of data from 26 instruments on 4 spacecraft. We have produced 106 CD-ROMs with peer reviewed data. In so doing, we have developed an efficient system to prepare and archive the data and thereby have been able to steadily increase the rate at which the data are produced. Although we produced a substantial archive during the initial five years, we have an even larger amount of work in progress. This includes preparing CD-ROM data sets with all of the Voyager, Pioneer and Ulysses data at Jupiter and Saturn. We will have the Jupiter data ready for the Galileo encounter in December, 1995. We are also completing the Pioneer Venus data restoration. The Galileo Venus archive and radio science data from Magellan will be prepared early in the next period. We are assisting the Small Bodies Node of PDS in the preparation of comet data and will be archiving the asteroid data from Galileo. We will be moving in several new directions as well. We will archive the PPI Node's first Earth based data with data from the International Jupiter Watch and Hubble data taken in support of Ulysses particles and field observations. We will work with the Cassini mission in archive planning efforts. For the inner planets we will begin an archive of Mars data starting with Phobos data and will support the US and Russian Mars missions in the late 1990's. We will restore the Mercury data from Mariner 10 and prepare the lunar data from Clementine in time for the lunar data analysis program in 1995. We will work with the Discovery mission teams to plan their archive and have already started with one, NEAR. Finally we will begin archiving our first heliospheric data from Voyager, Galileo, and Mars observers. We will continue to serve the science community by providing access to the data products. During the past 19 months we have filled nearly 6000 requests for on-line and CD-ROM data. The data delivered directly by the PPI Node has been - 5 x 10(exp 11) bytes. In addition to providing the data, we have provided users with software tools to manage and read the data which are computer, operating system and format independent. We have developed scalable systems so that the same software we use to manage and access the data for the entire PPI Node can be used by individual investigators to manage the data on a single CD-ROM, thereby greatly reducing the software development effort for both the PPI Node and users. We deliver this software with the disks. Recent technical advances have made it possible for us to serve a broader community than before. In the next five year period we plan to extend our outreach to the general public and in particular to increase our support for education. Since planetary plasma data are varied and require expertise in many areas the PPI Node will continue to be distributed. In addition to the primary node at UCLA, the PPI Node has three subnodes with an Outer Planets Subnode at the University of Iowa, an Inner Planets Subnode at UCLA, and a Radio Science Subnode at Stanford University. During the first two years of the renewal period there will be a Radio Astronomy Data Node at GSFC. These organizations will provide scientific expertise on the data, participate in node data selection activities and help with data restoration and mission activities.

Walker, Raymond J.↗

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by routing through transporter nodes

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a destination. Some packets are constrained to be routed through respective designated transporter nodes, the automated routing strategy determining a path from a respective source node to a respective transporter node, and from a respective transporter node to a respective destination node. Preferably, the source node chooses a routing policy from among multiple possible choices, and that policy is followed by all intermediate nodes. The use of transporter nodes allows greater flexibility in routing.

Archer, Charles Jens↗

Managing variations among nodes in parallel system frameworks

Systems, apparatuses, and methods for managing variations among nodes in parallel system frameworks. Sensor and performance data associated with the nodes of a multi-node cluster may be monitored to detect variations among the nodes. A variability metric may be calculated for each node of the cluster based on the sensor and performance data associated with the node. The variability metrics may then be used by a mapper to efficiently map tasks of a parallel application to the nodes of the cluster. In one embodiment, the mapper may assign the critical tasks of the parallel application to the nodes with the lowest variability metrics. In another embodiment, the hardware of the nodes may be reconfigured so as to reduce the node-to-node variability.

97 MATHEMATICS AND COMPUTING↗

Methods and apparatus using commutative error detection values for fault isolation in multiple node computers

Methods and apparatus perform fault isolation in multiple node computing systems using commutative error detection values for--example, checksums--to identify and to isolate faulty nodes. When information associated with a reproducible portion of a computer program is injected into a network by a node, a commutative error detection value is calculated. At intervals, node fault detection apparatus associated with the multiple node computer system retrieve commutative error detection values associated with the node and stores them in memory. When the computer program is executed again by the multiple node computer system, new commutative error detection values are created and stored in memory. The node fault detection apparatus identifies faulty nodes by comparing commutative error detection values associated with reproducible portions of the application program generated by a particular node from different runs of the application program. Differences in values indicate a possible faulty node.

97 MATHEMATICS AND COMPUTING↗

Anatomic Distribution of Fluorodeoxyglucose-Avid Para-aortic Lymph Nodes in Patients With Cervical Cancer

Purpose: Conformal treatment of para-aortic lymph nodes (PAN) in cervical cancer allows dose escalation and reduces normal tissue toxicity. Currently, data documenting the precise location of involved PAN are lacking. We define the spatial distribution of this high-risk nodal volume by analyzing fluorodeoxyglucose (FDG)-avid lymph nodes (LNs) on positron emission tomography/computed tomography (PET/CT) scans in patients with cervical cancer. Methods and Materials: We identified 72 PANs on pretreatment PET/CT of 30 patients with newly diagnosed stage IB-IVA cervical cancer treated with definitive chemoradiation. LNs were classified as left-lateral para-aortic (LPA), aortocaval (AC), or right paracaval (RPC). Distances from the LN center to the closest vessel and adjacent vertebral body were calculated. Using deformable image registration, nodes were mapped to a template computed tomogram to provide a visual impression of nodal frequencies and anatomic distribution. Results: We identified 72 PET-positive para-aortic lymph nodes (37 LPA, 32 AC, 3 RPC). All RPC lymph nodes were in the inferior third of the para-aortic region. The mean distance from aorta for all lymph nodes was 8.3 mm (range, 3-17 mm), and from the inferior vena cava was 5.6 mm (range, 2-10 mm). Of the 72 lymph nodes, 60% were in the inferior third, 36% were in the middle third, and 4% were in the upper third of the para-aortic region. In all, 29 of 30 patients also had FDG-avid pelvic lymph nodes. Conclusions: A total of 96% of PET positive nodes were adjacent to the aorta; PET positive nodes to the right of the IVC were rare and were all located distally, within 3 cm of the aortic bifurcation. Our findings suggest that circumferential margins around the vessels do not accurately define the nodal region at risk. Instead, the anatomical extent of the nodal basin should be contoured on each axial image to provide optimal coverage of the para-aortic nodal compartment.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Tuning Zr 12 O 22 Node Defects as Catalytic Sites in the Metal–Organic Framework hcp UiO-66

Defects in metal–organic frameworks (MOFs) play important roles in MOF reactivity and catalysis. Now, we report evidence of the reactivity and the quantitative characterization of the missing linker defects on the Zr 12 O 22 nodes in the MOF hcp UiO-66 (these are paired Zr 6 O 8 nodes bridged by OH groups) and those on the Zr 6 O 8 nodes of the MOF UiO-66. The defect sites catalyze the ring-opening reactions of epoxides with alcohols, and new sites formed by removal of bridging OH groups on the Zr 12 O 22 nodes also participate in the catalysis. The hcp UiO-66 was synthesized from UiO-66 and from molecular precursors, and, under various synthesis conditions, the nodes incorporated acetate ligands, where linkers were missing, and the number of these ligands was controlled by the synthesis conditions. These ligands are inhibitors of the catalytic reactions, and their removal by reaction with, for example, methanol (to form, for example, methyl acetate) preceded catalysis on the defect sites. The former MOF incorporated more defect sites than the latter, correspondingly being a more active catalyst. The defect sites on the Zr 12 O 22 nodes are 2–6 times more active per site than those on the isolated Zr 6 O 8 nodes, with the node-bridging OH groups increasing the catalytic activity of the neighboring node defect sites because new sites are formed by their removal. In conclusion, the results help point the way to the design and control of catalytic sites on metal oxide-like MOF nodes by tuning of the number and reactivity of the defect sites.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Viscous Fluxes

Discretization of the viscous terms in current finite-volume unstructured-grid schemes are compared using node-centered and cell-centered approaches in two dimensions. Accuracy and complexity are studied for four nominally second-order accurate schemes: a node-centered scheme and three cell-centered schemes - a node-averaging scheme and two schemes with nearest-neighbor and adaptive compact stencils for least-square face gradient reconstruction. The grids considered range from structured (regular) grids to irregular grids composed of arbitrary mixtures of triangles and quadrilaterals, including random perturbations of the grid points to bring out the worst possible behavior of the solution. Two classes of tests are considered. The first class of tests involves smooth manufactured solutions on both isotropic and highly anisotropic grids with discontinuous metrics, typical of those encountered in grid adaptation. The second class concerns solutions and grids varying strongly anisotropically over a curved body, typical of those encountered in high-Reynolds number turbulent flow simulations. Tests from the first class indicate the face least-square methods, the node-averaging method without clipping, and the node-centered method demonstrate second-order convergence of discretization errors with very similar accuracies per degree of freedom. The tests of the second class are more discriminating. The node-centered scheme is always second order with an accuracy and complexity in linearization comparable to the best of the cell-centered schemes. In comparison, the cell-centered node-averaging schemes may degenerate on mixed grids, have a higher complexity in linearization, and can fail to converge to the exact solution when clipping of the node-averaged values is used. The cell-centered schemes using least-square face gradient reconstruction have more compact stencils with a complexity similar to that of the node-centered scheme. For simulations on highly anisotropic curved grids, the least-square methods have to be amended either by introducing a local mapping based on a distance function commonly available in practical schemes or modifying the scheme stencil to reflect the direction of strong coupling. The major conclusion is that accuracies of the node centered and the best cell-centered schemes are comparable at equivalent number of degrees of freedom.

Diskin, Boris↗

Clearance Analysis of Node 3 Aft CBM to the Stowed FGB Solar Array

In early 2011, the ISS Vehicle Configuration Office began considering the relocation of the Permanent Multipurpose Module (PMM) to the aft facing Common Berthing Mechanism (CBM) on Node 3 to open a berthing location for visiting vehicles on the Node 1 nadir CBM. In this position, computer-aided design (CAD) models indicated that the aft end of the PMM would be only a few inches from the stowed Functional Cargo Block (FGB) port solar array. To validate the CAD model clearance analysis, in the late summer of 2011 the Image Science and Analysis Group (ISAG) was asked to determine the true geometric relationship between the on-orbit aft facing Node 3 CBM and the FGB port solar array. The desired measurements could be computed easily by photogrammetric analysis if current imagery of the ISS hardware were obtained. Beginning in the fall of 2011, ISAG used the Dynamic Onboard Ubiquitous Graphics (DOUG) program to design a way to acquire imagery of the aft face of Node 3, the aft end-cone of Node 1, the port side of pressurized mating adapter 1 (PMA1), and the port side of the FGB out to the tip of the port solar array using cameras on the Space Station Remote Manipulator System (SSRMS). This was complicated by the need to thread the SSRMS under the truss, past Node 3 and the Cupola, and into the space between the aft side of Node 3 and the FGB solar array to acquire more than 100 images from multiple positions. To minimize the number of SSRMS movements, the Special Purpose Dexterous Manipulator (SPDM) would be attached to the SSRMS. This would make it possible to park the SPDM in one position and acquire multiple images by changing the viewing orientation of the SPDM body cameras using the pan/tilt units on which the cameras are mounted. Using this implementation concept, ISAG identified four SSRMS/SPDM positions from which all of the needed imagery could be acquired. Based on a photogrammetric simulation, it was estimated that the location of the FGB solar array could be measured within an accuracy of about 1 in. in each axis relative to the ISS Analysis Coordinate System (ISSACS). In October 2011, a proposed image-acquisition plan was drafted by ISAG and released for review. The ISS Robotics flight control team (ROBO) proposed minor changes to SPDM positions 1 and 4 to meet ISS proximity requirements. The updated image acquisition plan and draft chit were presented to and approved by the Systems Working Group (SWG) November 18 and were sent to the Vehicle Configuration Board (VCB) in early December 2011. Working with ROBO on 3 successive days (February 21, 22, and 23), ISAG collected 161 images of the ISS. Approximately 40 images were collected from each of the four different SSRMS/SPDM positions, with each set mapping the region from the Node 3 end cone, across Node 1, along the forward port side portion of the FGB, and out the port side FGB solar arrays. From this imagery, the best 80 images were selected for use in the analysis. The images were radiometrically enhanced to improve color and contrast and loaded into the FotoG analysis software along with the camera parameters and control data, which consisted of the coordinates for 54 handrail attachment bolts on the aft face of Node 3, in the ISSACS coordinate system. The results of this analysis produced the measured coordinates of 116 points distributed across the face of the FGB solar array panels (see figure 3) along with propagated uncertainty estimates in each coordinate axis. These results were sent to the ISS Vehicle Configuration Office, which sent them to the Configuration Analysis Modeling and Mass Properties (CAMMP) team for comparison with the Russian-provided CAD model for the retracted FGB solar arrays. The CAMMP analysis unexpectedly showed that the measured location of the port FGB solar array was up to 41-in. further outboard than the design and was slightly twisted about its rotational axis. The unexpected comparison results produced some initial concern regarding the accuracy of the photogrammetric measurements. To verify the measured results, ISAG personnel conducted a second analysis using just the imagery of the solar arrays in an arbitrary coordinate system defined by the three corner points of the inboard-most panel, with the design distance between points A1 and A10 as the only scale. The new measurements agreed with the original results to within less than 1 in. RMS in each axis, confirming the original solar array measurements. ISAG produced a final report for the ISS Vehicle Configuration Office documenting an apparent anomaly in the retracted configuration of the port FGB solar arrays. A copy of the measurement report was translated and sent to the Russian Space Agency. During a Vehicle Integrated Performance and Resources (VIPeR) teleconference September 24, 2012, the Russians acknowledged receipt of a translated copy of the ISAG report. The Russian representative stated that the head of the solar array design team claimed that the measured configuration was impossible unless the structure was physically broken. The Russians acknowledged that they had no expertise in photogrammetry, so the analysis technique employed was a "black box" to them, and they did not know how to use the ISAG results. They asked for a single image in which the overextension of the port solar array could be obviously seen. On November 10, 2012, during a face-to-face meeting with their Russian counterparts at JSC, ISAG presented nadir-view imagery of the FGB acquired during Space Shuttle rendezvous. Using the known width of the pressurized portion of the FGB as a scale, this analysis clearly showed that the port FGB solar array was extended outboard further than the Russian design for the retracted solar array.

Liddle, Donn↗

Performing an allreduce operation on a plurality of compute nodes of a parallel computer

Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: performing, for each node, a local reduction operation using allreduce contribution data for the cores of that node, yielding, for each node, a local reduction result for one or more representative cores for that node; establishing one or more logical rings among the nodes, each logical ring including only one of the representative cores from each node; performing, for each logical ring, a global allreduce operation using the local reduction result for the representative cores included in that logical ring, yielding a global allreduce result for each representative core included in that logical ring; and performing, for each node, a local broadcast operation using the global allreduce results for each representative core on that node.

97 MATHEMATICS AND COMPUTING↗

Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link.

97 MATHEMATICS AND COMPUTING↗

Performing an allreduce operation on a plurality of compute nodes of a parallel computer

Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: establishing, for each node, a plurality of logical rings, each ring including a different set of at least one core on that node, each ring including the cores on at least two of the nodes; iteratively for each node: assigning each core of that node to one of the rings established for that node to which the core has not previously been assigned, and performing, for each ring for that node, a global allreduce operation using contribution data for the cores assigned to that ring or any global allreduce results from previous global allreduce operations, yielding current global allreduce results for each core; and performing, for each node, a local allreduce operation using the global allreduce results.

97 MATHEMATICS AND COMPUTING↗

Providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

Methods, apparatus, and products are disclosed for providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: identifying each link in the global combining network for each compute node of the operational group; designating one of a plurality of point-to-point class routing identifiers for each link such that no compute node in the operational group is connected to two adjacent compute nodes in the operational group with links designated for the same class routing identifiers; and configuring each compute node of the operational group for point-to-point communications with each adjacent compute node in the global combining network through the link between that compute node and that adjacent compute node using that link's designated class routing identifier.

97 MATHEMATICS AND COMPUTING↗

Identifying a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator in a parallel computer

In a parallel computer, a largest logical plane from a plurality of logical planes formed of compute nodes of a subcommunicator may be identified by: identifying, by each compute node of the subcommunicator, all logical planes that include the compute node; calculating, by each compute node for each identified logical plane that includes the compute node, an area of the identified logical plane; initiating, by a root node of the subcommunicator, a gather operation; receiving, by the root node from each compute node of the subcommunicator, each node's calculated areas as contribution data to the gather operation; and identifying, by the root node in dependence upon the received calculated areas, a logical plane of the subcommunicator having the greatest area.

97 MATHEMATICS AND COMPUTING↗

Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link.

97 MATHEMATICS AND COMPUTING↗

Motion Analysis of 100 Mediastinal Lymph Nodes: Potential Pitfalls in Treatment Planning and Adaptive Strategies

Purpose: The motion of mediastinal lymph nodes may undermine local control with involved-field radiotherapy. We studied patterns of nodal and tumor motion in 41 patients with lung cancer. Methods and Materials: Four-dimensional (4D) computed tomography planning scans were retrospectively evaluated to identify patients with clearly visible mediastinal lymph nodes. One hundred nodes from 14 patients with Stage I and 27 patients with Stage III were manually contoured in all 4D computed tomography respiratory phases. Motion was derived from changes in the nodal center-of-mass position. Primary tumors were also delineated in all phases for 16 patients with Stage III disease. Statistical analysis included a multivariate mixed-effects model of grouped data. Results: Average 3D nodal motion during quiet breathing was 0.68 cm (range, 0.17-1.64 cm); 77% moved greater than 0.5 cm, and 10% moved greater than 1.0 cm. Motion was greatest in the lower mediastinum (p = 0.002), and nodes measuring 2 cm or greater in diameter showed motion similar to that in smaller nodes. In 11 of 16 patients studied, at least one node moved more than the corresponding primary tumor. No association between 3D primary tumor motion and nodal motion was observed. For mobile primary tumors, phase offsets between the primary tumor and nodes of two or more and three or more phases were observed for 33% and 12% of nodes, respectively. Conclusions: Mediastinal nodal motion is common, with phase offsets seen between the primary tumor and different nodes in the same patient. Patient-specific information is needed to ensure geometric coverage, and adaptive strategies based solely on the primary tumor may be misleading.

62 RADIOLOGY AND NUCLEAR MEDICINE↗