Dr Jens Blanck

Athro Cyswllt

Computer Science

+44 (0) 1792 602917

j.e.blanck@abertawe.ac.uk

Siaradwr Cymraeg Canolradd

333
Trydydd Llawr
Y Ffowndri Gyfrifiadol
Campws y Bae

Ar gael ar gyfer Goruchwyliaeth Ôl-raddedig

Dolenni Ymchwil

https://orcid.org/0000-0001-9656-1352

Trosolwg

Mae Dr Jens Blanck yn Athro Cyswllt yn yr Adran Gyfrifiadureg, Prifysgol Abertawe.

Cyhoeddiadau

Uchafbwyntiau Ymchwil

Bauer, A. & Blanck, J. (2010). Canonical effective subalgebras of classical algebras as constructive metric completions. Journal of Universal Computer Science, 16(18), 2496-2522.
https://doi.org/10.3217/jucs-016-18-2496, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa47
Blanck, J. (2008). Reducibility of domain representations and Cantor–Weihrauch domain representations. Mathematical Structures in Computer Science, 18(06), 1031-1056.
https://doi.org/10.1017/S0960129508007093, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa132
Blanck, J. & Blanck, J. (2005). Efficient exact computation of iterated maps. The Journal of Logic and Algebraic Programming, 64(1), 41
https://doi.org/10.1016/j.jlap.2004.07.004, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa1707
Blanck, J., Stoltenberg-Hansen, V., Tucker, J., & Blanck, J. (2002). Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. Theoretical Computer Science, 284(2), 207
https://doi.org/10.1016/S0304-3975(01)00065-2, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa1708
Blanck, J. & Blanck, J. (2006). Exact real arithmetic using centred intervals and bounded error terms. The Journal of Logic and Algebraic Programming, 66(1), 50
https://doi.org/10.1016/j.jlap.2005.07.002, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa1709
Berger, U., Blanck, J., & KØBER, P. (2010). Domain representations of spaces of compact subsets. Mathematical Structures in Computer Science, 20(02), 107
https://doi.org/10.1017/S096012950999034X, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7413
Blanck, J. & Blanck, J. (2013). Interval Domains and Computable Sequences: A Case Study of Domain Reductions. The Computer Journal, 56(1), 45-52.
https://doi.org/10.1093/comjnl/bxs121, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa13741
Blanck, J., Stoltenberg-Hansen, V., & Tucker, J. (2008). Stability for Effective Algebras. Electronic Notes in Theoretical Computer Science, 221, 3
https://doi.org/10.1016/j.entcs.2008.12.002, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa48
Blanck, J., Stoltenberg-Hansen, V., & Tucker, J. (2011). Stability of representations of effective partial algebras. Mathematical Logic Quarterly
https://doi.org/10.1002/malq.200910133, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7204

Holl Ymchwil

Erthyglau Cylchgronau

Blanck, J. & Blanck, J. (2013). Interval Domains and Computable Sequences: A Case Study of Domain Reductions. The Computer Journal, 56(1), 45-52.
https://doi.org/10.1093/comjnl/bxs121, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa13741
Blanck, J., Stoltenberg-Hansen, V., & Tucker, J. (2011). Stability of representations of effective partial algebras. Mathematical Logic Quarterly
https://doi.org/10.1002/malq.200910133, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7204
Berger, U., Blanck, J., & KØBER, P. (2010). Domain representations of spaces of compact subsets. Mathematical Structures in Computer Science, 20(02), 107
https://doi.org/10.1017/S096012950999034X, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa7413
Bauer, A. & Blanck, J. (2010). Canonical effective subalgebras of classical algebras as constructive metric completions. Journal of Universal Computer Science, 16(18), 2496-2522.
https://doi.org/10.3217/jucs-016-18-2496, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa47
Blanck, J., Stoltenberg-Hansen, V., & Tucker, J. (2008). Stability for Effective Algebras. Electronic Notes in Theoretical Computer Science, 221, 3
https://doi.org/10.1016/j.entcs.2008.12.002, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa48
Blanck, J. (2008). Reducibility of domain representations and Cantor–Weihrauch domain representations. Mathematical Structures in Computer Science, 18(06), 1031-1056.
https://doi.org/10.1017/S0960129508007093, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa132
Blanck, J. & Blanck, J. (2006). Exact real arithmetic using centred intervals and bounded error terms. The Journal of Logic and Algebraic Programming, 66(1), 50
https://doi.org/10.1016/j.jlap.2005.07.002, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa1709
Blanck, J. & Blanck, J. (2005). Efficient exact computation of iterated maps. The Journal of Logic and Algebraic Programming, 64(1), 41
https://doi.org/10.1016/j.jlap.2004.07.004, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa1707
Blanck, J., Stoltenberg-Hansen, V., Tucker, J., & Blanck, J. (2002). Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. Theoretical Computer Science, 284(2), 207
https://doi.org/10.1016/S0304-3975(01)00065-2, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa1708

