Results 41 to 50 of about 40,986 (266)

Statistical process control to monitor use of a web‐based autoplanning tool

open access: yesJournal of Applied Clinical Medical Physics, Volume 23, Issue 12, December 2022., 2022
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

From data Processing to Knowledge Processing: Working with Operational Schemas by Autopoietic Machines

open access: yesBig Data and Cognitive Computing, 2021
Knowledge processing is an important feature of intelligence in general and artificial intelligence in particular. To develop computing systems working with knowledge, it is necessary to elaborate the means of working with knowledge representations (as ...
Mark Burgin, Rao Mikkilineni
doaj   +1 more source

Cellular-automaton decoders for topological quantum memories [PDF]

open access: yesnpj Quantum Information, 2014
We introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton.
Michael Herold   +3 more
semanticscholar   +1 more source

Impact of flexible noise control (FNC) image processing parameters on portable chest radiography

open access: yesJournal of Applied Clinical Medical Physics, Volume 23, Issue 12, December 2022., 2022
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

Deterministic automata for extended regular expressions

open access: yesOpen Computer Science, 2017
In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement.
Syzdykov Mirzakhmet
doaj   +1 more source

MOBILE LEARNING: CONTEXT ADAPTATION AND SCENARIO APPROACH

open access: yesОткрытое образование (Москва), 2016
The paper proposes a model of an open architecture for component context-dependent systems of computer training to the needs of the software applications of intelligent learning environments and adaptive learning systems.
Vladimir V. Kureichik   +2 more
doaj   +1 more source

Experimental demonstration of quantum finite automaton

open access: yesnpj Quantum Information, 2019
In quantum information science, a major task is to find the quantum models that can outperform their classical counterparts. Automaton is a fundamental computing model that has wide applications in many fields.
Yuling Tian   +4 more
semanticscholar   +1 more source

Validation of pencil beam scanning proton therapy with multi‐leaf collimator calculated by a commercial Monte Carlo dose engine

open access: yesJournal of Applied Clinical Medical Physics, Volume 23, Issue 12, December 2022., 2022
Abstract This study aimed to evaluate the clinical beam commissioning results and lateral penumbra characteristics of our new pencil beam scanning (PBS) proton therapy using a multi‐leaf collimator (MLC) calculated by use of a commercial Monte Carlo dose engine.
Yuki Tominaga   +5 more
wiley   +1 more source

Universal Hypergraphic Automata Representation by Autonomous Input Symbols

open access: yesМоделирование и анализ информационных систем, 2018
Hypergraphic automata are automata with state sets and input symbol sets being hypergraphs which are invariant under actions of transition and output functions. Universally attracting objects of a category of hypergraphic automata are automata Atm(H1,H2).
Ekaterina Khvorostukhina   +1 more
doaj   +1 more source

Algorithms for Converting Finite Automata Corresponding to Infinite Iterative Trees

open access: yesСовременные информационные технологии и IT-образование, 2021
In this paper, we work with some different variants of finite automata, each of which corresponds to an infinite iterative tree constructed for some given morphism.
Mikhail Abramyan, Boris Melnikov
doaj   +1 more source

Home - About - Disclaimer - Privacy