Low Rank Approximation in Simulations of Quantum Algorithms [PDF]
Simulating quantum algorithms on classical computers is challenging when the system size, i.e., the number of qubits used in the quantum algorithm, is moderately large. However, some quantum algorithms and the corresponding quantum circuits can be simulated efficiently on a classical computer if the input quantum state is a low-rank tensor and all ...
arxiv
Ockham's Razor in Memetic Computing: Three Stage Optimal Memetic Exploration [PDF]
Memetic Computing is a subject in computer science which considers complex structures as the combination of simple agents, memes, whose evolutionary interactions lead to intelligent structures capable of problem-solving. This paper focuses on Memetic Computing optimization algorithms and proposes a counter-tendency approach for algorithmic design ...
arxiv +1 more source
Measuring the Programming Complexity of C and C++ using Halstead Metrics [PDF]
Computer algorithm is the core of computer science and important prerequisite of computer science professionals. However, its hard and abstract nature makes it difficult to understand.
Muhammad Shumail naveed
core +1 more source
Clinical commissioning of an adaptive radiotherapy platform: Results and recommendations
Abstract Online adaptive radiotherapy platforms present a unique challenge for commissioning as guidance is lacking and specialized adaptive equipment, such as deformable phantoms, are rare. We designed a novel adaptive commissioning process consisting of end‐to‐end tests using standard clinical resources.
Kelly Kisling+5 more
wiley +1 more source
Assessment of localized and randomized algorithms for electronic structure [PDF]
As electronic structure simulations continue to grow in size, the system-size scaling of computational costs increases in importance relative to cost prefactors. Presently, linear-scaling costs for three-dimensional systems are only attained by localized or randomized algorithms that have large cost prefactors in the difficult regime of low-temperature
arxiv +1 more source
Statistical process control to monitor use of a web‐based autoplanning tool
Abstract Purpose To investigate the use of statistical process control (SPC) for quality assurance of an integrated web‐based autoplanning tool, Radiation Planning Assistant (RPA). Methods Automatically generated plans were downloaded and imported into two treatment planning systems (TPSs), RayStation and Eclipse, in which they were recalculated using ...
Hunter Mehrens+5 more
wiley +1 more source
Treatment planning with a 2.5 MV photon beam for radiation therapy
Abstract Purpose The shallow depth of maximum dose and higher dose fall‐off gradient of a 2.5 MV beam along the central axis that is available for imaging on linear accelerators is investigated for treatment of shallow tumors and sparing the organs at risk (OARs) beyond it.
Navid Khaledi+5 more
wiley +1 more source
Impact of flexible noise control (FNC) image processing parameters on portable chest radiography
Abstract There is a lack of understanding in the performance of flexible noise control (FNC) processing, which is used in digital radiography on a scanner vendor and has four parameters each involving multiple options. The aim of this study was to investigate the impact of FNC on portable chest imaging. An anthropomorphic chest phantom was imaged using
Krystal M. Kirby+6 more
wiley +1 more source
Reusable and Sharable Learning Objects Supporting Students’ Learning of Data Structures in University Courses [PDF]
Data structures are a conceptually demanding topic which confronts many computer science students early in their course. The topic has a strong conceptual basis and often proves difficult for many to grasp.
Chansilp, K, Oliver, Ron
core +3 more sources
Structure identification methods for atomistic simulations of crystalline materials [PDF]
We discuss existing and new computational analysis techniques to classify local atomic arrangements in large-scale atomistic computer simulations of crystalline solids. This article includes a performance comparison of typical analysis algorithms such as Common Neighbor Analysis, Centrosymmetry Analysis, Bond Angle Analysis, Bond Order Analysis, and ...
arxiv +1 more source