An automated treatment planning strategy for highly noncoplanar radiotherapy arc trajectories

Radiation therapy is a technology-driven cancer treatment modality that has experienced significant advances over the last decades, due to multidisciplinary contributions that include engineering and computing. Recent technological developments allow the use of noncoplanar volumetric modulated arc therapy (VMAT), one of the most recent photon treatment techniques, in clinical practice. In this work, an automated noncoplanar arc trajectory optimization framework designed in two modular phases is presented. First, a noncoplanar beam angle optimization algorithm is used to obtain a set of noncoplanar irradiation directions. Then, anchored in these directions, an optimization strategy is proposed to compute an optimal arc trajectory. The computational experiments considered a pool of twelve difficult head-and-neck tumor cases. It was possible to observe that, for some of these cases, the optimized noncoplanar arc trajectories led to significant treatment planning quality improvements, when compared with coplanar VMAT treatment plans. Although these experiments were done in a research environment treatment planning software (matRad), the conclusions can be of interest for a clinical setting: automated procedures can simplify the current treatment workflow, produce high-quality treatment plans, making better use of human resources and allowing for unbiased comparisons between different treatment techniques.     

The Impact of PbF2-Based Glasses on Radiation Shielding and Mechanical Concepts: An Extensive Theoretical and Monte Carlo Simulation Study

Journal of Inorganic and Organometallic Polymers and Materials - This work aimed to investigate the impact of Lead-fluoride based glasses via theoretical and simulation techniques on mechanical and...     

Evaluation of Intellectual Property Objects in the Nanoindustry Field

Russian Microelectronics - The recently developed nanomaterials and their production technologies as intellectual property objects (IPOs) are considered. The role of the informational-analytical...     

A single-phase algorithm for mining high utility itemsets using compressed tree structures

Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+ algorithms.     

Calculation and Experimental Determination of the Neutronics Characteristics of the IRT-T Research Reactor

Atomic Energy - The results of calculations and experimental determination of the neutronics characteristics of the IRT-T research reactor are presented. The IRT-T reactor is a pool reactor with...     

Energy Efficiency Trade-Off Between Duty-Cycling and Wake-Up Radio Techniques in IoT Networks

Wireless Personal Communications - For robust monitoring, control and proper energy management of renewable energy sources (RES), wireless sensing networks (WSNs) are proved to be a vital solution....     

On the capacity of the state‐dependent interference relay channel

This paper considers the state‐dependent interference relay channel (SIRC) in which one of the two users may operate as a secondary user and the relay has a noncausal access to the signals from both users. For discrete memoryless SIRC, we first establish the achievable rate region by carefully merging Han‐Kobayashi rate splitting encoding technique, superposition encoding, and Gelfand‐Pinsker encoding technique. Then, based on the achievable rate region that we derive, the capacity of the SIRC is established in many different scenarios including (a) the weak interference regime, (b) the strong interference regime, and (c) the very strong interference regime. This means that our capacity results contain all available known results in the literature. Next, the achievable rate region and the associated capacity results are also evaluated in the case of additive Gaussian noise. Additionally, many numerical examples are investigated to show the value of our theoretical derivations.     

The generalized discrete ‐centroid problem

The ‐centroid problem or leader–follower problem is generalized considering different customer choice rules where a customer may use facilities belonging to different firms, if the difference in travel distance (or time) is small enough. Assuming essential goods, some particular customer choice rules are analyzed. Linear programming formulations for the generalized ‐medianoid and ‐centroid problems are presented and an exact solution approach is applied. Some computational examples are included.