004 Datenverarbeitung; Informatik
Refine
Year of publication
Document Type
- Article (80) (remove)
Language
- English (80) (remove)
Keywords
- Computer Science Education (4)
- Competence Measurement (3)
- Secondary Education (3)
- Big Data (2)
- Competence Modelling (2)
- Computational thinking (2)
- Informatics Education (2)
- Informatics Modelling (2)
- Informatics System Application (2)
- Informatics System Comprehension (2)
- Machine learning (2)
- computational thinking (2)
- knowledge representation and nonmonotonic reasoning (2)
- (FPGA) (1)
- 21st century skills, (1)
- ABRACADABRA (1)
- Achievement (1)
- Activity Theory (1)
- Activity-orientated Learning (1)
- Advanced Video Codec (AVC) (1)
- Animal building (1)
- Arduino (1)
- Assessment (1)
- Augmented and virtual reality (1)
- Austria (1)
- Automated Theorem Proving (1)
- Automatically controlled windows (1)
- Automatisches Beweisen (1)
- Bean (1)
- Bloom’s Taxonomy (1)
- CS concepts (1)
- Capability approach (1)
- Challenges (1)
- Clause Learning (1)
- Cognitive Skills (1)
- Competences (1)
- Competencies (1)
- Computational Thinking (1)
- Computer Science (1)
- Computer Science in Context (1)
- Computing (1)
- Contest (1)
- Contextualisation (1)
- Contradictions (1)
- Convolution (1)
- Curriculum (1)
- Curriculum Development (1)
- Customer ownership (1)
- DPLL (1)
- Data Analysis (1)
- Data Management (1)
- Data Privacy (1)
- Databases (1)
- Defining characteristics of physical computing (1)
- Digital Competence (1)
- Digital Education (1)
- Digital Revolution (1)
- Digital image analysis (1)
- Digitalization (1)
- Dynamic assessment (1)
- Early Literacy (1)
- Educational Standards (1)
- Educational software (1)
- Embedded Systems (1)
- Euclid’s algorithm (1)
- FPGA (1)
- Facebook (1)
- Feature extraction (1)
- Fibonacci numbers (1)
- Field programmable gate arrays (1)
- Finite automata (1)
- Function (1)
- Fundamental Ideas (1)
- Graphensuche (1)
- H.264 (1)
- Hardware accelerator (1)
- Histograms (1)
- ICT Competence (1)
- ICT competencies (1)
- ICT skills (1)
- Image resolution (1)
- Imperative calculi (1)
- Improving classroom (1)
- Inference (1)
- Informatics (1)
- Inquiry-based Learning (1)
- Insurance industry (1)
- Interface design (1)
- Kernel (1)
- Key Competencies (1)
- Klausellernen (1)
- Learners (1)
- Learning Fields (1)
- Learning ecology (1)
- Learning interfaces development (1)
- Learning with ICT (1)
- Lindenmayer systems (1)
- Logarithm (1)
- Loss (1)
- Low Latency (1)
- Lower Secondary Level (1)
- MOOCs (1)
- Machine Learning (1)
- Massive Open Online Courses (1)
- Measurement (1)
- Media in education (1)
- Multi-sided platforms (1)
- Music Technology (1)
- NUI (1)
- Natural Science Education (1)
- Natural ventilation (1)
- NoSQL (1)
- Norway (1)
- Novice programmers (1)
- Optimization (1)
- Pedagogical content knowledge (1)
- Pedagogical issues (1)
- Physical Science (1)
- Plant identification (1)
- Preprocessing (1)
- Problem Solving (1)
- Random access memory (1)
- Recommendations for CS-Curricula in Higher Education (1)
- Region of Interest (1)
- Relevanz (1)
- Reversibility (1)
- SAT (1)
- Scale-invariant feature transform (SIFT) (1)
- Sensors (1)
- Sharing (1)
- Signal processing (1)
- Simulations (1)
- Single event upsets (1)
- Small Private Online Courses (1)
- Social (1)
- Systems of parallel communicating (1)
- Tasks (1)
- Teacher perceptions (1)
- Teachers (1)
- Teaching information security (1)
- Technology proficiency (1)
- Terminology (1)
- Tests (1)
- Theorembeweisen (1)
- Theory (1)
- Type and effect systems (1)
- UX (1)
- Unifikation (1)
- VGG16 (1)
- Value network (1)
- Vocational Education (1)
- Young People (1)
- abstraction (1)
- action and change (1)
- algorithms (1)
- analogical thinking (1)
- answer set programming (1)
- architecture (1)
- automata (1)
- automated planning (1)
- bibliometric analysis (1)
- binary representation (1)
- binary search (1)
- citation analysis (1)
- classroom language (1)
- co-citation analysis (1)
- co-occurrence analysis (1)
- cognitive modifiability (1)
- combined task and motion planning (1)
- competence (1)
- competencies (1)
- competency (1)
- complexity (1)
- comprehension (1)
- computer science education (1)
- computer science teachers (1)
- computer vision (1)
- cs4fn (1)
- curriculum theory (1)
- determinism (1)
- developmental systems (1)
- digitally-enabled pedagogies (1)
- divide and conquer (1)
- e-mentoring (1)
- education (1)
- education and public policy (1)
- educational programming (1)
- educational systems (1)
- edutainment (1)
- environments (1)
- exponentiation (1)
- field-programmable gate array (1)
- formal languages (1)
- fun (1)
- functions (1)
- graph-search (1)
- hardware accelerator (1)
- hardware architecture (1)
- high school (1)
- higher (1)
- image processing (1)
- informal and formal learning (1)
- informatics education (1)
- innovation (1)
- interactive course (1)
- interactive workshop (1)
- key competences in physical computing (1)
- key competencies (1)
- kinaesthetic teaching (1)
- learning (1)
- logic programming methodology and applications (1)
- machine learning (1)
- machine learning algorithms (1)
- manipulation planning (1)
- mediated learning experience (1)
- mobile learning (1)
- mobile technologies and apps (1)
- monitoring (1)
- networks (1)
- online learning (1)
- operating system (1)
- organisational evolution (1)
- paper prototyping (1)
- parallel processing (1)
- parallel rewriting (1)
- parameter (1)
- pedagogy (1)
- personal (1)
- personal response systems (1)
- philosophical foundation of informatics pedagogy (1)
- physical computing tools (1)
- pre-primary level (1)
- predictive models (1)
- preprocessing (1)
- primary education (1)
- primary level (1)
- problem-solving (1)
- professional development (1)
- programming (1)
- programming in context (1)
- real-time (1)
- relevance (1)
- reliability (1)
- restricted parallelism (1)
- secondary computer science education (1)
- secondary education (1)
- self-adaptive multiprocessing system (1)
- self-efficacy (1)
- single event upset (1)
- social media (1)
- solar particle event (1)
- space missions (1)
- student activation (1)
- student experience (1)
- student perceptions (1)
- students’ conceptions (1)
- students’ knowledge (1)
- teacher competencies (1)
- teaching (1)
- teaching informatics in general education (1)
- technical notes and rapid communications (1)
- theorem (1)
- theory (1)
- tools (1)
- tracing (1)
- unification (1)
- user experience (1)
- user-centred (1)
- virtual reality (1)
- ‘unplugged’ computing (1)
Institute
- Institut für Informatik und Computational Science (80) (remove)
A survey has been carried out in the Computer Science (CS) department at the University of Baghdad to investigate the attitudes of CS students in a female dominant environment, showing the differences between male and female students in different academic years. We also compare the attitudes of the freshman students of two different cultures (University of Baghdad, Iraq, and the University of Potsdam).
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.
Regardless of what is intended by government curriculum
specifications and advised by educational experts, the competencies
taught and learned in and out of classrooms can vary considerably.
In this paper, we discuss in particular how we can investigate the
perceptions that individual teachers have of competencies in ICT,
and how these and other factors may influence students’ learning. We
report case study research which identifies contradictions within the
teaching of ICT competencies as an activity system, highlighting issues
concerning the object of the curriculum, the roles of the participants and
the school cultures. In a particular case, contradictions in the learning
objectives between higher order skills and the use of application tools
have been resolved by a change in the teacher’s perceptions which
have not led to changes in other aspects of the activity system. We look
forward to further investigation of the effects of these contradictions in
other case studies and on forthcoming curriculum change.
Through the use of next generation sequencing (NGS) technology, a lot of newly sequenced organisms are now available. Annotating those genes is one of the most challenging tasks in sequence biology. Here, we present an automated workflow to find homologue proteins, annotate sequences according to function and create a three-dimensional model.
We introduce a new measure of descriptional complexity on finite automata, called the number of active states. Roughly speaking, the number of active states of an automaton A on input w counts the number of different states visited during the most economic computation of the automaton A for the word w. This concept generalizes to finite automata and regular languages in a straightforward way. We show that the number of active states of both finite automata and regular languages is computable, even with respect to nondeterministic finite automata. We further compare the number of active states to related measures for regular languages. In particular, we show incomparability to the radius of regular languages and that the difference between the number of active states and the total number of states needed in finite automata for a regular language can be of exponential order.
M-rate 0L systems are interactionless Lindenmayer systems together with a function assigning to every string a set of multisets of productions that may be applied simultaneously to the string. Some questions that have been left open in the forerunner papers are examined, and the computational power of deterministic M-rate 0L systems is investigated, where also tabled and extended variants are taken into consideration.
We study the concept of reversibility in connection with parallel communicating systems of finite automata (PCFA in short). We define the notion of reversibility in the case of PCFA (also covering the non-deterministic case) and discuss the relationship of the reversibility of the systems and the reversibility of its components. We show that a system can be reversible with non-reversible components, and the other way around, the reversibility of the components does not necessarily imply the reversibility of the system as a whole. We also investigate the computational power of deterministic centralized reversible PCFA. We show that these very simple types of PCFA (returning or non-returning) can recognize regular languages which cannot be accepted by reversible (deterministic) finite automata, and that they can even accept languages that are not context-free. We also separate the deterministic and non-deterministic variants in the case of systems with non-returning communication. We show that there are languages accepted by non-deterministic centralized PCFA, which cannot be recognized by any deterministic variant of the same type.
Computational Thinking
(2015)
Digital technology has radically changed the way people
work in industry, finance, services, media and commerce. Informatics
has contributed to the scientific and technological development of our
society in general and to the digital revolution in particular. Computational
thinking is the term indicating the key ideas of this discipline that
might be included in the key competencies underlying the curriculum
of compulsory education. The educational potential of informatics has
a history dating back to the sixties. In this article, we briefly revisit this
history looking for lessons learned. In particular, we focus on experiences
of teaching and learning programming. However, computational
thinking is more than coding. It is a way of thinking and practicing interactive
dynamic modeling with computers. We advocate that learners
can practice computational thinking in playful contexts where they can
develop personal projects, for example building videogames and/or robots,
share and discuss their construction with others. In our view, this
approach allows an integration of computational thinking in the K-12
curriculum across disciplines.
In control theory, to solve a finite-horizon sequential decision problem (SDP) commonly means to find a list of decision rules that result in an optimal expected total reward (or cost) when taking a given number of decision steps. SDPs are routinely solved using Bellman's backward induction. Textbook authors (e.g. Bertsekas or Puterman) typically give more or less formal proofs to show that the backward induction algorithm is correct as solution method for deterministic and stochastic SDPs. Botta, Jansson and Ionescu propose a generic framework for finite horizon, monadic SDPs together with a monadic version of backward induction for solving such SDPs. In monadic SDPs, the monad captures a generic notion of uncertainty, while a generic measure function aggregates rewards. In the present paper, we define a notion of correctness for monadic SDPs and identify three conditions that allow us to prove a correctness result for monadic backward induction that is comparable to textbook correctness proofs for ordinary backward induction. The conditions that we impose are fairly general and can be cast in category-theoretical terms using the notion of Eilenberg-Moore algebra. They hold in familiar settings like those of deterministic or stochastic SDPs, but we also give examples in which they fail. Our results show that backward induction can safely be employed for a broader class of SDPs than usually treated in textbooks. However, they also rule out certain instances that were considered admissible in the context of Botta et al. 's generic framework. Our development is formalised in Idris as an extension of the Botta et al. framework and the sources are available as supplementary material.