Institut für Informatik und Computational Science
Refine
Year of publication
- 2022 (17) (remove)
Document Type
- Article (12)
- Doctoral Thesis (2)
- Postprint (2)
- Master's Thesis (1)
Is part of the Bibliography
- yes (17) (remove)
Keywords
- teacher training (3)
- Analytical models (2)
- Answer set programming (2)
- anti-cancer drugs (2)
- deep neural networks (2)
- drug-sensitivity prediction (2)
- higher education (2)
- policy evaluation (2)
- virtual mobility (2)
- Advanced Video Codec (AVC) (1)
- Benchmark testing; (1)
- Circuit faults (1)
- Codierungstheorie (1)
- Complexity (1)
- Computational Science (1)
- Deep Learning (1)
- Deep learning (1)
- Dempster-Shafer-Theorie (1)
- Dempster–Shafer theory (1)
- Encoding (1)
- Engines (1)
- Evidenztheorie (1)
- FPGA (1)
- Fehlererkennung (1)
- Flip-flops (1)
- H.264 (1)
- Hardware accelerator (1)
- Hochschulbildung (1)
- Inference (1)
- Informatik (1)
- Informatikdidaktik (1)
- Integrated circuit modeling (1)
- Klassifikator-Kalibrierung (1)
- Konstruktivismus (1)
- Lehrkräfteausbildung (1)
- Low Latency (1)
- Machine Learning (1)
- Machine learning (1)
- Mehrklassen-Klassifikation (1)
- Metric learning (1)
- Network (1)
- Network security (1)
- Parameterized complexity (1)
- Programming (1)
- Random access memory (1)
- Region of Interest (1)
- Scalability (1)
- Search problems (1)
- Security (1)
- Sequence embeddings (1)
- Single event upsets (1)
- Speicher (1)
- Tools (1)
- Tree decomposition (1)
- Treewidth (1)
- Treewidth-aware reductions (1)
- analysis (1)
- approximate model counting (1)
- classifier calibration (1)
- compliance (1)
- construktivism (1)
- craters (1)
- didactics (1)
- dynamic classification (1)
- dynamische Klassifikation (1)
- education (1)
- error propagation (1)
- evidence theory (1)
- formal (1)
- hardware accelerator (1)
- ice harboring (1)
- knowledge representation and reasoning (1)
- logic programming (1)
- lunar exploration (1)
- machine learning (1)
- machine learning algorithms (1)
- monitoring (1)
- multi-class classification (1)
- online learning (1)
- planning (1)
- predictive models (1)
- radhard design (1)
- reliability (1)
- reliability analysis (1)
- security (1)
- selective fault tolerance (1)
- self-adaptive multiprocessing system (1)
- single event upset (1)
- single event upsets (1)
- solar particle event (1)
- space missions (1)
- unidirektionale Fehler (1)
- university education (1)
- verification (1)
Institute
In this paper, we present a study comparing the depth to diameter (d/D) ratio of small simple craters (200-1000 m) of an area between -88.5 degrees to -90 degrees latitude at the lunar south pole containing Permanent Shadowed Regions (PSRs) versus craters without PSRs. As PSRs can reach temperatures of 110 K and are capable of harboring volatiles, especially water ice, we analyzed the relationship of depth versus diameter ratios and its possible implications for harboring water ice. Variations in the d/D ratios can also be caused by other processes such as degradation, isostatic adjustment, or differences in surface properties. The conducted d/D ratio analysis suggests that a differentiation between craters containing PSRs versus craters without PSRs occurs. Thus, a possible direct relation between d/D ratio, PSRs, and water ice harboring might exist. Our results suggest that differences in the target's surface properties may explain the obtained results. The resulting d/D ratios of craters with PSRs can help to select target areas for future In-Situ Resource Utilization (ISRU) missions.
Computational drug sensitivity models have the potential to improve therapeutic outcomes by identifying targeted drug components that are likely to achieve the highest efficacy for a cancer cell line at hand at a therapeutic dose. State of the art drug sensitivity models use regression techniques to predict the inhibitory concentration of a drug for a tumor cell line. This regression objective is not directly aligned with either of these principal goals of drug sensitivity models: We argue that drug sensitivity modeling should be seen as a ranking problem with an optimization criterion that quantifies a drug's inhibitory capacity for the cancer cell line at hand relative to its toxicity for healthy cells. We derive an extension to the well-established drug sensitivity regression model PaccMann that employs a ranking loss and focuses on the ratio of inhibitory concentration and therapeutic dosage range. We find that the ranking extension significantly enhances the model's capability to identify the most effective anticancer drugs for unseen tumor cell profiles based in on in-vitro data.
Large-scale databases that report the inhibitory capacities of many combinations of candidate drug compounds and cultivated cancer cell lines have driven the development of preclinical drug-sensitivity models based on machine learning. However, cultivated cell lines have devolved from human cancer cells over years or even decades under selective pressure in culture conditions. Moreover, models that have been trained on in vitro data cannot account for interactions with other types of cells. Drug-response data that are based on patient-derived cell cultures, xenografts, and organoids, on the other hand, are not available in the quantities that are needed to train high-capacity machine-learning models. We found that pre-training deep neural network models of drug sensitivity on in vitro drug-sensitivity databases before fine-tuning the model parameters on patient-derived data improves the models’ accuracy and improves the biological plausibility of the features, compared to training only on patient-derived data. From our experiments, we can conclude that pre-trained models outperform models that have been trained on the target domains in the vast majority of cases.
Large-scale databases that report the inhibitory capacities of many combinations of candidate drug compounds and cultivated cancer cell lines have driven the development of preclinical drug-sensitivity models based on machine learning. However, cultivated cell lines have devolved from human cancer cells over years or even decades under selective pressure in culture conditions. Moreover, models that have been trained on in vitro data cannot account for interactions with other types of cells. Drug-response data that are based on patient-derived cell cultures, xenografts, and organoids, on the other hand, are not available in the quantities that are needed to train high-capacity machine-learning models. We found that pre-training deep neural network models of drug sensitivity on in vitro drug-sensitivity databases before fine-tuning the model parameters on patient-derived data improves the models’ accuracy and improves the biological plausibility of the features, compared to training only on patient-derived data. From our experiments, we can conclude that pre-trained models outperform models that have been trained on the target domains in the vast majority of cases.
The use of neural networks is considered as the state of the art in the field of image classification. A large number of different networks are available for this purpose, which, appropriately trained, permit a high level of classification accuracy. Typically, these networks are applied to uncompressed image data, since a corresponding training was also carried out using image data of similar high quality. However, if image data contains image errors, the classification accuracy deteriorates drastically. This applies in particular to coding artifacts which occur due to image and video compression. Typical application scenarios for video compression are narrowband transmission channels for which video coding is required but a subsequent classification is to be carried out on the receiver side. In this paper we present a special H.264/Advanced Video Codec (AVC) based video codec that allows certain regions of a picture to be coded with near constant picture quality in order to allow a reliable classification using neural networks, whereas the remaining image will be coded using constant bit rate. We have combined this feature with the ability to run with lowest latency properties, which is usually also required in remote control applications scenarios. The codec has been implemented as a fully hardwired High Definition video capable hardware architecture which is suitable for Field Programmable Gate Arrays.
Answer set planning
(2022)
Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans, that is, solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the development of ASP-based planning systems. This paper surveys the progress made during the last two and a half decades in the area of answer set planning, from its foundations to its use in challenging planning domains. The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research.