| 1. |
- Aad, G., et al.
(författare)
-
- 2015
-
Tidskriftsartikel (refereegranskat)
|
|
| 2. |
- Aad, G., et al.
(författare)
-
- 2011
-
swepub:Mat__t (refereegranskat)
|
|
| 3. |
- Aad, G., et al.
(författare)
-
- 2015
-
Ingår i: Physical Review Letters. - 1079-7114 .- 0031-9007. ; 115:9
-
Tidskriftsartikel (refereegranskat)
|
|
| 4. |
- Bommenel, Elin, et al.
(författare)
-
Using teaching and learning regimes in the international classroom to encourage student re-subjectification
- 2023
-
Ingår i: Journal of Applied Learning & Teaching. - : Kaplan Higher Education Academy. - 2591-801X. ; 6:1, s. 81-92
-
Tidskriftsartikel (refereegranskat)abstract
- This paper addresses one of the pedagogical challenges that followed the presence of increasingly multinational student groups, particularly the increased diversity of academic backgrounds among students. Theoretically, this challenge can be understood as an encounter between different teaching and learning regimes (TLRs). TLR, coined by Trowler and Cooper (2002), implies a constellation of assumptions, rules, relationships, and practices regarding the conduct of higher education that colours academic staff members’ performance in their profession. It has become a widely used heuristic tool in the reflection process among university staff. It is shown in this paper that TLRs are not only a heuristic tool that can be applied in teacher reflection but may also be fruitfully applied in the classroom in student-teacher interaction. Consequently, we decided to bring the TLR into the classroom. The written student reflections constitute the empirical material that this analysis is based on. We approach these reflections as expressions of confessions of the Self, as laid out by Michel Foucault. We conclude that it is useful for the students to reflect upon TLR’s, but simultaneously, such an approach runs the risk of enhancing pedagogical and epistemological conformism at the neoliberal university.
|
|
| 5. |
|
|
| 6. |
- Coradeschi, Silvia, et al.
(författare)
-
Integration of vision and decision-making in an autonomous airborne vehicle for traffic surveillance
- 1999
-
Ingår i: Proceedings of the International Conference on Vision Systems '99.
-
Konferensbidrag (refereegranskat)abstract
- In this paper we present a system which integrates computer vision and decision-making in an autonomous airborne vehicle that performs traffic surveillance tasks. The main factors that make the integration of vision and decision-making a challenging problem are: the qualitatively different kind of information at the decision-making and vision levels, the need for integration of dynamically acquired information with a priori knowledge, e.g. GIS information, and the need of close feedback and guidance of the vision module by the decision-making module. Given the complex interaction between the vision module and the decision-making module we propose the adoption of an intermediate structure, called Scene Information Manager, and describe its structure and functionalities.
|
|
| 7. |
|
|
| 8. |
- Vedung, Evert
(författare)
-
Implementering i politik och förvaltning
- 2016. - 1
-
Bok (refereegranskat)abstract
- BAKSIDESTEXT:När folkvalda politiker har formulerat visioner och fattat politiska beslut ska dessa beslut implementeras av förvaltningen. Inte sällan inträffar det dock att den genomförda politiken blir något annat än vad som ursprungligen var avsikten. Vad har hänt med genomförandet, eller med implementeringen?I denna bok fokuserar författaren på en specifik del av policyprocessen, nämligen implementering av offentlig politik. Här beskrivs ingående de interna och externa faktorer som påverkar implementeringsprocessen. Med hjälp av ett antal empiriska exempel beskriver författaren vad som påverkar implementeringens utfall.Implementering i politik och förvaltning vänder sig till implementeringsverksamma samt till studenter i statsvetenskap, folkhälsa, socialt arbete och andra närliggande ämnen som behöver en djupare förståelse för implementeringens dynamik.
|
|
| 9. |
|
|
| 10. |
- Fulla, Peter, et al.
(författare)
-
The Complexity of Boolean Surjective General-Valued CSPs
- 2019
-
Ingår i: ACM Transactions on Computation Theory. - : ASSOC COMPUTING MACHINERY. - 1942-3454 .- 1942-3462. ; 11:1
-
Tidskriftsartikel (refereegranskat)abstract
- Valued constraint satisfaction problems (VCSPs) are discrete optimisation problems with a (Q boolean OR{infinity})-valued objective function given as a sum of fixed-arity functions. In Boolean surjective VCSPs, variables take on labels from D = {0, 1}, and an optimal assignment is required to use both labels from D. Examples include the classical global Min-Cut problem in graphs and the Minimum Distance problem studied in coding theory. We establish a dichotomy theorem and thus give a complete complexity classification of Boolean surjective VCSPs with respect to exact solvability. Our work generalises the dichotomy for {0, infinity}-valued constraint languages (corresponding to surjective decision CSPs) obtained by Creignou and Hebrard. For the maximisation problem of Q(amp;gt;= 0)-valued surjective VCSPs, we also establish a dichotomy theorem with respect to approximability. Unlike in the case of Boolean surjective (decision) CSPs, there appears a novel tractable class of languages that is trivial in the non-surjective setting. This newly discovered tractable class has an interesting mathematical structure related to downsets and upsets. Our main contribution is identifying this class and proving that it lies on the borderline of tractability. A crucial part of our proof is a polynomial-time algorithm for enumerating all near-optimal solutions to a generalised Min-Cut problem, which might be of independent interest.
|
|
