Fakultät Informatik und Mathematik
Refine
Year of publication
- 2023 (7) (remove)
Document Type
Has Fulltext
- yes (7) (remove)
Is part of the Bibliography
- no (7)
Keywords
- Adoption (1)
- Breast imaging (1)
- Breast reconstruction surgery (1)
- Case study (1)
- Delphi Study (1)
- Digitalisierungsgrad (1)
- Driver (1)
- Hardware (1)
- IT-Management (1)
- Informations systems (1)
Institute
- Fakultät Informatik und Mathematik (7)
- Regensburg Center of Health Sciences and Technology - RCHST (2)
- Regensburg Medical Image Computing (ReMIC) (2)
- Regensburg Strategic IT Management (ReSITM) (2)
- Fakultät Angewandte Sozial- und Gesundheitswissenschaften (1)
- Labor Parallele und Verteilte Systeme (1)
- Labor für Digitalisierung (LFD) (1)
- Regensburg Center for Artificial Intelligence - RCAI (1)
- Regensburg Center of Biomedical Engineering - RCBE (1)
Begutachtungsstatus
- peer-reviewed (7) (remove)
Although adopting Low Code Development Platforms (LCDPs) promises significant efficiency and effectiveness improvements for application development, its adoption still needs further empirical research. This paper uses a combinatorial approach to research LCDP adoption and presents the results of a multiple mini case study with 36 cases on LCDP adoption. A combination of the Socio-Technical Systems theory and the Technology-Organisational-Environment model is used as a theoretical lens. In this paper, we show that LCDP adoption is a multifaceted phenomenon and identify three archetypes for LCDP adoption (i.e., IT Resource Shortage Mitigators, Application Development Democratisers, and Synergy Realisers) and one archetype for LCDP non-adoption (i.e., Intricacy Adversaries). Each archetype can be interpreted as an individual path towards LCDP (non-)adoption. Based on these archetypes, we derive seven starting points for practitioners to adopt LCDPs in work systems. Moreover, by using the theoretical lenses, the paper shows that for an LCDP adoption to occur, an optimisation of the social and technical sub-systems is required.
In the realm of parallel computing, optimization plays a pivotal role in achieving efficient and scalable solutions. In this work, we present the parallelization of a hybrid genetic search for solving the Capacitated Vehicle Routing Problem with Pickup and Delivery (CVRPPD).It leverages the synergy between genetic algorithms and parallel computing to address the complex optimization problem. This hybrid algorithm combines a customized version of local search with a genetic algorithm to compute an effective solution. Our implementation makes use of the Message Passing Interface (MPI) for data distribution and parallel execution. In addition, we run multi-threaded processes on NVIDIA graphical processors using the CUDA technology, which further increases the computation speed and consequently minimizes the runtime. Parallelization also allows the best-improvement strategy to be used instead of the rst-improvement strategy while maintaining the same runtime. We store the resulting routes in a bus route database which we created as the basis of an extensive library of optimal routes for our specifc use case of optimizing bus routes in a rural area. The experimental results on real road data show that the parallel implementation of the Hybrid Genetic Search (HGS) achieves significant improvements in runtime over the sequential implementation above a certain problem size. We believe that our implementation of the parallel hybrid genetic search method can have a great in influence on optimization strategies in parallel computing and can also be applied to other subproblems of the VRP.
Ziel der Studie:
Ziel der Studie ist die Messung des Stands der Digitalisierung und die mit einer Anbindung an die Telematikinfrastruktur verbundenen Chancen und Herausforderungen für Rehabilitationseinrichtungen.
Methodik:
Teilstandardisierte Online-Befragung bei Trägern von Rehabilitationseinrichtungen in Bayern (n=33). Der Fragebogen mit 36 Fragen beinhaltet eine leicht veränderte Skala auf Basis des „Electronic Medical Record Adoption Model (EMRAM)“.
Ergebnisse:
Der Digitalisierungsgrad wurde in 70 Prozent der Rehabilitationseinrichtungen mit Stufe 0 angegeben (Stufenmodell bis 7). Die Übermittlung patientenbezogener Daten (Eingang und Ausgang) erfolgt häufig analog, wohingegen die Verarbeitung innerhalb der Einrichtung in vielen Fällen bereits überwiegend digital ist. Beim Anschluss an die Telematikinfrastruktur wird hoher Aufwand bei der Installation, aber auch der Schulung des Personals und der Anpassung der Arbeitsorganisation gesehen.
Schlussfolgerung:
Durch Änderung der gesetzlich-finanziellen Lage in Deutschland eröffnen sich für Rehabilitationseinrichtungen neue Möglichkeiten einer verstärkten Digitalisierung. Hürden hängen mit Anforderungen an IT-Sicherheit, Schulung des Personals und sowie dem ebenfalls geringen Digitalisierungsstand bei Krankenhäusern und Ärzt*innen sowie Patient*innen zusammen, die eine digitale Datenübermittlung erschweren.
Semantic segmentation is an essential task in medical imaging research. Many powerful deep-learning-based approaches can be employed for this problem, but they are dependent on the availability of an expansive labeled dataset. In this work, we augment such supervised segmentation models to be suitable for learning from unlabeled data. Our semi-supervised approach, termed Error-Correcting Mean-Teacher, uses an exponential moving average model like the original Mean Teacher but introduces our new paradigm of error correction. The original segmentation network is augmented to handle this secondary correction task. Both tasks build upon the core feature extraction layers of the model. For the correction task, features detected in the input image are fused with features detected in the predicted segmentation and further processed with task-specific decoder layers. The combination of image and segmentation features allows the model to correct present mistakes in the given input pair. The correction task is trained jointly on the labeled data. On unlabeled data, the exponential moving average of the original network corrects the student’s prediction. The combined outputs of the students’ prediction with the teachers’ correction form the basis for the semi-supervised update. We evaluate our method with the 2017 and 2018 Robotic Scene Segmentation data, the ISIC 2017 and the BraTS 2020 Challenges, a proprietary Endoscopic Submucosal Dissection dataset, Cityscapes, and Pascal VOC 2012. Additionally, we analyze the impact of the individual components and examine the behavior when the amount of labeled data varies, with experiments performed on two distinct segmentation architectures. Our method shows improvements in terms of the mean Intersection over Union over the supervised baseline and competing methods. Code is available at https://github.com/CloneRob/ECMT.
We present the Regensburg Breast Shape Model (RBSM)—a 3D statistical shape model of the female breast built from 110 breast scans acquired in a standing position, and the first publicly available. Together with the model, a fully automated, pairwise surface registration pipeline used to establish dense correspondence among 3D breast scans is introduced. Our method is computationally efficient and requires only four landmarks to guide the registration process. A major challenge when modeling female breasts from surface-only 3D breast scans is the non-separability of breast and thorax. In order to weaken the strong coupling between breast and surrounding areas, we propose to minimize the variance outside the breast region as much as possible. To achieve this goal, a novel concept called breast probability masks (BPMs) is introduced. A BPM assigns probabilities to each point of a 3D breast scan, telling how likely it is that a particular point belongs to the breast area. During registration, we use BPMs to align the template to the target as accurately as possible inside the breast region and only roughly outside. This simple yet effective strategy significantly reduces the unwanted variance outside the breast region, leading to better statistical shape models in which breast shapes are quite well decoupled from the thorax. The RBSM is thus able to produce a variety of different breast shapes as independently as possible from the shape of the thorax. Our systematic experimental evaluation reveals a generalization ability of 0.17 mm and a specificity of 2.8 mm. To underline the expressiveness of the proposed model, we finally demonstrate in two showcase applications how the RBSM can be used for surgical outcome simulation and the prediction of a missing breast from the remaining one. Our model is available at https://www.rbsm.re-mic.de/.
Organizations are under increasing pressure to develop applications within budget and time at high quality. Therefore, multiple organizations adopt Low Code Development Platforms (LCDP) to develop applications faster and cheaper compared to traditional application development. However, current research on LCDP adoption lacks empirical grounding as well as a deeper understanding of the importance of adoption drivers and inhibitors. We conducted semi-structured interviews and a Delphi study with seventeen experts to address these gaps. As a result, we identified twelve drivers and nineteen inhibitors for adopting LCDPs. We show that the experts have a consensus on the most and the least important drivers and inhibitors for LCDP adoption. Yet, the ranking of the drivers and inhibitors between the most and least important is highly context dependent. For some drivers and inhibitors, the experts’ ranking is similar to academic literature, whereas, for others, it differs. In conclusion, the study at hand empirically validates drivers and inhibitors for LCDP adoption, adds six new drivers and six new inhibitors to the body of knowledge, and analyses the importance of these factors.
The prospect of achieving computational speedups by exploiting quantum phenomena makes the use of quantum processing units (QPUs) attractive for many algorithmic database problems. Query optimisation, which concerns problems that typically need to explore large search spaces, seems like an ideal match for the known quantum algorithms. We present the first quantum implementation of join ordering, which is one of the most investigated and fundamental query optimisation problems, based on a reformulation to quadratic binary unconstrained optimisation problems. We empirically characterise our method on two state-of-the-art approaches (gate-based quantum computing and quantum annealing), and identify speed-ups compared to the best know classical join ordering approaches for input sizes that can be processed with current quantum annealers. However, we also confirm that limits of early-stage technology are quickly reached.
Current QPUs are classified as noisy, intermediate scale quantum computers (NISQ), and are restricted by a variety of limitations that reduce their capabilities as compared to ideal future quantum computers, which prevents us from scaling up problem dimensions and reaching practical utility. To overcome these challenges, our formulation accounts for specific QPU properties and limitations, and allows us to trade between achievable solution quality and possible problem size.
In contrast to all prior work on quantum computing for query optimisation and database-related challenges, we go beyond currently available QPUs, and explicitly target the scalability limitations: Using insights gained from numerical simulations and our experimental analysis, we identify key criteria for co-designing QPUs to improve their usefulness for join ordering, and show how even relatively minor physical architectural improvements can result in substantial enhancements. Finally, we outline a path towards practical utility of custom-designed QPUs.