Search results

Under en förmiddag i oktober samlades närmare 200 chefer från Lunds universitet för att tillsammans fördjupa sig i ett av ledarskapets mest utmanande områden, konflikthantering. Chefsforum LU arrangeras av sektionen HR och bjöd denna gång på reflektioner, samtal och konkreta verktyg om hur man som chef kan agera vid konflikter och i  andra komplexa situationer.  Konflikter – en del av arbetslivetK

https://www.hr-webben.lu.se/chefsforum-lu-konflikter-kraver-mod-lyhordhet-och-struktur - 2026-07-09

Library Partnership between CSHL & RWI Cambodia - The Raoul Wallenberg Institute of Human Rights and Humanitarian Law Skip to content Search for: Search Button Home About Us Who We Are Our History About Raoul Wallenberg Our Theory of Change Staff Opportunities Annual Reports Whistleblower Our work What we do Multi-Disciplinary Research Higher Education Strategic Advice and Analysis Outreach Evalua

https://rwi.lu.se/news/library-partnership-between-cshl-rwi-cambodia/ - 2026-07-09

Nummer 3 • 2005 TVÅ VECKOR I EN REKTORS LIV • LÄNGRE UTBILDNINGAR? • NY LEDNINGSORGANISATION Blomstrande samarbeten Blomstrande samarbeten LT H - n y t t n u m m e r 3 • 2 0 0 5 LT H - n y t t n u m m e r 3 • 2 0 0 5 Han byggde hus med trä och betong i samma block FORSKARE OCH FÖRETAG står ofta i ett ömsesidigt beroendeförhål- lande till varandra. Företagen behö- ver hjälp med visioner och lösni

https://www.lth.se/fileadmin/lth/omlth/kommunikation/lthnytt/lthn05_3.pdf - 2026-07-10

Forskarskolorna erbjuder unika möjligheter för dig som är doktorand och postdoktor. De ordnar kurser, seminarier och workshops. Vissa erbjuder även forskningsuppdrag. Forskarskolorna fokuserar på specifika ämnen eller teman och för samman unga forskare från olika akademiska bakgrunder som har gemensamma ambitioner och intressen. De drivs ofta i nära samarbete med näringslivet, den offentliga sekto

https://www.lu.se/forskning/utbildning-pa-forskarniva/forskarskolor - 2026-07-09

Öppet fall är en podcast från Lunds universitet om uppmärksammade rättsfall. Forskare från Juridiska fakulteten öppnar upp ett omtalat rättsfall och analyserar det på ett öppet och förutsättningslöst sätt. Vi tar oss an ett nytt fall varje månad. Ibland är det ett aktuellt rättsfall som granskas, ibland ett fall ur svensk rättshistoria. Podden startade 2019.Podden finns där poddar finns, till exem

https://www.jur.lu.se/samverkan/oppet-fall - 2026-07-09

https://www.sol.lu.se/en/course/ITAA04/ - 2026-07-10

