| 1. |
- Atig, Mohamed Faouzi, et al.
(författare)
-
Activity profiles in online social media
- 2014
-
Ingår i: Proc. 6th International Conference on Advances in Social Networks Analysis and Mining. - : IEEE Computer Society. - 9781479958771 ; , s. 850-855
-
Konferensbidrag (refereegranskat)
|
|
| 2. |
- Cassel, Sofia, et al.
(författare)
-
A structured approach to training open-ended problem solving
- 2015
-
Ingår i: Proc. 45th ASEE/IEEE Frontiers in Education Conference. - Piscataway, NJ : IEEE Press. - 9781479984534 ; , s. 417-420
-
Konferensbidrag (refereegranskat)abstract
- Students in engineering are well trained in solving specified problems, but some have trouble when given problems where there is more than one solution. In their professional life they are much more often confronted with open-ended problems, where there may be more than one solution, and where there may be many ways to reach each one. The goals may be vague, the problem may be underspecified, and the fresh graduate frustrated by the new situation.We present a structured approach to training students in open-ended problem solving. We have introduced a half-day workshop to help students learn to work with open-ended, ill-structured problems, using a different approach than they would for the well-structured problems they are used to.Our results indicate that students have become more creative. Compared to previous years, the students explore more paths towards the goal, and use more elaborate methods. Their approach is similar to that typically used by the best students in previous instances of the course. Students mention creativity and group dynamics as positive aspects of the workshop and the following lab.We conclude that with proper guidance and training, even weaker students can become more creative when solving open-ended problems.
|
|
| 3. |
- Cassel, Sofia, et al.
(författare)
-
A succinct canonical register automaton model
- 2015
-
Ingår i: Journal of Logical and Algebraic Methods in Programming. - : Elsevier BV. - 2352-2208. ; 84:1, s. 54-66
-
Tidskriftsartikel (refereegranskat)
|
|
| 4. |
- Cassel, Sofia, et al.
(författare)
-
A succinct canonical register automaton model
- 2011
-
Ingår i: Automated Technology for Verification and Analysis. - Berlin : Springer-Verlag. - 9783642243714 ; , s. 366-380
-
Konferensbidrag (refereegranskat)abstract
- We present a novel canonical automaton model, based on register automata, that can easily be used to specify protocol or program behavior. More concretely, register automata are reminiscent of controlflow graphs: they comprise a finite control structure, assignments, and conditionals, allowing to assign values of an infinite domain to regis-ters (variables) and to compare them for equality. A major contributionis the definition of a canonical automaton representation of any lan-guage recognizable by a deterministic register automaton, by means of aNerode congruence. Not only is this canonical form easier to comprehend than previous proposals, but it can also be exponentially more succinct than these. Key to the canonical form is the symbolic treatment of data languages, which overcomes the structural restrictions in previous formalisms, and opens the way to new practical applications.
|
|
| 5. |
- Cassel, Sofia, et al.
(författare)
-
A Succinct Canonical Register Automaton Model
- 2013
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- We present a novel canonical automaton model, based on register automata, that can be used to specify protocol or program behavior. Register automata have a finite control structure and a finite number of registers (variables), and process sequences of terms that carry data values from an infinite domain. We consider register automata that compare data values for equality. A major contribution is the definition of a canonical automaton representation of any language recognizable by a deterministic register automaton, by means of a Nerode congruence. This canonical form is well suited for modeling, e.g., protocols or program behavior. Our model can be exponentially more succinct than previous proposals, since it filters out 'accidental' relations between data values. This opens the way to new practical applications, e.g., in automata learning.
|
|
| 6. |
- Cassel, Sofia, et al.
(författare)
-
A succinct canonical register automaton model for data domains with binary relations
- 2012
-
Ingår i: Automated Technology for Verification and Analysis. - Springer : Springer Berlin Heidelberg. - 9783642333859 ; , s. 57-71
-
Konferensbidrag (refereegranskat)abstract
- We present a novel canonical automaton model for languages over infinite data domains, that is suitable for specifying the behavior of services, protocol components, interfaces, etc. The model is based on register automata. A major contribution is a construction of succinct canonical register automata, which is parameterized on the set of relations by which elements in the data domain can be compared. We also present a Myhill Nerode-like theorem, from which minimal canonical automata can be constructed. This canonical form is as expressive as general deterministic register automata, but much better suited for modeling in practice since we lift many of the restrictions on the way variables can be accesed and stored: this allows our automata to be significantly more succinct than previously proposed canonical forms. Key to the canonical form is a symbolic treatment of data languages, which allows us to construct minimal representations whenever the set of relations can be equipped with a so-called branching framework.
|
|
| 7. |
|
|
| 8. |
- Cassel, Sofia, et al.
(författare)
-
Determining progress in writing competency by assessing students’ argumentation
- 2016
-
Ingår i: Proc. 46th ASEE/IEEE Frontiers in Education Conference. - Piscataway, NJ : IEEE Press. - 9781509017904
-
Konferensbidrag (refereegranskat)abstract
- A problem when it comes to evaluating the quality of education in professional competencies, such as writing skills, is being able to detect and measure progression. We have previously defined course level based learning outcomes for academic writing competency in computer science; these are used in a writing across the curriculum (WAC), in the discipline (WID) program. However, in order to assess whether the program is effective, i.e., that the participating students' writing skills progress throughout the education, we need a different set of criteria. Such criteria must capture the quality of the text from an academic perspective. They must also be easy to evaluate, and it must be possible to compare evaluations of different texts.There are many, sometimes conflicting, definitions of what 'good academic writing' or 'quality' in academic communication is. In this paper, we have defined it in terms of how the material is structured, how well arguments are presented, and how critical thinking is used to strengthen arguments. Following this definition, it is clear that argumentative skills can be used as an indicator of quality in academic communication. Our criteria for measuring writing competency are thus heavily based on assessing students' use of argumentative skills in written texts and are similar to criteria previously used to assess the quality of student participation in classroom discussions.This paper presents a framework for quantitative and qualitative evaluation of texts written by computer science students. We have related the criteria in our framework to general definitions of academic writing, and to our previously defined goals for writing competencies. The framework provides a grading scheme that can be used to assign a score to a text, corresponding to the level of academic quality exhibited in that text. The results of our framework thus enables comparisons between different student texts. We have used the framework to evaluate writing progression for a group of IT engineering students over three years.
|
|
| 9. |
- Cassel, Sofia, et al.
(författare)
-
Enhanced learning by promoting engineering competencies
- 2014
-
Ingår i: Proc. 44th ASEE/IEEE Frontiers in Education Conference. - Piscataway, NJ : IEEE Press. - 9781479939213 ; , s. 2044-2049
-
Konferensbidrag (refereegranskat)abstract
- An engineering graduate needs to master a number of important skills: problem solving, critical thinking, communication, collaboration, etc. In this paper we describe how a course in computer security, taught in the Computer and Information Engineering programme at Uppsala University, has been developed over a period of three years. The aim is to better develop the engineering competencies of students, improving their understanding of course contents, training their ability to reflect on it, and to apply their knowledge when facing realistic problems.The course is designed to activate students, based on practical labs and theoretical tasks which are solved in groups. The student reports are assessed at seminars, where the solutions are presented orally, peer-reviewed and discussed. The seminars encourage and reward activities at the higher levels of taxonomies such as Bloom's.The results of the development, based on a CEQ-based course evaluation, indicate that students take a deeper approach to learning. They develop their problem-solving skills to a high degree, appreciate the practical solving of open-ended problems, and take responsibility for collaborative learning. Their overall satisfaction with the course is quite high, despite indications that they find the workload high.
|
|
| 10. |
- Cassel, Sofia, et al.
(författare)
-
Extending Automata Learning to Extended Finite State Machines
- 2018
-
Ingår i: Machine Learning for Dynamic Software Analysis. - Cham : Springer. - 9783319965628 - 9783319965611 ; , s. 149-177
-
Konferensbidrag (refereegranskat)abstract
- Automata learning is an established class of techniques for inferring automata models by observing how they respond to a sample of input words. Recently, approaches have been presented that extend these techniques to infer extended finite state machines (EFSMs) by dynamic black-box analysis. EFSMs model both data flow and control behavior, and their mutual interaction. Different dialects of EFSMs are widely used in tools for model-based software development, verification, and testing. This survey paper presents general principles behind some of these recent extensions. The goal is to elucidate how the principles behind classic automata learning can be maintained and guide extensions to more general automata models, and to situate some extensions with respect to these principles.
|
|
