Search results

Filter

Filetype

Your search for "*" yielded 563159 hits

No title

Decarbonising the power sector requires feasible strategies for the rapid phase-out of fossil fuels and the expansion of low-carbon sources. This study assesses the feasibility of plausible decarbonisation scenarios for the power sector in the Republic of Korea through 2050 and 2060. Our power plant stock accounting model results show that achieving zero emissions from the power sector by the mid-

No title

En personligt hållen skildring av de kliniska psykologernas etablering inom svensk psykiatri under under 1970- och 1980-talen. Utvecklingen illustreras av processer inom en sektoriserad socialpsykiatriskt orienterad landsortsklinik och analyseras med utgångspunkt i internationell och svensk samhällsutveckling under perioden. Betydelsen av förändrad psykologutbildning och psykologyrkets snabba prof

No title

Mark. Z Danielewski is known for his experiments with the aesthetics of print in works such as House of Leaves and The Familiar. The chapter examines what happens when the experimental book object is digitalized, focusing on the enhanced e-book version of Danielewski’s The Fifty Year Sword. Drawing on theories on remediation (Bolter and Grusin), bookishness (Pressman, Hayles) and digital materiali

No title

Lung-resident mesenchymal stem cells (LR-MSC) are thought to participate in idiopathic pulmonary fibrosis (IPF) by differentiating into myofibroblasts. On the other hand, LR-MSC in IPF patients present senescence-related features. It is unclear how they respond to a profibrotic environment. Here, we investigated the profibrotic response of LR-MSC isolated from IPF and control (CON) patients. LR-MS

No title

We prove that polynomial calculus (and hence also Nullstellensatz) over any field requires linear degree to refute that sparse random regular graphs, as well as sparse Erdős-Rényi random graphs, are 3-colourable.

No title

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