Sökresultat

I TEDDY har totalt 8676 barn följts från födseln för att ta reda på vilka omgivningsfaktorer som bidrar till att sjukdomen triggas. Autoantikroppar är biomarkörer som visar att sjukdomen har börjat utveckla sig. När en första autoantikropp har bildats följs barnet mer intensivt och gör OGTT för att se utvecklingen mot autoimmun (typ 1) diabetes. Barn med två eller flera autoantikroppar har 70% ris

https://www.teddy.lu.se/resultat-fran-teddy/alla-forskningsartiklar/autoantikroppar/vilka-faktorer-paverkar-om-ett-teddy-barn-med-tva-eller-flera-autoantikroppar-gor-oral - 2026-07-19

Lund University administers several travel and research grants. Most of them are announced twice a year, in February and September. Others have specific deadlines. The faculty announces current application periods.The university's travel and research grants website.With the tool Pivot-RP, employees at Lund University can monitor national and international calls for research funding. You can create

https://www.law.lu.se/research/research-support/financing - 2026-07-19

Diabetes och antikroppar vid födelsen Förekomsten av typ 1 (insulinberoende) diabetes före 15 års ålder har ökat under de senaste åren och barnen är allt yngre vid insjuknandet. Sjukdomen anses vara autoimmun, vilket innebär att kroppens eget immunförsvar angriper de insulinproducerande betacellerna i bukspottkörteln. En ärftlig benägenhet, som framför allt. är kopplad till så kallad vävnadsantige

https://www.diabetesportalen.lu.se/fran-labbet-till-apotekshyllan/avhandlingar/2007/maria-elfving - 2026-07-19

På denna sida finns stöd och information om utvecklingssamtal på Lunds universitet. Innehåll på sidan:Om utvecklingssamtalDelat ansvar för verksamhetsutvecklingAnsvar för utvecklingssamtalFörberedelse, genomförande och uppföljningÅrscykel för utvecklingssamtalOm utvecklingssamtalDu som chef ansvarar för att utveckla verksamheten så att den bidrar till att Lunds universitets strategiska mål uppfyll

https://www.hr-webben.lu.se/anstallning/utvecklingssamtal - 2026-07-19

1.. MANSCH GÂNGLÁT 2. PCIKA Po],KETTE GA],OPP J. SCHOTTTs nn¡¡¡jiNDER PAS DE QUATTRE 4. ANGIAIS ENGEI,Sr¡, snÄ}¡NvINSPOISKA 5. MAZURKA NUMPEDA.RRA HA¡I.BO 6. VATS 7" MARKERAD POISKA SVINGEDANS BUGADANS RUNî¡¡IOU TONEPOISKA g¡ SLÄNCPOLSKA POI,ONAIS SEXTONDELSPOLSKA 9. l,ll¡cD¡,¡gs. 10. MeNUEttn 1 1. ovRroA r,Ãr.nn 12. ÖVRIGT MATEI{IAL .i 6 vAlS 5ot\4 kÁLIÅ0ES "kur'IGENS vÁe5" S?ËlÄ¡ 4V PrR o¡.gsoN

https://www.folklivsarkivet.lu.se/fileadmin/user_upload/folklivsarkivet/Musiksamlingarna_webb/Dokument/Parm_4_B.pdf - 2026-07-20

HT-forskare belönade av Vitterhets­akademien HT-forskare belönade av Vitterhets­akademien Publicerad den 20 februari 2025 Kungl. Vitterhetsakademien uppmärksammar årligen framstående forskare och lärare inom humaniora och samhällsvetenskap. Rettigska priset tilldelas professor Kristina Myrvold för hennes omfattande forskning med fokus på indiska religioner och särskilt på sikhers religiösa praxis,

https://www.ctr.lu.se/article/ht-forskare-beloenade-av-vitterhetsakademin/ - 2026-07-20

