004 Datenverarbeitung; Informatik
Refine
Year of publication
Document Type
- Article (34)
- Conference Proceeding (18)
- Monograph/Edited Volume (7)
- Doctoral Thesis (4)
- Master's Thesis (1)
- Postprint (1)
Keywords
- Informatik (4)
- Informatikdidaktik (3)
- Datenanalyse (2)
- Diversity (2)
- ICT (2)
- ISSEP (2)
- Informatics (2)
- Informatics Education (2)
- Informatikstudium (2)
- 3DCityDB (1)
- AMNET (1)
- Adaption (1)
- Adaptive hypermedia (1)
- Anerkennung (1)
- Anrechnung (1)
- Antwortmengenprogrammierung (1)
- Application Server (1)
- Assessment (1)
- Association Rule Mining (1)
- Assoziationsregeln (1)
- Asynchrone Schaltung (1)
- Asynchronous circuit (1)
- Bachelor (1)
- Bachelorstudium (1)
- Barrierefreiheit (1)
- Bedingte Inklusionsabhängigkeiten (1)
- Berufsausbildung (1)
- Bildung (1)
- COVID-19 (1)
- CS Ed Research (1)
- CS at school (1)
- CS curriculum (1)
- CSC (1)
- CityGML (1)
- Citymodel (1)
- Comparing programming environments (1)
- Computer Science Education (1)
- Conditional Inclusion Dependency (1)
- Constraint Solving (1)
- Controller-Resynthese (1)
- Course development (1)
- Course marketing (1)
- Course of Study (1)
- Courses for female students (1)
- Curricula Development (1)
- Curriculum analysis (1)
- Data Dependency (1)
- Database (1)
- Datenabhängigkeiten (1)
- Datenbank (1)
- Datenbanken (1)
- Datenintegration (1)
- Datenschutz (1)
- Deduction (1)
- Didaktische Konzepte (1)
- Diskussionskultur (1)
- Distanzlehre (1)
- Diversität (1)
- Durchlässigkeit (1)
- Erfolgsmessung (1)
- Erkennen von Meta-Daten (1)
- Ethics (1)
- Fachinformatik (1)
- Fachinformatiker (1)
- Feature selection (1)
- Feedback (1)
- Fundamental Modeling Concepts (1)
- Gender (1)
- Gene expression (1)
- General subject “Information” (1)
- HDI (1)
- HEI (1)
- Heterogenität (1)
- Hochschuldidaktik (1)
- Hochschule (1)
- Hochschullehre (1)
- IBM 360 (1)
- ICT competencies (1)
- ICT curriculum (1)
- Identität (1)
- Informatik B. Sc. (1)
- Information Ethics (1)
- Informatische Kompetenzen (1)
- Intersectionality (1)
- Interventionen (1)
- Inverted Classroom (1)
- Java 2 Enterprise Edition (1)
- Java Virtual Machine (1)
- KI (1)
- Key Competencies (1)
- Kompetenz (1)
- Kompetenzen (1)
- Learning Analytics (1)
- Lebenslanges Lernen (1)
- Lehr- und Lernformate (1)
- Lehramtsstudium (1)
- Lernerfolg (1)
- Lernzentrum (1)
- Link Discovery (1)
- Link-Entdeckung (1)
- Linked Open Data (1)
- Logic Programming (1)
- Logics (1)
- Mensch-Computer-Interaktion (1)
- Metadata Discovery (1)
- Metadatenentdeckung (1)
- Metadatenqualität (1)
- Mobile learning (1)
- Navigation (1)
- Optimization (1)
- PAVM (1)
- Peer-Review (1)
- Personas (1)
- Petrinetz (1)
- Planing (1)
- PostGIS (1)
- Primary informatics (1)
- Prior knowledge (1)
- Problem solving (1)
- Problem solving strategies (1)
- Programming environments for children (1)
- Programming learning (1)
- Prolog (1)
- Pytho n (1)
- Reproducible benchmarking (1)
- STEM (1)
- STG decomposition (1)
- STG-Dekomposition (1)
- Schemaentdeckung (1)
- Schlüsselkompetenzen (1)
- Schlüsselkompetenzen (1)
- Scientific understanding of Information (1)
- Segmentierung (1)
- Seminarkonzept (1)
- Signalflankengraph (SFG oder STG) (1)
- Social impact (1)
- Sociotechnical Design (1)
- Stadtmodell (1)
- Student Engagement (1)
- Studienabbruch (1)
- Studienanfänger*innen (1)
- Studieneingangsphase (1)
- Studiengestaltung (1)
- Studienverläufe (1)
- Studium (1)
- Systembiologie (1)
- Teaching problem solving strategies (1)
- Trajectories (1)
- Umfrage (1)
- VM (1)
- VM Integration (1)
- VR (1)
- Virtuelle Maschine (1)
- Vorkenntnisse (1)
- Vorwissen (1)
- Women and IT (1)
- XM (1)
- ad hoc learning (1)
- ad hoc messaging network (1)
- answer set programming (1)
- bibliometric analysis (1)
- bild (1)
- blockchain (1)
- bottom–up (1)
- built–in predicates (1)
- business process management (1)
- business processes (1)
- citation analysis (1)
- collaboration (1)
- community (1)
- competence (1)
- competencies (1)
- computational thinking (1)
- computer science (1)
- computer science education (CSE) (1)
- computing science education (1)
- concept of algorithm (1)
- constructionism (1)
- control resynthesis (1)
- data integration (1)
- data profiling (1)
- deductive databases (1)
- deferred choice (1)
- digitale Hochschullehre (1)
- e-learning platform (1)
- education (1)
- engaged computing (1)
- extensions of logic programs (1)
- formal semantics (1)
- forschendes Lernen (1)
- forward / backward chaining (1)
- function symbols (1)
- fächerverbindend (1)
- general education in computer science (1)
- general secondary education (1)
- generalized logic programs (1)
- health care (1)
- healthcare (1)
- image (1)
- individuelle Lernwege (1)
- informatics curricula (1)
- informatics education (1)
- informatics in upper secondary education (1)
- informatische Allgemeinbildung (1)
- informatische Grundkompetenzen (1)
- instruction (1)
- international comparison (1)
- international study (1)
- key competencies (1)
- knowledge representation (1)
- lesson (1)
- literature review (1)
- logic programming (1)
- logical signaling networks (1)
- logische Signalnetzwerke (1)
- mandatory computer science foundations (1)
- maschinelles Lernen (1)
- medical (1)
- medizinisch (1)
- metadata discovery (1)
- metadata quality (1)
- misconceptions (1)
- multi-valued logic (1)
- oracles (1)
- paraconsistency (1)
- pervasive learning (1)
- petri net (1)
- primary school (1)
- review (1)
- schema discovery (1)
- science (1)
- segmentation (1)
- semantics (1)
- signal transition graph (1)
- situated learning (1)
- smart contracts (1)
- social networking (1)
- sorting (1)
- speed independent (1)
- spreadsheets (1)
- stratification (1)
- studentische Forschung (1)
- systems biology (1)
- teacher (1)
- teacher education (1)
- teacher training (1)
- teaching material (1)
- test items (1)
- topics (1)
- top– down (1)
- usability (1)
- virtual reality (1)
- wissenschaftliches Arbeiten (1)
- wissenschaftliches Schreiben (1)
- workflow patterns (1)
Institute
- Extern (65) (remove)
Moderne Softwaresysteme sind komplexe Gebilde, welche häufig im Verbund mit anderen technischen und betriebswirtschaftlichen Systemen eingesetzt werden. Für die Hersteller solcher Systeme stellt es oft eine große Herausforderung dar, den oft weit reichenden Anforderungen bezüglich der Anpassbarkeit solcher Systeme gerecht zu werden. Zur Erfüllung dieser Anforderungen hat es sich vielfach bewährt, eine virtuelle Maschine in das betreffende System zu integrieren. Die Dissertation richtet sich insbesondere an Personen, die vor der Aufgabe der Integration virtueller Maschinen in bestehende Systeme stehen und zielt darauf ab, solche für die Entscheidung über Integrationsfragen wichtigen Zusammenhänge klar darzustellen. Typischerweise treten bei der Integration einer virtuellen Maschine in ein System eine Reihe unterschiedlicher Problemstellungen auf. Da diese Problemstellungen oft eng miteinander verzahnt sind, ist eine isolierte Betrachtung meist nicht sinnvoll. Daher werden die Problemstellungen anhand eines zentral gewählten, sehr umfangreichen Beispiels aus der industriellen Praxis eingeführt. Dieses Beispiel hat die Integration der "Java Virtual Machine" in den SAP R/3 Application Server zum Gegenstand. Im Anschluss an dieses Praxisbeispiel wird die Diskussion der Integrationsproblematik unter Bezug auf eine Auswahl weiterer, in der Literatur beschriebener Integrationsbeispiele vertieft. Das Hauptproblem bei der Behandlung der Integrationsproblematik bestand darin, dass die vorgefundenen Beschreibungen, der als Beispiel herangezogenen Systeme, nur bedingt als Basis für die Auseinandersetzung mit der Integrationsproblematik geeignet waren. Zur Schaffung einer verwertbaren Diskussionsgrundlage war es daher erforderlich, eine homogene, durchgängige Modellierung dieser Systeme vorzunehmen. Die Modellierung der Systeme erfolgte dabei unter Verwendung der "Fundamental Modeling Concepts (FMC)". Die erstellten Modelle sowie die auf Basis dieser Modelle durchgeführte Gegenüberstellung der unterschiedlichen Ansätze zur LÖsung typischer Integrationsprobleme bilden den Hauptbeitrag der Dissertation. Im Zusammenhang mit der Integration virtueller Maschinen in bestehende Systeme besteht häufig der Bedarf, zeitgleich mehrere "Programme" durch die integrierte virtuelle Maschine ausführen zu lassen. Angesichts der Konstruktionsmerkmale vieler heute verbreiteter virtueller Maschinen stellt die Realisierung eines "betriebsmittelschonenden Mehrprogrammbetriebs" eine große Herausforderung dar. Die Darstellung des Spektrums an Maßnahmen zur Realisierung eines "betriebsmittelschonenden Mehrprogrammbetriebs" bildet einen zweiten wesentlichen Beitrag der Dissertation.
The requirements of modern e-learning techniques change. Aspects such as community interaction, flexibility, pervasive learning and increasing mobility in communication habits become more important. To meet these challenges e-learning platforms must provide support on mobile learning. Most approaches try to adopt centralised and static e-learning mechanisms to mobile devices. However, often technically it is not possible for all kinds of devices to be connected to a central server. Therefore we introduce an application of a mobile e-learning network which operates totally decentralised with the help of an underlying ad hoc network architecture. Furthermore the concept of ad hoc messaging network (AMNET) is used as basis system architecture for our approach to implement a platform for pervasive mobile e-learning.
The innovation of information techniques has changed many aspects of our life. In health care field, we can obtain, manage and communicate high-quality large volumetric image data by computer integrated devices, to support medical care. In this dissertation I propose several promising methods that could assist physicians in processing, observing and communicating the image data. They are included in my three research aspects: telemedicine integration, medical image visualization and image segmentation. And these methods are also demonstrated by the demo software that I developed. One of my research point focuses on medical information storage standard in telemedicine, for example DICOM, which is the predominant standard for the storage and communication of medical images. I propose a novel 3D image data storage method, which was lacking in current DICOM standard. I also created a mechanism to make use of the non-standard or private DICOM files. In this thesis I present several rendering techniques on medical image visualization to offer different display manners, both 2D and 3D, for example, cut through data volume in arbitrary degree, rendering the surface shell of the data, and rendering the semi-transparent volume of the data. A hybrid segmentation approach, designed for semi-automated segmentation of radiological image, such as CT, MRI, etc, is proposed in this thesis to get the organ or interested area from the image. This approach takes advantage of the region-based method and boundary-based methods. Three steps compose the hybrid approach: the first step gets coarse segmentation by fuzzy affinity and generates homogeneity operator; the second step divides the image by Voronoi Diagram and reclassifies the regions by the operator to refine segmentation from the previous step; the third step handles vague boundary by level set model. Topics for future research are mentioned in the end, including new supplement for DICOM standard for segmentation information storage, visualization of multimodal image information, and improvement of the segmentation approach to higher dimension.
Business process management experiences a large uptake by the industry, and process models play an important role in the analysis and improvement of processes. While an increasing number of staff becomes involved in actual modeling practice, it is crucial to assure model quality and homogeneity along with providing suitable aids for creating models. In this paper we consider the problem of offering recommendations to the user during the act of modeling. Our key contribution is a concept for defining and identifying so-called action patterns - chunks of actions often appearing together in business processes. In particular, we specify action patterns and demonstrate how they can be identified from existing process model repositories using association rule mining techniques. Action patterns can then be used to suggest additional actions for a process model. Our approach is challenged by applying it to the collection of process models from the SAP Reference Model.
Abstract interpretation-based model checking provides an approach to verifying properties of infinite-state systems. In practice, most previous work on abstract model checking is either restricted to verifying universal properties, or develops special techniques for temporal logics such as modal transition systems or other dual transition systems. By contrast we apply completely standard techniques for constructing abstract interpretations to the abstraction of a CTL semantic function, without restricting the kind of properties that can be verified. Furthermore we show that this leads directly to implementation of abstract model checking algorithms for abstract domains based on constraints, making use of an SMT solver.
Business process management aims at capturing, understanding, and improving work in organizations. The central artifacts are process models, which serve different purposes. Detailed process models are used to analyze concrete working procedures, while high-level models show, for instance, handovers between departments. To provide different views on process models, business process model abstraction has emerged. While several approaches have been proposed, a number of abstraction use case that are both relevant for industry and scientifically challenging are yet to be addressed. In this paper we systematically develop, classify, and consolidate different use cases for business process model abstraction. The reported work is based on a study with BPM users in the health insurance sector and validated with a BPM consultancy company and a large BPM vendor. The identified fifteen abstraction use cases reflect the industry demand. The related work on business process model abstraction is evaluated against the use cases, which leads to a research agenda.
A deterministic cycle scheduling of partitions at the operating system level is supposed for a multiprocessor system. In this paper, we propose a tool for generating such schedules. We use constraint based programming and develop methods and concepts for a combined interactive and automatic partition scheduling system. This paper is also devoted to basic methods and techniques for modeling and solving this partition scheduling problem. Initial application of our partition scheduling tool has proved successful and demonstrated the suitability of the methods used.
A constraint programming system combines two essential components: a constraint solver and a search engine. The constraint solver reasons about satisfiability of conjunctions of constraints, and the search engine controls the search for solutions by iteratively exploring a disjunctive search tree defined by the constraint program. The Monadic Constraint Programming framework gives a monadic definition of constraint programming where the solver is defined as a monad threaded through the monadic search tree. Search and search strategies can then be defined as firstclass objects that can themselves be built or extended by composable search transformers. Search transformers give a powerful and unifying approach to viewing search in constraint programming, and the resulting constraint programming system is first class and extremely flexible.
STG decomposition is a promising approach to tackle the complexity problems arising in logic synthesis of speed independent circuits, a robust asynchronous (i.e. clockless) circuit type. Unfortunately, STG decomposition can result in components that in isolation have irreducible CSC conflicts. Generalising earlier work, it is shown how to resolve such conflicts by introducing internal communication between the components via structural techniques only.
The interest in extensions of the logic programming paradigm beyond the class of normal logic programs is motivated by the need of an adequate representation and processing of knowledge. One of the most difficult problems in this area is to find an adequate declarative semantics for logic programs. In the present paper a general preference criterion is proposed that selects the ‘intended’ partial models of generalized logic programs which is a conservative extension of the stationary semantics for normal logic programs of [Prz91]. The presented preference criterion defines a partial model of a generalized logic program as intended if it is generated by a stationary chain. It turns out that the stationary generated models coincide with the stationary models on the class of normal logic programs. The general wellfounded semantics of such a program is defined as the set-theoretical intersection of its stationary generated models. For normal logic programs the general wellfounded semantics equals the wellfounded semantics.
Different properties of programs, implemented in Constraint Handling Rules (CHR), have already been investigated. Proving these properties in CHR is fairly simpler than proving them in any type of imperative programming language, which triggered the proposal of a methodology to map imperative programs into equivalent CHR. The equivalence of both programs implies that if a property is satisfied for one, then it is satisfied for the other. The mapping methodology could be put to other beneficial uses. One such use is the automatic generation of global constraints, at an attempt to demonstrate the benefits of having a rule-based implementation for constraint solvers.
In the most abstract definition of its operational semantics, the declarative and concurrent programming language CHR is trivially non-terminating for a significant class of programs. Common refinements of this definition, in closing the gap to real-world implementations, compromise on declarativity and/or concurrency. Building on recent work and the notion of persistent constraints, we introduce an operational semantics avoiding trivial non-termination without compromising on its essential features.
We present the tool Kato which is, to the best of our knowledge, the first tool for plagiarism detection that is directly tailored for answer-set programming (ASP). Kato aims at finding similarities between (segments of) logic programs to help detecting cases of plagiarism. Currently, the tool is realised for DLV programs but it is designed to handle various logic-programming syntax versions. We review basic features and the underlying methodology of the tool.
In this talk, I would like to share my experiences gained from participating in four CSP solver competitions and the second ASP solver competition. In particular, I’ll talk about how various programming techniques can make huge differences in solving some of the benchmark problems used in the competitions. These techniques include global constraints, table constraints, and problem-specific propagators and labeling strategies for selecting variables and values. I’ll present these techniques with experimental results from B-Prolog and other CLP(FD) systems.
We describe a framework to support the implementation of web-based systems to manipulate data stored in relational databases. Since the conceptual model of a relational database is often specified as an entity-relationship (ER) model, we propose to use the ER model to generate a complete implementation in the declarative programming language Curry. This implementation contains operations to create and manipulate entities of the data model, supports authentication, authorization, session handling, and the composition of individual operations to user processes. Furthermore and most important, the implementation ensures the consistency of the database w.r.t. the data dependencies specified in the ER model, i.e., updates initiated by the user cannot lead to an inconsistent state of the database. In order to generate a high-level declarative implementation that can be easily adapted to individual customer requirements, the framework exploits previous works on declarative database programming and web user interface construction in Curry.
Data obtained from foreign data sources often come with only superficial structural information, such as relation names and attribute names. Other types of metadata that are important for effective integration and meaningful querying of such data sets are missing. In particular, relationships among attributes, such as foreign keys, are crucial metadata for understanding the structure of an unknown database. The discovery of such relationships is difficult, because in principle for each pair of attributes in the database each pair of data values must be compared. A precondition for a foreign key is an inclusion dependency (IND) between the key and the foreign key attributes. We present with Spider an algorithm that efficiently finds all INDs in a given relational database. It leverages the sorting facilities of DBMS but performs the actual comparisons outside of the database to save computation. Spider analyzes very large databases up to an order of magnitude faster than previous approaches. We also evaluate in detail the effectiveness of several heuristics to reduce the number of necessary comparisons. Furthermore, we generalize Spider to find composite INDs covering multiple attributes, and partial INDs, which are true INDs for all but a certain number of values. This last type is particularly relevant when integrating dirty data as is often the case in the life sciences domain - our driving motivation.
Preface
(2010)
The workshops on (constraint) logic programming (WLP) are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence and operations research. In this decade, previous workshops took place in Dresden (2008), Würzburg (2007), Vienna (2006), Ulm (2005), Potsdam (2004), Dresden (2002), Kiel (2001), and Würzburg (2000). Contributions to workshops deal with all theoretical, experimental, and application aspects of constraint programming (CP) and logic programming (LP), including foundations of constraint/ logic programming. Some of the special topics are constraint solving and optimization, extensions of functional logic programming, deductive databases, data mining, nonmonotonic reasoning, , interaction of CP/LP with other formalisms like agents, XML, JAVA, program analysis, program transformation, program verification, meta programming, parallelism and concurrency, answer set programming, implementation and software techniques (e.g., types, modularity, design patterns), applications (e.g., in production, environment, education, internet), constraint/logic programming for semantic web systems and applications, reasoning on the semantic web, data modelling for the web, semistructured data, and web query languages.
In this paper we consider a simple syntactic extension of Answer Set Programming (ASP) for dealing with (nested) existential quantifiers and double negation in the rule bodies, in a close way to the recent proposal RASPL-1. The semantics for this extension just resorts to Equilibrium Logic (or, equivalently, to the General Theory of Stable Models), which provides a logic-programming interpretation for any arbitrary theory in the syntax of Predicate Calculus. We present a translation of this syntactic class into standard logic programs with variables (either disjunctive or normal, depending on the input rule heads), as those allowed by current ASP solvers. The translation relies on the introduction of auxiliary predicates and the main result shows that it preserves strong equivalence modulo the original signature.
We propose a paraconsistent declarative semantics of possibly inconsistent generalized logic programs which allows for arbitrary formulas in the body and in the head of a rule (i.e. does not depend on the presence of any specific connective, such as negation(-as-failure), nor on any specific syntax of rules). For consistent generalized logic programs this semantics coincides with the stable generated models introduced in [HW97], and for normal logic programs it yields the stable models in the sense of [GL88].
A wide range of additional forward chaining applications could be realized with deductive databases, if their rule formalism, their immediate consequence operator, and their fixpoint iteration process would be more flexible. Deductive databases normally represent knowledge using stratified Datalog programs with default negation. But many practical applications of forward chaining require an extensible set of user–defined built–in predicates. Moreover, they often need function symbols for building complex data structures, and the stratified fixpoint iteration has to be extended by aggregation operations. We present an new language Datalog*, which extends Datalog by stratified meta–predicates (including default negation), function symbols, and user–defined built–in predicates, which are implemented and evaluated top–down in Prolog. All predicates are subject to the same backtracking mechanism. The bottom–up fixpoint iteration can aggregate the derived facts after each iteration based on user–defined Prolog predicates.