Dosimetric comparison of Acuros XB deterministic radiation transport method with Monte Carlo and model-based convolution methods in heterogeneous media

PubMed Central

Han, Tao; Mikell, Justin K.; Salehpour, Mohammad; Mourtada, Firas

2011-01-01

Purpose: The deterministic Acuros XB (AXB) algorithm was recently implemented in the Eclipse treatment planning system. The goal of this study was to compare AXB performance to Monte Carlo (MC) and two standard clinical convolution methods: the anisotropic analytical algorithm (AAA) and the collapsed-cone convolution (CCC) method. Methods: Homogeneous water and multilayer slab virtual phantoms were used for this study. The multilayer slab phantom had three different materials, representing soft tissue, bone, and lung. Depth dose and lateral dose profiles from AXB v10 in Eclipse were compared to AAA v10 in Eclipse, CCC in Pinnacle3, and EGSnrc MC simulations for 6 and 18 MV photon beams with open fields for both phantoms. In order to further reveal the dosimetric differences between AXB and AAA or CCC, three-dimensional (3D) gamma index analyses were conducted in slab regions and subregions defined by AAPM Task Group 53. Results: The AXB calculations were found to be closer to MC than both AAA and CCC for all the investigated plans, especially in bone and lung regions. The average differences of depth dose profiles between MC and AXB, AAA, or CCC was within 1.1, 4.4, and 2.2%, respectively, for all fields and energies. More specifically, those differences in bone region were up to 1.1, 6.4, and 1.6%; in lung region were up to 0.9, 11.6, and 4.5% for AXB, AAA, and CCC, respectively. AXB was also found to have better dose predictions than AAA and CCC at the tissue interfaces where backscatter occurs. 3D gamma index analyses (percent of dose voxels passing a 2%∕2 mm criterion) showed that the dose differences between AAA and AXB are significant (under 60% passed) in the bone region for all field sizes of 6 MV and in the lung region for most of field sizes of both energies. The difference between AXB and CCC was generally small (over 90% passed) except in the lung region for 18 MV 10 × 10 cm2 fields (over 26% passed) and in the bone region for 5 × 5 and 10�

SU-F-T-413: Calculation Accuracy of AAA and Acuros Using Cerrobend Blocks for TBI at 400cm

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lamichhane, N; Studenski, M

2016-06-15

Purpose: It is essential to assess the lung dose during TBI to reduce toxicity. Here we characterize the accuracy of the AAA and Acuros algorithms when using cerrobend lung shielding blocks at an extended distance for TBI. Methods: We positioned a 30×30×30 cm3 solid water slab phantom at 400 cm SSD and measured PDDs (Exradin A12 and PTW parallel plate ion chambers). A 2 cm thick, 10×10 cm2 cerrobend block was hung 2 cm in front of the phantom. This geometry was reproduced in the planning system for both AAA and Acuros. In AAA, the mass density of the cerrobendmore » block was forced to 9.38 g/cm3 and in Acuros it was forced to 8.0 g/cm3 (limited to selecting stainless steel). Three different relative electron densities (RED) were tested for each algorithm; 4.97, 6.97, and 8.97. Results: PDDs from both Acuros and AAA underestimated the delivered dose. AAA calculated that depth dose was higher for RED of 4.97 as compared to 6.97 and 8.97 but still lower than measured. There was no change in the percent depth dose with changing relative electron densities for Acuros. Conclusion: Care should be taken before using AAA or Acuros with cerrobend blocks as the planning system underestimates dose. Acuros limits the ability to modify RED when compared to AAA.« less

Experimental verification of the Acuros XB and AAA dose calculation adjacent to heterogeneous media for IMRT and RapidArc of nasopharygeal carcinoma.

PubMed

Kan, Monica W K; Leung, Lucullus H T; So, Ronald W K; Yu, Peter K N

2013-03-01

To compare the doses calculated by the Acuros XB (AXB) algorithm and analytical anisotropic algorithm (AAA) with experimentally measured data adjacent to and within heterogeneous medium using intensity modulated radiation therapy (IMRT) and RapidArc(®) (RA) volumetric arc therapy plans for nasopharygeal carcinoma (NPC). Two-dimensional dose distribution immediately adjacent to both air and bone inserts of a rectangular tissue equivalent phantom irradiated using IMRT and RA plans for NPC cases were measured with GafChromic(®) EBT3 films. Doses near and within the nasopharygeal (NP) region of an anthropomorphic phantom containing heterogeneous medium were also measured with thermoluminescent dosimeters (TLD) and EBT3 films. The measured data were then compared with the data calculated by AAA and AXB. For AXB, dose calculations were performed using both dose-to-medium (AXB_Dm) and dose-to-water (AXB_Dw) options. Furthermore, target dose differences between AAA and AXB were analyzed for the corresponding real patients. The comparison of real patient plans was performed by stratifying the targets into components of different densities, including tissue, bone, and air. For the verification of planar dose distribution adjacent to air and bone using the rectangular phantom, the percentages of pixels that passed the gamma analysis with the ± 3%/3mm criteria were 98.7%, 99.5%, and 97.7% on the axial plane for AAA, AXB_Dm, and AXB_Dw, respectively, averaged over all IMRT and RA plans, while they were 97.6%, 98.2%, and 97.7%, respectively, on the coronal plane. For the verification of planar dose distribution within the NP region of the anthropomorphic phantom, the percentages of pixels that passed the gamma analysis with the ± 3%/3mm criteria were 95.1%, 91.3%, and 99.0% for AAA, AXB_Dm, and AXB_Dw, respectively, averaged over all IMRT and RA plans. Within the NP region where air and bone were present, the film measurements represented the dose close to unit density water

In vivo verification of radiation dose delivered to healthy tissue during radiotherapy for breast cancer

NASA Astrophysics Data System (ADS)

Lonski, P.; Taylor, M. L.; Hackworth, W.; Phipps, A.; Franich, R. D.; Kron, T.

2014-03-01

Different treatment planning system (TPS) algorithms calculate radiation dose in different ways. This work compares measurements made in vivo to the dose calculated at out-of-field locations using three different commercially available algorithms in the Eclipse treatment planning system. LiF: Mg, Cu, P thermoluminescent dosimeter (TLD) chips were placed with 1 cm build-up at six locations on the contralateral side of 5 patients undergoing radiotherapy for breast cancer. TLD readings were compared to calculations of Pencil Beam Convolution (PBC), Anisotropic Analytical Algorithm (AAA) and Acuros XB (XB). AAA predicted zero dose at points beyond 16 cm from the field edge. In the same region PBC returned an unrealistically constant result independent of distance and XB showed good agreement to measured data although consistently underestimated by ~0.1 % of the prescription dose. At points closer to the field edge XB was the superior algorithm, exhibiting agreement with TLD results to within 15 % of measured dose. Both AAA and PBC showed mixed agreement, with overall discrepancies considerably greater than XB. While XB is certainly the preferable algorithm, it should be noted that TPS algorithms in general are not designed to calculate dose at peripheral locations and calculation results in such regions should be treated with caution.

Acuros CTS: A fast, linear Boltzmann transport equation solver for computed tomography scatter - Part I: Core algorithms and validation.

PubMed

Maslowski, Alexander; Wang, Adam; Sun, Mingshan; Wareing, Todd; Davis, Ian; Star-Lack, Josh

2018-05-01

To describe Acuros ® CTS, a new software tool for rapidly and accurately estimating scatter in x-ray projection images by deterministically solving the linear Boltzmann transport equation (LBTE). The LBTE describes the behavior of particles as they interact with an object across spatial, energy, and directional (propagation) domains. Acuros CTS deterministically solves the LBTE by modeling photon transport associated with an x-ray projection in three main steps: (a) Ray tracing photons from the x-ray source into the object where they experience their first scattering event and form scattering sources. (b) Propagating photons from their first scattering sources across the object in all directions to form second scattering sources, then repeating this process until all high-order scattering sources are computed using the source iteration method. (c) Ray-tracing photons from scattering sources within the object to the detector, accounting for the detector's energy and anti-scatter grid responses. To make this process computationally tractable, a combination of analytical and discrete methods is applied. The three domains are discretized using the Linear Discontinuous Finite Elements, Multigroup, and Discrete Ordinates methods, respectively, which confer the ability to maintain the accuracy of a continuous solution. Furthermore, through the implementation in CUDA, we sought to exploit the parallel computing capabilities of graphics processing units (GPUs) to achieve the speeds required for clinical utilization. Acuros CTS was validated against Geant4 Monte Carlo simulations using two digital phantoms: (a) a water phantom containing lung, air, and bone inserts (WLAB phantom) and (b) a pelvis phantom derived from a clinical CT dataset. For these studies, we modeled the TrueBeam ® (Varian Medical Systems, Palo Alto, CA) kV imaging system with a source energy of 125 kVp. The imager comprised a 600 μm-thick Cesium Iodide (CsI) scintillator and a 10:1 one

Comparison of selected dose calculation algorithms in radiotherapy treatment planning for tissues with inhomogeneities

NASA Astrophysics Data System (ADS)

Woon, Y. L.; Heng, S. P.; Wong, J. H. D.; Ung, N. M.

2016-03-01

Inhomogeneity correction is recommended for accurate dose calculation in radiotherapy treatment planning since human body are highly inhomogeneous with the presence of bones and air cavities. However, each dose calculation algorithm has its own limitations. This study is to assess the accuracy of five algorithms that are currently implemented for treatment planning, including pencil beam convolution (PBC), superposition (SP), anisotropic analytical algorithm (AAA), Monte Carlo (MC) and Acuros XB (AXB). The calculated dose was compared with the measured dose using radiochromic film (Gafchromic EBT2) in inhomogeneous phantoms. In addition, the dosimetric impact of different algorithms on intensity modulated radiotherapy (IMRT) was studied for head and neck region. MC had the best agreement with the measured percentage depth dose (PDD) within the inhomogeneous region. This was followed by AXB, AAA, SP and PBC. For IMRT planning, MC algorithm is recommended for treatment planning in preference to PBC and SP. The MC and AXB algorithms were found to have better accuracy in terms of inhomogeneity correction and should be used for tumour volume within the proximity of inhomogeneous structures.

Comparison of normal tissue dose calculation methods for epidemiological studies of radiotherapy patients.

PubMed

Mille, Matthew M; Jung, Jae Won; Lee, Choonik; Kuzmin, Gleb A; Lee, Choonsik

2018-06-01

Radiation dosimetry is an essential input for epidemiological studies of radiotherapy patients aimed at quantifying the dose-response relationship of late-term morbidity and mortality. Individualised organ dose must be estimated for all tissues of interest located in-field, near-field, or out-of-field. Whereas conventional measurement approaches are limited to points in water or anthropomorphic phantoms, computational approaches using patient images or human phantoms offer greater flexibility and can provide more detailed three-dimensional dose information. In the current study, we systematically compared four different dose calculation algorithms so that dosimetrists and epidemiologists can better understand the advantages and limitations of the various approaches at their disposal. The four dose calculations algorithms considered were as follows: the (1) Analytical Anisotropic Algorithm (AAA) and (2) Acuros XB algorithm (Acuros XB), as implemented in the Eclipse treatment planning system (TPS); (3) a Monte Carlo radiation transport code, EGSnrc; and (4) an accelerated Monte Carlo code, the x-ray Voxel Monte Carlo (XVMC). The four algorithms were compared in terms of their accuracy and appropriateness in the context of dose reconstruction for epidemiological investigations. Accuracy in peripheral dose was evaluated first by benchmarking the calculated dose profiles against measurements in a homogeneous water phantom. Additional simulations in a heterogeneous cylinder phantom evaluated the performance of the algorithms in the presence of tissue heterogeneity. In general, we found that the algorithms contained within the commercial TPS (AAA and Acuros XB) were fast and accurate in-field or near-field, but not acceptable out-of-field. Therefore, the TPS is best suited for epidemiological studies involving large cohorts and where the organs of interest are located in-field or partially in-field. The EGSnrc and XVMC codes showed excellent agreement with measurements

SU-E-T-802: Verification of Implanted Cardiac Pacemaker Doses in Intensity-Modulated Radiation Therapy: Dose Prediction Accuracy and Reduction Effect of a Lead Sheet

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, J; Chung, J

2015-06-15

Purpose: To verify delivered doses on the implanted cardiac pacemaker, predicted doses with and without dose reduction method were verified using the MOSFET detectors in terms of beam delivery and dose calculation techniques in intensity-modulated radiation therapy (IMRT). Methods: The pacemaker doses for a patient with a tongue cancer were predicted according to the beam delivery methods [step-and-shoot (SS) and sliding window (SW)], intensity levels for dose optimization, and dose calculation algorithms. Dosimetric effects on the pacemaker were calculated three dose engines: pencil-beam convolution (PBC), analytical anisotropic algorithm (AAA), and Acuros-XB. A lead shield of 2 mm thickness was designedmore » for minimizing irradiated doses to the pacemaker. Dose variations affected by the heterogeneous material properties of the pacemaker and effectiveness of the lead shield were predicted by the Acuros-XB. Dose prediction accuracy and the feasibility of the dose reduction strategy were verified based on the measured skin doses right above the pacemaker using mosfet detectors during the radiation treatment. Results: The Acuros-XB showed underestimated skin doses and overestimated doses by the lead-shield effect, even though the lower dose disagreement was observed. It led to improved dose prediction with higher intensity level of dose optimization in IMRT. The dedicated tertiary lead sheet effectively achieved reduction of pacemaker dose up to 60%. Conclusion: The current SS technique could deliver lower scattered doses than recommendation criteria, however, use of the lead sheet contributed to reduce scattered doses.Thin lead plate can be a useful tertiary shielder and it could not acuse malfunction or electrical damage of the implanted pacemaker in IMRT. It is required to estimate more accurate scattered doses of the patient with medical device to design proper dose reduction strategy.« less

SU-E-T-800: Verification of Acurose XB Dose Calculation Algorithm at Air Cavity-Tissue Interface Using Film Measurement for Small Fields of 6-MV Flattening Filter-Free Beams

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kang, S; Suh, T; Chung, J

2015-06-15

Purpose: To verify the dose accuracy of Acuros XB (AXB) dose calculation algorithm at air-tissue interface using inhomogeneous phantom for 6-MV flattening filter-free (FFF) beams. Methods: An inhomogeneous phantom included air cavity was manufactured for verifying dose accuracy at the air-tissue interface. The phantom was composed with 1 and 3 cm thickness of air cavity. To evaluate the central axis doses (CAD) and dose profiles of the interface, the dose calculations were performed for 3 × 3 and 4 × 4 cm{sup 2} fields of 6 MV FFF beams with AAA and AXB in Eclipse treatment plainning system. Measurements inmore » this region were performed with Gafchromic film. The root mean square errors (RMSE) were analyzed with calculated and measured dose profile. Dose profiles were divided into inner-dose profile (>80%) and penumbra (20% to 80%) region for evaluating RMSE. To quantify the distribution difference, gamma evaluation was used and determined the agreement with 3%/3mm criteria. Results: The percentage differences (%Diffs) between measured and calculated CAD in the interface, AXB shows more agreement than AAA. The %Diffs were increased with increasing the thickness of air cavity size and it is similar for both algorithms. In RMSEs of inner-profile, AXB was more accurate than AAA. The difference was up to 6 times due to overestimation by AAA. RMSEs of penumbra appeared to high difference for increasing the measurement depth. Gamma agreement also presented that the passing rates decreased in penumbra. Conclusion: This study demonstrated that the dose calculation with AXB shows more accurate than with AAA for the air-tissue interface. The 2D dose distributions with AXB for both inner-profile and penumbra showed better agreement than with AAA relative to variation of the measurement depths and air cavity sizes.« less

SU-F-T-441: Dose Calculation Accuracy in CT Images Reconstructed with Artifact Reduction Algorithm

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ng, C; Chan, S; Lee, F

Purpose: Accuracy of radiotherapy dose calculation in patients with surgical implants is complicated by two factors. First is the accuracy of CT number, second is the dose calculation accuracy. We compared measured dose with dose calculated on CT images reconstructed with FBP and an artifact reduction algorithm (OMAR, Philips) for a phantom with high density inserts. Dose calculation were done with Varian AAA and AcurosXB. Methods: A phantom was constructed with solid water in which 2 titanium or stainless steel rods could be inserted. The phantom was scanned with the Philips Brillance Big Bore CT. Image reconstruction was done withmore » FBP and OMAR. Two 6 MV single field photon plans were constructed for each phantom. Radiochromic films were placed at different locations to measure the dose deposited. One plan has normal incidence on the titanium/steel rods. In the second plan, the beam is at almost glancing incidence on the metal rods. Measurements were then compared with dose calculated with AAA and AcurosXB. Results: The use of OMAR images slightly improved the dose calculation accuracy. The agreement between measured and calculated dose was best with AXB and image reconstructed with OMAR. Dose calculated on titanium phantom has better agreement with measurement. Large discrepancies were seen at points directly above and below the high density inserts. Both AAA and AXB underestimated the dose directly above the metal surface, while overestimated the dose below the metal surface. Doses measured downstream of metal were all within 3% of calculated values. Conclusion: When doing treatment planning for patients with metal implants, care must be taken to acquire correct CT images to improve dose calculation accuracy. Moreover, great discrepancies in measured and calculated dose were observed at metal/tissue interface. Care must be taken in estimating the dose in critical structures that come into contact with metals.« less

SU-F-SPS-11: The Dosimetric Comparison of Truebeam 2.0 and Cyberknife M6 Treatment Plans for Brain SRS Treatment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mabhouti, H; Sanli, E; Cebe, M

Purpose: Brain stereotactic radiosurgery involves the use of precisely directed, single session radiation to create a desired radiobiologic response within the brain target with acceptable minimal effects on surrounding structures or tissues. In this study, the dosimetric comparison of Truebeam 2.0 and Cyberknife M6 treatment plans were made. Methods: For Truebeam 2.0 machine, treatment planning were done using 2 full arc VMAT technique with 6 FFF beam on the CT scan of Randophantom simulating the treatment of sterotactic treatments for one brain metastasis. The dose distribution were calculated using Eclipse treatment planning system with Acuros XB algorithm. The treatment planningmore » of the same target were also done for Cyberknife M6 machine with Multiplan treatment planning system using Monte Carlo algorithm. Using the same film batch, the net OD to dose calibration curve was obtained using both machine by delivering 0- 800 cGy. Films were scanned 48 hours after irradiation using an Epson 1000XL flatbed scanner. Dose distribution were measured using EBT3 film dosimeter. The measured and calculated doses were compared. Results: The dose distribution in the target and 2 cm beyond the target edge were calculated on TPSs and measured using EBT3 film. For cyberknife plans, the gamma analysis passing rates between measured and calculated dose distributions were 99.2% and 96.7% for target and peripheral region of target respectively. For Truebeam plans, the gamma analysis passing rates were 99.1% and 95.5% for target and peripheral region of target respectively. Conclusion: Although, target dose distribution calculated accurately by Acuros XB and Monte Carlo algorithms, Monte carlo calculation algorithm predicts dose distribution around the peripheral region of target more accurately than Acuros algorithm.« less

SU-F-T-609: Impact of Dosimetric Variation for Prescription Dose Using Analytical Anisotropic Algorithm (AAA) in Lung SBRT

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kawai, D; Takahashi, R; Kamima, T

Purpose: Actual irradiated prescription dose to patients cannot be verified. Thus, independent dose verification and second treatment planning system are used as the secondary check. AAA dose calculation engine has contributed to lung SBRT. We conducted a multi-institutional study to assess variation of prescription dose for lung SBRT when using AAA in reference to using Acuros XB and Clarkson algorithm. Methods: Six institutes in Japan participated in this study. All SBRT treatments were planed using AAA in Eclipse and Adaptive Convolve (AC) in Pinnacle3. All of the institutes used a same independent dose verification software program (Simple MU Analysis: SMU,more » Triangle Product, Ishikawa, Japan), which implemented a Clarkson-based dose calculation algorithm using CT image dataset. A retrospective analysis for lung SBRT plans (73 patients) was performed to compute the confidence limit (CL, Average±2SD) in dose between the AAA and the SMU. In one of the institutes, a additional analysis was conducted to evaluate the variations between the AAA and the Acuros XB (AXB). Results: The CL for SMU shows larger systematic and random errors of 8.7±9.9 % for AAA than the errors of 5.7±4.2 % for AC. The variations of AAA correlated with the mean CT values in the voxels of PTV (a correlation coefficient : −0.7) . The comparison of AXB vs. AAA shows smaller systematic and random errors of −0.7±1.7%. The correlation between dose variations for AXB and the mean CT values in PTV was weak (0.4). However, there were several plans with more than 2% deviation of AAPM TG114 (Maximum: −3.3 %). Conclusion: In comparison for AC, prescription dose calculated by AAA may be more variable in lung SBRT patient. Even AXB comparison shows unexpected variation. Care should be taken for the use of AAA in lung SBRT. This research is partially supported by Japan Agency for Medical Research and Development (AMED)« less

DOE Office of Scientific and Technical Information (OSTI.GOV)

Devpura, S; Li, H; Liu, C

Purpose: To correlate dose distributions computed using six algorithms for recurrent early stage non-small cell lung cancer (NSCLC) patients treated with stereotactic body radiotherapy (SBRT), with outcome (local failure). Methods: Of 270 NSCLC patients treated with 12Gyx4, 20 were found to have local recurrence prior to the 2-year time point. These patients were originally planned with 1-D pencil beam (1-D PB) algorithm. 4D imaging was performed to manage tumor motion. Regions of local failures were determined from follow-up PET-CT scans. Follow-up CT images were rigidly fused to the planning CT (pCT), and recurrent tumor volumes (Vrecur) were mapped to themore » pCT. Dose was recomputed, retrospectively, using five algorithms: 3-D PB, collapsed cone convolution (CCC), anisotropic analytical algorithm (AAA), AcurosXB, and Monte Carlo (MC). Tumor control probability (TCP) was computed using the Marsden model (1,2). Patterns of failure were classified as central, in-field, marginal, and distant for Vrecur ≥95% of prescribed dose, 95–80%, 80–20%, and ≤20%, respectively (3). Results: Average PTV D95 (dose covering 95% of the PTV) for 3-D PB, CCC, AAA, AcurosXB, and MC relative to 1-D PB were 95.3±2.1%, 84.1±7.5%, 84.9±5.7%, 86.3±6.0%, and 85.1±7.0%, respectively. TCP values for 1-D PB, 3-D PB, CCC, AAA, AcurosXB, and MC were 98.5±1.2%, 95.7±3.0, 79.6±16.1%, 79.7±16.5%, 81.1±17.5%, and 78.1±20%, respectively. Patterns of local failures were similar for 1-D and 3D PB plans, which predicted that the majority of failures occur in centraldistal regions, with only ∼15% occurring distantly. However, with convolution/superposition and MC type algorithms, the majority of failures (65%) were predicted to be distant, consistent with the literature. Conclusion: Based on MC and convolution/superposition type algorithms, average PTV D95 and TCP were ∼15% lower than the planned 1-D PB dose calculation. Patterns of failure results suggest that MC and

Evolution of Fermi Surface Properties in CexLa1-xB6 and PrxLa1-xB6

NASA Astrophysics Data System (ADS)

Endo, Motoki; Nakamura, Shintaro; Isshiki, Toshiyuki; Kimura, Noriaki; Nojima, Tsutomu; Aoki, Haruyoshi; Harima, Hisatomo; Kunii, Satoru

2006-11-01

We report the de Haas-van Alphen (dHvA) effect measurements of the Fermi surface properties in LaB6, CexLa1-xB6 (x = 0.1, 0.25, 0.5, 0.75, 1.0) and PrxLa1-xB6 (x = 0.25, 0.5, 0.75, 1.0) with particular attention to the spin dependence of the Fermi surface properties. The Fermi surface shape and dimension of CexLa1-xB6 change considerably with Ce concentration, while those of PrxLa1-xB6 change very slightly up to x = 0.75, and in PrB6 the Fermi surface splits into the up and down spin Fermi surfaces. The effective mass of CexLa1-xB6 increases considerably with Ce concentration and is nearly proportional to the number of Ce ions, whereas that of PrxLa1-xB6 increases slightly with Pr concentration. In CexLa1-xB6 the effective mass depends very strongly on field and increases divergently with decreasing field, while that of PrxLa1-xB6 increases slightly with decreasing field. The contribution to the dHvA signal from the conduction electrons of one spin direction diminishes with Ce concentration and appears to disappear somewhere around x = 0.25--0.5. A weak spin dependence is also found in PrxLa1-xB6. The behaviors of CexLa1-xB6 and PrxLa1-xB6 are compared to discuss the origin of the spin dependence of the Fermi surface properties.

AAA and AXB algorithms for the treatment of nasopharyngeal carcinoma using IMRT and RapidArc techniques.

PubMed

Kamaleldin, Maha; Elsherbini, Nader A; Elshemey, Wael M

2017-09-27

The aim of this study is to evaluate the impact of anisotropic analytical algorithm (AAA) and 2 reporting systems (AXB-D m and AXB-D w ) of Acuros XB algorithm (AXB) on clinical plans of nasopharyngeal patients using intensity-modulated radiotherapy (IMRT) and RapidArc (RA) techniques. Six plans of different algorithm-technique combinations are performed for 10 patients to calculate dose-volume histogram (DVH) physical parameters for planning target volumes (PTVs) and organs at risk (OARs). The number of monitor units (MUs) and calculation time are also determined. Good coverage is reported for all algorithm-technique combination plans without exceeding the tolerance for OARs. Regardless of the algorithm, RA plans persistently reported higher D 2% values for PTV-70. All IMRT plans reported higher number of MUs (especially with AXB) than did RA plans. AAA-IMRT produced the minimum calculation time of all plans. Major differences between the investigated algorithm-technique combinations are reported only for the number of MUs and calculation time parameters. In terms of these 2 parameters, it is recommended to employ AXB in calculating RA plans and AAA in calculating IMRT plans to achieve minimum calculation times at reduced number of MUs. Copyright © 2017 American Association of Medical Dosimetrists. Published by Elsevier Inc. All rights reserved.

Dosimetric comparison between VMAT with different dose calculation algorithms and protons for soft-tissue sarcoma radiotherapy.

PubMed

Fogliata, Antonella; Scorsetti, Marta; Navarria, Piera; Catalano, Maddalena; Clivio, Alessandro; Cozzi, Luca; Lobefalo, Francesca; Nicolini, Giorgia; Palumbo, Valentina; Pellegrini, Chiara; Reggiori, Giacomo; Roggio, Antonella; Vanetti, Eugenio; Alongi, Filippo; Pentimalli, Sara; Mancosu, Pietro

2013-04-01

To appraise the potential of volumetric modulated arc therapy (VMAT, RapidArc) and proton beams to simultaneously achieve target coverage and enhanced sparing of bone tissue in the treatment of soft-tissue sarcoma with adequate target coverage. Ten patients presenting with soft-tissue sarcoma of the leg were collected for the study. Dose was prescribed to 66.5 Gy in 25 fractions to the planning target volume (PTV) while significant maximum dose to the bone was constrained to 50 Gy. Plans were optimised according to the RapidArc technique with 6 MV photon beams or for intensity modulated protons. RapidArc photon plans were computed with: 1) AAA; 2) Acuros XB as dose to medium; and 3) Acuros XB as dose to water. All plans acceptably met the criteria of target coverage (V95% >90-95%) and bone sparing (D(1 cm3) <50 Gy). Significantly higher PTV dose homogeneity was found for proton plans. Near-to-maximum dose to bone was similar for RapidArc and protons, while volume receiving medium/low dose levels was minimised with protons. Similar results were obtained for the remaining normal tissue. Dose distributions calculated with the dose to water option resulted ~5% higher than corresponding ones computed as dose to medium. High plan quality was demonstrated for both VMAT and proton techniques when applied to soft-tissue sarcoma.

Technical Note: Evaluation of plastic scintillator detector for small field stereotactic patient-specific quality assurance.

PubMed

Qin, Yujiao; Gardner, Stephen J; Kim, Joshua; Huang, Yimei; Wen, Ning; Doemer, Anthony; Chetty, Indrin J

2017-10-01

To evaluate the performance of a commercial plastic scintillator detector (PSD) for small-field stereotactic patient-specific quality assurance (QA) measurements using flattening-filter-free beam. A total of 10 spherical targets [volume range: (0.03 cc-2 cc)] were planned with two techniques: (a) dynamic conformal arc (DCA-10 plans) and (b) volumetric modulated arc therapy (VMAT-10 plans). All plans were generated using Varian Eclipse treatment planning system, and AcurosXB v.13 algorithm in 1.0 mm grid size. Additionally, 14 previously treated cranial and spine SRS plans were evaluated [6 DCA, 8 VMAT, volume range: (0.04 cc-119.02 cc)]. Plan modulation was quantified via two metrics: MU per prescription dose (MU/Rx) and Average Leaf Pair Opening (ALPO). QA was performed on the Varian Edge linear accelerator equipped with HDMLC. Three detectors were used: (a) PinPoint ion chamber (PTW; active volume 0.015 cc), (b) Exradin W1 PSD (Standard Imaging; active volume 0.002 cc), and (c) Gafchromic EBT3 film (Ashland). PinPoint chamber and PSD were positioned perpendicular to beam axis in a Lucy phantom (Standard Imaging); films were placed horizontally capturing the coronal plane. PSD, film, and PinPoint chamber measured average differences of 1.00 ± 1.54%, 1.30 ± 1.69%, and -0.66 ± 2.36%, respectively, compared to AcurosXB dose calculation. As the target volume decreased, PinPoint chamber measured lower doses (maximum -5.07% at 0.07 cc target), while PSD and film measured higher doses (2.87% and 2.54% at 0.03 cc target) than AcurosXB. Film agreed with the benchmark detector PSD by an average difference of 0.31 ± 1.20%, but suffered from larger uncertainty; PinPoint chamber underestimated dose by more than 4% for targets smaller than 0.2 cc. Taking PSD as the measurement standard, DCA plans achieved good QA results across all volumes studied, with an average of -0.07 ± 0.89%; for VMAT plans, PSD measured consistently higher dose (1.95 ± 1

XB-70A during take-off

NASA Image and Video Library

1965-08-17

Viewed from the front the #1 XB-70A (62-0001) is shown climbing out during take-off. Most flights were scheduled during the morning hours to take advantage of the cooler ambient air temperatures for improved propulsion efficiencies. The wing tips are extended straight out to provide a maximum lifting wing surface. The XB-70A, capable of flying three times the speed of sound, was the world's largest experimental aircraft in the 1960s. Two XB-70A aircraft were built. Ship #1 was flown by NASA in a high speed flight research program.

XB-70A #1 cockpit

NASA Technical Reports Server (NTRS)

1965-01-01

Photo of the XB-70 #1 cockpit, which shows the complexity of this mid-1960s research aircraft. On the left and right sides of the picture are the pilot's and co-pilot's control yokes. Forward of these, on the cockpit floor, are the rudder pedals with the NAA (North American Aviation) trademark. Between them is the center console. Visible are the six throttles for the XB-70's jet engines. Above this is the center instrument panel. The bottom panel has the wing tip fold, landing gear, and flap controls, as well as the hydraulic pressure gages. In the center are three rows of engine gages. The top row are tachometers, the second are exhaust temperature gages, and the bottom row are exhaust nozzle position indicators. Above these are the engine fire and engine brake switches. The instrument panels for the pilot (left) and co-pilot (right) differ somewhat. Both crewmen have an airspeed/Mach indicator, and altitude/vertical velocity indicator, an artificial horizon, and a heading indicator/compass directly in front of them. The pilot's flight instruments, from top to bottom, are total heat gage and crew warning lights; stand-by flight instruments (side-slip, artificial horizon, and altitude); the engine vibration indicators; cabin altitude, ammonia, and water quantity gages, the electronic compartment air temperature gage, and the liquid oxygen quantity gage. At the bottom are the switches for the flight displays and environmental controls. On the co-pilot's panel, the top three rows are for the engine inlet controls. Below this is the fuel tank sequence indicator, which shows the amount of fuel in each tank. The bottom row consists of the fuel pump switches, which were used to shift fuel to maintain the proper center of gravity. Just to the right are the indicators for the total fuel (top) and the individual tanks (bottom). Visible on the right edge of the photo are the refueling valves, while above these are switches for the flight data recording instruments. The XB-70

XB-70A during startup and ramp taxi

NASA Technical Reports Server (NTRS)

1968-01-01

The XB-70 was the world's largest experimental aircraft. Capable of flight at speeds of three times the speed of sound (2,000 miles per hour) at altitudes of 70,000 feet, the XB-70 was used to collect in-flight information for use in the design of future supersonic aircraft, military and civilian. This 35-second video shows the startup of the XB-70A airplane engines, the beginning of its taxi to the runway, and a turn on the ramp that shows the unique configuration of this aircraft.

Evaluation of six TPS algorithms in computing entrance and exit doses.

PubMed

Tan, Yun I; Metwaly, Mohamed; Glegg, Martin; Baggarley, Shaun; Elliott, Alex

2014-05-08

Entrance and exit doses are commonly measured in in vivo dosimetry for comparison with expected values, usually generated by the treatment planning system (TPS), to verify accuracy of treatment delivery. This report aims to evaluate the accuracy of six TPS algorithms in computing entrance and exit doses for a 6 MV beam. The algorithms tested were: pencil beam convolution (Eclipse PBC), analytical anisotropic algorithm (Eclipse AAA), AcurosXB (Eclipse AXB), FFT convolution (XiO Convolution), multigrid superposition (XiO Superposition), and Monte Carlo photon (Monaco MC). Measurements with ionization chamber (IC) and diode detector in water phantoms were used as a reference. Comparisons were done in terms of central axis point dose, 1D relative profiles, and 2D absolute gamma analysis. Entrance doses computed by all TPS algorithms agreed to within 2% of the measured values. Exit doses computed by XiO Convolution, XiO Superposition, Eclipse AXB, and Monaco MC agreed with the IC measured doses to within 2%-3%. Meanwhile, Eclipse PBC and Eclipse AAA computed exit doses were higher than the IC measured doses by up to 5.3% and 4.8%, respectively. Both algorithms assume that full backscatter exists even at the exit level, leading to an overestimation of exit doses. Despite good agreements at the central axis for Eclipse AXB and Monaco MC, 1D relative comparisons showed profiles mismatched at depths beyond 11.5 cm. Overall, the 2D absolute gamma (3%/3 mm) pass rates were better for Monaco MC, while Eclipse AXB failed mostly at the outer 20% of the field area. The findings of this study serve as a useful baseline for the implementation of entrance and exit in vivo dosimetry in clinical departments utilizing any of these six common TPS algorithms for reference comparison.

XB-70A #1 liftoff with TB-58A chase aircraft

NASA Technical Reports Server (NTRS)

1960-01-01

This photo shows XB-70A #1 taking off on a research flight, escorted by a TB-58 chase plane. The TB-58 (a prototype B-58 modified as a trainer) had a dash speed of Mach 2. This allowed it to stay close to the XB-70 as it conducted its research maneuvers. When the XB-70 was flying at or near Mach 3, the slower TB-58 could often keep up with it by flying lower and cutting inside the turns in the XB-70's flight path when these occurred. The XB-70 was the world's largest experimental aircraft. It was capable of flight at speeds of three times the speed of sound (roughly 2,000 miles per hour) at altitudes of 70,000 feet. It was used to collect in-flight information for use in the design of future supersonic aircraft, military and civilian. The major objectives of the XB-70 flight research program were to study the airplane's stability and handling characteristics, to evaluate its response to atmospheric turbulence, and to determine the aerodynamic and propulsion performance. In addition there were secondary objectives to measure the noise and friction associated with airflow over the airplane and to determine the levels and extent of the engine noise during takeoff, landing, and ground operations. The XB-70 was about 186 feet long, 33 feet high, with a wingspan of 105 feet. Originally conceived as an advanced bomber for the United States Air Force, the XB-70 was limited to production of two aircraft when it was decided to limit the aircraft's mission to flight research. The first flight of the XB-70 was made on Sept. 21, 1964. The number two XB-70 was destroyed in a mid-air collision on June 8, 1966. Program management of the NASA-USAF research effort was assigned to NASA in March 1967. The final flight was flown on Feb. 4, 1969. Designed by North American Aviation (later North American Rockwell and still later, a division of Boeing) the XB-70 had a long fuselage with a canard or horizontal stabilizer mounted just behind the crew compartment. It had a sharply swept 65

Specially-Equipped Martin XB-25E Icing Research Aircraft

NASA Image and Video Library

1947-08-21

In 1946 the Lewis Flight Propulsion Laboratory became the NACA’s official icing research center. In addition to the Icing Research Tunnel, the lab possessed several aircraft modified for icing work, including a Consolidated B-24M Liberator and a North American XB-25E Mitchell, seen here. The XB-25E’s frequent engine fires allegedly resulted in its “Flamin’ Maimie” nickname. The aircraft’s nose art, visible in this photograph, includes a leather-jacketed mechanic with an extinguisher fleeing a fiery woman. North American developed the B-25 in the mid-1930s as a transport aircraft, but it was hurriedly reconfigured as a medium bomber for World War II. This XB-25E was a single prototype designed in 1942 specifically to test an exhaust gas ice prevention system developed by NACA researcher Lewis Rodert. The system circulated the engines’ hot bleed air to the wings, windshield, and tail. The XB-25E was utilized at the NACA’s Ames Aeronautical Laboratory for two years before being transferred to Cleveland in July 1944. NACA Lewis mechanics modified the aircraft further by installing electrical heating in the front fuselage, propellers, inboard sing, cowls, and antennae. Lewis pilots flew the B-24M and XB-25E into perilous weather conditions all across the country to study both deicing technologies and the physics of ice-producing clouds. These dangerous flights led to advances in weather sensing instruments and flight planning.

Thermopower of CexR1-xB6 (R=La, Pr and Nd)

NASA Astrophysics Data System (ADS)

Kim, Moo‑Sung; Nakai, Yuki; Tou, Hideki; Sera, Masafumi; Iga, Fumitoshi; Takabatake, Toshiro; Kunii, Satoru

2006-06-01

The thermopower, S, of CexR1-xB6 (R=La, Pr, Nd) was investigated. S with a positive sign shows a typical behavior observed in the Ce Kondo system, an increase with decreasing temperature at high temperatures and a maximum at low temperatures. The S values of all the systems at high temperatures are roughly linearly dependent on the Ce concentration, indicating the conservation of the single-impurity character of the Kondo effect in a wide x range. However, the maximum value of S, Smax, and the temperature, Tmax, at which Smax is observed exhibit different x dependences between CexLa1-xB6 and CexR1-xB6 (R=Pr, Nd). In CexLa1-xB6, Tmax, which is ˜8 K in CeB6, decreases with decreasing x and converges to ˜1 K in a very dilute alloy and Smax shows an increase below x ˜ 0.1 after decreasing with decreasing x. In CexR1-xB6 (R=Pr, Nd), Tmax shows a weak x dependence but Smax shows a roughly linear decrease in x. These results are discussed from the standpoint of the chemical pressure effect and the Ce-Ce interaction. S in the long-range ordered phase shows very different behaviors between CexPr1-xB6 and CexNd1-xB6.

Spin-split fermi surfaces in CexLa1-xB6 and PrxLa1-xB6

NASA Astrophysics Data System (ADS)

Isshiki, T.; Endo, M.; Sugi, M.; Kimura, N.; Nakamura, S.; Nojima, T.; Aoki, H.; Kunii, S.

2006-05-01

We have performed the dHvA measurements on CexLa1-xB6 and PrxLa1-xB6 compounds to study spin splitting of the Fermi surfaces. In PrB 6 we have found new frequency branches to confirm that the Fermi surface splits into up and down spin Fermi surfaces, whereas no spin splitting has been found for x=0.25,0.5,0.75. We have also found several new frequency branches in CeB6. The new frequency branches imply that the Fermi surfaces of up and down spin conduction electrons are significantly different in CeB6 as well as in PrB6.

Evaluation of six TPS algorithms in computing entrance and exit doses

PubMed Central

Metwaly, Mohamed; Glegg, Martin; Baggarley, Shaun P.; Elliott, Alex

2014-01-01

Entrance and exit doses are commonly measured in in vivo dosimetry for comparison with expected values, usually generated by the treatment planning system (TPS), to verify accuracy of treatment delivery. This report aims to evaluate the accuracy of six TPS algorithms in computing entrance and exit doses for a 6 MV beam. The algorithms tested were: pencil beam convolution (Eclipse PBC), analytical anisotropic algorithm (Eclipse AAA), AcurosXB (Eclipse AXB), FFT convolution (XiO Convolution), multigrid superposition (XiO Superposition), and Monte Carlo photon (Monaco MC). Measurements with ionization chamber (IC) and diode detector in water phantoms were used as a reference. Comparisons were done in terms of central axis point dose, 1D relative profiles, and 2D absolute gamma analysis. Entrance doses computed by all TPS algorithms agreed to within 2% of the measured values. Exit doses computed by XiO Convolution, XiO Superposition, Eclipse AXB, and Monaco MC agreed with the IC measured doses to within 2%‐3%. Meanwhile, Eclipse PBC and Eclipse AAA computed exit doses were higher than the IC measured doses by up to 5.3% and 4.8%, respectively. Both algorithms assume that full backscatter exists even at the exit level, leading to an overestimation of exit doses. Despite good agreements at the central axis for Eclipse AXB and Monaco MC, 1D relative comparisons showed profiles mismatched at depths beyond 11.5 cm. Overall, the 2D absolute gamma (3%/3 mm) pass rates were better for Monaco MC, while Eclipse AXB failed mostly at the outer 20% of the field area. The findings of this study serve as a useful baseline for the implementation of entrance and exit in vivo dosimetry in clinical departments utilizing any of these six common TPS algorithms for reference comparison. PACS numbers: 87.55.‐x, 87.55.D‐, 87.55.N‐, 87.53.Bn PMID:24892349

XB130 translocation to microfilamentous structures mediates NNK-induced migration of human bronchial epithelial cells.

PubMed

Wu, Qifei; Nadesalingam, Jeya; Moodley, Serisha; Bai, Xiaohui; Liu, Mingyao

2015-07-20

Cigarette smoking contributes to the pathogenesis of chronic obstructive pulmonary disease and lung cancer. Nicotine-derived nitrosamine ketone (NNK) is the most potent carcinogen among cigarette smoking components, and is known to enhance migration of cancer cells. However, the effect of NNK on normal human bronchial epithelial cells is not well studied. XB130 is a member of actin filament associated protein family and is involved in cell morphology changes, cytoskeletal rearrangement and outgrowth formation, as well as cell migration. We hypothesized that XB130 mediates NNK-induced migration of normal human bronchial epithelial cells. Our results showed that, after NNK stimulation, XB130 was translocated to the cell periphery and enriched in cell motility-associated structures, such as lamellipodia, in normal human bronchial epithelial BEAS2B cells. Moreover, overexpression of XB130 significantly enhanced NNK-induced migration, which requires both the N- and C-termini of XB130. Overexpression of XB130 enhanced NNK-induced protein tyrosine phosphorylation and promoted matrix metalloproteinase-14 translocation to cell motility-associated cellular structures after NNK stimulation. XB130-mediated NNK-induced cell migration may contribute to airway epithelial repair; however, it may also be involved in cigarette smoking-related chronic obstructive pulmonary disease and lung cancer.

Superficial dose evaluation of four dose calculation algorithms

NASA Astrophysics Data System (ADS)

Cao, Ying; Yang, Xiaoyu; Yang, Zhen; Qiu, Xiaoping; Lv, Zhiping; Lei, Mingjun; Liu, Gui; Zhang, Zijian; Hu, Yongmei

2017-08-01

Accurate superficial dose calculation is of major importance because of the skin toxicity in radiotherapy, especially within the initial 2 mm depth being considered more clinically relevant. The aim of this study is to evaluate superficial dose calculation accuracy of four commonly used algorithms in commercially available treatment planning systems (TPS) by Monte Carlo (MC) simulation and film measurements. The superficial dose in a simple geometrical phantom with size of 30 cm×30 cm×30 cm was calculated by PBC (Pencil Beam Convolution), AAA (Analytical Anisotropic Algorithm), AXB (Acuros XB) in Eclipse system and CCC (Collapsed Cone Convolution) in Raystation system under the conditions of source to surface distance (SSD) of 100 cm and field size (FS) of 10×10 cm2. EGSnrc (BEAMnrc/DOSXYZnrc) program was performed to simulate the central axis dose distribution of Varian Trilogy accelerator, combined with measurements of superficial dose distribution by an extrapolation method of multilayer radiochromic films, to estimate the dose calculation accuracy of four algorithms in the superficial region which was recommended in detail by the ICRU (International Commission on Radiation Units and Measurement) and the ICRP (International Commission on Radiological Protection). In superficial region, good agreement was achieved between MC simulation and film extrapolation method, with the mean differences less than 1%, 2% and 5% for 0°, 30° and 60°, respectively. The relative skin dose errors were 0.84%, 1.88% and 3.90%; the mean dose discrepancies (0°, 30° and 60°) between each of four algorithms and MC simulation were (2.41±1.55%, 3.11±2.40%, and 1.53±1.05%), (3.09±3.00%, 3.10±3.01%, and 3.77±3.59%), (3.16±1.50%, 8.70±2.84%, and 18.20±4.10%) and (14.45±4.66%, 10.74±4.54%, and 3.34±3.26%) for AXB, CCC, AAA and PBC respectively. Monte Carlo simulation verified the feasibility of the superficial dose measurements by multilayer Gafchromic films. And the rank

X-15 and XB-70 parked on NASA ramp

NASA Technical Reports Server (NTRS)

1967-01-01

The X-15A-2 with drop tanks and ablative coating is shown parked on the NASA ramp in front of the XB-70. These aircraft represent two different approaches to flight research. The X-15 was a research airplane in the purest sense, whereas the XB-70 was an experimental bomber intended for production but diverted to research when production was cancelled by changes in the Department of Defense's offensive doctrine. The X-15A-2 had been modified from its original configuration with a longer fuselage and drop tanks. To protect it against aerodynamic heating, researchers had coated it with an ablative coating covered by a layer of white paint. These changes allowed the X-15A-2 to reach a maximum speed of Mach 6.7, although it could be sustained for only a brief period. The XB-70, by contrast, was designed for prolonged high-altitude cruise flight at Mach 3. The aircraft's striking shape--with a long forward fuselage, canards, a large delta wing, twin fins, and a box-like engine bay--allowed it to ride its own Mach 3 shockwave, so to speak. A joint NASA-Air Force program used the aircraft to collect data in support of the U.S supersonic transport (SST) program, which never came to fruition because of environmental concerns. X-15: The X-15 was a rocket-powered aircraft. The original three aircraft were about 50 ft long with a wingspan of 22 ft. The modified #2 aircraft (X-15A-2 was longer.) They were a missile-shaped vehicles with unusual wedge-shaped vertical tails, thin stubby wings, and unique side fairings that extended along the side of the fuselage. The X-15 weighed about 14,000 lb empty and approximately 34,000 lb at launch. The XLR-99 rocket engine, manufactured by Thiokol Chemical Corp., was pilot controlled and was rated at 57,000 lb of thrust, although there are indications that it actually achieved up to 60,000 lb. North American Aviation built three X-15 aircraft for the program. The X-15 research aircraft was developed to provide in-flight information and data

Percentage depth dose calculation accuracy of model based algorithms in high energy photon small fields through heterogeneous media and comparison with plastic scintillator dosimetry

PubMed Central

Mani, Ganesh Kadirampatti; Karunakaran, Kaviarasu

2016-01-01

Small fields smaller than 4×4 cm2 are used in stereotactic and conformal treatments where heterogeneity is normally present. Since dose calculation accuracy in both small fields and heterogeneity often involves more discrepancy, algorithms used by treatment planning systems (TPS) should be evaluated for achieving better treatment results. This report aims at evaluating accuracy of four model‐based algorithms, X‐ray Voxel Monte Carlo (XVMC) from Monaco, Superposition (SP) from CMS‐Xio, AcurosXB (AXB) and analytical anisotropic algorithm (AAA) from Eclipse are tested against the measurement. Measurements are done using Exradin W1 plastic scintillator in Solid Water phantom with heterogeneities like air, lung, bone, and aluminum, irradiated with 6 and 15 MV photons of square field size ranging from 1 to 4 cm2. Each heterogeneity is introduced individually at two different depths from depth‐of‐dose maximum (Dmax), one setup being nearer and another farther from the Dmax. The central axis percentage depth‐dose (CADD) curve for each setup is measured separately and compared with the TPS algorithm calculated for the same setup. The percentage normalized root mean squared deviation (%NRMSD) is calculated, which represents the whole CADD curve's deviation against the measured. It is found that for air and lung heterogeneity, for both 6 and 15 MV, all algorithms show maximum deviation for field size 1×1 cm2 and gradually reduce when field size increases, except for AAA. For aluminum and bone, all algorithms' deviations are less for 15 MV irrespective of setup. In all heterogeneity setups, 1×1 cm2 field showed maximum deviation, except in 6 MV bone setup. All algorithms in the study, irrespective of energy and field size, when any heterogeneity is nearer to Dmax, the dose deviation is higher compared to the same heterogeneity far from the Dmax. Also, all algorithms show maximum deviation in lower‐density materials compared to high‐density materials

Percentage depth dose calculation accuracy of model based algorithms in high energy photon small fields through heterogeneous media and comparison with plastic scintillator dosimetry.

PubMed

Alagar, Ananda Giri Babu; Mani, Ganesh Kadirampatti; Karunakaran, Kaviarasu

2016-01-08

Small fields smaller than 4 × 4 cm2 are used in stereotactic and conformal treatments where heterogeneity is normally present. Since dose calculation accuracy in both small fields and heterogeneity often involves more discrepancy, algorithms used by treatment planning systems (TPS) should be evaluated for achieving better treatment results. This report aims at evaluating accuracy of four model-based algorithms, X-ray Voxel Monte Carlo (XVMC) from Monaco, Superposition (SP) from CMS-Xio, AcurosXB (AXB) and analytical anisotropic algorithm (AAA) from Eclipse are tested against the measurement. Measurements are done using Exradin W1 plastic scintillator in Solid Water phantom with heterogeneities like air, lung, bone, and aluminum, irradiated with 6 and 15 MV photons of square field size ranging from 1 to 4 cm2. Each heterogeneity is introduced individually at two different depths from depth-of-dose maximum (Dmax), one setup being nearer and another farther from the Dmax. The central axis percentage depth-dose (CADD) curve for each setup is measured separately and compared with the TPS algorithm calculated for the same setup. The percentage normalized root mean squared deviation (%NRMSD) is calculated, which represents the whole CADD curve's deviation against the measured. It is found that for air and lung heterogeneity, for both 6 and 15 MV, all algorithms show maximum deviation for field size 1 × 1 cm2 and gradually reduce when field size increases, except for AAA. For aluminum and bone, all algorithms' deviations are less for 15 MV irrespective of setup. In all heterogeneity setups, 1 × 1 cm2 field showed maximum deviation, except in 6MV bone setup. All algorithms in the study, irrespective of energy and field size, when any heterogeneity is nearer to Dmax, the dose deviation is higher compared to the same heterogeneity far from the Dmax. Also, all algorithms show maximum deviation in lower-density materials compared to high-density materials.

Measured Sonic Boom Signatures Above and Below the XB-70 Airplane Flying at Mach 1.5 and 37,000 Feet

NASA Technical Reports Server (NTRS)

Maglieri, Domenic J.; Henderson, Herbert R.; Tinetti, Ana F.

2011-01-01

During the 1966-67 Edwards Air Force Base (EAFB) National Sonic Boom Evaluation Program, a series of in-flight flow-field measurements were made above and below the USAF XB-70 using an instrumented NASA F-104 aircraft with a specially designed nose probe. These were accomplished in the three XB-70 flights at about Mach 1.5 at about 37,000 ft. and gross weights of about 350,000 lbs. Six supersonic passes with the F-104 probe aircraft were made through the XB-70 shock flow-field; one above and five below the XB-70. Separation distances ranged from about 3000 ft. above and 7000 ft. to the side of the XB-70 and about 2000 ft. and 5000 ft. below the XB-70. Complex near-field "sawtooth-type" signatures were observed in all cases. At ground level, the XB-70 shock waves had not coalesced into the two-shock classical sonic boom N-wave signature, but contained three shocks. Included in this report is a description of the generating and probe airplanes, the in-flight and ground pressure measuring instrumentation, the flight test procedure and aircraft positioning, surface and upper air weather observations, and the six in-flight pressure signatures from the three flights.

SU-E-T-795: Validations of Dose Calculation Accuracy of Acuros BV in High-Dose-Rate (HDR) Brachytherapy with a Shielded Cylinder Applicator Using Monte Carlo Simulation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Y; Department of Engineering Physics, Tsinghua University, Beijing; Tian, Z

Purpose: Acuros BV has become available to perform accurate dose calculations in high-dose-rate (HDR) brachytherapy with phantom heterogeneity considered by solving the Boltzmann transport equation. In this work, we performed validation studies regarding the dose calculation accuracy of Acuros BV in cases with a shielded cylinder applicator using Monte Carlo (MC) simulations. Methods: Fifteen cases were considered in our studies, covering five different diameters of the applicator and three different shielding degrees. For each case, a digital phantom was created in Varian BrachyVision with the cylinder applicator inserted in the middle of a large water phantom. A treatment plan withmore » eight dwell positions was generated for these fifteen cases. Dose calculations were performed with Acuros BV. We then generated a voxelized phantom of the same geometry, and the materials were modeled according to the vendor’s specifications. MC dose calculations were then performed using our in-house developed fast MC dose engine for HDR brachytherapy (gBMC) on a GPU platform, which is able to simulate both photon transport and electron transport in a voxelized geometry. A phase-space file for the Ir-192 HDR source was used as a source model for MC simulations. Results: Satisfactory agreements between the dose distributions calculated by Acuros BV and those calculated by gBMC were observed in all cases. Quantitatively, we computed point-wise dose difference within the region that receives a dose higher than 10% of the reference dose, defined to be the dose at 5mm outward away from the applicator surface. The mean dose difference was ∼0.45%–0.51% and the 95-percentile maximum difference was ∼1.24%–1.47%. Conclusion: Acuros BV is able to accurately perform dose calculations in HDR brachytherapy with a shielded cylinder applicator.« less

Ginga observations of the dipping low-mass X-ray binaries XB 1916-053 and EXO 1748-676

NASA Technical Reports Server (NTRS)

Smale, Alan P.; Mukai, Koji; Williams, O. R.; Jones, Mark H.; Corbet, Robin H. D.

1992-01-01

Ginga observations of XB 1916-053 and EXO 0748-676, low-mass X-ray binaries with pronounced dips of variable depth and duration in their X-ray light curves, are reported. Periodicity studies of XB-1916-053 show results consistent with those from previous Ginga observations, specifically, that the derived X-ray period is shorter than the optical period by about 1 percent. This problem is discussed, and a more refined model for the system is described. Three bursts were detected during the observation of XB 1916-053, the second of which occurred during a dip. Spectral analysis suggests that the second burst caused an almost instantaneous ionization of the absorbing medium in the line of sight. This material then returned to its equilibrium state on the same time scale as the burst decay. Loose limits are placed upon the possible clumpiness of the material responsible for the accretion disk structure in XB 1916-053 and EXO 0748-676.

A model-based 3D patient-specific pre-treatment QA method for VMAT using the EPID

NASA Astrophysics Data System (ADS)

McCowan, P. M.; Asuni, G.; van Beek, T.; van Uytven, E.; Kujanpaa, K.; McCurdy, B. M. C.

2017-02-01

This study reports the development and validation of a model-based, 3D patient dose reconstruction method for pre-treatment quality assurance using EPID images. The method is also investigated for sensitivity to potential MLC delivery errors. Each cine-mode EPID image acquired during plan delivery was processed using a previously developed back-projection dose reconstruction model providing a 3D dose estimate on the CT simulation data. Validation was carried out using 24 SBRT-VMAT patient plans by comparing: (1) ion chamber point dose measurements in a solid water phantom, (2) the treatment planning system (TPS) predicted 3D dose to the EPID reconstructed 3D dose in a solid water phantom, and (3) the TPS predicted 3D dose to the EPID and our forward predicted reconstructed 3D dose in the patient (CT data). AAA and AcurosXB were used for TPS predictions. Dose distributions were compared using 3%/3 mm (95% tolerance) and 2%/2 mm (90% tolerance) γ-tests in the planning target volume (PTV) and 20% dose volumes. The average percentage point dose differences between the ion chamber and the EPID, AcurosXB, and AAA were 0.73  ±  1.25%, 0.38  ±  0.96% and 1.06  ±  1.34% respectively. For the patient (CT) dose comparisons, seven (3%/3 mm) and nine (2%/2 mm) plans failed the EPID versus AAA. All plans passed the EPID versus Acuros XB and the EPID versus forward model γ-comparisons. Four types of MLC sensitive errors (opening, shifting, stuck, and retracting), of varying magnitude (0.2, 0.5, 1.0, 2.0 mm), were introduced into six different SBRT-VMAT plans. γ-comparisons of the erroneous EPID dose and original predicted dose were carried out using the same criteria as above. For all plans, the sensitivity testing using a 3%/3 mm γ-test in the PTV successfully determined MLC errors on the order of 1.0 mm, except for the single leaf retraction-type error. A 2%/2 mm criteria produced similar results with two more additional detected

Overexpression of Rice Auxilin-Like Protein, XB21, Induces Necrotic Lesions, up-Regulates Endocytosis-Related Genes, and Confers Enhanced Resistance to Xanthomonas oryzae pv. oryzae.

PubMed

Park, Chang-Jin; Wei, Tong; Sharma, Rita; Ronald, Pamela C

2017-12-01

The rice immune receptor XA21 confers resistance to the bacterial pathogen, Xanthomonas oryzae pv. oryzae (Xoo). To elucidate the mechanism of XA21-mediated immunity, we previously performed a yeast two-hybrid screening for XA21 interactors and identified XA21 binding protein 21 (XB21). Here, we report that XB21 is an auxilin-like protein predicted to function in clathrin-mediated endocytosis. We demonstrate an XA21/XB21 in vivo interaction using co-immunoprecipitation in rice. Overexpression of XB21 in rice variety Kitaake and a Kitaake transgenic line expressing XA21 confers a necrotic lesion phenotype and enhances resistance to Xoo. RNA sequencing reveals that XB21 overexpression results in the differential expression of 8735 genes (4939 genes up- and 3846 genes down-regulated) (≥2-folds, FDR ≤0.01). The up-regulated genes include those predicted to be involved in 'cell death' and 'vesicle-mediated transport'. These results indicate that XB21 plays a role in the plant immune response and in regulation of cell death. The up-regulation of genes controlling 'vesicle-mediated transport' in XB21 overexpression lines is consistent with a functional role for XB21 as an auxilin.

Dosimetric evaluation of magnetic resonance-generated synthetic CT for radiation treatment of rectal cancer.

PubMed

Wang, Hesheng; Du, Kevin; Qu, Juliet; Chandarana, Hersh; Das, Indra J

2018-01-01

The purpose of this study was to assess the dosimetric equivalence of magnetic resonance (MR)-generated synthetic CT (synCT) and simulation CT for treatment planning in radiotherapy of rectal cancer. This study was conducted on eleven patients who underwent whole-body PET/MR and PET/CT examination in a prospective IRB-approved study. For each patient synCT was generated from Dixon MR using a model-based method. Standard treatment planning directives were used to create a four-field box (4F), an oblique four-field (O4F) and a volumetric modulated arc therapy (VMAT) plan on synCT for treatment of rectal cancer. The plans were recalculated on CT with the same monitor units (MUs) as that of synCT. Dose-volume metrics of planning target volume (PTV) and organs at risk (OARs) as well as gamma analysis of dose distributions were evaluated to quantify the difference between synCT and CT plans. All plans were calculated using the analytical anisotropic algorithm (AAA). The VMAT plans on synCT and CT were also calculated using the Acuros XB algorithm for comparison with the AAA calculation. Medians of absolute differences in PTV metrics between synCT and CT plans were 0.2%, 0.2% and 0.3% for 4F, O4F and VMAT respectively. No significant differences were observed in OAR dose metrics including bladder V40Gy, mean dose in bladder, bowel V45Gy and femoral head V30Gy in any techniques. Gamma analysis with 2%/2mm dose difference/distance to agreement criteria showed median passing rates of 99.8% (range: 98.5 to 100%), 99.9% (97.2 to 100%), and 99.9% (99.4 to 100%) for 4F, O4F and VMAT, respectively. Using Acuros XB dose calculation, 2%/2mm gamma analysis generated a passing rate of 99.2% (97.7 to 99.9%) for VMAT plans. SynCT enabled dose calculation equivalent to conventional CT for treatment planning of 3D conformal treatment as well as VMAT of rectal cancer. The dosimetric agreement between synCT and CT calculated doses demonstrated the potential of MR-only treatment planning

Overexpression of Rice Auxilin-Like Protein, XB21, Induces Necrotic Lesions, up-Regulates Endocytosis-Related Genes, and Confers Enhanced Resistance to Xanthomonas oryzae pv. oryzae

DOE Office of Scientific and Technical Information (OSTI.GOV)

Park, Chang-Jin; Wei, Tong; Sharma, Rita

The rice immune receptor XA21 confers resistance to the bacterial pathogen, Xanthomonas oryzae pv. oryzae (Xoo). To elucidate the mechanism of XA21-mediated immunity, we previously performed a yeast two-hybrid screening for XA21 interactors and identified XA21 binding protein 21 (XB21). Here, we report that XB21 is an auxilin-like protein predicted to function in clathrin-mediated endocytosis. We demonstrate an XA21/XB21 in vivo interaction using co-immunoprecipitation in rice. Overexpression of XB21 in rice variety Kitaake and a Kitaake transgenic line expressing XA21 confers a necrotic lesion phenotype and enhances resistance to Xoo. RNA sequencing reveals that XB21 overexpression results in the differentialmore » expression of 8735 genes (4939 genes up- and 3846 genes down-regulated) (≥2-folds, FDR ≤0.01). The up-regulated genes include those predicted to be involved in ‘cell death’ and ‘vesicle-mediated transport’. These results indicate that XB21 plays a role in the plant immune response and in regulation of cell death. The up-regulation of genes controlling ‘vesicle-mediated transport’ in XB21 overexpression lines is consistent with a functional role for XB21 as an auxilin.« less

Overexpression of Rice Auxilin-Like Protein, XB21, Induces Necrotic Lesions, up-Regulates Endocytosis-Related Genes, and Confers Enhanced Resistance to Xanthomonas oryzae pv. oryzae

DOE PAGES

Park, Chang-Jin; Wei, Tong; Sharma, Rita; ...

2017-06-02

The rice immune receptor XA21 confers resistance to the bacterial pathogen, Xanthomonas oryzae pv. oryzae (Xoo). To elucidate the mechanism of XA21-mediated immunity, we previously performed a yeast two-hybrid screening for XA21 interactors and identified XA21 binding protein 21 (XB21). Here, we report that XB21 is an auxilin-like protein predicted to function in clathrin-mediated endocytosis. We demonstrate an XA21/XB21 in vivo interaction using co-immunoprecipitation in rice. Overexpression of XB21 in rice variety Kitaake and a Kitaake transgenic line expressing XA21 confers a necrotic lesion phenotype and enhances resistance to Xoo. RNA sequencing reveals that XB21 overexpression results in the differentialmore » expression of 8735 genes (4939 genes up- and 3846 genes down-regulated) (≥2-folds, FDR ≤0.01). The up-regulated genes include those predicted to be involved in ‘cell death’ and ‘vesicle-mediated transport’. These results indicate that XB21 plays a role in the plant immune response and in regulation of cell death. The up-regulation of genes controlling ‘vesicle-mediated transport’ in XB21 overexpression lines is consistent with a functional role for XB21 as an auxilin.« less

Sci-Sat AM: Radiation Dosimetry and Practical Therapy Solutions - 04: On 3D Fabrication of Phantoms and Experimental Verification of Patient Dose Computation Algorithms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Khan, Rao; Zavan, Rodolfo; McGeachy, Philip

2016-08-15

Purpose: Transport based dose calculation algorithm Acuros XB (AXB) has been shown to accurately account for heterogeneities mostly through comparisons with Monte Carlo simulations. This study aims at providing additional experimental verification for AXB for flattened and unflattened clinical energies in low density phantoms of the same material. Materials and Methods: Polystyrene slabs were created using a bench-top 3D printer. Six slabs were printed at varying densities from 0.23 g/cm{sup 3} to 0.68 g/cm{sup 3}, corresponding to different density humanoid tissues. The slabs were used to form different single and multilayer geometries. Dose was calculated with AXB 11.0.31 for 6MV,more » 15MV flattened and 6FFF (flattening filter free) energies for field sizes of 2×2 cm{sup 2} and 5×5 cm{sup 2}. The phantoms containing radiochromic EBT3 films were irradiated. Absolute dose profiles and 2D gamma analyses were performed for 96 dose planes. Results: For all single slab, multislab configurations and energies, absolute dose differences between the AXB calculation and film measurements remained <3% for both fields, with slightly poor disagreement in penumbra. The gamma index at 2% / 2mm averaged 98% in all combinations of fields, phantoms and photon energies. Conclusions: The transport based dose algorithm AXB is in good agreement with the experimental measurements for small field sizes using 6MV, 6FFF and 15MV beams adjacent to low density heterogeneous media. This work provides sufficient experimental ground to support the use of AXB for heterogeneous dose calculation purposes.« less

A new SPECT/CT reconstruction algorithm: reliability and accuracy in clinical routine for non-oncologic bone diseases.

PubMed

Delcroix, Olivier; Robin, Philippe; Gouillou, Maelenn; Le Duc-Pennec, Alexandra; Alavi, Zarrin; Le Roux, Pierre-Yves; Abgral, Ronan; Salaun, Pierre-Yves; Bourhis, David; Querellou, Solène

2018-02-12

xSPECT Bone® (xB) is a new reconstruction algorithm developed by Siemens® in bone hybrid imaging (SPECT/CT). A CT-based tissue segmentation is incorporated into SPECT reconstruction to provide SPECT images with bone anatomy appearance. The objectives of this study were to assess xB/CT reconstruction diagnostic reliability and accuracy in comparison with Flash 3D® (F3D)/CT in clinical routine. Two hundred thirteen consecutive patients referred to the Brest Nuclear Medicine Department for non-oncological bone diseases were evaluated retrospectively. Two hundred seven SPECT/CT were included. All SPECT/CT were independently interpreted by two nuclear medicine physicians (a junior and a senior expert) with xB/CT then with F3D/CT three months later. Inter-observer agreement (IOA) and diagnostic confidence were determined using McNemar test, and unweighted Kappa coefficient. The study objectives were then re-assessed for validation through > 18 months of clinical and paraclinical follow-up. No statistically significant differences between IOA xB and IOA F3D were found (p = 0.532). Agreement for xB after categorical classification of the diagnoses was high (κ xB = 0.89 [95% CI 0.84 -0.93]) but without statistically significant difference F3D (κ F3D = 0.90 [95% CI 0.86 - 0.94]). Thirty-one (14.9%) inter-reconstruction diagnostic discrepancies were observed of which 21 (10.1%) were classified as major. The follow-up confirmed the diagnosis of F3D in 10 cases, xB in 6 cases and was non-contributory in 5 cases. xB reconstruction algorithm was found reliable, providing high interobserver agreement and similar diagnostic confidence to F3D reconstruction in clinical routine.

Photon beam dosimetry with EBT3 film in heterogeneous regions: Application to the evaluation of dose-calculation algorithms

NASA Astrophysics Data System (ADS)

Jung, Hyunuk; Kum, Oyeon; Han, Youngyih; Park, Byungdo; Cheong, Kwang-Ho

2014-12-01

For a better understanding of the accuracy of state-of-the-art-radiation therapies, 2-dimensional dosimetry in a patient-like environment will be helpful. Therefore, the dosimetry of EBT3 films in non-water-equivalent tissues was investigated, and the accuracy of commercially-used dose-calculation algorithms was evaluated with EBT3 measurement. Dose distributions were measured with EBT3 films for an in-house-designed phantom that contained a lung or a bone substitute, i.e., an air cavity (3 × 3 × 3 cm3) or teflon (2 × 2 × 2 cm3 or 3 × 3 × 3 cm3), respectively. The phantom was irradiated with 6-MV X-rays with field sizes of 2 × 2, 3 × 3, and 5 × 5 cm2. The accuracy of EBT3 dosimetry was evaluated by comparing the measured dose with the dose obtained from Monte Carlo (MC) simulations. A dose-to-bone-equivalent material was obtained by multiplying the EBT3 measurements by the stopping power ratio (SPR). The EBT3 measurements were then compared with the predictions from four algorithms: Monte Carlo (MC) in iPlan, acuros XB (AXB), analytical anisotropic algorithm (AAA) in Eclipse, and superposition-convolution (SC) in Pinnacle. For the air cavity, the EBT3 measurements agreed with the MC calculation to within 2% on average. For teflon, the EBT3 measurements differed by 9.297% (±0.9229%) on average from the Monte Carlo calculation before dose conversion, and by 0.717% (±0.6546%) after applying the SPR. The doses calculated by using the MC, AXB, AAA, and SC algorithms for the air cavity differed from the EBT3 measurements on average by 2.174, 2.863, 18.01, and 8.391%, respectively; for teflon, the average differences were 3.447, 4.113, 7.589, and 5.102%. The EBT3 measurements corrected with the SPR agreed with 2% on average both within and beyond the heterogeneities with MC results, thereby indicating that EBT3 dosimetry can be used in heterogeneous media. The MC and the AXB dose calculation algorithms exhibited clinically-acceptable accuracy (<5%) in

Dosimetric comparison of lung stereotactic body radiotherapy treatment plans using averaged computed tomography and end-exhalation computed tomography images: Evaluation of the effect of different dose-calculation algorithms and prescription methods

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mitsuyoshi, Takamasa; Nakamura, Mitsuhiro, E-mail: m_nkmr@kuhp.kyoto-u.ac.jp; Matsuo, Yukinori

The purpose of this article is to quantitatively evaluate differences in dose distributions calculated using various computed tomography (CT) datasets, dose-calculation algorithms, and prescription methods in stereotactic body radiotherapy (SBRT) for patients with early-stage lung cancer. Data on 29 patients with early-stage lung cancer treated with SBRT were retrospectively analyzed. Averaged CT (Ave-CT) and expiratory CT (Ex-CT) images were reconstructed for each patient using 4-dimensional CT data. Dose distributions were initially calculated using the Ave-CT images and recalculated (in the same monitor units [MUs]) by employing Ex-CT images with the same beam arrangements. The dose-volume parameters, including D{sub 95}, D{submore » 90}, D{sub 50}, and D{sub 2} of the planning target volume (PTV), were compared between the 2 image sets. To explore the influence of dose-calculation algorithms and prescription methods on the differences in dose distributions evident between Ave-CT and Ex-CT images, we calculated dose distributions using the following 3 different algorithms: x-ray Voxel Monte Carlo (XVMC), Acuros XB (AXB), and the anisotropic analytical algorithm (AAA). We also used 2 different dose-prescription methods; the isocenter prescription and the PTV periphery prescription methods. All differences in PTV dose-volume parameters calculated using Ave-CT and Ex-CT data were within 3 percentage points (%pts) employing the isocenter prescription method, and within 1.5%pts using the PTV periphery prescription method, irrespective of which of the 3 algorithms (XVMC, AXB, and AAA) was employed. The frequencies of dose-volume parameters differing by >1%pt when the XVMC and AXB were used were greater than those associated with the use of the AAA, regardless of the dose-prescription method employed. All differences in PTV dose-volume parameters calculated using Ave-CT and Ex-CT data on patients who underwent lung SBRT were within 3%pts, regardless of the dose

Efficient pre-ionization by direct X-B mode conversion in VEST

NASA Astrophysics Data System (ADS)

Jo, JongGab; Lee, H. Y.; Kim, S. C.; Kim, S. H.; An, Y. H.; Hwang, Y. S.

2017-01-01

Pre-ionization experiments with pure toroidal field have been carried out in VEST (Versatile Experiment Spherical Torus) to investigate the feasibility of direct XB mode conversion from perpendicular LFS (Low Field Side) injection for efficient pre-ionization. Pre-ionization plasmas are studied by measuring the electron density and temperature profiles with respect to microwave power and toroidal field strength, and 2D full wave cold plasma simulation using the COMSOL Multiphysics is performed for the comparison. It is experimentally figured out that exceeding the threshold microwave power (>3 kW), the parametric decay and localized collisional heating is observed near the UHR (Upper Hybrid Resonance), and the efficient XB mode conversion can be achieved in both short density scale length (Ln) and magnetic scale length (LB) region positioned at outboard and inboard sides, respectively. From the 2D full wave simulations, the reflection and tunneling of X-wave near the R-cutoff layer according to the measured electron density profiles are analyzed with electric field polarization and power flow. Threshold electric field and wave power density for parametric decay are evaluated at least more than 4.8 × 104 V/m and 100 W/cm2, respectively. This study shows that efficient pre-ionization schemes using direct XB mode conversion can be realized by considering the key factors such as Ln, LB, and transmitted wave power at the UHR. Application to Ohmic start-up experiment is carried out to confirm the effect of the pre-ionization schemes on tokamak plasma start-up in VEST.

Comparison of dosimetric and radiobiological parameters on plans for prostate stereotactic body radiotherapy using an endorectal balloon for different dose-calculation algorithms and delivery-beam modes

NASA Astrophysics Data System (ADS)

Kang, Sang-Won; Suh, Tae-Suk; Chung, Jin-Beom; Eom, Keun-Yong; Song, Changhoon; Kim, In-Ah; Kim, Jae-Sung; Lee, Jeong-Woo; Cho, Woong

2017-02-01

The purpose of this study was to evaluate the impact of dosimetric and radiobiological parameters on treatment plans by using different dose-calculation algorithms and delivery-beam modes for prostate stereotactic body radiation therapy using an endorectal balloon. For 20 patients with prostate cancer, stereotactic body radiation therapy (SBRT) plans were generated by using a 10-MV photon beam with flattening filter (FF) and flattening-filter-free (FFF) modes. The total treatment dose prescribed was 42.7 Gy in 7 fractions to cover at least 95% of the planning target volume (PTV) with 95% of the prescribed dose. The dose computation was initially performed using an anisotropic analytical algorithm (AAA) in the Eclipse treatment planning system (Varian Medical Systems, Palo Alto, CA) and was then re-calculated using Acuros XB (AXB V. 11.0.34) with the same monitor units and multileaf collimator files. The dosimetric and the radiobiological parameters for the PTV and organs at risk (OARs) were analyzed from the dose-volume histogram. An obvious difference in dosimetric parameters between the AAA and the AXB plans was observed in the PTV and rectum. Doses to the PTV, excluding the maximum dose, were always higher in the AAA plans than in the AXB plans. However, doses to the other OARs were similar in both algorithm plans. In addition, no difference was observed in the dosimetric parameters for different delivery-beam modes when using the same algorithm to generate plans. As a result of the dosimetric parameters, the radiobiological parameters for the two algorithm plans presented an apparent difference in the PTV and the rectum. The average tumor control probability of the AAA plans was higher than that of the AXB plans. The average normal tissue complication probability (NTCP) to rectum was lower in the AXB plans than in the AAA plans. The AAA and the AXB plans yielded very similar NTCPs for the other OARs. In plans using the same algorithms, the NTCPs for delivery

National dosimetric audit network finds discrepancies in AAA lung inhomogeneity corrections.

PubMed

Dunn, Leon; Lehmann, Joerg; Lye, Jessica; Kenny, John; Kron, Tomas; Alves, Andrew; Cole, Andrew; Zifodya, Jackson; Williams, Ivan

2015-07-01

This work presents the Australian Clinical Dosimetry Service's (ACDS) findings of an investigation of systematic discrepancies between treatment planning system (TPS) calculated and measured audit doses. Specifically, a comparison between the Anisotropic Analytic Algorithm (AAA) and other common dose-calculation algorithms in regions downstream (≥2cm) from low-density material in anthropomorphic and slab phantom geometries is presented. Two measurement setups involving rectilinear slab-phantoms (ACDS Level II audit) and anthropomorphic geometries (ACDS Level III audit) were used in conjunction with ion chamber (planar 2D array and Farmer-type) measurements. Measured doses were compared to calculated doses for a variety of cases, with and without the presence of inhomogeneities and beam-modifiers in 71 audits. Results demonstrate a systematic AAA underdose with an average discrepancy of 2.9 ± 1.2% when the AAA algorithm is implemented in regions distal from lung-tissue interfaces, when lateral beams are used with anthropomorphic phantoms. This systemic discrepancy was found for all Level III audits of facilities using the AAA algorithm. This discrepancy is not seen when identical measurements are compared for other common dose-calculation algorithms (average discrepancy -0.4 ± 1.7%), including the Acuros XB algorithm also available with the Eclipse TPS. For slab phantom geometries (Level II audits), with similar measurement points downstream from inhomogeneities this discrepancy is also not seen. Crown Copyright © 2015. Published by Elsevier Ltd. All rights reserved.

Performance of dose calculation algorithms from three generations in lung SBRT: comparison with full Monte Carlo‐based dose distributions

PubMed Central

Kapanen, Mika K.; Hyödynmaa, Simo J.; Wigren, Tuija K.; Pitkänen, Maunu A.

2014-01-01

The accuracy of dose calculation is a key challenge in stereotactic body radiotherapy (SBRT) of the lung. We have benchmarked three photon beam dose calculation algorithms — pencil beam convolution (PBC), anisotropic analytical algorithm (AAA), and Acuros XB (AXB) — implemented in a commercial treatment planning system (TPS), Varian Eclipse. Dose distributions from full Monte Carlo (MC) simulations were regarded as a reference. In the first stage, for four patients with central lung tumors, treatment plans using 3D conformal radiotherapy (CRT) technique applying 6 MV photon beams were made using the AXB algorithm, with planning criteria according to the Nordic SBRT study group. The plans were recalculated (with same number of monitor units (MUs) and identical field settings) using BEAMnrc and DOSXYZnrc MC codes. The MC‐calculated dose distributions were compared to corresponding AXB‐calculated dose distributions to assess the accuracy of the AXB algorithm, to which then other TPS algorithms were compared. In the second stage, treatment plans were made for ten patients with 3D CRT technique using both the PBC algorithm and the AAA. The plans were recalculated (with same number of MUs and identical field settings) with the AXB algorithm, then compared to original plans. Throughout the study, the comparisons were made as a function of the size of the planning target volume (PTV), using various dose‐volume histogram (DVH) and other parameters to quantitatively assess the plan quality. In the first stage also, 3D gamma analyses with threshold criteria 3%/3 mm and 2%/2 mm were applied. The AXB‐calculated dose distributions showed relatively high level of agreement in the light of 3D gamma analysis and DVH comparison against the full MC simulation, especially with large PTVs, but, with smaller PTVs, larger discrepancies were found. Gamma agreement index (GAI) values between 95.5% and 99.6% for all the plans with the threshold criteria 3%/3 mm were

Dosimetric comparison of a 6-MV flattening-filter and a flattening-filter-free beam for lung stereotactic ablative radiotherapy treatment

NASA Astrophysics Data System (ADS)

Kim, Yon-Lae; Chung, Jin-Beom; Kim, Jae-Sung; Lee, Jeong-Woo; Kim, Jin-Young; Kang, Sang-Won; Suh, Tae-Suk

2015-11-01

The purpose of this study was to test the feasibility of clinical usage of a flattening-filter-free (FFF) beam for treatment with lung stereotactic ablative radiotherapy (SABR). Ten patients were treated with SABR and a 6-MV FFF beam for this study. All plans using volumetric modulated arc therapy (VMAT) were optimized in the Eclipse treatment planning system (TPS) by using the Acuros XB (AXB) dose calculation algorithm and were delivered by using a Varian TrueBeam ™ linear accelerator equipped with a high-definition (HD) multi-leaf collimator. The prescription dose used was 48 Gy in 4 fractions. In order to compare the plan using a conventional 6-MV flattening-filter (FF) beam, the SABR plan was recalculated under the condition of the same beam settings used in the plan employing the 6-MV FFF beam. All dose distributions were calculated by using Acuros XB (AXB, version 11) and a 2.5-mm isotropic dose grid. The cumulative dosevolume histograms (DVH) for the planning target volume (PTV) and all organs at risk (OARs) were analyzed. Technical parameters, such as total monitor units (MUs) and the delivery time, were also recorded and assessed. All plans for target volumes met the planning objectives for the PTV ( i.e., V95% > 95%) and the maximum dose ( i.e., Dmax < 110%) revealing adequate target coverage for the 6-MV FF and FFF beams. Differences in DVH for target volumes (PTV and clinical target volume (CTV)) and OARs on the lung SABR plans from the interchange of the treatment beams were small, but showed a marked reduction (52.97%) in the treatment delivery time. The SABR plan with a FFF beam required a larger number of MUs than the plan with the FF beam, and the mean difference in MUs was 4.65%. This study demonstrated that the use of the FFF beam for lung SABR plan provided better treatment efficiency relative to 6-MV FF beam. This strategy should be particularly beneficial for high dose conformity to the lung and decreased intra-fraction movements because of

Force Tests of the Boeing XB-47 Full-Scale Empennage in the Ames 40- by 80-Foot Wind Tunnel

NASA Technical Reports Server (NTRS)

Hunton, Lynn W.

1947-01-01

A wind-tunnel investigation of the Boeing XB-47 full-scale empennage was conducted to provide, prior to flight tests, data required on the effectiveness of the elevator and rudder. The XB-47 airplane is a jet-propelled medium bomber having wing and tail surfaces swept back 35 degrees. The investigation included tests of the effectiveness of the elevator with normal straight sides, with a buldged trailing edge, and with a modified hinge-line gap and tests of the effectiveness of the rudder with a normal straight-sided tab and with a bulged tab.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kang, S; Suh, T; Chung, J

Purpose: The purpose of this study is to evaluate the dosimetric and radiobiological impact of Acuros XB (AXB) and Anisotropic Analytic Algorithm (AAA) dose calculation algorithms on prostate stereotactic body radiation therapy plans with both conventional flattened (FF) and flattening-filter free (FFF) modes. Methods: For thirteen patients with prostate cancer, SBRT planning was performed using 10-MV photon beam with FF and FFF modes. The total dose prescribed to the PTV was 42.7 Gy in 7 fractions. All plans were initially calculated using AAA algorithm in Eclipse treatment planning system (11.0.34), and then were re-calculated using AXB with the same MUsmore » and MLC files. The four types of plans for different algorithms and beam energies were compared in terms of homogeneity and conformity. To evaluate the radiobiological impact, the tumor control probability (TCP) and normal tissue complication probability (NTCP) calculations were performed. Results: For PTV, both calculation algorithms and beam modes lead to comparable homogeneity and conformity. However, the averaged TCP values in AXB plans were always lower than in AAA plans with an average difference of 5.3% and 6.1% for 10-MV FFF and FF beam, respectively. In addition, the averaged NTCP values for organs at risk (OARs) were comparable. Conclusion: This study showed that prostate SBRT plan were comparable dosimetric results with different dose calculation algorithms as well as delivery beam modes. For biological results, even though NTCP values for both calculation algorithms and beam modes were similar, AXB plans produced slightly lower TCP compared to the AAA plans.« less

Flight investigation of XB-70 structural response to oscillatory aerodynamic shaker excitation and correlation with analytical results

NASA Technical Reports Server (NTRS)

Mckay, J. M.; Kordes, E. E.; Wykes, J. H.

1973-01-01

The low frequency symmetric structural response and damping characteristics of the XB-70 airplane were measured at four flight conditions: heavyweight at a Mach number of 0.87 at an altitude of 7620 meters (25,000 feet); lightweight at a Mach number of 0.86 at an altitude of 7620 meters (25,000 feet); a Mach number of 1.59 at an altitude of 11,918 meters (39.100 feet); and a Mach number of 2.38 and an altitude of 18,898 meters (62,000 feet). The flight data are compared with the response calculated by using early XB-70 design data and with the response calculated with mass, structural, and aerodynamic data updated to reflect as closely as possible the airplane characteristics at three of the flight conditions actually flown.

The formation, structure and physical properties of M(2)Pd(14+x)B(5-y) compounds, with M =  La, Ce, Pr, Nd, Sm, Eu, Gd, Lu and Th.

PubMed

Royanian, E; Bauer, E; Kaldarar, H; Galatanu, A; Khan, R T; Hilscher, G; Michor, H; Reissner, M; Rogl, P; Sologub, O; Giester, G; Gonçalves, A P

2009-07-29

Novel ternary compounds, M(2)Pd(14+x)B(5-y) (M =  La, Ce, Pr, Nd, Sm, Eu, Gd, Lu, Th; x∼0.9, y∼0.1), have been synthesized by arc melting. The crystal structures of Nd(2)Pd(14+x)B(5-y) and Th(2)Pd(14+x)B(5-y) were determined from x-ray single-crystal data and both are closely related to the structure type of Sc(4)Ni(29)B(10). All compounds were characterized by Rietveld analyses and found to be isotypic with the Nd(2)Pd(14+x)B(5-y) type. Measurements of the temperature dependent susceptibility and specific heat as well as the temperature and field dependent resistivity were employed to derive basic information on bulk properties of these compounds. The electrical resistivity of M(2)Pd(14+x)B(5-y), in general, is characterized by small RRR (residual resistance ratio) values originating from defects inherent to the crystal structure. Whereas the compounds based on Ce, Nd, Sm and Gd exhibit magnetic order, those based on Pr and Eu seem to be non-magnetic, at least down to 400 mK. While the non-magnetic ground state of the Pr based compound is a consequence of crystalline electric field effects in the context of the non-Kramers ion Pr, the lack of magnetic order in the case of the Eu based compound results from an intermediate valence state of the Eu ion.

Chandra observation of the dipping source XB 1254-690

NASA Astrophysics Data System (ADS)

Iaria, R.; di Salvo, T.; Lavagetto, G.; D'Aí, A.; Robba, N. R.

2007-03-01

We present the results of a 53 ks long Chandra observation of the dipping source XB 1254-690. During the observation neither bursts or dips were observed. From the zero-order image we estimated the precise X-ray coordinates of the source with a 90% uncertainty of 0.6´´. Since the lightcurve did not show any significant variability, we extracted the spectrum corresponding to the whole observation. We confirmed the presence of the Fe XXVI Kα absorption lines with a larger accuracy with respect to the previous XMM EPIC pn observation. Assuming that the line width were due to a bulk motion or a turbulence associated to the coronal activity, we estimate that the lines were produced in a photoionized absorber between the coronal radius and the outer edge of the accretion disk.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pacaci, P; Cebe, M; Mabhouti, H

Purpose: In this study, dosimetric comparison of field in field (FIF) and intensity modulated radiation therapy (IMRT) techniques used for treatment of whole breast radiotherapy (WBRT) were made. The dosimetric accuracy of treatment planning system (TPS) for Anisotropic Analytical Algorithm (AAA) and Acuros XB (AXB) algorithms in predicting PTV and OAR doses was also investigated. Methods: Two different treatment planning techniques of left-sided breast cancer were generated for rando phantom. FIF and IMRT plans were compared for doses in PTV and OAR volumes including ipsilateral lung, heart, left ascending coronary artery, contralateral lung and the contralateral breast. PTV and OARsmore » doses and homogeneity and conformality indexes were compared between two techniques. The accuracy of TPS dose calculation algorithms was tested by comparing PTV and OAR doses measured by thermoluminescent dosimetry with the dose calculated by the TPS using AAA and AXB for both techniques. Results: IMRT plans had better conformality and homogeneity indexes than FIF technique and it spared OARs better than FIF. While both algorithms overestimated PTV doses they underestimated all OAR doses. For IMRT plan, PTV doses, overestimation up to 2.5 % was seen with AAA algorithm but it decreased to 1.8 % when AXB algorithm was used. Based on the results of the anthropomorphic measurements for OAR doses, underestimation greater than 7 % is possible by the AAA. The results from the AXB are much better than the AAA algorithm. However, underestimations of 4.8 % were found in some of the points even for AXB. For FIF plan, similar trend was seen for PTV and OARs doses in both algorithm. Conclusion: When using the Eclipse TPS for breast cancer, AXB the should be used instead of the AAA algorithm, bearing in mind that the AXB may still underestimate all OAR doses.« less

Updating the orbital ephemeris of the dipping source XB 1254-690 and the distance to the source

NASA Astrophysics Data System (ADS)

Gambino, Angelo F.; Iaria, Rosario; Di Salvo, Tiziana; Matranga, Marco; Burderi, Luciano; Pintore, Fabio; Riggio, Alessandro; Sanna, Andrea

2017-09-01

XB 1254-690 is a dipping low mass X-ray binary system hosting a neutron star and showing type I X-ray bursts. We aim at obtaining a more accurate orbital ephemeris and at constraining the orbital period derivative of the system for the first time. In addition, we want to better constrain the distance to the source in order to locate the system in a well defined evolutive scenario. We apply, for the first time, an orbital timing technique to XB 1254-690, using the arrival times of the dips present in the light curves that have been collected during 26 yr of X-ray pointed observations acquired from different space missions. We estimate the dip arrival times using a statistical method that weights the count-rate inside the dip with respect to the level of persistent emission outside the dip. We fit the obtained delays as a function of the orbital cycles both with a linear and a quadratic function. We infer the orbital ephemeris of XB 1254-690, improving the accuracy of the orbital period with respect to previous estimates. We infer a mass of M 2 = 0.42 ± 0.04 M ʘ for the donor star, in agreement with estimations already present in literature, assuming that the star is in thermal equilibrium while it transfers part of its mass via the inner Lagrangian point, and assuming a neutron star mass of 1.4 M ʘ. Using these assumptions, we also constrain the distance to the source, finding a value of 7.6 ± 0.8 kpc. Finally, we discuss the evolution of the system, suggesting that it is compatible with a conservative mass transfer driven by magnetic braking.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Iwai, P; Lins, L Nadler

Purpose: There is a lack of studies with significant cohort data about patients using pacemaker (PM), implanted cardioverter defibrillator (ICD) or cardiac resynchronization therapy (CRT) device undergoing radiotherapy. There is no literature comparing the cumulative doses delivered to those cardiac implanted electronic devices (CIED) calculated by different algorithms neither studies comparing doses with heterogeneity correction or not. The aim of this study was to evaluate the influence of the algorithms Pencil Beam Convolution (PBC), Analytical Anisotropic Algorithm (AAA) and Acuros XB (AXB) as well as heterogeneity correction on risk categorization of patients. Methods: A retrospective analysis of 19 3DCRT ormore » IMRT plans of 17 patients was conducted, calculating the dose delivered to CIED using three different calculation algorithms. Doses were evaluated with and without heterogeneity correction for comparison. Risk categorization of the patients was based on their CIED dependency and cumulative dose in the devices. Results: Total estimated doses at CIED calculated by AAA or AXB were higher than those calculated by PBC in 56% of the cases. In average, the doses at CIED calculated by AAA and AXB were higher than those calculated by PBC (29% and 4% higher, respectively). The maximum difference of doses calculated by each algorithm was about 1 Gy, either using heterogeneity correction or not. Values of maximum dose calculated with heterogeneity correction showed that dose at CIED was at least equal or higher in 84% of the cases with PBC, 77% with AAA and 67% with AXB than dose obtained with no heterogeneity correction. Conclusion: The dose calculation algorithm and heterogeneity correction did not change the risk categorization. Since higher estimated doses delivered to CIED do not compromise treatment precautions to be taken, it’s recommend that the most sophisticated algorithm available should be used to predict dose at the CIED using heterogeneity

NNLO QCD corrections to the polarized top quark decay t (↑)→Xb+W+

NASA Astrophysics Data System (ADS)

Czarnecki, A.; Groote, S.; Körner, J. G.; Piclum, J. H.

2018-05-01

We compute the next-to-next-to-leading order (NNLO) QCD corrections to the decay t (↑)→Xb+W+ of a polarized top quark. The spin-momentum correlation in this quasi two-body decay is described by the polar angle distribution d Γ /d cos θP=Γ/2 (1 +PtαPcos θP) , where Pt is the polarization of the top quark and αP denotes the asymmetry parameter of the decay. For the latter we find αPNNLO=0.3792 ±0.0037 .

A Phantom Study on Fetal Dose Reducing Factors in Pregnant Patients with Breast Cancer during Radiotherapy Treatment

PubMed Central

Öğretici, Akın; Çakır, Aydın; Akbaş, Uğur; Köksal, Canan; Kalafat, Ümmühan; Tambaş, Makbule; Bilge, Hatice

2017-01-01

Purpose: This study aims to investigate the factors that reduce fetal dose in pregnant patients with breast cancer throughout their radiation treatment. Two main factors in a standard radiation oncology center are considered as the treatment planning systems (TPSs) and simple shielding for intensity modulated radiation therapy technique. Materials and Methods: TPS factor was evaluated with two different planning algorithms: Anisotropic analytical algorithm and Acuros XB (external beam). To evaluate the shielding factor, a standard radiological purpose lead apron was chosen. For both studies, thermoluminescence dosimeters were used to measure the point dose, and an Alderson RANDO-phantom was used to simulate a female pregnant patient in this study. Thirteen measurement points were chosen in the 32nd slice of the phantom to cover all possible locations of a fetus up to 8th week of gestation. Results: The results show that both of the TPS algorithms are incapable of calculating the fetal doses, therefore, unable to reduce them at the planning stage. Shielding with a standard lead apron, however, showed a slight radiation protection (about 4.7%) to the fetus decreasing the mean fetal dose from 84.8 mGy to 80.8 mGy, which cannot be disregarded in case of fetal irradiation. Conclusions: Using a lead apron for shielding the abdominal region of a pregnant patient during breast irradiation showed a minor advantage; however, its possible side effects (i.e., increased scattered radiation and skin dose) should also be investigated further to solidify its benefits. PMID:28974857

Non-Fermi liquid and heavy fermion behavior in CexLa1-xB6 with quadrupolar moments

NASA Astrophysics Data System (ADS)

Nakamura, Shintaro; Yamamoto, Harufumi; Endo, Motoki; Aoki, Haruyoshi; Kimura, Noriaki; Nojima, Tsutomu; Kunii, Satoru

2006-05-01

The electrical resistivity of the cubic Kondo system CexLa1-xB6 ( x=0.1-0.65) has been measured. Non-Fermi liquid behavior is found in paramagnetic phase I over the wide Ce concentration range. Heavy fermion behavior is found in ordered phases of Ce0.65La0.35B6. The mass enhancement of quasiparticles in this compound is strongly dependent of the magnetic field.

Magnetic properties and microstructure of melt-spun Ce17Fe78-xB6Hfx (x = 0-1.0) alloys

NASA Astrophysics Data System (ADS)

Jiang, Qingzheng; Zhong, Minglong; Quan, Qichen; Lei, Weikai; Zeng, Qingwen; Hu, Yongfeng; Xu, Yaping; Hu, Xianjun; Zhang, Lili; Liu, Renhui; Ma, Shengcan; Zhong, Zhenchen

2017-12-01

Ce17Fe78-xB6Hfx (x = 0-1.0) alloys were fabricated by a melt-spinning technique in order to study their magnetic properties and microstructure. Magnetic investigations of Ce17Fe78-xB6Hfx (x = 0-1.0) alloys show that the room-temperature coercivity increases linearly from 352 kA/m at x = 0 to 420 kA/m at x = 1.0. The Curie temperature (Tc) decreases monotonically from 424.5 K to 409.1 K. The Ce L3-edge X-ray absorption near edge structure (XANES) spectrums reveal that there is more Ce4+ in ribbons under total electron yield (TEY) than fluorescence yield (FY). Hf addition has no effect on the weight of Ce3+ and Ce4+ in CeFeB-based alloys. The grain refinement and microstructure uniformity are essential for improving the magnetic properties of Hf-doped alloys. This paper may shed light on the further development of the Ce-based magnets and offer a feasible way for using the rare earth resources effectively.

Investigation of Prolific Sheep from UK and Ireland for Evidence on Origin of the Mutations in BMP15 (FecXG, FecXB) and GDF9 (FecGH) in Belclare and Cambridge Sheep

PubMed Central

Mullen, Michael P.; Hanrahan, James P.; Howard, Dawn J.

2013-01-01

This paper concerns the likely origin of three mutations with large effects on ovulation rate identified in the Belclare and Cambridge sheep breeds; two in the BMP15 gene (FecXG and FecXB) and the third (FecGH) in GDF9. All three mutations segregate in Belclare sheep while one, FecXB, has not been found in the Cambridge. Both Belclare and Cambridge breeds are relatively recently developed composites that have common ancestry through the use of genetic material from the Finnish Landrace and Lleyn breeds. The development of both composites also involved major contributions from exceptionally prolific ewes screened from flocks in Ireland (Belclare) and Britain (Cambridge) during the 1960s. The objective of the current study was to establish the likely origin of the mutations (FecXG, FecXB and FecGH) through analysis of DNA from Finnish Landrace and Lleyn sheep, and Galway and Texel breeds which contributed to the development of the Belclare breed. Ewes with exceptionally high prolificacy (hyper-prolific ewes) in current flocks on Irish farms were identified to simulate the screening of ewes from Irish flocks in the 1960s. DNA was obtained from: prolific ewes in extant flocks of Lleyn sheep (n = 44) on the Lleyn peninsula in Wales; hyper-prolific ewes (n = 41); prolific Galway (n = 41) ewes; Finnish Landrace (n = 124) and Texel (n = 19) ewes. The FecXG mutation was identified in Lleyn but not in Finnish Landrace, Galway or Texel sheep; FecXB was only found among the hyper-prolific ewes. The FecGH mutation was identified in the sample of Lleyn sheep. It was concluded from these findings that the Lleyn breed was the most likely source of the FecXG and FecGH mutations in Belclare and Cambridge sheep and that the FecXB mutation came from the High Fertility line that was developed using prolific ewes selected from commercial flocks in Ireland in the 1960′s and subsequently used in the genesis of the Belclare. PMID:23301039

Statistical survey of XB-70 airplane responses and control usage with an illustration of the application to handling qualities criteria

NASA Technical Reports Server (NTRS)

Powers, B. G.

1972-01-01

The magnitude and frequency of occurrence of aircraft responses and control inputs during 27 flights of the XB-70 airplane were measured. Exceedance curves are presented for the airplane responses and control usage. A technique is presented which makes use of these exceedance curves to establish or verify handling qualities criteria. This technique can provide a means of incorporating current operational experience in handling qualities requirements for future aircraft.

Strain-induced tetragonal distortions and multiferroic properties in polycrystalline Sr1 -xB axMn O3 (x =0.43 -0.45 ) perovskites

NASA Astrophysics Data System (ADS)

Somaily, H.; Kolesnik, S.; Mais, J.; Brown, D.; Chapagain, K.; Dabrowski, B.; Chmaissem, O.

2018-05-01

We report the structure-property phase diagram of unique single-ion type-1 multiferroic pseudocubic Sr1 -xB axMn O3 perovskites. Employing a specially designed multistep reduction-oxidation synthesis technique, we have synthesized Sr1 -xB axMn O3 compositions in their polycrystalline form with a significantly extended Ba solubility limit that is only rivaled by a very limited number of crystals and thin films grown under nonequilibrium conditions. Understanding the multiferroic interplay with structure in Sr1 -xB axMn O3 is of great importance as it opens the door wide to the development of newer materials from the parent (A A' ) (B B' ) O3 system with enhanced properties. To this end, using a combination of time-of-flight neutron and synchrotron x-ray scattering techniques, we determined the exact structures and quantified the Mn and oxygen polar distortions above and below the ferroelectric Curie temperature TC and the Néel temperature TN. In its ferroelectric state, the system crystalizes in the noncentrosymmetric tetragonal P 4 m m space group, which gives rise to a large electric dipole moment Ps, in the z direction, of 18.4 and 29.5 μ C /c m2 for x =0.43 and 0.45, respectively. The two independently driven ferroelectric and magnetic order parameters are single-handedly accommodated by the Mn sublattice leading to a novel strain-assisted multiferroic behavior in agreement with many theoretical predictions. Our neutron diffraction results demonstrate the large and tunable suppression of the ferroelectric order at the onset of AFM ordering and confirm the coexistence and strong coupling of the two ferroic orders below TN. The refined magnetic moments confirm the strong covalent bonding between Mn and the oxygen anions, which is necessary for stabilizing the ferroelectric phase.

Xylan degradation by the human gut Bacteroides xylanisolvens XB1A(T) involves two distinct gene clusters that are linked at the transcriptional level.

PubMed

Despres, Jordane; Forano, Evelyne; Lepercq, Pascale; Comtet-Marre, Sophie; Jubelin, Gregory; Chambon, Christophe; Yeoman, Carl J; Berg Miller, Margaret E; Fields, Christopher J; Martens, Eric; Terrapon, Nicolas; Henrissat, Bernard; White, Bryan A; Mosoni, Pascale

2016-05-04

Plant cell wall (PCW) polysaccharides and especially xylans constitute an important part of human diet. Xylans are not degraded by human digestive enzymes in the upper digestive tract and therefore reach the colon where they are subjected to extensive degradation by some members of the symbiotic microbiota. Xylanolytic bacteria are the first degraders of these complex polysaccharides and they release breakdown products that can have beneficial effects on human health. In order to understand better how these bacteria metabolize xylans in the colon, this study was undertaken to investigate xylan breakdown by the prominent human gut symbiont Bacteroides xylanisolvens XB1A(T). Transcriptomic analyses of B. xylanisolvens XB1A(T) grown on insoluble oat-spelt xylan (OSX) at mid- and late-log phases highlighted genes in a polysaccharide utilization locus (PUL), hereafter called PUL 43, and genes in a fragmentary remnant of another PUL, hereafter referred to as rPUL 70, which were highly overexpressed on OSX relative to glucose. Proteomic analyses supported the up-regulation of several genes belonging to PUL 43 and showed the important over-production of a CBM4-containing GH10 endo-xylanase. We also show that PUL 43 is organized in two operons and that the knockout of the PUL 43 sensor/regulator HTCS gene blocked the growth of the mutant on insoluble OSX and soluble wheat arabinoxylan (WAX). The mutation not only repressed gene expression in the PUL 43 operons but also repressed gene expression in rPUL 70. This study shows that xylan degradation by B. xylanisolvens XB1A(T) is orchestrated by one PUL and one PUL remnant that are linked at the transcriptional level. Coupled to studies on other xylanolytic Bacteroides species, our data emphasize the importance of one peculiar CBM4-containing GH10 endo-xylanase in xylan breakdown and that this modular enzyme may be used as a functional marker of xylan degradation in the human gut. Our results also suggest that B. xylanisolvens

Measurements of surface-pressure fluctuations on the XB-70 airplane at local Mach numbers up to 2.45

NASA Technical Reports Server (NTRS)

Lewis, T. L.; Dods, J. B., Jr.; Hanly, R. D.

1973-01-01

Measurements of surface-pressure fluctuations were made at two locations on the XB-70 airplane for nine flight-test conditions encompassing a local Mach number range from 0.35 to 2.45. These measurements are presented in the form of estimated power spectral densities, coherence functions, and narrow-band-convection velocities. The estimated power spectral densities compared favorably with wind-tunnel data obtained by other experimenters. The coherence function and convection velocity data supported conclusions by other experimenters that low-frequency surface-pressure fluctuations consist of small-scale turbulence components with low convection velocity.

Magnetic phase diagrams of CexLa1-xB6 in high magnetic fields

NASA Astrophysics Data System (ADS)

Akatsu, Mitsuhiro; Kazama, Nanako; Goto, Terutaka; Nemoto, Yuichi; Suzuki, Osamu; Kido, Giyuu; Kunii, Satoru

We have performed ultrasonic measurements under high magnetic fields up to 30 T by using the hybrid magnet at the National Institute for Materials Science to investigate the magnetic phase diagram for antiferroquadrupole (AFQ) phase II in CexLa1-xB6. With increasing Ce concentration x from x=0.50, the AFQ phase transition temperatures TQ indicate an almost linear increase in various fields. The large magnetic anisotropy of AFQ phase II, in which TQH∥[0 0 1] is much smaller than TQH∥[1 1 0] and TQH∥[1 1 1] in high magnetic fields, is revealed in x=0.75,0.60 as well as in x=0.50. These experimental results support the theoretical calculation based on the Γ5-type AFQ ordering and the magnetic field induced octupole Txyz.

Simulated Altitude Performance of Combustor of Westinghouse 19XB-1 Jet-Propulsion Engine

NASA Technical Reports Server (NTRS)

Childs, J. Howard; McCafferty, Richard J.

1948-01-01

A 19XB-1 combustor was operated under conditions simulating zero-ram operation of the 19XB-1 turbojet engine at various altitudes and engine speeds. The combustion efficiencies and the altitude operational limits were determined; data were also obtained on the character of the combustion, the pressure drop through the combustor, and the combustor-outlet temperature and velocity profiles. At altitudes about 10,000 feet below the operational limits, the flames were yellow and steady and the temperature rise through the combustor increased with fuel-air ratio throughout the range of fuel-air ratios investigated. At altitudes near the operational limits, the flames were blue and flickering and the combustor was sluggish in its response to changes in fuel flow. At these high altitudes, the temperature rise through the combustor increased very slowly as the fuel flow was increased and attained a maximum at a fuel-air ratio much leaner than the over-all stoichiometric; further increases in fuel flow resulted in decreased values of combustor temperature rise and increased resonance until a rich-limit blow-out occurred. The approximate operational ceiling of the engine as determined by the combustor, using AN-F-28, Amendment-3, fuel, was 30,400 feet at a simulated engine speed of 7500 rpm and increased as the engine speed was increased. At an engine speed of 16,000 rpm, the operational ceiling was approximately 48,000 feet. Throughout the range of simulated altitudes and engine speeds investigated, the combustion efficiency increased with increasing engine speed and with decreasing altitude. The combustion efficiency varied from over 99 percent at operating conditions simulating high engine speed and low altitude operation to less than 50 percent at conditions simulating operation at altitudes near the operational limits. The isothermal total pressure drop through the combustor was 1.82 times as great as the inlet dynamic pressure. As expected from theoretical

High sensibility to reactivation by acidic lipids of the recombinant human plasma membrane Ca2+-ATPase isoform 4xb purified from Saccharomyces cerevisiae.

PubMed

Cura, Carolina I; Corradi, Gerardo R; Rinaldi, Débora E; Adamo, Hugo P

2008-12-01

The human plasma membrane Ca2+ pump (isoform 4xb) was expressed in Saccharomyces cerevisiae and purified by calmodulin-affinity chromatography. Under optimal conditions the recombinant enzyme (yPMCA) hydrolyzed ATP in a Ca2+ dependent manner at a rate of 15 micromol/mg/min. The properties of yPMCA were compared to those of the PMCA purified from human red cells (ePMCA). The mobility of yPMCA in SDS-PAGE was the expected for the hPMCA4xb protein but slightly lower than that of ePMCA. Both enzymes achieved maximal activity when supplemented with acidic phospholipids. However, while ePMCA in mixed micelles of phosphatidylcholine-detergent had 30% of its maximal activity, the yPMCA enzyme was nearly inactive. Increasing the phosphatidylcholine content of the micelles did not increase the activity of yPMCA but the activity in the presence of phosphatidylcholine improved by partially removing the detergent. The reactivation of the detergent solubilized yPMCA required specifically acidic lipids and, as judged by the increase in the level of phosphoenzyme, it involved the increase in the amount of active enzyme. These results indicate that the function of yPMCA is highly sensitive to delipidation and the restitution of acidic lipids is needed for a functional enzyme.

SU-E-T-374: Evaluation and Verification of Dose Calculation Accuracy with Different Dose Grid Sizes for Intracranial Stereotactic Radiosurgery

DOE Office of Scientific and Technical Information (OSTI.GOV)

Han, C; Schultheiss, T

Purpose: In this study, we aim to evaluate the effect of dose grid size on the accuracy of calculated dose for small lesions in intracranial stereotactic radiosurgery (SRS), and to verify dose calculation accuracy with radiochromic film dosimetry. Methods: 15 intracranial lesions from previous SRS patients were retrospectively selected for this study. The planning target volume (PTV) ranged from 0.17 to 2.3 cm{sup 3}. A commercial treatment planning system was used to generate SRS plans using the volumetric modulated arc therapy (VMAT) technique using two arc fields. Two convolution-superposition-based dose calculation algorithms (Anisotropic Analytical Algorithm and Acuros XB algorithm) weremore » used to calculate volume dose distribution with dose grid size ranging from 1 mm to 3 mm with 0.5 mm step size. First, while the plan monitor units (MU) were kept constant, PTV dose variations were analyzed. Second, with 95% of the PTV covered by the prescription dose, variations of the plan MUs as a function of dose grid size were analyzed. Radiochomic films were used to compare the delivered dose and profile with the calculated dose distribution with different dose grid sizes. Results: The dose to the PTV, in terms of the mean dose, maximum, and minimum dose, showed steady decrease with increasing dose grid size using both algorithms. With 95% of the PTV covered by the prescription dose, the total MU increased with increasing dose grid size in most of the plans. Radiochromic film measurements showed better agreement with dose distributions calculated with 1-mm dose grid size. Conclusion: Dose grid size has significant impact on calculated dose distribution in intracranial SRS treatment planning with small target volumes. Using the default dose grid size could lead to under-estimation of delivered dose. A small dose grid size should be used to ensure calculation accuracy and agreement with QA measurements.« less

WE-AB-207B-05: Correlation of Normal Lung Density Changes with Dose After Stereotactic Body Radiotherapy (SBRT) for Early Stage Lung Cancer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, Q; Devpura, S; Feghali, K

2016-06-15

Purpose: To investigate correlation of normal lung CT density changes with dose accuracy and outcome after SBRT for patients with early stage lung cancer. Methods: Dose distributions for patients originally planned and treated using a 1-D pencil beam-based (PB-1D) dose algorithm were retrospectively recomputed using algorithms: 3-D pencil beam (PB-3D), and model-based Methods: AAA, Acuros XB (AXB), and Monte Carlo (MC). Prescription dose was 12 Gy × 4 fractions. Planning CT images were rigidly registered to the followup CT datasets at 6–9 months after treatment. Corresponding dose distributions were mapped from the planning to followup CT images. Following the methodmore » of Palma et al .(1–2), Hounsfield Unit (HU) changes in lung density in individual, 5 Gy, dose bins from 5–45 Gy were assessed in the peri-tumor region, defined as a uniform, 3 cm expansion around the ITV(1). Results: There is a 10–15% displacement of the high dose region (40–45 Gy) with the model-based algorithms, relative to the PB method, due to the electron scattering of dose away from the tumor into normal lung tissue (Fig.1). Consequently, the high-dose lung region falls within the 40–45 Gy dose range, causing an increase in HU change in this region, as predicted by model-based algorithms (Fig.2). The patient with the highest HU change (∼110) had mild radiation pneumonitis, and the patient with HU change of ∼80–90 had shortness of breath. No evidence of pneumonitis was observed for the 3 patients with smaller CT density changes (<50 HU). Changes in CT densities, and dose-response correlation, as computed with model-based algorithms, are in excellent agreement with the findings of Palma et al. (1–2). Conclusion: Dose computed with PB (1D or 3D) algorithms was poorly correlated with clinically relevant CT density changes, as opposed to model-based algorithms. A larger cohort of patients is needed to confirm these results. This work was supported in part by a grant from

The low-lying quartet electronic states of group 14 diatomic borides XB (X = C, Si, Ge, Sn, Pb)

NASA Astrophysics Data System (ADS)

Pontes, Marcelo A. P.; de Oliveira, Marcos H.; Fernandes, Gabriel F. S.; Da Motta Neto, Joaquim D.; Ferrão, Luiz F. A.; Machado, Francisco B. C.

2018-04-01

The present work focuses in the characterization of the low-lying quartet electronic and spin-orbit states of diatomic borides XB, in which X is an element of group 14 (C, Si, Ge, Sn, PB). The wavefunction was obtained at the CASSCF/MRCI level with a quintuple-ζ quality basis set. Scalar relativistic effects were also taken into account. A systematic and comparative analysis of the spectroscopic properties for the title molecular series was carried out, showing that the (1)4Π→X4Σ- transition band is expected to be measurable by emission spectroscopy to the GeB, SnB and PbB molecules, as already observed for the lighter CB and SiB species.

T -odd correlations in polarized top quark decays in the sequential decay t (↑)→Xb+W+(→ℓ++νℓ) and in the quasi-three-body decay t (↑)→ Xb+ℓ++νℓ

NASA Astrophysics Data System (ADS)

Fischer, M.; Groote, S.; Körner, J. G.

2018-05-01

We identify the T -odd structure functions that appear in the description of polarized top quark decays in the sequential decay t (↑)→Xb+W+(→ℓ++νℓ) (two structure functions) and the quasi-three-body decay t (↑)→X b+ℓ++νℓ (one structure function). A convenient measure of the magnitude of the T -odd structure functions is the contribution of the imaginary part Im gR of the right-chiral tensor coupling gR to the T -odd structure functions which we work out. Contrary to the case of QCD, the NLO electroweak corrections to polarized top quark decays admit absorptive one-loop vertex contributions. We analytically calculate the imaginary parts of the relevant four electroweak one-loop triangle vertex diagrams and determine their contributions to the T -odd helicity structure functions that appear in the description of polarized top quark decays.

Unusual Evolution of the Conduction-Electron State in CexLa1-xB6 from Non-Fermi Liquid to Fermi Liquid

NASA Astrophysics Data System (ADS)

Nakamura, S.; Endo, M.; Yamamoto, H.; Isshiki, T.; Kimura, N.; Aoki, H.; Nojima, T.; Otani, S.; Kunii, S.

2006-12-01

We report unusual evolution of the conduction-electron state in the localized f electron system CexLa1-xB6 from normal electron state to heavy Fermi liquid (FL) state through local FL and non-FL states with increasing Ce concentration and/or with increasing magnetic field. The effective mass of quasiparticle or the coefficient A of T2 term of resistivity is found to increase divergently near the boundary between FL state and non-FL state. The features of the non-FL state are also different from those of the typical non-FL systems previously observed or theoretically predicted.

Stabilization of Phase IV in CexLa1-xB6 (x=0.4, 0.5) by Pr and Nd Ion Dopings

NASA Astrophysics Data System (ADS)

Kondo, Akihiro; Taniguchi, Toshihiro; Tanida, Hiroshi; Matsumura, Takeshi; Sera, Masafumi; Iga, Fumitoshi; Tou, Hideki; Sakakibara, Toshiro; Kunii, Satoru

2009-09-01

We have studied the effect of magnetic rare-earth ion (Pr, Nd) doping on phase IV in CexLa1-xB6 (x=0.4, 0.5) systems. An unexpected large increase in the IV-I transition temperature TIV--I by Pr and Nd dopings was observed, while no such increase was observed for x≥ 0.6. Although we do not know the reason why the doping effect markedly differs between x≤ 0.5 and x≥ 0.6 at present, the order parameter in phase IV for x≤ 0.5 is coupled with the magnetic dipole moment of Pr and Nd ions and phase IV is stabilized.

Comparisons of Predictions of the XB-70-1 Longitudinal Stability and Control Derivatives with Flight Results for Six Flight Conditions

NASA Technical Reports Server (NTRS)

Wolowicz, C. H.; Yancey, R. B.

1973-01-01

Preliminary correlations of flight-determined and predicted stability and control characteristics of the XB-70-1 reported in NASA TN D-4578 were subject to uncertainties in several areas which necessitated a review of prediction techniques particularly for the longitudinal characteristics. Reevaluation and updating of the original predictions, including aeroelastic corrections, for six specific flight-test conditions resulted in improved correlations of static pitch stability with flight data. The original predictions for the pitch-damping derivative, on the other hand, showed better correlation with flight data than the updated predictions. It appears that additional study is required in the application of aeroelastic corrections to rigid model wind-tunnel data and the theoretical determination of dynamic derivatives for this class of aircraft.

Wind-tunnel/flight correlation study of aerodynamic characteristics of a large flexible supersonic cruise airplane (XB-70-1). 3: A comparison between characteristics predicted from wind-tunnel measurements and those measured in flight

NASA Technical Reports Server (NTRS)

Arnaiz, H. H.; Peterson, J. B., Jr.; Daugherty, J. C.

1980-01-01

A program was undertaken by NASA to evaluate the accuracy of a method for predicting the aerodynamic characteristics of large supersonic cruise airplanes. This program compared predicted and flight-measured lift, drag, angle of attack, and control surface deflection for the XB-70-1 airplane for 14 flight conditions with a Mach number range from 0.76 to 2.56. The predictions were derived from the wind-tunnel test data of a 0.03-scale model of the XB-70-1 airplane fabricated to represent the aeroelastically deformed shape at a 2.5 Mach number cruise condition. Corrections for shape variations at the other Mach numbers were included in the prediction. For most cases, differences between predicted and measured values were within the accuracy of the comparison. However, there were significant differences at transonic Mach numbers. At a Mach number of 1.06 differences were as large as 27 percent in the drag coefficients and 20 deg in the elevator deflections. A brief analysis indicated that a significant part of the difference between drag coefficients was due to the incorrect prediction of the control surface deflection required to trim the airplane.

Systematic Evaluation of Chromatographic Parameters for Isoquinoline Alkaloids on XB-C18 Core-Shell Column Using Different Mobile Phase Compositions

PubMed Central

Sowa, Ireneusz; Zielińska, Sylwia; Sawicki, Jan; Bogucka-Kocka, Anna; Staniak, Michał; Bartusiak-Szcześniak, Ewa; Podolska-Fajks, Maja; Kocjan, Ryszard

2018-01-01

Chelidonium majus L. is a rich source of isoquinoline alkaloids with confirmed anti-inflammatory, choleretic, spasmolytic, antitumor, and antimicrobial activities. However, their chromatographic analysis is difficult because they may exist both in charged and uncharged forms and may result in the irregular peak shape and the decrease in chromatographic system efficacy. In the present work, the separation of main C. majus alkaloids was optimized using a new-generation XB-C18 endcapped core-shell column dedicated for analysis of alkaline compounds. The influence of organic modifier concentration, addition of salts, and pH of eluents on chromatographic parameters such as retention, resolution, chromatographic plate numbers, and peak asymmetry was investigated. The results were applied to elaborate the optimal chromatographic system for simultaneous quantification of seven alkaloids from the root, herb, and fruit of C. majus. PMID:29675288

SU-E-T-280: Reconstructed Rectal Wall Dose Map-Based Verification of Rectal Dose Sparing Effect According to Rectum Definition Methods and Dose Perturbation by Air Cavity in Endo-Rectal Balloon

DOE Office of Scientific and Technical Information (OSTI.GOV)

Park, J; Research Institute of Biomedical Engineering, The Catholic University of Korea, Seoul; Park, H

Purpose: Dosimetric effect and discrepancy according to the rectum definition methods and dose perturbation by air cavity in an endo-rectal balloon (ERB) were verified using rectal-wall (Rwall) dose maps considering systematic errors in dose optimization and calculation accuracy in intensity-modulated radiation treatment (IMRT) for prostate cancer patients. Methods: When the inflated ERB having average diameter of 4.5 cm and air volume of 100 cc is used for patient, Rwall doses were predicted by pencil-beam convolution (PBC), anisotropic analytic algorithm (AAA), and AcurosXB (AXB) with material assignment function. The errors of dose optimization and calculation by separating air cavity from themore » whole rectum (Rwhole) were verified with measured rectal doses. The Rwall doses affected by the dose perturbation of air cavity were evaluated using a featured rectal phantom allowing insert of rolled-up gafchromic films and glass rod detectors placed along the rectum perimeter. Inner and outer Rwall doses were verified with reconstructed predicted rectal wall dose maps. Dose errors and extent at dose levels were evaluated with estimated rectal toxicity. Results: While AXB showed insignificant difference of target dose coverage, Rwall doses underestimated by up to 20% in dose optimization for the Rwhole than Rwall at all dose range except for the maximum dose. As dose optimization for Rwall was applied, the Rwall doses presented dose error less than 3% between dose calculation algorithm except for overestimation of maximum rectal dose up to 5% in PBC. Dose optimization for Rwhole caused dose difference of Rwall especially at intermediate doses. Conclusion: Dose optimization for Rwall could be suggested for more accurate prediction of rectal wall dose prediction and dose perturbation effect by air cavity in IMRT for prostate cancer. This research was supported by the Leading Foreign Research Institute Recruitment Program through the National Research Foundation of

SU-E-J-58: Dosimetric Verification of Metal Artifact Effects: Comparison of Dose Distributions Affected by Patient Teeth and Implants

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, M; Kang, S; Lee, S

Purpose: Implant-supported dentures seem particularly appropriate for the predicament of becoming edentulous and cancer patients are no exceptions. As the number of people having dental implants increased in different ages, critical dosimetric verification of metal artifact effects are required for the more accurate head and neck radiation therapy. The purpose of this study is to verify the theoretical analysis of the metal(streak and dark) artifact, and to evaluate dosimetric effect which cause by dental implants in CT images of patients with the patient teeth and implants inserted humanoid phantom. Methods: The phantom comprises cylinder which is shaped to simulate themore » anatomical structures of a human head and neck. Through applying various clinical cases, made phantom which is closely allied to human. Developed phantom can verify two classes: (i)closed mouth (ii)opened mouth. RapidArc plans of 4 cases were created in the Eclipse planning system. Total dose of 2000 cGy in 10 fractions is prescribed to the whole planning target volume (PTV) using 6MV photon beams. Acuros XB (AXB) advanced dose calculation algorithm, Analytical Anisotropic Algorithm (AAA) and progressive resolution optimizer were used in dose optimization and calculation. Results: In closed and opened mouth phantom, because dark artifacts formed extensively around the metal implants, dose variation was relatively higher than that of streak artifacts. As the PTV was delineated on the dark regions or large streak artifact regions, maximum 7.8% dose error and average 3.2% difference was observed. The averaged minimum dose to the PTV predicted by AAA was about 5.6% higher and OARs doses are also 5.2% higher compared to AXB. Conclusion: The results of this study showed that AXB dose calculation involving high-density materials is more accurate than AAA calculation, and AXB was superior to AAA in dose predictions beyond dark artifact/air cavity portion when compared against the measurements.« less

Clinical Implementation of a Model-Based In Vivo Dose Verification System for Stereotactic Body Radiation Therapy-Volumetric Modulated Arc Therapy Treatments Using the Electronic Portal Imaging Device.

PubMed

McCowan, Peter M; Asuni, Ganiyu; Van Uytven, Eric; VanBeek, Timothy; McCurdy, Boyd M C; Loewen, Shaun K; Ahmed, Naseer; Bashir, Bashir; Butler, James B; Chowdhury, Amitava; Dubey, Arbind; Leylek, Ahmet; Nashed, Maged

2017-04-01

To report findings from an in vivo dosimetry program implemented for all stereotactic body radiation therapy patients over a 31-month period and discuss the value and challenges of utilizing in vivo electronic portal imaging device (EPID) dosimetry clinically. From December 2013 to July 2016, 117 stereotactic body radiation therapy-volumetric modulated arc therapy patients (100 lung, 15 spine, and 2 liver) underwent 602 EPID-based in vivo dose verification events. A developed model-based dose reconstruction algorithm calculates the 3-dimensional dose distribution to the patient by back-projecting the primary fluence measured by the EPID during treatment. The EPID frame-averaging was optimized in June 2015. For each treatment, a 3%/3-mm γ comparison between our EPID-derived dose and the Eclipse AcurosXB-predicted dose to the planning target volume (PTV) and the ≥20% isodose volume were performed. Alert levels were defined as γ pass rates <85% (lung and liver) and <80% (spine). Investigations were carried out for all fractions exceeding the alert level and were classified as follows: EPID-related, algorithmic, patient setup, anatomic change, or unknown/unidentified errors. The percentages of fractions exceeding the alert levels were 22.6% for lung before frame-average optimization and 8.0% for lung, 20.0% for spine, and 10.0% for liver after frame-average optimization. Overall, mean (± standard deviation) planning target volume γ pass rates were 90.7% ± 9.2%, 87.0% ± 9.3%, and 91.2% ± 3.4% for the lung, spine, and liver patients, respectively. Results from the clinical implementation of our model-based in vivo dose verification method using on-treatment EPID images is reported. The method is demonstrated to be valuable for routine clinical use for verifying delivered dose as well as for detecting errors. Copyright © 2017 Elsevier Inc. All rights reserved.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pokharel, S; Rana, S

Purpose: purpose of this study is to evaluate the effect of grid size in Eclipse AcurosXB dose calculation algorithm for SBRT lung. Methods: Five cases of SBRT lung previously treated have been chosen for present study. Four of the plans were 5 fields conventional IMRT and one was Rapid Arc plan. All five cases have been calculated with five grid sizes (1, 1.5, 2, 2.5 and 3mm) available for AXB algorithm with same plan normalization. Dosimetric indices relevant to SBRT along with MUs and time have been recorded for different grid sizes. The maximum difference was calculated as a percentagemore » of mean of all five values. All the plans were IMRT QAed with portal dosimetry. Results: The maximum difference of MUs was within 2%. The time increased was as high as 7 times from highest 3mm to lowest 1mm grid size. The largest difference of PTV minimum, maximum and mean dose were 7.7%, 1.5% and 1.6% respectively. The highest D2-Max difference was 6.1%. The highest difference in ipsilateral lung mean, V5Gy, V10Gy and V20Gy were 2.6%, 2.4%, 1.9% and 3.8% respectively. The maximum difference of heart, cord and esophagus dose were 6.5%, 7.8% and 4.02% respectively. The IMRT Gamma passing rate at 2%/2mm remains within 1.5% with at least 98% points passing with all grid sizes. Conclusion: This work indicates the lowest grid size of 1mm available in AXB is not necessarily required for accurate dose calculation. The IMRT passing rate was insignificant or not observed with the reduction of grid size less than 2mm. Although the maximum percentage difference of some of the dosimetric indices appear large, most of them are clinically insignificant in absolute dose values. So we conclude that 2mm grid size calculation is best compromise in light of dose calculation accuracy and time it takes to calculate dose.« less

Rapid scatter estimation for CBCT using the Boltzmann transport equation

NASA Astrophysics Data System (ADS)

Sun, Mingshan; Maslowski, Alex; Davis, Ian; Wareing, Todd; Failla, Gregory; Star-Lack, Josh

2014-03-01

Scatter in cone-beam computed tomography (CBCT) is a significant problem that degrades image contrast, uniformity and CT number accuracy. One means of estimating and correcting for detected scatter is through an iterative deconvolution process known as scatter kernel superposition (SKS). While the SKS approach is efficient, clinically significant errors on the order 2-4% (20-40 HU) still remain. We have previously shown that the kernel method can be improved by perturbing the kernel parameters based on reference data provided by limited Monte Carlo simulations of a first-pass reconstruction. In this work, we replace the Monte Carlo modeling with a deterministic Boltzmann solver (AcurosCTS) to generate the reference scatter data in a dramatically reduced time. In addition, the algorithm is improved so that instead of adjusting kernel parameters, we directly perturb the SKS scatter estimates. Studies were conducted on simulated data and on a large pelvis phantom scanned on a tabletop system. The new method reduced average reconstruction errors (relative to a reference scan) from 2.5% to 1.8%, and significantly improved visualization of low contrast objects. In total, 24 projections were simulated with an AcurosCTS execution time of 22 sec/projection using an 8-core computer. We have ported AcurosCTS to the GPU, and current run-times are approximately 4 sec/projection using two GPU's running in parallel.

SU-F-T-153: Experimental Validation and Calculation Benchmark for a Commercial Monte Carlo Pencil Beam Scanning Proton Therapy Treatment Planning System in Water

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lin, L; Huang, S; Kang, M

Purpose: Eclipse proton Monte Carlo AcurosPT 13.7 was commissioned and experimentally validated for an IBA dedicated PBS nozzle in water. Topas 1.3 was used to isolate the cause of differences in output and penumbra between simulation and experiment. Methods: The spot profiles were measured in air at five locations using Lynx. PTW-34070 Bragg peak chamber (Freiburg, Germany) was used to collect the relative integral Bragg peak for 15 proton energies from 100 MeV to 225 MeV. The phase space parameters (σx, σθ, ρxθ) number of protons per MU, energy spread and calculated mean energy provided by AcurosPT were identically implementedmore » into Topas. The absolute dose, profiles and field size factors measured using ionization chamber arrays were compared with both AcurosPT and Topas. Results: The beam spot size, σx, and the angular spread, σθ, in air were both energy-dependent: in particular, the spot size in air at isocentre ranged from 2.8 to 5.3 mm, and the angular spread ranged from 2.7 mrad to 6 mrad. The number of protons per MU increased from ∼9E7 at 100 MeV to ∼1.5E8 at 225 MeV. Both AcurosPT and TOPAS agree with experiment within 2 mm penumbra difference or 3% dose difference for scenarios including central axis depth dose and profiles at two depths in multi-spot square fields, from 40 to 200 mm, for all the investigated single-energy and multi-energy beams, indicating clinically acceptable source model and radiation transport algorithm in water. Conclusion: By comparing measured data and TOPAS simulation using the same source model, the AcurosPT 13.7 was validated in water within 2 mm penumbra difference or 3% dose difference. Benchmarks versus an independent Monte Carlo code are recommended to study the agreement in output, filed size factors and penumbra differences. This project is partially supported by the Varian grant under the master agreement between University of Pennsylvania and Varian.« less

A Brain-Machine-Brain Interface for Rewiring of Cortical Circuitry after Traumatic Brain Injury

DTIC Science & Technology

2013-09-01

were requested to provide further evidence, either neurophysiological or neuroanatomical, of enhanced connectivity (no additional studies in new...report. The algorithms developed during the course of the manuscript revision have proved to be very enlightening . During Year 3, we revisited our Year...to our local IACUC and subsequently, to ACURO during Year 4. As a result of the Nature reviews, we focused on a more neurophysiological approach to

Dip Spectroscopy of the Low Mass X-Ray Binary XB 1254-690

NASA Technical Reports Server (NTRS)

Smale, Alan P.; Church, M. J.; BalucinskaChurch, M.; White, Nicholas E. (Technical Monitor)

2002-01-01

We observed the low mass X-ray binary XB 1254-690 with the Rossi X-ray Timing Explorer in 2001 May and December. During the first observation strong dipping on the 3.9-hr orbital period and a high degree of variability were observed, along with "shoulders" approx. 15% deep during extended intervals on each side of the main dips. The first observation also included pronounced flaring activity. The non-dip spectrum obtained using the PCA instrument was well-described by a two-component model consisting of a blackbody with kT = 1.30 +/- 0.10 keV plus a cut-off power law representation of Comptonized emission with power law photon index 1.10 +/- 0.46 and a cut-off energy of 5.9(sup +3.0, sub -1.4) keV. The intensity decrease in the shoulders of dipping is energy-independent, consistent with electron scattering in the outer ionized regions of the absorber. In deep dipping the depth of dipping reached 100%, in the energy band below 5 keV, indicating that all emitting regions were covered by absorber. Intensity-selected dip spectra were well-fit by a model in which the point-like blackbody is rapidly covered, while the extended Comptonized emission is progressively overlapped by the absorber, with the, covering fraction rising to 95% in the deepest portion of the dip. The intensity of this component in the dip spectra could be modeled by a combination of electron scattering and photoelectric absorption. Dipping did not occur during the 2001 December observation, but remarkably, both bursting and flaring were observed contemporaneously.

Feasibility study of entrance and exit dose measurements at the contra lateral breast with alanine/electron spin resonance dosimetry in volumetric modulated radiotherapy of breast cancer

NASA Astrophysics Data System (ADS)

Wagner, Daniela M.; Hüttenrauch, Petra; Anton, Mathias; von Voigts-Rhetz, Philip; Zink, Klemens; Wolff, Hendrik A.

2017-07-01

The Physikalisch-Technische Bundesanstalt has established a secondary standard measurement system for the dose to water, D W, based on alanine/ESR (Anton et al 2013 Phys. Med. Biol. 58 3259-82). The aim of this study was to test the established measurement system for the out-of-field measurements of inpatients with breast cancer. A set of five alanine pellets were affixed to the skin of each patient at the contra lateral breast beginning at the sternum and extending over the mammilla to the distal surface. During 28 fractions with 2.2 Gy per fraction, the accumulated dose was measured in four patients. A cone beam computer tomography (CBCT) scan was generated for setup purposes before every treatment. The reference CT dataset was registered rigidly and deformably to the CBCT dataset for 28 fractions. To take the actual alanine pellet position into account, the dose distribution was calculated for every fraction using the Acuros XB algorithm. The results of the ESR measurements were compared to the calculated doses. The maximum dose measured at the sternum was 19.9 Gy  ±  0.4 Gy, decreasing to 6.8 Gy  ±  0.2 Gy at the mammilla and 4.5 Gy  ±  0.1 Gy at the distal surface of the contra lateral breast. The absolute differences between the calculated and measured doses ranged from  -1.9 Gy to 0.9 Gy. No systematic error could be seen. It was possible to achieve a combined standard uncertainty of 1.63% for D W  =  5 Gy for the measured dose. The alanine/ESR method is feasible for in vivo measurements.

Tests of a 1/7-Scale Semispan Model of the XB-35 Airplane in the Langley 19-Foot Pressure Tunnel

NASA Technical Reports Server (NTRS)

Teplitz, Jerome; Kayten, Gerald G.; Cancro, Patrick A.

1946-01-01

A 1/7 scale semispan model of the XB-35 airplane was tested in the Langley 10 foot pressure tunnel, primarily for the purpose of investigating the effectiveness of a leading-edge slot for alleviation of stick-fixed longitudinal instability at high angles of attack caused by early tip stalling and a device for relief of stick-free instability caused by elevon up-floating tendencies at high angles of attack. Results indicated that the slot was not adequate to provide the desired improvement in stick-fixed stability. The tab-flipper device provided improvement in stick-free stability abd two of the linkage combinations tested gave satisfactory variations of control force with airspeed for all conditions except that in which the wing-tip "pitch-control" flap was fully deflected. However, the improvement in control force characteristics was accompanied by a detrimental effect on stick-fixed stability because of the pitching moments produced by the elevon tab deflection.

Remote sensing imagery classification using multi-objective gravitational search algorithm

NASA Astrophysics Data System (ADS)

Zhang, Aizhu; Sun, Genyun; Wang, Zhenjie

2016-10-01

Simultaneous optimization of different validity measures can capture different data characteristics of remote sensing imagery (RSI) and thereby achieving high quality classification results. In this paper, two conflicting cluster validity indices, the Xie-Beni (XB) index and the fuzzy C-means (FCM) (Jm) measure, are integrated with a diversity-enhanced and memory-based multi-objective gravitational search algorithm (DMMOGSA) to present a novel multi-objective optimization based RSI classification method. In this method, the Gabor filter method is firstly implemented to extract texture features of RSI. Then, the texture features are syncretized with the spectral features to construct the spatial-spectral feature space/set of the RSI. Afterwards, cluster of the spectral-spatial feature set is carried out on the basis of the proposed method. To be specific, cluster centers are randomly generated initially. After that, the cluster centers are updated and optimized adaptively by employing the DMMOGSA. Accordingly, a set of non-dominated cluster centers are obtained. Therefore, numbers of image classification results of RSI are produced and users can pick up the most promising one according to their problem requirements. To quantitatively and qualitatively validate the effectiveness of the proposed method, the proposed classification method was applied to classifier two aerial high-resolution remote sensing imageries. The obtained classification results are compared with that produced by two single cluster validity index based and two state-of-the-art multi-objective optimization algorithms based classification results. Comparison results show that the proposed method can achieve more accurate RSI classification.

Effect of Ga addition on the valence state of Ce and magnetic properties of melt-spun Ce17Fe78-xB6Gax (x = 0-1.0) ribbons

NASA Astrophysics Data System (ADS)

Jiang, Qingzheng; Zhong, Minglong; Lei, Weikai; Zeng, Qingwen; Hu, Yongfeng; Quan, Qichen; Xu, Yaping; Hu, Xianjun; Zhang, Lili; Liu, Renhui; Ma, Shengcan; Zhong, Zhenchen

2017-08-01

The Ce17Fe78-xB6Gax (x=0-1.0) ribbons were fabricated by a melt-spinning technique in order to study the mechanism of the valence variation of Ce and their magnetic properties as well as improve the thermal stability of Ce-based rare earth permanent magnets. The systematic investigations of the Ce17Fe78-xB6Gax (x=0-1.0) alloys show that the room-temperature coercivity increases significantly from 352 kA/m at x = 0 to 492 kA/m at x = 1.0. The Curie temperature (Tc) increases monotonically from 424.5 K to 433.6 K, and the temperature coefficients of remanence (α) and coercivity (β) of the ribbons are better off from -0.56 %/K, -0.75 %/K for x = 0 to -0.45 %/K, -0.65 %/K for x = 0.75 in the temperature range of 300-400 K, respectively. The Ce L3-edge X-ray absorption near edge structure (XANES) spectrums reveal that there is more Ce4+ in ribbons under total electron yield than fluorescence yield as Ce has a high affinity with oxygen. The weight of Ce3+ increases while the weight of Ce4+ decreases in Ga-added alloys. The refined grain size and a more uniform microstructure are mainly attributed to the improved magnetic properties and thermal stability with Ga doping. This paper may serve as a reference for further developing the so-called gap magnets and the effective utilization of the rare earth resources.

Investigation of the Stability and Control Characteristics of a 1/20-Scale Model of the Consolidated Vultee XB-53 Airplane in the Langley Free-Flight Tunnel

NASA Technical Reports Server (NTRS)

Bennett, Charles V.

1947-01-01

An investigation of the low-speed, power-off stability and control characteristics of a 1/20-scale model of the Consolidated Vultee XB-53 airplane has been conducted in the Langley free-flight tunnel. In the investigation it was found that with flaps neutral satisfactory flight behavior at low speeds was obtainable with an increase in height of the vertical tail and with the inboard slats opened. In the flap-down slat-open condition the longitudinal stability was satisfactory, but it was impossible to obtain satisfactory lateral-flight characteristics even with the increase in height of the vertical tail because of the negative effective dihedral, low directional stability, and large-adverse yawing moments of the ailerons.

In vivo measurements for high dose rate brachytherapy with optically stimulated luminescent dosimeters

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sharma, Renu; Jursinic, Paul A.

2013-07-15

Purpose: To show the feasibility of clinical implementation of OSLDs for high dose-rate (HDR) in vivo dosimetry for gynecological and breast patients. To discuss how the OSLDs were characterized for an Ir-192 source, taking into account low gamma energy and high dose gradients. To describe differences caused by the dose calculation formalism of treatment planning systems.Methods: OSLD irradiations were made using the GammaMedplus iX Ir-192 HDR, Varian Medical Systems, Milpitas, CA. BrachyVision versions 8.9 and 10.0, Varian Medical Systems, Milpitas, CA, were used for calculations. Version 8.9 used the TG-43 algorithm and version 10.0 used the Acuros algorithm. The OSLDsmore » (InLight Nanodots) were characterized for Ir-192. Various phantoms were created to assess calculated and measured doses and the angular dependence and self-absorption of the Nanodots. Following successful phantom measurements, patient measurements for gynecological patients and breast cancer patients were made and compared to calculated doses.Results: The OSLD sensitivity to Ir-192 compared to 6 MV is between 1.10 and 1.25, is unique to each detector, and changes with accumulated dose. The measured doses were compared to those predicted by the treatment planning system and found to be in agreement for the gynecological patients to within measurement uncertainty. The range of differences between the measured and Acuros calculated doses was -10%-14%. For the breast patients, there was a discrepancy of -4.4% to +6.5% between the measured and calculated doses at the skin surface when the Acuros algorithm was used. These differences were within experimental uncertainty due to (random) error in the location of the detector with respect to the treatment catheter.Conclusions: OSLDs can be successfully used for HDR in vivo dosimetry. However, for the measurements to be meaningful one must account for the angular dependence, volume-averaging, and the greater sensitivity to Ir-192 gamma rays than to 6

The performance of the progressive resolution optimizer (PRO) for RapidArc planning in targets with low-density media.

PubMed

Kan, Monica W K; Leung, Lucullus H T; Yu, Peter K N

2013-11-04

A new version of progressive resolution optimizer (PRO) with an option of air cavity correction has been implemented for RapidArc volumetric-modulated arc therapy (RA). The purpose of this study was to compare the performance of this new PRO with the use of air cavity correction option (PRO10_air) against the one without the use of the air cavity correction option (PRO10_no-air) for RapidArc planning in targets with low-density media of different sizes and complexities. The performance of PRO10_no-air and PRO10_air was initially compared using single-arc plans created for four different simple heterogeneous phantoms with virtual targets and organs at risk. Multiple-arc planning of 12 real patients having nasopharyngeal carcinomas (NPC) and ten patients having non-small cell lung cancer (NSCLC) were then performed using the above two options for further comparison. Dose calculations were performed using both the Acuros XB (AXB) algorithm with the dose to medium option and the analytical anisotropic algorithm (AAA). The effect of using intermediate dose option after the first optimization cycle in PRO10_air and PRO10_no-air was also investigated and compared. Plans were evaluated and compared using target dose coverage, critical organ sparing, conformity index, and dose homogeneity index. For NSCLC cases or cases for which large volumes of low-density media were present in or adjacent to the target volume, the use of the air cavity correction option in PRO10 was shown to be beneficial. For NPC cases or cases for which small volumes of both low- and high-density media existed in the target volume, the use of air cavity correction in PRO10 did not improve the plan quality. Based on the AXB dose calculation results, the use of PRO10_air could produce up to 18% less coverage to the bony structures of the planning target volumes for NPC cases. When the intermediate dose option in PRO10 was used, there was negligible difference observed in plan quality between

The performance of the progressive resolution optimizer (PRO) for RapidArc planning in targets with low‐density media

PubMed Central

Leung, Lucullus H.T.; Yu, Peter K.N.

2013-01-01

A new version of progressive resolution optimizer (PRO) with an option of air cavity correction has been implemented for RapidArc volumetric‐modulated arc therapy (RA). The purpose of this study was to compare the performance of this new PRO with the use of air cavity correction option (PRO10_air) against the one without the use of the air cavity correction option (PRO10_no‐air) for RapidArc planning in targets with low‐density media of different sizes and complexities. The performance of PRO10_no‐air and PRO10_air was initially compared using single‐arc plans created for four different simple heterogeneous phantoms with virtual targets and organs at risk. Multiple‐arc planning of 12 real patients having nasopharyngeal carcinomas (NPC) and ten patients having non‐small cell lung cancer (NSCLC) were then performed using the above two options for further comparison. Dose calculations were performed using both the Acuros XB (AXB) algorithm with the dose to medium option and the analytical anisotropic algorithm (AAA). The effect of using intermediate dose option after the first optimization cycle in PRO10_air and PRO10_no‐air was also investigated and compared. Plans were evaluated and compared using target dose coverage, critical organ sparing, conformity index, and dose homogeneity index. For NSCLC cases or cases for which large volumes of low‐density media were present in or adjacent to the target volume, the use of the air cavity correction option in PROIO was shown to be beneficial. For NPC cases or cases for which small volumes of both low‐ and high‐density media existed in the target volume, the use of air cavity correction in PRO10 did not improve the plan quality. Based on the AXB dose calculation results, the use of PRO10_air could produce up to 18% less coverage to the bony structures of the planning target volumes for NPC cases. When the intermediate dose option in PRO10 was used, there was negligible difference observed in plan

Kinetic simulations of X-B and O-X-B mode conversion and its deterioration at high input power

DOE Office of Scientific and Technical Information (OSTI.GOV)

Arefiev, A. V.; Dodin, I. Y.; Kohn, A.

Spherical tokamak plasmas are typically overdense and thus inaccessible to externally-injected microwaves in the electron cyclotron range. The electrostatic electron Bernstein wave (EBW), however, provides a method to access the plasma core for heating and diagnostic purposes. Understanding the details of the coupling process to electromagnetic waves is thus important both for the interpretation of microwave diagnostic data and for assessing the feasibility of EBW heating and current drive. While the coupling is reasonably well–understood in the linear regime, nonlinear physics arising from high input power has not been previously quantified. To tackle this problem, we have performed one- andmore » two-dimensional fully kinetic particle-in-cell simulations of the two possible coupling mechanisms, namely X-B and O-X-B mode conversion. We find that the ion dynamics has a profound effect on the field structure in the nonlinear regime, as high amplitude short-scale oscillations of the longitudinal electric field are excited in the region below the high-density cut-off prior to the arrival of the EBW. We identify this effect as the instability of the X wave with respect to resonant scattering into an EBW and a lower-hybrid wave. Finally, we calculate the instability rate analytically and find this basic theory to be in reasonable agreement with our simulation results.« less

Kinetic simulations of X-B and O-X-B mode conversion and its deterioration at high input power

DOE PAGES

Arefiev, A. V.; Dodin, I. Y.; Kohn, A.; ...

2017-08-09

Spherical tokamak plasmas are typically overdense and thus inaccessible to externally-injected microwaves in the electron cyclotron range. The electrostatic electron Bernstein wave (EBW), however, provides a method to access the plasma core for heating and diagnostic purposes. Understanding the details of the coupling process to electromagnetic waves is thus important both for the interpretation of microwave diagnostic data and for assessing the feasibility of EBW heating and current drive. While the coupling is reasonably well–understood in the linear regime, nonlinear physics arising from high input power has not been previously quantified. To tackle this problem, we have performed one- andmore » two-dimensional fully kinetic particle-in-cell simulations of the two possible coupling mechanisms, namely X-B and O-X-B mode conversion. We find that the ion dynamics has a profound effect on the field structure in the nonlinear regime, as high amplitude short-scale oscillations of the longitudinal electric field are excited in the region below the high-density cut-off prior to the arrival of the EBW. We identify this effect as the instability of the X wave with respect to resonant scattering into an EBW and a lower-hybrid wave. Finally, we calculate the instability rate analytically and find this basic theory to be in reasonable agreement with our simulation results.« less

Explorations on TiOsX (X=B, C, N, O and Si) alloys for potential superhard materials from first-principle calculation

NASA Astrophysics Data System (ADS)

Wu, Junyan; Zhang, Bo; Zhan, Yongzhong

2017-05-01

Using the first-principle calculations, we gained a deep insight of the structural, mechanical, electronic and thermal properties of the TiOs and TiOs-X (X=B, C, N, O and Si) compounds. The calculated results of formation enthalpy Hform and ternary transfer energy EXOs → Ti illustrate that O element exhibits strong Os site preference and all the compounds here are structurally stable. The results of mechanical properties confirm that there is no superhard character in those intermetallics which are mechanically stable. It is noted that the Ti7Os8Si possesses the best mechanical properties. All the compounds here show elastic anisotropy, and the Ti8Os7O exhibits the strongest elastic anisotropy, while the Ti8Os7Si strongly tends to be isotropic. There exists a mixture of covalent, ionic and metallic characters in these compounds. The covalent bond strength of Ti7Os8X is supposed to be better than that of the corresponding Ti8Os7X. Moreover, the minimum thermal conductivity kmin of these compounds are comparatively small and show dependence of directions, and they have potential thermal-insulating application in engineering.

SU-F-T-236: Comparison of Two IMRT/VMAT QA Systems Using Gamma Index Analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dogan, N; Denissova, S

2016-06-15

Purpose: The goal of this study is to assess differences in the Gamma index pass rates when using two commercial QA systems and provide optimum Gamma index parameters for pre-treatment patient specific QA. Methods: Twenty-two VMAT cases that consisted of prostate, lung, head and neck, spine, brain and pancreas, were included in this study. The verification plans have been calculated using AcurosXB(V11) algorithm for different dose grids (1.5mm, 2.5mm, 3mm). The measurements were performed on TrueBeam(Varian) accelerator using both EPID(S1000) portal imager and ArcCheck(SunNuclearCorp) devices. Gamma index criteria variation of 3%/3mm, 2%/3mm, 2%/2mm and threshold (TH) doses of 5% tomore » 50% were used in analysis. Results: The differences in Gamma pass rates between two devices are not statistically significant for 3%/3mm, yielding pass rate higher than 95%. Increase of lower dose TH showed reduced pass rates for both devices. ArcCheck’s more pronounced effect can be attributed to higher contribution of lower dose region spread. As expected, tightening criteria to 2%/2mm (TH: 10%) decreased Gamma pass rates below 95%. Higher EPID (92%) pass rates compared to ArcCheck (86%) probably due to better spatial resolution. Portal Dosimetry results showed lower Gamma pass rates for composite plans compared to individual field pass rates. This may be due to the expansion in the analyzed region which includes pixels not included in the separate field analysis. Decreasing dose grid size from 2.5mm to 1.5mm did not show statistically significant (p<0.05) differences in Gamma pass rates for both QA devices. Conclusion: Overall, both system measurements agree well with calculated dose when using gamma index criteria of 3%/3mm for a variety of VMAT cases. Variability between two systems increases using different dose GRID, TH and tighter gamma criteria and must be carefully assessed prior to clinical use.« less

SU-E-T-215: Comparison of VMAT-SABR Treatment Plans with Flattened Filter (FF) Beam and Flattening Filter-Free (FFF) Beam for Localized Prostate Cancer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chung, J; Kim, J; Kang, S

2015-06-15

Purpose: The purpose of this study is to access VMAT-SABR plan using flattening filter (FF) and flattening filter-free (FFF) beam, and compare the verification results for all pretreatment plans. Methods: SABR plans for 20 prostate patients were optimized in the Eclipse treatment planning system. A prescription dose was 42.7 Gy/7 fractions. Four SABR plans for each patient were calculated using Acuros XB algorithm with both FF and FFF beams of 6- and 10-MV. The dose-volume histograms (DVH) and technical parameters were recorded and compared. A pretreatment verification was performed and the gamma analysis was used to quantify the agreement betweenmore » calculations and measurements. Results: For each patient, the DVHs are closely similar for plans of four different beams. There are small differences showed in dose distributions and corresponding DVHs when comparing the each plan related to the same patient. Sparing on bladder and rectum was slightly better on plans with 10-MV FF and FFF than with 6-MV FF and FFF, but this difference was negligible. However, there was no significance in the other OARs. The mean agreement of 3%/3mm criteria was higher than 97% in all plans. The mean MUs and deliver time employed was 1701±101 and 3.02±0.17 min for 6-MV FF, 1870±116 and 1.69±0.08 min for 6-MV FFF, 1471±86 and 2.68±0.14 min for 10-MV FF, and 1619±101 and 0.98±0.04 min for 10-MV FFF, respectively. Conclusion: Dose distributions on prostate SABR plans using FFF beams were similar to those generated by FF beams. However, the use of FFF beam offers a clear benefit in delivery time when compared to FF beam. Verification of pretreatment also represented the acceptable and comparable results in all plans using FF beam as well as FFF beam. Therefore, this study suggests that the use of FFF beam is feasible and efficient technique for prostate SABR.« less

Equivalent Longitudinal Area Distributions of the B-58 and XB-70-1 Airplanes for Use in Wave Drag and Sonic Boom Calculations

NASA Technical Reports Server (NTRS)

Tinetti, Ana F.; Maglieri, Domenic J.; Driver, Cornelius; Bobbitt, Percy J.

2011-01-01

A detailed geometric description, in wave drag format, has been developed for the Convair B-58 and North American XB-70-1 delta wing airplanes. These descriptions have been placed on electronic files, the contents of which are described in this paper They are intended for use in wave drag and sonic boom calculations. Included in the electronic file and in the present paper are photographs and 3-view drawings of the two airplanes, tabulated geometric descriptions of each vehicle and its components, and comparisons of the electronic file outputs with existing data. The comparisons include a pictorial of the two airplanes based on the present geometric descriptions, and cross-sectional area distributions for both the normal Mach cuts and oblique Mach cuts above and below the vehicles. Good correlation exists between the area distributions generated in the late 1950s and 1960s and the present files. The availability of these electronic files facilitates further validation of sonic boom prediction codes through the use of two existing data bases on these airplanes, which were acquired in the 1960s and have not been fully exploited.

Xenorhabdus bovienii CS03, the bacterial symbiont of the entomopathogenic nematode Steinernema weiseri, is a non-virulent strain against lepidopteran insects.

PubMed

Bisch, Gaëlle; Pagès, Sylvie; McMullen, John G; Stock, S Patricia; Duvic, Bernard; Givaudan, Alain; Gaudriault, Sophie

2015-01-01

Xenorhabdus bacteria (γ-proteobacteria: Enterobacteriaceae) have dual lifestyles. They have a mutualistic relationship with Steinernema nematodes (Nematoda: Steinernematidae) and are pathogenic to a wide range of insects. Each Steinernema nematode associates with a specific Xenorhabdus species. However, a Xenorhabdus species can have multiple nematode hosts. For example, Xenorhabdus bovienii (Xb) colonizes at least nine Steinernema species from two different phylogenetic clades. The Steinernema-Xb partnership has been found in association with different insect hosts. Biological and molecular data on the Steinernema jollieti-Xb strain SS-2004 pair have recently been described. In particular, the Xb SS-2004 bacteria are virulent alone after direct injection into insect, making this strain a model for studying Xb virulence. In this study, we searched for Xb strains attenuated in virulence. For this purpose, we underwent infection assays with five Steinernema spp.-Xb pairs with two insects, Galleria mellonella (Lepidoptera: Pyralidae) and Spodoptera littoralis (Lepidoptera: Noctuidae). The S. weiseri-Xb CS03 pair showed attenuated virulence and lower fitness in S. littoralis in comparison to the other nematode-bacteria pairs. Furthermore, when injected alone into the hemolymph of G. mellonella or S. littoralis, the Xb CS03 bacterial strain was the only non-virulent strain. By comparison with the virulent Xb SS-2004 strain, Xb CS03 showed an increased sensitivity to the insect antimicrobial peptides, suggesting an attenuated response to the insect humoral immunity. To our current knowledge, Xb CS03 is the first non-virulent Xb strain identified. We propose this strain as a new model for studying the Xenorhabdus virulence. Copyright © 2014 Elsevier Inc. All rights reserved.

Vibration responses of test structure no. 1 during the Edwards Air Force Base phase of the national sonic boom program. [F-104, B-58, and XB-70 sonic boom exposures

NASA Technical Reports Server (NTRS)

Findley, D. S.; Huckel, V.; Henderson, H. R.

1975-01-01

In order to evaluate reaction of people to sonic booms of varying overpressures and time durations, a series of closely controlled and systematic flight test studies were conducted in the vicinity of Edwards AFB, California, from June 3 to June 23, 1966. The dynamic responses of several building structures were measured as a part of these studies, and the measurements made in a one-story residence structure (Edwards test structure No. 1) are presented. Sample acceleration and strain recordings are presented from F-104, B-58, and XB-70 sonic-boom exposures, along with tabulations of the maximum acceleration and strain values measured for each one of about 140 flight tests. These data are compared with similar measurements for engine noise exposures of the building during simulated landing approaches and takeoffs of KC-135 aircraft.

Dissecting the Mechanisms of Drug Resistance in BRCA1/2-Mutant Breast Cancers

DTIC Science & Technology

2017-10-01

approval from the Institutional Animal Care and Use Committee (IACUC) (protocol # 08-036) for performing Figure 6. NMNAT-1 deficiency rescues...sorted on day 3, and chromosomal aberrations were analyzed by metaphase spreads. 7 all of the proposed animal experiments at site 2, DFCI. The...ACURO documents/forms have been submitted to DOD for approval. The USAMRMC Animal Care and Use Review Office (ACURO) has received the appropriate forms

A Novel EphA4-Based Small Molecule-Based Therapeutic Strategy for Prevention and Treatment of Post-Traumatic Osteoarthritis

DTIC Science & Technology

2015-09-01

first three months of the project, we successfully obtained approval for our Animal Component of Research Project (ACORP) from our local IACUC and...total number of animals . The approved ACORP and the amendment were submitted to ACURO for approval and final approval from the ACURO was secured on...the tibial plateau. The injury was produced using an “Instron” servohydraulic tester with the animal under inhalation anesthesia (3% isoflurane, 0.5

Effect of magnetic field annealing on soft magnetic properties of Co71Fe2Si14-xB9+xMn4 amorphous alloys with low permeability

NASA Astrophysics Data System (ADS)

Fan, Xingdu; Li, Meng; Zhang, Tao; Yuan, Chenchen; Shen, Baolong

2018-05-01

The effect of transverse magnetic field annealing (TFA) on soft magnetic properties of Co71Fe2Si14-xB9+xMn4 amorphous alloys was investigated with the aim of reducing effective permeability (μe). It was revealed that the increasing B content improved thermal stability, increased saturation magnetic flux density (Bs) of as-quenched alloys, while the samples exhibited a slightly larger coercivity (Hc) when the atom percentages of Si and B were similar. Permeability decreased dramatically after TFA. The decrease of permeability mainly depended on annealing temperature and magnetic field intensity. Besides, flat hysteresis loops were obtained after TFA, Lorentz micrograph observation revealed the TFA sample exhibited denser magnetic domain walls, which confirmed it was more difficult to be saturated. The Co71Fe2Si9B14Mn4 alloy was successful prepared with low μe of 3020, low Hc of 1.7 A/m and high resistance to DC bias 6 times that of as-quenched alloy at the DC field of 300 A/m.

A theoretical investigation of mixing thermodynamics, age-hardening potential, and electronic structure of ternary M11–xM2xB2 alloys with AlB2 type structure

PubMed Central

Alling, B.; Högberg, H.; Armiento, R.; Rosen, J.; Hultman, L.

2015-01-01

Transition metal diborides are ceramic materials with potential applications as hard protective thin films and electrical contact materials. We investigate the possibility to obtain age hardening through isostructural clustering, including spinodal decomposition, or ordering-induced precipitation in ternary diboride alloys. By means of first-principles mixing thermodynamics calculations, 45 ternary M11–xM2xB2 alloys comprising MiB2 (Mi = Mg, Al, Sc, Y, Ti, Zr, Hf, V, Nb, Ta) with AlB2 type structure are studied. In particular Al1–xTixB2 is found to be of interest for coherent isostructural decomposition with a strong driving force for phase separation, while having almost concentration independent a and c lattice parameters. The results are explained by revealing the nature of the electronic structure in these alloys, and in particular, the origin of the pseudogap at EF in TiB2, ZrB2, and HfB2. PMID:25970763

Nonhydrostatic and surfbeat model predictions of extreme wave run-up in fringing reef environments

USGS Publications Warehouse

Lashley, Christopher H.; Roelvink, Dano; van Dongeren, Ap R.; Buckley, Mark L.; Lowe, Ryan J.

2018-01-01

The accurate prediction of extreme wave run-up is important for effective coastal engineering design and coastal hazard management. While run-up processes on open sandy coasts have been reasonably well-studied, very few studies have focused on understanding and predicting wave run-up at coral reef-fronted coastlines. This paper applies the short-wave resolving, Nonhydrostatic (XB-NH) and short-wave averaged, Surfbeat (XB-SB) modes of the XBeach numerical model to validate run-up using data from two 1D (alongshore uniform) fringing-reef profiles without roughness elements, with two objectives: i) to provide insight into the physical processes governing run-up in such environments; and ii) to evaluate the performance of both modes in accurately predicting run-up over a wide range of conditions. XBeach was calibrated by optimizing the maximum wave steepness parameter (maxbrsteep) in XB-NH and the dissipation coefficient (alpha) in XB-SB) using the first dataset; and then applied to the second dataset for validation. XB-NH and XB-SB predictions of extreme wave run-up (Rmax and R2%) and its components, infragravity- and sea-swell band swash (SIG and SSS) and shoreline setup (<η>), were compared to observations. XB-NH more accurately simulated wave transformation but under-predicted shoreline setup due to its exclusion of parameterized wave-roller dynamics. XB-SB under-predicted sea-swell band swash but overestimated shoreline setup due to an over-prediction of wave heights on the reef flat. Run-up (swash) spectra were dominated by infragravity motions, allowing the short-wave (but not wave group) averaged model (XB-SB) to perform comparably well to its more complete, short-wave resolving (XB-NH) counterpart. Despite their respective limitations, both modes were able to accurately predict Rmax and R2%.

Density scaling of phantom materials for a 3D dose verification system.

PubMed

Tani, Kensuke; Fujita, Yukio; Wakita, Akihisa; Miyasaka, Ryohei; Uehara, Ryuzo; Kodama, Takumi; Suzuki, Yuya; Aikawa, Ako; Mizuno, Norifumi; Kawamori, Jiro; Saitoh, Hidetoshi

2018-05-21

In this study, the optimum density scaling factors of phantom materials for a commercially available three-dimensional (3D) dose verification system (Delta4) were investigated in order to improve the accuracy of the calculated dose distributions in the phantom materials. At field sizes of 10 × 10 and 5 × 5 cm 2 with the same geometry, tissue-phantom ratios (TPRs) in water, polymethyl methacrylate (PMMA), and Plastic Water Diagnostic Therapy (PWDT) were measured, and TPRs in various density scaling factors of water were calculated by Monte Carlo simulation, Adaptive Convolve (AdC, Pinnacle 3 ), Collapsed Cone Convolution (CCC, RayStation), and AcurosXB (AXB, Eclipse). Effective linear attenuation coefficients (μ eff ) were obtained from the TPRs. The ratios of μ eff in phantom and water ((μ eff ) pl,water ) were compared between the measurements and calculations. For each phantom material, the density scaling factor proposed in this study (DSF) was set to be the value providing a match between the calculated and measured (μ eff ) pl,water . The optimum density scaling factor was verified through the comparison of the dose distributions measured by Delta4 and calculated with three different density scaling factors: the nominal physical density (PD), nominal relative electron density (ED), and DSF. Three plans were used for the verifications: a static field of 10 × 10 cm 2 and two intensity modulated radiation therapy (IMRT) treatment plans. DSF were determined to be 1.13 for PMMA and 0.98 for PWDT. DSF for PMMA showed good agreement for AdC and CCC with 6 MV x ray, and AdC for 10 MV x ray. DSF for PWDT showed good agreement regardless of the dose calculation algorithms and x-ray energy. DSF can be considered one of the references for the density scaling factor of Delta4 phantom materials and may help improve the accuracy of the IMRT dose verification using Delta4. © 2018 The Authors. Journal of Applied Clinical Medical Physics published by Wiley

SU-F-T-625: Optimal Treatment Planning Strategy Among Arc Arrangements for Prostate SBRT with VMAT Technique

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chung, J; Kim, J; Eom, K

Purpose: The purpose of this study is to determine the optimal treatment planning strategy among the different arc arrangements for prostate stereotactic body radiotherapy (SBRT) plans with volumetric modulated arc therapy (VMAT). Methods: Ten patients with prostate cancer were selected. The SBRT-VMAT plans for each patient were generated with single-full (181° to 179°; 1FA), single-partial (240° to 120°; 1PA), double-full (181° to 179° and 179° to 181°; 2FA), and double-partial (240° to 120° and 120° to 240°; 2PA) arc arrangements. The prescription dose was 42.7 Gy in 7 fractions. Dose distribution was calculated using a 10-MV flattening-filter-free beam and themore » Acuros XB algorithm. Dosimetric parameters of target volume and organs at risk (OARs) were evaluated from cumulative dose-volume histograms on prostate SBRT-VMAT plans between single-arc (1FA and 1PA) and double-arc (2FA and 2PA) arrangements. Results: All plans using four arc arrangements were highly conformal with conformity index (CI)<1.05 and conformation number (CN)=0.91, and the doses to target volume were homogeneous (homogeneity index (HI)= 0.09 0.12). Pertaining to the dose to the OARs, there were significant differences in the rectum, left and right femoral head doses while having no difference in the bladder dose. The partial-arc (1PA and 2PA) had relatively high reductions for the mean rectum dose compared to full-arc (1FA and 2FA). The near-to-maximum dose (D2%) and mean dose of the left and right femoral head were always lower on prostate SBRT-VMAT plan using the full-arc, when compared to the partial-arc arrangement. Conclusion: This study confirmed that prostate SBRT-VMAT using 1PA was feasible fast delivery time and produced equivalent target coverage and better rectum sparing, although the D2% and mean dose of the left and right femoral head increased slightly. Therefore, the results of this study suggest that the use of 1PA is an attractive choice for delivering

SWIFT REVEALS A ∼5.7 DAY SUPER-ORBITAL PERIOD IN THE M31 GLOBULAR CLUSTER X-RAY BINARY XB158

DOE Office of Scientific and Technical Information (OSTI.GOV)

Barnard, R.; Garcia, M. R.; Murray, S. S.

2015-03-01

The M31 globular cluster X-ray binary XB158 (a.k.a. Bo 158) exhibits intensity dips on a 2.78 hr period in some observations, but not others. The short period suggests a low mass ratio, and an asymmetric, precessing disk due to additional tidal torques from the donor star since the disk crosses the 3:1 resonance. Previous theoretical three-dimensional smoothed particle hydrodynamical modeling suggested a super-orbital disk precession period 29 ± 1 times the orbital period, i.e., ∼81 ± 3 hr. We conducted a Swift monitoring campaign of 30 observations over ∼1 month in order to search for evidence of such a super-orbital period. Fitting the 0.3-10 keV Swift X-Ray Telescopemore » luminosity light curve with a sinusoid yielded a period of 5.65 ± 0.05 days, and a >5σ improvement in χ{sup 2} over the best fit constant intensity model. A Lomb-Scargle periodogram revealed that periods of 5.4-5.8 days were detected at a >3σ level, with a peak at 5.6 days. We consider this strong evidence for a 5.65 day super-orbital period, ∼70% longer than the predicted period. The 0.3-10 keV luminosity varied by a factor of ∼5, consistent with variations seen in long-term monitoring from Chandra. We conclude that other X-ray binaries exhibiting similar long-term behavior are likely to also be X-ray binaries with low mass ratios and super-orbital periods.« less

Experimental investigation of halogen-bond hard-soft acid-base complementarity.

PubMed

Riel, Asia Marie S; Jessop, Morly J; Decato, Daniel A; Massena, Casey J; Nascimento, Vinicius R; Berryman, Orion B

2017-04-01

The halogen bond (XB) is a topical noncovalent interaction of rapidly increasing importance. The XB employs a `soft' donor atom in comparison to the `hard' proton of the hydrogen bond (HB). This difference has led to the hypothesis that XBs can form more favorable interactions with `soft' bases than HBs. While computational studies have supported this suggestion, solution and solid-state data are lacking. Here, XB soft-soft complementarity is investigated with a bidentate receptor that shows similar associations with neutral carbonyls and heavy chalcogen analogs. The solution speciation and XB soft-soft complementarity is supported by four crystal structures containing neutral and anionic soft Lewis bases.

A Spatially Detailed Model of Isometric Contraction Based on Competitive Binding of Troponin I Explains Cooperative Interactions between Tropomyosin and Crossbridges

PubMed Central

Land, Sander; Niederer, Steven A.

2015-01-01

Biophysical models of cardiac tension development provide a succinct representation of our understanding of force generation in the heart. The link between protein kinetics and interactions that gives rise to high cooperativity is not yet fully explained from experiments or previous biophysical models. We propose a biophysical ODE-based representation of cross-bridge (XB), tropomyosin and troponin within a contractile regulatory unit (RU) to investigate the mechanisms behind cooperative activation, as well as the role of cooperativity in dynamic tension generation across different species. The model includes cooperative interactions between regulatory units (RU-RU), between crossbridges (XB-XB), as well more complex interactions between crossbridges and regulatory units (XB-RU interactions). For the steady-state force-calcium relationship, our framework predicts that: (1) XB-RU effects are key in shifting the half-activation value of the force-calcium relationship towards lower [Ca2+], but have only small effects on cooperativity. (2) XB-XB effects approximately double the duty ratio of myosin, but do not significantly affect cooperativity. (3) RU-RU effects derived from the long-range action of tropomyosin are a major factor in cooperative activation, with each additional unblocked RU increasing the rate of additional RU’s unblocking. (4) Myosin affinity for short (1–4 RU) unblocked stretches of actin of is very low, and the resulting suppression of force at low [Ca2+] is a major contributor in the biphasic force-calcium relationship. We also reproduce isometric tension development across mouse, rat and human at physiological temperature and pacing rate, and conclude that species differences require only changes in myosin affinity and troponin I/troponin C affinity. Furthermore, we show that the calcium dependence of the rate of tension redevelopment ktr is explained by transient blocking of RU’s by a temporary decrease in XB-RU effects. PMID:26262582

Technical Report: Evaluation of peripheral dose for flattening filter free photon beams.

PubMed

Covington, E L; Ritter, T A; Moran, J M; Owrangi, A M; Prisciandaro, J I

2016-08-01

To develop a comprehensive peripheral dose (PD) dataset for the two unflattened beams of nominal energy 6 and 10 MV for use in clinical care. Measurements were made in a 40 × 120 × 20 cm(3) (width × length × depth) stack of solid water using an ionization chamber at varying depths (dmax, 5, and 10 cm), field sizes (3 × 3 to 30 × 30 cm(2)), and distances from the field edge (5-40 cm). The effects of the multileaf collimator (MLC) and collimator rotation were also evaluated for a 10 × 10 cm(2) field. Using the same phantom geometry, the accuracy of the analytic anisotropic algorithm (AAA) and Acuros dose calculation algorithm was assessed and compared to the measured values. The PDs for both the 6 flattening filter free (FFF) and 10 FFF photon beams were found to decrease with increasing distance from the radiation field edge and the decreasing field size. The measured PD was observed to be higher for the 6 FFF than for the 10 FFF for all field sizes and depths. The impact of collimator rotation was not found to be clinically significant when used in conjunction with MLCs. AAA and Acuros algorithms both underestimated the PD with average errors of -13.6% and -7.8%, respectively, for all field sizes and depths at distances of 5 and 10 cm from the field edge, but the average error was found to increase to nearly -69% at greater distances. Given the known inaccuracies of peripheral dose calculations, this comprehensive dataset can be used to estimate the out-of-field dose to regions of interest such as organs at risk, electronic implantable devices, and a fetus. While the impact of collimator rotation was not found to significantly decrease PD when used in conjunction with MLCs, results are expected to be machine model and beam energy dependent. It is not recommended to use a treatment planning system to estimate PD due to the underestimation of the out-of-field dose and the inability to calculate dose at extended distances due to the limits of the dose

Application of dual-energy CT to suppression of metal artefact caused by pedicle screw fixation in radiotherapy: a feasibility study using original phantom

NASA Astrophysics Data System (ADS)

Wang, Tianyuan; Ishihara, Takeaki; Kono, Atsushi; Yoshida, Naoki; Akasaka, Hiroaki; Mukumoto, Naritoshi; Yada, Ryuichi; Ejima, Yasuo; Yoshida, Kenji; Miyawaki, Daisuke; Kakutani, Kenichiro; Nishida, Kotaro; Negi, Noriyuki; Minami, Toshiaki; Aoyama, Yuuichi; Takahashi, Satoru; Sasaki, Ryohei

2017-08-01

The objective of the present study was the determination of the potential dosimetric benefits of using metal-artefact-suppressed dual-energy computed tomography (DECT) images for cases involving pedicle screw implants in spinal sites. A heterogeneous spinal phantom was designed for the investigation of the dosimetric effect of the pedicle-screw-related artefacts. The dosimetric comparisons were first performed using a conventional two-directional opposed (AP-PA) plan, and then a volumetric modulated arc therapy (VMAT) plan, which are both used for the treatment of spinal metastases in our institution. The results of Acuros® XB dose-to-medium (Dm) and dose-to-water (Dw) calculations using different imaging options were compared with experimental measurements including the chamber and film dosimetries in the spinal phantom. A dual-energy composition image with a weight factor of  -0.2 and a dual-energy monochromatic image (DEMI) with an energy level of 180 keV were found to have superior abilities for artefact suppression. The Dm calculations revealed greater dosimetric effects of the pedicle screw-related artefacts compared to the Dw calculations. The results of conventional single-energy computed tomography showed that, although the pedicle screws were made from low-Z titanium alloy, the metal artefacts still have dosimetric effects, namely, an average (maximum) Dm error of 4.4% (5.6%) inside the spinal cord for a complex VMAT treatment plan. Our findings indicate that metal-artefact suppression using the proposed DECT (DEMI) approach is promising for improving the dosimetric accuracy near the implants and inside the spinal cord (average (maximum) Dm error of 1.1% (2.0%)).

STAR Algorithm Integration Team - Facilitating operational algorithm development

NASA Astrophysics Data System (ADS)

Mikles, V. J.

2015-12-01

The NOAA/NESDIS Center for Satellite Research and Applications (STAR) provides technical support of the Joint Polar Satellite System (JPSS) algorithm development and integration tasks. Utilizing data from the S-NPP satellite, JPSS generates over thirty Environmental Data Records (EDRs) and Intermediate Products (IPs) spanning atmospheric, ocean, cryosphere, and land weather disciplines. The Algorithm Integration Team (AIT) brings technical expertise and support to product algorithms, specifically in testing and validating science algorithms in a pre-operational environment. The AIT verifies that new and updated algorithms function in the development environment, enforces established software development standards, and ensures that delivered packages are functional and complete. AIT facilitates the development of new JPSS-1 algorithms by implementing a review approach based on the Enterprise Product Lifecycle (EPL) process. Building on relationships established during the S-NPP algorithm development process and coordinating directly with science algorithm developers, the AIT has implemented structured reviews with self-contained document suites. The process has supported algorithm improvements for products such as ozone, active fire, vegetation index, and temperature and moisture profiles.

Image quality comparisons of X-Omat RP, L and B films.

PubMed

Van Dis, M L; Beck, F M

1991-08-01

The Eastman Kodak Company has recently developed a new film, X-Omat B (XB), designed to be interchangeable with X-Omat RP (XRP) film. The manufacturer claims the new film can be manually developed in half the time of other X-Omat films while automatic processing is unchanged. Three X-Omat film types were processed manually or automatically and the image qualities were evaluated. The XRP film had greater contrast than the XB and X-Omat L (XL) films when manually processed, and the XL film showed less contrast than the XB and XRP films when processed automatically. There was no difference in the subjective evaluation of the various film types and processing methods, and the XB film could be interchanged with XRP film in a simulated clinical situation.

Selfish Gene Algorithm Vs Genetic Algorithm: A Review

NASA Astrophysics Data System (ADS)

Ariff, Norharyati Md; Khalid, Noor Elaiza Abdul; Hashim, Rathiah; Noor, Noorhayati Mohamed

2016-11-01

Evolutionary algorithm is one of the algorithms inspired by the nature. Within little more than a decade hundreds of papers have reported successful applications of EAs. In this paper, the Selfish Gene Algorithms (SFGA), as one of the latest evolutionary algorithms (EAs) inspired from the Selfish Gene Theory which is an interpretation of Darwinian Theory ideas from the biologist Richards Dawkins on 1989. In this paper, following a brief introduction to the Selfish Gene Algorithm (SFGA), the chronology of its evolution is presented. It is the purpose of this paper is to present an overview of the concepts of Selfish Gene Algorithm (SFGA) as well as its opportunities and challenges. Accordingly, the history, step involves in the algorithm are discussed and its different applications together with an analysis of these applications are evaluated.

A Dosimetric Evaluation of The Eclipse and Pinnacle Treatment Planning Systems in Treatment of Vertebral Bodies Using IMRT and VMAT with Modeled and Commissioned Flattening Filter Free (FFF) Fields

NASA Astrophysics Data System (ADS)

Ajo, Ramzi, Jr.

Modern treatment planning systems (TPS's) utilize different algorithms in computing dose within the patient medium. The algorithms rely on properly modeled clinical setups in order to perform optimally. Aside from various parameters of the beam, modifiers, such as multileaf collimators (MLC's), must also be modeled properly. That could not be more true today, where dynamic delivery such as intensity modulated radiation therapy (IMRT) and volumetric modulated arc therapy (VMAT) are being increasingly utilized due to their ability to deliver higher dose precisely to the target while sparing more surrounding normal tissue. Two of the most popular TPS's, Pinnacle (Philips) and Eclipse (Varian), were compared, with special emphasis placed on parameterization of the dosimetric leaf gap (DLG) in Eclipse. The DLG is a parameter that accounts for Varian's rounded MLC leaf ends. While Pinnacle accounts for the rounded leaf end by modeling the MLC's, Eclipse uses a measured parameter. This study investigated whether a single value measured DLG is sufficient for dynamic delivery. Using five planning volumes for vertebral body SBRT treatments, each prescribed for 3000 cGy in 5 fractions, an array of 20 treatment plans was generated using varying energies of 6MV-FFF and 10MV-FFF. Treatment techniques consisted of 9-field Step-and-shoot IMRT, and dual-arc VMAT using patient specific optimization criteria in the Pinnacle TPS v9.8. Each plan was normalized to ensure coverage of 3000cGy to 95% of the target volume. The dose was computed in Pinnacle v9.8, with the Collapsed Cone Convolution Superposition algorithm and Eclipse v11, with the Acuros XB algorithm, using a dose grid resolution of 2 mm in both systems. Dose volume histograms (DVH's) were generated for a comparison of max and mean dose to the targets and spinal cord, as well as 95% coverage of the targets and the volume of the spinal cord receiving 14.5 Gy (V14.5). Patient specific quality assurance (PSQA) fields were

An efficient algorithm for function optimization: modified stem cells algorithm

NASA Astrophysics Data System (ADS)

Taherdangkoo, Mohammad; Paziresh, Mahsa; Yazdi, Mehran; Bagheri, Mohammad Hadi

2013-03-01

In this paper, we propose an optimization algorithm based on the intelligent behavior of stem cell swarms in reproduction and self-organization. Optimization algorithms, such as the Genetic Algorithm (GA), Particle Swarm Optimization (PSO) algorithm, Ant Colony Optimization (ACO) algorithm and Artificial Bee Colony (ABC) algorithm, can give solutions to linear and non-linear problems near to the optimum for many applications; however, in some case, they can suffer from becoming trapped in local optima. The Stem Cells Algorithm (SCA) is an optimization algorithm inspired by the natural behavior of stem cells in evolving themselves into new and improved cells. The SCA avoids the local optima problem successfully. In this paper, we have made small changes in the implementation of this algorithm to obtain improved performance over previous versions. Using a series of benchmark functions, we assess the performance of the proposed algorithm and compare it with that of the other aforementioned optimization algorithms. The obtained results prove the superiority of the Modified Stem Cells Algorithm (MSCA).

Sedative and mechanical hypoalgesic effects of butorphanol in xylazine-premedicated donkeys.

PubMed

Lizarraga, I; Castillo-Alcala, F

2015-05-01

Combinations of α2 -adrenoceptor and opioid agonists are commonly used in equids, but little scientific information is available on donkeys. To compare the sedative and hypoalgesic effects of xylazine alone or in combination with different dosages of butorphanol in donkeys. Placebo-controlled, operator-blinded, randomised, crossover, Latin square study. Six donkeys received intravenous normal saline and normal saline (NS-NS); xylazine (0.5 mg/kg bwt) and normal saline (X-NS); xylazine and 10 μg/kg bwt butorphanol (X-B10); xylazine and 20 μg/kg bwt butorphanol (X-B20); xylazine and 30 μg/kg bwt butorphanol (X-B30); and xylazine and 40 μg/kg bwt butorphanol (X-B40). Sedation scores (SS), head height above ground (HHAG) and mechanical nociceptive thresholds (MNT) were assessed before and for 120 min after treatment. Areas under the curve (AUC) values for 0-30, 30-60 and 60-120 min were computed for SS, HHAG and MNT. As appropriate, differences between treatments were analysed using the Friedman test followed by Dunn's test and a repeated measures one-way analysis of variance followed by Tukey's test; significance was set at P<0.05. All treatments apart from NS-NS induced sedation. Butorphanol treatments induced significantly larger SS-AUC0 -30 values than those for NS-NS (P<0.05). Compared to corresponding NS-NS values, HHAG-AUC0 -30 values were significantly smaller for all other treatments (P<0.001) and HHAG-AUC30-60 values were significantly smaller for X-B40 (P<0.05). Compared to NS-NS, all treatments induced mechanical hypoalgesia and yielded significantly larger MNT-AUC0-30 values (P<0.001). Treatment X-NS yielded significantly smaller MNT-AUC0 -30 values than those for X-B30 and X-B40 (P<0.05). Only MNT-AUC30 -60 values for X-B30 and X-B40 were significantly larger than those for NS-NS and X-NS (P<0.05). Sedation and mechanical hypoalgesia induced by xylazine were enhanced by butorphanol at 40 μg/kg bwt. This drug combination may be

Dose-Dependent Effects of the Myosin Activator Omecamtiv Mecarbil on Cross-Bridge Behavior and Force Generation in Failing Human Myocardium.

PubMed

Mamidi, Ranganath; Li, Jiayang; Gresham, Kenneth S; Verma, Sujeet; Doh, Chang Yoon; Li, Amy; Lal, Sean; Dos Remedios, Cristobal G; Stelzer, Julian E

2017-10-01

Omecamtiv mecarbil (OM) enhances systolic function in vivo by directly binding the myosin cross-bridges (XBs) in the sarcomere. However, the mechanistic details governing OM-induced modulation of XB behavior in failing human myocardium are unclear. The effects of OM on steady state and dynamic XB behavior were measured in chemically skinned myocardial preparations isolated from human donor and heart failure (HF) left ventricle. HF myocardium exhibited impaired contractile function as evidenced by reduced maximal force, magnitude of XB recruitment ( P df ), and a slowed rate of XB detachment ( k rel ) at submaximal Ca 2+ activations. Ca 2+ sensitivity of force generation (pCa 50 ) was higher in HF myocardium when compared with donor myocardium, both prior to and after OM incubations. OM incubation (0.5 and 1.0 μmol/L) enhanced force generation at submaximal Ca 2+ activations in a dose-dependent manner. Notably, OM induced a slowing in k rel with 1.0 μmol/L OM but not with 0.5 μmol/L OM in HF myocardium. Additionally, OM exerted other differential effects on XB behavior in HF myocardium as evidenced by a greater enhancement in P df and slowing in the time course of cooperative XB recruitment ( T rec ), which collectively prolonged achievement of peak force development ( T pk ), compared with donor myocardium. Our findings demonstrate that OM augments force generation but also prolongs the time course of XB transitions to force-bearing states in remodeled HF myocardium, which may extend the systolic ejection time in vivo. Optimal OM dosing is critical for eliciting enhanced systolic function without excessive prolongation of systolic ejection time, which may compromise diastolic filling. © 2017 American Heart Association, Inc.

Natural Abundance 15 N and 13 C Solid-State NMR Chemical Shifts: High Sensitivity Probes of the Halogen Bond Geometry.

PubMed

Cerreia Vioglio, Paolo; Catalano, Luca; Vasylyeva, Vera; Nervi, Carlo; Chierotti, Michele R; Resnati, Giuseppe; Gobetto, Roberto; Metrangolo, Pierangelo

2016-11-14

Solid-state nuclear magnetic resonance (SSNMR) spectroscopy is a versatile characterization technique that can provide a plethora of information complementary to single crystal X-ray diffraction (SCXRD) analysis. Herein, we present an experimental and computational investigation of the relationship between the geometry of a halogen bond (XB) and the SSNMR chemical shifts of the non-quadrupolar nuclei either directly involved in the interaction ( 15 N) or covalently bonded to the halogen atom ( 13 C). We have prepared two series of X-bonded co-crystals based upon two different dipyridyl modules, and several halobenzenes and diiodoalkanes, as XB-donors. SCXRD structures of three novel co-crystals between 1,2-bis(4-pyridyl)ethane, and 1,4-diiodobenzene, 1,6-diiodododecafluorohexane, and 1,8-diiodohexadecafluorooctane were obtained. For the first time, the change in the 15 N SSNMR chemical shifts upon XB formation is shown to experimentally correlate with the normalized distance parameter of the XB. The same overall trend is confirmed by density functional theory (DFT) calculations of the chemical shifts. 13 C NQS experiments show a positive, linear correlation between the chemical shifts and the C-I elongation, which is an indirect probe of the strength of the XB. These correlations can be of general utility to estimate the strength of the XB occurring in diverse adducts by using affordable SSNMR analysis. © 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Algorithm for Surface of Translation Attached Radiators (A-STAR). Volume III. Computer Codes.

DTIC Science & Technology

1982-05-01

SEGMENT ARRAYS* C2075 CCPMCN /83jTI 44DDFNPTNBAND C2080 COM MCN IBDT21 N’,RL.YR(831, yS(83)eYS1(82).XB1(82) C2085 COMMON /GOT?/ 14(82)PSVt .12).CVt82 C2090...i a.4 ZZaZ lti 12 )-ZCI CI 10 RH020 . XNXX +VV*VV*ZZ*ZZ 2’ REaS REINZ 4 A3mA IUC 49CEXPI-U*SK*ER R14.IP I RR 8 CEDGE(SOT j-E(OOE(CA IMPEOANCE ELEMENTS...FvAv.S~%Lt IAXpSIIs PINER) 57*f ?C ********* ************* i5?C COM ~PLEX SIFIPSON INTEGRATION RflUTINE.j7 i N E.x,!& pSvsIPK Il~~i Agj:;)2c.19v20 5ON

Denni Algorithm An Enhanced Of SMS (Scan, Move and Sort) Algorithm

NASA Astrophysics Data System (ADS)

Aprilsyah Lubis, Denni; Salim Sitompul, Opim; Marwan; Tulus; Andri Budiman, M.

2017-12-01

Sorting has been a profound area for the algorithmic researchers, and many resources are invested to suggest a more working sorting algorithm. For this purpose many existing sorting algorithms were observed in terms of the efficiency of the algorithmic complexity. Efficient sorting is important to optimize the use of other algorithms that require sorted lists to work correctly. Sorting has been considered as a fundamental problem in the study of algorithms that due to many reasons namely, the necessary to sort information is inherent in many applications, algorithms often use sorting as a key subroutine, in algorithm design there are many essential techniques represented in the body of sorting algorithms, and many engineering issues come to the fore when implementing sorting algorithms., Many algorithms are very well known for sorting the unordered lists, and one of the well-known algorithms that make the process of sorting to be more economical and efficient is SMS (Scan, Move and Sort) algorithm, an enhancement of Quicksort invented Rami Mansi in 2010. This paper presents a new sorting algorithm called Denni-algorithm. The Denni algorithm is considered as an enhancement on the SMS algorithm in average, and worst cases. The Denni algorithm is compared with the SMS algorithm and the results were promising.

Hybrid Cryptosystem Using Tiny Encryption Algorithm and LUC Algorithm

NASA Astrophysics Data System (ADS)

Rachmawati, Dian; Sharif, Amer; Jaysilen; Andri Budiman, Mohammad

2018-01-01

Security becomes a very important issue in data transmission and there are so many methods to make files more secure. One of that method is cryptography. Cryptography is a method to secure file by writing the hidden code to cover the original file. Therefore, if the people do not involve in cryptography, they cannot decrypt the hidden code to read the original file. There are many methods are used in cryptography, one of that method is hybrid cryptosystem. A hybrid cryptosystem is a method that uses a symmetric algorithm to secure the file and use an asymmetric algorithm to secure the symmetric algorithm key. In this research, TEA algorithm is used as symmetric algorithm and LUC algorithm is used as an asymmetric algorithm. The system is tested by encrypting and decrypting the file by using TEA algorithm and using LUC algorithm to encrypt and decrypt the TEA key. The result of this research is by using TEA Algorithm to encrypt the file, the cipher text form is the character from ASCII (American Standard for Information Interchange) table in the form of hexadecimal numbers and the cipher text size increase by sixteen bytes as the plaintext length is increased by eight characters.

Synthesis, crystal structure investigation and magnetism of the complex metal-rich boride series Crx(Rh1-yRuy)7-xB3 (x=0.88-1; y=0-1) with Th7Fe3-type structure

NASA Astrophysics Data System (ADS)

Misse, Patrick R. N.; Mbarki, Mohammed; Fokwa, Boniface P. T.

2012-08-01

Powder samples and single crystals of the new complex boride series Crx(Rh1-yRuy)7-xB3 (x=0.88-1; y=0-1) have been synthesized by arc-melting the elements under purified argon atmosphere on a water-cooled copper crucible. The products, which have metallic luster, were structurally characterized by single-crystal and powder X-ray diffraction as well as EDX measurements. Within the whole solid solution range the hexagonal Th7Fe3 structure type (space group P63mc, no. 186, Z=2) was identified. Single-crystal structure refinement results indicate the presence of chromium at two sites (6c and 2b) of the available three metal Wyckoff sites, with a pronounced preference for the 6c site. An unexpected Rh/Ru site preference was found in the Ru-rich region only, leading to two different magnetic behaviors in the solid solution: The Rh-rich region shows a temperature-independent (Pauli) paramagnetism whereas an additional temperature-dependent paramagnetic component is found in the Ru-rich region.

Genetic algorithms

NASA Technical Reports Server (NTRS)

Wang, Lui; Bayer, Steven E.

1991-01-01

Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.

Algorithm aversion: people erroneously avoid algorithms after seeing them err.

PubMed

Dietvorst, Berkeley J; Simmons, Joseph P; Massey, Cade

2015-02-01

Research shows that evidence-based algorithms more accurately predict the future than do human forecasters. Yet when forecasters are deciding whether to use a human forecaster or a statistical algorithm, they often choose the human forecaster. This phenomenon, which we call algorithm aversion, is costly, and it is important to understand its causes. We show that people are especially averse to algorithmic forecasters after seeing them perform, even when they see them outperform a human forecaster. This is because people more quickly lose confidence in algorithmic than human forecasters after seeing them make the same mistake. In 5 studies, participants either saw an algorithm make forecasts, a human make forecasts, both, or neither. They then decided whether to tie their incentives to the future predictions of the algorithm or the human. Participants who saw the algorithm perform were less confident in it, and less likely to choose it over an inferior human forecaster. This was true even among those who saw the algorithm outperform the human.

The Texas Medication Algorithm Project (TMAP) schizophrenia algorithms.

PubMed

Miller, A L; Chiles, J A; Chiles, J K; Crismon, M L; Rush, A J; Shon, S P

1999-10-01

In the Texas Medication Algorithm Project (TMAP), detailed guidelines for medication management of schizophrenia and related disorders, bipolar disorders, and major depressive disorders have been developed and implemented. This article describes the algorithms developed for medication treatment of schizophrenia and related disorders. The guidelines recommend a sequence of medications and discuss dosing, duration, and switch-over tactics. They also specify response criteria at each stage of the algorithm for both positive and negative symptoms. The rationale and evidence for each aspect of the algorithms are presented.

Algorithm Visualization System for Teaching Spatial Data Algorithms

ERIC Educational Resources Information Center

Nikander, Jussi; Helminen, Juha; Korhonen, Ari

2010-01-01

TRAKLA2 is a web-based learning environment for data structures and algorithms. The system delivers automatically assessed algorithm simulation exercises that are solved using a graphical user interface. In this work, we introduce a novel learning environment for spatial data algorithms, SDA-TRAKLA2, which has been implemented on top of the…

Motion Cueing Algorithm Development: Initial Investigation and Redesign of the Algorithms

NASA Technical Reports Server (NTRS)

Telban, Robert J.; Wu, Weimin; Cardullo, Frank M.; Houck, Jacob A. (Technical Monitor)

2000-01-01

In this project four motion cueing algorithms were initially investigated. The classical algorithm generated results with large distortion and delay and low magnitude. The NASA adaptive algorithm proved to be well tuned with satisfactory performance, while the UTIAS adaptive algorithm produced less desirable results. Modifications were made to the adaptive algorithms to reduce the magnitude of undesirable spikes. The optimal algorithm was found to have the potential for improved performance with further redesign. The center of simulator rotation was redefined. More terms were added to the cost function to enable more tuning flexibility. A new design approach using a Fortran/Matlab/Simulink setup was employed. A new semicircular canals model was incorporated in the algorithm. With these changes results show the optimal algorithm has some advantages over the NASA adaptive algorithm. Two general problems observed in the initial investigation required solutions. A nonlinear gain algorithm was developed that scales the aircraft inputs by a third-order polynomial, maximizing the motion cues while remaining within the operational limits of the motion system. A braking algorithm was developed to bring the simulator to a full stop at its motion limit and later release the brake to follow the cueing algorithm output.

ARC-1969-AAL-1443

NASA Image and Video Library

1941-09-10

XB-32 model wing with 15% chord sealed gap aileron. Flaps extended to 40 degrees. The first wind-tunnel report published by Ames Covered the XB-32 Test in the 7-by-10 No. ! and was authored by Roy P. Jackson and George L. Smith Jr.

A live attenuated BCG vaccine overexpressing multistage antigens Ag85B and HspX provides superior protection against Mycobacterium tuberculosis infection.

PubMed

Yuan, Xuefeng; Teng, Xindong; Jing, Yukai; Ma, Jilei; Tian, Maopeng; Yu, Qi; Zhou, Lei; Wang, Ruibo; Wang, Weihua; Li, Li; Fan, Xionglin

2015-12-01

Tuberculosis (TB) remains one of the most menacing infectious diseases, although attenuated Mycobacterium bovis Bacillus Calmette-Guerin (BCG) vaccine has been widely used to protect children against primary TB. There are increasing evidences that rapid growing and dormant Mycobacterium tuberculosis (M. tuberculosis) coexist in vivo after infection. However, BCG vaccine only elicits cell-mediated immune responses to secretory antigens expressed by rapid growing pathogen. BCG vaccine is thus unable to thwart the reactivation of latent tuberculosis infection (LTBI), and its protection wanes over age after neonatal immunization. In order to extend its ability for a durable protection, a novel recombinant BCG (rBCG) strain, named rBCG::XB, was constructed by overexpressing immunodominant multistage antigens of Ag85B and HspX, which are expressed by both rapid replicating and dormant M. tuberculosis. Long-term protective effect and immunogenicity of rBCG::XB were compared with the parental BCG in vaccinated C57BL/6 mice. Our results demonstrated that rBCG::XB provided the stronger and long-lasting protection against M. tuberculosis H37Rv intranasal infection than BCG. The rBCG::XB not only elicited the more durable multistage antigen-specific CD4(+)Th1-biased immune responses and specific polyfunctional CD4(+)T cells but also augmented the CD8(+) CTL effects against Ag85B in vivo. In particular, higher levels of CD4(+) TEM and CD8(+) TCM cells, dominated by IL2(+) CD4(+) and CD8(+) TCM cells, were obtained in the spleen of rBCG::XB vaccinated mice. Therefore, our findings indicate that rBCG::XB is a promising candidate to improve the efficacy of BCG.

Measurement of Two- and Three-Nucleon Short-Range Correlation Probabilities in Nuclei

NASA Astrophysics Data System (ADS)

Egiyan, K. S.; Dashyan, N. B.; Sargsian, M. M.; Strikman, M. I.; Weinstein, L. B.; Adams, G.; Ambrozewicz, P.; Anghinolfi, M.; Asavapibhop, B.; Asryan, G.; Avakian, H.; Baghdasaryan, H.; Baillie, N.; Ball, J. P.; Baltzell, N. A.; Batourine, V.; Battaglieri, M.; Bedlinskiy, I.; Bektasoglu, M.; Bellis, M.; Benmouna, N.; Biselli, A. S.; Bonner, B. E.; Bouchigny, S.; Boiarinov, S.; Bradford, R.; Branford, D.; Brooks, W. K.; Bültmann, S.; Burkert, V. D.; Bultuceanu, C.; Calarco, J. R.; Careccia, S. L.; Carman, D. S.; Carnahan, B.; Chen, S.; Cole, P. L.; Coltharp, P.; Corvisiero, P.; Crabb, D.; Crannell, H.; Cummings, J. P.; Sanctis, E. De; Devita, R.; Degtyarenko, P. V.; Denizli, H.; Dennis, L.; Dharmawardane, K. V.; Djalali, C.; Dodge, G. E.; Donnelly, J.; Doughty, D.; Dragovitsch, P.; Dugger, M.; Dytman, S.; Dzyubak, O. P.; Egiyan, H.; Elouadrhiri, L.; Empl, A.; Eugenio, P.; Fatemi, R.; Fedotov, G.; Feuerbach, R. J.; Forest, T. A.; Funsten, H.; Gavalian, G.; Gevorgyan, N. G.; Gilfoyle, G. P.; Giovanetti, K. L.; Girod, F. X.; Goetz, J. T.; Golovatch, E.; Gothe, R. W.; Griffioen, K. A.; Guidal, M.; Guillo, M.; Guler, N.; Guo, L.; Gyurjyan, V.; Hadjidakis, C.; Hardie, J.; Hersman, F. W.; Hicks, K.; Hleiqawi, I.; Holtrop, M.; Hu, J.; Huertas, M.; Hyde-Wright, C. E.; Ilieva, Y.; Ireland, D. G.; Ishkhanov, B. S.; Ito, M. M.; Jenkins, D.; Jo, H. S.; Joo, K.; Juengst, H. G.; Kellie, J. D.; Khandaker, M.; Kim, K. Y.; Kim, K.; Kim, W.; Klein, A.; Klein, F. J.; Klimenko, A.; Klusman, M.; Kramer, L. H.; Kubarovsky, V.; Kuhn, J.; Kuhn, S. E.; Kuleshov, S.; Lachniet, J.; Laget, J. M.; Langheinrich, J.; Lawrence, D.; Lee, T.; Livingston, K.; Maximon, L. C.; McAleer, S.; McKinnon, B.; McNabb, J. W.; Mecking, B. A.; Mestayer, M. D.; Meyer, C. A.; Mibe, T.; Mikhailov, K.; Minehart, R.; Mirazita, M.; Miskimen, R.; Mokeev, V.; Morrow, S. A.; Mueller, J.; Mutchler, G. S.; Nadel-Turonski, P.; Napolitano, J.; Nasseripour, R.; Niccolai, S.; Niculescu, G.; Niculescu, I.; Niczyporuk, B. B.; Niyazov, R. A.; O'Rielly, G. V.; Osipenko, M.; Ostrovidov, A. I.; Park, K.; Pasyuk, E.; Peterson, C.; Pierce, J.; Pivnyuk, N.; Pocanic, D.; Pogorelko, O.; Polli, E.; Pozdniakov, S.; Preedom, B. M.; Price, J. W.; Prok, Y.; Protopopescu, D.; Qin, L. M.; Raue, B. A.; Riccardi, G.; Ricco, G.; Ripani, M.; Ritchie, B. G.; Ronchetti, F.; Rosner, G.; Rossi, P.; Rowntree, D.; Rubin, P. D.; Sabatié, F.; Salgado, C.; Santoro, J. P.; Sapunenko, V.; Schumacher, R. A.; Serov, V. S.; Sharabian, Y. G.; Shaw, J.; Smith, E. S.; Smith, L. C.; Sober, D. I.; Stavinsky, A.; Stepanyan, S.; Stokes, B. E.; Stoler, P.; Strauch, S.; Suleiman, R.; Taiuti, M.; Taylor, S.; Tedeschi, D. J.; Thompson, R.; Tkabladze, A.; Tkachenko, S.; Todor, L.; Tur, C.; Ungaro, M.; Vineyard, M. F.; Vlassov, A. V.; Weygand, D. P.; Williams, M.; Wolin, E.; Wood, M. H.; Yegneswaran, A.; Yun, J.; Zana, L.; Zhang, J.

2006-03-01

The ratios of inclusive electron scattering cross sections of 4He, 12C, and 56Fe to 3He have been measured at 1<xB<3. At Q2>1.4 GeV2, the ratios exhibit two separate plateaus, at 1.5<xB<2 and at xB>2.25. This pattern is predicted by models that include 2- and 3-nucleon short-range correlations (SRC). Relative to A=3, the per-nucleon probabilities of 3-nucleon SRC are 2.3, 3.1, and 4.4 times larger for A=4, 12, and 56. This is the first measurement of 3-nucleon SRC probabilities in nuclei.

Evidence for halogen bond covalency in acyclic and interlocked halogen-bonding receptor anion recognition

DOE Office of Scientific and Technical Information (OSTI.GOV)

Robinson, Sean W.; Mustoe, Chantal L.; White, Nicholas G.

The synthesis and anion binding properties of novel halogen-bonding (XB) bis-iodotriazole-pyridinium-containing acyclic and [2]catenane anion host systems are described. The XB acyclic receptor displays selectivity for acetate over halides with enhanced anion recognition properties compared to the analogous hydrogen-bonding (HB) acyclic receptor. A reversal in halide selectivity is observed in the XB [2]catenane, in comparison to the acyclic XB receptor, due to the interlocked host’s unique three-dimensional binding cavity, and no binding is observed for oxoanions. Notable halide anion association constant values determined for the [2]catenane in competitive organic–aqueous solvent mixtures demonstrate considerable enhancement of anion recognition as compared tomore » the HB catenane analogue. X-ray crystallographic analysis of a series of halide catenane complexes reveal strong XB interactions in the solid state. These interactions were studied using Cl and Br K-edge X-ray Absorption Spectroscopy (XAS) indicating intense pre-edge features characteristic of charge transfer from the halide to its bonding partner (σ AX←X–* ← X1s), and providing a direct measure of the degree of covalency in the halogen bond(s). Lastly, the data reveal that the degree of covalency is similar to that which is observed in transition metal coordinate covalent bonds. These results are supported by DFT results, which correlate well with the experimental data.« less

Evidence for halogen bond covalency in acyclic and interlocked halogen-bonding receptor anion recognition

DOE PAGES

Robinson, Sean W.; Mustoe, Chantal L.; White, Nicholas G.; ...

2014-12-05

The synthesis and anion binding properties of novel halogen-bonding (XB) bis-iodotriazole-pyridinium-containing acyclic and [2]catenane anion host systems are described. The XB acyclic receptor displays selectivity for acetate over halides with enhanced anion recognition properties compared to the analogous hydrogen-bonding (HB) acyclic receptor. A reversal in halide selectivity is observed in the XB [2]catenane, in comparison to the acyclic XB receptor, due to the interlocked host’s unique three-dimensional binding cavity, and no binding is observed for oxoanions. Notable halide anion association constant values determined for the [2]catenane in competitive organic–aqueous solvent mixtures demonstrate considerable enhancement of anion recognition as compared tomore » the HB catenane analogue. X-ray crystallographic analysis of a series of halide catenane complexes reveal strong XB interactions in the solid state. These interactions were studied using Cl and Br K-edge X-ray Absorption Spectroscopy (XAS) indicating intense pre-edge features characteristic of charge transfer from the halide to its bonding partner (σ AX←X–* ← X1s), and providing a direct measure of the degree of covalency in the halogen bond(s). Lastly, the data reveal that the degree of covalency is similar to that which is observed in transition metal coordinate covalent bonds. These results are supported by DFT results, which correlate well with the experimental data.« less

Image processing meta-algorithm development via genetic manipulation of existing algorithm graphs

NASA Astrophysics Data System (ADS)

Schalkoff, Robert J.; Shaaban, Khaled M.

1999-07-01

Automatic algorithm generation for image processing applications is not a new idea, however previous work is either restricted to morphological operates or impractical. In this paper, we show recent research result in the development and use of meta-algorithms, i.e. algorithms which lead to new algorithms. Although the concept is generally applicable, the application domain in this work is restricted to image processing. The meta-algorithm concept described in this paper is based upon out work in dynamic algorithm. The paper first present the concept of dynamic algorithms which, on the basis of training and archived algorithmic experience embedded in an algorithm graph (AG), dynamically adjust the sequence of operations applied to the input image data. Each node in the tree-based representation of a dynamic algorithm with out degree greater than 2 is a decision node. At these nodes, the algorithm examines the input data and determines which path will most likely achieve the desired results. This is currently done using nearest-neighbor classification. The details of this implementation are shown. The constrained perturbation of existing algorithm graphs, coupled with a suitable search strategy, is one mechanism to achieve meta-algorithm an doffers rich potential for the discovery of new algorithms. In our work, a meta-algorithm autonomously generates new dynamic algorithm graphs via genetic recombination of existing algorithm graphs. The AG representation is well suited to this genetic-like perturbation, using a commonly- employed technique in artificial neural network synthesis, namely the blueprint representation of graphs. A number of exam. One of the principal limitations of our current approach is the need for significant human input in the learning phase. Efforts to overcome this limitation are discussed. Future research directions are indicated.

Motion Cueing Algorithm Development: Piloted Performance Testing of the Cueing Algorithms

NASA Technical Reports Server (NTRS)

Houck, Jacob A. (Technical Monitor); Telban, Robert J.; Cardullo, Frank M.; Kelly, Lon C.

2005-01-01

The relative effectiveness in simulating aircraft maneuvers with both current and newly developed motion cueing algorithms was assessed with an eleven-subject piloted performance evaluation conducted on the NASA Langley Visual Motion Simulator (VMS). In addition to the current NASA adaptive algorithm, two new cueing algorithms were evaluated: the optimal algorithm and the nonlinear algorithm. The test maneuvers included a straight-in approach with a rotating wind vector, an offset approach with severe turbulence and an on/off lateral gust that occurs as the aircraft approaches the runway threshold, and a takeoff both with and without engine failure after liftoff. The maneuvers were executed with each cueing algorithm with added visual display delay conditions ranging from zero to 200 msec. Two methods, the quasi-objective NASA Task Load Index (TLX), and power spectral density analysis of pilot control, were used to assess pilot workload. Piloted performance parameters for the approach maneuvers, the vertical velocity upon touchdown and the runway touchdown position, were also analyzed but did not show any noticeable difference among the cueing algorithms. TLX analysis reveals, in most cases, less workload and variation among pilots with the nonlinear algorithm. Control input analysis shows pilot-induced oscillations on a straight-in approach were less prevalent compared to the optimal algorithm. The augmented turbulence cues increased workload on an offset approach that the pilots deemed more realistic compared to the NASA adaptive algorithm. The takeoff with engine failure showed the least roll activity for the nonlinear algorithm, with the least rudder pedal activity for the optimal algorithm.

Super-Encryption Implementation Using Monoalphabetic Algorithm and XOR Algorithm for Data Security

NASA Astrophysics Data System (ADS)

Rachmawati, Dian; Andri Budiman, Mohammad; Aulia, Indra

2018-03-01

The exchange of data that occurs offline and online is very vulnerable to the threat of data theft. In general, cryptography is a science and art to maintain data secrecy. An encryption is a cryptography algorithm in which data is transformed into cipher text, which is something that is unreadable and meaningless so it cannot be read or understood by other parties. In super-encryption, two or more encryption algorithms are combined to make it more secure. In this work, Monoalphabetic algorithm and XOR algorithm are combined to form a super- encryption. Monoalphabetic algorithm works by changing a particular letter into a new letter based on existing keywords while the XOR algorithm works by using logic operation XOR Since Monoalphabetic algorithm is a classical cryptographic algorithm and XOR algorithm is a modern cryptographic algorithm, this scheme is expected to be both easy-to-implement and more secure. The combination of the two algorithms is capable of securing the data and restoring it back to its original form (plaintext), so the data integrity is still ensured.

Linear feature detection algorithm for astronomical surveys - I. Algorithm description

NASA Astrophysics Data System (ADS)

Bektešević, Dino; Vinković, Dejan

2017-11-01

Computer vision algorithms are powerful tools in astronomical image analyses, especially when automation of object detection and extraction is required. Modern object detection algorithms in astronomy are oriented towards detection of stars and galaxies, ignoring completely the detection of existing linear features. With the emergence of wide-field sky surveys, linear features attract scientific interest as possible trails of fast flybys of near-Earth asteroids and meteors. In this work, we describe a new linear feature detection algorithm designed specifically for implementation in big data astronomy. The algorithm combines a series of algorithmic steps that first remove other objects (stars and galaxies) from the image and then enhance the line to enable more efficient line detection with the Hough algorithm. The rate of false positives is greatly reduced thanks to a step that replaces possible line segments with rectangles and then compares lines fitted to the rectangles with the lines obtained directly from the image. The speed of the algorithm and its applicability in astronomical surveys are also discussed.

The Orthogonally Partitioned EM Algorithm: Extending the EM Algorithm for Algorithmic Stability and Bias Correction Due to Imperfect Data.

PubMed

Regier, Michael D; Moodie, Erica E M

2016-05-01

We propose an extension of the EM algorithm that exploits the common assumption of unique parameterization, corrects for biases due to missing data and measurement error, converges for the specified model when standard implementation of the EM algorithm has a low probability of convergence, and reduces a potentially complex algorithm into a sequence of smaller, simpler, self-contained EM algorithms. We use the theory surrounding the EM algorithm to derive the theoretical results of our proposal, showing that an optimal solution over the parameter space is obtained. A simulation study is used to explore the finite sample properties of the proposed extension when there is missing data and measurement error. We observe that partitioning the EM algorithm into simpler steps may provide better bias reduction in the estimation of model parameters. The ability to breakdown a complicated problem in to a series of simpler, more accessible problems will permit a broader implementation of the EM algorithm, permit the use of software packages that now implement and/or automate the EM algorithm, and make the EM algorithm more accessible to a wider and more general audience.

Effect of supplementing a fibrous diet with a xylanase and β-glucanase blend on growth performance, intestinal glucose uptake, and transport-associated gene expression in growing pigs.

PubMed

Agyekum, A K; Sands, J S; Regassa, A; Kiarie, E; Weihrauch, D; Kim, W K; Nyachoti, C M

2015-07-01

The present study evaluated supplemental carbohydrase effect on performance, intestinal nutrient uptake, and transporter mRNA expressions in growing pigs offered a high-fiber diet manufactured with distillers dried grains with solubles (DDGS). Twenty-four pigs (22.4 ± 0.7 kg BW) were randomly assigned to 1of 3 nutritionally adequate diets (8 pigs per diet) based on corn and soybean meal (SBM) with either 0 (control) or 30% DDGS (high fiber [HF]). The third diet was supplemented with a xylanase and β-glucanase blend (XB) in addition to the 30% DDGS (HF+XB). Parameters determined were ADFI, ADG, G:F, plasma glucose and plasma urea nitrogen (PUN) concentrations, jejunal tissue electrophysiological properties, and mRNA expressions of the sodium-dependent glucose transport 1 (SGLT1) and cationic AA transporter, bo,+AT, in the jejunal and ileal tissues. In addition, mRNA expressions of the short-chain fatty acid transporters, monocarboxylate transporter 1 (MCT1) and sodium-coupled monocarboxylate transporter, and mucin genes were quantified in the ileum. Feed intake, plasma glucose, and jejunal tissue electrophysiological properties were not affected (P > 0.05) by diet. However, control-fed pigs had superior growth rate and feed efficiency and higher PUN (P < 0.05) than HF- and HF+XB-fed pigs. The HF diet increased (P < 0.05) SGLT1 mRNA expression in the jejunum and decreased (P < 0.05) bo,+ mRNA expression in the ileum. The XB supplementation also increased bo,+ mRNA expression in the ileum relative to HF-fed pigs. Additionally, MCT1 mRNA expression was greater (P < 0.05) in the ileum of the HF- and HF+XB-fed pigs. In the present study, XB supplementation influenced nutrient transporter mRNA expression, although it was not accompanied by improved pig performance.

Functional Properties of Five Dictyostelium discoideum P2X Receptors*

PubMed Central

Baines, Abigail; Parkinson, Katie; Sim, Joan A.; Bragg, Laricia; Thompson, Christopher R. L.; North, R. Alan

2013-01-01

The Dictyostelium discoideum genome encodes five proteins that share weak sequence similarity with vertebrate P2X receptors. Unlike vertebrate P2X receptors, these proteins are not expressed on the surface of cells, but populate the tubules and bladders of the contractile vacuole. In this study, we expressed humanized cDNAs of P2XA, P2XB, P2XC, P2XD, and P2XE in human embryonic kidney cells and altered the ionic and proton environment in an attempt to reflect the situation in amoeba. Recording of whole-cell membrane currents showed that four receptors operated as ATP-gated channels (P2XA, P2XB, P2XD, and P2XE). At P2XA receptors, ATP was the only effective agonist of 17 structurally related putative ligands that were tested. Extracellular sodium, compared with potassium, strongly inhibited ATP responses in P2XB, P2XD, and P2XE receptors. Increasing the proton concentration (pH 6.2) accelerated desensitization at P2XA receptors and decreased currents at P2XD receptors, but increased the currents at P2XB and P2XE receptors. Dictyostelium lacking P2XA receptors showed impaired regulatory volume decrease in hypotonic solution. This phenotype was readily rescued by overexpression of P2XA and P2XD receptors, partially rescued by P2XB and P2XE receptors, and not rescued by P2XC receptors. The failure of the nonfunctional receptor P2XC to restore the regulatory volume decrease highlights the importance of ATP activation of P2X receptors for a normal response to hypo-osmotic shock, and the weak rescue by P2XB and P2XE receptors indicates that there is limited functional redundancy among Dictyostelium P2X receptors. PMID:23740252

Functional properties of five Dictyostelium discoideum P2X receptors.

PubMed

Baines, Abigail; Parkinson, Katie; Sim, Joan A; Bragg, Laricia; Thompson, Christopher R L; North, R Alan

2013-07-19

The Dictyostelium discoideum genome encodes five proteins that share weak sequence similarity with vertebrate P2X receptors. Unlike vertebrate P2X receptors, these proteins are not expressed on the surface of cells, but populate the tubules and bladders of the contractile vacuole. In this study, we expressed humanized cDNAs of P2XA, P2XB, P2XC, P2XD, and P2XE in human embryonic kidney cells and altered the ionic and proton environment in an attempt to reflect the situation in amoeba. Recording of whole-cell membrane currents showed that four receptors operated as ATP-gated channels (P2XA, P2XB, P2XD, and P2XE). At P2XA receptors, ATP was the only effective agonist of 17 structurally related putative ligands that were tested. Extracellular sodium, compared with potassium, strongly inhibited ATP responses in P2XB, P2XD, and P2XE receptors. Increasing the proton concentration (pH 6.2) accelerated desensitization at P2XA receptors and decreased currents at P2XD receptors, but increased the currents at P2XB and P2XE receptors. Dictyostelium lacking P2XA receptors showed impaired regulatory volume decrease in hypotonic solution. This phenotype was readily rescued by overexpression of P2XA and P2XD receptors, partially rescued by P2XB and P2XE receptors, and not rescued by P2XC receptors. The failure of the nonfunctional receptor P2XC to restore the regulatory volume decrease highlights the importance of ATP activation of P2X receptors for a normal response to hypo-osmotic shock, and the weak rescue by P2XB and P2XE receptors indicates that there is limited functional redundancy among Dictyostelium P2X receptors.

Monte Carlo Investigation on the Effect of Heterogeneities on Strut Adjusted Volume Implant (SAVI) Dosimetry

NASA Astrophysics Data System (ADS)

Koontz, Craig

Breast cancer is the most prevalent cancer for women with more than 225,000 new cases diagnosed in the United States in 2012 (ACS, 2012). With the high prevalence, comes an increased emphasis on researching new techniques to treat this disease. Accelerated partial breast irradiation (APBI) has been used as an alternative to whole breast irradiation (WBI) in order to treat occult disease after lumpectomy. Similar recurrence rates have been found using ABPI after lumpectomy as with mastectomy alone, but with the added benefit of improved cosmetic and psychological results. Intracavitary brachytherapy devices have been used to deliver the APBI prescription. However, inability to produce asymmetric dose distributions in order to avoid overdosing skin and chest wall has been an issue with these devices. Multi-lumen devices were introduced to overcome this problem. Of these, the Strut-Adjusted Volume Implant (SAVI) has demonstrated the greatest ability to produce an asymmetric dose distribution, which would have greater ability to avoid skin and chest wall dose, and thus allow more women to receive this type of treatment. However, SAVI treatments come with inherent heterogeneities including variable backscatter due to the proximity to the tissue-air and tissue-lung interfaces and variable contents within the cavity created by the SAVI. The dose calculation protocol based on TG-43 does not account for heterogeneities and thus will not produce accurate dosimetry; however Acuros, a model-based dose calculation algorithm manufactured by Varian Medical Systems, claims to accurately account for heterogeneities. Monte Carlo simulation can calculate the dosimetry with high accuracy. In this thesis, a model of the SAVI will be created for Monte Carlo, specifically using MCNP code, in order to explore the affects of heterogeneities on the dose distribution. This data will be compared to TG-43 and Acuros calculated dosimetry to explore their accuracy.

SU-E-T-791: Validation of a Determinant Based Photon Transport Solver in Dose Perturbed By Diverse Media

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kuo, H; Tome, W; Yaparpalvi, R

Purpose: To validate a determinant based photon transport solver in dose imparted within different transition zone between different medium. Methods: Thickness (.2cm,.5cm, 1cm, 3cm) from various materials (Air - density=0.0012g/cm3, Cork-0.19g/cm3, Lung-0.26g/cm3, Bone-1.85g/cm3, Aluminum (Al)-2.7g/cm3, Titanium (Ti)-4.42g/cm3, Iron (Fe)-8g/cm3) were sandwiched by 10cm solid water. 6MV were used to study the calculation difference between a superposition photon beam model (AAA) and the determinant based Boltzmann photon transport solver (XB) at the upstream (I) and downstream boarder (II) of the medium, within the medium (III), and at far distance downstream away from medium (IV). Calculation was validated with available thickness ofmore » Air, Cork, Lung, Al, Ti and Fe. Results are presented as the ratio of the dose at the point with medium perturbation to the same point dose without perturbation. Results: Zone I showed different backscatter enhancement from high-density materials within the 5mm of the upstream border. AAA showed no backscatter at all, XB showed good agreement beyond 1mm upstream (1.18 vs 1.14, 1.09 vs 1.10, and 1.04 vs 1.05 for Fe, Ti, and Fe, respectively). Zone II showed a re-buildup after exiting high-density medium and Air but no build up for density close to water in both of the measurement and XB. AAA yielded the opposite results in Zone II. XB and AAA showed in Zone III very different absorption in high density medium and the Air. XB and measurement had high concordance regarding photon attenuation in Zone IV. AAA showed less agreement especially when the medium was Air or Fe. Conclusion: XB compared well with measurement in regions 1mm away from the interface. Planning using XB should be beneficial for External Beam Planning in situations with large air cavity, very low lung density, compact bone, and any kind of metal implant.« less

Algorithm improvement program nuclide identification algorithm scoring criteria and scoring application.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Enghauser, Michael

2016-02-01

The goal of the Domestic Nuclear Detection Office (DNDO) Algorithm Improvement Program (AIP) is to facilitate gamma-radiation detector nuclide identification algorithm development, improvement, and validation. Accordingly, scoring criteria have been developed to objectively assess the performance of nuclide identification algorithms. In addition, a Microsoft Excel spreadsheet application for automated nuclide identification scoring has been developed. This report provides an overview of the equations, nuclide weighting factors, nuclide equivalencies, and configuration weighting factors used by the application for scoring nuclide identification algorithm performance. Furthermore, this report presents a general overview of the nuclide identification algorithm scoring application including illustrative examples.

Multimodal optimization by using hybrid of artificial bee colony algorithm and BFGS algorithm

NASA Astrophysics Data System (ADS)

Anam, S.

2017-10-01

Optimization has become one of the important fields in Mathematics. Many problems in engineering and science can be formulated into optimization problems. They maybe have many local optima. The optimization problem with many local optima, known as multimodal optimization problem, is how to find the global solution. Several metaheuristic methods have been proposed to solve multimodal optimization problems such as Particle Swarm Optimization (PSO), Genetics Algorithm (GA), Artificial Bee Colony (ABC) algorithm, etc. The performance of the ABC algorithm is better than or similar to those of other population-based algorithms with the advantage of employing a fewer control parameters. The ABC algorithm also has the advantages of strong robustness, fast convergence and high flexibility. However, it has the disadvantages premature convergence in the later search period. The accuracy of the optimal value cannot meet the requirements sometimes. Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm is a good iterative method for finding a local optimum. Compared with other local optimization methods, the BFGS algorithm is better. Based on the advantages of the ABC algorithm and the BFGS algorithm, this paper proposes a hybrid of the artificial bee colony algorithm and the BFGS algorithm to solve the multimodal optimization problem. The first step is that the ABC algorithm is run to find a point. In the second step is that the point obtained by the first step is used as an initial point of BFGS algorithm. The results show that the hybrid method can overcome from the basic ABC algorithm problems for almost all test function. However, if the shape of function is flat, the proposed method cannot work well.

Adaptive cockroach swarm algorithm

NASA Astrophysics Data System (ADS)

Obagbuwa, Ibidun C.; Abidoye, Ademola P.

2017-07-01

An adaptive cockroach swarm optimization (ACSO) algorithm is proposed in this paper to strengthen the existing cockroach swarm optimization (CSO) algorithm. The ruthless component of CSO algorithm is modified by the employment of blend crossover predator-prey evolution method which helps algorithm prevent any possible population collapse, maintain population diversity and create adaptive search in each iteration. The performance of the proposed algorithm on 16 global optimization benchmark function problems was evaluated and compared with the existing CSO, cuckoo search, differential evolution, particle swarm optimization and artificial bee colony algorithms.

Parallel consistent labeling algorithms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Samal, A.; Henderson, T.

Mackworth and Freuder have analyzed the time complexity of several constraint satisfaction algorithms. Mohr and Henderson have given new algorithms, AC-4 and PC-3, for arc and path consistency, respectively, and have shown that the arc consistency algorithm is optimal in time complexity and of the same order space complexity as the earlier algorithms. In this paper, they give parallel algorithms for solving node and arc consistency. They show that any parallel algorithm for enforcing arc consistency in the worst case must have O(na) sequential steps, where n is number of nodes, and a is the number of labels per node.more » They give several parallel algorithms to do arc consistency. It is also shown that they all have optimal time complexity. The results of running the parallel algorithms on a BBN Butterfly multiprocessor are also presented.« less

Algorithm That Synthesizes Other Algorithms for Hashing

NASA Technical Reports Server (NTRS)

James, Mark

2010-01-01

An algorithm that includes a collection of several subalgorithms has been devised as a means of synthesizing still other algorithms (which could include computer code) that utilize hashing to determine whether an element (typically, a number or other datum) is a member of a set (typically, a list of numbers). Each subalgorithm synthesizes an algorithm (e.g., a block of code) that maps a static set of key hashes to a somewhat linear monotonically increasing sequence of integers. The goal in formulating this mapping is to cause the length of the sequence thus generated to be as close as practicable to the original length of the set and thus to minimize gaps between the elements. The advantage of the approach embodied in this algorithm is that it completely avoids the traditional approach of hash-key look-ups that involve either secondary hash generation and look-up or further searching of a hash table for a desired key in the event of collisions. This algorithm guarantees that it will never be necessary to perform a search or to generate a secondary key in order to determine whether an element is a member of a set. This algorithm further guarantees that any algorithm that it synthesizes can be executed in constant time. To enforce these guarantees, the subalgorithms are formulated to employ a set of techniques, each of which works very effectively covering a certain class of hash-key values. These subalgorithms are of two types, summarized as follows: Given a list of numbers, try to find one or more solutions in which, if each number is shifted to the right by a constant number of bits and then masked with a rotating mask that isolates a set of bits, a unique number is thereby generated. In a variant of the foregoing procedure, omit the masking. Try various combinations of shifting, masking, and/or offsets until the solutions are found. From the set of solutions, select the one that provides the greatest compression for the representation and is executable in the

Strategic Control Algorithm Development : Volume 3. Strategic Algorithm Report.

DOT National Transportation Integrated Search

1974-08-01

The strategic algorithm report presents a detailed description of the functional basic strategic control arrival algorithm. This description is independent of a particular computer or language. Contained in this discussion are the geometrical and env...

Quick fuzzy backpropagation algorithm.

PubMed

Nikov, A; Stoeva, S

2001-03-01

A modification of the fuzzy backpropagation (FBP) algorithm called QuickFBP algorithm is proposed, where the computation of the net function is significantly quicker. It is proved that the FBP algorithm is of exponential time complexity, while the QuickFBP algorithm is of polynomial time complexity. Convergence conditions of the QuickFBP, resp. the FBP algorithm are defined and proved for: (1) single output neural networks in case of training patterns with different targets; and (2) multiple output neural networks in case of training patterns with equivalued target vector. They support the automation of the weights training process (quasi-unsupervised learning) establishing the target value(s) depending on the network's input values. In these cases the simulation results confirm the convergence of both algorithms. An example with a large-sized neural network illustrates the significantly greater training speed of the QuickFBP rather than the FBP algorithm. The adaptation of an interactive web system to users on the basis of the QuickFBP algorithm is presented. Since the QuickFBP algorithm ensures quasi-unsupervised learning, this implies its broad applicability in areas of adaptive and adaptable interactive systems, data mining, etc. applications.

Algorithm Improvement Program Nuclide Identification Algorithm Scoring Criteria And Scoring Application - DNDO.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Enghauser, Michael

2015-02-01

The goal of the Domestic Nuclear Detection Office (DNDO) Algorithm Improvement Program (AIP) is to facilitate gamma-radiation detector nuclide identification algorithm development, improvement, and validation. Accordingly, scoring criteria have been developed to objectively assess the performance of nuclide identification algorithms. In addition, a Microsoft Excel spreadsheet application for automated nuclide identification scoring has been developed. This report provides an overview of the equations, nuclide weighting factors, nuclide equivalencies, and configuration weighting factors used by the application for scoring nuclide identification algorithm performance. Furthermore, this report presents a general overview of the nuclide identification algorithm scoring application including illustrative examples.

Improved multivariate polynomial factoring algorithm

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wang, P.S.

1978-10-01

A new algorithm for factoring multivariate polynomials over the integers based on an algorithm by Wang and Rothschild is described. The new algorithm has improved strategies for dealing with the known problems of the original algorithm, namely, the leading coefficient problem, the bad-zero problem and the occurrence of extraneous factors. It has an algorithm for correctly predetermining leading coefficients of the factors. A new and efficient p-adic algorithm named EEZ is described. Bascially it is a linearly convergent variable-by-variable parallel construction. The improved algorithm is generally faster and requires less store then the original algorithm. Machine examples with comparative timingmore » are included.« less

Algorithmic and user study of an autocompletion algorithm on a large medical vocabulary.

PubMed

Sevenster, Merlijn; van Ommering, Rob; Qian, Yuechen

2012-02-01

Autocompletion supports human-computer interaction in software applications that let users enter textual data. We will be inspired by the use case in which medical professionals enter ontology concepts, catering the ongoing demand for structured and standardized data in medicine. Goal is to give an algorithmic analysis of one particular autocompletion algorithm, called multi-prefix matching algorithm, which suggests terms whose words' prefixes contain all words in the string typed by the user, e.g., in this sense, opt ner me matches optic nerve meningioma. Second we aim to investigate how well it supports users entering concepts from a large and comprehensive medical vocabulary (snomed ct). We give a concise description of the multi-prefix algorithm, and sketch how it can be optimized to meet required response time. Performance will be compared to a baseline algorithm, which gives suggestions that extend the string typed by the user to the right, e.g. optic nerve m gives optic nerve meningioma, but opt ner me does not. We conduct a user experiment in which 12 participants are invited to complete 40 snomed ct terms with the baseline algorithm and another set of 40 snomed ct terms with the multi-prefix algorithm. Our results show that users need significantly fewer keystrokes when supported by the multi-prefix algorithm than when supported by the baseline algorithm. The proposed algorithm is a competitive candidate for searching and retrieving terms from a large medical ontology. Copyright © 2011 Elsevier Inc. All rights reserved.

Optimal Fungal Space Searching Algorithms.

PubMed

Asenova, Elitsa; Lin, Hsin-Yu; Fu, Eileen; Nicolau, Dan V; Nicolau, Dan V

2016-10-01

Previous experiments have shown that fungi use an efficient natural algorithm for searching the space available for their growth in micro-confined networks, e.g., mazes. This natural "master" algorithm, which comprises two "slave" sub-algorithms, i.e., collision-induced branching and directional memory, has been shown to be more efficient than alternatives, with one, or the other, or both sub-algorithms turned off. In contrast, the present contribution compares the performance of the fungal natural algorithm against several standard artificial homologues. It was found that the space-searching fungal algorithm consistently outperforms uninformed algorithms, such as Depth-First-Search (DFS). Furthermore, while the natural algorithm is inferior to informed ones, such as A*, this under-performance does not importantly increase with the increase of the size of the maze. These findings suggest that a systematic effort of harvesting the natural space searching algorithms used by microorganisms is warranted and possibly overdue. These natural algorithms, if efficient, can be reverse-engineered for graph and tree search strategies.

On factoring RSA modulus using random-restart hill-climbing algorithm and Pollard’s rho algorithm

NASA Astrophysics Data System (ADS)

Budiman, M. A.; Rachmawati, D.

2017-12-01

The security of the widely-used RSA public key cryptography algorithm depends on the difficulty of factoring a big integer into two large prime numbers. For many years, the integer factorization problem has been intensively and extensively studied in the field of number theory. As a result, a lot of deterministic algorithms such as Euler’s algorithm, Kraitchik’s, and variants of Pollard’s algorithms have been researched comprehensively. Our study takes a rather uncommon approach: rather than making use of intensive number theories, we attempt to factorize RSA modulus n by using random-restart hill-climbing algorithm, which belongs the class of metaheuristic algorithms. The factorization time of RSA moduli with different lengths is recorded and compared with the factorization time of Pollard’s rho algorithm, which is a deterministic algorithm. Our experimental results indicates that while random-restart hill-climbing algorithm is an acceptable candidate to factorize smaller RSA moduli, the factorization speed is much slower than that of Pollard’s rho algorithm.

Bottom-Up Evaluation of Twig Join Pattern Queries in XML Document Databases

NASA Astrophysics Data System (ADS)

Chen, Yangjun

Since the extensible markup language XML emerged as a new standard for information representation and exchange on the Internet, the problem of storing, indexing, and querying XML documents has been among the major issues of database research. In this paper, we study the twig pattern matching and discuss a new algorithm for processing ordered twig pattern queries. The time complexity of the algorithmis bounded by O(|D|·|Q| + |T|·leaf Q ) and its space overhead is by O(leaf T ·leaf Q ), where T stands for a document tree, Q for a twig pattern and D is a largest data stream associated with a node q of Q, which contains the database nodes that match the node predicate at q. leaf T (leaf Q ) represents the number of the leaf nodes of T (resp. Q). In addition, the algorithm can be adapted to an indexing environment with XB-trees being used.

A Modified Decision Tree Algorithm Based on Genetic Algorithm for Mobile User Classification Problem

PubMed Central

Liu, Dong-sheng; Fan, Shu-jiang

2014-01-01

In order to offer mobile customers better service, we should classify the mobile user firstly. Aimed at the limitations of previous classification methods, this paper puts forward a modified decision tree algorithm for mobile user classification, which introduced genetic algorithm to optimize the results of the decision tree algorithm. We also take the context information as a classification attributes for the mobile user and we classify the context into public context and private context classes. Then we analyze the processes and operators of the algorithm. At last, we make an experiment on the mobile user with the algorithm, we can classify the mobile user into Basic service user, E-service user, Plus service user, and Total service user classes and we can also get some rules about the mobile user. Compared to C4.5 decision tree algorithm and SVM algorithm, the algorithm we proposed in this paper has higher accuracy and more simplicity. PMID:24688389

Genetic Algorithms and Local Search

NASA Technical Reports Server (NTRS)

Whitley, Darrell

1996-01-01

The first part of this presentation is a tutorial level introduction to the principles of genetic search and models of simple genetic algorithms. The second half covers the combination of genetic algorithms with local search methods to produce hybrid genetic algorithms. Hybrid algorithms can be modeled within the existing theoretical framework developed for simple genetic algorithms. An application of a hybrid to geometric model matching is given. The hybrid algorithm yields results that improve on the current state-of-the-art for this problem.

The Texas Medication Algorithm Project antipsychotic algorithm for schizophrenia: 2003 update.

PubMed

Miller, Alexander L; Hall, Catherine S; Buchanan, Robert W; Buckley, Peter F; Chiles, John A; Conley, Robert R; Crismon, M Lynn; Ereshefsky, Larry; Essock, Susan M; Finnerty, Molly; Marder, Stephen R; Miller, Del D; McEvoy, Joseph P; Rush, A John; Saeed, Sy A; Schooler, Nina R; Shon, Steven P; Stroup, Scott; Tarin-Godoy, Bernardo

2004-04-01

The Texas Medication Algorithm Project (TMAP) has been a public-academic collaboration in which guidelines for medication treatment of schizophrenia, bipolar disorder, and major depressive disorder were used in selected public outpatient clinics in Texas. Subsequently, these algorithms were implemented throughout Texas and are being used in other states. Guidelines require updating when significant new evidence emerges; the antipsychotic algorithm for schizophrenia was last updated in 1999. This article reports the recommendations developed in 2002 and 2003 by a group of experts, clinicians, and administrators. A conference in January 2002 began the update process. Before the conference, experts in the pharmacologic treatment of schizophrenia, clinicians, and administrators reviewed literature topics and prepared presentations. Topics included ziprasidone's inclusion in the algorithm, the number of antipsychotics tried before clozapine, and the role of first generation antipsychotics. Data were rated according to Agency for Healthcare Research and Quality criteria. After discussing the presentations, conference attendees arrived at consensus recommendations. Consideration of aripiprazole's inclusion was subsequently handled by electronic communications. The antipsychotic algorithm for schizophrenia was updated to include ziprasidone and aripiprazole among the first-line agents. Relative to the prior algorithm, the number of stages before clozapine was reduced. First generation antipsychotics were included but not as first-line choices. For patients refusing or not responding to clozapine and clozapine augmentation, preference was given to trying monotherapy with another antipsychotic before resorting to antipsychotic combinations. Consensus on algorithm revisions was achieved, but only further well-controlled research will answer many key questions about sequence and type of medication treatments of schizophrenia.

Accurate Finite Difference Algorithms

NASA Technical Reports Server (NTRS)

Goodrich, John W.

1996-01-01

Two families of finite difference algorithms for computational aeroacoustics are presented and compared. All of the algorithms are single step explicit methods, they have the same order of accuracy in both space and time, with examples up to eleventh order, and they have multidimensional extensions. One of the algorithm families has spectral like high resolution. Propagation with high order and high resolution algorithms can produce accurate results after O(10(exp 6)) periods of propagation with eight grid points per wavelength.

JPSS Cryosphere Algorithms: Integration and Testing in Algorithm Development Library (ADL)

NASA Astrophysics Data System (ADS)

Tsidulko, M.; Mahoney, R. L.; Meade, P.; Baldwin, D.; Tschudi, M. A.; Das, B.; Mikles, V. J.; Chen, W.; Tang, Y.; Sprietzer, K.; Zhao, Y.; Wolf, W.; Key, J.

2014-12-01

JPSS is a next generation satellite system that is planned to be launched in 2017. The satellites will carry a suite of sensors that are already on board the Suomi National Polar-orbiting Partnership (S-NPP) satellite. The NOAA/NESDIS/STAR Algorithm Integration Team (AIT) works within the Algorithm Development Library (ADL) framework which mimics the operational JPSS Interface Data Processing Segment (IDPS). The AIT contributes in development, integration and testing of scientific algorithms employed in the IDPS. This presentation discusses cryosphere related activities performed in ADL. The addition of a new ancillary data set - NOAA Global Multisensor Automated Snow/Ice data (GMASI) - with ADL code modifications is described. Preliminary GMASI impact on the gridded Snow/Ice product is estimated. Several modifications to the Ice Age algorithm that demonstrates mis-classification of ice type for certain areas/time periods are tested in the ADL. Sensitivity runs for day time, night time and terminator zone are performed and presented. Comparisons between the original and modified versions of the Ice Age algorithm are also presented.

Algorithm-development activities

NASA Technical Reports Server (NTRS)

Carder, Kendall L.

1994-01-01

The task of algorithm-development activities at USF continues. The algorithm for determining chlorophyll alpha concentration, (Chl alpha) and gelbstoff absorption coefficient for SeaWiFS and MODIS-N radiance data is our current priority.

Theoretic derivation of directed acyclic subgraph algorithm and comparisons with message passing algorithm

NASA Astrophysics Data System (ADS)

Ha, Jeongmok; Jeong, Hong

2016-07-01

This study investigates the directed acyclic subgraph (DAS) algorithm, which is used to solve discrete labeling problems much more rapidly than other Markov-random-field-based inference methods but at a competitive accuracy. However, the mechanism by which the DAS algorithm simultaneously achieves competitive accuracy and fast execution speed, has not been elucidated by a theoretical derivation. We analyze the DAS algorithm by comparing it with a message passing algorithm. Graphical models, inference methods, and energy-minimization frameworks are compared between DAS and message passing algorithms. Moreover, the performances of DAS and other message passing methods [sum-product belief propagation (BP), max-product BP, and tree-reweighted message passing] are experimentally compared.

A Winner Determination Algorithm for Combinatorial Auctions Based on Hybrid Artificial Fish Swarm Algorithm

NASA Astrophysics Data System (ADS)

Zheng, Genrang; Lin, ZhengChun

The problem of winner determination in combinatorial auctions is a hotspot electronic business, and a NP hard problem. A Hybrid Artificial Fish Swarm Algorithm(HAFSA), which is combined with First Suite Heuristic Algorithm (FSHA) and Artificial Fish Swarm Algorithm (AFSA), is proposed to solve the problem after probing it base on the theories of AFSA. Experiment results show that the HAFSA is a rapidly and efficient algorithm for The problem of winner determining. Compared with Ant colony Optimization Algorithm, it has a good performance with broad and prosperous application.

A review on quantum search algorithms

NASA Astrophysics Data System (ADS)

Giri, Pulak Ranjan; Korepin, Vladimir E.

2017-12-01

The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It is evident from the early invented quantum algorithms such as Deutsch's algorithm, Deutsch-Jozsa algorithm and its variation as Bernstein-Vazirani algorithm, Simon algorithm, Shor's algorithms, etc. Quantum parallelism also significantly speeds up the database search algorithm, which is important in computer science because it comes as a subroutine in many important algorithms. Quantum database search of Grover achieves the task of finding the target element in an unsorted database in a time quadratically faster than the classical computer. We review Grover's quantum search algorithms for a singe and multiple target elements in a database. The partial search algorithm of Grover and Radhakrishnan and its optimization by Korepin called GRK algorithm are also discussed.

Optimization Of Feature Weight TheVoting Feature Intervals 5 Algorithm Using Partical Swarm Optimization Algorithm

NASA Astrophysics Data System (ADS)

Hayana Hasibuan, Eka; Mawengkang, Herman; Efendi, Syahril

2017-12-01

The use of Partical Swarm Optimization Algorithm in this research is to optimize the feature weights on the Voting Feature Interval 5 algorithm so that we can find the model of using PSO algorithm with VFI 5. Optimization of feature weight on Diabetes or Dyspesia data is considered important because it is very closely related to the livelihood of many people, so if there is any inaccuracy in determining the most dominant feature weight in the data will cause death. Increased accuracy by using PSO Algorithm ie fold 1 from 92.31% to 96.15% increase accuracy of 3.8%, accuracy of fold 2 on Algorithm VFI5 of 92.52% as well as generated on PSO Algorithm means accuracy fixed, then in fold 3 increase accuracy of 85.19% Increased to 96.29% Accuracy increased by 11%. The total accuracy of all three trials increased by 14%. In general the Partical Swarm Optimization algorithm has succeeded in increasing the accuracy to several fold, therefore it can be concluded the PSO algorithm is well used in optimizing the VFI5 Classification Algorithm.

Artifact removal algorithms for stroke detection using a multistatic MIST beamforming algorithm.

PubMed

Ricci, E; Di Domenico, S; Cianca, E; Rossi, T

2015-01-01

Microwave imaging (MWI) has been recently proved as a promising imaging modality for low-complexity, low-cost and fast brain imaging tools, which could play a fundamental role to efficiently manage emergencies related to stroke and hemorrhages. This paper focuses on the UWB radar imaging approach and in particular on the processing algorithms of the backscattered signals. Assuming the use of the multistatic version of the MIST (Microwave Imaging Space-Time) beamforming algorithm, developed by Hagness et al. for the early detection of breast cancer, the paper proposes and compares two artifact removal algorithms. Artifacts removal is an essential step of any UWB radar imaging system and currently considered artifact removal algorithms have been shown not to be effective in the specific scenario of brain imaging. First of all, the paper proposes modifications of a known artifact removal algorithm. These modifications are shown to be effective to achieve good localization accuracy and lower false positives. However, the main contribution is the proposal of an artifact removal algorithm based on statistical methods, which allows to achieve even better performance but with much lower computational complexity.

Portfolios of quantum algorithms.

PubMed

Maurer, S M; Hogg, T; Huberman, B A

2001-12-17

Quantum computation holds promise for the solution of many intractable problems. However, since many quantum algorithms are stochastic in nature they can find the solution of hard problems only probabilistically. Thus the efficiency of the algorithms has to be characterized by both the expected time to completion and the associated variance. In order to minimize both the running time and its uncertainty, we show that portfolios of quantum algorithms analogous to those of finance can outperform single algorithms when applied to the NP-complete problems such as 3-satisfiability.

DNABIT Compress - Genome compression algorithm.

PubMed

Rajarajeswari, Pothuraju; Apparao, Allam

2011-01-22

Data compression is concerned with how information is organized in data. Efficient storage means removal of redundancy from the data being stored in the DNA molecule. Data compression algorithms remove redundancy and are used to understand biologically important molecules. We present a compression algorithm, "DNABIT Compress" for DNA sequences based on a novel algorithm of assigning binary bits for smaller segments of DNA bases to compress both repetitive and non repetitive DNA sequence. Our proposed algorithm achieves the best compression ratio for DNA sequences for larger genome. Significantly better compression results show that "DNABIT Compress" algorithm is the best among the remaining compression algorithms. While achieving the best compression ratios for DNA sequences (Genomes),our new DNABIT Compress algorithm significantly improves the running time of all previous DNA compression programs. Assigning binary bits (Unique BIT CODE) for (Exact Repeats, Reverse Repeats) fragments of DNA sequence is also a unique concept introduced in this algorithm for the first time in DNA compression. This proposed new algorithm could achieve the best compression ratio as much as 1.58 bits/bases where the existing best methods could not achieve a ratio less than 1.72 bits/bases.

File text security using Hybrid Cryptosystem with Playfair Cipher Algorithm and Knapsack Naccache-Stern Algorithm

NASA Astrophysics Data System (ADS)

Amalia; Budiman, M. A.; Sitepu, R.

2018-03-01

Cryptography is one of the best methods to keep the information safe from security attack by unauthorized people. At present, Many studies had been done by previous researchers to generate a more robust cryptographic algorithm to provide high security for data communication. To strengthen data security, one of the methods is hybrid cryptosystem method that combined symmetric and asymmetric algorithm. In this study, we observed a hybrid cryptosystem method contain Modification Playfair Cipher 16x16 algorithm as a symmetric algorithm and Knapsack Naccache-Stern as an asymmetric algorithm. We observe a running time of this hybrid algorithm with some of the various experiments. We tried different amount of characters to be tested which are 10, 100, 1000, 10000 and 100000 characters and we also examined the algorithm with various key’s length which are 10, 20, 30, 40 of key length. The result of our study shows that the processing time for encryption and decryption process each algorithm is linearly proportional, it means the longer messages character then, the more significant times needed to encrypt and decrypt the messages. The encryption running time of Knapsack Naccache-Stern algorithm takes a longer time than its decryption, while the encryption running time of modification Playfair Cipher 16x16 algorithm takes less time than its decryption.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Thomas, S; Yuen, C; Huang, V

Purpose: In this abstract we implement and validate a 4D VMAT Acuros XB dose calculation using Gafchromic film. Special attention is paid to the physical material assignment in the CT dataset and to reported dose to water and dose to medium. Methods: A QUASAR phantom with a 3 cm sinusoidal tumor motion and 5 second period was scanned using 4D computed tomography. A CT was also obtained of the static QUASAR phantom with the tumor at the central position. A VMAT plan was created on the average CT dataset and was delivered on a Varian TrueBeam linear accelerator. The trajectorymore » log file from this treatment was acquired and used to create 10 VMAT subplans (one for each portion of the breathing cycle). Motion for each subplan was simulated by moving the beam isocentre in the superior/inferior direction in the Treatment Planning System on the static CT scan. The 10 plans were calculated (both dose to medium and dose to water) and summed for 1) the original HU values from the static CT scan and 2) the correct physical material assignment in the CT dataset. To acquire a breathing phase synchronized film measurements the trajectory log was used to create a VMAT delivery plan which includes dynamic couch motion using the Developer Mode. Three different treatment start phases were investigated (mid inhalation, full inhalation and full exhalation). Results: For each scenario the coronal dose distributions were measured using Gafchromic film and compared to the corresponding calculation with Film QA Pro Software using a Gamma test with a 3%/3mm distance to agreement criteria. Good agreement was found between calculation and measurement. No statistically significant difference in agreement was found between calculations to original HU values vs calculations to over-written (material-assigned) HU values. Conclusion: The investigated 4D dose calculation method agrees well with measurement.« less

The global Minmax k-means algorithm.

PubMed

Wang, Xiaoyan; Bai, Yanping

2016-01-01

The global k -means algorithm is an incremental approach to clustering that dynamically adds one cluster center at a time through a deterministic global search procedure from suitable initial positions, and employs k -means to minimize the sum of the intra-cluster variances. However the global k -means algorithm sometimes results singleton clusters and the initial positions sometimes are bad, after a bad initialization, poor local optimal can be easily obtained by k -means algorithm. In this paper, we modified the global k -means algorithm to eliminate the singleton clusters at first, and then we apply MinMax k -means clustering error method to global k -means algorithm to overcome the effect of bad initialization, proposed the global Minmax k -means algorithm. The proposed clustering method is tested on some popular data sets and compared to the k -means algorithm, the global k -means algorithm and the MinMax k -means algorithm. The experiment results show our proposed algorithm outperforms other algorithms mentioned in the paper.

Algorithmic Coordination in Robotic Networks

DTIC Science & Technology

2010-11-29

appropriate performance, robustness and scalability properties for various task allocation , surveillance, and information gathering applications is...networking, we envision designing and analyzing algorithms with appropriate performance, robustness and scalability properties for various task ...distributed algorithms for target assignments; based on the classic auction algorithms in static networks, we intend to design efficient algorithms in worst

Algorithm Engineering: Concepts and Practice

NASA Astrophysics Data System (ADS)

Chimani, Markus; Klein, Karsten

Over the last years the term algorithm engineering has become wide spread synonym for experimental evaluation in the context of algorithm development. Yet it implies even more. We discuss the major weaknesses of traditional "pen and paper" algorithmics and the ever-growing gap between theory and practice in the context of modern computer hardware and real-world problem instances. We present the key ideas and concepts of the central algorithm engineering cycle that is based on a full feedback loop: It starts with the design of the algorithm, followed by the analysis, implementation, and experimental evaluation. The results of the latter can then be reused for modifications to the algorithmic design, stronger or input-specific theoretic performance guarantees, etc. We describe the individual steps of the cycle, explaining the rationale behind them and giving examples of how to conduct these steps thoughtfully. Thereby we give an introduction to current algorithmic key issues like I/O-efficient or parallel algorithms, succinct data structures, hardware-aware implementations, and others. We conclude with two especially insightful success stories—shortest path problems and text search—where the application of algorithm engineering techniques led to tremendous performance improvements compared with previous state-of-the-art approaches.

CURE-SMOTE algorithm and hybrid algorithm for feature selection and parameter optimization based on random forests.

PubMed

Ma, Li; Fan, Suohai

2017-03-14

The random forests algorithm is a type of classifier with prominent universality, a wide application range, and robustness for avoiding overfitting. But there are still some drawbacks to random forests. Therefore, to improve the performance of random forests, this paper seeks to improve imbalanced data processing, feature selection and parameter optimization. We propose the CURE-SMOTE algorithm for the imbalanced data classification problem. Experiments on imbalanced UCI data reveal that the combination of Clustering Using Representatives (CURE) enhances the original synthetic minority oversampling technique (SMOTE) algorithms effectively compared with the classification results on the original data using random sampling, Borderline-SMOTE1, safe-level SMOTE, C-SMOTE, and k-means-SMOTE. Additionally, the hybrid RF (random forests) algorithm has been proposed for feature selection and parameter optimization, which uses the minimum out of bag (OOB) data error as its objective function. Simulation results on binary and higher-dimensional data indicate that the proposed hybrid RF algorithms, hybrid genetic-random forests algorithm, hybrid particle swarm-random forests algorithm and hybrid fish swarm-random forests algorithm can achieve the minimum OOB error and show the best generalization ability. The training set produced from the proposed CURE-SMOTE algorithm is closer to the original data distribution because it contains minimal noise. Thus, better classification results are produced from this feasible and effective algorithm. Moreover, the hybrid algorithm's F-value, G-mean, AUC and OOB scores demonstrate that they surpass the performance of the original RF algorithm. Hence, this hybrid algorithm provides a new way to perform feature selection and parameter optimization.

Biological sequence compression algorithms.

PubMed

Matsumoto, T; Sadakane, K; Imai, H

2000-01-01

Today, more and more DNA sequences are becoming available. The information about DNA sequences are stored in molecular biology databases. The size and importance of these databases will be bigger and bigger in the future, therefore this information must be stored or communicated efficiently. Furthermore, sequence compression can be used to define similarities between biological sequences. The standard compression algorithms such as gzip or compress cannot compress DNA sequences, but only expand them in size. On the other hand, CTW (Context Tree Weighting Method) can compress DNA sequences less than two bits per symbol. These algorithms do not use special structures of biological sequences. Two characteristic structures of DNA sequences are known. One is called palindromes or reverse complements and the other structure is approximate repeats. Several specific algorithms for DNA sequences that use these structures can compress them less than two bits per symbol. In this paper, we improve the CTW so that characteristic structures of DNA sequences are available. Before encoding the next symbol, the algorithm searches an approximate repeat and palindrome using hash and dynamic programming. If there is a palindrome or an approximate repeat with enough length then our algorithm represents it with length and distance. By using this preprocessing, a new program achieves a little higher compression ratio than that of existing DNA-oriented compression algorithms. We also describe new compression algorithm for protein sequences.

Optically dark excitonic states mediated exciton and biexciton valley dynamics in monolayer WSe2

NASA Astrophysics Data System (ADS)

Zhang, Minghua; Fu, Jiyong; Dias, A. C.; Qu, Fanyao

2018-07-01

We present a theory to address the photoluminescence (PL) intensity and valley polarization (VP) dynamics in monolayer WSe2, under the impact of excitonic dark states of both excitons and biexcitons. We find that the PL intensity of all excitonic channels including intravalley exciton (Xb), intravalley biexciton (XXk,k) and intervalley biexciton (XX) in particular for the XXk,k PL is enhanced by laser excitation fluence. In addition, our results indicate the anomalous temperature dependence of PL, i.e. increasing with temperature, as a result of favored phonon assisted dark-to-bright scatterings at high temperatures. Moreover, we observe that the PL is almost immune to intervalley scatterings, which trigger the exchange of excitonic states between the two valleys. As far as the valley polarization is concerned, we find that the VP of Xb shrinks as temperature increases, exhibiting opposite temperature response to PL, while the intravalley XXk,k VP is found almost independent of temperature. In contrast to both Xb and XXk,k, the intervalley XX VP identically vanishes, because of equal populations of excitons in the K and valleys bounded to form intervalley biexcitons. Notably, it is found that the Xb VP much more strongly depends on bright–dark scattering than that of XXk,k, making dark state act as a robust reservoir for valley polarization against intervalley scatterings for Xb at strong bright–dark scatterings, but not for XXk,k. Dark excitonic states enabled enhancement of VP benefits quantum technology for information processing based on the valley degree of freedom in valleytronic devices. Furthermore, the VP has strong dependence on intervalley scattering but maintains essentially constant with excitation fluence. Finally, the dependence of time evolution of PL and VP on temperature and excitation fluence is discussed.

Hybrid cryptosystem implementation using fast data encipherment algorithm (FEAL) and goldwasser-micali algorithm for file security

NASA Astrophysics Data System (ADS)

Rachmawati, D.; Budiman, M. A.; Siburian, W. S. E.

2018-05-01

On the process of exchanging files, security is indispensable to avoid the theft of data. Cryptography is one of the sciences used to secure the data by way of encoding. Fast Data Encipherment Algorithm (FEAL) is a block cipher symmetric cryptographic algorithms. Therefore, the file which wants to protect is encrypted and decrypted using the algorithm FEAL. To optimize the security of the data, session key that is utilized in the algorithm FEAL encoded with the Goldwasser-Micali algorithm, which is an asymmetric cryptographic algorithm and using probabilistic concept. In the encryption process, the key was converted into binary form. The selection of values of x that randomly causes the results of the cipher key is different for each binary value. The concept of symmetry and asymmetry algorithm merger called Hybrid Cryptosystem. The use of the algorithm FEAL and Goldwasser-Micali can restore the message to its original form and the algorithm FEAL time required for encryption and decryption is directly proportional to the length of the message. However, on Goldwasser- Micali algorithm, the length of the message is not directly proportional to the time of encryption and decryption.

Revisiting negative selection algorithms.

PubMed

Ji, Zhou; Dasgupta, Dipankar

2007-01-01

This paper reviews the progress of negative selection algorithms, an anomaly/change detection approach in Artificial Immune Systems (AIS). Following its initial model, we try to identify the fundamental characteristics of this family of algorithms and summarize their diversities. There exist various elements in this method, including data representation, coverage estimate, affinity measure, and matching rules, which are discussed for different variations. The various negative selection algorithms are categorized by different criteria as well. The relationship and possible combinations with other AIS or other machine learning methods are discussed. Prospective development and applicability of negative selection algorithms and their influence on related areas are then speculated based on the discussion.

Study of image matching algorithm and sub-pixel fitting algorithm in target tracking

NASA Astrophysics Data System (ADS)

Yang, Ming-dong; Jia, Jianjun; Qiang, Jia; Wang, Jian-yu

2015-03-01

Image correlation matching is a tracking method that searched a region most approximate to the target template based on the correlation measure between two images. Because there is no need to segment the image, and the computation of this method is little. Image correlation matching is a basic method of target tracking. This paper mainly studies the image matching algorithm of gray scale image, which precision is at sub-pixel level. The matching algorithm used in this paper is SAD (Sum of Absolute Difference) method. This method excels in real-time systems because of its low computation complexity. The SAD method is introduced firstly and the most frequently used sub-pixel fitting algorithms are introduced at the meantime. These fitting algorithms can't be used in real-time systems because they are too complex. However, target tracking often requires high real-time performance, we put forward a fitting algorithm named paraboloidal fitting algorithm based on the consideration above, this algorithm is simple and realized easily in real-time system. The result of this algorithm is compared with that of surface fitting algorithm through image matching simulation. By comparison, the precision difference between these two algorithms is little, it's less than 0.01pixel. In order to research the influence of target rotation on precision of image matching, the experiment of camera rotation was carried on. The detector used in the camera is a CMOS detector. It is fixed to an arc pendulum table, take pictures when the camera rotated different angles. Choose a subarea in the original picture as the template, and search the best matching spot using image matching algorithm mentioned above. The result shows that the matching error is bigger when the target rotation angle is larger. It's an approximate linear relation. Finally, the influence of noise on matching precision was researched. Gaussian noise and pepper and salt noise were added in the image respectively, and the image

Statistical efficiency of adaptive algorithms.

PubMed

Widrow, Bernard; Kamenetsky, Max

2003-01-01

The statistical efficiency of a learning algorithm applied to the adaptation of a given set of variable weights is defined as the ratio of the quality of the converged solution to the amount of data used in training the weights. Statistical efficiency is computed by averaging over an ensemble of learning experiences. A high quality solution is very close to optimal, while a low quality solution corresponds to noisy weights and less than optimal performance. In this work, two gradient descent adaptive algorithms are compared, the LMS algorithm and the LMS/Newton algorithm. LMS is simple and practical, and is used in many applications worldwide. LMS/Newton is based on Newton's method and the LMS algorithm. LMS/Newton is optimal in the least squares sense. It maximizes the quality of its adaptive solution while minimizing the use of training data. Many least squares adaptive algorithms have been devised over the years, but no other least squares algorithm can give better performance, on average, than LMS/Newton. LMS is easily implemented, but LMS/Newton, although of great mathematical interest, cannot be implemented in most practical applications. Because of its optimality, LMS/Newton serves as a benchmark for all least squares adaptive algorithms. The performances of LMS and LMS/Newton are compared, and it is found that under many circumstances, both algorithms provide equal performance. For example, when both algorithms are tested with statistically nonstationary input signals, their average performances are equal. When adapting with stationary input signals and with random initial conditions, their respective learning times are on average equal. However, under worst-case initial conditions, the learning time of LMS can be much greater than that of LMS/Newton, and this is the principal disadvantage of the LMS algorithm. But the strong points of LMS are ease of implementation and optimal performance under important practical conditions. For these reasons, the LMS

New development of the image matching algorithm

NASA Astrophysics Data System (ADS)

Zhang, Xiaoqiang; Feng, Zhao

2018-04-01

To study the image matching algorithm, algorithm four elements are described, i.e., similarity measurement, feature space, search space and search strategy. Four common indexes for evaluating the image matching algorithm are described, i.e., matching accuracy, matching efficiency, robustness and universality. Meanwhile, this paper describes the principle of image matching algorithm based on the gray value, image matching algorithm based on the feature, image matching algorithm based on the frequency domain analysis, image matching algorithm based on the neural network and image matching algorithm based on the semantic recognition, and analyzes their characteristics and latest research achievements. Finally, the development trend of image matching algorithm is discussed. This study is significant for the algorithm improvement, new algorithm design and algorithm selection in practice.

Fusing face-verification algorithms and humans.

PubMed

O'Toole, Alice J; Abdi, Hervé; Jiang, Fang; Phillips, P Jonathon

2007-10-01

It has been demonstrated recently that state-of-the-art face-recognition algorithms can surpass human accuracy at matching faces over changes in illumination. The ranking of algorithms and humans by accuracy, however, does not provide information about whether algorithms and humans perform the task comparably or whether algorithms and humans can be fused to improve performance. In this paper, we fused humans and algorithms using partial least square regression (PLSR). In the first experiment, we applied PLSR to face-pair similarity scores generated by seven algorithms participating in the Face Recognition Grand Challenge. The PLSR produced an optimal weighting of the similarity scores, which we tested for generality with a jackknife procedure. Fusing the algorithms' similarity scores using the optimal weights produced a twofold reduction of error rate over the most accurate algorithm. Next, human-subject-generated similarity scores were added to the PLSR analysis. Fusing humans and algorithms increased the performance to near-perfect classification accuracy. These results are discussed in terms of maximizing face-verification accuracy with hybrid systems consisting of multiple algorithms and humans.

Evidence-based algorithm for heparin dosing before cardiopulmonary bypass. Part 1: Development of the algorithm.

PubMed

McKinney, Mark C; Riley, Jeffrey B

2007-12-01

The incidence of heparin resistance during adult cardiac surgery with cardiopulmonary bypass has been reported at 15%-20%. The consistent use of a clinical decision-making algorithm may increase the consistency of patient care and likely reduce the total required heparin dose and other problems associated with heparin dosing. After a directed survey of practicing perfusionists regarding treatment of heparin resistance and a literature search for high-level evidence regarding the diagnosis and treatment of heparin resistance, an evidence-based decision-making algorithm was constructed. The face validity of the algorithm decisive steps and logic was confirmed by a second survey of practicing perfusionists. The algorithm begins with review of the patient history to identify predictors for heparin resistance. The definition for heparin resistance contained in the algorithm is an activated clotting time < 450 seconds with > 450 IU/kg heparin loading dose. Based on the literature, the treatment for heparin resistance used in the algorithm is anti-thrombin III supplement. The algorithm seems to be valid and is supported by high-level evidence and clinician opinion. The next step is a human randomized clinical trial to test the clinical procedure guideline algorithm vs. current standard clinical practice.

Decryption of pure-position permutation algorithms.

PubMed

Zhao, Xiao-Yu; Chen, Gang; Zhang, Dan; Wang, Xiao-Hong; Dong, Guang-Chang

2004-07-01

Pure position permutation image encryption algorithms, commonly used as image encryption investigated in this work are unfortunately frail under known-text attack. In view of the weakness of pure position permutation algorithm, we put forward an effective decryption algorithm for all pure-position permutation algorithms. First, a summary of the pure position permutation image encryption algorithms is given by introducing the concept of ergodic matrices. Then, by using probability theory and algebraic principles, the decryption probability of pure-position permutation algorithms is verified theoretically; and then, by defining the operation system of fuzzy ergodic matrices, we improve a specific decryption algorithm. Finally, some simulation results are shown.

The Superior Lambert Algorithm

NASA Astrophysics Data System (ADS)

der, G.

2011-09-01

Lambert algorithms are used extensively for initial orbit determination, mission planning, space debris correlation, and missile targeting, just to name a few applications. Due to the significance of the Lambert problem in Astrodynamics, Gauss, Battin, Godal, Lancaster, Gooding, Sun and many others (References 1 to 15) have provided numerous formulations leading to various analytic solutions and iterative methods. Most Lambert algorithms and their computer programs can only work within one revolution, break down or converge slowly when the transfer angle is near zero or 180 degrees, and their multi-revolution limitations are either ignored or barely addressed. Despite claims of robustness, many Lambert algorithms fail without notice, and the users seldom have a clue why. The DerAstrodynamics lambert2 algorithm, which is based on the analytic solution formulated by Sun, works for any number of revolutions and converges rapidly at any transfer angle. It provides significant capability enhancements over every other Lambert algorithm in use today. These include improved speed, accuracy, robustness, and multirevolution capabilities as well as implementation simplicity. Additionally, the lambert2 algorithm provides a powerful tool for solving the angles-only problem without artificial singularities (pointed out by Gooding in Reference 16), which involves 3 lines of sight captured by optical sensors, or systems such as the Air Force Space Surveillance System (AFSSS). The analytic solution is derived from the extended Godal’s time equation by Sun, while the iterative method of solution is that of Laguerre, modified for robustness. The Keplerian solution of a Lambert algorithm can be extended to include the non-Keplerian terms of the Vinti algorithm via a simple targeting technique (References 17 to 19). Accurate analytic non-Keplerian trajectories can be predicted for satellites and ballistic missiles, while performing at least 100 times faster in speed than most

The Texas Medication Algorithm Project antipsychotic algorithm for schizophrenia: 2006 update.

PubMed

Moore, Troy A; Buchanan, Robert W; Buckley, Peter F; Chiles, John A; Conley, Robert R; Crismon, M Lynn; Essock, Susan M; Finnerty, Molly; Marder, Stephen R; Miller, Del D; McEvoy, Joseph P; Robinson, Delbert G; Schooler, Nina R; Shon, Steven P; Stroup, T Scott; Miller, Alexander L

2007-11-01

A panel of academic psychiatrists and pharmacists, clinicians from the Texas public mental health system, advocates, and consumers met in June 2006 in Dallas, Tex., to review recent evidence in the pharmacologic treatment of schizophrenia. The goal of the consensus conference was to update and revise the Texas Medication Algorithm Project (TMAP) algorithm for schizophrenia used in the Texas Implementation of Medication Algorithms, a statewide quality assurance program for treatment of major psychiatric illness. Four questions were identified via premeeting teleconferences. (1) Should antipsychotic treatment of first-episode schizophrenia be different from that of multiepisode schizophrenia? (2) In which algorithm stages should first-generation antipsychotics (FGAs) be an option? (3) How many antipsychotic trials should precede a clozapine trial? (4) What is the status of augmentation strategies for clozapine? Subgroups reviewed the evidence in each area and presented their findings at the conference. The algorithm was updated to incorporate the following recommendations. (1) Persons with first-episode schizophrenia typically require lower antipsychotic doses and are more sensitive to side effects such as weight gain and extrapyramidal symptoms (group consensus). Second-generation antipsychotics (SGAs) are preferred for treatment of first-episode schizophrenia (majority opinion). (2) FGAs should be included in algorithm stages after first episode that include SGAs other than clozapine as options (group consensus). (3) The recommended number of trials of other antipsychotics that should precede a clozapine trial is 2, but earlier use of clozapine should be considered in the presence of persistent problems such as suicidality, comorbid violence, and substance abuse (group consensus). (4) Augmentation is reasonable for persons with inadequate response to clozapine, but published results on augmenting agents have not identified replicable positive results (group

Algorithms and Libraries

NASA Technical Reports Server (NTRS)

Dongarra, Jack

1998-01-01

This exploratory study initiated our inquiry into algorithms and applications that would benefit by latency tolerant approach to algorithm building, including the construction of new algorithms where appropriate. In a multithreaded execution, when a processor reaches a point where remote memory access is necessary, the request is sent out on the network and a context--switch occurs to a new thread of computation. This effectively masks a long and unpredictable latency due to remote loads, thereby providing tolerance to remote access latency. We began to develop standards to profile various algorithm and application parameters, such as the degree of parallelism, granularity, precision, instruction set mix, interprocessor communication, latency etc. These tools will continue to develop and evolve as the Information Power Grid environment matures. To provide a richer context for this research, the project also focused on issues of fault-tolerance and computation migration of numerical algorithms and software. During the initial phase we tried to increase our understanding of the bottlenecks in single processor performance. Our work began by developing an approach for the automatic generation and optimization of numerical software for processors with deep memory hierarchies and pipelined functional units. Based on the results we achieved in this study we are planning to study other architectures of interest, including development of cost models, and developing code generators appropriate to these architectures.

Quantum noncovariance of the linear potential in 1 + 1 dimensions

NASA Astrophysics Data System (ADS)

Artru, Xavier

1984-03-01

The two-body bound states governed by the Hamiltonian (pa2+ma2)12+(pb2+mb2)12+κ|xa-xb| in 1 + 1 dimensions do not have Lorentz-invariant masses (En,P2-P2)12 even to first order in P2, if one used the standard commutation relations [xi,pi]=1ℏ. This is shown explicitly for ma=mb=0 and generalized by continuity to ma+mb≠0. The same is true for any other potential V(|xa-xb|).

Investigation of dynamic ground effect

NASA Technical Reports Server (NTRS)

Chang, Ray Chung; Muirhead, Vincent U.

1987-01-01

An experimental investigation of dynamic ground effect was conducted in the Univ. of Kansas wind tunnel using delta wings of 60, 70, 75 deg sweep; the XB-70 wing; and the F-104A wing. Both static and dynamic tests were made. Test data were compared to other test data, including dynamic flight test data of the XB-70 and F-104A. Limited flow visualization test were conducted. A significant dynamic effect was found for highly swept delta wings.

An efficient parallel termination detection algorithm

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baker, A. H.; Crivelli, S.; Jessup, E. R.

2004-05-27

Information local to any one processor is insufficient to monitor the overall progress of most distributed computations. Typically, a second distributed computation for detecting termination of the main computation is necessary. In order to be a useful computational tool, the termination detection routine must operate concurrently with the main computation, adding minimal overhead, and it must promptly and correctly detect termination when it occurs. In this paper, we present a new algorithm for detecting the termination of a parallel computation on distributed-memory MIMD computers that satisfies all of those criteria. A variety of termination detection algorithms have been devised. Ofmore » these, the algorithm presented by Sinha, Kale, and Ramkumar (henceforth, the SKR algorithm) is unique in its ability to adapt to the load conditions of the system on which it runs, thereby minimizing the impact of termination detection on performance. Because their algorithm also detects termination quickly, we consider it to be the most efficient practical algorithm presently available. The termination detection algorithm presented here was developed for use in the PMESC programming library for distributed-memory MIMD computers. Like the SKR algorithm, our algorithm adapts to system loads and imposes little overhead. Also like the SKR algorithm, ours is tree-based, and it does not depend on any assumptions about the physical interconnection topology of the processors or the specifics of the distributed computation. In addition, our algorithm is easier to implement and requires only half as many tree traverses as does the SKR algorithm. This paper is organized as follows. In section 2, we define our computational model. In section 3, we review the SKR algorithm. We introduce our new algorithm in section 4, and prove its correctness in section 5. We discuss its efficiency and present experimental results in section 6.« less

Verifying a Computer Algorithm Mathematically.

ERIC Educational Resources Information Center

Olson, Alton T.

1986-01-01

Presents an example of mathematics from an algorithmic point of view, with emphasis on the design and verification of this algorithm. The program involves finding roots for algebraic equations using the half-interval search algorithm. The program listing is included. (JN)

Adaptive reference update (ARU) algorithm. A stochastic search algorithm for efficient optimization of multi-drug cocktails

PubMed Central

2012-01-01

Background Multi-target therapeutics has been shown to be effective for treating complex diseases, and currently, it is a common practice to combine multiple drugs to treat such diseases to optimize the therapeutic outcomes. However, considering the huge number of possible ways to mix multiple drugs at different concentrations, it is practically difficult to identify the optimal drug combination through exhaustive testing. Results In this paper, we propose a novel stochastic search algorithm, called the adaptive reference update (ARU) algorithm, that can provide an efficient and systematic way for optimizing multi-drug cocktails. The ARU algorithm iteratively updates the drug combination to improve its response, where the update is made by comparing the response of the current combination with that of a reference combination, based on which the beneficial update direction is predicted. The reference combination is continuously updated based on the drug response values observed in the past, thereby adapting to the underlying drug response function. To demonstrate the effectiveness of the proposed algorithm, we evaluated its performance based on various multi-dimensional drug functions and compared it with existing algorithms. Conclusions Simulation results show that the ARU algorithm significantly outperforms existing stochastic search algorithms, including the Gur Game algorithm. In fact, the ARU algorithm can more effectively identify potent drug combinations and it typically spends fewer iterations for finding effective combinations. Furthermore, the ARU algorithm is robust to random fluctuations and noise in the measured drug response, which makes the algorithm well-suited for practical drug optimization applications. PMID:23134742

The PlusCal Algorithm Language

NASA Astrophysics Data System (ADS)

Lamport, Leslie

Algorithms are different from programs and should not be described with programming languages. The only simple alternative to programming languages has been pseudo-code. PlusCal is an algorithm language that can be used right now to replace pseudo-code, for both sequential and concurrent algorithms. It is based on the TLA + specification language, and a PlusCal algorithm is automatically translated to a TLA + specification that can be checked with the TLC model checker and reasoned about formally.

G/SPLINES: A hybrid of Friedman's Multivariate Adaptive Regression Splines (MARS) algorithm with Holland's genetic algorithm

NASA Technical Reports Server (NTRS)

Rogers, David

1991-01-01

G/SPLINES are a hybrid of Friedman's Multivariable Adaptive Regression Splines (MARS) algorithm with Holland's Genetic Algorithm. In this hybrid, the incremental search is replaced by a genetic search. The G/SPLINE algorithm exhibits performance comparable to that of the MARS algorithm, requires fewer least squares computations, and allows significantly larger problems to be considered.

Software For Genetic Algorithms

NASA Technical Reports Server (NTRS)

Wang, Lui; Bayer, Steve E.

1992-01-01

SPLICER computer program is genetic-algorithm software tool used to solve search and optimization problems. Provides underlying framework and structure for building genetic-algorithm application program. Written in Think C.

Cloud Model Bat Algorithm

PubMed Central

Zhou, Yongquan; Xie, Jian; Li, Liangliang; Ma, Mingzhi

2014-01-01

Bat algorithm (BA) is a novel stochastic global optimization algorithm. Cloud model is an effective tool in transforming between qualitative concepts and their quantitative representation. Based on the bat echolocation mechanism and excellent characteristics of cloud model on uncertainty knowledge representation, a new cloud model bat algorithm (CBA) is proposed. This paper focuses on remodeling echolocation model based on living and preying characteristics of bats, utilizing the transformation theory of cloud model to depict the qualitative concept: “bats approach their prey.” Furthermore, Lévy flight mode and population information communication mechanism of bats are introduced to balance the advantage between exploration and exploitation. The simulation results show that the cloud model bat algorithm has good performance on functions optimization. PMID:24967425

Distributed k-Means Algorithm and Fuzzy c-Means Algorithm for Sensor Networks Based on Multiagent Consensus Theory.

PubMed

Qin, Jiahu; Fu, Weiming; Gao, Huijun; Zheng, Wei Xing

2016-03-03

This paper is concerned with developing a distributed k-means algorithm and a distributed fuzzy c-means algorithm for wireless sensor networks (WSNs) where each node is equipped with sensors. The underlying topology of the WSN is supposed to be strongly connected. The consensus algorithm in multiagent consensus theory is utilized to exchange the measurement information of the sensors in WSN. To obtain a faster convergence speed as well as a higher possibility of having the global optimum, a distributed k-means++ algorithm is first proposed to find the initial centroids before executing the distributed k-means algorithm and the distributed fuzzy c-means algorithm. The proposed distributed k-means algorithm is capable of partitioning the data observed by the nodes into measure-dependent groups which have small in-group and large out-group distances, while the proposed distributed fuzzy c-means algorithm is capable of partitioning the data observed by the nodes into different measure-dependent groups with degrees of membership values ranging from 0 to 1. Simulation results show that the proposed distributed algorithms can achieve almost the same results as that given by the centralized clustering algorithms.

Quantum algorithm for support matrix machines

NASA Astrophysics Data System (ADS)

Duan, Bojia; Yuan, Jiabin; Liu, Ying; Li, Dan

2017-09-01

We propose a quantum algorithm for support matrix machines (SMMs) that efficiently addresses an image classification problem by introducing a least-squares reformulation. This algorithm consists of two core subroutines: a quantum matrix inversion (Harrow-Hassidim-Lloyd, HHL) algorithm and a quantum singular value thresholding (QSVT) algorithm. The two algorithms can be implemented on a universal quantum computer with complexity O[log(npq) ] and O[log(pq)], respectively, where n is the number of the training data and p q is the size of the feature space. By iterating the algorithms, we can find the parameters for the SMM classfication model. Our analysis shows that both HHL and QSVT algorithms achieve an exponential increase of speed over their classical counterparts.

Evolutionary pattern search algorithms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hart, W.E.

1995-09-19

This paper defines a class of evolutionary algorithms called evolutionary pattern search algorithms (EPSAs) and analyzes their convergence properties. This class of algorithms is closely related to evolutionary programming, evolutionary strategie and real-coded genetic algorithms. EPSAs are self-adapting systems that modify the step size of the mutation operator in response to the success of previous optimization steps. The rule used to adapt the step size can be used to provide a stationary point convergence theory for EPSAs on any continuous function. This convergence theory is based on an extension of the convergence theory for generalized pattern search methods. An experimentalmore » analysis of the performance of EPSAs demonstrates that these algorithms can perform a level of global search that is comparable to that of canonical EAs. We also describe a stopping rule for EPSAs, which reliably terminated near stationary points in our experiments. This is the first stopping rule for any class of EAs that can terminate at a given distance from stationary points.« less

Effects of visualization on algorithm comprehension

NASA Astrophysics Data System (ADS)

Mulvey, Matthew

Computer science students are expected to learn and apply a variety of core algorithms which are an essential part of the field. Any one of these algorithms by itself is not necessarily extremely complex, but remembering the large variety of algorithms and the differences between them is challenging. To address this challenge, we present a novel algorithm visualization tool designed to enhance students understanding of Dijkstra's algorithm by allowing them to discover the rules of the algorithm for themselves. It is hoped that a deeper understanding of the algorithm will help students correctly select, adapt and apply the appropriate algorithm when presented with a problem to solve, and that what is learned here will be applicable to the design of other visualization tools designed to teach different algorithms. Our visualization tool is currently in the prototype stage, and this thesis will discuss the pedagogical approach that informs its design, as well as the results of some initial usability testing. Finally, to clarify the direction for further development of the tool, four different variations of the prototype were implemented, and the instructional effectiveness of each was assessed by having a small sample participants use the different versions of the prototype and then take a quiz to assess their comprehension of the algorithm.

Two Meanings of Algorithmic Mathematics.

ERIC Educational Resources Information Center

Maurer, Stephen B.

1984-01-01

Two mathematical topics are interpreted from the viewpoints of traditional (performing algorithms) and contemporary (creating algorithms and thinking in terms of them for solving problems and developing theory) algorithmic mathematics. The two topics are Horner's method for evaluating polynomials and Gauss's method for solving systems of linear…

Recursive Branching Simulated Annealing Algorithm

NASA Technical Reports Server (NTRS)

Bolcar, Matthew; Smith, J. Scott; Aronstein, David

2012-01-01

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal

Estimation of TOA based MUSIC algorithm and cross correlation algorithm of appropriate interval

NASA Astrophysics Data System (ADS)

Lin, Wei; Liu, Jun; Zhou, Yineng; Huang, Jiyan

2017-03-01

Localization of mobile station (MS) has now gained considerable attention due to its wide applications in military, environmental, health and commercial systems. Phrase angle and encode data of MSK system model are two critical parameters in time-of-arrival (TOA) localization technique; nevertheless, precise value of phrase angle and encode data are not easy to achieved in general. In order to meet the actual situation, we should consider the condition that phase angle and encode data is unknown. In this paper, a novel TOA localization method, which combine MUSIC algorithm and cross correlation algorithm in an appropriate interval, is proposed. Simulations show that the proposed method has better performance than music algorithm and cross correlation algorithm of the whole interval.

An overview of smart grid routing algorithms

NASA Astrophysics Data System (ADS)

Wang, Junsheng; OU, Qinghai; Shen, Haijuan

2017-08-01

This paper summarizes the typical routing algorithm in smart grid by analyzing the communication business and communication requirements of intelligent grid. Mainly from the two kinds of routing algorithm is analyzed, namely clustering routing algorithm and routing algorithm, analyzed the advantages and disadvantages of two kinds of typical routing algorithm in routing algorithm and applicability.

Solar Occultation Retrieval Algorithm Development

NASA Technical Reports Server (NTRS)

Lumpe, Jerry D.

2004-01-01

This effort addresses the comparison and validation of currently operational solar occultation retrieval algorithms, and the development of generalized algorithms for future application to multiple platforms. initial development of generalized forward model algorithms capable of simulating transmission data from of the POAM II/III and SAGE II/III instruments. Work in the 2" quarter will focus on: completion of forward model algorithms, including accurate spectral characteristics for all instruments, and comparison of simulated transmission data with actual level 1 instrument data for specific occultation events.

A Parametric k-Means Algorithm

PubMed Central

Tarpey, Thaddeus

2007-01-01

Summary The k points that optimally represent a distribution (usually in terms of a squared error loss) are called the k principal points. This paper presents a computationally intensive method that automatically determines the principal points of a parametric distribution. Cluster means from the k-means algorithm are nonparametric estimators of principal points. A parametric k-means approach is introduced for estimating principal points by running the k-means algorithm on a very large simulated data set from a distribution whose parameters are estimated using maximum likelihood. Theoretical and simulation results are presented comparing the parametric k-means algorithm to the usual k-means algorithm and an example on determining sizes of gas masks is used to illustrate the parametric k-means algorithm. PMID:17917692

Analysis of an Optimized MLOS Tomographic Reconstruction Algorithm and Comparison to the MART Reconstruction Algorithm

NASA Astrophysics Data System (ADS)

La Foy, Roderick; Vlachos, Pavlos

2011-11-01

An optimally designed MLOS tomographic reconstruction algorithm for use in 3D PIV and PTV applications is analyzed. Using a set of optimized reconstruction parameters, the reconstructions produced by the MLOS algorithm are shown to be comparable to reconstructions produced by the MART algorithm for a range of camera geometries, camera numbers, and particle seeding densities. The resultant velocity field error calculated using PIV and PTV algorithms is further minimized by applying both pre and post processing to the reconstructed data sets.

DNABIT Compress – Genome compression algorithm

PubMed Central

Rajarajeswari, Pothuraju; Apparao, Allam

2011-01-01

Data compression is concerned with how information is organized in data. Efficient storage means removal of redundancy from the data being stored in the DNA molecule. Data compression algorithms remove redundancy and are used to understand biologically important molecules. We present a compression algorithm, “DNABIT Compress” for DNA sequences based on a novel algorithm of assigning binary bits for smaller segments of DNA bases to compress both repetitive and non repetitive DNA sequence. Our proposed algorithm achieves the best compression ratio for DNA sequences for larger genome. Significantly better compression results show that “DNABIT Compress” algorithm is the best among the remaining compression algorithms. While achieving the best compression ratios for DNA sequences (Genomes),our new DNABIT Compress algorithm significantly improves the running time of all previous DNA compression programs. Assigning binary bits (Unique BIT CODE) for (Exact Repeats, Reverse Repeats) fragments of DNA sequence is also a unique concept introduced in this algorithm for the first time in DNA compression. This proposed new algorithm could achieve the best compression ratio as much as 1.58 bits/bases where the existing best methods could not achieve a ratio less than 1.72 bits/bases. PMID:21383923

Smell Detection Agent Based Optimization Algorithm

NASA Astrophysics Data System (ADS)

Vinod Chandra, S. S.

2016-09-01

In this paper, a novel nature-inspired optimization algorithm has been employed and the trained behaviour of dogs in detecting smell trails is adapted into computational agents for problem solving. The algorithm involves creation of a surface with smell trails and subsequent iteration of the agents in resolving a path. This algorithm can be applied in different computational constraints that incorporate path-based problems. Implementation of the algorithm can be treated as a shortest path problem for a variety of datasets. The simulated agents have been used to evolve the shortest path between two nodes in a graph. This algorithm is useful to solve NP-hard problems that are related to path discovery. This algorithm is also useful to solve many practical optimization problems. The extensive derivation of the algorithm can be enabled to solve shortest path problems.

Quantum algorithm for linear regression

NASA Astrophysics Data System (ADS)

Wang, Guoming

2017-07-01

We present a quantum algorithm for fitting a linear regression model to a given data set using the least-squares approach. Differently from previous algorithms which yield a quantum state encoding the optimal parameters, our algorithm outputs these numbers in the classical form. So by running it once, one completely determines the fitted model and then can use it to make predictions on new data at little cost. Moreover, our algorithm works in the standard oracle model, and can handle data sets with nonsparse design matrices. It runs in time poly( log2(N ) ,d ,κ ,1 /ɛ ) , where N is the size of the data set, d is the number of adjustable parameters, κ is the condition number of the design matrix, and ɛ is the desired precision in the output. We also show that the polynomial dependence on d and κ is necessary. Thus, our algorithm cannot be significantly improved. Furthermore, we also give a quantum algorithm that estimates the quality of the least-squares fit (without computing its parameters explicitly). This algorithm runs faster than the one for finding this fit, and can be used to check whether the given data set qualifies for linear regression in the first place.

Contact solution algorithms

NASA Technical Reports Server (NTRS)

Tielking, John T.

1989-01-01

Two algorithms for obtaining static contact solutions are described in this presentation. Although they were derived for contact problems involving specific structures (a tire and a solid rubber cylinder), they are sufficiently general to be applied to other shell-of-revolution and solid-body contact problems. The shell-of-revolution contact algorithm is a method of obtaining a point load influence coefficient matrix for the portion of shell surface that is expected to carry a contact load. If the shell is sufficiently linear with respect to contact loading, a single influence coefficient matrix can be used to obtain a good approximation of the contact pressure distribution. Otherwise, the matrix will be updated to reflect nonlinear load-deflection behavior. The solid-body contact algorithm utilizes a Lagrange multiplier to include the contact constraint in a potential energy functional. The solution is found by applying the principle of minimum potential energy. The Lagrange multiplier is identified as the contact load resultant for a specific deflection. At present, only frictionless contact solutions have been obtained with these algorithms. A sliding tread element has been developed to calculate friction shear force in the contact region of the rolling shell-of-revolution tire model.

Synthesis of Greedy Algorithms Using Dominance Relations

NASA Technical Reports Server (NTRS)

Nedunuri, Srinivas; Smith, Douglas R.; Cook, William R.

2010-01-01

Greedy algorithms exploit problem structure and constraints to achieve linear-time performance. Yet there is still no completely satisfactory way of constructing greedy algorithms. For example, the Greedy Algorithm of Edmonds depends upon translating a problem into an algebraic structure called a matroid, but the existence of such a translation can be as hard to determine as the existence of a greedy algorithm itself. An alternative characterization of greedy algorithms is in terms of dominance relations, a well-known algorithmic technique used to prune search spaces. We demonstrate a process by which dominance relations can be methodically derived for a number of greedy algorithms, including activity selection, and prefix-free codes. By incorporating our approach into an existing framework for algorithm synthesis, we demonstrate that it could be the basis for an effective engineering method for greedy algorithms. We also compare our approach with other characterizations of greedy algorithms.

Algorithm for Compressing Time-Series Data

NASA Technical Reports Server (NTRS)

Hawkins, S. Edward, III; Darlington, Edward Hugo

2012-01-01

An algorithm based on Chebyshev polynomials effects lossy compression of time-series data or other one-dimensional data streams (e.g., spectral data) that are arranged in blocks for sequential transmission. The algorithm was developed for use in transmitting data from spacecraft scientific instruments to Earth stations. In spite of its lossy nature, the algorithm preserves the information needed for scientific analysis. The algorithm is computationally simple, yet compresses data streams by factors much greater than two. The algorithm is not restricted to spacecraft or scientific uses: it is applicable to time-series data in general. The algorithm can also be applied to general multidimensional data that have been converted to time-series data, a typical example being image data acquired by raster scanning. However, unlike most prior image-data-compression algorithms, this algorithm neither depends on nor exploits the two-dimensional spatial correlations that are generally present in images. In order to understand the essence of this compression algorithm, it is necessary to understand that the net effect of this algorithm and the associated decompression algorithm is to approximate the original stream of data as a sequence of finite series of Chebyshev polynomials. For the purpose of this algorithm, a block of data or interval of time for which a Chebyshev polynomial series is fitted to the original data is denoted a fitting interval. Chebyshev approximation has two properties that make it particularly effective for compressing serial data streams with minimal loss of scientific information: The errors associated with a Chebyshev approximation are nearly uniformly distributed over the fitting interval (this is known in the art as the "equal error property"); and the maximum deviations of the fitted Chebyshev polynomial from the original data have the smallest possible values (this is known in the art as the "min-max property").

Novel medical image enhancement algorithms

NASA Astrophysics Data System (ADS)

Agaian, Sos; McClendon, Stephen A.

2010-01-01

In this paper, we present two novel medical image enhancement algorithms. The first, a global image enhancement algorithm, utilizes an alpha-trimmed mean filter as its backbone to sharpen images. The second algorithm uses a cascaded unsharp masking technique to separate the high frequency components of an image in order for them to be enhanced using a modified adaptive contrast enhancement algorithm. Experimental results from enhancing electron microscopy, radiological, CT scan and MRI scan images, using the MATLAB environment, are then compared to the original images as well as other enhancement methods, such as histogram equalization and two forms of adaptive contrast enhancement. An image processing scheme for electron microscopy images of Purkinje cells will also be implemented and utilized as a comparison tool to evaluate the performance of our algorithm.

Tactical Synthesis Of Efficient Global Search Algorithms

NASA Technical Reports Server (NTRS)

Nedunuri, Srinivas; Smith, Douglas R.; Cook, William R.

2009-01-01

Algorithm synthesis transforms a formal specification into an efficient algorithm to solve a problem. Algorithm synthesis in Specware combines the formal specification of a problem with a high-level algorithm strategy. To derive an efficient algorithm, a developer must define operators that refine the algorithm by combining the generic operators in the algorithm with the details of the problem specification. This derivation requires skill and a deep understanding of the problem and the algorithmic strategy. In this paper we introduce two tactics to ease this process. The tactics serve a similar purpose to tactics used for determining indefinite integrals in calculus, that is suggesting possible ways to attack the problem.

Trees, bialgebras and intrinsic numerical algorithms

NASA Technical Reports Server (NTRS)

Crouch, Peter; Grossman, Robert; Larson, Richard

1990-01-01

Preliminary work about intrinsic numerical integrators evolving on groups is described. Fix a finite dimensional Lie group G; let g denote its Lie algebra, and let Y(sub 1),...,Y(sub N) denote a basis of g. A class of numerical algorithms is presented that approximate solutions to differential equations evolving on G of the form: dot-x(t) = F(x(t)), x(0) = p is an element of G. The algorithms depend upon constants c(sub i) and c(sub ij), for i = 1,...,k and j is less than i. The algorithms have the property that if the algorithm starts on the group, then it remains on the group. In addition, they also have the property that if G is the abelian group R(N), then the algorithm becomes the classical Runge-Kutta algorithm. The Cayley algebra generated by labeled, ordered trees is used to generate the equations that the coefficients c(sub i) and c(sub ij) must satisfy in order for the algorithm to yield an rth order numerical integrator and to analyze the resulting algorithms.

Empirical study of parallel LRU simulation algorithms

NASA Technical Reports Server (NTRS)

Carr, Eric; Nicol, David M.

1994-01-01

This paper reports on the performance of five parallel algorithms for simulating a fully associative cache operating under the LRU (Least-Recently-Used) replacement policy. Three of the algorithms are SIMD, and are implemented on the MasPar MP-2 architecture. Two other algorithms are parallelizations of an efficient serial algorithm on the Intel Paragon. One SIMD algorithm is quite simple, but its cost is linear in the cache size. The two other SIMD algorithm are more complex, but have costs that are independent on the cache size. Both the second and third SIMD algorithms compute all stack distances; the second SIMD algorithm is completely general, whereas the third SIMD algorithm presumes and takes advantage of bounds on the range of reference tags. Both MIMD algorithm implemented on the Paragon are general and compute all stack distances; they differ in one step that may affect their respective scalability. We assess the strengths and weaknesses of these algorithms as a function of problem size and characteristics, and compare their performance on traces derived from execution of three SPEC benchmark programs.

Firefly algorithm with chaos

NASA Astrophysics Data System (ADS)

Gandomi, A. H.; Yang, X.-S.; Talatahari, S.; Alavi, A. H.

2013-01-01

A recently developed metaheuristic optimization algorithm, firefly algorithm (FA), mimics the social behavior of fireflies based on the flashing and attraction characteristics of fireflies. In the present study, we will introduce chaos into FA so as to increase its global search mobility for robust global optimization. Detailed studies are carried out on benchmark problems with different chaotic maps. Here, 12 different chaotic maps are utilized to tune the attractive movement of the fireflies in the algorithm. The results show that some chaotic FAs can clearly outperform the standard FA.

Defect-Tolerant Diffusion Channels for Mg 2+ Ions in Ribbon-Type Borates: Structural Insights into Potential Battery Cathodes MgVBO 4 and Mg x Fe 2–xB 2O 5

DOE PAGES

Bo, Shou-Hang; Grey, Clare P.; Khalifah, Peter G.

2015-06-10

The reversible room temperature intercalation of Mg 2+ ions is difficult to achieve, but may offer substantial advantages in the design of next-generation batteries if this electrochemical process can be successfully realized. Two types of quadruple ribbon-type transition metal borates (Mg xFe 2-xB 2O 5 and MgVBO 4) with high theoretical capacities (186 mAh/g and 360 mAh/g) have been synthesized and structurally characterized through the combined Rietveld refinement of synchrotron and time-of-flight neutron diffraction data. Neither MgVBO 4 nor Mg xFe 2-xB 2O 5 can be chemically oxidized at room temperature, though Mg can be dynamically removed from themore » latter phase at elevated temperatures (approximately 200 - 500 °C). Findings show that Mg diffusion in the Mg xFe 2-xB 2O 5 structure is more facile for the inner two octahedral sites than for the two outer octahedral sites in the ribbons, a result supported by both the refined site occupancies after Mg removal and by bond valence sum difference map calculations of diffusion paths in the pristine material. Mg diffusion in this pyroborate Mg xFe 2-xB 2O 5 framework is also found to be tolerant to the presence of Mg/Fe disorder since Mg ions can diffuse through interstitial channels which bypass Fe-containing sites.« less

NOSS Altimeter Detailed Algorithm specifications

NASA Technical Reports Server (NTRS)

Hancock, D. W.; Mcmillan, J. D.

1982-01-01

The details of the algorithms and data sets required for satellite radar altimeter data processing are documented in a form suitable for (1) development of the benchmark software and (2) coding the operational software. The algorithms reported in detail are those established for altimeter processing. The algorithms which required some additional development before documenting for production were only scoped. The algorithms are divided into two levels of processing. The first level converts the data to engineering units and applies corrections for instrument variations. The second level provides geophysical measurements derived from altimeter parameters for oceanographic users.

Algorithmic complexity of quantum capacity

NASA Astrophysics Data System (ADS)

Oskouei, Samad Khabbazi; Mancini, Stefano

2018-04-01

We analyze the notion of quantum capacity from the perspective of algorithmic (descriptive) complexity. To this end, we resort to the concept of semi-computability in order to describe quantum states and quantum channel maps. We introduce algorithmic entropies (like algorithmic quantum coherent information) and derive relevant properties for them. Then we show that quantum capacity based on semi-computable concept equals the entropy rate of algorithmic coherent information, which in turn equals the standard quantum capacity. Thanks to this, we finally prove that the quantum capacity, for a given semi-computable channel, is limit computable.

Families of Graph Algorithms: SSSP Case Study

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kanewala Appuhamilage, Thejaka Amila Jay; Zalewski, Marcin J.; Lumsdaine, Andrew

2017-08-28

Single-Source Shortest Paths (SSSP) is a well-studied graph problem. Examples of SSSP algorithms include the original Dijkstra’s algorithm and the parallel Δ-stepping and KLA-SSSP algorithms. In this paper, we use a novel Abstract Graph Machine (AGM) model to show that all these algorithms share a common logic and differ from one another by the order in which they perform work. We use the AGM model to thoroughly analyze the family of algorithms that arises from the common logic. We start with the basic algorithm without any ordering (Chaotic), and then we derive the existing and new algorithms by methodically exploringmore » semantic and spatial ordering of work. Our experimental results show that new derived algorithms show better performance than the existing distributed memory parallel algorithms, especially at higher scales.« less

Portable Health Algorithms Test System

NASA Technical Reports Server (NTRS)

Melcher, Kevin J.; Wong, Edmond; Fulton, Christopher E.; Sowers, Thomas S.; Maul, William A.

2010-01-01

A document discusses the Portable Health Algorithms Test (PHALT) System, which has been designed as a means for evolving the maturity and credibility of algorithms developed to assess the health of aerospace systems. Comprising an integrated hardware-software environment, the PHALT system allows systems health management algorithms to be developed in a graphical programming environment, to be tested and refined using system simulation or test data playback, and to be evaluated in a real-time hardware-in-the-loop mode with a live test article. The integrated hardware and software development environment provides a seamless transition from algorithm development to real-time implementation. The portability of the hardware makes it quick and easy to transport between test facilities. This hard ware/software architecture is flexible enough to support a variety of diagnostic applications and test hardware, and the GUI-based rapid prototyping capability is sufficient to support development execution, and testing of custom diagnostic algorithms. The PHALT operating system supports execution of diagnostic algorithms under real-time constraints. PHALT can perform real-time capture and playback of test rig data with the ability to augment/ modify the data stream (e.g. inject simulated faults). It performs algorithm testing using a variety of data input sources, including real-time data acquisition, test data playback, and system simulations, and also provides system feedback to evaluate closed-loop diagnostic response and mitigation control.

Hardware Acceleration of Adaptive Neural Algorithms.

DOE Office of Scientific and Technical Information (OSTI.GOV)

James, Conrad D.

As tradit ional numerical computing has faced challenges, researchers have turned towards alternative computing approaches to reduce power - per - computation metrics and improve algorithm performance. Here, we describe an approach towards non - conventional computing that strengthens the connection between machine learning and neuroscience concepts. The Hardware Acceleration of Adaptive Neural Algorithms (HAANA) project ha s develop ed neural machine learning algorithms and hardware for applications in image processing and cybersecurity. While machine learning methods are effective at extracting relevant features from many types of data, the effectiveness of these algorithms degrades when subjected to real - worldmore » conditions. Our team has generated novel neural - inspired approa ches to improve the resiliency and adaptability of machine learning algorithms. In addition, we have also designed and fabricated hardware architectures and microelectronic devices specifically tuned towards the training and inference operations of neural - inspired algorithms. Finally, our multi - scale simulation framework allows us to assess the impact of microelectronic device properties on algorithm performance.« less

A national dosimetry audit for stereotactic ablative radiotherapy in lung.

PubMed

Distefano, Gail; Lee, Jonny; Jafari, Shakardokht; Gouldstone, Clare; Baker, Colin; Mayles, Helen; Clark, Catharine H

2017-03-01

A UK national dosimetry audit was carried out to assess the accuracy of Stereotactic Ablative Body Radiotherapy (SABR) lung treatment delivery. This mail-based audit used an anthropomorphic thorax phantom containing nine alanine pellets positioned in the lung region for dosimetry, as well as EBT3 film in the axial plane for isodose comparison. Centres used their local planning protocol/technique, creating 27 SABR plans. A range of delivery techniques including conformal, volumetric modulated arc therapy (VMAT) and Cyberknife (CK) were used with six different calculation algorithms (collapsed cone, superposition, pencil-beam (PB), AAA, Acuros and Monte Carlo). The mean difference between measured and calculated dose (excluding PB results) was 0.4±1.4% for alanine and 1.4±3.4% for film. PB differences were -6.1% and -12.9% respectively. The median of the absolute maximum isodose-to-isodose distances was 3mm (-6mm to 7mm) and 5mm (-10mm to +19mm) for the 100% and 50% isodose lines respectively. Alanine and film is an effective combination for verifying dosimetric and geometric accuracy. There were some differences across dose algorithms, and geometric accuracy was better for VMAT and CK compared with conformal techniques. The alanine dosimetry results showed that planned and delivered doses were within ±3.0% for 25/27 SABR plans. Copyright © 2017 Elsevier B.V. All rights reserved.

A genetic algorithm for replica server placement

NASA Astrophysics Data System (ADS)

Eslami, Ghazaleh; Toroghi Haghighat, Abolfazl

2012-01-01

Modern distribution systems use replication to improve communication delay experienced by their clients. Some techniques have been developed for web server replica placement. One of the previous studies was Greedy algorithm proposed by Qiu et al, that needs knowledge about network topology. In This paper, first we introduce a genetic algorithm for web server replica placement. Second, we compare our algorithm with Greedy algorithm proposed by Qiu et al, and Optimum algorithm. We found that our approach can achieve better results than Greedy algorithm proposed by Qiu et al but it's computational time is more than Greedy algorithm.

A genetic algorithm for replica server placement

NASA Astrophysics Data System (ADS)

Eslami, Ghazaleh; Toroghi Haghighat, Abolfazl

2011-12-01

Modern distribution systems use replication to improve communication delay experienced by their clients. Some techniques have been developed for web server replica placement. One of the previous studies was Greedy algorithm proposed by Qiu et al, that needs knowledge about network topology. In This paper, first we introduce a genetic algorithm for web server replica placement. Second, we compare our algorithm with Greedy algorithm proposed by Qiu et al, and Optimum algorithm. We found that our approach can achieve better results than Greedy algorithm proposed by Qiu et al but it's computational time is more than Greedy algorithm.

Rapid Dispersion of Polymicrobial Wound Biofilms with Depolymerase Enzymes

DTIC Science & Technology

2011-11-01

reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing this collection of...purified several of these enzymes that displayed proper folding and favorable solubility properties, and began characterizing their anti -biofilm...infection.   2 BODY: Specific Aim 1. Identify, clone, and express potential depolymerases. Task 1. IACUC and USAMRMC ACURO review and

Greedy algorithms in disordered systems

NASA Astrophysics Data System (ADS)

Duxbury, P. M.; Dobrin, R.

1999-08-01

We discuss search, minimal path and minimal spanning tree algorithms and their applications to disordered systems. Greedy algorithms solve these problems exactly, and are related to extremal dynamics in physics. Minimal cost path (Dijkstra) and minimal cost spanning tree (Prim) algorithms provide extremal dynamics for a polymer in a random medium (the KPZ universality class) and invasion percolation (without trapping) respectively.

An Unstable Arch Model of a Solar Flare

DTIC Science & Technology

1976-08-10

where the Euler-Lagrange equation becomes singular. We now expand f(r) and g(r) around the singular point r. Thus k JA + - p x, (3.20) m where x...current layer, etc.) can result only from convection. The equations we will use are ()B E 2 - VX(vXB)- _ VX(1TV XB), (4.8) E+ vX B=77j (4.9) C and curl (P...d- curl (J ( curl B) X B+pg . (4.10) Since the treatment is principally concerned with resistive instabilities whose growth times are long compared to

A hardware-algorithm co-design approach to optimize seizure detection algorithms for implantable applications.

PubMed

Raghunathan, Shriram; Gupta, Sumeet K; Markandeya, Himanshu S; Roy, Kaushik; Irazoqui, Pedro P

2010-10-30

Implantable neural prostheses that deliver focal electrical stimulation upon demand are rapidly emerging as an alternate therapy for roughly a third of the epileptic patient population that is medically refractory. Seizure detection algorithms enable feedback mechanisms to provide focally and temporally specific intervention. Real-time feasibility and computational complexity often limit most reported detection algorithms to implementations using computers for bedside monitoring or external devices communicating with the implanted electrodes. A comparison of algorithms based on detection efficacy does not present a complete picture of the feasibility of the algorithm with limited computational power, as is the case with most battery-powered applications. We present a two-dimensional design optimization approach that takes into account both detection efficacy and hardware cost in evaluating algorithms for their feasibility in an implantable application. Detection features are first compared for their ability to detect electrographic seizures from micro-electrode data recorded from kainate-treated rats. Circuit models are then used to estimate the dynamic and leakage power consumption of the compared features. A score is assigned based on detection efficacy and the hardware cost for each of the features, then plotted on a two-dimensional design space. An optimal combination of compared features is used to construct an algorithm that provides maximal detection efficacy per unit hardware cost. The methods presented in this paper would facilitate the development of a common platform to benchmark seizure detection algorithms for comparison and feasibility analysis in the next generation of implantable neuroprosthetic devices to treat epilepsy. Copyright © 2010 Elsevier B.V. All rights reserved.

Efficient image compression algorithm for computer-animated images

NASA Astrophysics Data System (ADS)

Yfantis, Evangelos A.; Au, Matthew Y.; Miel, G.

1992-10-01

An image compression algorithm is described. The algorithm is an extension of the run-length image compression algorithm and its implementation is relatively easy. This algorithm was implemented and compared with other existing popular compression algorithms and with the Lempel-Ziv (LZ) coding. The Lempel-Ziv algorithm is available as a utility in the UNIX operating system and is also referred to as the UNIX uncompress. Sometimes our algorithm is best in terms of saving memory space, and sometimes one of the competing algorithms is best. The algorithm is lossless, and the intent is for the algorithm to be used in computer graphics animated images. Comparisons made with the LZ algorithm indicate that the decompression time using our algorithm is faster than that using the LZ algorithm. Once the data are in memory, a relatively simple and fast transformation is applied to uncompress the file.

Efficient RNA structure comparison algorithms.

PubMed

Arslan, Abdullah N; Anandan, Jithendar; Fry, Eric; Monschke, Keith; Ganneboina, Nitin; Bowerman, Jason

2017-12-01

Recently proposed relative addressing-based ([Formula: see text]) RNA secondary structure representation has important features by which an RNA structure database can be stored into a suffix array. A fast substructure search algorithm has been proposed based on binary search on this suffix array. Using this substructure search algorithm, we present a fast algorithm that finds the largest common substructure of given multiple RNA structures in [Formula: see text] format. The multiple RNA structure comparison problem is NP-hard in its general formulation. We introduced a new problem for comparing multiple RNA structures. This problem has more strict similarity definition and objective, and we propose an algorithm that solves this problem efficiently. We also develop another comparison algorithm that iteratively calls this algorithm to locate nonoverlapping large common substructures in compared RNAs. With the new resulting tools, we improved the RNASSAC website (linked from http://faculty.tamuc.edu/aarslan ). This website now also includes two drawing tools: one specialized for preparing RNA substructures that can be used as input by the search tool, and another one for automatically drawing the entire RNA structure from a given structure sequence.

An algorithmic framework for multiobjective optimization.

PubMed

Ganesan, T; Elamvazuthi, I; Shaari, Ku Zilati Ku; Vasant, P

2013-01-01

Multiobjective (MO) optimization is an emerging field which is increasingly being encountered in many fields globally. Various metaheuristic techniques such as differential evolution (DE), genetic algorithm (GA), gravitational search algorithm (GSA), and particle swarm optimization (PSO) have been used in conjunction with scalarization techniques such as weighted sum approach and the normal-boundary intersection (NBI) method to solve MO problems. Nevertheless, many challenges still arise especially when dealing with problems with multiple objectives (especially in cases more than two). In addition, problems with extensive computational overhead emerge when dealing with hybrid algorithms. This paper discusses these issues by proposing an alternative framework that utilizes algorithmic concepts related to the problem structure for generating efficient and effective algorithms. This paper proposes a framework to generate new high-performance algorithms with minimal computational overhead for MO optimization.

Testing an earthquake prediction algorithm

USGS Publications Warehouse

Kossobokov, V.G.; Healy, J.H.; Dewey, J.W.

1997-01-01

A test to evaluate earthquake prediction algorithms is being applied to a Russian algorithm known as M8. The M8 algorithm makes intermediate term predictions for earthquakes to occur in a large circle, based on integral counts of transient seismicity in the circle. In a retroactive prediction for the period January 1, 1985 to July 1, 1991 the algorithm as configured for the forward test would have predicted eight of ten strong earthquakes in the test area. A null hypothesis, based on random assignment of predictions, predicts eight earthquakes in 2.87% of the trials. The forward test began July 1, 1991 and will run through December 31, 1997. As of July 1, 1995, the algorithm had forward predicted five out of nine earthquakes in the test area, which success ratio would have been achieved in 53% of random trials with the null hypothesis.

Advancements to the planogram frequency–distance rebinning algorithm

PubMed Central

Champley, Kyle M; Raylman, Raymond R; Kinahan, Paul E

2010-01-01

In this paper we consider the task of image reconstruction in positron emission tomography (PET) with the planogram frequency–distance rebinning (PFDR) algorithm. The PFDR algorithm is a rebinning algorithm for PET systems with panel detectors. The algorithm is derived in the planogram coordinate system which is a native data format for PET systems with panel detectors. A rebinning algorithm averages over the redundant four-dimensional set of PET data to produce a three-dimensional set of data. Images can be reconstructed from this rebinned three-dimensional set of data. This process enables one to reconstruct PET images more quickly than reconstructing directly from the four-dimensional PET data. The PFDR algorithm is an approximate rebinning algorithm. We show that implementing the PFDR algorithm followed by the (ramp) filtered backprojection (FBP) algorithm in linogram coordinates from multiple views reconstructs a filtered version of our image. We develop an explicit formula for this filter which can be used to achieve exact reconstruction by means of a modified FBP algorithm applied to the stack of rebinned linograms and can also be used to quantify the errors introduced by the PFDR algorithm. This filter is similar to the filter in the planogram filtered backprojection algorithm derived by Brasse et al. The planogram filtered backprojection and exact reconstruction with the PFDR algorithm require complete projections which can be completed with a reprojection algorithm. The PFDR algorithm is similar to the rebinning algorithm developed by Kao et al. By expressing the PFDR algorithm in detector coordinates, we provide a comparative analysis between the two algorithms. Numerical experiments using both simulated data and measured data from a positron emission mammography/tomography (PEM/PET) system are performed. Images are reconstructed by PFDR+FBP (PFDR followed by 2D FBP reconstruction), PFDRX (PFDR followed by the modified FBP algorithm for exact

A Comparison of Three Curve Intersection Algorithms

NASA Technical Reports Server (NTRS)

Sederberg, T. W.; Parry, S. R.

1985-01-01

An empirical comparison is made between three algorithms for computing the points of intersection of two planar Bezier curves. The algorithms compared are: the well known Bezier subdivision algorithm, which is discussed in Lane 80; a subdivision algorithm based on interval analysis due to Koparkar and Mudur; and an algorithm due to Sederberg, Anderson and Goldman which reduces the problem to one of finding the roots of a univariate polynomial. The details of these three algorithms are presented in their respective references.

One-dimensional swarm algorithm packaging

NASA Astrophysics Data System (ADS)

Lebedev, Boris K.; Lebedev, Oleg B.; Lebedeva, Ekaterina O.

2018-05-01

The paper considers an algorithm for solving the problem of onedimensional packaging based on the adaptive behavior model of an ant colony. The key role in the development of the ant algorithm is the choice of representation (interpretation) of the solution. The structure of the solution search graph, the procedure for finding solutions on the graph, the methods of deposition and evaporation of pheromone are described. Unlike the canonical paradigm of an ant algorithm, an ant on the solution search graph generates sets of elements distributed across blocks. Experimental studies were conducted on IBM PC. Compared with the existing algorithms, the results are improved.

Multiple-algorithm parallel fusion of infrared polarization and intensity images based on algorithmic complementarity and synergy

NASA Astrophysics Data System (ADS)

Zhang, Lei; Yang, Fengbao; Ji, Linna; Lv, Sheng

2018-01-01

Diverse image fusion methods perform differently. Each method has advantages and disadvantages compared with others. One notion is that the advantages of different image methods can be effectively combined. A multiple-algorithm parallel fusion method based on algorithmic complementarity and synergy is proposed. First, in view of the characteristics of the different algorithms and difference-features among images, an index vector-based feature-similarity is proposed to define the degree of complementarity and synergy. This proposed index vector is a reliable evidence indicator for algorithm selection. Second, the algorithms with a high degree of complementarity and synergy are selected. Then, the different degrees of various features and infrared intensity images are used as the initial weights for the nonnegative matrix factorization (NMF). This avoids randomness of the NMF initialization parameter. Finally, the fused images of different algorithms are integrated using the NMF because of its excellent data fusing performance on independent features. Experimental results demonstrate that the visual effect and objective evaluation index of the fused images obtained using the proposed method are better than those obtained using traditional methods. The proposed method retains all the advantages that individual fusion algorithms have.

QCCM Center for Quantum Algorithms

DTIC Science & Technology

2008-10-17

algorithms (e.g., quantum walks and adiabatic computing ), as well as theoretical advances relating algorithms to physical implementations (e.g...Park, NC 27709-2211 15. SUBJECT TERMS Quantum algorithms, quantum computing , fault-tolerant error correction Richard Cleve MITACS East Academic...0511200 Algebraic results on quantum automata A. Ambainis, M. Beaudry, M. Golovkins, A. Kikusts, M. Mercer, D. Thrien Theory of Computing Systems 39(2006

Concentration, ozone formation potential and source analysis of volatile organic compounds (VOCs) in a thermal power station centralized area: A study in Shuozhou, China.

PubMed

Yan, Yulong; Peng, Lin; Li, Rumei; Li, Yinghui; Li, Lijuan; Bai, Huiling

2017-04-01

Volatile organic compounds (VOCs) from two sampling sites (HB and XB) in a power station centralized area, in Shuozhou city, China, were sampled by stainless steel canisters and measured by gas chromatography-mass selective detection/flame ionization detection (GC-MSD/FID) in the spring and autumn of 2014. The concentration of VOCs was higher in the autumn (HB, 96.87 μg/m 3 ; XB, 58.94 μg/m 3 ) than in the spring (HB, 41.49 μg/m 3 ; XB, 43.46 μg/m 3 ), as lower wind speed in the autumn could lead to pollutant accumulation, especially at HB, which is a new urban area surrounded by residential areas and a transportation hub. Alkanes were the dominant group at both HB and XB in both sampling periods, but the contribution of aromatic pollutants at HB in the autumn was much higher than that of the other alkanes (11.16-19.55%). Compared to other cities, BTEX pollution in Shuozhou was among the lowest levels in the world. Because of the high levels of aromatic pollutants, the ozone formation potential increased significantly at HB in the autumn. Using the ratio analyses to identify the age of the air masses and analyze the sources, the results showed that the atmospheric VOCs at XB were strongly influenced by the remote sources of coal combustion, while at HB in the spring and autumn were affected by the remote sources of coal combustion and local sources of vehicle emission, respectively. Source analysis conducted using the Positive Matrix Factorization (PMF) model at Shuozhou showed that coal combustion and vehicle emissions made the two largest contributions (29.98% and 21.25%, respectively) to atmospheric VOCs. With further economic restructuring, the influence of vehicle emissions on the air quality should become more significant, indicating that controlling vehicle emissions is key to reducing the air pollution. Copyright © 2017 Elsevier Ltd. All rights reserved.

One algorithm to rule them all? An evaluation and discussion of ten eye movement event-detection algorithms.

PubMed

Andersson, Richard; Larsson, Linnea; Holmqvist, Kenneth; Stridh, Martin; Nyström, Marcus

2017-04-01

Almost all eye-movement researchers use algorithms to parse raw data and detect distinct types of eye movement events, such as fixations, saccades, and pursuit, and then base their results on these. Surprisingly, these algorithms are rarely evaluated. We evaluated the classifications of ten eye-movement event detection algorithms, on data from an SMI HiSpeed 1250 system, and compared them to manual ratings of two human experts. The evaluation focused on fixations, saccades, and post-saccadic oscillations. The evaluation used both event duration parameters, and sample-by-sample comparisons to rank the algorithms. The resulting event durations varied substantially as a function of what algorithm was used. This evaluation differed from previous evaluations by considering a relatively large set of algorithms, multiple events, and data from both static and dynamic stimuli. The main conclusion is that current detectors of only fixations and saccades work reasonably well for static stimuli, but barely better than chance for dynamic stimuli. Differing results across evaluation methods make it difficult to select one winner for fixation detection. For saccade detection, however, the algorithm by Larsson, Nyström and Stridh (IEEE Transaction on Biomedical Engineering, 60(9):2484-2493,2013) outperforms all algorithms in data from both static and dynamic stimuli. The data also show how improperly selected algorithms applied to dynamic data misestimate fixation and saccade properties.

QPSO-Based Adaptive DNA Computing Algorithm

PubMed Central

Karakose, Mehmet; Cigdem, Ugur

2013-01-01

DNA (deoxyribonucleic acid) computing that is a new computation model based on DNA molecules for information storage has been increasingly used for optimization and data analysis in recent years. However, DNA computing algorithm has some limitations in terms of convergence speed, adaptability, and effectiveness. In this paper, a new approach for improvement of DNA computing is proposed. This new approach aims to perform DNA computing algorithm with adaptive parameters towards the desired goal using quantum-behaved particle swarm optimization (QPSO). Some contributions provided by the proposed QPSO based on adaptive DNA computing algorithm are as follows: (1) parameters of population size, crossover rate, maximum number of operations, enzyme and virus mutation rate, and fitness function of DNA computing algorithm are simultaneously tuned for adaptive process, (2) adaptive algorithm is performed using QPSO algorithm for goal-driven progress, faster operation, and flexibility in data, and (3) numerical realization of DNA computing algorithm with proposed approach is implemented in system identification. Two experiments with different systems were carried out to evaluate the performance of the proposed approach with comparative results. Experimental results obtained with Matlab and FPGA demonstrate ability to provide effective optimization, considerable convergence speed, and high accuracy according to DNA computing algorithm. PMID:23935409

Algorithmic Mechanism Design of Evolutionary Computation.

PubMed

Pei, Yan

2015-01-01

We consider algorithmic design, enhancement, and improvement of evolutionary computation as a mechanism design problem. All individuals or several groups of individuals can be considered as self-interested agents. The individuals in evolutionary computation can manipulate parameter settings and operations by satisfying their own preferences, which are defined by an evolutionary computation algorithm designer, rather than by following a fixed algorithm rule. Evolutionary computation algorithm designers or self-adaptive methods should construct proper rules and mechanisms for all agents (individuals) to conduct their evolution behaviour correctly in order to definitely achieve the desired and preset objective(s). As a case study, we propose a formal framework on parameter setting, strategy selection, and algorithmic design of evolutionary computation by considering the Nash strategy equilibrium of a mechanism design in the search process. The evaluation results present the efficiency of the framework. This primary principle can be implemented in any evolutionary computation algorithm that needs to consider strategy selection issues in its optimization process. The final objective of our work is to solve evolutionary computation design as an algorithmic mechanism design problem and establish its fundamental aspect by taking this perspective. This paper is the first step towards achieving this objective by implementing a strategy equilibrium solution (such as Nash equilibrium) in evolutionary computation algorithm.

Algorithmic Mechanism Design of Evolutionary Computation

PubMed Central

2015-01-01

We consider algorithmic design, enhancement, and improvement of evolutionary computation as a mechanism design problem. All individuals or several groups of individuals can be considered as self-interested agents. The individuals in evolutionary computation can manipulate parameter settings and operations by satisfying their own preferences, which are defined by an evolutionary computation algorithm designer, rather than by following a fixed algorithm rule. Evolutionary computation algorithm designers or self-adaptive methods should construct proper rules and mechanisms for all agents (individuals) to conduct their evolution behaviour correctly in order to definitely achieve the desired and preset objective(s). As a case study, we propose a formal framework on parameter setting, strategy selection, and algorithmic design of evolutionary computation by considering the Nash strategy equilibrium of a mechanism design in the search process. The evaluation results present the efficiency of the framework. This primary principle can be implemented in any evolutionary computation algorithm that needs to consider strategy selection issues in its optimization process. The final objective of our work is to solve evolutionary computation design as an algorithmic mechanism design problem and establish its fundamental aspect by taking this perspective. This paper is the first step towards achieving this objective by implementing a strategy equilibrium solution (such as Nash equilibrium) in evolutionary computation algorithm. PMID:26257777

Firefly Mating Algorithm for Continuous Optimization Problems.

PubMed

Ritthipakdee, Amarita; Thammano, Arit; Premasathian, Nol; Jitkongchuen, Duangjai

2017-01-01

This paper proposes a swarm intelligence algorithm, called firefly mating algorithm (FMA), for solving continuous optimization problems. FMA uses genetic algorithm as the core of the algorithm. The main feature of the algorithm is a novel mating pair selection method which is inspired by the following 2 mating behaviors of fireflies in nature: (i) the mutual attraction between males and females causes them to mate and (ii) fireflies of both sexes are of the multiple-mating type, mating with multiple opposite sex partners. A female continues mating until her spermatheca becomes full, and, in the same vein, a male can provide sperms for several females until his sperm reservoir is depleted. This new feature enhances the global convergence capability of the algorithm. The performance of FMA was tested with 20 benchmark functions (sixteen 30-dimensional functions and four 2-dimensional ones) against FA, ALC-PSO, COA, MCPSO, LWGSODE, MPSODDS, DFOA, SHPSOS, LSA, MPDPGA, DE, and GABC algorithms. The experimental results showed that the success rates of our proposed algorithm with these functions were higher than those of other algorithms and the proposed algorithm also required fewer numbers of iterations to reach the global optima.

Firefly Mating Algorithm for Continuous Optimization Problems

PubMed Central

Ritthipakdee, Amarita; Premasathian, Nol; Jitkongchuen, Duangjai

2017-01-01

This paper proposes a swarm intelligence algorithm, called firefly mating algorithm (FMA), for solving continuous optimization problems. FMA uses genetic algorithm as the core of the algorithm. The main feature of the algorithm is a novel mating pair selection method which is inspired by the following 2 mating behaviors of fireflies in nature: (i) the mutual attraction between males and females causes them to mate and (ii) fireflies of both sexes are of the multiple-mating type, mating with multiple opposite sex partners. A female continues mating until her spermatheca becomes full, and, in the same vein, a male can provide sperms for several females until his sperm reservoir is depleted. This new feature enhances the global convergence capability of the algorithm. The performance of FMA was tested with 20 benchmark functions (sixteen 30-dimensional functions and four 2-dimensional ones) against FA, ALC-PSO, COA, MCPSO, LWGSODE, MPSODDS, DFOA, SHPSOS, LSA, MPDPGA, DE, and GABC algorithms. The experimental results showed that the success rates of our proposed algorithm with these functions were higher than those of other algorithms and the proposed algorithm also required fewer numbers of iterations to reach the global optima. PMID:28808442

An Algorithmic Framework for Multiobjective Optimization

PubMed Central

Ganesan, T.; Elamvazuthi, I.; Shaari, Ku Zilati Ku; Vasant, P.

2013-01-01

Multiobjective (MO) optimization is an emerging field which is increasingly being encountered in many fields globally. Various metaheuristic techniques such as differential evolution (DE), genetic algorithm (GA), gravitational search algorithm (GSA), and particle swarm optimization (PSO) have been used in conjunction with scalarization techniques such as weighted sum approach and the normal-boundary intersection (NBI) method to solve MO problems. Nevertheless, many challenges still arise especially when dealing with problems with multiple objectives (especially in cases more than two). In addition, problems with extensive computational overhead emerge when dealing with hybrid algorithms. This paper discusses these issues by proposing an alternative framework that utilizes algorithmic concepts related to the problem structure for generating efficient and effective algorithms. This paper proposes a framework to generate new high-performance algorithms with minimal computational overhead for MO optimization. PMID:24470795

The Rational Hybrid Monte Carlo algorithm

NASA Astrophysics Data System (ADS)

Clark, Michael

2006-12-01

The past few years have seen considerable progress in algorithmic development for the generation of gauge fields including the effects of dynamical fermions. The Rational Hybrid Monte Carlo (RHMC) algorithm, where Hybrid Monte Carlo is performed using a rational approximation in place the usual inverse quark matrix kernel is one of these developments. This algorithm has been found to be extremely beneficial in many areas of lattice QCD (chiral fermions, finite temperature, Wilson fermions etc.). We review the algorithm and some of these benefits, and we compare against other recent algorithm developements. We conclude with an update of the Berlin wall plot comparing costs of all popular fermion formulations.

Algorithms for accelerated convergence of adaptive PCA.

PubMed

Chatterjee, C; Kang, Z; Roychowdhury, V P

2000-01-01

We derive and discuss new adaptive algorithms for principal component analysis (PCA) that are shown to converge faster than the traditional PCA algorithms due to Oja, Sanger, and Xu. It is well known that traditional PCA algorithms that are derived by using gradient descent on an objective function are slow to converge. Furthermore, the convergence of these algorithms depends on appropriate choices of the gain sequences. Since online applications demand faster convergence and an automatic selection of gains, we present new adaptive algorithms to solve these problems. We first present an unconstrained objective function, which can be minimized to obtain the principal components. We derive adaptive algorithms from this objective function by using: 1) gradient descent; 2) steepest descent; 3) conjugate direction; and 4) Newton-Raphson methods. Although gradient descent produces Xu's LMSER algorithm, the steepest descent, conjugate direction, and Newton-Raphson methods produce new adaptive algorithms for PCA. We also provide a discussion on the landscape of the objective function, and present a global convergence proof of the adaptive gradient descent PCA algorithm using stochastic approximation theory. Extensive experiments with stationary and nonstationary multidimensional Gaussian sequences show faster convergence of the new algorithms over the traditional gradient descent methods.We also compare the steepest descent adaptive algorithm with state-of-the-art methods on stationary and nonstationary sequences.

Multimodal Estimation of Distribution Algorithms.

PubMed

Yang, Qiang; Chen, Wei-Neng; Li, Yun; Chen, C L Philip; Xu, Xiang-Min; Zhang, Jun

2016-02-15

Taking the advantage of estimation of distribution algorithms (EDAs) in preserving high diversity, this paper proposes a multimodal EDA. Integrated with clustering strategies for crowding and speciation, two versions of this algorithm are developed, which operate at the niche level. Then these two algorithms are equipped with three distinctive techniques: 1) a dynamic cluster sizing strategy; 2) an alternative utilization of Gaussian and Cauchy distributions to generate offspring; and 3) an adaptive local search. The dynamic cluster sizing affords a potential balance between exploration and exploitation and reduces the sensitivity to the cluster size in the niching methods. Taking advantages of Gaussian and Cauchy distributions, we generate the offspring at the niche level through alternatively using these two distributions. Such utilization can also potentially offer a balance between exploration and exploitation. Further, solution accuracy is enhanced through a new local search scheme probabilistically conducted around seeds of niches with probabilities determined self-adaptively according to fitness values of these seeds. Extensive experiments conducted on 20 benchmark multimodal problems confirm that both algorithms can achieve competitive performance compared with several state-of-the-art multimodal algorithms, which is supported by nonparametric tests. Especially, the proposed algorithms are very promising for complex problems with many local optima.

Spaceborne SAR Imaging Algorithm for Coherence Optimized.

PubMed

Qiu, Zhiwei; Yue, Jianping; Wang, Xueqin; Yue, Shun

2016-01-01

This paper proposes SAR imaging algorithm with largest coherence based on the existing SAR imaging algorithm. The basic idea of SAR imaging algorithm in imaging processing is that output signal can have maximum signal-to-noise ratio (SNR) by using the optimal imaging parameters. Traditional imaging algorithm can acquire the best focusing effect, but would bring the decoherence phenomenon in subsequent interference process. Algorithm proposed in this paper is that SAR echo adopts consistent imaging parameters in focusing processing. Although the SNR of the output signal is reduced slightly, their coherence is ensured greatly, and finally the interferogram with high quality is obtained. In this paper, two scenes of Envisat ASAR data in Zhangbei are employed to conduct experiment for this algorithm. Compared with the interferogram from the traditional algorithm, the results show that this algorithm is more suitable for SAR interferometry (InSAR) research and application.

Spaceborne SAR Imaging Algorithm for Coherence Optimized

PubMed Central

Qiu, Zhiwei; Yue, Jianping; Wang, Xueqin; Yue, Shun

2016-01-01

This paper proposes SAR imaging algorithm with largest coherence based on the existing SAR imaging algorithm. The basic idea of SAR imaging algorithm in imaging processing is that output signal can have maximum signal-to-noise ratio (SNR) by using the optimal imaging parameters. Traditional imaging algorithm can acquire the best focusing effect, but would bring the decoherence phenomenon in subsequent interference process. Algorithm proposed in this paper is that SAR echo adopts consistent imaging parameters in focusing processing. Although the SNR of the output signal is reduced slightly, their coherence is ensured greatly, and finally the interferogram with high quality is obtained. In this paper, two scenes of Envisat ASAR data in Zhangbei are employed to conduct experiment for this algorithm. Compared with the interferogram from the traditional algorithm, the results show that this algorithm is more suitable for SAR interferometry (InSAR) research and application. PMID:26871446

Multi-object Detection and Discrimination Algorithms

DTIC Science & Technology

2015-03-26

with  an   algorithm  similar  to  a  depth-­‐first   search .   This  stage  of  the   algorithm  is  O(CN).  From...Multi-object Detection and Discrimination Algorithms This document contains an overview of research and work performed and published at the University...of Florida from October 1, 2009 to October 31, 2013 pertaining to proposal 57306CS: Multi-object Detection and Discrimination Algorithms

QRS Detection Algorithm for Telehealth Electrocardiogram Recordings.

PubMed

Khamis, Heba; Weiss, Robert; Xie, Yang; Chang, Chan-Wei; Lovell, Nigel H; Redmond, Stephen J

2016-07-01

QRS detection algorithms are needed to analyze electrocardiogram (ECG) recordings generated in telehealth environments. However, the numerous published QRS detectors focus on clean clinical data. Here, a "UNSW" QRS detection algorithm is described that is suitable for clinical ECG and also poorer quality telehealth ECG. The UNSW algorithm generates a feature signal containing information about ECG amplitude and derivative, which is filtered according to its frequency content and an adaptive threshold is applied. The algorithm was tested on clinical and telehealth ECG and the QRS detection performance is compared to the Pan-Tompkins (PT) and Gutiérrez-Rivas (GR) algorithm. For the MIT-BIH Arrhythmia database (virtually artifact free, clinical ECG), the overall sensitivity (Se) and positive predictivity (+P) of the UNSW algorithm was >99%, which was comparable to PT and GR. When applied to the MIT-BIH noise stress test database (clinical ECG with added calibrated noise) after artifact masking, all three algorithms had overall Se >99%, and the UNSW algorithm had higher +P (98%, p < 0.05) than PT and GR. For 250 telehealth ECG records (unsupervised recordings; dry metal electrodes), the UNSW algorithm had 98% Se and 95% +P which was superior to PT (+P: p < 0.001) and GR (Se and +P: p < 0.001). This is the first study to describe a QRS detection algorithm for telehealth data and evaluate it on clinical and telehealth ECG with superior results to published algorithms. The UNSW algorithm could be used to manage increasing telehealth ECG analysis workloads.

A pipelined FPGA implementation of an encryption algorithm based on genetic algorithm

NASA Astrophysics Data System (ADS)

Thirer, Nonel

2013-05-01

With the evolution of digital data storage and exchange, it is essential to protect the confidential information from every unauthorized access. High performance encryption algorithms were developed and implemented by software and hardware. Also many methods to attack the cipher text were developed. In the last years, the genetic algorithm has gained much interest in cryptanalysis of cipher texts and also in encryption ciphers. This paper analyses the possibility to use the genetic algorithm as a multiple key sequence generator for an AES (Advanced Encryption Standard) cryptographic system, and also to use a three stages pipeline (with four main blocks: Input data, AES Core, Key generator, Output data) to provide a fast encryption and storage/transmission of a large amount of data.

Conflict-Aware Scheduling Algorithm

NASA Technical Reports Server (NTRS)

Wang, Yeou-Fang; Borden, Chester

2006-01-01

conflict-aware scheduling algorithm is being developed to help automate the allocation of NASA s Deep Space Network (DSN) antennas and equipment that are used to communicate with interplanetary scientific spacecraft. The current approach for scheduling DSN ground resources seeks to provide an equitable distribution of tracking services among the multiple scientific missions and is very labor intensive. Due to the large (and increasing) number of mission requests for DSN services, combined with technical and geometric constraints, the DSN is highly oversubscribed. To help automate the process, and reduce the DSN and spaceflight project labor effort required for initiating, maintaining, and negotiating schedules, a new scheduling algorithm is being developed. The scheduling algorithm generates a "conflict-aware" schedule, where all requests are scheduled based on a dynamic priority scheme. The conflict-aware scheduling algorithm allocates all requests for DSN tracking services while identifying and maintaining the conflicts to facilitate collaboration and negotiation between spaceflight missions. These contrast with traditional "conflict-free" scheduling algorithms that assign tracks that are not in conflict and mark the remainder as unscheduled. In the case where full schedule automation is desired (based on mission/event priorities, fairness, allocation rules, geometric constraints, and ground system capabilities/ constraints), a conflict-free schedule can easily be created from the conflict-aware schedule by removing lower priority items that are in conflict.

One improved LSB steganography algorithm

NASA Astrophysics Data System (ADS)

Song, Bing; Zhang, Zhi-hong

2013-03-01

It is easy to be detected by X2 and RS steganalysis with high accuracy that using LSB algorithm to hide information in digital image. We started by selecting information embedded location and modifying the information embedded method, combined with sub-affine transformation and matrix coding method, improved the LSB algorithm and a new LSB algorithm was proposed. Experimental results show that the improved one can resist the X2 and RS steganalysis effectively.

Integrating Algorithm Visualization Video into a First-Year Algorithm and Data Structure Course

ERIC Educational Resources Information Center

Crescenzi, Pilu; Malizia, Alessio; Verri, M. Cecilia; Diaz, Paloma; Aedo, Ignacio

2012-01-01

In this paper we describe the results that we have obtained while integrating algorithm visualization (AV) movies (strongly tightened with the other teaching material), within a first-year undergraduate course on algorithms and data structures. Our experimental results seem to support the hypothesis that making these movies available significantly…

Silencing of the Rice Gene LRR1 Compromises Rice Xa21 Transcript Accumulation and XA21-Mediated Immunity.

PubMed

Caddell, Daniel F; Park, Chang-Jin; Thomas, Nicholas C; Canlas, Patrick E; Ronald, Pamela C

2017-12-01

The rice immune receptor XA21 confers resistance to Xanthomonas oryzae pv. oryzae (Xoo), the causal agent of bacterial leaf blight. We previously demonstrated that an auxilin-like protein, XA21 BINDING PROTEIN 21 (XB21), positively regulates resistance to Xoo. To further investigate the function of XB21, we performed a yeast two-hybrid screen. We identified 22 unique XB21 interacting proteins, including LEUCINE-RICH REPEAT PROTEIN 1 (LRR1), which we selected for further analysis. Silencing of LRR1 in the XA21 genetic background (XA21-LRR1Ri) compromises resistance to Xoo compared with control XA21 plants. XA21-LRR1Ri plants have reduced Xa21 transcript levels and reduced expression of genes that serve as markers of XA21-mediated activation. Overexpression of LRR1 is insufficient to alter resistance to Xoo in rice lines lacking XA21. Taken together, our results indicate that LRR1 is required for wild-type Xa21 transcript expression and XA21-mediated immunity.

Exploring Sea Quark EMC Effect and Anti-Shadowing Through Drell-Yan at SeaQuest / Fermilab E906

NASA Astrophysics Data System (ADS)

Dannowitz, Bryan; Fermilab E906 / SeaQuest Collaboration

2015-04-01

Fermilab E906/SeaQuest is a fixed-target experiment that uses the 120 GeV Main Injector proton beam. SeaQuest will extract sea anti-quark structure of the proton by detecting dimuon pairs created by Drell-Yan and measuring the cross-section ratios for LH2, LD2, C, Fe, and W targets. The European Muon Collaboration (EMC) discovered that the momentum distribution of quarks in a free nucleon becomes modified when bound within a nucleus. In studying the EMC Effect, an anti-shadowing feature has been observed in DIS and pion-induced DY measurements in the 0 . 1 <xB < 0 . 25 region, but Fermilab E772's results suggest there to be no anti-shadowing in the proton-induced Drell-Yan case. SeaQuest will study these nuclear effects over the anti-shadowing (0 . 1 <xB < 0 . 25) region with higher precision than E772, and it will extend the measurement range well into the largely-unmeasured EMC region, up to xB = 0 . 45 . Preliminary results from the analysis of our 2014 data set will be presented.

Halogen bonding and pharmaceutical cocrystals: the case of a widely used preservative.

PubMed

Baldrighi, Michele; Cavallo, Gabriella; Chierotti, Michele R; Gobetto, Roberto; Metrangolo, Pierangelo; Pilati, Tullio; Resnati, Giuseppe; Terraneo, Giancarlo

2013-05-06

3-Iodo-2-propynyl-N-butylcarbamate (IPBC) is an iodinated antimicrobial product used globally as a preservative, fungicide, and algaecide. IPBC is difficult to obtain in pure form as well as to handle in industrial products because it tends to be sticky and clumpy. Here, we describe the preparation of four pharmaceutical cocrystals involving IPBC. The obtained cocrystals have been characterized by X-ray diffraction, solution and solid-state NMR, IR, and DSC analyses. In all the described cases the halogen bond (XB) is the key interaction responsible for the self-assembly of the pharmaceutical cocrystals thanks to the involvement of the 1-iodoalkyne moiety of IPBC, which functions as a very reliable XB-donor, with both neutral and anionic XB-acceptors. Most of the obtained cocrystals have improved properties with respect to the source API, in terms, e.g., of thermal stability. The cocrystal involving the GRAS excipient CaCl2 has superior powder flow characteristics compared to the pure IPBC, representing a promising solution to the handling issues related to the manufacturing of products containing IPBC.

Measurements of W Erosion using UV Emission from DIII-D and CTH

NASA Astrophysics Data System (ADS)

Johnson, Curtis; Ennis, David; Loch, Stuart; Balance, Connor; Victor, Brian; Allen, Steve; Samuell, Cameron; Abrams, Tyler; Unterberg, Ezekial

2017-10-01

of Plasma Facing Components (PFCs) will play a critical role in establishing the performance of reactor-relevant fusion devices, particularly for tungsten (W) divertor targets. Erosion can be diagnosed from spectral line emission together with atomic coefficients representing the `ionizations per photon' (S/XB). Emission from W I is most intense in the UV region. Thus, UV survey spectrometers (200-400 nm) are used to diagnose W PFCs erosion in the DIII-D divertor and from a W tipped probe in the CTH experiment. Nineteen W emission lines in the UV region are identified between the two experiments, allowing for multiple S/XB erosion measurements. Initial W erosion measurements are compared to erosion using the 400.9 nm W I line. Complete UV spectra will be presented and compared to synthetic spectra for varying plasma conditions. Analysis of the metastable states impact on the S/XB will be presented as well as possible electron temperature and density diagnosis from W I line ratios. Work supported by USDOE Grants DE-SC0015877 & DE-FC02-04ER54698.

Firefly Algorithm, Lévy Flights and Global Optimization

NASA Astrophysics Data System (ADS)

Yang, Xin-She

Nature-inspired algorithms such as Particle Swarm Optimization and Firefly Algorithm are among the most powerful algorithms for optimization. In this paper, we intend to formulate a new metaheuristic algorithm by combining Lévy flights with the search strategy via the Firefly Algorithm. Numerical studies and results suggest that the proposed Lévy-flight firefly algorithm is superior to existing metaheuristic algorithms. Finally implications for further research and wider applications will be discussed.

A novel algorithm for Bluetooth ECG.

PubMed

Pandya, Utpal T; Desai, Uday B

2012-11-01

In wireless transmission of ECG, data latency will be significant when battery power level and data transmission distance are not maintained. In applications like home monitoring or personalized care, to overcome the joint effect of previous issues of wireless transmission and other ECG measurement noises, a novel filtering strategy is required. Here, a novel algorithm, identified as peak rejection adaptive sampling modified moving average (PRASMMA) algorithm for wireless ECG is introduced. This algorithm first removes error in bit pattern of received data if occurred in wireless transmission and then removes baseline drift. Afterward, a modified moving average is implemented except in the region of each QRS complexes. The algorithm also sets its filtering parameters according to different sampling rate selected for acquisition of signals. To demonstrate the work, a prototyped Bluetooth-based ECG module is used to capture ECG with different sampling rate and in different position of patient. This module transmits ECG wirelessly to Bluetooth-enabled devices where the PRASMMA algorithm is applied on captured ECG. The performance of PRASMMA algorithm is compared with moving average and S-Golay algorithms visually as well as numerically. The results show that the PRASMMA algorithm can significantly improve the ECG reconstruction by efficiently removing the noise and its use can be extended to any parameters where peaks are importance for diagnostic purpose.

Comparison of Snow Mass Estimates from a Prototype Passive Microwave Snow Algorithm, a Revised Algorithm and a Snow Depth Climatology

NASA Technical Reports Server (NTRS)

Foster, J. L.; Chang, A. T. C.; Hall, D. K.

1997-01-01

While it is recognized that no single snow algorithm is capable of producing accurate global estimates of snow depth, for research purposes it is useful to test an algorithm's performance in different climatic areas in order to see how it responds to a variety of snow conditions. This study is one of the first to develop separate passive microwave snow algorithms for North America and Eurasia by including parameters that consider the effects of variations in forest cover and crystal size on microwave brightness temperature. A new algorithm (GSFC 1996) is compared to a prototype algorithm (Chang et al., 1987) and to a snow depth climatology (SDC), which for this study is considered to be a standard reference or baseline. It is shown that the GSFC 1996 algorithm compares much more favorably to the SDC than does the Chang et al. (1987) algorithm. For example, in North America in February there is a 15% difference between the GSFC 198-96 Algorithm and the SDC, but with the Chang et al. (1987) algorithm the difference is greater than 50%. In Eurasia, also in February, there is only a 1.3% difference between the GSFC 1996 algorithm and the SDC, whereas with the Chang et al. (1987) algorithm the difference is about 20%. As expected, differences tend to be less when the snow cover extent is greater, particularly for Eurasia. The GSFC 1996 algorithm performs better in North America in each month than dose the Chang et al. (1987) algorithm. This is also the case in Eurasia, except in April and May when the Chang et al.(1987) algorithms is in closer accord to the SDC than is GSFC 1996 algorithm.

Noise-enhanced clustering and competitive learning algorithms.

PubMed

Osoba, Osonde; Kosko, Bart

2013-01-01

Noise can provably speed up convergence in many centroid-based clustering algorithms. This includes the popular k-means clustering algorithm. The clustering noise benefit follows from the general noise benefit for the expectation-maximization algorithm because many clustering algorithms are special cases of the expectation-maximization algorithm. Simulations show that noise also speeds up convergence in stochastic unsupervised competitive learning, supervised competitive learning, and differential competitive learning. Copyright © 2012 Elsevier Ltd. All rights reserved.

Fast algorithm of adaptive Fourier series

NASA Astrophysics Data System (ADS)

Gao, You; Ku, Min; Qian, Tao

2018-05-01

Adaptive Fourier decomposition (AFD, precisely 1-D AFD or Core-AFD) was originated for the goal of positive frequency representations of signals. It achieved the goal and at the same time offered fast decompositions of signals. There then arose several types of AFDs. AFD merged with the greedy algorithm idea, and in particular, motivated the so-called pre-orthogonal greedy algorithm (Pre-OGA) that was proven to be the most efficient greedy algorithm. The cost of the advantages of the AFD type decompositions is, however, the high computational complexity due to the involvement of maximal selections of the dictionary parameters. The present paper offers one formulation of the 1-D AFD algorithm by building the FFT algorithm into it. Accordingly, the algorithm complexity is reduced, from the original $\\mathcal{O}(M N^2)$ to $\\mathcal{O}(M N\\log_2 N)$, where $N$ denotes the number of the discretization points on the unit circle and $M$ denotes the number of points in $[0,1)$. This greatly enhances the applicability of AFD. Experiments are carried out to show the high efficiency of the proposed algorithm.

Comparison between iterative wavefront control algorithm and direct gradient wavefront control algorithm for adaptive optics system

NASA Astrophysics Data System (ADS)

Cheng, Sheng-Yi; Liu, Wen-Jin; Chen, Shan-Qiu; Dong, Li-Zhi; Yang, Ping; Xu, Bing

2015-08-01

Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n2) ˜ O(n3) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ˜ (O(n)3/2), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits. Project supported by the National Key Scientific and Research Equipment Development Project of China (Grant No. ZDYZ2013-2), the National Natural Science Foundation of China (Grant No. 11173008), and the Sichuan Provincial Outstanding Youth Academic Technology Leaders Program, China (Grant No. 2012JQ0012).

Using Alternative Multiplication Algorithms to "Offload" Cognition

ERIC Educational Resources Information Center

Jazby, Dan; Pearn, Cath

2015-01-01

When viewed through a lens of embedded cognition, algorithms may enable aspects of the cognitive work of multi-digit multiplication to be "offloaded" to the environmental structure created by an algorithm. This study analyses four multiplication algorithms by viewing different algorithms as enabling cognitive work to be distributed…

Distilling the Verification Process for Prognostics Algorithms

NASA Technical Reports Server (NTRS)

Roychoudhury, Indranil; Saxena, Abhinav; Celaya, Jose R.; Goebel, Kai

2013-01-01

The goal of prognostics and health management (PHM) systems is to ensure system safety, and reduce downtime and maintenance costs. It is important that a PHM system is verified and validated before it can be successfully deployed. Prognostics algorithms are integral parts of PHM systems. This paper investigates a systematic process of verification of such prognostics algorithms. To this end, first, this paper distinguishes between technology maturation and product development. Then, the paper describes the verification process for a prognostics algorithm as it moves up to higher maturity levels. This process is shown to be an iterative process where verification activities are interleaved with validation activities at each maturation level. In this work, we adopt the concept of technology readiness levels (TRLs) to represent the different maturity levels of a prognostics algorithm. It is shown that at each TRL, the verification of a prognostics algorithm depends on verifying the different components of the algorithm according to the requirements laid out by the PHM system that adopts this prognostics algorithm. Finally, using simplified examples, the systematic process for verifying a prognostics algorithm is demonstrated as the prognostics algorithm moves up TRLs.

Hybrid employment recommendation algorithm based on Spark

NASA Astrophysics Data System (ADS)

Li, Zuoquan; Lin, Yubei; Zhang, Xingming

2017-08-01

Aiming at the real-time application of collaborative filtering employment recommendation algorithm (CF), a clustering collaborative filtering recommendation algorithm (CCF) is developed, which applies hierarchical clustering to CF and narrows the query range of neighbour items. In addition, to solve the cold-start problem of content-based recommendation algorithm (CB), a content-based algorithm with users’ information (CBUI) is introduced for job recommendation. Furthermore, a hybrid recommendation algorithm (HRA) which combines CCF and CBUI algorithms is proposed, and implemented on Spark platform. The experimental results show that HRA can overcome the problems of cold start and data sparsity, and achieve good recommendation accuracy and scalability for employment recommendation.

Categorizing Variations of Student-Implemented Sorting Algorithms

ERIC Educational Resources Information Center

Taherkhani, Ahmad; Korhonen, Ari; Malmi, Lauri

2012-01-01

In this study, we examined freshmen students' sorting algorithm implementations in data structures and algorithms' course in two phases: at the beginning of the course before the students received any instruction on sorting algorithms, and after taking a lecture on sorting algorithms. The analysis revealed that many students have insufficient…

Project resource reallocation algorithm

NASA Technical Reports Server (NTRS)

Myers, J. E.

1981-01-01

A methodology for adjusting baseline cost estimates according to project schedule changes is described. An algorithm which performs a linear expansion or contraction of the baseline project resource distribution in proportion to the project schedule expansion or contraction is presented. Input to the algorithm consists of the deck of cards (PACE input data) prepared for the baseline project schedule as well as a specification of the nature of the baseline schedule change. Output of the algorithm is a new deck of cards with all work breakdown structure block and element of cost estimates redistributed for the new project schedule. This new deck can be processed through PACE to produce a detailed cost estimate for the new schedule.

Algorithm Estimates Microwave Water-Vapor Delay

NASA Technical Reports Server (NTRS)

Robinson, Steven E.

1989-01-01

Accuracy equals or exceeds conventional linear algorithms. "Profile" algorithm improved algorithm using water-vapor-radiometer data to produce estimates of microwave delays caused by water vapor in troposphere. Does not require site-specific and weather-dependent empirical parameters other than standard meteorological data, latitude, and altitude for use in conjunction with published standard atmospheric data. Basic premise of profile algorithm, wet-path delay approximated closely by solution to simplified version of nonlinear delay problem and generated numerically from each radiometer observation and simultaneous meteorological data.

Decoding algorithm for vortex communications receiver

NASA Astrophysics Data System (ADS)

Kupferman, Judy; Arnon, Shlomi

2018-01-01

Vortex light beams can provide a tremendous alphabet for encoding information. We derive a symbol decoding algorithm for a direct detection matrix detector vortex beam receiver using Laguerre Gauss (LG) modes, and develop a mathematical model of symbol error rate (SER) for this receiver. We compare SER as a function of signal to noise ratio (SNR) for our algorithm and for the Pearson correlation algorithm. To our knowledge, this is the first comprehensive treatment of a decoding algorithm of a matrix detector for an LG receiver.

A new bio-inspired optimisation algorithm: Bird Swarm Algorithm

NASA Astrophysics Data System (ADS)

Meng, Xian-Bing; Gao, X. Z.; Lu, Lihua; Liu, Yu; Zhang, Hengzhen

2016-07-01

A new bio-inspired algorithm, namely Bird Swarm Algorithm (BSA), is proposed for solving optimisation applications. BSA is based on the swarm intelligence extracted from the social behaviours and social interactions in bird swarms. Birds mainly have three kinds of behaviours: foraging behaviour, vigilance behaviour and flight behaviour. Birds may forage for food and escape from the predators by the social interactions to obtain a high chance of survival. By modelling these social behaviours, social interactions and the related swarm intelligence, four search strategies associated with five simplified rules are formulated in BSA. Simulations and comparisons based on eighteen benchmark problems demonstrate the effectiveness, superiority and stability of BSA. Some proposals for future research about BSA are also discussed.

Selecting materialized views using random algorithm

NASA Astrophysics Data System (ADS)

Zhou, Lijuan; Hao, Zhongxiao; Liu, Chi

2007-04-01

The data warehouse is a repository of information collected from multiple possibly heterogeneous autonomous distributed databases. The information stored at the data warehouse is in form of views referred to as materialized views. The selection of the materialized views is one of the most important decisions in designing a data warehouse. Materialized views are stored in the data warehouse for the purpose of efficiently implementing on-line analytical processing queries. The first issue for the user to consider is query response time. So in this paper, we develop algorithms to select a set of views to materialize in data warehouse in order to minimize the total view maintenance cost under the constraint of a given query response time. We call it query_cost view_ selection problem. First, cost graph and cost model of query_cost view_ selection problem are presented. Second, the methods for selecting materialized views by using random algorithms are presented. The genetic algorithm is applied to the materialized views selection problem. But with the development of genetic process, the legal solution produced become more and more difficult, so a lot of solutions are eliminated and producing time of the solutions is lengthened in genetic algorithm. Therefore, improved algorithm has been presented in this paper, which is the combination of simulated annealing algorithm and genetic algorithm for the purpose of solving the query cost view selection problem. Finally, in order to test the function and efficiency of our algorithms experiment simulation is adopted. The experiments show that the given methods can provide near-optimal solutions in limited time and works better in practical cases. Randomized algorithms will become invaluable tools for data warehouse evolution.

Efficient Approximation Algorithms for Weighted $b$-Matching

DOE Office of Scientific and Technical Information (OSTI.GOV)

Khan, Arif; Pothen, Alex; Mostofa Ali Patwary, Md.

2016-01-01

We describe a half-approximation algorithm, b-Suitor, for computing a b-Matching of maximum weight in a graph with weights on the edges. b-Matching is a generalization of the well-known Matching problem in graphs, where the objective is to choose a subset of M edges in the graph such that at most a specified number b(v) of edges in M are incident on each vertex v. Subject to this restriction we maximize the sum of the weights of the edges in M. We prove that the b-Suitor algorithm computes the same b-Matching as the one obtained by the greedy algorithm for themore » problem. We implement the algorithm on serial and shared-memory parallel processors, and compare its performance against a collection of approximation algorithms that have been proposed for the Matching problem. Our results show that the b-Suitor algorithm outperforms the Greedy and Locally Dominant edge algorithms by one to two orders of magnitude on a serial processor. The b-Suitor algorithm has a high degree of concurrency, and it scales well up to 240 threads on a shared memory multiprocessor. The b-Suitor algorithm outperforms the Locally Dominant edge algorithm by a factor of fourteen on 16 cores of an Intel Xeon multiprocessor.« less

[An improved algorithm for electrohysterogram envelope extraction].

PubMed

Lu, Yaosheng; Pan, Jie; Chen, Zhaoxia; Chen, Zhaoxia

2017-02-01

Extraction uterine contraction signal from abdominal uterine electromyogram(EMG) signal is considered as the most promising method to replace the traditional tocodynamometer(TOCO) for detecting uterine contractions activity. The traditional root mean square(RMS) algorithm has only some limited values in canceling the impulsive noise. In our study, an improved algorithm for uterine EMG envelope extraction was proposed to overcome the problem. Firstly, in our experiment, zero-crossing detection method was used to separate the burst of uterine electrical activity from the raw uterine EMG signal. After processing the separated signals by employing two filtering windows which have different width, we used the traditional RMS algorithm to extract uterus EMG envelope. To assess the performance of the algorithm, the improved algorithm was compared with two existing intensity of uterine electromyogram(IEMG) extraction algorithms. The results showed that the improved algorithm was better than the traditional ones in eliminating impulsive noise present in the uterine EMG signal. The measurement sensitivity and positive predictive value(PPV) of the improved algorithm were 0.952 and 0.922, respectively, which were not only significantly higher than the corresponding values(0.859 and 0.847) of the first comparison algorithm, but also higher than the values(0.928 and 0.877) of the second comparison algorithm. Thus the new method is reliable and effective.

Seamless Merging of Hypertext and Algorithm Animation

ERIC Educational Resources Information Center

Karavirta, Ville

2009-01-01

Online learning material that students use by themselves is one of the typical usages of algorithm animation (AA). Thus, the integration of algorithm animations into hypertext is seen as an important topic today to promote the usage of algorithm animation in teaching. This article presents an algorithm animation viewer implemented purely using…

Multicore and GPU algorithms for Nussinov RNA folding

PubMed Central

2014-01-01

Background One segment of a RNA sequence might be paired with another segment of the same RNA sequence due to the force of hydrogen bonds. This two-dimensional structure is called the RNA sequence's secondary structure. Several algorithms have been proposed to predict an RNA sequence's secondary structure. These algorithms are referred to as RNA folding algorithms. Results We develop cache efficient, multicore, and GPU algorithms for RNA folding using Nussinov's algorithm. Conclusions Our cache efficient algorithm provides a speedup between 1.6 and 3.0 relative to a naive straightforward single core code. The multicore version of the cache efficient single core algorithm provides a speedup, relative to the naive single core algorithm, between 7.5 and 14.0 on a 6 core hyperthreaded CPU. Our GPU algorithm for the NVIDIA C2050 is up to 1582 times as fast as the naive single core algorithm and between 5.1 and 11.2 times as fast as the fastest previously known GPU algorithm for Nussinov RNA folding. PMID:25082539

Array architectures for iterative algorithms

NASA Technical Reports Server (NTRS)

Jagadish, Hosagrahar V.; Rao, Sailesh K.; Kailath, Thomas

1987-01-01

Regular mesh-connected arrays are shown to be isomorphic to a class of so-called regular iterative algorithms. For a wide variety of problems it is shown how to obtain appropriate iterative algorithms and then how to translate these algorithms into arrays in a systematic fashion. Several 'systolic' arrays presented in the literature are shown to be specific cases of the variety of architectures that can be derived by the techniques presented here. These include arrays for Fourier Transform, Matrix Multiplication, and Sorting.

Testing block subdivision algorithms on block designs

NASA Astrophysics Data System (ADS)

Wiseman, Natalie; Patterson, Zachary

2016-01-01

Integrated land use-transportation models predict future transportation demand taking into account how households and firms arrange themselves partly as a function of the transportation system. Recent integrated models require parcels as inputs and produce household and employment predictions at the parcel scale. Block subdivision algorithms automatically generate parcel patterns within blocks. Evaluating block subdivision algorithms is done by way of generating parcels and comparing them to those in a parcel database. Three block subdivision algorithms are evaluated on how closely they reproduce parcels of different block types found in a parcel database from Montreal, Canada. While the authors who developed each of the algorithms have evaluated them, they have used their own metrics and block types to evaluate their own algorithms. This makes it difficult to compare their strengths and weaknesses. The contribution of this paper is in resolving this difficulty with the aim of finding a better algorithm suited to subdividing each block type. The proposed hypothesis is that given the different approaches that block subdivision algorithms take, it's likely that different algorithms are better adapted to subdividing different block types. To test this, a standardized block type classification is used that consists of mutually exclusive and comprehensive categories. A statistical method is used for finding a better algorithm and the probability it will perform well for a given block type. Results suggest the oriented bounding box algorithm performs better for warped non-uniform sites, as well as gridiron and fragmented uniform sites. It also produces more similar parcel areas and widths. The Generalized Parcel Divider 1 algorithm performs better for gridiron non-uniform sites. The Straight Skeleton algorithm performs better for loop and lollipop networks as well as fragmented non-uniform and warped uniform sites. It also produces more similar parcel shapes and patterns.

Digital signal processing algorithms for automatic voice recognition

NASA Technical Reports Server (NTRS)

Botros, Nazeih M.

1987-01-01

The current digital signal analysis algorithms are investigated that are implemented in automatic voice recognition algorithms. Automatic voice recognition means, the capability of a computer to recognize and interact with verbal commands. The digital signal is focused on, rather than the linguistic, analysis of speech signal. Several digital signal processing algorithms are available for voice recognition. Some of these algorithms are: Linear Predictive Coding (LPC), Short-time Fourier Analysis, and Cepstrum Analysis. Among these algorithms, the LPC is the most widely used. This algorithm has short execution time and do not require large memory storage. However, it has several limitations due to the assumptions used to develop it. The other 2 algorithms are frequency domain algorithms with not many assumptions, but they are not widely implemented or investigated. However, with the recent advances in the digital technology, namely signal processors, these 2 frequency domain algorithms may be investigated in order to implement them in voice recognition. This research is concerned with real time, microprocessor based recognition algorithms.

N-terminal pro-B-type natriuretic peptide diagnostic algorithm versus American Heart Association algorithm for Kawasaki disease.

PubMed

Dionne, Audrey; Meloche-Dumas, Léamarie; Desjardins, Laurent; Turgeon, Jean; Saint-Cyr, Claire; Autmizguine, Julie; Spigelblatt, Linda; Fournier, Anne; Dahdah, Nagib

2017-03-01

Diagnosis of Kawasaki disease (KD) can be challenging in the absence of a confirmatory test or pathognomonic finding, especially when clinical criteria are incomplete. We recently proposed serum N-terminal pro-B-type natriuretic peptide (NT-proBNP) as an adjunctive diagnostic test. We retrospectively tested a new algorithm to help KD diagnosis based on NT-proBNP, coronary artery dilation (CAD) at onset, and abnormal serum albumin or C-reactive protein (CRP). The goal was to assess the performance of the algorithm and compare its performance with that of the 2004 American Heart Association (AHA)/American Academy of Pediatrics (AAP) algorithm. The algorithm was tested on 124 KD patients with NT-proBNP measured on admission at the present institutions between 2007 and 2013. Age at diagnosis was 3.4 ± 3.0 years, with a median of five diagnostic criteria; and 55 of the 124 patients (44%) had incomplete KD. CA complications occurred in 64 (52%), with aneurysm in 14 (11%). Using this algorithm, 120/124 (97%) were to be treated, based on high NT-proBNP alone for 79 (64%); on onset CAD for 14 (11%); and on high CRP or low albumin for 27 (22%). Using the AHA/AAP algorithm, 22/47 (47%) of the eligible patients with incomplete KD would not have been referred for treatment, compared with 3/55 (5%) with the NT-proBNP algorithm (P < 0.001). This NT-proBNP-based algorithm is efficient to identify and treat patients with KD, including those with incomplete KD. This study paves the way for a prospective validation trial of the algorithm. © 2016 Japan Pediatric Society.

Faster Parameterized Algorithms for Minor Containment

NASA Astrophysics Data System (ADS)

Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M.

The theory of Graph Minors by Robertson and Seymour is one of the deepest and significant theories in modern Combinatorics. This theory has also a strong impact on the recent development of Algorithms, and several areas, like Parameterized Complexity, have roots in Graph Minors. Until very recently it was a common belief that Graph Minors Theory is mainly of theoretical importance. However, it appears that many deep results from Robertson and Seymour's theory can be also used in the design of practical algorithms. Minor containment testing is one of algorithmically most important and technical parts of the theory, and minor containment in graphs of bounded branchwidth is a basic ingredient of this algorithm. In order to implement minor containment testing on graphs of bounded branchwidth, Hicks [NETWORKS 04] described an algorithm, that in time O(3^{k^2}\\cdot (h+k-1)!\\cdot m) decides if a graph G with m edges and branchwidth k, contains a fixed graph H on h vertices as a minor. That algorithm follows the ideas introduced by Robertson and Seymour in [J'CTSB 95]. In this work we improve the dependence on k of Hicks' result by showing that checking if H is a minor of G can be done in time O(2^{(2k +1 )\\cdot log k} \\cdot h^{2k} \\cdot 2^{2h^2} \\cdot m). Our approach is based on a combinatorial object called rooted packing, which captures the properties of the potential models of subgraphs of H that we seek in our dynamic programming algorithm. This formulation with rooted packings allows us to speed up the algorithm when G is embedded in a fixed surface, obtaining the first single-exponential algorithm for minor containment testing. Namely, it runs in time 2^{O(k)} \\cdot h^{2k} \\cdot 2^{O(h)} \\cdot n, with n = |V(G)|. Finally, we show that slight modifications of our algorithm permit to solve some related problems within the same time bounds, like induced minor or contraction minor containment.

PSC algorithm description

NASA Technical Reports Server (NTRS)

Nobbs, Steven G.

1995-01-01

An overview of the performance seeking control (PSC) algorithm and details of the important components of the algorithm are given. The onboard propulsion system models, the linear programming optimization, and engine control interface are described. The PSC algorithm receives input from various computers on the aircraft including the digital flight computer, digital engine control, and electronic inlet control. The PSC algorithm contains compact models of the propulsion system including the inlet, engine, and nozzle. The models compute propulsion system parameters, such as inlet drag and fan stall margin, which are not directly measurable in flight. The compact models also compute sensitivities of the propulsion system parameters to change in control variables. The engine model consists of a linear steady state variable model (SSVM) and a nonlinear model. The SSVM is updated with efficiency factors calculated in the engine model update logic, or Kalman filter. The efficiency factors are used to adjust the SSVM to match the actual engine. The propulsion system models are mathematically integrated to form an overall propulsion system model. The propulsion system model is then optimized using a linear programming optimization scheme. The goal of the optimization is determined from the selected PSC mode of operation. The resulting trims are used to compute a new operating point about which the optimization process is repeated. This process is continued until an overall (global) optimum is reached before applying the trims to the controllers.

A community detection algorithm based on structural similarity

NASA Astrophysics Data System (ADS)

Guo, Xuchao; Hao, Xia; Liu, Yaqiong; Zhang, Li; Wang, Lu

2017-09-01

In order to further improve the efficiency and accuracy of community detection algorithm, a new algorithm named SSTCA (the community detection algorithm based on structural similarity with threshold) is proposed. In this algorithm, the structural similarities are taken as the weights of edges, and the threshold k is considered to remove multiple edges whose weights are less than the threshold, and improve the computational efficiency. Tests were done on the Zachary’s network, Dolphins’ social network and Football dataset by the proposed algorithm, and compared with GN and SSNCA algorithm. The results show that the new algorithm is superior to other algorithms in accuracy for the dense networks and the operating efficiency is improved obviously.

Two Improved Algorithms for Envelope and Wavefront Reduction

NASA Technical Reports Server (NTRS)

Kumfert, Gary; Pothen, Alex

1997-01-01

Two algorithms for reordering sparse, symmetric matrices or undirected graphs to reduce envelope and wavefront are considered. The first is a combinatorial algorithm introduced by Sloan and further developed by Duff, Reid, and Scott; we describe enhancements to the Sloan algorithm that improve its quality and reduce its run time. Our test problems fall into two classes with differing asymptotic behavior of their envelope parameters as a function of the weights in the Sloan algorithm. We describe an efficient 0(nlogn + m) time implementation of the Sloan algorithm, where n is the number of rows (vertices), and m is the number of nonzeros (edges). On a collection of test problems, the improved Sloan algorithm required, on the average, only twice the time required by the simpler Reverse Cuthill-Mckee algorithm while improving the mean square wavefront by a factor of three. The second algorithm is a hybrid that combines a spectral algorithm for envelope and wavefront reduction with a refinement step that uses a modified Sloan algorithm. The hybrid algorithm reduces the envelope size and mean square wavefront obtained from the Sloan algorithm at the cost of greater running times. We illustrate how these reductions translate into tangible benefits for frontal Cholesky factorization and incomplete factorization preconditioning.

Privacy Preservation in Distributed Subgradient Optimization Algorithms.

PubMed

Lou, Youcheng; Yu, Lean; Wang, Shouyang; Yi, Peng

2017-07-31

In this paper, some privacy-preserving features for distributed subgradient optimization algorithms are considered. Most of the existing distributed algorithms focus mainly on the algorithm design and convergence analysis, but not the protection of agents' privacy. Privacy is becoming an increasingly important issue in applications involving sensitive information. In this paper, we first show that the distributed subgradient synchronous homogeneous-stepsize algorithm is not privacy preserving in the sense that the malicious agent can asymptotically discover other agents' subgradients by transmitting untrue estimates to its neighbors. Then a distributed subgradient asynchronous heterogeneous-stepsize projection algorithm is proposed and accordingly its convergence and optimality is established. In contrast to the synchronous homogeneous-stepsize algorithm, in the new algorithm agents make their optimization updates asynchronously with heterogeneous stepsizes. The introduced two mechanisms of projection operation and asynchronous heterogeneous-stepsize optimization can guarantee that agents' privacy can be effectively protected.

The Texas Children's Medication Algorithm Project: Revision of the Algorithm for Pharmacotherapy of Attention-Deficit/Hyperactivity Disorder

ERIC Educational Resources Information Center

Pliszka, Steven R.; Crismon, M. Lynn; Hughes, Carroll W.; Corners, C. Keith; Emslie, Graham J.; Jensen, Peter S.; McCracken, James T.; Swanson, James M.; Lopez, Molly

2006-01-01

Objective: In 1998, the Texas Department of Mental Health and Mental Retardation developed algorithms for medication treatment of attention-deficit/hyperactivity disorder (ADHD). Advances in the psychopharmacology of ADHD and results of a feasibility study of algorithm use in community mental health centers caused the algorithm to be modified and…

Classification of voting algorithms for N-version software

NASA Astrophysics Data System (ADS)

Tsarev, R. Yu; Durmuş, M. S.; Üstoglu, I.; Morozov, V. A.

2018-05-01

A voting algorithm in N-version software is a crucial component that evaluates the execution of each of the N versions and determines the correct result. Obviously, the result of the voting algorithm determines the outcome of the N-version software in general. Thus, the choice of the voting algorithm is a vital issue. A lot of voting algorithms were already developed and they may be selected for implementation based on the specifics of the analysis of input data. However, the voting algorithms applied in N-version software are not classified. This article presents an overview of classic and recent voting algorithms used in N-version software and the authors' classification of the voting algorithms. Moreover, the steps of the voting algorithms are presented and the distinctive features of the voting algorithms in Nversion software are defined.

Operational algorithm development and refinement approaches

NASA Astrophysics Data System (ADS)

Ardanuy, Philip E.

2003-11-01

Next-generation polar and geostationary systems, such as the National Polar-orbiting Operational Environmental Satellite System (NPOESS) and the Geostationary Operational Environmental Satellite (GOES)-R, will deploy new generations of electro-optical reflective and emissive capabilities. These will include low-radiometric-noise, improved spatial resolution multi-spectral and hyperspectral imagers and sounders. To achieve specified performances (e.g., measurement accuracy, precision, uncertainty, and stability), and best utilize the advanced space-borne sensing capabilities, a new generation of retrieval algorithms will be implemented. In most cases, these advanced algorithms benefit from ongoing testing and validation using heritage research mission algorithms and data [e.g., the Earth Observing System (EOS)] Moderate-resolution Imaging Spectroradiometer (MODIS) and Shuttle Ozone Limb Scattering Experiment (SOLSE)/Limb Ozone Retreival Experiment (LORE). In these instances, an algorithm's theoretical basis is not static, but rather improves with time. Once frozen, an operational algorithm can "lose ground" relative to research analogs. Cost/benefit analyses provide a basis for change management. The challenge is in reconciling and balancing the stability, and "comfort," that today"s generation of operational platforms provide (well-characterized, known, sensors and algorithms) with the greatly improved quality, opportunities, and risks, that the next generation of operational sensors and algorithms offer. By using the best practices and lessons learned from heritage/groundbreaking activities, it is possible to implement an agile process that enables change, while managing change. This approach combines a "known-risk" frozen baseline with preset completion schedules with insertion opportunities for algorithm advances as ongoing validation activities identify and repair areas of weak performance. This paper describes an objective, adaptive implementation roadmap that

Intelligent Use of CFAR Algorithms

DTIC Science & Technology

1993-05-01

the reference windows can raise the threshold too high in many CFAR algorithms and result in masking of targets. GCMLD is a modification of CMLD that...AD-A267 755 RL-TR-93-75 III 11 III II liiI Interim Report May 1993 INTELLIGENT USE OF CFAR ALGORITHMS Kaman Sciences Corporation P. Antonik, B...AND DATES COVERED IMay 1993 Inte ’rim Jan 92 - Se2 92 4. TITLE AND SUBTITLE 5. FUNDING NUMBERS INTELLIGENT USE OF CFAR ALGORITHMS C - F30602-91-C-0017

Approximation algorithms for planning and control

NASA Technical Reports Server (NTRS)

Boddy, Mark; Dean, Thomas

1989-01-01

A control system operating in a complex environment will encounter a variety of different situations, with varying amounts of time available to respond to critical events. Ideally, such a control system will do the best possible with the time available. In other words, its responses should approximate those that would result from having unlimited time for computation, where the degree of the approximation depends on the amount of time it actually has. There exist approximation algorithms for a wide variety of problems. Unfortunately, the solution to any reasonably complex control problem will require solving several computationally intensive problems. Algorithms for successive approximation are a subclass of the class of anytime algorithms, algorithms that return answers for any amount of computation time, where the answers improve as more time is allotted. An architecture is described for allocating computation time to a set of anytime algorithms, based on expectations regarding the value of the answers they return. The architecture described is quite general, producing optimal schedules for a set of algorithms under widely varying conditions.

Gradient Evolution-based Support Vector Machine Algorithm for Classification

NASA Astrophysics Data System (ADS)

Zulvia, Ferani E.; Kuo, R. J.

2018-03-01

This paper proposes a classification algorithm based on a support vector machine (SVM) and gradient evolution (GE) algorithms. SVM algorithm has been widely used in classification. However, its result is significantly influenced by the parameters. Therefore, this paper aims to propose an improvement of SVM algorithm which can find the best SVMs’ parameters automatically. The proposed algorithm employs a GE algorithm to automatically determine the SVMs’ parameters. The GE algorithm takes a role as a global optimizer in finding the best parameter which will be used by SVM algorithm. The proposed GE-SVM algorithm is verified using some benchmark datasets and compared with other metaheuristic-based SVM algorithms. The experimental results show that the proposed GE-SVM algorithm obtains better results than other algorithms tested in this paper.

A new algorithm for attitude-independent magnetometer calibration

NASA Technical Reports Server (NTRS)

Alonso, Roberto; Shuster, Malcolm D.

1994-01-01

A new algorithm is developed for inflight magnetometer bias determination without knowledge of the attitude. This algorithm combines the fast convergence of a heuristic algorithm currently in use with the correct treatment of the statistics and without discarding data. The algorithm performance is examined using simulated data and compared with previous algorithms.

The Chandra Source Catalog: Algorithms

NASA Astrophysics Data System (ADS)

McDowell, Jonathan; Evans, I. N.; Primini, F. A.; Glotfelty, K. J.; McCollough, M. L.; Houck, J. C.; Nowak, M. A.; Karovska, M.; Davis, J. E.; Rots, A. H.; Siemiginowska, A. L.; Hain, R.; Evans, J. D.; Anderson, C. S.; Bonaventura, N. R.; Chen, J. C.; Doe, S. M.; Fabbiano, G.; Galle, E. C.; Gibbs, D. G., II; Grier, J. D.; Hall, D. M.; Harbo, P. N.; He, X.; Lauer, J.; Miller, J. B.; Mitschang, A. W.; Morgan, D. L.; Nichols, J. S.; Plummer, D. A.; Refsdal, B. L.; Sundheim, B. A.; Tibbetts, M. S.; van Stone, D. W.; Winkelman, S. L.; Zografou, P.

2009-09-01

Creation of the Chandra Source Catalog (CSC) required adjustment of existing pipeline processing, adaptation of existing interactive analysis software for automated use, and development of entirely new algorithms. Data calibration was based on the existing pipeline, but more rigorous data cleaning was applied and the latest calibration data products were used. For source detection, a local background map was created including the effects of ACIS source readout streaks. The existing wavelet source detection algorithm was modified and a set of post-processing scripts used to correct the results. To analyse the source properties we ran the SAO Traceray trace code for each source to generate a model point spread function, allowing us to find encircled energy correction factors and estimate source extent. Further algorithms were developed to characterize the spectral, spatial and temporal properties of the sources and to estimate the confidence intervals on count rates and fluxes. Finally, sources detected in multiple observations were matched, and best estimates of their merged properties derived. In this paper we present an overview of the algorithms used, with more detailed treatment of some of the newly developed algorithms presented in companion papers.

A quantum–quantum Metropolis algorithm

PubMed Central

Yung, Man-Hong; Aspuru-Guzik, Alán

2012-01-01

The classical Metropolis sampling method is a cornerstone of many statistical modeling applications that range from physics, chemistry, and biology to economics. This method is particularly suitable for sampling the thermal distributions of classical systems. The challenge of extending this method to the simulation of arbitrary quantum systems is that, in general, eigenstates of quantum Hamiltonians cannot be obtained efficiently with a classical computer. However, this challenge can be overcome by quantum computers. Here, we present a quantum algorithm which fully generalizes the classical Metropolis algorithm to the quantum domain. The meaning of quantum generalization is twofold: The proposed algorithm is not only applicable to both classical and quantum systems, but also offers a quantum speedup relative to the classical counterpart. Furthermore, unlike the classical method of quantum Monte Carlo, this quantum algorithm does not suffer from the negative-sign problem associated with fermionic systems. Applications of this algorithm include the study of low-temperature properties of quantum systems, such as the Hubbard model, and preparing the thermal states of sizable molecules to simulate, for example, chemical reactions at an arbitrary temperature. PMID:22215584

A Novel Algorithm Combining Finite State Method and Genetic Algorithm for Solving Crude Oil Scheduling Problem

PubMed Central

Duan, Qian-Qian; Yang, Gen-Ke; Pan, Chang-Chun

2014-01-01

A hybrid optimization algorithm combining finite state method (FSM) and genetic algorithm (GA) is proposed to solve the crude oil scheduling problem. The FSM and GA are combined to take the advantage of each method and compensate deficiencies of individual methods. In the proposed algorithm, the finite state method makes up for the weakness of GA which is poor at local searching ability. The heuristic returned by the FSM can guide the GA algorithm towards good solutions. The idea behind this is that we can generate promising substructure or partial solution by using FSM. Furthermore, the FSM can guarantee that the entire solution space is uniformly covered. Therefore, the combination of the two algorithms has better global performance than the existing GA or FSM which is operated individually. Finally, a real-life crude oil scheduling problem from the literature is used for conducting simulation. The experimental results validate that the proposed method outperforms the state-of-art GA method. PMID:24772031

A controllable sensor management algorithm capable of learning

NASA Astrophysics Data System (ADS)

Osadciw, Lisa A.; Veeramacheneni, Kalyan K.

2005-03-01

Sensor management technology progress is challenged by the geographic space it spans, the heterogeneity of the sensors, and the real-time timeframes within which plans controlling the assets are executed. This paper presents a new sensor management paradigm and demonstrates its application in a sensor management algorithm designed for a biometric access control system. This approach consists of an artificial intelligence (AI) algorithm focused on uncertainty measures, which makes the high level decisions to reduce uncertainties and interfaces with the user, integrated cohesively with a bottom up evolutionary algorithm, which optimizes the sensor network"s operation as determined by the AI algorithm. The sensor management algorithm presented is composed of a Bayesian network, the AI algorithm component, and a swarm optimization algorithm, the evolutionary algorithm. Thus, the algorithm can change its own performance goals in real-time and will modify its own decisions based on observed measures within the sensor network. The definition of the measures as well as the Bayesian network determine the robustness of the algorithm and its utility in reacting dynamically to changes in the global system.

Basic firefly algorithm for document clustering

NASA Astrophysics Data System (ADS)

Mohammed, Athraa Jasim; Yusof, Yuhanis; Husni, Husniza

2015-12-01

The Document clustering plays significant role in Information Retrieval (IR) where it organizes documents prior to the retrieval process. To date, various clustering algorithms have been proposed and this includes the K-means and Particle Swarm Optimization. Even though these algorithms have been widely applied in many disciplines due to its simplicity, such an approach tends to be trapped in a local minimum during its search for an optimal solution. To address the shortcoming, this paper proposes a Basic Firefly (Basic FA) algorithm to cluster text documents. The algorithm employs the Average Distance to Document Centroid (ADDC) as the objective function of the search. Experiments utilizing the proposed algorithm were conducted on the 20Newsgroups benchmark dataset. Results demonstrate that the Basic FA generates a more robust and compact clusters than the ones produced by K-means and Particle Swarm Optimization (PSO).

A sampling algorithm for segregation analysis

PubMed Central

Tier, Bruce; Henshall, John

2001-01-01

Methods for detecting Quantitative Trait Loci (QTL) without markers have generally used iterative peeling algorithms for determining genotype probabilities. These algorithms have considerable shortcomings in complex pedigrees. A Monte Carlo Markov chain (MCMC) method which samples the pedigree of the whole population jointly is described. Simultaneous sampling of the pedigree was achieved by sampling descent graphs using the Metropolis-Hastings algorithm. A descent graph describes the inheritance state of each allele and provides pedigrees guaranteed to be consistent with Mendelian sampling. Sampling descent graphs overcomes most, if not all, of the limitations incurred by iterative peeling algorithms. The algorithm was able to find the QTL in most of the simulated populations. However, when the QTL was not modeled or found then its effect was ascribed to the polygenic component. No QTL were detected when they were not simulated. PMID:11742631

Halftoning Algorithms and Systems.

DTIC Science & Technology

1996-08-01

TERMS 15. NUMBER IF PAGESi. Halftoning algorithms; error diffusions ; color printing; topographic maps 16. PRICE CODE 17. SECURITY CLASSIFICATION 18...graylevels for each screen level. In the case of error diffusion algorithms, the calibration procedure using the new centering concept manifests itself as a...Novel Centering Concept for Overlapping Correction Paper / Transparency (Patent Applied 5/94)I * Applications To Error Diffusion * To Dithering (IS&T

Sorting on STAR. [CDC computer algorithm timing comparison

NASA Technical Reports Server (NTRS)

Stone, H. S.

1978-01-01

Timing comparisons are given for three sorting algorithms written for the CDC STAR computer. One algorithm is Hoare's (1962) Quicksort, which is the fastest or nearly the fastest sorting algorithm for most computers. A second algorithm is a vector version of Quicksort that takes advantage of the STAR's vector operations. The third algorithm is an adaptation of Batcher's (1968) sorting algorithm, which makes especially good use of vector operations but has a complexity of N(log N)-squared as compared with a complexity of N log N for the Quicksort algorithms. In spite of its worse complexity, Batcher's sorting algorithm is competitive with the serial version of Quicksort for vectors up to the largest that can be treated by STAR. Vector Quicksort outperforms the other two algorithms and is generally preferred. These results indicate that unusual instruction sets can introduce biases in program execution time that counter results predicted by worst-case asymptotic complexity analysis.

Genetic algorithms using SISAL parallel programming language

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tejada, S.

1994-05-06

Genetic algorithms are a mathematical optimization technique developed by John Holland at the University of Michigan [1]. The SISAL programming language possesses many of the characteristics desired to implement genetic algorithms. SISAL is a deterministic, functional programming language which is inherently parallel. Because SISAL is functional and based on mathematical concepts, genetic algorithms can be efficiently translated into the language. Several of the steps involved in genetic algorithms, such as mutation, crossover, and fitness evaluation, can be parallelized using SISAL. In this paper I will l discuss the implementation and performance of parallel genetic algorithms in SISAL.

In-Trail Procedure (ITP) Algorithm Design

NASA Technical Reports Server (NTRS)

Munoz, Cesar A.; Siminiceanu, Radu I.

2007-01-01

The primary objective of this document is to provide a detailed description of the In-Trail Procedure (ITP) algorithm, which is part of the Airborne Traffic Situational Awareness In-Trail Procedure (ATSA-ITP) application. To this end, the document presents a high level description of the ITP Algorithm and a prototype implementation of this algorithm in the programming language C.

Clustering algorithm for determining community structure in large networks

NASA Astrophysics Data System (ADS)

Pujol, Josep M.; Béjar, Javier; Delgado, Jordi

2006-07-01

We propose an algorithm to find the community structure in complex networks based on the combination of spectral analysis and modularity optimization. The clustering produced by our algorithm is as accurate as the best algorithms on the literature of modularity optimization; however, the main asset of the algorithm is its efficiency. The best match for our algorithm is Newman’s fast algorithm, which is the reference algorithm for clustering in large networks due to its efficiency. When both algorithms are compared, our algorithm outperforms the fast algorithm both in efficiency and accuracy of the clustering, in terms of modularity. Thus, the results suggest that the proposed algorithm is a good choice to analyze the community structure of medium and large networks in the range of tens and hundreds of thousand vertices.

Efficient sequential and parallel algorithms for record linkage.

PubMed

Mamun, Abdullah-Al; Mi, Tian; Aseltine, Robert; Rajasekaran, Sanguthevar

2014-01-01

Integrating data from multiple sources is a crucial and challenging problem. Even though there exist numerous algorithms for record linkage or deduplication, they suffer from either large time needs or restrictions on the number of datasets that they can integrate. In this paper we report efficient sequential and parallel algorithms for record linkage which handle any number of datasets and outperform previous algorithms. Our algorithms employ hierarchical clustering algorithms as the basis. A key idea that we use is radix sorting on certain attributes to eliminate identical records before any further processing. Another novel idea is to form a graph that links similar records and find the connected components. Our sequential and parallel algorithms have been tested on a real dataset of 1,083,878 records and synthetic datasets ranging in size from 50,000 to 9,000,000 records. Our sequential algorithm runs at least two times faster, for any dataset, than the previous best-known algorithm, the two-phase algorithm using faster computation of the edit distance (TPA (FCED)). The speedups obtained by our parallel algorithm are almost linear. For example, we get a speedup of 7.5 with 8 cores (residing in a single node), 14.1 with 16 cores (residing in two nodes), and 26.4 with 32 cores (residing in four nodes). We have compared the performance of our sequential algorithm with TPA (FCED) and found that our algorithm outperforms the previous one. The accuracy is the same as that of this previous best-known algorithm.

The algorithms for rational spline interpolation of surfaces

NASA Technical Reports Server (NTRS)

Schiess, J. R.

1986-01-01

Two algorithms for interpolating surfaces with spline functions containing tension parameters are discussed. Both algorithms are based on the tensor products of univariate rational spline functions. The simpler algorithm uses a single tension parameter for the entire surface. This algorithm is generalized to use separate tension parameters for each rectangular subregion. The new algorithm allows for local control of tension on the interpolating surface. Both algorithms are illustrated and the results are compared with the results of bicubic spline and bilinear interpolation of terrain elevation data.

A divide-and-conquer algorithm for large-scale de novo transcriptome assembly through combining small assemblies from existing algorithms.

PubMed

Sze, Sing-Hoi; Parrott, Jonathan J; Tarone, Aaron M

2017-12-06

While the continued development of high-throughput sequencing has facilitated studies of entire transcriptomes in non-model organisms, the incorporation of an increasing amount of RNA-Seq libraries has made de novo transcriptome assembly difficult. Although algorithms that can assemble a large amount of RNA-Seq data are available, they are generally very memory-intensive and can only be used to construct small assemblies. We develop a divide-and-conquer strategy that allows these algorithms to be utilized, by subdividing a large RNA-Seq data set into small libraries. Each individual library is assembled independently by an existing algorithm, and a merging algorithm is developed to combine these assemblies by picking a subset of high quality transcripts to form a large transcriptome. When compared to existing algorithms that return a single assembly directly, this strategy achieves comparable or increased accuracy as memory-efficient algorithms that can be used to process a large amount of RNA-Seq data, and comparable or decreased accuracy as memory-intensive algorithms that can only be used to construct small assemblies. Our divide-and-conquer strategy allows memory-intensive de novo transcriptome assembly algorithms to be utilized to construct large assemblies.

Anti-aliasing algorithm development

NASA Astrophysics Data System (ADS)

Bodrucki, F.; Davis, J.; Becker, J.; Cordell, J.

2017-10-01

In this paper, we discuss the testing image processing algorithms for mitigation of aliasing artifacts under pulsed illumination. Previously sensors were tested, one with a fixed frame rate and one with an adjustable frame rate, which results showed different degrees of operability when subjected to a Quantum Cascade Laser (QCL) laser pulsed at the frame rate of the fixe-rate sensor. We implemented algorithms to allow the adjustable frame-rate sensor to detect the presence of aliasing artifacts, and in response, to alter the frame rate of the sensor. The result was that the sensor output showed a varying laser intensity (beat note) as opposed to a fixed signal level. A MIRAGE Infrared Scene Projector (IRSP) was used to explore the efficiency of the new algorithms, introduction secondary elements into the sensor's field of view.

Dose calculation accuracy of the Monte Carlo algorithm for CyberKnife compared with other commercially available dose calculation algorithms.

PubMed

Sharma, Subhash; Ott, Joseph; Williams, Jamone; Dickow, Danny

2011-01-01

Monte Carlo dose calculation algorithms have the potential for greater accuracy than traditional model-based algorithms. This enhanced accuracy is particularly evident in regions of lateral scatter disequilibrium, which can develop during treatments incorporating small field sizes and low-density tissue. A heterogeneous slab phantom was used to evaluate the accuracy of several commercially available dose calculation algorithms, including Monte Carlo dose calculation for CyberKnife, Analytical Anisotropic Algorithm and Pencil Beam convolution for the Eclipse planning system, and convolution-superposition for the Xio planning system. The phantom accommodated slabs of varying density; comparisons between planned and measured dose distributions were accomplished with radiochromic film. The Monte Carlo algorithm provided the most accurate comparison between planned and measured dose distributions. In each phantom irradiation, the Monte Carlo predictions resulted in gamma analysis comparisons >97%, using acceptance criteria of 3% dose and 3-mm distance to agreement. In general, the gamma analysis comparisons for the other algorithms were <95%. The Monte Carlo dose calculation algorithm for CyberKnife provides more accurate dose distribution calculations in regions of lateral electron disequilibrium than commercially available model-based algorithms. This is primarily because of the ability of Monte Carlo algorithms to implicitly account for tissue heterogeneities, density scaling functions; and/or effective depth correction factors are not required. Copyright © 2011 American Association of Medical Dosimetrists. Published by Elsevier Inc. All rights reserved.

Fractal Landscape Algorithms for Environmental Simulations

NASA Astrophysics Data System (ADS)

Mao, H.; Moran, S.

2014-12-01

Natural science and geographical research are now able to take advantage of environmental simulations that more accurately test experimental hypotheses, resulting in deeper understanding. Experiments affected by the natural environment can benefit from 3D landscape simulations capable of simulating a variety of terrains and environmental phenomena. Such simulations can employ random terrain generation algorithms that dynamically simulate environments to test specific models against a variety of factors. Through the use of noise functions such as Perlin noise, Simplex noise, and diamond square algorithms, computers can generate simulations that model a variety of landscapes and ecosystems. This study shows how these algorithms work together to create realistic landscapes. By seeding values into the diamond square algorithm, one can control the shape of landscape. Perlin noise and Simplex noise are also used to simulate moisture and temperature. The smooth gradient created by coherent noise allows more realistic landscapes to be simulated. Terrain generation algorithms can be used in environmental studies and physics simulations. Potential studies that would benefit from simulations include the geophysical impact of flash floods or drought on a particular region and regional impacts on low lying area due to global warming and rising sea levels. Furthermore, terrain generation algorithms also serve as aesthetic tools to display landscapes (Google Earth), and simulate planetary landscapes. Hence, it can be used as a tool to assist science education. Algorithms used to generate these natural phenomena provide scientists a different approach in analyzing our world. The random algorithms used in terrain generation not only contribute to the generating the terrains themselves, but are also capable of simulating weather patterns.

A quantum causal discovery algorithm

NASA Astrophysics Data System (ADS)

Giarmatzi, Christina; Costa, Fabio

2018-03-01

Finding a causal model for a set of classical variables is now a well-established task—but what about the quantum equivalent? Even the notion of a quantum causal model is controversial. Here, we present a causal discovery algorithm for quantum systems. The input to the algorithm is a process matrix describing correlations between quantum events. Its output consists of different levels of information about the underlying causal model. Our algorithm determines whether the process is causally ordered by grouping the events into causally ordered non-signaling sets. It detects if all relevant common causes are included in the process, which we label Markovian, or alternatively if some causal relations are mediated through some external memory. For a Markovian process, it outputs a causal model, namely the causal relations and the corresponding mechanisms, represented as quantum states and channels. Our algorithm opens the route to more general quantum causal discovery methods.

Parallelizing flow-accumulation calculations on graphics processing units—From iterative DEM preprocessing algorithm to recursive multiple-flow-direction algorithm

NASA Astrophysics Data System (ADS)

Qin, Cheng-Zhi; Zhan, Lijun

2012-06-01

As one of the important tasks in digital terrain analysis, the calculation of flow accumulations from gridded digital elevation models (DEMs) usually involves two steps in a real application: (1) using an iterative DEM preprocessing algorithm to remove the depressions and flat areas commonly contained in real DEMs, and (2) using a recursive flow-direction algorithm to calculate the flow accumulation for every cell in the DEM. Because both algorithms are computationally intensive, quick calculation of the flow accumulations from a DEM (especially for a large area) presents a practical challenge to personal computer (PC) users. In recent years, rapid increases in hardware capacity of the graphics processing units (GPUs) provided in modern PCs have made it possible to meet this challenge in a PC environment. Parallel computing on GPUs using a compute-unified-device-architecture (CUDA) programming model has been explored to speed up the execution of the single-flow-direction algorithm (SFD). However, the parallel implementation on a GPU of the multiple-flow-direction (MFD) algorithm, which generally performs better than the SFD algorithm, has not been reported. Moreover, GPU-based parallelization of the DEM preprocessing step in the flow-accumulation calculations has not been addressed. This paper proposes a parallel approach to calculate flow accumulations (including both iterative DEM preprocessing and a recursive MFD algorithm) on a CUDA-compatible GPU. For the parallelization of an MFD algorithm (MFD-md), two different parallelization strategies using a GPU are explored. The first parallelization strategy, which has been used in the existing parallel SFD algorithm on GPU, has the problem of computing redundancy. Therefore, we designed a parallelization strategy based on graph theory. The application results show that the proposed parallel approach to calculate flow accumulations on a GPU performs much faster than either sequential algorithms or other parallel GPU

HYBRID FAST HANKEL TRANSFORM ALGORITHM FOR ELECTROMAGNETIC MODELING

EPA Science Inventory

A hybrid fast Hankel transform algorithm has been developed that uses several complementary features of two existing algorithms: Anderson's digital filtering or fast Hankel transform (FHT) algorithm and Chave's quadrature and continued fraction algorithm. A hybrid FHT subprogram ...

Efficient Record Linkage Algorithms Using Complete Linkage Clustering

PubMed Central

Mamun, Abdullah-Al; Aseltine, Robert; Rajasekaran, Sanguthevar

2016-01-01

Data from different agencies share data of the same individuals. Linking these datasets to identify all the records belonging to the same individuals is a crucial and challenging problem, especially given the large volumes of data. A large number of available algorithms for record linkage are prone to either time inefficiency or low-accuracy in finding matches and non-matches among the records. In this paper we propose efficient as well as reliable sequential and parallel algorithms for the record linkage problem employing hierarchical clustering methods. We employ complete linkage hierarchical clustering algorithms to address this problem. In addition to hierarchical clustering, we also use two other techniques: elimination of duplicate records and blocking. Our algorithms use sorting as a sub-routine to identify identical copies of records. We have tested our algorithms on datasets with millions of synthetic records. Experimental results show that our algorithms achieve nearly 100% accuracy. Parallel implementations achieve almost linear speedups. Time complexities of these algorithms do not exceed those of previous best-known algorithms. Our proposed algorithms outperform previous best-known algorithms in terms of accuracy consuming reasonable run times. PMID:27124604

Efficient Record Linkage Algorithms Using Complete Linkage Clustering.

PubMed

Mamun, Abdullah-Al; Aseltine, Robert; Rajasekaran, Sanguthevar

2016-01-01

Data from different agencies share data of the same individuals. Linking these datasets to identify all the records belonging to the same individuals is a crucial and challenging problem, especially given the large volumes of data. A large number of available algorithms for record linkage are prone to either time inefficiency or low-accuracy in finding matches and non-matches among the records. In this paper we propose efficient as well as reliable sequential and parallel algorithms for the record linkage problem employing hierarchical clustering methods. We employ complete linkage hierarchical clustering algorithms to address this problem. In addition to hierarchical clustering, we also use two other techniques: elimination of duplicate records and blocking. Our algorithms use sorting as a sub-routine to identify identical copies of records. We have tested our algorithms on datasets with millions of synthetic records. Experimental results show that our algorithms achieve nearly 100% accuracy. Parallel implementations achieve almost linear speedups. Time complexities of these algorithms do not exceed those of previous best-known algorithms. Our proposed algorithms outperform previous best-known algorithms in terms of accuracy consuming reasonable run times.

An Implementation of RC4+ Algorithm and Zig-zag Algorithm in a Super Encryption Scheme for Text Security

NASA Astrophysics Data System (ADS)

Budiman, M. A.; Amalia; Chayanie, N. I.

2018-03-01

Cryptography is the art and science of using mathematical methods to preserve message security. There are two types of cryptography, namely classical and modern cryptography. Nowadays, most people would rather use modern cryptography than classical cryptography because it is harder to break than the classical one. One of classical algorithm is the Zig-zag algorithm that uses the transposition technique: the original message is unreadable unless the person has the key to decrypt the message. To improve the security, the Zig-zag Cipher is combined with RC4+ Cipher which is one of the symmetric key algorithms in the form of stream cipher. The two algorithms are combined to make a super-encryption. By combining these two algorithms, the message will be harder to break by a cryptanalyst. The result showed that complexity of the combined algorithm is θ(n2 ), while the complexity of Zig-zag Cipher and RC4+ Cipher are θ(n2 ) and θ(n), respectively.

Psychophysical Comparisons in Image Compression Algorithms.

DTIC Science & Technology

1999-03-01

Leister, M., "Lossy Lempel - Ziv Algorithm for Large Alphabet Sources and Applications to Image Compression ," IEEE Proceedings, v.I, pp. 225-228, September...1623-1642, September 1990. Sanford, M.A., An Analysis of Data Compression Algorithms used in the Transmission of Imagery, Master’s Thesis, Naval...NAVAL POSTGRADUATE SCHOOL Monterey, California THESIS PSYCHOPHYSICAL COMPARISONS IN IMAGE COMPRESSION ALGORITHMS by % Christopher J. Bodine • March

Least significant qubit algorithm for quantum images

NASA Astrophysics Data System (ADS)

Sang, Jianzhi; Wang, Shen; Li, Qiong

2016-11-01

To study the feasibility of the classical image least significant bit (LSB) information hiding algorithm on quantum computer, a least significant qubit (LSQb) information hiding algorithm of quantum image is proposed. In this paper, we focus on a novel quantum representation for color digital images (NCQI). Firstly, by designing the three qubits comparator and unitary operators, the reasonability and feasibility of LSQb based on NCQI are presented. Then, the concrete LSQb information hiding algorithm is proposed, which can realize the aim of embedding the secret qubits into the least significant qubits of RGB channels of quantum cover image. Quantum circuit of the LSQb information hiding algorithm is also illustrated. Furthermore, the secrets extracting algorithm and circuit are illustrated through utilizing control-swap gates. The two merits of our algorithm are: (1) it is absolutely blind and (2) when extracting secret binary qubits, it does not need any quantum measurement operation or any other help from classical computer. Finally, simulation and comparative analysis show the performance of our algorithm.

Novel and efficient tag SNPs selection algorithms.

PubMed

Chen, Wen-Pei; Hung, Che-Lun; Tsai, Suh-Jen Jane; Lin, Yaw-Ling

2014-01-01

SNPs are the most abundant forms of genetic variations amongst species; the association studies between complex diseases and SNPs or haplotypes have received great attention. However, these studies are restricted by the cost of genotyping all SNPs; thus, it is necessary to find smaller subsets, or tag SNPs, representing the rest of the SNPs. In fact, the existing tag SNP selection algorithms are notoriously time-consuming. An efficient algorithm for tag SNP selection was presented, which was applied to analyze the HapMap YRI data. The experimental results show that the proposed algorithm can achieve better performance than the existing tag SNP selection algorithms; in most cases, this proposed algorithm is at least ten times faster than the existing methods. In many cases, when the redundant ratio of the block is high, the proposed algorithm can even be thousands times faster than the previously known methods. Tools and web services for haplotype block analysis integrated by hadoop MapReduce framework are also developed using the proposed algorithm as computation kernels.

Exact and Heuristic Algorithms for Runway Scheduling

NASA Technical Reports Server (NTRS)

Malik, Waqar A.; Jung, Yoon C.

2016-01-01

This paper explores the Single Runway Scheduling (SRS) problem with arrivals, departures, and crossing aircraft on the airport surface. Constraints for wake vortex separations, departure area navigation separations and departure time window restrictions are explicitly considered. The main objective of this research is to develop exact and heuristic based algorithms that can be used in real-time decision support tools for Air Traffic Control Tower (ATCT) controllers. The paper provides a multi-objective dynamic programming (DP) based algorithm that finds the exact solution to the SRS problem, but may prove unusable for application in real-time environment due to large computation times for moderate sized problems. We next propose a second algorithm that uses heuristics to restrict the search space for the DP based algorithm. A third algorithm based on a combination of insertion and local search (ILS) heuristics is then presented. Simulation conducted for the east side of Dallas/Fort Worth International Airport allows comparison of the three proposed algorithms and indicates that the ILS algorithm performs favorably in its ability to find efficient solutions and its computation times.

Efficient sequential and parallel algorithms for record linkage

PubMed Central

Mamun, Abdullah-Al; Mi, Tian; Aseltine, Robert; Rajasekaran, Sanguthevar

2014-01-01

Background and objective Integrating data from multiple sources is a crucial and challenging problem. Even though there exist numerous algorithms for record linkage or deduplication, they suffer from either large time needs or restrictions on the number of datasets that they can integrate. In this paper we report efficient sequential and parallel algorithms for record linkage which handle any number of datasets and outperform previous algorithms. Methods Our algorithms employ hierarchical clustering algorithms as the basis. A key idea that we use is radix sorting on certain attributes to eliminate identical records before any further processing. Another novel idea is to form a graph that links similar records and find the connected components. Results Our sequential and parallel algorithms have been tested on a real dataset of 1 083 878 records and synthetic datasets ranging in size from 50 000 to 9 000 000 records. Our sequential algorithm runs at least two times faster, for any dataset, than the previous best-known algorithm, the two-phase algorithm using faster computation of the edit distance (TPA (FCED)). The speedups obtained by our parallel algorithm are almost linear. For example, we get a speedup of 7.5 with 8 cores (residing in a single node), 14.1 with 16 cores (residing in two nodes), and 26.4 with 32 cores (residing in four nodes). Conclusions We have compared the performance of our sequential algorithm with TPA (FCED) and found that our algorithm outperforms the previous one. The accuracy is the same as that of this previous best-known algorithm. PMID:24154837

Runtime support for parallelizing data mining algorithms

NASA Astrophysics Data System (ADS)

Jin, Ruoming; Agrawal, Gagan

2002-03-01

With recent technological advances, shared memory parallel machines have become more scalable, and offer large main memories and high bus bandwidths. They are emerging as good platforms for data warehousing and data mining. In this paper, we focus on shared memory parallelization of data mining algorithms. We have developed a series of techniques for parallelization of data mining algorithms, including full replication, full locking, fixed locking, optimized full locking, and cache-sensitive locking. Unlike previous work on shared memory parallelization of specific data mining algorithms, all of our techniques apply to a large number of common data mining algorithms. In addition, we propose a reduction-object based interface for specifying a data mining algorithm. We show how our runtime system can apply any of the technique we have developed starting from a common specification of the algorithm.

Problem solving with genetic algorithms and Splicer

NASA Technical Reports Server (NTRS)

Bayer, Steven E.; Wang, Lui

1991-01-01

Genetic algorithms are highly parallel, adaptive search procedures (i.e., problem-solving methods) loosely based on the processes of population genetics and Darwinian survival of the fittest. Genetic algorithms have proven useful in domains where other optimization techniques perform poorly. The main purpose of the paper is to discuss a NASA-sponsored software development project to develop a general-purpose tool for using genetic algorithms. The tool, called Splicer, can be used to solve a wide variety of optimization problems and is currently available from NASA and COSMIC. This discussion is preceded by an introduction to basic genetic algorithm concepts and a discussion of genetic algorithm applications.

Computional algorithm for lifetime exposure to antimicrobials in pigs using register data-The LEA algorithm.

PubMed

Birkegård, Anna Camilla; Andersen, Vibe Dalhoff; Halasa, Tariq; Jensen, Vibeke Frøkjær; Toft, Nils; Vigre, Håkan

2017-10-01

Accurate and detailed data on antimicrobial exposure in pig production are essential when studying the association between antimicrobial exposure and antimicrobial resistance. Due to difficulties in obtaining primary data on antimicrobial exposure in a large number of farms, there is a need for a robust and valid method to estimate the exposure using register data. An approach that estimates the antimicrobial exposure in every rearing period during the lifetime of a pig using register data was developed into a computational algorithm. In this approach data from national registers on antimicrobial purchases, movements of pigs and farm demographics registered at farm level are used. The algorithm traces batches of pigs retrospectively from slaughter to the farm(s) that housed the pigs during their finisher, weaner, and piglet period. Subsequently, the algorithm estimates the antimicrobial exposure as the number of Animal Defined Daily Doses for treatment of one kg pig in each of the rearing periods. Thus, the antimicrobial purchase data at farm level are translated into antimicrobial exposure estimates at batch level. A batch of pigs is defined here as pigs sent to slaughter at the same day from the same farm. In this study we present, validate, and optimise a computational algorithm that calculate the lifetime exposure of antimicrobials for slaughter pigs. The algorithm was evaluated by comparing the computed estimates to data on antimicrobial usage from farm records in 15 farm units. We found a good positive correlation between the two estimates. The algorithm was run for Danish slaughter pigs sent to slaughter in January to March 2015 from farms with more than 200 finishers to estimate the proportion of farms that it was applicable for. In the final process, the algorithm was successfully run for batches of pigs originating from 3026 farms with finisher units (77% of the initial population). This number can be increased if more accurate register data can be

A Robustly Stabilizing Model Predictive Control Algorithm

NASA Technical Reports Server (NTRS)

Ackmece, A. Behcet; Carson, John M., III

2007-01-01

A model predictive control (MPC) algorithm that differs from prior MPC algorithms has been developed for controlling an uncertain nonlinear system. This algorithm guarantees the resolvability of an associated finite-horizon optimal-control problem in a receding-horizon implementation.

US-VISIT Identity Matching Algorithm Evaluation Program: ADIS Algorithm Evaluation Project Plan Update

DOE Office of Scientific and Technical Information (OSTI.GOV)

Grant, C W; Lenderman, J S; Gansemer, J D

This document is an update to the 'ADIS Algorithm Evaluation Project Plan' specified in the Statement of Work for the US-VISIT Identity Matching Algorithm Evaluation Program, as deliverable II.D.1. The original plan was delivered in August 2010. This document modifies the plan to reflect modified deliverables reflecting delays in obtaining a database refresh. This document describes the revised schedule of the program deliverables. The detailed description of the processes used, the statistical analysis processes and the results of the statistical analysis will be described fully in the program deliverables. The US-VISIT Identity Matching Algorithm Evaluation Program is work performed bymore » Lawrence Livermore National Laboratory (LLNL) under IAA HSHQVT-07-X-00002 P00004 from the Department of Homeland Security (DHS).« less

On Super-Resolution and the MUSIC Algorithm,

DTIC Science & Technology

1985-05-01

SUPER-RESOLUTION AND THE MUSIC ALGORITHM AUTHOR: G D de Villiers DATE: May 1985 SUMMARY Simulation results for phased array signal processing using...the MUSIC algorithm are presented. The model used is more realistic than previous ones and it gives an indication as to how the algorithm would perform...resolution ON SUPER-RESOLUTION AND THE MUSIC ALGORITHM 1. INTRODUCTION At present there is a considerable amount of interest in "high-resolution" b

An Image Encryption Algorithm Based on Information Hiding

NASA Astrophysics Data System (ADS)

Ge, Xin; Lu, Bin; Liu, Fenlin; Gong, Daofu

Aiming at resolving the conflict between security and efficiency in the design of chaotic image encryption algorithms, an image encryption algorithm based on information hiding is proposed based on the “one-time pad” idea. A random parameter is introduced to ensure a different keystream for each encryption, which has the characteristics of “one-time pad”, improving the security of the algorithm rapidly without significant increase in algorithm complexity. The random parameter is embedded into the ciphered image with information hiding technology, which avoids negotiation for its transport and makes the application of the algorithm easier. Algorithm analysis and experiments show that the algorithm is secure against chosen plaintext attack, differential attack and divide-and-conquer attack, and has good statistical properties in ciphered images.

Using a Novel Transgenic Mouse Model to Study c-Myc Oncogenic Pathway in Castration Resistance and Chemoresistance of Prostate Cancer

DTIC Science & Technology

2015-10-01

epididymis tumors, and performed implantation of testosterone pellets to continue support prostate tumor growth. Our recent data suggest that these...will eliminate the concerns on epididymis tumors. We also proposed to perform subcutaneous implantation of testosterone pellets to continue...USAMRMC ACURO. We have initiated performing the early castration and testosterone pellet implantation on the young PB-Cre4/CAG- SMIL/p53loxP/loxP

Opioid Abuse after Traumatic Brain Injury: Evaluation Using Rodent Models

DTIC Science & Technology

2013-07-01

acclimation to the laboratory and handling, catheterization surgery and recovery, brain injury and evaluation of acquisition, reinforcing efficacy or...subjects entered into protocol =112 (10+10+20+22+ 24+26) Total number catheterized =62 Total number undergoing sham injury =33...did not enter into the experimental protocol until after VCU IACUC and ACURO approval in July 2013. Twenty-two subjects have been catheterized and

Synthetic Beta-Lactam Antibiotics as a Selective Breast Cancer Cell Apoptosis Inducer: Significance in Breast Cancer Prevention and Treatment

DTIC Science & Technology

2007-03-01

synthetic antibiotics is one of the most important medical breakthroughs in human history. Many diseases, such as bacterial meningitis, pneumonia , and...mg scale . I would like to emphasize that this in vivo experiment has been approved by the ACURO office at the Office of Research Protections at the...development and tissue homeostasis [1,2]. Perturbation of this pathway can lead to autoimmunity, acquired immune deficiency syndrome, neurodegenerative

Scalability problems of simple genetic algorithms.

PubMed

Thierens, D

1999-01-01

Scalable evolutionary computation has become an intensively studied research topic in recent years. The issue of scalability is predominant in any field of algorithmic design, but it became particularly relevant for the design of competent genetic algorithms once the scalability problems of simple genetic algorithms were understood. Here we present some of the work that has aided in getting a clear insight in the scalability problems of simple genetic algorithms. Particularly, we discuss the important issue of building block mixing. We show how the need for mixing places a boundary in the GA parameter space that, together with the boundary from the schema theorem, delimits the region where the GA converges reliably to the optimum in problems of bounded difficulty. This region shrinks rapidly with increasing problem size unless the building blocks are tightly linked in the problem coding structure. In addition, we look at how straightforward extensions of the simple genetic algorithm-namely elitism, niching, and restricted mating are not significantly improving the scalability problems.

Passive microwave algorithm development and evaluation

NASA Technical Reports Server (NTRS)

Petty, Grant W.

1995-01-01

The scientific objectives of this grant are: (1) thoroughly evaluate, both theoretically and empirically, all available Special Sensor Microwave Imager (SSM/I) retrieval algorithms for column water vapor, column liquid water, and surface wind speed; (2) where both appropriate and feasible, develop, validate, and document satellite passive microwave retrieval algorithms that offer significantly improved performance compared with currently available algorithms; and (3) refine and validate a novel physical inversion scheme for retrieving rain rate over the ocean. This report summarizes work accomplished or in progress during the first year of a three year grant. The emphasis during the first year has been on the validation and refinement of the rain rate algorithm published by Petty and on the analysis of independent data sets that can be used to help evaluate the performance of rain rate algorithms over remote areas of the ocean. Two articles in the area of global oceanic precipitation are attached.

Birkhoffian symplectic algorithms derived from Hamiltonian symplectic algorithms

NASA Astrophysics Data System (ADS)

Xin-Lei, Kong; Hui-Bin, Wu; Feng-Xiang, Mei

2016-01-01

In this paper, we focus on the construction of structure preserving algorithms for Birkhoffian systems, based on existing symplectic schemes for the Hamiltonian equations. The key of the method is to seek an invertible transformation which drives the Birkhoffian equations reduce to the Hamiltonian equations. When there exists such a transformation, applying the corresponding inverse map to symplectic discretization of the Hamiltonian equations, then resulting difference schemes are verified to be Birkhoffian symplectic for the original Birkhoffian equations. To illustrate the operation process of the method, we construct several desirable algorithms for the linear damped oscillator and the single pendulum with linear dissipation respectively. All of them exhibit excellent numerical behavior, especially in preserving conserved quantities. Project supported by the National Natural Science Foundation of China (Grant No. 11272050), the Excellent Young Teachers Program of North China University of Technology (Grant No. XN132), and the Construction Plan for Innovative Research Team of North China University of Technology (Grant No. XN129).

Kidney-inspired algorithm for optimization problems

NASA Astrophysics Data System (ADS)

Jaddi, Najmeh Sadat; Alvankarian, Jafar; Abdullah, Salwani

2017-01-01

In this paper, a population-based algorithm inspired by the kidney process in the human body is proposed. In this algorithm the solutions are filtered in a rate that is calculated based on the mean of objective functions of all solutions in the current population of each iteration. The filtered solutions as the better solutions are moved to filtered blood and the rest are transferred to waste representing the worse solutions. This is a simulation of the glomerular filtration process in the kidney. The waste solutions are reconsidered in the iterations if after applying a defined movement operator they satisfy the filtration rate, otherwise it is expelled from the waste solutions, simulating the reabsorption and excretion functions of the kidney. In addition, a solution assigned as better solution is secreted if it is not better than the worst solutions simulating the secreting process of blood in the kidney. After placement of all the solutions in the population, the best of them is ranked, the waste and filtered blood are merged to become a new population and the filtration rate is updated. Filtration provides the required exploitation while generating a new solution and reabsorption gives the necessary exploration for the algorithm. The algorithm is assessed by applying it on eight well-known benchmark test functions and compares the results with other algorithms in the literature. The performance of the proposed algorithm is better on seven out of eight test functions when it is compared with the most recent researches in literature. The proposed kidney-inspired algorithm is able to find the global optimum with less function evaluations on six out of eight test functions. A statistical analysis further confirms the ability of this algorithm to produce good-quality results.

Optimally stopped variational quantum algorithms

NASA Astrophysics Data System (ADS)

Vinci, Walter; Shabani, Alireza

2018-04-01

Quantum processors promise a paradigm shift in high-performance computing which needs to be assessed by accurate benchmarking measures. In this article, we introduce a benchmark for the variational quantum algorithm (VQA), recently proposed as a heuristic algorithm for small-scale quantum processors. In VQA, a classical optimization algorithm guides the processor's quantum dynamics to yield the best solution for a given problem. A complete assessment of the scalability and competitiveness of VQA should take into account both the quality and the time of dynamics optimization. The method of optimal stopping, employed here, provides such an assessment by explicitly including time as a cost factor. Here, we showcase this measure for benchmarking VQA as a solver for some quadratic unconstrained binary optimization. Moreover, we show that a better choice for the cost function of the classical routine can significantly improve the performance of the VQA algorithm and even improve its scaling properties.

Multilevel algorithms for nonlinear optimization

NASA Technical Reports Server (NTRS)

Alexandrov, Natalia; Dennis, J. E., Jr.

1994-01-01

Multidisciplinary design optimization (MDO) gives rise to nonlinear optimization problems characterized by a large number of constraints that naturally occur in blocks. We propose a class of multilevel optimization methods motivated by the structure and number of constraints and by the expense of the derivative computations for MDO. The algorithms are an extension to the nonlinear programming problem of the successful class of local Brown-Brent algorithms for nonlinear equations. Our extensions allow the user to partition constraints into arbitrary blocks to fit the application, and they separately process each block and the objective function, restricted to certain subspaces. The methods use trust regions as a globalization strategy, and they have been shown to be globally convergent under reasonable assumptions. The multilevel algorithms can be applied to all classes of MDO formulations. Multilevel algorithms for solving nonlinear systems of equations are a special case of the multilevel optimization methods. In this case, they can be viewed as a trust-region globalization of the Brown-Brent class.

A new optimized GA-RBF neural network algorithm.

PubMed

Jia, Weikuan; Zhao, Dean; Shen, Tian; Su, Chunyang; Hu, Chanli; Zhao, Yuyan

2014-01-01

When confronting the complex problems, radial basis function (RBF) neural network has the advantages of adaptive and self-learning ability, but it is difficult to determine the number of hidden layer neurons, and the weights learning ability from hidden layer to the output layer is low; these deficiencies easily lead to decreasing learning ability and recognition precision. Aiming at this problem, we propose a new optimized RBF neural network algorithm based on genetic algorithm (GA-RBF algorithm), which uses genetic algorithm to optimize the weights and structure of RBF neural network; it chooses new ways of hybrid encoding and optimizing simultaneously. Using the binary encoding encodes the number of the hidden layer's neurons and using real encoding encodes the connection weights. Hidden layer neurons number and connection weights are optimized simultaneously in the new algorithm. However, the connection weights optimization is not complete; we need to use least mean square (LMS) algorithm for further leaning, and finally get a new algorithm model. Using two UCI standard data sets to test the new algorithm, the results show that the new algorithm improves the operating efficiency in dealing with complex problems and also improves the recognition precision, which proves that the new algorithm is valid.

Algorithmic formulation of control problems in manipulation

NASA Technical Reports Server (NTRS)

Bejczy, A. K.

1975-01-01

The basic characteristics of manipulator control algorithms are discussed. The state of the art in the development of manipulator control algorithms is briefly reviewed. Different end-point control techniques are described together with control algorithms which operate on external sensor (imaging, proximity, tactile, and torque/force) signals in realtime. Manipulator control development at JPL is briefly described and illustrated with several figures. The JPL work pays special attention to the front or operator input end of the control algorithms.

Annealed Importance Sampling Reversible Jump MCMC algorithms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Karagiannis, Georgios; Andrieu, Christophe

2013-03-20

It will soon be 20 years since reversible jump Markov chain Monte Carlo (RJ-MCMC) algorithms have been proposed. They have significantly extended the scope of Markov chain Monte Carlo simulation methods, offering the promise to be able to routinely tackle transdimensional sampling problems, as encountered in Bayesian model selection problems for example, in a principled and flexible fashion. Their practical efficient implementation, however, still remains a challenge. A particular difficulty encountered in practice is in the choice of the dimension matching variables (both their nature and their distribution) and the reversible transformations which allow one to define the one-to-one mappingsmore » underpinning the design of these algorithms. Indeed, even seemingly sensible choices can lead to algorithms with very poor performance. The focus of this paper is the development and performance evaluation of a method, annealed importance sampling RJ-MCMC (aisRJ), which addresses this problem by mitigating the sensitivity of RJ-MCMC algorithms to the aforementioned poor design. As we shall see the algorithm can be understood as being an “exact approximation” of an idealized MCMC algorithm that would sample from the model probabilities directly in a model selection set-up. Such an idealized algorithm may have good theoretical convergence properties, but typically cannot be implemented, and our algorithms can approximate the performance of such idealized algorithms to an arbitrary degree while not introducing any bias for any degree of approximation. Our approach combines the dimension matching ideas of RJ-MCMC with annealed importance sampling and its Markov chain Monte Carlo implementation. We illustrate the performance of the algorithm with numerical simulations which indicate that, although the approach may at first appear computationally involved, it is in fact competitive.« less

Recent Advancements in Lightning Jump Algorithm Work

NASA Technical Reports Server (NTRS)

Schultz, Christopher J.; Petersen, Walter A.; Carey, Lawrence D.

2010-01-01

In the past year, the primary objectives were to show the usefulness of total lightning as compared to traditional cloud-to-ground (CG) networks, test the lightning jump algorithm configurations in other regions of the country, increase the number of thunderstorms within our thunderstorm database, and to pinpoint environments that could prove difficult for any lightning jump configuration. A total of 561 thunderstorms have been examined in the past year (409 non-severe, 152 severe) from four regions of the country (North Alabama, Washington D.C., High Plains of CO/KS, and Oklahoma). Results continue to indicate that the 2 lightning jump algorithm configuration holds the most promise in terms of prospective operational lightning jump algorithms, with a probability of detection (POD) at 81%, a false alarm rate (FAR) of 45%, a critical success index (CSI) of 49% and a Heidke Skill Score (HSS) of 0.66. The second best performing algorithm configuration was the Threshold 4 algorithm, which had a POD of 72%, FAR of 51%, a CSI of 41% and an HSS of 0.58. Because a more complex algorithm configuration shows the most promise in terms of prospective operational lightning jump algorithms, accurate thunderstorm cell tracking work must be undertaken to track lightning trends on an individual thunderstorm basis over time. While these numbers for the 2 configuration are impressive, the algorithm does have its weaknesses. Specifically, low-topped and tropical cyclone thunderstorm environments are present issues for the 2 lightning jump algorithm, because of the suppressed vertical depth impact on overall flash counts (i.e., a relative dearth in lightning). For example, in a sample of 120 thunderstorms from northern Alabama that contained 72 missed events by the 2 algorithm 36% of the misses were associated with these two environments (17 storms).

Online Performance-Improvement Algorithms

DTIC Science & Technology

1994-08-01

fault rate as the request sequence length approaches infinity. Their algorithms are based on an innovative use of the classical Ziv - Lempel [85] data ...Report CS-TR-348-91. [85] J. Ziv and A. Lempel . Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory, 24:530-53`, 1978. 94...Deferred Data Structuring Recall that our incremental multi-trip algorithm spreads the building of the fence-tree over several trips in order to

An Innovative Thinking-Based Intelligent Information Fusion Algorithm

PubMed Central

Hu, Liang; Liu, Gang; Zhou, Jin

2013-01-01

This study proposes an intelligent algorithm that can realize information fusion in reference to the relative research achievements in brain cognitive theory and innovative computation. This algorithm treats knowledge as core and information fusion as a knowledge-based innovative thinking process. Furthermore, the five key parts of this algorithm including information sense and perception, memory storage, divergent thinking, convergent thinking, and evaluation system are simulated and modeled. This algorithm fully develops innovative thinking skills of knowledge in information fusion and is a try to converse the abstract conception of brain cognitive science to specific and operable research routes and strategies. Furthermore, the influences of each parameter of this algorithm on algorithm performance are analyzed and compared with those of classical intelligent algorithms trough test. Test results suggest that the algorithm proposed in this study can obtain the optimum problem solution by less target evaluation times, improve optimization effectiveness, and achieve the effective fusion of information. PMID:23956699

An innovative thinking-based intelligent information fusion algorithm.

PubMed

Lu, Huimin; Hu, Liang; Liu, Gang; Zhou, Jin

2013-01-01

This study proposes an intelligent algorithm that can realize information fusion in reference to the relative research achievements in brain cognitive theory and innovative computation. This algorithm treats knowledge as core and information fusion as a knowledge-based innovative thinking process. Furthermore, the five key parts of this algorithm including information sense and perception, memory storage, divergent thinking, convergent thinking, and evaluation system are simulated and modeled. This algorithm fully develops innovative thinking skills of knowledge in information fusion and is a try to converse the abstract conception of brain cognitive science to specific and operable research routes and strategies. Furthermore, the influences of each parameter of this algorithm on algorithm performance are analyzed and compared with those of classical intelligent algorithms trough test. Test results suggest that the algorithm proposed in this study can obtain the optimum problem solution by less target evaluation times, improve optimization effectiveness, and achieve the effective fusion of information.

Improved Bat Algorithm Applied to Multilevel Image Thresholding

PubMed Central

2014-01-01

Multilevel image thresholding is a very important image processing technique that is used as a basis for image segmentation and further higher level processing. However, the required computational time for exhaustive search grows exponentially with the number of desired thresholds. Swarm intelligence metaheuristics are well known as successful and efficient optimization methods for intractable problems. In this paper, we adjusted one of the latest swarm intelligence algorithms, the bat algorithm, for the multilevel image thresholding problem. The results of testing on standard benchmark images show that the bat algorithm is comparable with other state-of-the-art algorithms. We improved standard bat algorithm, where our modifications add some elements from the differential evolution and from the artificial bee colony algorithm. Our new proposed improved bat algorithm proved to be better than five other state-of-the-art algorithms, improving quality of results in all cases and significantly improving convergence speed. PMID:25165733

A Novel Hybrid Firefly Algorithm for Global Optimization.

PubMed

Zhang, Lina; Liu, Liqiang; Yang, Xin-She; Dai, Yuntao

Global optimization is challenging to solve due to its nonlinearity and multimodality. Traditional algorithms such as the gradient-based methods often struggle to deal with such problems and one of the current trends is to use metaheuristic algorithms. In this paper, a novel hybrid population-based global optimization algorithm, called hybrid firefly algorithm (HFA), is proposed by combining the advantages of both the firefly algorithm (FA) and differential evolution (DE). FA and DE are executed in parallel to promote information sharing among the population and thus enhance searching efficiency. In order to evaluate the performance and efficiency of the proposed algorithm, a diverse set of selected benchmark functions are employed and these functions fall into two groups: unimodal and multimodal. The experimental results show better performance of the proposed algorithm compared to the original version of the firefly algorithm (FA), differential evolution (DE) and particle swarm optimization (PSO) in the sense of avoiding local minima and increasing the convergence rate.

A Novel Hybrid Firefly Algorithm for Global Optimization

PubMed Central

Zhang, Lina; Liu, Liqiang; Yang, Xin-She; Dai, Yuntao

2016-01-01

Global optimization is challenging to solve due to its nonlinearity and multimodality. Traditional algorithms such as the gradient-based methods often struggle to deal with such problems and one of the current trends is to use metaheuristic algorithms. In this paper, a novel hybrid population-based global optimization algorithm, called hybrid firefly algorithm (HFA), is proposed by combining the advantages of both the firefly algorithm (FA) and differential evolution (DE). FA and DE are executed in parallel to promote information sharing among the population and thus enhance searching efficiency. In order to evaluate the performance and efficiency of the proposed algorithm, a diverse set of selected benchmark functions are employed and these functions fall into two groups: unimodal and multimodal. The experimental results show better performance of the proposed algorithm compared to the original version of the firefly algorithm (FA), differential evolution (DE) and particle swarm optimization (PSO) in the sense of avoiding local minima and increasing the convergence rate. PMID:27685869

In situ TEM study of electron-beam radiation induced boron diffusion and effects on phase and microstructure evolution in nanostructured CoFeB/SiO2 thin film

NASA Astrophysics Data System (ADS)

Liu, B. H.; Teo, H. W.; Mo, Z. H.; Mai, Z. H.; Lam, J.; Xue, J. M.; Zhao, Y. Z.; Tan, P. K.

2017-01-01

Using in situ transmission electron microscopy (TEM), we studied boron diffusion and segregation in CoFeB/SiO2 nanostructured thin film stacks. We also investigated how these phenomena affected the phase and microstructure of CoFeB thin films under electron beam irradiation at 300 kV. A unique phase transformation was observed in CoFeB thin films under high-dose electron irradiation, from a polycrystalline Co3Fe to a unilateral amorphous phase of Co3Fe and nanocrystalline FexCo23-xB6. The unilateral amorphization of the Co3Fe film showed an electron-dose-rate sensitivity with a threshold dose rate. Detailed in situ TEM studies revealed that the unilateral amorphization of the Co3Fe film arose from boron segregation at the bottom of the Co3Fe thin film induced by radiation-enhanced diffusion of boron atoms that were displaced by electron knock-on effects. The radiation-induced nanocrystallization of FexCo23-xB6 was also found to be dose-rate sensitive with a higher electron beam current leading to earlier nucleation and more rapid grain growth. The nanocrystallization of FexCo23-xB6 occurred preferentially at the CoFeB/SiO2 interface. Kinetic studies by in situ TEM revealed the surface crystallization and diffusion-controlled nucleation and grain growth mechanisms. The radiation-enhanced atomic diffusivity and high-concentration of radiation-induced point defects at the Co3Fe/SiO2 interface enhanced the local short-range ordering of Fe, Co, and B atoms, favoring nucleation and grain growth of FexCo23-xB6 at the interface.

Development and Production of Array Barrier Detectors at SCD

NASA Astrophysics Data System (ADS)

Klipstein, P. C.; Avnon, E.; Benny, Y.; Berkowicz, E.; Cohen, Y.; Dobromislin, R.; Fraenkel, R.; Gershon, G.; Glozman, A.; Hojman, E.; Ilan, E.; Karni, Y.; Klin, O.; Kodriano, Y.; Krasovitsky, L.; Langof, L.; Lukomsky, I.; Nevo, I.; Nitzani, M.; Pivnik, I.; Rappaport, N.; Rosenberg, O.; Shtrichman, I.; Shkedy, L.; Snapi, N.; Talmor, R.; Tessler, R.; Weiss, E.; Tuito, A.

2017-09-01

XB n or XB p barrier detectors exhibit diffusion-limited dark currents comparable with mercury cadmium telluride Rule-07 and high quantum efficiencies. In 2011, SemiConductor Devices (SCD) introduced "HOT Pelican D", a 640 × 512/15- μm pitch InAsSb/AlSbAs XB n mid-wave infrared (MWIR) detector with a 4.2- μm cut-off and an operating temperature of ˜150 K. Its low power (˜3 W), high pixel operability (>99.5%) and long mean time to failure make HOT Pelican D a highly reliable integrated detector-cooler product with a low size, weight and power. More recently, "HOT Hercules" was launched with a 1280 × 1024/15- μm format and similar advantages. A 3-megapixel, 10- μm pitch version ("HOT Blackbird") is currently completing development. For long-wave infrared applications, SCD's 640 × 512/15- μm pitch "Pelican-D LW" XB p type II superlattice (T2SL) detector has a ˜9.3- μm cut-off wavelength. The detector contains InAs/GaSb and InAs/AlSb T2SLs, and is fabricated into focal plane array (FPA) detectors using standard production processes including hybridization to a digital silicon read-out integrated circuit (ROIC), glue underfill and substrate thinning. The ROIC has been designed so that the complete detector closely follows the interfaces of SCD's MWIR Pelican-D detector family. The Pelican-D LW FPA has a quantum efficiency of ˜50%, and operates at 77 K with a pixel operability of >99% and noise equivalent temperature difference of 13 mK at 30 Hz and F/2.7.

Efficient algorithms for single-axis attitude estimation

NASA Technical Reports Server (NTRS)

Shuster, M. D.

1981-01-01

The computationally efficient algorithms determine attitude from the measurement of art lengths and dihedral angles. The dependence of these algorithms on the solution of trigonometric equations was reduced. Both single time and batch estimators are presented along with the covariance analysis of each algorithm.

A tunable algorithm for collective decision-making.

PubMed

Pratt, Stephen C; Sumpter, David J T

2006-10-24

Complex biological systems are increasingly understood in terms of the algorithms that guide the behavior of system components and the information pathways that link them. Much attention has been given to robust algorithms, or those that allow a system to maintain its functions in the face of internal or external perturbations. At the same time, environmental variation imposes a complementary need for algorithm versatility, or the ability to alter system function adaptively as external circumstances change. An important goal of systems biology is thus the identification of biological algorithms that can meet multiple challenges rather than being narrowly specified to particular problems. Here we show that emigrating colonies of the ant Temnothorax curvispinosus tune the parameters of a single decision algorithm to respond adaptively to two distinct problems: rapid abandonment of their old nest in a crisis and deliberative selection of the best available new home when their old nest is still intact. The algorithm uses a stepwise commitment scheme and a quorum rule to integrate information gathered by numerous individual ants visiting several candidate homes. By varying the rates at which they search for and accept these candidates, the ants yield a colony-level response that adaptively emphasizes either speed or accuracy. We propose such general but tunable algorithms as a design feature of complex systems, each algorithm providing elegant solutions to a wide range of problems.

Localization Algorithms of Underwater Wireless Sensor Networks: A Survey

PubMed Central

Han, Guangjie; Jiang, Jinfang; Shu, Lei; Xu, Yongjun; Wang, Feng

2012-01-01

In Underwater Wireless Sensor Networks (UWSNs), localization is one of most important technologies since it plays a critical role in many applications. Motivated by widespread adoption of localization, in this paper, we present a comprehensive survey of localization algorithms. First, we classify localization algorithms into three categories based on sensor nodes’ mobility: stationary localization algorithms, mobile localization algorithms and hybrid localization algorithms. Moreover, we compare the localization algorithms in detail and analyze future research directions of localization algorithms in UWSNs. PMID:22438752

An improved NAS-RIF algorithm for image restoration

NASA Astrophysics Data System (ADS)

Gao, Weizhe; Zou, Jianhua; Xu, Rong; Liu, Changhai; Li, Hengnian

2016-10-01

Space optical images are inevitably degraded by atmospheric turbulence, error of the optical system and motion. In order to get the true image, a novel nonnegativity and support constants recursive inverse filtering (NAS-RIF) algorithm is proposed to restore the degraded image. Firstly the image noise is weaken by Contourlet denoising algorithm. Secondly, the reliable object support region estimation is used to accelerate the algorithm convergence. We introduce the optimal threshold segmentation technology to improve the object support region. Finally, an object construction limit and the logarithm function are added to enhance algorithm stability. Experimental results demonstrate that, the proposed algorithm can increase the PSNR, and improve the quality of the restored images. The convergence speed of the proposed algorithm is faster than that of the original NAS-RIF algorithm.

Measurement of exclusive π(0) electroproduction structure functions and their relationship to transverse generalized parton distributions.

PubMed

Bedlinskiy, I; Kubarovsky, V; Niccolai, S; Stoler, P; Adhikari, K P; Aghasyan, M; Amaryan, M J; Anghinolfi, M; Avakian, H; Baghdasaryan, H; Ball, J; Baltzell, N A; Battaglieri, M; Bennett, R P; Biselli, A S; Bookwalter, C; Boiarinov, S; Briscoe, W J; Brooks, W K; Burkert, V D; Carman, D S; Celentano, A; Chandavar, S; Charles, G; Contalbrigo, M; Crede, V; D'Angelo, A; Daniel, A; Dashyan, N; De Vita, R; De Sanctis, E; Deur, A; Djalali, C; Doughty, D; Dupre, R; Egiyan, H; El Alaoui, A; El Fassi, L; Elouadrhiri, L; Eugenio, P; Fedotov, G; Fegan, S; Fleming, J A; Forest, T A; Fradi, A; Garçon, M; Gevorgyan, N; Giovanetti, K L; Girod, F X; Gohn, W; Gothe, R W; Graham, L; Griffioen, K A; Guegan, B; Guidal, M; Guo, L; Hafidi, K; Hakobyan, H; Hanretty, C; Heddle, D; Hicks, K; Holtrop, M; Ilieva, Y; Ireland, D G; Ishkhanov, B S; Isupov, E L; Jo, H S; Joo, K; Keller, D; Khandaker, M; Khetarpal, P; Kim, A; Kim, W; Klein, F J; Koirala, S; Kubarovsky, A; Kuhn, S E; Kuleshov, S V; Kvaltine, N D; Livingston, K; Lu, H Y; MacGregor, I J D; Mao, Y; Markov, N; Martinez, D; Mayer, M; McKinnon, B; Meyer, C A; Mineeva, T; Mirazita, M; Mokeev, V; Moutarde, H; Munevar, E; Munoz Camacho, C; Nadel-Turonski, P; Niculescu, G; Niculescu, I; Osipenko, M; Ostrovidov, A I; Pappalardo, L L; Paremuzyan, R; Park, K; Park, S; Pasyuk, E; Anefalos Pereira, S; Phelps, E; Pisano, S; Pogorelko, O; Pozdniakov, S; Price, J W; Procureur, S; Prok, Y; Protopopescu, D; Puckett, A J R; Raue, B A; Ricco, G; Rimal, D; Ripani, M; Rosner, G; Rossi, P; Sabatié, F; Saini, M S; Salgado, C; Saylor, N; Schott, D; Schumacher, R A; Seder, E; Seraydaryan, H; Sharabian, Y G; Smith, G D; Sober, D I; Sokhan, D; Stepanyan, S S; Stepanyan, S; Strauch, S; Taiuti, M; Tang, W; Taylor, C E; Tian, Ye; Tkachenko, S; Ungaro, M; Vineyard, M F; Vlassov, A; Voskanyan, H; Voutier, E; Walford, N K; Watts, D P; Weinstein, L B; Weygand, D P; Wood, M H; Zachariou, N; Zhang, J; Zhao, Z W; Zonta, I

2012-09-14

Exclusive π(0) electroproduction at a beam energy of 5.75 GeV has been measured with the Jefferson Lab CLAS spectrometer. Differential cross sections were measured at more than 1800 kinematic values in Q(2), x(B), t, and ϕ(π), in the Q(2) range from 1.0 to 4.6  GeV(2), -t up to 2  GeV(2), and x(B) from 0.1 to 0.58. Structure functions σ(T)+ϵσ(L), σ(TT), and σ(LT) were extracted as functions of t for each of 17 combinations of Q(2) and x(B). The data were compared directly with two handbag-based calculations including both longitudinal and transversity generalized parton distributions (GPDs). Inclusion of only longitudinal GPDs very strongly underestimates σ(T)+ϵσ(L) and fails to account for σ(TT) and σ(LT), while inclusion of transversity GPDs brings the calculations into substantially better agreement with the data. There is very strong sensitivity to the relative contributions of nucleon helicity-flip and helicity nonflip processes. The results confirm that exclusive π(0) electroproduction offers direct experimental access to the transversity GPDs.

Measurement of Exclusive π0 Electroproduction Structure Functions and their Relationship to Transverse Generalized Parton Distributions

NASA Astrophysics Data System (ADS)

Bedlinskiy, I.; Kubarovsky, V.; Niccolai, S.; Stoler, P.; Adhikari, K. P.; Aghasyan, M.; Amaryan, M. J.; Anghinolfi, M.; Avakian, H.; Baghdasaryan, H.; Ball, J.; Baltzell, N. A.; Battaglieri, M.; Bennett, R. P.; Biselli, A. S.; Bookwalter, C.; Boiarinov, S.; Briscoe, W. J.; Brooks, W. K.; Burkert, V. D.; Carman, D. S.; Celentano, A.; Chandavar, S.; Charles, G.; Contalbrigo, M.; Crede, V.; D'Angelo, A.; Daniel, A.; Dashyan, N.; De Vita, R.; De Sanctis, E.; Deur, A.; Djalali, C.; Doughty, D.; Dupre, R.; Egiyan, H.; El Alaoui, A.; El Fassi, L.; Elouadrhiri, L.; Eugenio, P.; Fedotov, G.; Fegan, S.; Fleming, J. A.; Forest, T. A.; Fradi, A.; Garçon, M.; Gevorgyan, N.; Giovanetti, K. L.; Girod, F. X.; Gohn, W.; Gothe, R. W.; Graham, L.; Griffioen, K. A.; Guegan, B.; Guidal, M.; Guo, L.; Hafidi, K.; Hakobyan, H.; Hanretty, C.; Heddle, D.; Hicks, K.; Holtrop, M.; Ilieva, Y.; Ireland, D. G.; Ishkhanov, B. S.; Isupov, E. L.; Jo, H. S.; Joo, K.; Keller, D.; Khandaker, M.; Khetarpal, P.; Kim, A.; Kim, W.; Klein, F. J.; Koirala, S.; Kubarovsky, A.; Kuhn, S. E.; Kuleshov, S. V.; Kvaltine, N. D.; Livingston, K.; Lu, H. Y.; MacGregor, I. J. D.; Mao, Y.; Markov, N.; Martinez, D.; Mayer, M.; McKinnon, B.; Meyer, C. A.; Mineeva, T.; Mirazita, M.; Mokeev, V.; Moutarde, H.; Munevar, E.; Munoz Camacho, C.; Nadel-Turonski, P.; Niculescu, G.; Niculescu, I.; Osipenko, M.; Ostrovidov, A. I.; Pappalardo, L. L.; Paremuzyan, R.; Park, K.; Park, S.; Pasyuk, E.; Anefalos Pereira, S.; Phelps, E.; Pisano, S.; Pogorelko, O.; Pozdniakov, S.; Price, J. W.; Procureur, S.; Prok, Y.; Protopopescu, D.; Puckett, A. J. R.; Raue, B. A.; Ricco, G.; Rimal, D.; Ripani, M.; Rosner, G.; Rossi, P.; Sabatié, F.; Saini, M. S.; Salgado, C.; Saylor, N.; Schott, D.; Schumacher, R. A.; Seder, E.; Seraydaryan, H.; Sharabian, Y. G.; Smith, G. D.; Sober, D. I.; Sokhan, D.; Stepanyan, S. S.; Stepanyan, S.; Strauch, S.; Taiuti, M.; Tang, W.; Taylor, C. E.; Tian, Ye; Tkachenko, S.; Ungaro, M.; Vineyard, M. F.; Vlassov, A.; Voskanyan, H.; Voutier, E.; Walford, N. K.; Watts, D. P.; Weinstein, L. B.; Weygand, D. P.; Wood, M. H.; Zachariou, N.; Zhang, J.; Zhao, Z. W.; Zonta, I.

2012-09-01

Exclusive π0 electroproduction at a beam energy of 5.75 GeV has been measured with the Jefferson Lab CLAS spectrometer. Differential cross sections were measured at more than 1800 kinematic values in Q2, xB, t, and ϕπ, in the Q2 range from 1.0 to 4.6GeV2, -t up to 2GeV2, and xB from 0.1 to 0.58. Structure functions σT+ɛσL, σTT, and σLT were extracted as functions of t for each of 17 combinations of Q2 and xB. The data were compared directly with two handbag-based calculations including both longitudinal and transversity generalized parton distributions (GPDs). Inclusion of only longitudinal GPDs very strongly underestimates σT+ɛσL and fails to account for σTT and σLT, while inclusion of transversity GPDs brings the calculations into substantially better agreement with the data. There is very strong sensitivity to the relative contributions of nucleon helicity-flip and helicity nonflip processes. The results confirm that exclusive π0 electroproduction offers direct experimental access to the transversity GPDs.

SU-F-BRA-12: End-User Oriented Tools and Procedures for Testing Brachytherapy TPSs Employing MBDCAs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Peppa, V; Pappas, E; Lahanas, V

2015-06-15

Purpose: To develop user-oriented tools for commissioning and dosimetry testing of {sup 192}Ir brachytherapy treatment planning systems (TPSs) employing model based dose calculation algorithms (MBDCAs). Methods: A software tool (BrachyGuide) has been developed for the automatic generation of MCNP6 input files from any CT based plan exported in DICOM RT format from Elekta and Varian TPSs. BrachyGuide also facilitates the evaluation of imported Monte Carlo (MC) and TPS dose distributions in terms of % dose differences and gamma index (CT overlaid colormaps or relative frequency plots) as well as DVHs and related indices. For users not equipped to perform MC,more » a set of computational models was prepared in DICOM format, accompanied by treatment plans and corresponding MCNP6 generated reference data. BrachyGuide can then be used to compare institutional and reference data as per TG186. The model set includes a water sphere with the MBDCA WG {sup 192}Ir source placed centrically and in two eccentric positions, a water sphere with cubic bone and lung inhomogeneities and a five source dwells plan, and a patient equivalent model with an Accelerated Partial Breast Irradiation (APBI) plan. Results: The tools developed were used for the dosimetry testing of the Acuros and ACE MBDCAs implemented in BrachyVision v.13 and Oncentra Brachy v.4.5, respectively. Findings were consistent with previous results in the literature. Besides points close to the source dwells, Acuros was found to agree within type A uncertainties with the reference MC results. Differences greater than MC type A uncertainty were observed for ACE at distances >5cm from the source dwells and in bone. Conclusion: The tools developed are efficient for brachytherapy MBDCA planning commissioning and testing. Since they are appropriate for distribution over the web, they will be put at the AAPM WG MBDCA’s disposal. Research co-financed by the ESF and Greek funds. NSRF operational Program: Education and

Minimalist ensemble algorithms for genome-wide protein localization prediction.

PubMed

Lin, Jhih-Rong; Mondal, Ananda Mohan; Liu, Rong; Hu, Jianjun

2012-07-03

Computational prediction of protein subcellular localization can greatly help to elucidate its functions. Despite the existence of dozens of protein localization prediction algorithms, the prediction accuracy and coverage are still low. Several ensemble algorithms have been proposed to improve the prediction performance, which usually include as many as 10 or more individual localization algorithms. However, their performance is still limited by the running complexity and redundancy among individual prediction algorithms. This paper proposed a novel method for rational design of minimalist ensemble algorithms for practical genome-wide protein subcellular localization prediction. The algorithm is based on combining a feature selection based filter and a logistic regression classifier. Using a novel concept of contribution scores, we analyzed issues of algorithm redundancy, consensus mistakes, and algorithm complementarity in designing ensemble algorithms. We applied the proposed minimalist logistic regression (LR) ensemble algorithm to two genome-wide datasets of Yeast and Human and compared its performance with current ensemble algorithms. Experimental results showed that the minimalist ensemble algorithm can achieve high prediction accuracy with only 1/3 to 1/2 of individual predictors of current ensemble algorithms, which greatly reduces computational complexity and running time. It was found that the high performance ensemble algorithms are usually composed of the predictors that together cover most of available features. Compared to the best individual predictor, our ensemble algorithm improved the prediction accuracy from AUC score of 0.558 to 0.707 for the Yeast dataset and from 0.628 to 0.646 for the Human dataset. Compared with popular weighted voting based ensemble algorithms, our classifier-based ensemble algorithms achieved much better performance without suffering from inclusion of too many individual predictors. We proposed a method for rational design

Minimalist ensemble algorithms for genome-wide protein localization prediction

PubMed Central

2012-01-01

Background Computational prediction of protein subcellular localization can greatly help to elucidate its functions. Despite the existence of dozens of protein localization prediction algorithms, the prediction accuracy and coverage are still low. Several ensemble algorithms have been proposed to improve the prediction performance, which usually include as many as 10 or more individual localization algorithms. However, their performance is still limited by the running complexity and redundancy among individual prediction algorithms. Results This paper proposed a novel method for rational design of minimalist ensemble algorithms for practical genome-wide protein subcellular localization prediction. The algorithm is based on combining a feature selection based filter and a logistic regression classifier. Using a novel concept of contribution scores, we analyzed issues of algorithm redundancy, consensus mistakes, and algorithm complementarity in designing ensemble algorithms. We applied the proposed minimalist logistic regression (LR) ensemble algorithm to two genome-wide datasets of Yeast and Human and compared its performance with current ensemble algorithms. Experimental results showed that the minimalist ensemble algorithm can achieve high prediction accuracy with only 1/3 to 1/2 of individual predictors of current ensemble algorithms, which greatly reduces computational complexity and running time. It was found that the high performance ensemble algorithms are usually composed of the predictors that together cover most of available features. Compared to the best individual predictor, our ensemble algorithm improved the prediction accuracy from AUC score of 0.558 to 0.707 for the Yeast dataset and from 0.628 to 0.646 for the Human dataset. Compared with popular weighted voting based ensemble algorithms, our classifier-based ensemble algorithms achieved much better performance without suffering from inclusion of too many individual predictors. Conclusions We

Algorithm Optimally Allocates Actuation of a Spacecraft

NASA Technical Reports Server (NTRS)

Motaghedi, Shi

2007-01-01

A report presents an algorithm that solves the following problem: Allocate the force and/or torque to be exerted by each thruster and reaction-wheel assembly on a spacecraft for best performance, defined as minimizing the error between (1) the total force and torque commanded by the spacecraft control system and (2) the total of forces and torques actually exerted by all the thrusters and reaction wheels. The algorithm incorporates the matrix vector relationship between (1) the total applied force and torque and (2) the individual actuator force and torque values. It takes account of such constraints as lower and upper limits on the force or torque that can be applied by a given actuator. The algorithm divides the aforementioned problem into two optimization problems that it solves sequentially. These problems are of a type, known in the art as semi-definite programming problems, that involve linear matrix inequalities. The algorithm incorporates, as sub-algorithms, prior algorithms that solve such optimization problems very efficiently. The algorithm affords the additional advantage that the solution requires the minimum rate of consumption of fuel for the given best performance.

Implementing a self-structuring data learning algorithm

NASA Astrophysics Data System (ADS)

Graham, James; Carson, Daniel; Ternovskiy, Igor

2016-05-01

In this paper, we elaborate on what we did to implement our self-structuring data learning algorithm. To recap, we are working to develop a data learning algorithm that will eventually be capable of goal driven pattern learning and extrapolation of more complex patterns from less complex ones. At this point we have developed a conceptual framework for the algorithm, but have yet to discuss our actual implementation and the consideration and shortcuts we needed to take to create said implementation. We will elaborate on our initial setup of the algorithm and the scenarios we used to test our early stage algorithm. While we want this to be a general algorithm, it is necessary to start with a simple scenario or two to provide a viable development and testing environment. To that end, our discussion will be geared toward what we include in our initial implementation and why, as well as what concerns we may have. In the future, we expect to be able to apply our algorithm to a more general approach, but to do so within a reasonable time, we needed to pick a place to start.

Hybrid Architectures for Evolutionary Computing Algorithms

DTIC Science & Technology

2008-01-01

other EC algorithms to FPGA Core Burns P1026/MAPLD 200532 Genetic Algorithm Hardware References S. Scott, A. Samal , and S. Seth, “HGA: A Hardware Based...on Parallel and Distributed Processing (IPPS/SPDP 󈨦), pp. 316-320, Proceedings. IEEE Computer Society 1998. [12] Scott, S. D. , Samal , A., and...Algorithm Hardware References S. Scott, A. Samal , and S. Seth, “HGA: A Hardware Based Genetic Algorithm”, Proceedings of the 1995 ACM Third

Lifted worm algorithm for the Ising model

NASA Astrophysics Data System (ADS)

Elçi, Eren Metin; Grimm, Jens; Ding, Lijie; Nasrawi, Abrahim; Garoni, Timothy M.; Deng, Youjin

2018-04-01

We design an irreversible worm algorithm for the zero-field ferromagnetic Ising model by using the lifting technique. We study the dynamic critical behavior of an energylike observable on both the complete graph and toroidal grids, and compare our findings with reversible algorithms such as the Prokof'ev-Svistunov worm algorithm. Our results show that the lifted worm algorithm improves the dynamic exponent of the energylike observable on the complete graph and leads to a significant constant improvement on toroidal grids.

A joint equalization algorithm in high speed communication systems

NASA Astrophysics Data System (ADS)

Hao, Xin; Lin, Changxing; Wang, Zhaohui; Cheng, Binbin; Deng, Xianjin

2018-02-01

This paper presents a joint equalization algorithm in high speed communication systems. This algorithm takes the advantages of traditional equalization algorithms to use pre-equalization and post-equalization. The pre-equalization algorithm takes the advantage of CMA algorithm, which is not sensitive to the frequency offset. Pre-equalization is located before the carrier recovery loop in order to make the carrier recovery loop a better performance and overcome most of the frequency offset. The post-equalization takes the advantage of MMA algorithm in order to overcome the residual frequency offset. This paper analyzes the advantages and disadvantages of several equalization algorithms in the first place, and then simulates the proposed joint equalization algorithm in Matlab platform. The simulation results shows the constellation diagrams and the bit error rate curve, both these results show that the proposed joint equalization algorithm is better than the traditional algorithms. The residual frequency offset is shown directly in the constellation diagrams. When SNR is 14dB， the bit error rate of the simulated system with the proposed joint equalization algorithm is 103 times better than CMA algorithm, 77 times better than MMA equalization, and 9 times better than CMA-MMA equalization.

Ant algorithms for discrete optimization.

PubMed

Dorigo, M; Di Caro, G; Gambardella, L M

1999-01-01

This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' foraging behavior, and introduces the ant colony optimization (ACO) metaheuristic. In the first part of the article the basic biological findings on real ants are reviewed and their artificial counterparts as well as the ACO metaheuristic are defined. In the second part of the article a number of applications of ACO algorithms to combinatorial optimization and routing in communications networks are described. We conclude with a discussion of related work and of some of the most important aspects of the ACO metaheuristic.

Research of improved banker algorithm

NASA Astrophysics Data System (ADS)

Yuan, Xingde; Xu, Hong; Qiao, Shijiao

2013-03-01

In the multi-process operating system, resource management strategy of system is a critical global issue, especially when many processes implicating for the limited resources, since unreasonable scheduling will cause dead lock. The most classical solution for dead lock question is the banker algorithm; however, it has its own deficiency and only can avoid dead lock occurring in a certain extent. This article aims at reducing unnecessary safety checking, and then uses the new allocation strategy to improve the banker algorithm. Through full analysis and example verification of the new allocation strategy, the results show the improved banker algorithm obtains substantial increase in performance.

Faster fourier transformation: The algorithm of S. Winograd

NASA Technical Reports Server (NTRS)

Zohar, S.

1979-01-01

The new DFT algorithm of S. Winograd is developed and presented in detail. This is an algorithm which uses about 1/5 of the number of multiplications used by the Cooley-Tukey algorithm and is applicable to any order which is a product of relatively prime factors from the following list: 2,3,4,5,7,8,9,16. The algorithm is presented in terms of a series of tableaus which are convenient, compact, graphical representations of the sequence of arithmetic operations in the corresponding parts of the algorithm. Using these in conjunction with included Tables makes it relatively easy to apply the algorithm and evaluate its performance.

Algorithm Calculates Cumulative Poisson Distribution

NASA Technical Reports Server (NTRS)

Bowerman, Paul N.; Nolty, Robert C.; Scheuer, Ernest M.

1992-01-01

Algorithm calculates accurate values of cumulative Poisson distribution under conditions where other algorithms fail because numbers are so small (underflow) or so large (overflow) that computer cannot process them. Factors inserted temporarily to prevent underflow and overflow. Implemented in CUMPOIS computer program described in "Cumulative Poisson Distribution Program" (NPO-17714).

A quasi-Newton algorithm for large-scale nonlinear equations.

PubMed

Huang, Linghua

2017-01-01

In this paper, the algorithm for large-scale nonlinear equations is designed by the following steps: (i) a conjugate gradient (CG) algorithm is designed as a sub-algorithm to obtain the initial points of the main algorithm, where the sub-algorithm's initial point does not have any restrictions; (ii) a quasi-Newton algorithm with the initial points given by sub-algorithm is defined as main algorithm, where a new nonmonotone line search technique is presented to get the step length [Formula: see text]. The given nonmonotone line search technique can avoid computing the Jacobian matrix. The global convergence and the [Formula: see text]-order convergent rate of the main algorithm are established under suitable conditions. Numerical results show that the proposed method is competitive with a similar method for large-scale problems.

SDR input power estimation algorithms

NASA Astrophysics Data System (ADS)

Briones, J. C.; Nappier, J. M.

The General Dynamics (GD) S-Band software defined radio (SDR) in the Space Communications and Navigation (SCAN) Testbed on the International Space Station (ISS) provides experimenters an opportunity to develop and demonstrate experimental waveforms in space. The SDR has an analog and a digital automatic gain control (AGC) and the response of the AGCs to changes in SDR input power and temperature was characterized prior to the launch and installation of the SCAN Testbed on the ISS. The AGCs were used to estimate the SDR input power and SNR of the received signal and the characterization results showed a nonlinear response to SDR input power and temperature. In order to estimate the SDR input from the AGCs, three algorithms were developed and implemented on the ground software of the SCAN Testbed. The algorithms include a linear straight line estimator, which used the digital AGC and the temperature to estimate the SDR input power over a narrower section of the SDR input power range. There is a linear adaptive filter algorithm that uses both AGCs and the temperature to estimate the SDR input power over a wide input power range. Finally, an algorithm that uses neural networks was designed to estimate the input power over a wide range. This paper describes the algorithms in detail and their associated performance in estimating the SDR input power.

POSE Algorithms for Automated Docking

NASA Technical Reports Server (NTRS)

Heaton, Andrew F.; Howard, Richard T.

2011-01-01

POSE (relative position and attitude) can be computed in many different ways. Given a sensor that measures bearing to a finite number of spots corresponding to known features (such as a target) of a spacecraft, a number of different algorithms can be used to compute the POSE. NASA has sponsored the development of a flash LIDAR proximity sensor called the Vision Navigation Sensor (VNS) for use by the Orion capsule in future docking missions. This sensor generates data that can be used by a variety of algorithms to compute POSE solutions inside of 15 meters, including at the critical docking range of approximately 1-2 meters. Previously NASA participated in a DARPA program called Orbital Express that achieved the first automated docking for the American space program. During this mission a large set of high quality mated sensor data was obtained at what is essentially the docking distance. This data set is perhaps the most accurate truth data in existence for docking proximity sensors in orbit. In this paper, the flight data from Orbital Express is used to test POSE algorithms at 1.22 meters range. Two different POSE algorithms are tested for two different Fields-of-View (FOVs) and two different pixel noise levels. The results of the analysis are used to predict future performance of the POSE algorithms with VNS data.

SDR Input Power Estimation Algorithms

NASA Technical Reports Server (NTRS)

Nappier, Jennifer M.; Briones, Janette C.

2013-01-01

The General Dynamics (GD) S-Band software defined radio (SDR) in the Space Communications and Navigation (SCAN) Testbed on the International Space Station (ISS) provides experimenters an opportunity to develop and demonstrate experimental waveforms in space. The SDR has an analog and a digital automatic gain control (AGC) and the response of the AGCs to changes in SDR input power and temperature was characterized prior to the launch and installation of the SCAN Testbed on the ISS. The AGCs were used to estimate the SDR input power and SNR of the received signal and the characterization results showed a nonlinear response to SDR input power and temperature. In order to estimate the SDR input from the AGCs, three algorithms were developed and implemented on the ground software of the SCAN Testbed. The algorithms include a linear straight line estimator, which used the digital AGC and the temperature to estimate the SDR input power over a narrower section of the SDR input power range. There is a linear adaptive filter algorithm that uses both AGCs and the temperature to estimate the SDR input power over a wide input power range. Finally, an algorithm that uses neural networks was designed to estimate the input power over a wide range. This paper describes the algorithms in detail and their associated performance in estimating the SDR input power.

Joint Services Electronics Program.

DTIC Science & Technology

1985-03-31

COJNRACT ON GRANT NuuSER(.j M. Tinkham N00014-84-K-0465 S. PeRFOR MING ORGANIZATION NAME AND ADORESS 𔃺. PROGRAM EL.,IT. P0OJECT. TASA Division of...2 7 R.W. Brockett DlAG29-83-K-0040 TW.osbr AFosR- 81-7401 R.W. Brockett -: DE -FGD2-84-EEw4O1 5B T.T. Wui sER xB-2-02144-l W. Paul JOINT SERVICES...0465, NSF DMR-81-08327 and SERI Subcontract XB-2-02144-1 of DOE Prime Contract DE -AC-02-83-CHI0093; Research Unit 2 (former #3). During this period we

Detection of algorithmic trading

NASA Astrophysics Data System (ADS)

Bogoev, Dimitar; Karam, Arzé

2017-10-01

We develop a new approach to reflect the behavior of algorithmic traders. Specifically, we provide an analytical and tractable way to infer patterns of quote volatility and price momentum consistent with different types of strategies employed by algorithmic traders, and we propose two ratios to quantify these patterns. Quote volatility ratio is based on the rate of oscillation of the best ask and best bid quotes over an extremely short period of time; whereas price momentum ratio is based on identifying patterns of rapid upward or downward movement in prices. The two ratios are evaluated across several asset classes. We further run a two-stage Artificial Neural Network experiment on the quote volatility ratio; the first stage is used to detect the quote volatility patterns resulting from algorithmic activity, while the second is used to validate the quality of signal detection provided by our measure.

Knowledge-based tracking algorithm

NASA Astrophysics Data System (ADS)

Corbeil, Allan F.; Hawkins, Linda J.; Gilgallon, Paul F.

1990-10-01

This paper describes the Knowledge-Based Tracking (KBT) algorithm for which a real-time flight test demonstration was recently conducted at Rome Air Development Center (RADC). In KBT processing, the radar signal in each resolution cell is thresholded at a lower than normal setting to detect low RCS targets. This lower threshold produces a larger than normal false alarm rate. Therefore, additional signal processing including spectral filtering, CFAR and knowledge-based acceptance testing are performed to eliminate some of the false alarms. TSC's knowledge-based Track-Before-Detect (TBD) algorithm is then applied to the data from each azimuth sector to detect target tracks. In this algorithm, tentative track templates are formed for each threshold crossing and knowledge-based association rules are applied to the range, Doppler, and azimuth measurements from successive scans. Lastly, an M-association out of N-scan rule is used to declare a detection. This scan-to-scan integration enhances the probability of target detection while maintaining an acceptably low output false alarm rate. For a real-time demonstration of the KBT algorithm, the L-band radar in the Surveillance Laboratory (SL) at RADC was used to illuminate a small Cessna 310 test aircraft. The received radar signal wa digitized and processed by a ST-100 Array Processor and VAX computer network in the lab. The ST-100 performed all of the radar signal processing functions, including Moving Target Indicator (MTI) pulse cancelling, FFT Doppler filtering, and CFAR detection. The VAX computers performed the remaining range-Doppler clustering, beamsplitting and TBD processing functions. The KBT algorithm provided a 9.5 dB improvement relative to single scan performance with a nominal real time delay of less than one second between illumination and display.

The serial message-passing schedule for LDPC decoding algorithms

NASA Astrophysics Data System (ADS)

Liu, Mingshan; Liu, Shanshan; Zhou, Yuan; Jiang, Xue

2015-12-01

The conventional message-passing schedule for LDPC decoding algorithms is the so-called flooding schedule. It has the disadvantage that the updated messages cannot be used until next iteration, thus reducing the convergence speed . In this case, the Layered Decoding algorithm (LBP) based on serial message-passing schedule is proposed. In this paper the decoding principle of LBP algorithm is briefly introduced, and then proposed its two improved algorithms, the grouped serial decoding algorithm (Grouped LBP) and the semi-serial decoding algorithm .They can improve LBP algorithm's decoding speed while maintaining a good decoding performance.

Learning Intelligent Genetic Algorithms Using Japanese Nonograms

ERIC Educational Resources Information Center

Tsai, Jinn-Tsong; Chou, Ping-Yi; Fang, Jia-Cen

2012-01-01

An intelligent genetic algorithm (IGA) is proposed to solve Japanese nonograms and is used as a method in a university course to learn evolutionary algorithms. The IGA combines the global exploration capabilities of a canonical genetic algorithm (CGA) with effective condensed encoding, improved fitness function, and modified crossover and…

One cutting plane algorithm using auxiliary functions

NASA Astrophysics Data System (ADS)

Zabotin, I. Ya; Kazaeva, K. E.

2016-11-01

We propose an algorithm for solving a convex programming problem from the class of cutting methods. The algorithm is characterized by the construction of approximations using some auxiliary functions, instead of the objective function. Each auxiliary function bases on the exterior penalty function. In proposed algorithm the admissible set and the epigraph of each auxiliary function are embedded into polyhedral sets. In connection with the above, the iteration points are found by solving linear programming problems. We discuss the implementation of the algorithm and prove its convergence.

Research on Palmprint Identification Method Based on Quantum Algorithms

PubMed Central

Zhang, Zhanzhan

2014-01-01

Quantum image recognition is a technology by using quantum algorithm to process the image information. It can obtain better effect than classical algorithm. In this paper, four different quantum algorithms are used in the three stages of palmprint recognition. First, quantum adaptive median filtering algorithm is presented in palmprint filtering processing. Quantum filtering algorithm can get a better filtering result than classical algorithm through the comparison. Next, quantum Fourier transform (QFT) is used to extract pattern features by only one operation due to quantum parallelism. The proposed algorithm exhibits an exponential speed-up compared with discrete Fourier transform in the feature extraction. Finally, quantum set operations and Grover algorithm are used in palmprint matching. According to the experimental results, quantum algorithm only needs to apply square of N operations to find out the target palmprint, but the traditional method needs N times of calculation. At the same time, the matching accuracy of quantum algorithm is almost 100%. PMID:25105165

Improved Collaborative Filtering Algorithm via Information Transformation

NASA Astrophysics Data System (ADS)

Liu, Jian-Guo; Wang, Bing-Hong; Guo, Qiang

In this paper, we propose a spreading activation approach for collaborative filtering (SA-CF). By using the opinion spreading process, the similarity between any users can be obtained. The algorithm has remarkably higher accuracy than the standard collaborative filtering using the Pearson correlation. Furthermore, we introduce a free parameter β to regulate the contributions of objects to user-user correlations. The numerical results indicate that decreasing the influence of popular objects can further improve the algorithmic accuracy and personality. We argue that a better algorithm should simultaneously require less computation and generate higher accuracy. Accordingly, we further propose an algorithm involving only the top-N similar neighbors for each target user, which has both less computational complexity and higher algorithmic accuracy.

Solving TSP problem with improved genetic algorithm

NASA Astrophysics Data System (ADS)

Fu, Chunhua; Zhang, Lijun; Wang, Xiaojing; Qiao, Liying

2018-05-01

The TSP is a typical NP problem. The optimization of vehicle routing problem (VRP) and city pipeline optimization can use TSP to solve; therefore it is very important to the optimization for solving TSP problem. The genetic algorithm (GA) is one of ideal methods in solving it. The standard genetic algorithm has some limitations. Improving the selection operator of genetic algorithm, and importing elite retention strategy can ensure the select operation of quality, In mutation operation, using the adaptive algorithm selection can improve the quality of search results and variation, after the chromosome evolved one-way evolution reverse operation is added which can make the offspring inherit gene of parental quality improvement opportunities, and improve the ability of searching the optimal solution algorithm.

Computer algorithm for coding gain

NASA Technical Reports Server (NTRS)

Dodd, E. E.

1974-01-01

Development of a computer algorithm for coding gain for use in an automated communications link design system. Using an empirical formula which defines coding gain as used in space communications engineering, an algorithm is constructed on the basis of available performance data for nonsystematic convolutional encoding with soft-decision (eight-level) Viterbi decoding.

Testing algorithms for critical slowing down

NASA Astrophysics Data System (ADS)

Cossu, Guido; Boyle, Peter; Christ, Norman; Jung, Chulwoo; Jüttner, Andreas; Sanfilippo, Francesco

2018-03-01

We present the preliminary tests on two modifications of the Hybrid Monte Carlo (HMC) algorithm. Both algorithms are designed to travel much farther in the Hamiltonian phase space for each trajectory and reduce the autocorrelations among physical observables thus tackling the critical slowing down towards the continuum limit. We present a comparison of costs of the new algorithms with the standard HMC evolution for pure gauge fields, studying the autocorrelation times for various quantities including the topological charge.

Duality quantum algorithm efficiently simulates open quantum systems

PubMed Central

Wei, Shi-Jie; Ruan, Dong; Long, Gui-Lu

2016-01-01

Because of inevitable coupling with the environment, nearly all practical quantum systems are open system, where the evolution is not necessarily unitary. In this paper, we propose a duality quantum algorithm for simulating Hamiltonian evolution of an open quantum system. In contrast to unitary evolution in a usual quantum computer, the evolution operator in a duality quantum computer is a linear combination of unitary operators. In this duality quantum algorithm, the time evolution of the open quantum system is realized by using Kraus operators which is naturally implemented in duality quantum computer. This duality quantum algorithm has two distinct advantages compared to existing quantum simulation algorithms with unitary evolution operations. Firstly, the query complexity of the algorithm is O(d3) in contrast to O(d4) in existing unitary simulation algorithm, where d is the dimension of the open quantum system. Secondly, By using a truncated Taylor series of the evolution operators, this duality quantum algorithm provides an exponential improvement in precision compared with previous unitary simulation algorithm. PMID:27464855

Parameterization of Keeling's network generation algorithm.

PubMed

Badham, Jennifer; Abbass, Hussein; Stocker, Rob

2008-09-01

Simulation is increasingly being used to examine epidemic behaviour and assess potential management options. The utility of the simulations rely on the ability to replicate those aspects of the social structure that are relevant to epidemic transmission. One approach is to generate networks with desired social properties. Recent research by Keeling and his colleagues has generated simulated networks with a range of properties, and examined the impact of these properties on epidemic processes occurring over the network. However, published work has included only limited analysis of the algorithm itself and the way in which the network properties are related to the algorithm parameters. This paper identifies some relationships between the algorithm parameters and selected network properties (mean degree, degree variation, clustering coefficient and assortativity). Our approach enables users of the algorithm to efficiently generate a network with given properties, thereby allowing realistic social networks to be used as the basis of epidemic simulations. Alternatively, the algorithm could be used to generate social networks with a range of property values, enabling analysis of the impact of these properties on epidemic behaviour.

Bell-Curve Based Evolutionary Optimization Algorithm

NASA Technical Reports Server (NTRS)

Sobieszczanski-Sobieski, J.; Laba, K.; Kincaid, R.

1998-01-01

The paper presents an optimization algorithm that falls in the category of genetic, or evolutionary algorithms. While the bit exchange is the basis of most of the Genetic Algorithms (GA) in research and applications in America, some alternatives, also in the category of evolutionary algorithms, but use a direct, geometrical approach have gained popularity in Europe and Asia. The Bell-Curve Based Evolutionary Algorithm (BCB) is in this alternative category and is distinguished by the use of a combination of n-dimensional geometry and the normal distribution, the bell-curve, in the generation of the offspring. The tool for creating a child is a geometrical construct comprising a line connecting two parents and a weighted point on that line. The point that defines the child deviates from the weighted point in two directions: parallel and orthogonal to the connecting line, the deviation in each direction obeying a probabilistic distribution. Tests showed satisfactory performance of BCB. The principal advantage of BCB is its controllability via the normal distribution parameters and the geometrical construct variables.

Location-Aware Mobile Learning of Spatial Algorithms

ERIC Educational Resources Information Center

Karavirta, Ville

2013-01-01

Learning an algorithm--a systematic sequence of operations for solving a problem with given input--is often difficult for students due to the abstract nature of the algorithms and the data they process. To help students understand the behavior of algorithms, a subfield in computing education research has focused on algorithm…

Verification of IEEE Compliant Subtractive Division Algorithms

NASA Technical Reports Server (NTRS)

Miner, Paul S.; Leathrum, James F., Jr.

1996-01-01

A parameterized definition of subtractive floating point division algorithms is presented and verified using PVS. The general algorithm is proven to satisfy a formal definition of an IEEE standard for floating point arithmetic. The utility of the general specification is illustrated using a number of different instances of the general algorithm.

Bouc-Wen hysteresis model identification using Modified Firefly Algorithm

NASA Astrophysics Data System (ADS)

Zaman, Mohammad Asif; Sikder, Urmita

2015-12-01

The parameters of Bouc-Wen hysteresis model are identified using a Modified Firefly Algorithm. The proposed algorithm uses dynamic process control parameters to improve its performance. The algorithm is used to find the model parameter values that results in the least amount of error between a set of given data points and points obtained from the Bouc-Wen model. The performance of the algorithm is compared with the performance of conventional Firefly Algorithm, Genetic Algorithm and Differential Evolution algorithm in terms of convergence rate and accuracy. Compared to the other three optimization algorithms, the proposed algorithm is found to have good convergence rate with high degree of accuracy in identifying Bouc-Wen model parameters. Finally, the proposed method is used to find the Bouc-Wen model parameters from experimental data. The obtained model is found to be in good agreement with measured data.

Limitations and potentials of current motif discovery algorithms

PubMed Central

Hu, Jianjun; Li, Bin; Kihara, Daisuke

2005-01-01

Computational methods for de novo identification of gene regulation elements, such as transcription factor binding sites, have proved to be useful for deciphering genetic regulatory networks. However, despite the availability of a large number of algorithms, their strengths and weaknesses are not sufficiently understood. Here, we designed a comprehensive set of performance measures and benchmarked five modern sequence-based motif discovery algorithms using large datasets generated from Escherichia coli RegulonDB. Factors that affect the prediction accuracy, scalability and reliability are characterized. It is revealed that the nucleotide and the binding site level accuracy are very low, while the motif level accuracy is relatively high, which indicates that the algorithms can usually capture at least one correct motif in an input sequence. To exploit diverse predictions from multiple runs of one or more algorithms, a consensus ensemble algorithm has been developed, which achieved 6–45% improvement over the base algorithms by increasing both the sensitivity and specificity. Our study illustrates limitations and potentials of existing sequence-based motif discovery algorithms. Taking advantage of the revealed potentials, several promising directions for further improvements are discussed. Since the sequence-based algorithms are the baseline of most of the modern motif discovery algorithms, this paper suggests substantial improvements would be possible for them. PMID:16284194

[A new peak detection algorithm of Raman spectra].

PubMed

Jiang, Cheng-Zhi; Sun, Qiang; Liu, Ying; Liang, Jing-Qiu; An, Yan; Liu, Bing

2014-01-01

The authors proposed a new Raman peak recognition method named bi-scale correlation algorithm. The algorithm uses the combination of the correlation coefficient and the local signal-to-noise ratio under two scales to achieve Raman peak identification. We compared the performance of the proposed algorithm with that of the traditional continuous wavelet transform method through MATLAB, and then tested the algorithm with real Raman spectra. The results show that the average time for identifying a Raman spectrum is 0.51 s with the algorithm, while it is 0.71 s with the continuous wavelet transform. When the signal-to-noise ratio of Raman peak is greater than or equal to 6 (modern Raman spectrometers feature an excellent signal-to-noise ratio), the recognition accuracy with the algorithm is higher than 99%, while it is less than 84% with the continuous wavelet transform method. The mean and the standard deviations of the peak position identification error of the algorithm are both less than that of the continuous wavelet transform method. Simulation analysis and experimental verification prove that the new algorithm possesses the following advantages: no needs of human intervention, no needs of de-noising and background removal operation, higher recognition speed and higher recognition accuracy. The proposed algorithm is operable in Raman peak identification.

Mapped Landmark Algorithm for Precision Landing

NASA Technical Reports Server (NTRS)

Johnson, Andrew; Ansar, Adnan; Matthies, Larry

2007-01-01

A report discusses a computer vision algorithm for position estimation to enable precision landing during planetary descent. The Descent Image Motion Estimation System for the Mars Exploration Rovers has been used as a starting point for creating code for precision, terrain-relative navigation during planetary landing. The algorithm is designed to be general because it handles images taken at different scales and resolutions relative to the map, and can produce mapped landmark matches for any planetary terrain of sufficient texture. These matches provide a measurement of horizontal position relative to a known landing site specified on the surface map. Multiple mapped landmarks generated per image allow for automatic detection and elimination of bad matches. Attitude and position can be generated from each image; this image-based attitude measurement can be used by the onboard navigation filter to improve the attitude estimate, which will improve the position estimates. The algorithm uses normalized correlation of grayscale images, producing precise, sub-pixel images. The algorithm has been broken into two sub-algorithms: (1) FFT Map Matching (see figure), which matches a single large template by correlation in the frequency domain, and (2) Mapped Landmark Refinement, which matches many small templates by correlation in the spatial domain. Each relies on feature selection, the homography transform, and 3D image correlation. The algorithm is implemented in C++ and is rated at Technology Readiness Level (TRL) 4.

A Multistrategy Optimization Improved Artificial Bee Colony Algorithm

PubMed Central

Liu, Wen

2014-01-01

Being prone to the shortcomings of premature and slow convergence rate of artificial bee colony algorithm, an improved algorithm was proposed. Chaotic reverse learning strategies were used to initialize swarm in order to improve the global search ability of the algorithm and keep the diversity of the algorithm; the similarity degree of individuals of the population was used to characterize the diversity of population; population diversity measure was set as an indicator to dynamically and adaptively adjust the nectar position; the premature and local convergence were avoided effectively; dual population search mechanism was introduced to the search stage of algorithm; the parallel search of dual population considerably improved the convergence rate. Through simulation experiments of 10 standard testing functions and compared with other algorithms, the results showed that the improved algorithm had faster convergence rate and the capacity of jumping out of local optimum faster. PMID:24982924

Local multiplicative Schwarz algorithms for convection-diffusion equations

NASA Technical Reports Server (NTRS)

Cai, Xiao-Chuan; Sarkis, Marcus

1995-01-01

We develop a new class of overlapping Schwarz type algorithms for solving scalar convection-diffusion equations discretized by finite element or finite difference methods. The preconditioners consist of two components, namely, the usual two-level additive Schwarz preconditioner and the sum of some quadratic terms constructed by using products of ordered neighboring subdomain preconditioners. The ordering of the subdomain preconditioners is determined by considering the direction of the flow. We prove that the algorithms are optimal in the sense that the convergence rates are independent of the mesh size, as well as the number of subdomains. We show by numerical examples that the new algorithms are less sensitive to the direction of the flow than either the classical multiplicative Schwarz algorithms, and converge faster than the additive Schwarz algorithms. Thus, the new algorithms are more suitable for fluid flow applications than the classical additive or multiplicative Schwarz algorithms.

Adaptively resizing populations: Algorithm, analysis, and first results

NASA Technical Reports Server (NTRS)

Smith, Robert E.; Smuda, Ellen

1993-01-01

Deciding on an appropriate population size for a given Genetic Algorithm (GA) application can often be critical to the algorithm's success. Too small, and the GA can fall victim to sampling error, affecting the efficacy of its search. Too large, and the GA wastes computational resources. Although advice exists for sizing GA populations, much of this advice involves theoretical aspects that are not accessible to the novice user. An algorithm for adaptively resizing GA populations is suggested. This algorithm is based on recent theoretical developments that relate population size to schema fitness variance. The suggested algorithm is developed theoretically, and simulated with expected value equations. The algorithm is then tested on a problem where population sizing can mislead the GA. The work presented suggests that the population sizing algorithm may be a viable way to eliminate the population sizing decision from the application of GA's.

Selected-node stochastic simulation algorithm

NASA Astrophysics Data System (ADS)

Duso, Lorenzo; Zechner, Christoph

2018-04-01

Stochastic simulations of biochemical networks are of vital importance for understanding complex dynamics in cells and tissues. However, existing methods to perform such simulations are associated with computational difficulties and addressing those remains a daunting challenge to the present. Here we introduce the selected-node stochastic simulation algorithm (snSSA), which allows us to exclusively simulate an arbitrary, selected subset of molecular species of a possibly large and complex reaction network. The algorithm is based on an analytical elimination of chemical species, thereby avoiding explicit simulation of the associated chemical events. These species are instead described continuously in terms of statistical moments derived from a stochastic filtering equation, resulting in a substantial speedup when compared to Gillespie's stochastic simulation algorithm (SSA). Moreover, we show that statistics obtained via snSSA profit from a variance reduction, which can significantly lower the number of Monte Carlo samples needed to achieve a certain performance. We demonstrate the algorithm using several biological case studies for which the simulation time could be reduced by orders of magnitude.

High-order Newton-penalty algorithms

NASA Astrophysics Data System (ADS)

Dussault, Jean-Pierre

2005-10-01

Recent efforts in differentiable non-linear programming have been focused on interior point methods, akin to penalty and barrier algorithms. In this paper, we address the classical equality constrained program solved using the simple quadratic loss penalty function/algorithm. The suggestion to use extrapolations to track the differentiable trajectory associated with penalized subproblems goes back to the classic monograph of Fiacco & McCormick. This idea was further developed by Gould who obtained a two-steps quadratically convergent algorithm using prediction steps and Newton correction. Dussault interpreted the prediction step as a combined extrapolation with respect to the penalty parameter and the residual of the first order optimality conditions. Extrapolation with respect to the residual coincides with a Newton step.We explore here higher-order extrapolations, thus higher-order Newton-like methods. We first consider high-order variants of the Newton-Raphson method applied to non-linear systems of equations. Next, we obtain improved asymptotic convergence results for the quadratic loss penalty algorithm by using high-order extrapolation steps.

Coagulation algorithms with size binning

NASA Technical Reports Server (NTRS)

Statton, David M.; Gans, Jason; Williams, Eric

1994-01-01

The Smoluchowski equation describes the time evolution of an aerosol particle size distribution due to aggregation or coagulation. Any algorithm for computerized solution of this equation requires a scheme for describing the continuum of aerosol particle sizes as a discrete set. One standard form of the Smoluchowski equation accomplishes this by restricting the particle sizes to integer multiples of a basic unit particle size (the monomer size). This can be inefficient when particle concentrations over a large range of particle sizes must be calculated. Two algorithms employing a geometric size binning convention are examined: the first assumes that the aerosol particle concentration as a function of size can be considered constant within each size bin; the second approximates the concentration as a linear function of particle size within each size bin. The output of each algorithm is compared to an analytical solution in a special case of the Smoluchowski equation for which an exact solution is known . The range of parameters more appropriate for each algorithm is examined.

Fast algorithm for bilinear transforms in optics

NASA Astrophysics Data System (ADS)

Ostrovsky, Andrey S.; Martinez-Niconoff, Gabriel C.; Ramos Romero, Obdulio; Cortes, Liliana

2000-10-01

The fast algorithm for calculating the bilinear transform in the optical system is proposed. This algorithm is based on the coherent-mode representation of the cross-spectral density function of the illumination. The algorithm is computationally efficient when the illumination is partially coherent. Numerical examples are studied and compared with the theoretical results.

Algorithms For Integrating Nonlinear Differential Equations

NASA Technical Reports Server (NTRS)

Freed, A. D.; Walker, K. P.

1994-01-01

Improved algorithms developed for use in numerical integration of systems of nonhomogenous, nonlinear, first-order, ordinary differential equations. In comparison with integration algorithms, these algorithms offer greater stability and accuracy. Several asymptotically correct, thereby enabling retention of stability and accuracy when large increments of independent variable used. Accuracies attainable demonstrated by applying them to systems of nonlinear, first-order, differential equations that arise in study of viscoplastic behavior, spread of acquired immune-deficiency syndrome (AIDS) virus and predator/prey populations.

Performance of the "CCS Algorithm" in real world patients.

PubMed

LaHaye, Stephen A; Olesen, Jonas B; Lacombe, Shawn P

2015-06-01

With the publication of the 2014 Focused Update of the Canadian Cardiovascular Society Guidelines for the Management of Atrial Fibrillation, the Canadian Cardiovascular Society Atrial Fibrillation Guidelines Committee has introduced a new triage and management algorithm; the so-called "CCS Algorithm". The CCS Algorithm is based upon expert opinion of the best available evidence; however, the CCS Algorithm has not yet been validated. Accordingly, the purpose of this study is to evaluate the performance of the CCS Algorithm in a cohort of real world patients. We compared the CCS Algorithm with the European Society of Cardiology (ESC) Algorithm in 172 hospital inpatients who are at risk of stroke due to non-valvular atrial fibrillation in whom anticoagulant therapy was being considered. The CCS Algorithm and the ESC Algorithm were concordant in 170/172 patients (99% of the time). There were two patients (1%) with vascular disease, but no other thromboembolic risk factors, which were classified as requiring oral anticoagulant therapy using the ESC Algorithm, but for whom ASA was recommended by the CCS Algorithm. The CCS Algorithm appears to be unnecessarily complicated in so far as it does not appear to provide any additional discriminatory value above and beyond the use of the ESC Algorithm, and its use could result in under treatment of patients, specifically female patients with vascular disease, whose real risk of stroke has been understated by the Guidelines.

Aeon: Synthesizing Scheduling Algorithms from High-Level Models

NASA Astrophysics Data System (ADS)

Monette, Jean-Noël; Deville, Yves; van Hentenryck, Pascal

This paper describes the aeon system whose aim is to synthesize scheduling algorithms from high-level models. A eon, which is entirely written in comet, receives as input a high-level model for a scheduling application which is then analyzed to generate a dedicated scheduling algorithm exploiting the structure of the model. A eon provides a variety of synthesizers for generating complete or heuristic algorithms. Moreover, synthesizers are compositional, making it possible to generate complex hybrid algorithms naturally. Preliminary experimental results indicate that this approach may be competitive with state-of-the-art search algorithms.

Teaching Multiplication Algorithms from Other Cultures

ERIC Educational Resources Information Center

Lin, Cheng-Yao

2007-01-01

This article describes a number of multiplication algorithms from different cultures around the world: Hindu, Egyptian, Russian, Japanese, and Chinese. Students can learn these algorithms and better understand the operation and properties of multiplication.

Stochastic reaction-diffusion algorithms for macromolecular crowding

NASA Astrophysics Data System (ADS)

Sturrock, Marc

2016-06-01

Compartment-based (lattice-based) reaction-diffusion algorithms are often used for studying complex stochastic spatio-temporal processes inside cells. In this paper the influence of macromolecular crowding on stochastic reaction-diffusion simulations is investigated. Reaction-diffusion processes are considered on two different kinds of compartmental lattice, a cubic lattice and a hexagonal close packed lattice, and solved using two different algorithms, the stochastic simulation algorithm and the spatiocyte algorithm (Arjunan and Tomita 2010 Syst. Synth. Biol. 4, 35-53). Obstacles (modelling macromolecular crowding) are shown to have substantial effects on the mean squared displacement and average number of molecules in the domain but the nature of these effects is dependent on the choice of lattice, with the cubic lattice being more susceptible to the effects of the obstacles. Finally, improvements for both algorithms are presented.

Parallelization of a blind deconvolution algorithm

NASA Astrophysics Data System (ADS)

Matson, Charles L.; Borelli, Kathy J.

2006-09-01

Often it is of interest to deblur imagery in order to obtain higher-resolution images. Deblurring requires knowledge of the blurring function - information that is often not available separately from the blurred imagery. Blind deconvolution algorithms overcome this problem by jointly estimating both the high-resolution image and the blurring function from the blurred imagery. Because blind deconvolution algorithms are iterative in nature, they can take minutes to days to deblur an image depending how many frames of data are used for the deblurring and the platforms on which the algorithms are executed. Here we present our progress in parallelizing a blind deconvolution algorithm to increase its execution speed. This progress includes sub-frame parallelization and a code structure that is not specialized to a specific computer hardware architecture.

Line-drawing algorithms for parallel machines

NASA Technical Reports Server (NTRS)

Pang, Alex T.

1990-01-01

The fact that conventional line-drawing algorithms, when applied directly on parallel machines, can lead to very inefficient codes is addressed. It is suggested that instead of modifying an existing algorithm for a parallel machine, a more efficient implementation can be produced by going back to the invariants in the definition. Popular line-drawing algorithms are compared with two alternatives; distance to a line (a point is on the line if sufficiently close to it) and intersection with a line (a point on the line if an intersection point). For massively parallel single-instruction-multiple-data (SIMD) machines (with thousands of processors and up), the alternatives provide viable line-drawing algorithms. Because of the pixel-per-processor mapping, their performance is independent of the line length and orientation.

Convergence Rates of Finite Difference Stochastic Approximation Algorithms

DTIC Science & Technology

2016-06-01

dfferences as gradient approximations. It is shown that the convergence of these algorithms can be accelerated by controlling the implementation of the...descent algorithm, under various updating schemes using finite dfferences as gradient approximations. It is shown that the convergence of these...the Kiefer-Wolfowitz algorithm and the mirror descent algorithm, under various updating schemes using finite differences as gradient approximations. It

Information filtering via weighted heat conduction algorithm

NASA Astrophysics Data System (ADS)

Liu, Jian-Guo; Guo, Qiang; Zhang, Yi-Cheng

2011-06-01

In this paper, by taking into account effects of the user and object correlations on a heat conduction (HC) algorithm, a weighted heat conduction (WHC) algorithm is presented. We argue that the edge weight of the user-object bipartite network should be embedded into the HC algorithm to measure the object similarity. The numerical results indicate that both the accuracy and diversity could be improved greatly compared with the standard HC algorithm and the optimal values reached simultaneously. On the Movielens and Netflix datasets, the algorithmic accuracy, measured by the average ranking score, can be improved by 39.7% and 56.1% in the optimal case, respectively, and the diversity could reach 0.9587 and 0.9317 when the recommendation list equals to 5. Further statistical analysis indicates that, in the optimal case, the distributions of the edge weight are changed to the Poisson form, which may be the reason why HC algorithm performance could be improved. This work highlights the effect of edge weight on a personalized recommendation study, which maybe an important factor affecting personalized recommendation performance.

A hierarchical exact accelerated stochastic simulation algorithm

NASA Astrophysics Data System (ADS)

Orendorff, David; Mjolsness, Eric

2012-12-01

A new algorithm, "HiER-leap" (hierarchical exact reaction-leaping), is derived which improves on the computational properties of the ER-leap algorithm for exact accelerated simulation of stochastic chemical kinetics. Unlike ER-leap, HiER-leap utilizes a hierarchical or divide-and-conquer organization of reaction channels into tightly coupled "blocks" and is thereby able to speed up systems with many reaction channels. Like ER-leap, HiER-leap is based on the use of upper and lower bounds on the reaction propensities to define a rejection sampling algorithm with inexpensive early rejection and acceptance steps. But in HiER-leap, large portions of intra-block sampling may be done in parallel. An accept/reject step is used to synchronize across blocks. This method scales well when many reaction channels are present and has desirable asymptotic properties. The algorithm is exact, parallelizable and achieves a significant speedup over the stochastic simulation algorithm and ER-leap on certain problems. This algorithm offers a potentially important step towards efficient in silico modeling of entire organisms.

Multidimensional generalized-ensemble algorithms for complex systems.

PubMed

Mitsutake, Ayori; Okamoto, Yuko

2009-06-07

We give general formulations of the multidimensional multicanonical algorithm, simulated tempering, and replica-exchange method. We generalize the original potential energy function E(0) by adding any physical quantity V of interest as a new energy term. These multidimensional generalized-ensemble algorithms then perform a random walk not only in E(0) space but also in V space. Among the three algorithms, the replica-exchange method is the easiest to perform because the weight factor is just a product of regular Boltzmann-like factors, while the weight factors for the multicanonical algorithm and simulated tempering are not a priori known. We give a simple procedure for obtaining the weight factors for these two latter algorithms, which uses a short replica-exchange simulation and the multiple-histogram reweighting techniques. As an example of applications of these algorithms, we have performed a two-dimensional replica-exchange simulation and a two-dimensional simulated-tempering simulation using an alpha-helical peptide system. From these simulations, we study the helix-coil transitions of the peptide in gas phase and in aqueous solution.

The Applications of Genetic Algorithms in Medicine.

PubMed

Ghaheri, Ali; Shoar, Saeed; Naderan, Mohammad; Hoseini, Sayed Shahabuddin

2015-11-01

A great wealth of information is hidden amid medical research data that in some cases cannot be easily analyzed, if at all, using classical statistical methods. Inspired by nature, metaheuristic algorithms have been developed to offer optimal or near-optimal solutions to complex data analysis and decision-making tasks in a reasonable time. Due to their powerful features, metaheuristic algorithms have frequently been used in other fields of sciences. In medicine, however, the use of these algorithms are not known by physicians who may well benefit by applying them to solve complex medical problems. Therefore, in this paper, we introduce the genetic algorithm and its applications in medicine. The use of the genetic algorithm has promising implications in various medical specialties including radiology, radiotherapy, oncology, pediatrics, cardiology, endocrinology, surgery, obstetrics and gynecology, pulmonology, infectious diseases, orthopedics, rehabilitation medicine, neurology, pharmacotherapy, and health care management. This review introduces the applications of the genetic algorithm in disease screening, diagnosis, treatment planning, pharmacovigilance, prognosis, and health care management, and enables physicians to envision possible applications of this metaheuristic method in their medical career.].

The Applications of Genetic Algorithms in Medicine

PubMed Central

Ghaheri, Ali; Shoar, Saeed; Naderan, Mohammad; Hoseini, Sayed Shahabuddin

2015-01-01

A great wealth of information is hidden amid medical research data that in some cases cannot be easily analyzed, if at all, using classical statistical methods. Inspired by nature, metaheuristic algorithms have been developed to offer optimal or near-optimal solutions to complex data analysis and decision-making tasks in a reasonable time. Due to their powerful features, metaheuristic algorithms have frequently been used in other fields of sciences. In medicine, however, the use of these algorithms are not known by physicians who may well benefit by applying them to solve complex medical problems. Therefore, in this paper, we introduce the genetic algorithm and its applications in medicine. The use of the genetic algorithm has promising implications in various medical specialties including radiology, radiotherapy, oncology, pediatrics, cardiology, endocrinology, surgery, obstetrics and gynecology, pulmonology, infectious diseases, orthopedics, rehabilitation medicine, neurology, pharmacotherapy, and health care management. This review introduces the applications of the genetic algorithm in disease screening, diagnosis, treatment planning, pharmacovigilance, prognosis, and health care management, and enables physicians to envision possible applications of this metaheuristic method in their medical career.] PMID:26676060

An adaptive grid algorithm for 3-D GIS landform optimization based on improved ant algorithm

NASA Astrophysics Data System (ADS)

Wu, Chenhan; Meng, Lingkui; Deng, Shijun

2005-07-01

The key technique of 3-D GIS is to realize quick and high-quality 3-D visualization, in which 3-D roaming system based on landform plays an important role. However how to increase efficiency of 3-D roaming engine and process a large amount of landform data is a key problem in 3-D landform roaming system and improper process of the problem would result in tremendous consumption of system resources. Therefore it has become the key of 3-D roaming system design that how to realize high-speed process of distributed data for landform DEM (Digital Elevation Model) and high-speed distributed modulation of various 3-D landform data resources. In the paper we improved the basic ant algorithm and designed the modulation strategy of 3-D GIS landform resources based on the improved ant algorithm. By initially hypothetic road weights σi , the change of the information factors in the original algorithm would transform from ˜τj to ∆τj+σi and the weights was decided by 3-D computative capacity of various nodes in network environment. So during the course of initial phase of task assignment, increasing the resource information factors of high task-accomplishing rate and decreasing ones of low accomplishing rate would make load accomplishing rate approach the same value as quickly as possible, then in the later process of task assignment, the load balanced ability of the system was further improved. Experimental results show by improving ant algorithm, our system not only decreases many disadvantage of the traditional ant algorithm, but also like ants looking for food effectively distributes the complicated landform algorithm to many computers to process cooperatively and gains a satisfying search result.