Sökning: "readability"
Visar resultat 16 - 20 av 37 avhandlingar innehållade ordet readability.
16. Towards a Model of General Text Complexity for Swedish
Sammanfattning : In an increasingly networked world, where the amount of written information is growing at a rate never before seen, the ability to read and absorb written information is of utmost importance for anything but a superficial understanding of life's complexities. That is an example of a sentence which is not very easy to read. LÄS MER
17. Health Monitoring for Aircraft Systems using Decision Trees and Genetic Evolution
Sammanfattning : Reducing unscheduled maintenance is important for aircraft operators. There are significant costs if flights must be delayed or cancelled, for example, if spares are not available and have to be shipped across the world. LÄS MER
18. Föränderligt och beständigt : En studie av Elsa Beskows berättarspråk
Sammanfattning : This thesis is a study of the narrative language of Elsa Beskow, Sweden's most famous children's writer of the early twentieth century. The overall aim of the thesis is to contribute to the understanding of why Beskow's stories are still among the most popular children's books in Sweden, more than a hundred years after her literary debut. LÄS MER
19. Formal Specification and Verification of Safety-Critical Software
Sammanfattning : This thesis is about formal specification and formal verification of software and consists of three different parts. In the first two parts, the formal specification language OCL is treated in two different contexts. The third part describes a technique for analysing the consequences of hardware faults as part of formal software verification. LÄS MER
20. Practical Unification for Dependent Type Checking
Sammanfattning : When using popular dependently-typed languages such as Agda, Idris or Coq to write a proof or a program, some function arguments can be omitted, both to decrease code size and to improve readability. Type checking such a program involves inferring a combination of these implicit arguments that makes the program type-correct. LÄS MER