Search results

https://www.webbpublicering.lu.se/guides-english/contact-us-web-support - 2026-06-27

Verksamhets- berättelse 2025 Under 2025 har de geopolitiska spänningarna, osäkerheten om ekonomin och polariseringen i debatten blivit, om möjligt, ännu större. Krig, handelskonflikter och motsättningar har påverkat politiken och skapat oro i ekonomin. Demo- kratiska värden utmanas, tilliten till kunskap försvagas. Även fackföreningarnas ställning i samhället är under press, både i Sverige och glo

https://www.saco.se/globalassets/bilder-video-och-dokument/om-saco/arsredovisning--verksamhetsberattelse/verksamhetsberattelse/sacos-verksamhetsberattelse-2025.pdf - 2026-06-27

Aims: To examine whether the decrease in the mean breath alcohol concentration (BrAC) and the rowdy social atmosphere reported after one month remained stable in the five-month assessment. Design: Randomized controlled trial. Setting: University bars. Participants: The five-month assessment was based on 596 students visiting student bars during ordinary pub evenings. Intervention: Bartenders (n =

https://www.mhm.lu.se/internt/get-started-newly-admitted-student - 2026-06-27

This paper presents analyses on the trends of IS curriculum development that has evolved since its inception from the classical report by the AIS/ACM task force led by Heikki Topi and colleagues published in 2010. Based on an integrated synthesis of the literature, we categorize it into three theoretically-driven dimensions: (i) IS Curricula; (ii) Topic-Based IS Curricula, and (iii) IS Identity Cr

We prove that for k ≫; 4√n regular resolution requires length nω(k) to establish that an ErdÅ's-Rényi graph with appropriately chosen edge density does not contain a k-clique. This lower bound is optimal up to the multiplicative constant in the exponent and also implies unconditional nω(k) lower bounds on running time for several state-of-the-art algorithms for finding maximum cliques in graphs.

We prove that for k ≪ 4 n regular resolution requires length nΩ(k) to establish that an Erdős–Rényi graph with appropriately chosen edge density does not contain a k-clique. This lower bound is optimal up to the multiplicative constant in the exponent, and also implies unconditional nΩ(k) lower bounds on running time for several state-of-the-art algorithms for finding maximum cliques in graphs.

Neurodegenerative disorders are an increasingly common and irreversible burden on society, often affecting the aging population, but their etiology and disease mechanisms are poorly understood. Studying monogenic neurodegenerative diseases with known genetic cause provides an opportunity to understand cellular mechanisms also affected in more complex disorders. We recently reported that loss-of-fu

The aim of this paper was to examine how useable and inclusive the city is from the perspective of older bicyclists. Methods used were quantitative questionnaires and qualitative focus group interviews. Participants were people aged 65 years or older. The results showed that respondents were fairly satisfied with the transport infrastructure design. However, other road users seemed to complicate c

During mammalian ocular development, several signaling pathways control the spatiotemporal highly defined realization of the three-dimensional eye architecture. Given the complexity of these inductive signals, the developing eye is a sensitive organ for several diseases. In this study, we investigated a Dkk1+/- haploinsufficiency during eye development, resulting in coloboma and anterior eye defec

In mitosis, most transcription factors detach from chromatin, but some are retained and bookmark genomic sites. Mitotic bookmarking has been implicated in lineage inheritance, pluripotency and reprogramming. However, the biological significance of this mechanism in vivo remains unclear. Here, we address mitotic retention of the hemogenic factors GATA2, GFI1B and FOS during haematopoietic specifica

We prove that unary Sherali-Adams requires proofs of size nΩ(d) to rule out the existence of an nΘ(1)-clique in Erdős-Rényi random graphs whose maximum clique is of size d ≤ 2 log n. This lower bound is tight up to the multiplicative constant in the exponent. We obtain this result by introducing a technique inspired by pseudo-calibration which may be of independent interest. The technique involves

Pancreatic endocrine cell differentiation depends on transcription factors that also contribute in adult insulin and glucagon gene expression. Islet cell development was examined in mice lacking MafB, a transcription factor expressed in immature alpha (glucagon(+)) and beta (insulin(+)) cells and capable of activating insulin and glucagon expression in vitro. We observed that MafB(-/-) embryos had