In this paper, a wideband circularly polarized antenna is designed for integration into the glass roof of a modern car for GNSS positioning applications. Characteristic mode analysis is used to obtain more physical insight into the problem and hence satisfy the polarization and bandwidth requirements. The antenna has a low profile and uses a single coplanar waveguide feed to cover all GNSS bands.

Due to their natural and inherent way of capturing concurrency, dataflow descriptions of stream programs have seen prevalent usage in fields such as video processing, networks and scientific computing. They are often deployed on manycore, heterogeneous and distributed architectures. Despite robust research on the topic, obstacles still exist in evaluating the performance of stream programs accurat

One of the major open problems in complexity theory is proving super-logarithmiclower bounds on the depth of circuits (i.e., P⊈NC1). Karchmer et al. (Comput Complex 5(3/4):191–204, 1995) suggested to approach thisproblem by proving that depth complexity behaves “as expected”with respect to the composition of functions f◊g. They showedthat the validity of this conjecture would imply that P⊈NC1.Seve

Streaming applications, such as MPEG video encoders or sensor processing pipelines, are increasing in complexity as well as the diversity of platforms that they run on. The toolchains handling these applications must keep up with this increase at all levels of abstraction. The Actor Machine (AM) is an intermediate representation in the toolchain that we make use of. Large AMs are difficult to work

With the emergence of autonomous vehicles comes requirements on adequate and rigorous testing techniques, particularly as systems continuously adapt to changing environments. Scenario-based, simulated testing is one approach that has received attention, where deriving relevant scenarios from various sources is still a challenge. We therefore explore creating executable test scenarios from textual

Proof logging in constraint programming is an approach to certifying a conclusion reached by a solver. To allow for this, different propagators must be augmented to produce justifications for any inferences they make, so that an independent proof checker can certify correctness. The Circuit constraint is used to enforce a Hamiltonian cycle on a set of vertices, e.g. for vehicle routing. Maintainin

It is well known that reformulating the original problem can be crucial for the performance of mixed-integer programming (MIP) solvers. To ensure correctness, all transformations must preserve the feasibility status and optimal value of the problem, but there is currently no established methodology to express and verify the equivalence of two mixed-integer programs. In this work, we take a first s

Building on the progress in Boolean satisfiability (SAT) solving over the last decades, maximum satisfiability (MaxSAT) has become a viable approach for solving NP-hard optimization problems. However, ensuring correctness of MaxSAT solvers has remained a considerable concern. For SAT, this is largely a solved problem thanks to the use of proof logging, meaning that solvers emit machine-verifiable

Proof logging has long been the established method to certify correctness of Boolean satisfiability (SAT) solvers, but has only recently been introduced for SAT-based optimization (MaxSAT). The focus of this paper is solution-improving search (SIS), in which a SAT solver is iteratively queried for increasingly better solutions until an optimal one is found. A challenging aspect of modern SIS solv

Pseudo-Boolean proof logging has been used successfully to provide certificates of optimality from a variety of constraint- and satisifability-style solvers that combine reasoning with a backtracking or clause-learning search. Another paradigm, occurring in dynamic programming and decision diagram solving, instead reasons about partial states and possible transitions between them. We describe a fr

This article addresses the obstacle avoidance problem for setpoint stabilization tasks in complex dynamic 2-D environments that go beyond conventional scenes with isolated convex obstacles. A combined motion planner and controller is proposed that integrates the favorable convergence characteristics of closed-form motion planning techniques with the intuitive representation of system constraints t

Riparian buffer zones (RBZs) are an important instrument for environmental policies for water and biodiversity protection in managed forests. We investigate the variation of the cost of implementing RBZs within different property size classes across the size range of non-industrial forest owner properties in Southern Sweden. Using the Heureka PlanWise decision support system, we quantified the cos

Background: Predicting future Alzheimer’s disease (AD)-related cognitive decline among individuals with subjective cognitive decline (SCD) or mild cognitive impairment (MCI) is an important task for healthcare. Structural brain imaging as measured by magnetic resonance imaging (MRI) could potentially contribute when making such predictions. It is unclear if the predictive performance of MRI can be