Modiwlau a Addysgir

CS-150 Concepts of Computer Science

This module gives an overview of some of the main principles underlying computers and computing from both a theoretical and an applied point of view. Following a brief history of computers and software an introduction to the representation of data and the basic components of a computer will be given. Students will be introduced to the principles of programming at assembly language level. Further topics include simple algorithm analysis, operating systems, file systems, computer networks, and the world wide web. A brief discussion on the limitations of computing is also given. The module is accessible and relevant to students of all disciplines who wish to learn about, or reinforce their understanding of, computers and computer science
CSCM28 Security Vulnerabilities and Penetration Testing

The aim of this course is to examine methodological and practical aspects of cyber security threats and analysis techniques.
CSP300 Software Engineering Project Implementation and Dissertation

This module forms the second part of the Level 6 project (together with CSP301) for BSc Software Engineering and MEng Computing students. It consists of the implementation of a software system, and a substantial written dissertation.
CSP301 Software Engineering Project Specification and Development

The aims of this module in conjunction with CSP300 are: ¿ to provide BSc Software Engineering students the opportunity of specifying, designing and implementing a complete system and experiencing the major phases of the life-cycle of a computing project; ¿ to enhance students¿ competence in system design, risk analysis and management, and their fluency in using programming languages and tools; ¿ to give students an intellectual challenge to their abilities to learn new subjects without instruction, and to further develop their abilities in literature searching, report writing, verbal presentation, project planning and time management.
CSP302 Computer Science Project Dissertation

This module forms the second part of the Level 3 project for Computer Science students. It consists of a substantial written dissertation but it does not involve writing or specifying a significant piece of software or hardware. This module is an alternative to CSP344 in the case that a student has undertaken a theoretical, historical or other investigative project that does not involve software/hardware specification or production.
CSP344 Computer Science Project Implementation and Dissertation

This module forms the second part of the Level 6 project for BSc Computer Science and MSci Computer Sciencestudents. It consists of the implementation of a software system, and a substantial written dissertation. The alternative module CSP302 is for projects that do not involve writing software.
CSP354 Computer Science Project Specification and Development

This module forms half of the Level 6 project undertaken by BSc Computer Computer Science and MSci Computer Science students. This module represents work on the development of the project over Semesters 1 and 2 (as well as the immediately preceding vacation between Levels 5 and 6). It is partnered with another module that represents the final deliverable - which can either be software and a dissertation, or just a dissertation.

Dr Jens Blanck

Rhif ffôn

Cyfeiriad ebost

Welsh language proficiency

Dolenni Ymchwil

Trosolwg

Cyhoeddiadau

Uchafbwyntiau Ymchwil

Holl Ymchwil

Erthyglau Cylchgronau

Modiwlau a Addysgir

CS-150 Concepts of Computer Science

CSCM28 Security Vulnerabilities and Penetration Testing

CSP300 Software Engineering Project Implementation and Dissertation

CSP301 Software Engineering Project Specification and Development

CSP302 Computer Science Project Dissertation

CSP344 Computer Science Project Implementation and Dissertation

CSP354 Computer Science Project Specification and Development