Institutionen för utbildningsvetenskap ÄUVD23, Läroplansteori och didaktik (UVK3), 7,5 hp, fr.o.m. vt25 Litteraturlista Fastställd av styrelsen för institutionen för utbildningsvetenskap 2024-11-18. Fenstermacher, Gary D., Soltis, Jonas F. & Sanger, Mathew N. (2009). Approaches to teaching (5.uppl.). New York: Teachers College Press. (116 s.) ISBN: 9780807749821 Håkansson, Jan & Sundberg, Daniel (

https://www.uvet.lu.se/media/utbildning/dokument/kurser/AUVD23/20261/_UVD23_litteraturlista_UVK3_fr_n_vt25.pdf - 2026-07-10

IMSCC Arkiv | Vattenhallen Hoppa till huvudinnehåll Den här webbplatsen använder cookies för att förbättra användarupplevelsen. Genom att fortsätta använda webbplatsen samtycker du till att cookies används enligt vår cookie-policy (på LTH:s webbplats) . Absolut nödvändiga cookies Dessa cookies är nödvändiga för att webbplatsen ska fungera och kan inte stängas av i våra system. Dessa cookies lagrar

https://www.vattenhallen.lu.se/arkiv/om-oss/samverkan/imscc-arkiv/ - 2026-07-10

We exhibit supercritical trade-off for monotone circuits, showing that there are functions computable by small circuits for which any small circuit must have depth superlinear or even super-polynomial in the number of variables, far exceeding the linear worst-case upper bound. We obtain similar trade-offs in proof complexity, where we establish the first size-depth trade-offs for cutting planes an

We show that a generalization of the DAG-like query-to-communication lifting theorem, when proven using sunflowers over non-binary alphabets, yields lower bounds on the monotone circuit complexity and proof complexity of natural functions and formulas that are better than previously known results obtained using the approximation method. These include an nΩ(k) lower bound for the clique function up

A proof system P is said to be automatable in time f(N) if there exists an algorithm that given as input an unsatisfiable formula F outputs a refutation of F in the proof system P in time f(N), where N is the size of the smallest P-refutation of F plus the size of F. Atserias and Bonet (ECCC 2002), observed that tree-like k-DNF resolution is automatable in time Nc·k log N for a universal constant

Certifying solvers have long been standard for decision problems in Boolean satisfiability (SAT), allowing for proof logging and checking with very limited overhead, but developing similar tools for combinatorial optimization has remained a challenge. A recent promising approach covering a wide range of solving paradigms is pseudo-Boolean proof logging, but this has mostly consisted of proof-of-co

This paper presents bounds on radiation efficiency and gain for microstrip patch antennas, demonstrating close alignment with the performance of classic antenna designs. These bounds serve as effective benchmarks for assessing antenna performance and evaluating trade-offs and design feasibility. The study particularly addresses the trade-off between miniaturization and performance by comparing bou

In this paper, we investigate ways to mitigate the problem of decoder error propagation (DEP) in sliding window decoding (SWD) of protograph-based spatially coupled low-density parity-check (SC-LDPC) codes for large frame length or streaming applications. In particular, in order to avoid subdividing a long frame into a series of shorter frames by using termination to combat DEP, we consider alteri

We introduce lower-bound certificates for classical planning tasks, which can be used to prove the unsolvability of a task or the optimality of a plan in a way that can be verified by an independent third party. We describe a general framework for generating lower-bound certificates based on pseudo-Boolean constraints, which is agnostic to the planning algorithm used. As a case study, we show how

We use a closed-loop algorithm to accurately program hafnium zirconium oxide (HZO) ferroelectric tunnel junctions (FTJs) to arbitrary chosen target conductance values. The key enabler is suppression of conductance growth. We have identified two different mechanisms contributing to the total conductance of FTJs. By controlling both, we demonstrated an up to threefold increase of the usable conducta

We propose a new class of high-rate spatially coupled LDPC (SC-LDPC) codes based on the convolutional selforthogonal codes (CSOCs) first introduced by Massey. The SCLDPC codes are constructed by treating the irregular graph corresponding to the parity-check matrix of a systematic rate R=(n-1) / n CSOC as a convolutional protograph. The protograph can then be lifted using permutation matrices to ge

When the polar vortex meanders and shifts towards the equator, air masses from the tropics and subtropics can be transported towards the pole in so-called tropical-subtropical streamers. These large-scale structures are areas of low potential vorticity and high pressure, containing dry air with high ozone mixing ratios. The presence of these streamers can also be seen in changes in stratospheric o

An extension of the feedline is often needed when an antenna is integrated with the roof glass of a car. How much the extension affects the antenna performance depends on the type of antenna and feedline used. This paper studies the effects of coplanar waveguide feedline extension on the performance of a circularly-polarized square slot antenna. Simulation results show a general decrease in the an

Respiratory symptoms are ubiquitous and impair health-related quality of life in people with respiratory disease. This European Respiratory Society (ERS) task force aimed to provide recommendations for symptomatic treatment in people with serious respiratory illness. The ERS task force comprised 16 members, including representatives of people with serious respiratory illness and informal caregiver