liu.seSearch for publications in DiVA
Change search
Refine search result
1 - 2 of 2
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Abrahamsson, Sara
    et al.
    Linköping University, Department of Computer and Information Science.
    Andersson, Frida
    Linköping University, Department of Computer and Information Science.
    Jaldevik, Albin
    Linköping University, Department of Computer and Information Science.
    Nyrfors, Frans
    Linköping University, Department of Computer and Information Science.
    Jareman, Erik
    Linköping University, Department of Computer and Information Science.
    Kröger, Oscar
    Linköping University, Department of Computer and Information Science.
    Tjern, Martin
    Linköping University, Department of Computer and Information Science.
    TopQ - a web-based queuing application: A case study in developing a queuing application for students and tutors with focus on navigability and design2021Independent thesis Basic level (degree of Bachelor), 12 credits / 18 HE creditsStudent thesis
    Abstract [en]

    Students’ learning processes can be affected negatively by long waiting times to get assistance on lesson- and lab-sessions. Studies show that digital queuing systems decrease the waiting time. Thus, the purpose of this report is to investigate how to design a web-based queuing application to achieve a high perceived usability for students and tutors. Especially based on navigability and design which in accordance with research in the area has a direct impact on the usability. To achieve a high perceived usability the application was developed iteratively. In the first version the implemented functionality was built upon the result from the feasibility study combined with research in the area. After a set of user evaluations, changes from the first version were implemented to further improve the perceived usability. Lastly, another set of evaluations were performed to confirm the improvement in the final version. The results showed that the first version of the system was perceived as 84 out of 100 on the System Usability Scale (SUS) and the final version as 88 out of 100, an improvement by four units. Uniform design, no irrelevant functionality, placing buttons in conspicuous positions and having double checks to “dangerous actions” all seem to be factors contributing to the navigability, desirability and thus the usability on a queuing-application.

    Download full text (pdf)
    fulltext
  • 2.
    Jaldevik, Albin
    Linköping University, Department of Mathematics, Algebra, Geometry and Discrete Mathematics. Linköping University, Faculty of Science & Engineering.
    A Study on Poset Probability2022Independent thesis Basic level (degree of Bachelor), 14 HE creditsStudent thesis
    Abstract [en]

    Let be a finite poset (partially ordered set) with cardinality . A linear extension of is an order-preserving bijection : , that is, if in then . We define the poset probability as the proportion of linear extensions where . We are primarily interested in for incomparable elements . The probability has significance in areas such as information theory. Let denote the total number of linear extensions of . We prove that the poset probability can be evaluated as

    where is the set of order ideals of without or , where we can add to get a new order ideal of . The practicality of the preceding formula is explored and we show that

    The formula is particularly useful for certain classes of posets such as partition posets which are examined in further detail. We apply the formula to prove that, for all partition posets of shape , the probability obeys

    where is the nth Catalan number and .

    We also explore how Monte Carlo methods can be used to estimate .

    Download full text (pdf)
    Jaldevik-Poset-Probability
1 - 2 of 2
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf