TY  - JOUR
A1  - Dimopoulos, Yannis
A1  - Gebser, Martin
A1  - Lühne, Patrick
A1  - Romero Davila, Javier
A1  - Schaub, Torsten
T1  - plasp 3
BT  - Towards Effective ASP Planning
JF  - Theory and practice of logic programming
N2  - We describe the new version of the Planning Domain Definition Language (PDDL)-to-Answer Set Programming (ASP) translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by Satisfiability Testing (SAT) planning and others exploiting ASP features such as well-foundedness. All of them are designed for handling multivalued fluents in order to capture both PDDL as well as SAS planning formats. Third, enabled by multishot ASP solving, it offers advanced planning algorithms also borrowed from SAT planning. As a result, plasp provides us with an ASP-based framework for studying a variety of planning techniques in a uniform setting. Finally, we demonstrate in an empirical analysis that these techniques have a significant impact on the performance of ASP planning.
KW  - knowledge representation and nonmonotonic reasoning
KW  - technical notes and rapid communications
KW  - answer set programming
KW  - automated planning
KW  - action and change
Y1  - 2019
U6  - https://doi.org/10.1017/S1471068418000583
SN  - 1471-0684
SN  - 1475-3081
VL  - 19
IS  - 3
SP  - 477
EP  - 504
PB  - Cambridge Univ. Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Diethelm, Ira
A1  - Syrbe, Jörn
T1  - Let’s talk about CS!
BT  - Towards a suitable Classroom Language and Terminology of CS for Teaching
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
N2  - To communicate about a science is the most important key
competence in education for any science. Without communication we
cannot teach, so teachers should reflect about the language they use in
class properly. But the language students and teachers use to communicate
about their CS courses is very heterogeneous, inconsistent and
deeply influenced by tool names. There is a big lack of research and
discussion in CS education regarding the terminology and the role of
concepts and tools in our science. We don’t have a consistent set of
terminology that we agree on to be helpful for learning our science.
This makes it nearly impossible to do research on CS competencies as
long as we have not agreed on the names we use to describe these. This
workshop intends to provide room to fill with discussion and first ideas
for future research in this field.
KW  - Terminology
KW  - classroom language
KW  - CS concepts
KW  - competencies
KW  - tools
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82983
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 411
EP  - 414
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Delgado Kloos, Carlos
T1  - What about the Competencies of Educators in the New Era of Digital Education?
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
N2  - A lot has been published about the competencies needed by
students in the 21st century (Ravenscroft et al., 2012). However, equally
important are the competencies needed by educators in the new era
of digital education. We review the key competencies for educators in
light of the new methods of teaching and learning proposed by Massive
Open Online Courses (MOOCs) and their on-campus counterparts,
Small Private Online Courses (SPOCs).
KW  - Massive Open Online Courses
KW  - Small Private Online Courses
KW  - Competencies
KW  - Digital Education
KW  - Digital Revolution
KW  - Big Data
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-83015
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 435
EP  - 438
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Dagiene, Valentina
A1  - Stupuriene, Gabriele
T1  - Informatics Education based on Solving Attractive Tasks through a Contest
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
N2  - The paper discusses the issue of supporting informatics
(computer science) education through competitions for lower and
upper secondary school students (8–19 years old). Competitions play
an important role for learners as a source of inspiration, innovation,
and attraction. Running contests in informatics for school students
for many years, we have noticed that the students consider the contest
experience very engaging and exciting as well as a learning experience.
A contest is an excellent instrument to involve students in problem
solving activities. An overview of infrastructure and development
of an informatics contest from international level to the national one
(the Bebras contest on informatics and computer fluency, originated
in Lithuania) is presented. The performance of Bebras contests in 23
countries during the last 10 years showed an unexpected and unusually
high acceptance by school students and teachers. Many thousands of
students participated and got a valuable input in addition to their regular
informatics lectures at school. In the paper, the main attention is paid
to the developed tasks and analysis of students’ task solving results in
Lithuania.
KW  - Informatics Education
KW  - Computer Science Education
KW  - Tasks
KW  - Tests
KW  - Contest
KW  - Problem Solving
KW  - Cognitive Skills
KW  - Bloom’s Taxonomy
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82626
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 97
EP  - 115
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Curzon, Paul
T1  - Unplugged Computational Thinking for Fun
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
N2  - Computational thinking is a fundamental skill set that is learned
by studying Informatics and ICT. We argue that its core ideas can
be introduced in an inspiring and integrated way to both teachers and
students using fun and contextually rich cs4fn ‘Computer Science for
Fun’ stories combined with ‘unplugged’ activities including games and
magic tricks. We also argue that understanding people is an important
part of computational thinking. Computational thinking can be fun for
everyone when taught in kinaesthetic ways away from technology.
KW  - Computational thinking
KW  - cs4fn
KW  - ‘unplugged’ computing
KW  - kinaesthetic teaching
KW  - fun
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82575
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 15
EP  - 27
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Christensen, Rhonda
A1  - Knezek, Gerald
T1  - The Technology Proficiency Self-Assessment Questionnaire (TPSA)
BT  - Evolution of a Self-Efficacy Measure for Technology Integration
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
N2  - The Technology Proficiency Self-Assessment (TPSA) questionnaire
has been used for 15 years in the USA and other nations as a
self-efficacy measure for proficiencies fundamental to effective technology
integration in the classroom learning environment. Internal consistency
reliabilities for each of the five-item scales have typically ranged
from .73 to .88 for preservice or inservice technology-using teachers.
Due to changing technologies used in education, researchers sought to
renovate partially obsolete items and extend self-efficacy assessment to
new areas, such as social media and mobile learning. Analysis of 2014
data gathered on a new, 34 item version of the TPSA indicates that the
four established areas of email, World Wide Web (WWW), integrated
applications, and teaching with technology continue to form consistent
scales with reliabilities ranging from .81 to .93, while the 14 new items
gathered to represent emerging technologies and media separate into
two scales, each with internal consistency reliabilities greater than .9.
The renovated TPSA is deemed to be worthy of continued use in the
teaching with technology context.
KW  - Technology proficiency
KW  - self-efficacy
KW  - teacher competencies
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82838
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 311
EP  - 318
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Chen, Junchao
A1  - Lange, Thomas
A1  - Andjelkovic, Marko
A1  - Simevski, Aleksandar
A1  - Lu, Li
A1  - Krstić, Miloš
T1  - Solar particle event and single event upset prediction from SRAM-based monitor and supervised machine learning
JF  - IEEE transactions on emerging topics in computing / IEEE Computer Society, Institute of Electrical and Electronics Engineers
N2  - The intensity of cosmic radiation may differ over five orders of magnitude within a few hours or days during the Solar Particle Events (SPEs), thus increasing for several orders of magnitude the probability of Single Event Upsets (SEUs) in space-borne electronic systems. Therefore, it is vital to enable the early detection of the SEU rate changes in order to ensure timely activation of dynamic radiation hardening measures. In this paper, an embedded approach for the prediction of SPEs and SRAM SEU rate is presented. The proposed solution combines the real-time SRAM-based SEU monitor, the offline-trained machine learning model and online learning algorithm for the prediction. With respect to the state-of-the-art, our solution brings the following benefits: (1) Use of existing on-chip data storage SRAM as a particle detector, thus minimizing the hardware and power overhead, (2) Prediction of SRAM SEU rate one hour in advance, with the fine-grained hourly tracking of SEU variations during SPEs as well as under normal conditions, (3) Online optimization of the prediction model for enhancing the prediction accuracy during run-time, (4) Negligible cost of hardware accelerator design for the implementation of selected machine learning model and online learning algorithm. The proposed design is intended for a highly dependable and self-adaptive multiprocessing system employed in space applications, allowing to trigger the radiation mitigation mechanisms before the onset of high radiation levels.
KW  - Machine learning
KW  - Single event upsets
KW  - Random access memory
KW  - monitoring
KW  - machine learning algorithms
KW  - predictive models
KW  - space missions
KW  - solar particle event
KW  - single event upset
KW  - machine learning
KW  - online learning
KW  - hardware accelerator
KW  - reliability
KW  - self-adaptive multiprocessing system
Y1  - 2022
U6  - https://doi.org/10.1109/TETC.2022.3147376
SN  - 2168-6750
VL  - 10
IS  - 2
SP  - 564
EP  - 580
PB  - Institute of Electrical and Electronics Engineers
CY  - [New York, NY]
ER  - 
TY  - JOUR
A1  - Cabalar, Pedro
A1  - Fandiño, Jorge
A1  - Fariñas del Cerro, Luis
T1  - Splitting epistemic logic programs
JF  - Theory and practice of logic programming / publ. for the Association for Logic Programming
N2  - Epistemic logic programs constitute an extension of the stable model semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some objective literal is true in all or some stable models. As it can be imagined, the associated semantics has proved to be non-trivial, since the truth of subjective literals may interfere with the set of stable models it is supposed to query. As a consequence, no clear agreement has been reached and different semantic proposals have been made in the literature. Unfortunately, comparison among these proposals has been limited to a study of their effect on individual examples, rather than identifying general properties to be checked. In this paper, we propose an extension of the well-known splitting property for logic programs to the epistemic case. We formally define when an arbitrary semantics satisfies the epistemic splitting property and examine some of the consequences that can be derived from that, including its relation to conformant planning and to epistemic constraints. Interestingly, we prove (through counterexamples) that most of the existing approaches fail to fulfill the epistemic splitting property, except the original semantics proposed by Gelfond 1991 and a recent proposal by the authors, called Founded Autoepistemic Equilibrium Logic.
KW  - knowledge representation and nonmonotonic reasoning
KW  - logic programming methodology and applications
KW  - theory
Y1  - 2021
U6  - https://doi.org/10.1017/S1471068420000058
SN  - 1471-0684
SN  - 1475-3081
VL  - 21
IS  - 3
SP  - 296
EP  - 316
PB  - Cambridge Univ. Press
CY  - Cambridge [u.a.]
ER  - 
TY  - JOUR
A1  - Büchner, Steffen
T1  - Empirical and Normative Research on Fundamental Ideas of Embedded System Development
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
KW  - Theory
KW  - Embedded Systems
KW  - Fundamental Ideas
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82949
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 393
EP  - 396
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Bröker, Kathrin
A1  - Kastens, Uwe
A1  - Magenheim, Johannes
T1  - Competences of Undergraduate Computer Science Students
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
N2  - The paper presents two approaches to the development of
a Computer Science Competence Model for the needs of curriculum
development and evaluation in Higher Education. A normativetheoretical
approach is based on the AKT and ACM/IEEE curriculum
and will be used within the recommendations of the German
Informatics Society (GI) for the design of CS curricula. An empirically
oriented approach refines the categories of the first one with regard to
specific subject areas by conducting content analysis on CS curricula of
important universities from several countries. The refined model will be
used for the needs of students’ e-assessment and subsequent affirmative
action of the CS departments.
KW  - Competences
KW  - Competence Measurement
KW  - Curriculum Development
KW  - Computer Science Education
KW  - Recommendations for CS-Curricula in Higher Education
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82613
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 77
EP  - 96
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  - Brede, Nuria
A1  - Botta, Nicola
T1  - On the correctness of monadic backward induction
JF  - Journal of functional programming
N2  - 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.
Y1  - 2021
U6  - https://doi.org/10.1017/S0956796821000228
SN  - 1469-7653
SN  - 0956-7968
VL  - 31
PB  - Cambridge University Press
CY  - Cambridge
ER  - 
TY  - JOUR
A1  - Bottino, Rosa
A1  - Chioccariello, Augusto
T1  - Computational Thinking
BT  - Videogames, Educational Robotics, and other Powerful Ideas to Think with
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
N2  - 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.
KW  - Computational thinking
KW  - programming in context
KW  - informatics education
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82820
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 301
EP  - 309
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Bordihn, Henning
A1  - Vaszil, György
T1  - Deterministic Lindenmayer systems with dynamic control of parallelism
JF  - International journal of foundations of computer science
N2  - 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.
KW  - parallel rewriting
KW  - Lindenmayer systems
KW  - restricted parallelism
KW  - determinism
KW  - developmental systems
KW  - formal languages
Y1  - 2019
U6  - https://doi.org/10.1142/S0129054120400031
SN  - 0129-0541
SN  - 1793-6373
VL  - 31
IS  - 1
SP  - 37
EP  - 51
PB  - World Scientific
CY  - Singapore
ER  - 
TY  - JOUR
A1  - Bordihn, Henning
A1  - Vaszil, György
T1  - Reversible parallel communicating finite automata systems
JF  - Acta informatica
N2  - 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.
KW  - Finite automata
KW  - Reversibility
KW  - Systems of parallel communicating
KW  - automata
Y1  - 2021
U6  - https://doi.org/10.1007/s00236-021-00396-9
SN  - 0001-5903
SN  - 1432-0525
VL  - 58
IS  - 4
SP  - 263
EP  - 279
PB  - Springer
CY  - Berlin ; Heidelberg ; New York, NY
ER  - 
TY  - JOUR
A1  - Bordihn, Henning
A1  - Holzer, Markus
T1  - On the number of active states in finite automata
JF  - Acta informatica
N2  - 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.
Y1  - 2021
U6  - https://doi.org/10.1007/s00236-021-00397-8
SN  - 0001-5903
SN  - 1432-0525
VL  - 58
IS  - 4
SP  - 301
EP  - 318
PB  - Springer
CY  - Berlin ; Heidelberg [u.a.]
ER  - 
TY  - JOUR
A1  - Blaese, Leif
T1  - Data mining for unidentified protein squences
JF  - Process design for natural scientists: an agile model-driven approach
N2  - 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.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 73
EP  - 87
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Barnes, Jan
A1  - Kennewell, Steve
T1  - Teacher Perceptions of Key Competencies in ICT
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
N2  - 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.
KW  - ICT competencies
KW  - Teacher perceptions
KW  - Activity Theory
KW  - Contradictions
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82604
SN  - 1868-0844
SN  - 2191-1940
IS  - 7
SP  - 61
EP  - 75
PB  - Universitätsverlag Potsdam
CY  - Potsdam
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  - Al-Saffar, Loay Talib Ahmed
T1  - Where girls take the role of boys in CS
BT  - attitudes of CS students in a female-dominated environment
JF  - Commentarii informaticae didacticae : (CID)
N2  - 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).
Y1  - 2013
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-65034
SN  - 1868-0844
SN  - 2191-1940
IS  - 5
SP  - 149
EP  - 154
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  -