NASA Astrophysics Data System (ADS)
Li, Linyi; Chen, Yun; Yu, Xin; Liu, Rui; Huang, Chang
2015-03-01
The study of flood inundation is significant to human life and social economy. Remote sensing technology has provided an effective way to study the spatial and temporal characteristics of inundation. Remotely sensed images with high temporal resolutions are widely used in mapping inundation. However, mixed pixels do exist due to their relatively low spatial resolutions. One of the most popular approaches to resolve this issue is sub-pixel mapping. In this paper, a novel discrete particle swarm optimization (DPSO) based sub-pixel flood inundation mapping (DPSO-SFIM) method is proposed to achieve an improved accuracy in mapping inundation at a sub-pixel scale. The evaluation criterion for sub-pixel inundation mapping is formulated. The DPSO-SFIM algorithm is developed, including particle discrete encoding, fitness function designing and swarm search strategy. The accuracy of DPSO-SFIM in mapping inundation at a sub-pixel scale was evaluated using Landsat ETM + images from study areas in Australia and China. The results show that DPSO-SFIM consistently outperformed the four traditional SFIM methods in these study areas. A sensitivity analysis of DPSO-SFIM was also carried out to evaluate its performances. It is hoped that the results of this study will enhance the application of medium-low spatial resolution images in inundation detection and mapping, and thereby support the ecological and environmental studies of river basins.
Intramolecular singlet-singlet energy transfer in antenna-substituted azoalkanes.
Pischel, Uwe; Huang, Fang; Nau, Werner M
2004-03-01
Two novel azoalkane bichromophores and related model compounds have been synthesised and photophysically characterised. Dimethylphenylsiloxy (DPSO) or dimethylnaphthylsiloxy (DNSO) serve as aromatic donor groups (antenna) and the azoalkane 2,3-diazabicyclo[2.2.2]oct-2-ene (DBO) as the acceptor. The UV spectral window of DBO (250-300 nm) allows selective excitation of the donor. Intramolecular singlet-singlet energy transfer to DBO is highly efficient and proceeds with quantum yields of 0.76 with DPSO and 0.99 with DNSO. The photophysical and spectral properties of the bichromophoric systems suggest that energy transfer occurs through diffusional approach of the donor and acceptor within a van der Waals contact at which the exchange mechanism is presumed to dominate. Furthermore, akin to the behaviour of electron-transfer systems in the Marcus inverted region, a rate of energy transfer 2.5 times slower was observed for the system with the more favourable energetics, i.e. singlet-singlet energy transfer from DPSO proceeded slower than from DNSO, although the process is more exergonic for DPSO (-142 kJ mol(-1) for DPSO versus-67 kJ mol(-1) for DNSO).
Wang, Shen-Tsu; Li, Meng-Hua
2014-01-01
When an enterprise has thousands of varieties in its inventory, the use of a single management method could not be a feasible approach. A better way to manage this problem would be to categorise inventory items into several clusters according to inventory decisions and to use different management methods for managing different clusters. The present study applies DPSO (dynamic particle swarm optimisation) to a problem of clustering of inventory items. Without the requirement of prior inventory knowledge, inventory items are automatically clustered into near optimal clustering number. The obtained clustering results should satisfy the inventory objective equation, which consists of different objectives such as total cost, backorder rate, demand relevance, and inventory turnover rate. This study integrates the above four objectives into a multiobjective equation, and inputs the actual inventory items of the enterprise into DPSO. In comparison with other clustering methods, the proposed method can consider different objectives and obtain an overall better solution to obtain better convergence results and inventory decisions.
Li, Meng-Hua
2014-01-01
When an enterprise has thousands of varieties in its inventory, the use of a single management method could not be a feasible approach. A better way to manage this problem would be to categorise inventory items into several clusters according to inventory decisions and to use different management methods for managing different clusters. The present study applies DPSO (dynamic particle swarm optimisation) to a problem of clustering of inventory items. Without the requirement of prior inventory knowledge, inventory items are automatically clustered into near optimal clustering number. The obtained clustering results should satisfy the inventory objective equation, which consists of different objectives such as total cost, backorder rate, demand relevance, and inventory turnover rate. This study integrates the above four objectives into a multiobjective equation, and inputs the actual inventory items of the enterprise into DPSO. In comparison with other clustering methods, the proposed method can consider different objectives and obtain an overall better solution to obtain better convergence results and inventory decisions. PMID:25197713
A Hybrid Search Algorithm for Swarm Robots Searching in an Unknown Environment
Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao
2014-01-01
This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency. PMID:25386855
A hybrid search algorithm for swarm robots searching in an unknown environment.
Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao
2014-01-01
This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency.
Zhang, Yan; Zou, Hong-Yan; Shi, Pei; Yang, Qin; Tang, Li-Juan; Jiang, Jian-Hui; Wu, Hai-Long; Yu, Ru-Qin
2016-01-01
Determination of benzo[a]pyrene (BaP) in cigarette smoke can be very important for the tobacco quality control and the assessment of its harm to human health. In this study, mid-infrared spectroscopy (MIR) coupled to chemometric algorithm (DPSO-WPT-PLS), which was based on the wavelet packet transform (WPT), discrete particle swarm optimization algorithm (DPSO) and partial least squares regression (PLS), was used to quantify harmful ingredient benzo[a]pyrene in the cigarette mainstream smoke with promising result. Furthermore, the proposed method provided better performance compared to several other chemometric models, i.e., PLS, radial basis function-based PLS (RBF-PLS), PLS with stepwise regression variable selection (Stepwise-PLS) as well as WPT-PLS with informative wavelet coefficients selected by correlation coefficient test (rtest-WPT-PLS). It can be expected that the proposed strategy could become a new effective, rapid quantitative analysis technique in analyzing the harmful ingredient BaP in cigarette mainstream smoke. Copyright © 2015 Elsevier B.V. All rights reserved.
Guo, Wenzhong; Hong, Wei; Zhang, Bin; Chen, Yuzhong; Xiong, Naixue
2014-01-01
Mobile security is one of the most fundamental problems in Wireless Sensor Networks (WSNs). The data transmission path will be compromised for some disabled nodes. To construct a secure and reliable network, designing an adaptive route strategy which optimizes energy consumption and network lifetime of the aggregation cost is of great importance. In this paper, we address the reliable data aggregation route problem for WSNs. Firstly, to ensure nodes work properly, we propose a data aggregation route algorithm which improves the energy efficiency in the WSN. The construction process achieved through discrete particle swarm optimization (DPSO) saves node energy costs. Then, to balance the network load and establish a reliable network, an adaptive route algorithm with the minimal energy and the maximum lifetime is proposed. Since it is a non-linear constrained multi-objective optimization problem, in this paper we propose a DPSO with the multi-objective fitness function combined with the phenotype sharing function and penalty function to find available routes. Experimental results show that compared with other tree routing algorithms our algorithm can effectively reduce energy consumption and trade off energy consumption and network lifetime. PMID:25215944
Xu, Jingjing; Yang, Wei; Zhang, Linyuan; Han, Ruisong; Shao, Xiaotao
2015-01-01
In this paper, a wireless sensor network (WSN) technology adapted to underground channel conditions is developed, which has important theoretical and practical value for safety monitoring in underground coal mines. According to the characteristics that the space, time and frequency resources of underground tunnel are open, it is proposed to constitute wireless sensor nodes based on multicarrier code division multiple access (MC-CDMA) to make full use of these resources. To improve the wireless transmission performance of source sensor nodes, it is also proposed to utilize cooperative sensors with good channel conditions from the sink node to assist source sensors with poor channel conditions. Moreover, the total power of the source sensor and its cooperative sensors is allocated on the basis of their channel conditions to increase the energy efficiency of the WSN. To solve the problem that multiple access interference (MAI) arises when multiple source sensors transmit monitoring information simultaneously, a kind of multi-sensor detection (MSD) algorithm with particle swarm optimization (PSO), namely D-PSO, is proposed for the time-frequency coded cooperative MC-CDMA WSN. Simulation results show that the average bit error rate (BER) performance of the proposed WSN in an underground coal mine is improved significantly by using wireless sensor nodes based on MC-CDMA, adopting time-frequency coded cooperative transmission and D-PSO algorithm with particle swarm optimization. PMID:26343660
Xu, Jingjing; Yang, Wei; Zhang, Linyuan; Han, Ruisong; Shao, Xiaotao
2015-08-27
In this paper, a wireless sensor network (WSN) technology adapted to underground channel conditions is developed, which has important theoretical and practical value for safety monitoring in underground coal mines. According to the characteristics that the space, time and frequency resources of underground tunnel are open, it is proposed to constitute wireless sensor nodes based on multicarrier code division multiple access (MC-CDMA) to make full use of these resources. To improve the wireless transmission performance of source sensor nodes, it is also proposed to utilize cooperative sensors with good channel conditions from the sink node to assist source sensors with poor channel conditions. Moreover, the total power of the source sensor and its cooperative sensors is allocated on the basis of their channel conditions to increase the energy efficiency of the WSN. To solve the problem that multiple access interference (MAI) arises when multiple source sensors transmit monitoring information simultaneously, a kind of multi-sensor detection (MSD) algorithm with particle swarm optimization (PSO), namely D-PSO, is proposed for the time-frequency coded cooperative MC-CDMA WSN. Simulation results show that the average bit error rate (BER) performance of the proposed WSN in an underground coal mine is improved significantly by using wireless sensor nodes based on MC-CDMA, adopting time-frequency coded cooperative transmission and D-PSO algorithm with particle swarm optimization.
Effect of sulfoxides on the thermal denaturation of hen lysozyme: A calorimetric and Raman study
NASA Astrophysics Data System (ADS)
Torreggiani, A.; Di Foggia, M.; Manco, I.; De Maio, A.; Markarian, S. A.; Bonora, S.
2008-11-01
A multidisciplinary study of the thermal denaturation of lysozyme in the presence of three sulfoxides with different length in hydrocarbon chain (DMSO, DESO, and DPSO) was carried out by means of DSC, Raman spectroscopy, and SDS-PAGE techniques. In particular, the Td and Δ H values obtained from the calorimetric measurements showed that lysozyme is partially unfolded by sulfoxides but most of the conformation holds native state. The sulfoxide denaturing ability increases in the order DPSO > DESO > DMSO. Moreover, only DMSO and DESO have a real effect in preventing the heat-induced inactivation of the protein and their maximum heat-protective ability is reached when the DMSO and DESO amount is ⩾25% w/w. The sulfoxide ability to act as effective protective agents against the heat-induced inactivation was confirmed by the protein analysis. The enzymatic activity, as well as the SDS-PAGE analysis, suggested that DESO, having a low hydrophobic character and a great ability to stabilise the three-dimensional water structure, is the most heat-protective sulfoxide. An accurate evaluation of the heat-induced conformational changes of the lysozyme structure before and after sulfoxide addition was obtained by the analysis of the Raman spectra. The addition of DMSO or DESO in low concentration resulted to sensitively decrease the heat-induced structural modifications of the protein.
Tidal Turbine Array Optimization Based on the Discrete Particle Swarm Algorithm
NASA Astrophysics Data System (ADS)
Wu, Guo-wei; Wu, He; Wang, Xiao-yong; Zhou, Qing-wei; Liu, Xiao-man
2018-06-01
In consideration of the resource wasted by unreasonable layout scheme of tidal current turbines, which would influence the ratio of cost and power output, particle swarm optimization algorithm is introduced and improved in the paper. In order to solve the problem of optimal array of tidal turbines, the discrete particle swarm optimization (DPSO) algorithm has been performed by re-defining the updating strategies of particles' velocity and position. This paper analyzes the optimization problem of micrositing of tidal current turbines by adjusting each turbine's position, where the maximum value of total electric power is obtained at the maximum speed in the flood tide and ebb tide. Firstly, the best installed turbine number is generated by maximizing the output energy in the given tidal farm by the Farm/Flux and empirical method. Secondly, considering the wake effect, the reasonable distance between turbines, and the tidal velocities influencing factors in the tidal farm, Jensen wake model and elliptic distribution model are selected for the turbines' total generating capacity calculation at the maximum speed in the flood tide and ebb tide. Finally, the total generating capacity, regarded as objective function, is calculated in the final simulation, thus the DPSO could guide the individuals to the feasible area and optimal position. The results have been concluded that the optimization algorithm, which increased 6.19% more recourse output than experience method, can be thought as a good tool for engineering design of tidal energy demonstration.
Zamli, Kamal Z.; Din, Fakhrud; Bures, Miroslav
2018-01-01
The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions to perform local and global searches (hence the name sine-cosine), the SCA introduces several random and adaptive parameters to facilitate the search process. Although it shows promising results, the search process of the SCA is vulnerable to local minima/maxima due to the adoption of a fixed switch probability and the bounded magnitude of the sine and cosine functions (from -1 to 1). In this paper, we propose a new hybrid Q-learning sine-cosine- based strategy, called the Q-learning sine-cosine algorithm (QLSCA). Within the QLSCA, we eliminate the switching probability. Instead, we rely on the Q-learning algorithm (based on the penalty and reward mechanism) to dynamically identify the best operation during runtime. Additionally, we integrate two new operations (Lévy flight motion and crossover) into the QLSCA to facilitate jumping out of local minima/maxima and enhance the solution diversity. To assess its performance, we adopt the QLSCA for the combinatorial test suite minimization problem. Experimental results reveal that the QLSCA is statistically superior with regard to test suite size reduction compared to recent state-of-the-art strategies, including the original SCA, the particle swarm test generator (PSTG), adaptive particle swarm optimization (APSO) and the cuckoo search strategy (CS) at the 95% confidence level. However, concerning the comparison with discrete particle swarm optimization (DPSO), there is no significant difference in performance at the 95% confidence level. On a positive note, the QLSCA statistically outperforms the DPSO in certain configurations at the 90% confidence level. PMID:29771918
Zamli, Kamal Z; Din, Fakhrud; Ahmed, Bestoun S; Bures, Miroslav
2018-01-01
The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions to perform local and global searches (hence the name sine-cosine), the SCA introduces several random and adaptive parameters to facilitate the search process. Although it shows promising results, the search process of the SCA is vulnerable to local minima/maxima due to the adoption of a fixed switch probability and the bounded magnitude of the sine and cosine functions (from -1 to 1). In this paper, we propose a new hybrid Q-learning sine-cosine- based strategy, called the Q-learning sine-cosine algorithm (QLSCA). Within the QLSCA, we eliminate the switching probability. Instead, we rely on the Q-learning algorithm (based on the penalty and reward mechanism) to dynamically identify the best operation during runtime. Additionally, we integrate two new operations (Lévy flight motion and crossover) into the QLSCA to facilitate jumping out of local minima/maxima and enhance the solution diversity. To assess its performance, we adopt the QLSCA for the combinatorial test suite minimization problem. Experimental results reveal that the QLSCA is statistically superior with regard to test suite size reduction compared to recent state-of-the-art strategies, including the original SCA, the particle swarm test generator (PSTG), adaptive particle swarm optimization (APSO) and the cuckoo search strategy (CS) at the 95% confidence level. However, concerning the comparison with discrete particle swarm optimization (DPSO), there is no significant difference in performance at the 95% confidence level. On a positive note, the QLSCA statistically outperforms the DPSO in certain configurations at the 90% confidence level.
Packets Distributing Evolutionary Algorithm Based on PSO for Ad Hoc Network
NASA Astrophysics Data System (ADS)
Xu, Xiao-Feng
2018-03-01
Wireless communication network has such features as limited bandwidth, changeful channel and dynamic topology, etc. Ad hoc network has lots of difficulties in accessing control, bandwidth distribution, resource assign and congestion control. Therefore, a wireless packets distributing Evolutionary algorithm based on PSO (DPSO)for Ad Hoc Network is proposed. Firstly, parameters impact on performance of network are analyzed and researched to obtain network performance effective function. Secondly, the improved PSO Evolutionary Algorithm is used to solve the optimization problem from local to global in the process of network packets distributing. The simulation results show that the algorithm can ensure fairness and timeliness of network transmission, as well as improve ad hoc network resource integrated utilization efficiency.
Lingen, Verena; Lüning, Anna; Krest, Alexander; Deacon, Glen B; Schur, Julia; Ott, Ingo; Pantenburg, Ingo; Meyer, Gerd; Klein, Axel
2016-12-01
Reaction of various sulphur ligands L (SEt - , SPh - , SC 6 F 4 H-4 - , SEt 2 , StBu 2 , SnBu 2 , DMSO, DPSO) with the precursors [(COD)M(R)Cl] (COD=1,5-cyclooctadiene, M=Pd or Pt; R=methyl (Me) or benzyl (Bn); DMSO=dimethyl sulfoxide; DPSO=diphenyl sulfoxide) allowed isolation and characterisation of mononuclear neutral (n=0) or cationic (n=1) complexes [(COD)Pt(R)(L)] n+ . Reaction of l-cysteine (HCys) with [(COD)Pt(Me)Cl] under similar conditions gave the binuclear cationic complex in [{(COD)Pt(Me)} 2 (μ-Cys)]Cl. Detailed NMR spectroscopy and single crystal X-ray diffraction in the case of [(COD)Pt(Me)(SEt 2 )][SbF 6 ] and [(COD)Pt(Me)(DMSO)][SbF 6 ] reveal markedly labilised Pt-S bonds as a consequence of the highly covalent Pt-C bonds of the R coligands in these organometallic species. Cationic charge (n=1) seems to lower the Pt-S bond strength further. Consequently, most of these complexes are not stable long-term in aqueous DMF (N,N-dimethylformamide) solutions. This made the evaluation of their antiproliferative properties towards HT-29 colon carcinoma and MCF-7 breast adenocarcinoma cell lines impossible. Only the two complexes [(COD)Pt(R)(SC 6 F 4 H-4)] with R=Me or SC 6 F 4 H-4 coligands could be tested with the R=Me complex showing promising activity (in the range of cisplatin), while the R=SC 6 F 4 H-4 derivative is largely inactive, as were the phosphane complexes [(dppe)Pt(SC 6 F 4 H-4) 2 ] (dppe=1,2-bis(diphenylphosphino)ethane), cis-[(PPh 3 ) 2 Pt(SC 6 F 4 H-4) 2 ] and cis-[(PPh 3 ) 2 PtCl 2 ] which were tested for comparison. In turn, our findings might pave the way to new Pt anti-cancer drugs with largely reduced unwanted depletion of incorporated drugs and reduced side-effects from binding to S-containing biomolecules. Copyright © 2016 Elsevier Inc. All rights reserved.
Hybrid optimal online-overnight charging coordination of plug-in electric vehicles in smart grid
NASA Astrophysics Data System (ADS)
Masoum, Mohammad A. S.; Nabavi, Seyed M. H.
2016-10-01
Optimal coordinated charging of plugged-in electric vehicles (PEVs) in smart grid (SG) can be beneficial for both consumers and utilities. This paper proposes a hybrid optimal online followed by overnight charging coordination of high and low priority PEVs using discrete particle swarm optimization (DPSO) that considers the benefits of both consumers and electric utilities. Objective functions are online minimization of total cost (associated with grid losses and energy generation) and overnight valley filling through minimization of the total load levels. The constraints include substation transformer loading, node voltage regulations and the requested final battery state of charge levels (SOCreq). The main challenge is optimal selection of the overnight starting time (toptimal-overnight,start) to guarantee charging of all vehicle batteries to the SOCreq levels before the requested plug-out times (treq) which is done by simultaneously solving the online and overnight objective functions. The online-overnight PEV coordination approach is implemented on a 449-node SG; results are compared for uncoordinated and coordinated battery charging as well as a modified strategy using cost minimizations for both online and overnight coordination. The impact of toptimal-overnight,start on performance of the proposed PEV coordination is investigated.
Design and Analysis of Self-Adapted Task Scheduling Strategies in Wireless Sensor Networks
Guo, Wenzhong; Xiong, Naixue; Chao, Han-Chieh; Hussain, Sajid; Chen, Guolong
2011-01-01
In a wireless sensor network (WSN), the usage of resources is usually highly related to the execution of tasks which consume a certain amount of computing and communication bandwidth. Parallel processing among sensors is a promising solution to provide the demanded computation capacity in WSNs. Task allocation and scheduling is a typical problem in the area of high performance computing. Although task allocation and scheduling in wired processor networks has been well studied in the past, their counterparts for WSNs remain largely unexplored. Existing traditional high performance computing solutions cannot be directly implemented in WSNs due to the limitations of WSNs such as limited resource availability and the shared communication medium. In this paper, a self-adapted task scheduling strategy for WSNs is presented. First, a multi-agent-based architecture for WSNs is proposed and a mathematical model of dynamic alliance is constructed for the task allocation problem. Then an effective discrete particle swarm optimization (PSO) algorithm for the dynamic alliance (DPSO-DA) with a well-designed particle position code and fitness function is proposed. A mutation operator which can effectively improve the algorithm’s ability of global search and population diversity is also introduced in this algorithm. Finally, the simulation results show that the proposed solution can achieve significant better performance than other algorithms. PMID:22163971
NASA Astrophysics Data System (ADS)
Niyama, E.; Brito, H. F.; Cremona, M.; Teotonio, E. E. S.; Reyes, R.; Brito, G. E. S.; Felinto, M. C. F. C.
2005-09-01
In this paper the synthesis, characterization and photoluminescent behavior of the [RE(DBM) 3L 2] complexes (RE = Gd and Eu) with a variety of sulfoxide ligands; L = benzyl sulfoxide (DBSO), methyl sulfoxide (DMSO), phenyl sulfoxide (DPSO) and p-tolyl sulfoxide (PTSO) have been investigated in solid state. The emission spectra of the Eu 3+-β-diketonate complexes show characteristics narrow bands arising from the 5D 0 → 7F J ( J = 0-4) transitions, which are split according to the selection rule for C n, C nv or C s site symmetries. The experimental Judd-Ofelt intensity parameters ( Ω2 and Ω4), radiative ( Arad) and non-radiative ( Anrad) decay rates, and R02 for the europium complexes have been determined and compared. The highest value of Ω2 (61.9 × 10 -20 cm 2) was obtained to the complex with PTSO ligand, indicating that Eu 3+ ion is in the highly polarizable chemical environment. The higher values of the experimental quantum yield ( q) and emission quantum efficiency of the emitter 5D 0 level ( η) for the Eu-complexes with DMSO, DBSO and PTSO sulfoxides suggest that these complexes are promising Light Conversion Molecular Devices (LCMDs). The lower value of quantum yield ( q = 1%), for the hydrated complex [Eu(DBM) 3(H 2O)], indicates that the luminescence quenching occurs via multiphonon relaxation by coupling with the OH-oscillators from water molecule coordinated to rare earth ion. The pure red emission of the Eu-complexes has been confirmed by ( x, y) color coordinates.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Modiri, A; Gu, X; Hagan, A
2015-06-15
Purpose: Patients presenting with large and/or centrally-located lung tumors are currently considered ineligible for highly potent regimens such as SBRT due to concerns of toxicity to normal tissues and organs-at-risk (OARs). We present a particle swarm optimization (PSO)-based 4D planning technique, designed for MLC tracking delivery, that exploits the temporal dimension as an additional degree of freedom to significantly improve OAR-sparing and reduce toxicity to levels clinically considered as acceptable for SBRT administration. Methods: Two early-stage SBRT-ineligible NSCLC patients were considered, presenting with tumors of maximum dimensions of 7.4cm (central-right lobe; 1.5cm motion) and 11.9cm (upper-right lobe; 1cm motion). Inmore » each case, the target and normal structures were manually contoured on each of the ten 4DCT phases. Corresponding ten initial 3D-conformal plans (Pt#1: 7-beams; Pt#2: 9-beams) were generated using the Eclipse planning system. Using 4D-PSO, fluence weights were optimized over all beams and all phases (70 and 90 apertures for Pt1&2, respectively). Doses to normal tissues and OARs were compared with clinicallyestablished lung SBRT guidelines based on RTOG-0236. Results: The PSO-based 4D SBRT plan yielded tumor coverage and dose—sparing for parallel and serial OARs within the SBRT guidelines for both patients. The dose-sparing compared to the clinically-delivered conventionallyfractionated plan for Patient 1 (Patient 2) was: heart Dmean = 11% (33%); lung V20 = 16% (21%); lung Dmean = 7% (20%); spinal cord Dmax = 5% (16%); spinal cord Dmean = 7% (33%); esophagus Dmax = 0% (18%). Conclusion: Truly 4D planning can significantly reduce dose to normal tissues and OARs. Such sparing opens up the possibility of using highly potent and effective regimens such as lung SBRT for patients who were conventionally considered SBRT non-eligible. Given the large, non-convex solution space, PSO represents an attractive, parallelizable tool to successfully achieve a globally optimal solution for this problem. This work was supported through funding from the National Institutes of Health and Varian Medical Systems.« less
DOE Office of Scientific and Technical Information (OSTI.GOV)
Modiri, A; Hagan, A; Gu, X
Purpose 4D-IMRT planning, combined with dynamic MLC tracking delivery, utilizes the temporal dimension as an additional degree of freedom to achieve improved OAR-sparing. The computational complexity for such optimization increases exponentially with increase in dimensionality. In order to accomplish this task in a clinically-feasible time frame, we present an initial implementation of GPU-based 4D-IMRT planning based on particle swarm optimization (PSO). Methods The target and normal structures were manually contoured on ten phases of a 4DCT scan of a NSCLC patient with a 54cm3 right-lower-lobe tumor (1.5cm motion). Corresponding ten 3D-IMRT plans were created in the Eclipse treatment planning systemmore » (Ver-13.6). A vendor-provided scripting interface was used to export 3D-dose matrices corresponding to each control point (10 phases × 9 beams × 166 control points = 14,940), which served as input to PSO. The optimization task was to iteratively adjust the weights of each control point and scale the corresponding dose matrices. In order to handle the large amount of data in GPU memory, dose matrices were sparsified and placed in contiguous memory blocks with the 14,940 weight-variables. PSO was implemented on CPU (dual-Xeon, 3.1GHz) and GPU (dual-K20 Tesla, 2496 cores, 3.52Tflops, each) platforms. NiftyReg, an open-source deformable image registration package, was used to calculate the summed dose. Results The 4D-PSO plan yielded PTV coverage comparable to the clinical ITV-based plan and significantly higher OAR-sparing, as follows: lung Dmean=33%; lung V20=27%; spinal cord Dmax=26%; esophagus Dmax=42%; heart Dmax=0%; heart Dmean=47%. The GPU-PSO processing time for 14940 variables and 7 PSO-particles was 41% that of CPU-PSO (199 vs. 488 minutes). Conclusion Truly 4D-IMRT planning can yield significant OAR dose-sparing while preserving PTV coverage. The corresponding optimization problem is large-scale, non-convex and computationally rigorous. Our initial results indicate that GPU-based PSO with further software optimization can make such planning clinically feasible. This work was supported through funding from the National Institutes of Health and Varian Medical Systems.« less
Volume and fat infiltration of spino-pelvic musculature in adults with spinal deformity
Moal, Bertrand; Bronsard, Nicolas; Raya, José G; Vital, Jean Marc; Schwab, Frank; Skalli, Wafa; Lafage, Virginie
2015-01-01
AIM: To investigate fat infiltration and volume of spino-pelvic muscles in adults spinal deformity (ASD) with magnetic resonance imaging (MRI) and 3D reconstructions. METHODS: Nineteen female ASD patients (mean age 60 ± 13) were included prospectively and consecutively and had T1-weighted Turbo Spin Echo sequence MRIs with Dixon method from the proximal tibia up to T12 vertebra. The Dixon method permitted to evaluate the proportion of fat inside each muscle (fat-water ratio). In order to investigate the accuracy of the Dixon method for estimating fat vs water, the same MRI acquisition was performed on phantoms of four vials composed of different proportion of fat vs water. With Muscl’X software, 3D reconstructions of 17 muscles or group of muscles were obtained identifying the muscle’s contour on a limited number of axial images [Deformation of parametric specific objects (DPSO) Method]. Musclar volume (Vmuscle), infiltrated fat volume (Vfat) and percentage of fat infiltration [Pfat, calculated as follow: Pfat = 100 × (Vfat/Vmuscle)] were characterized by extensor or flexor function respectively for the spine, hip and knee and theirs relationship with demographic data were investigated. RESULTS: Phantom acquisition demonstrated a non linear relation between Dixon fat-water ratio and the real fat-water ratio. In order to correct the Dixon fat-water ratio, the non linear relation was approximated with a polynomial function of degree three using the phantom acquisition. On average, Pfat was 13.3% ± 5.3%. Muscles from the spinal extensor group had a Pfat significantly greater than the other muscles groups, and the largest variability (Pfat = 31.9% ± 13.8%, P < 0.001). Muscles from the hip extensor group ranked 2nd in terms of Pfat (14% ± 8%), and were significantly greater than those of the knee extensor (P = 0.030). Muscles from the knee extensor group demonstrated the least Pfat (12% ± 8%). They were also the only group with a significant correlation between Vmuscle and Pfat (r = -0.741, P < 0.001), however this correlation was lacking in the other groups. No correlation was found between the Vmuscle total and age or body mass index. Except for the spine flexors, Pfat was correlated with age. Vmuscle and Vfat distributions demonstrated that muscular degeneration impacted the spinal extensors most. CONCLUSION: Mechanisms of fat infiltration are not similar among the muscle groups. Degeneration impacted the spinal and hip extensors most, key muscles of the sagittal alignment. PMID:26495250