TY - JOUR
A1 - von Steinau-Steinrück, Robert
A1 - Beismann, Lukas
T1 - (Corona-)Homeoffice und betriebliche Übung
JF - NJW spezial
N2 - Homeoffice und mobiles Arbeiten haben sich infolge der Covid-19-Pandemie bei vielen Unternehmen bekanntlich etabliert. Die Anweisung bzw. „Duldung“ des Homeoffice beruhte allerdings meist mehr auf tatsächlicher als auf rechtlicher Grundlage. Letztere könnte aber aus betrieblicher Übung erwachsen. Dieser Beitrag geht dem rechtlichen Rahmen dafür nach.
Y1 - 2020
UR - https://beck-online.beck.de/Bcid/Y-300-Z-NJW-SPEZIAL-B-2020-S-626-N-1
SN - 1613-4621
VL - 17
IS - 20
SP - 626
EP - 627
PB - C.H. Beck
CY - München
ER -
TY - JOUR
A1 - Sentance, Sue
A1 - Hodges, Steve
T1 - .NET Gadgeteer Workshop
JF - Commentarii informaticae didacticae : (CID)
Y1 - 2013
U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-64654
SN - 1868-0844
SN - 2191-1940
IS - 6
SP - 159
PB - Universitätsverlag Potsdam
CY - Potsdam
ER -
TY - JOUR
A1 - Dagiene, Valentina
A1 - Jevsikova, Tatjana
A1 - Schule, Carsten
A1 - Sentance, Sue
A1 - Thota, Neena
T1 - A comparison of current trends within computer science teaching in school in Germany and the UK
JF - Commentarii informaticae didacticae : (CID)
N2 - In the last two years, CS as a school subject has gained a lot of attention worldwide, although different countries have differing approaches to and experiences of introducing CS in schools. This paper reports on a study comparing current trends in CS at school, with a major focus on two countries, Germany and UK. A survey was carried out of a number of teaching professionals and experts from the UK and Germany with regard to the content and delivery of CS in school. An analysis of the quantitative data reveals a difference in foci in the two countries; putting this into the context of curricular developments we are able to offer interpretations of these trends and suggest ways in which curricula in CS at school should be moving forward.
KW - CS Ed Research
KW - ICT
KW - CS at school
KW - CS curriculum
KW - topics
KW - international comparison
KW - international study
Y1 - 2013
U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-64504
SN - 1868-0844
SN - 2191-1940
IS - 6
SP - 63
EP - 75
PB - Universitätsverlag Potsdam
CY - Potsdam
ER -
TY - JOUR
A1 - Stauffer, Maxime
A1 - Mengesha, Isaak
A1 - Seifert, Konrad
A1 - Krawczuk, Igor
A1 - Fischer, Jens
A1 - Serugendo, Giovanna Di Marzo
T1 - A computational turn in policy process studies
BT - coevolving network dynamics of policy change
JF - Complexity
N2 - The past three decades of policy process studies have seen the emergence of a clear intellectual lineage with regard to complexity. Implicitly or explicitly, scholars have employed complexity theory to examine the intricate dynamics of collective action in political contexts. However, the methodological counterparts to complexity theory, such as computational methods, are rarely used and, even if they are, they are often detached from established policy process theory. Building on a critical review of the application of complexity theory to policy process studies, we present and implement a baseline model of policy processes using the logic of coevolving networks. Our model suggests that an actor's influence depends on their environment and on exogenous events facilitating dialogue and consensus-building. Our results validate previous opinion dynamics models and generate novel patterns. Our discussion provides ground for further research and outlines the path for the field to achieve a computational turn.
Y1 - 2022
U6 - https://doi.org/10.1155/2022/8210732
SN - 1076-2787
SN - 1099-0526
VL - 2022
PB - Wiley-Hindawi
CY - London
ER -
TY - JOUR
A1 - Kaitoua, Abdulrahman
A1 - Rabl, Tilmann
A1 - Markl, Volker
T1 - A distributed data exchange engine for polystores
JF - Information technology : methods and applications of informatics and information technology
JF - Information technology : Methoden und innovative Anwendungen der Informatik und Informationstechnik
N2 - There is an increasing interest in fusing data from heterogeneous sources. Combining data sources increases the utility of existing datasets, generating new information and creating services of higher quality. A central issue in working with heterogeneous sources is data migration: In order to share and process data in different engines, resource intensive and complex movements and transformations between computing engines, services, and stores are necessary.
Muses is a distributed, high-performance data migration engine that is able to interconnect distributed data stores by forwarding, transforming, repartitioning, or broadcasting data among distributed engines' instances in a resource-, cost-, and performance-adaptive manner. As such, it performs seamless information sharing across all participating resources in a standard, modular manner. We show an overall improvement of 30 % for pipelining jobs across multiple engines, even when we count the overhead of Muses in the execution time. This performance gain implies that Muses can be used to optimise large pipelines that leverage multiple engines.
KW - distributed systems
KW - data migration
KW - data transformation
KW - big data
KW - engine
KW - data integration
Y1 - 2020
U6 - https://doi.org/10.1515/itit-2019-0037
SN - 1611-2776
SN - 2196-7032
VL - 62
IS - 3-4
SP - 145
EP - 156
PB - De Gruyter
CY - Berlin
ER -
TY - JOUR
A1 - Ihde, Sven
A1 - Pufahl, Luise
A1 - Völker, Maximilian
A1 - Goel, Asvin
A1 - Weske, Mathias
T1 - A framework for modeling and executing task
BT - specific resource allocations in business processes
JF - Computing : archives for informatics and numerical computation
N2 - As resources are valuable assets, organizations have to decide which resources to allocate to business process tasks in a way that the process is executed not only effectively but also efficiently. Traditional role-based resource allocation leads to effective process executions, since each task is performed by a resource that has the required skills and competencies to do so. However, the resulting allocations are typically not as efficient as they could be, since optimization techniques have yet to find their way in traditional business process management scenarios. On the other hand, operations research provides a rich set of analytical methods for supporting problem-specific decisions on resource allocation. This paper provides a novel framework for creating transparency on existing tasks and resources, supporting individualized allocations for each activity in a process, and the possibility to integrate problem-specific analytical methods of the operations research domain. To validate the framework, the paper reports on the design and prototypical implementation of a software architecture, which extends a traditional process engine with a dedicated resource management component. This component allows us to define specific resource allocation problems at design time, and it also facilitates optimized resource allocation at run time. The framework is evaluated using a real-world parcel delivery process. The evaluation shows that the quality of the allocation results increase significantly with a technique from operations research in contrast to the traditional applied rule-based approach.
KW - Process Execution
KW - Business Process Management
KW - Resource Allocation
KW - Resource Management
KW - Activity-oriented Optimization
Y1 - 2022
U6 - https://doi.org/10.1007/s00607-022-01093-2
SN - 0010-485X
SN - 1436-5057
VL - 104
SP - 2405
EP - 2429
PB - Springer
CY - Wien
ER -
TY - JOUR
A1 - Kreowsky, Philipp
A1 - Stabernack, Christian Benno
T1 - A full-featured FPGA-based pipelined architecture for SIFT extraction
JF - IEEE access : practical research, open solutions / Institute of Electrical and Electronics Engineers
N2 - Image feature detection is a key task in computer vision. Scale Invariant Feature Transform (SIFT) is a prevalent and well known algorithm for robust feature detection. However, it is computationally demanding and software implementations are not applicable for real-time performance. In this paper, a versatile and pipelined hardware implementation is proposed, that is capable of computing keypoints and rotation invariant descriptors on-chip. All computations are performed in single precision floating-point format which makes it possible to implement the original algorithm with little alteration. Various rotation resolutions and filter kernel sizes are supported for images of any resolution up to ultra-high definition. For full high definition images, 84 fps can be processed. Ultra high definition images can be processed at 21 fps.
KW - Field programmable gate arrays
KW - Convolution
KW - Signal processing
KW - algorithms
KW - Kernel
KW - Image resolution
KW - Histograms
KW - Feature extraction
KW - Scale-invariant feature transform (SIFT)
KW - field-programmable gate array
KW - (FPGA)
KW - image processing
KW - computer vision
KW - parallel processing
KW - architecture
KW - real-time
KW - hardware architecture
Y1 - 2021
U6 - https://doi.org/10.1109/ACCESS.2021.3104387
SN - 2169-3536
VL - 9
SP - 128564
EP - 128573
PB - Inst. of Electr. and Electronics Engineers
CY - New York, NY
ER -
TY - JOUR
A1 - Arnold, Holger
T1 - A linearized DPLL calculus with learning
N2 - This paper describes the proof calculus LD for clausal propositional logic, which is a linearized form of the well-known DPLL calculus extended by clause learning. It is motivated by the demand to model how current SAT solvers built on clause learning are working, while abstracting from decision heuristics and implementation details. The calculus is proved sound and terminating. Further, it is shown that both the original DPLL calculus and the conflict-directed backtracking calculus with clause learning, as it is implemented in many current SAT solvers, are complete and proof-confluent instances of the LD calculus.
N2 - Dieser Artikel beschreibt den Beweiskalkül LD für aussagenlogische Formeln in Klauselform. Dieser Kalkül ist eine um Klausellernen erweiterte linearisierte Variante des bekannten DPLL-Kalküls. Er soll dazu dienen, das Verhalten von auf Klausellernen basierenden SAT-Beweisern zu modellieren, wobei von Entscheidungsheuristiken und Implementierungsdetails abstrahiert werden soll. Es werden Korrektheit und Terminierung des Kalküls bewiesen. Weiterhin wird gezeigt, dass sowohl der ursprüngliche DPLL-Kalkül als auch der konfliktgesteuerte Rücksetzalgorithmus mit Klausellernen, wie er in vielen aktuellen SAT-Beweisern implementiert ist, vollständige und beweiskonfluente Spezialisierungen des LD-Kalküls sind.
KW - SAT
KW - DPLL
KW - Klausellernen
KW - Automatisches Beweisen
KW - SAT
KW - DPLL
KW - Clause Learning
KW - Automated Theorem Proving
Y1 - 2007
U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-15421
ER -
TY - JOUR
A1 - Schneider, Sven
A1 - Lambers, Leen
A1 - Orejas, Fernando
T1 - A logic-based incremental approach to graph repair featuring delta preservation
JF - International journal on software tools for technology transfer : STTT
N2 - We introduce a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing graph repairs from which a user may select a graph repair based on non-formalized further requirements. This incremental approach features delta preservation as it allows to restrict the generation of graph repairs to delta-preserving graph repairs, which do not revert the additions and deletions of the most recent consistency-violating graph update. We specify consistency of graphs using the logic of nested graph conditions, which is equivalent to first-order logic on graphs. Technically, the incremental approach encodes if and how the graph under repair satisfies a graph condition using the novel data structure of satisfaction trees, which are adapted incrementally according to the graph updates applied. In addition to the incremental approach, we also present two state-based graph repair algorithms, which restore consistency of a graph independent of the most recent graph update and which generate additional graph repairs using a global perspective on the graph under repair. We evaluate the developed algorithms using our prototypical implementation in the tool AutoGraph and illustrate our incremental approach using a case study from the graph database domain.
KW - Nested graph conditions
KW - Graph repair
KW - Model repair
KW - Consistency
KW - restoration
KW - Delta preservation
KW - Graph databases
KW - Model-driven
KW - engineering
Y1 - 2021
U6 - https://doi.org/10.1007/s10009-020-00584-x
SN - 1433-2779
SN - 1433-2787
VL - 23
IS - 3
SP - 369
EP - 410
PB - Springer
CY - Berlin ; Heidelberg
ER -
TY - JOUR
A1 - Hartung, Niklas
A1 - Borghardt, Jens Markus
T1 - A mechanistic framework for a priori pharmacokinetic predictions of orally inhaled drugs
JF - PLoS Computational Biology : a new community journal
N2 - Author summary
The use of orally inhaled drugs for treating lung diseases is appealing since they have the potential for lung selectivity, i.e. high exposure at the site of action -the lung- without excessive side effects. However, the degree of lung selectivity depends on a large number of factors, including physiochemical properties of drug molecules, patient disease state, and inhalation devices. To predict the impact of these factors on drug exposure and thereby to understand the characteristics of an optimal drug for inhalation, we develop a predictive mathematical framework (a "pharmacokinetic model"). In contrast to previous approaches, our model allows combining knowledge from different sources appropriately and its predictions were able to adequately predict different sets of clinical data. Finally, we compare the impact of different factors and find that the most important factors are the size of the inhaled particles, the affinity of the drug to the lung tissue, as well as the rate of drug dissolution in the lung. In contrast to the common belief, the solubility of a drug in the lining fluids is not found to be relevant. These findings are important to understand how inhaled drugs should be designed to achieve best treatment results in patients.
The fate of orally inhaled drugs is determined by pulmonary pharmacokinetic processes such as particle deposition, pulmonary drug dissolution, and mucociliary clearance. Even though each single process has been systematically investigated, a quantitative understanding on the interaction of processes remains limited and therefore identifying optimal drug and formulation characteristics for orally inhaled drugs is still challenging. To investigate this complex interplay, the pulmonary processes can be integrated into mathematical models. However, existing modeling attempts considerably simplify these processes or are not systematically evaluated against (clinical) data. In this work, we developed a mathematical framework based on physiologically-structured population equations to integrate all relevant pulmonary processes mechanistically. A tailored numerical resolution strategy was chosen and the mechanistic model was evaluated systematically against data from different clinical studies. Without adapting the mechanistic model or estimating kinetic parameters based on individual study data, the developed model was able to predict simultaneously (i) lung retention profiles of inhaled insoluble particles, (ii) particle size-dependent pharmacokinetics of inhaled monodisperse particles, (iii) pharmacokinetic differences between inhaled fluticasone propionate and budesonide, as well as (iv) pharmacokinetic differences between healthy volunteers and asthmatic patients. Finally, to identify the most impactful optimization criteria for orally inhaled drugs, the developed mechanistic model was applied to investigate the impact of input parameters on both the pulmonary and systemic exposure. Interestingly, the solubility of the inhaled drug did not have any relevant impact on the local and systemic pharmacokinetics. Instead, the pulmonary dissolution rate, the particle size, the tissue affinity, and the systemic clearance were the most impactful potential optimization parameters. In the future, the developed prediction framework should be considered a powerful tool for identifying optimal drug and formulation characteristics.
Y1 - 2020
U6 - https://doi.org/10.1371/journal.pcbi.1008466
SN - 1553-734X
SN - 1553-7358
VL - 16
IS - 12
PB - PLoS
CY - San Fransisco
ER -
TY - JOUR
A1 - Weise, Martin
T1 - A model for teaching informatics to German secondary school students in English-language bilingual education
JF - Commentarii informaticae didacticae : (CID)
N2 - Informatics as a school subject has been virtually absent from bilingual education programs in German secondary schools. Most bilingual programs in German secondary education started out by focusing on subjects from the field of social sciences. Teachers and bilingual curriculum experts alike have been regarding those as the most suitable subjects for bilingual instruction – largely due to the intercultural perspective that a bilingual approach provides. And though one cannot deny the gain that ensues from an intercultural perspective on subjects such as history or geography, this benefit is certainly not limited to social science subjects. In consequence, bilingual curriculum designers have already begun to include other subjects such as physics or chemistry in bilingual school programs. It only seems a small step to extend this to informatics. This paper will start out by addressing potential benefits of adding informatics to the range of subjects taught as part of English-language bilingual programs in German secondary education. In a second step it will sketch out a methodological (= didactical) model for teaching informatics to German learners through English. It will then provide two items of hands-on and tested teaching material in accordance with this model. The discussion will conclude with a brief outlook on the chances and prerequisites of firmly establishing informatics as part of bilingual school curricula in Germany.
Y1 - 2013
U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-64568
SN - 1868-0844
SN - 2191-1940
IS - 6
SP - 127
EP - 137
PB - Universitätsverlag Potsdam
CY - Potsdam
ER -
TY - JOUR
A1 - Perach, Shai
A1 - Alexandron, Giora
T1 - A MOOC-Based Computer Science Program for Middle School
BT - Results, Challenges, and the Covid-19 Effect
JF - EMOOCs 2021
N2 - In an attempt to pave the way for more extensive Computer Science Education (CSE) coverage in K-12, this research developed and made a preliminary evaluation of a blended-learning Introduction to CS program based on an academic MOOC. Using an academic MOOC that is pedagogically effective and engaging, such a program may provide teachers with disciplinary scaffolds and allow them to focus their attention on enhancing students’ learning experience and nurturing critical 21st-century skills such as self-regulated learning. As we demonstrate, this enabled us to introduce an academic level course to middle-school students. In this research, we developed the principals and initial version of such a program, targeting ninth-graders in science-track classes who learn CS as part of their standard curriculum. We found that the middle-schoolers who participated in the program achieved academic results on par with undergraduate students taking this MOOC for academic credit. Participating students also developed a more accurate perception of the essence of CS as a scientific discipline. The unplanned school closure due to the COVID19 pandemic outbreak challenged the research but underlined the advantages of such a MOOCbased blended learning program above classic pedagogy in times of global or local crises that lead to school closure. While most of the science track classes seem to stop learning CS almost entirely, and the end-of-year MoE exam was discarded, the program’s classes smoothly moved to remote learning mode, and students continued to study at a pace similar to that experienced before the school shut down.
Y1 - 2021
U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-517133
SN - 978-3-86956-512-5
VL - 2021
SP - 111
EP - 127
PB - Universitätsverlag Potsdam
CY - Potsdam
ER -
TY - JOUR
A1 - Navarro, Marisa
A1 - Orejas, Fernando
A1 - Pino, Elvira
A1 - Lambers, Leen
T1 - A navigational logic for reasoning about graph properties
JF - Journal of logical and algebraic methods in programming
N2 - Graphs play an important role in many areas of Computer Science. In particular, our work is motivated by model-driven software development and by graph databases. For this reason, it is very important to have the means to express and to reason about the properties that a given graph may satisfy. With this aim, in this paper we present a visual logic that allows us to describe graph properties, including navigational properties, i.e., properties about the paths in a graph. The logic is equipped with a deductive tableau method that we have proved to be sound and complete.
KW - Graph logic
KW - Algebraic methods
KW - Formal modelling
KW - Specification
Y1 - 2021
U6 - https://doi.org/10.1016/j.jlamp.2020.100616
SN - 2352-2208
SN - 2352-2216
VL - 118
PB - Elsevier Science
CY - Amsterdam [u.a.]
ER -
TY - JOUR
A1 - Neher, Dieter
A1 - Kniepert, Juliane
A1 - Elimelech, Arik
A1 - Koster, L. Jan Anton
T1 - A New Figure of Merit for Organic Solar Cells with Transport-limited Photocurrents
JF - Scientific reports
N2 - Compared to their inorganic counterparts, organic semiconductors suffer from relatively low charge carrier mobilities. Therefore, expressions derived for inorganic solar cells to correlate characteristic performance parameters to material properties are prone to fail when applied to organic devices. This is especially true for the classical Shockley-equation commonly used to describe current-voltage (JV)-curves, as it assumes a high electrical conductivity of the charge transporting material. Here, an analytical expression for the JV-curves of organic solar cells is derived based on a previously published analytical model. This expression, bearing a similar functional dependence as the Shockley-equation, delivers a new figure of merit α to express the balance between free charge recombination and extraction in low mobility photoactive materials. This figure of merit is shown to determine critical device parameters such as the apparent series resistance and the fill factor.
KW - Electronic and spintronic devices
KW - Semiconductors
Y1 - 2016
U6 - https://doi.org/10.1038/srep24861
SN - 2045-2322
VL - 6
PB - Nature Publishing Group
CY - London
ER -
TY - JOUR
A1 - Doerr, Benjamin
A1 - Krejca, Martin Stefan
T1 - A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes
JF - Theoretical computer science
N2 - With elementary means, we prove a stronger run time guarantee for the univariate marginal distribution algorithm (UMDA) optimizing the LEADINGONES benchmark function in the desirable regime with low genetic drift. If the population size is at least quasilinear, then, with high probability, the UMDA samples the optimum in a number of iterations that is linear in the problem size divided by the logarithm of the UMDA's selection rate. This improves over the previous guarantee, obtained by Dang and Lehre (2015) via the deep level-based population method, both in terms of the run time and by demonstrating further run time gains from small selection rates. Under similar assumptions, we prove a lower bound that matches our upper bound up to constant factors.
KW - Theory
KW - Estimation-of-distribution algorithm
KW - Run time analysis
Y1 - 2021
U6 - https://doi.org/10.1016/j.tcs.2020.11.028
SN - 0304-3975
SN - 1879-2294
VL - 851
SP - 121
EP - 128
PB - Elsevier
CY - Amsterdam
ER -
TY - JOUR
A1 - Respondek, Tobias
T1 - A workflow for computing potential areas for wind turbines
JF - Process design for natural scientists: an agile model-driven approach
N2 - This paper describes the implementation of a workflow model for service-oriented computing of potential areas for wind turbines in jABC. By implementing a re-executable model the manual effort of a multi-criteria site analysis can be reduced. The aim is to determine the shift of typical geoprocessing tools of geographic information systems (GIS) from the desktop to the web. The analysis is based on a vector data set and mainly uses web services of the “Center for Spatial Information Science and Systems” (CSISS). This paper discusses effort, benefits and problems associated with the use of the web services.
Y1 - 2014
SN - 978-3-662-45005-5
IS - 500
SP - 200
EP - 215
PB - Springer
CY - Berlin
ER -
TY - JOUR
A1 - Krause, Hannes-Vincent
A1 - Große Deters, Fenne
A1 - Baumann, Annika
A1 - Krasnova, Hanna
T1 - Active social media use and its impact on well-being
BT - an experimental study on the effects of posting pictures on Instagram
JF - Journal of computer-mediated communication : a journal of the International Communication Association
N2 - Active use of social networking sites (SNSs) has long been assumed to benefit users' well-being. However, this established hypothesis is increasingly being challenged, with scholars criticizing its lack of empirical support and the imprecise conceptualization of active use. Nevertheless, with considerable heterogeneity among existing studies on the hypothesis and causal evidence still limited, a final verdict on its robustness is still pending. To contribute to this ongoing debate, we conducted a week-long randomized control trial with N = 381 adult Instagram users recruited via Prolific. Specifically, we tested how active SNS use, operationalized as picture postings on Instagram, affects different dimensions of well-being. The results depicted a positive effect on users' positive affect but null findings for other well-being outcomes. The findings broadly align with the recent criticism against the active use hypothesis and support the call for a more nuanced view on the impact of SNSs.
Lay Summary Active use of social networking sites (SNSs) has long been assumed to benefit users' well-being. However, this established assumption is increasingly being challenged, with scholars criticizing its lack of empirical support and the imprecise conceptualization of active use. Nevertheless, with great diversity among conducted studies on the hypothesis and a lack of causal evidence, a final verdict on its viability is still pending. To contribute to this ongoing debate, we conducted a week-long experimental investigation with 381 adult Instagram users. Specifically, we tested how posting pictures on Instagram affects different aspects of well-being. The results of this study depicted a positive effect of posting Instagram pictures on users' experienced positive emotions but no effects on other aspects of well-being. The findings broadly align with the recent criticism against the active use hypothesis and support the call for a more nuanced view on the impact of SNSs on users.
KW - social networking sites
KW - social media
KW - Instagram
KW - well-being
KW - experiment
KW - randomized control trial
Y1 - 2022
U6 - https://doi.org/10.1093/jcmc/zmac037
SN - 1083-6101
VL - 28
IS - 1
PB - Oxford Univ. Press
CY - Oxford
ER -
TY - JOUR
A1 - Opel, Simone
A1 - Netzer, Cajus Marian
A1 - Desel, Jörg
T1 - Adaption von Lernwegen in adaptierten Lehrmaterialien für Studierende mit Berufsausbildungsabschluss
JF - Hochschuldidaktik Informatik HDI 2021 (Commentarii informaticae didacticae)
N2 - Obwohl immer mehr Menschen nicht direkt ein Studium aufnehmen, sondern zuvor eine berufliche Ausbildung absolvieren, werden die in der Ausbildung erworbenen Kompetenzen von den Hochschulen inhaltlich und didaktisch meist ignoriert. Ein Ansatz, diese Kompetenzen zu würdigen, ist die formale Anrechnung von mitgebrachten Kompetenzen als (für den Studienabschluss erforderliche) Leistungspunkte. Eine andere Variante ist der Einsatz von speziell für die Zielgruppe der Studierenden mit Vorkenntnissen adaptiertem Lehr-Lernmaterial. Um darüber hinaus individuelle Unterschiede zu berücksichtigen, erlaubt eine weitere Adaption individueller Lernpfade den Lernenden, genau die jeweils fehlenden Kompetenzen zu erwerben. In diesem Beitrag stellen wir die exemplarische Entwicklung derartigen Materials anhand des Kurses „Datenbanken“ für die Zielgruppe der Studierenden mit einer abgeschlossenen Ausbildung zum Fachinformatiker bzw. zur Fachinformatikerin vor.
KW - Informatik
KW - Anrechnung
KW - Adaption
KW - individuelle Lernwege
KW - Vorwissen
KW - Kompetenz
KW - Datenbanken
KW - Hochschule
KW - Fachinformatiker
Y1 - 2023
U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-614188
SN - 978-3-86956-548-4
SN - 1868-0844
SN - 2191-1940
IS - 13
SP - 91
EP - 114
PB - Universitätsverlag Potsdam
CY - Potsdam
ER -
TY - JOUR
A1 - Brewka, Gerhard
A1 - Ellmauthaler, Stefan
A1 - Kern-Isberner, Gabriele
A1 - Obermeier, Philipp
A1 - Ostrowski, Max
A1 - Romero, Javier
A1 - Schaub, Torsten
A1 - Schieweck, Steffen
T1 - Advanced solving technology for dynamic and reactive applications
JF - Künstliche Intelligenz
Y1 - 2018
U6 - https://doi.org/10.1007/s13218-018-0538-8
SN - 0933-1875
SN - 1610-1987
VL - 32
IS - 2-3
SP - 199
EP - 200
PB - Springer
CY - Heidelberg
ER -
TY - JOUR
A1 - Benlian, Alexander
A1 - Wiener, Martin
A1 - Cram, W. Alec
A1 - Krasnova, Hanna
A1 - Maedche, Alexander
A1 - Mohlmann, Mareike
A1 - Recker, Jan
A1 - Remus, Ulrich
T1 - Algorithmic management
BT - bright and dark sides, practical implications, and research opportunities
JF - Business and information systems engineering
Y1 - 2022
U6 - https://doi.org/10.1007/s12599-022-00764-w
SN - 2363-7005
SN - 1867-0202
VL - 64
IS - 6
SP - 825
EP - 839
PB - Springer Gabler
CY - Wiesbaden
ER -