| 1. |
- Engert, Andreas, et al.
(författare)
-
The European Hematology Association Roadmap for European Hematology Research : a consensus document
- 2016
-
Ingår i: Haematologica. - Pavia, Italy : Ferrata Storti Foundation (Haematologica). - 0390-6078 .- 1592-8721. ; 101:2, s. 115-208
-
Tidskriftsartikel (refereegranskat)abstract
- The European Hematology Association (EHA) Roadmap for European Hematology Research highlights major achievements in diagnosis and treatment of blood disorders and identifies the greatest unmet clinical and scientific needs in those areas to enable better funded, more focused European hematology research. Initiated by the EHA, around 300 experts contributed to the consensus document, which will help European policy makers, research funders, research organizations, researchers, and patient groups make better informed decisions on hematology research. It also aims to raise public awareness of the burden of blood disorders on European society, which purely in economic terms is estimated at (sic)23 billion per year, a level of cost that is not matched in current European hematology research funding. In recent decades, hematology research has improved our fundamental understanding of the biology of blood disorders, and has improved diagnostics and treatments, sometimes in revolutionary ways. This progress highlights the potential of focused basic research programs such as this EHA Roadmap. The EHA Roadmap identifies nine 'sections' in hematology: normal hematopoiesis, malignant lymphoid and myeloid diseases, anemias and related diseases, platelet disorders, blood coagulation and hemostatic disorders, transfusion medicine, infections in hematology, and hematopoietic stem cell transplantation. These sections span 60 smaller groups of diseases or disorders. The EHA Roadmap identifies priorities and needs across the field of hematology, including those to develop targeted therapies based on genomic profiling and chemical biology, to eradicate minimal residual malignant disease, and to develop cellular immunotherapies, combination treatments, gene therapies, hematopoietic stem cell treatments, and treatments that are better tolerated by elderly patients.
|
|
| 2. |
- Kehoe, Laura, et al.
(författare)
-
Make EU trade with Brazil sustainable
- 2019
-
Ingår i: Science. - : American Association for the Advancement of Science (AAAS). - 0036-8075 .- 1095-9203. ; 364:6438, s. 341-
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)
|
|
| 3. |
- Pennells, Lisa, et al.
(författare)
-
Equalization of four cardiovascular risk algorithms after systematic recalibration : individual-participant meta-analysis of 86 prospective studies
- 2019
-
Ingår i: European Heart Journal. - : Oxford University Press (OUP). - 0195-668X .- 1522-9645. ; 40:7, s. 621-
-
Tidskriftsartikel (refereegranskat)abstract
- Aims: There is debate about the optimum algorithm for cardiovascular disease (CVD) risk estimation. We conducted head-to-head comparisons of four algorithms recommended by primary prevention guidelines, before and after ‘recalibration’, a method that adapts risk algorithms to take account of differences in the risk characteristics of the populations being studied.Methods and results: Using individual-participant data on 360 737 participants without CVD at baseline in 86 prospective studies from 22 countries, we compared the Framingham risk score (FRS), Systematic COronary Risk Evaluation (SCORE), pooled cohort equations (PCE), and Reynolds risk score (RRS). We calculated measures of risk discrimination and calibration, and modelled clinical implications of initiating statin therapy in people judged to be at ‘high’ 10 year CVD risk. Original risk algorithms were recalibrated using the risk factor profile and CVD incidence of target populations. The four algorithms had similar risk discrimination. Before recalibration, FRS, SCORE, and PCE over-predicted CVD risk on average by 10%, 52%, and 41%, respectively, whereas RRS under-predicted by 10%. Original versions of algorithms classified 29–39% of individuals aged ≥40 years as high risk. By contrast, recalibration reduced this proportion to 22–24% for every algorithm. We estimated that to prevent one CVD event, it would be necessary to initiate statin therapy in 44–51 such individuals using original algorithms, in contrast to 37–39 individuals with recalibrated algorithms.Conclusion: Before recalibration, the clinical performance of four widely used CVD risk algorithms varied substantially. By contrast, simple recalibration nearly equalized their performance and improved modelled targeting of preventive action to clinical need.
|
|
| 4. |
- Arridge, Christopher S., et al.
(författare)
-
Uranus Pathfinder : exploring the origins and evolution of Ice Giant planets
- 2012
-
Ingår i: Experimental astronomy. - : Springer Science and Business Media LLC. - 0922-6435 .- 1572-9508. ; 33:2-3, s. 753-791
-
Tidskriftsartikel (refereegranskat)abstract
- The "Ice Giants" Uranus and Neptune are a different class of planet compared to Jupiter and Saturn. Studying these objects is important for furthering our understanding of the formation and evolution of the planets, and unravelling the fundamental physical and chemical processes in the Solar System. The importance of filling these gaps in our knowledge of the Solar System is particularly acute when trying to apply our understanding to the numerous planetary systems that have been discovered around other stars. The Uranus Pathfinder (UP) mission thus represents the quintessential aspects of the objectives of the European planetary community as expressed in ESA's Cosmic Vision 2015-2025. UP was proposed to the European Space Agency's M3 call for medium-class missions in 2010 and proposed to be the first orbiter of an Ice Giant planet. As the most accessible Ice Giant within the M-class mission envelope Uranus was identified as the mission target. Although not selected for this call the UP mission concept provides a baseline framework for the exploration of Uranus with existing low-cost platforms and underlines the need to develop power sources suitable for the outer Solar System. The UP science case is based around exploring the origins, evolution, and processes at work in Ice Giant planetary systems. Three broad themes were identified: (1) Uranus as an Ice Giant, (2) An Ice Giant planetary system, and (3) An asymmetric magnetosphere. Due to the long interplanetary transfer from Earth to Uranus a significant cruise-phase science theme was also developed. The UP mission concept calls for the use of a Mars Express/Rosetta-type platform to launch on a Soyuz-Fregat in 2021 and entering into an eccentric polar orbit around Uranus in the 2036-2037 timeframe. The science payload has a strong heritage in Europe and beyond and requires no significant technology developments.
|
|
| 5. |
- Arun, K. G., et al.
(författare)
-
New horizons for fundamental physics with LISA
- 2022
-
Ingår i: Living Reviews in Relativity. - : Springer Science and Business Media LLC. - 1433-8351 .- 2367-3613. ; 25:1
-
Forskningsöversikt (refereegranskat)abstract
- The Laser Interferometer Space Antenna (LISA) has the potential to reveal wonders about the fundamental theory of nature at play in the extreme gravity regime, where the gravitational interaction is both strong and dynamical. In this white paper, the Fundamental Physics Working Group of the LISA Consortium summarizes the current topics in fundamental physics where LISA observations of gravitational waves can be expected to provide key input. We provide the briefest of reviews to then delineate avenues for future research directions and to discuss connections between this working group, other working groups and the consortium work package teams. These connections must be developed for LISA to live up to its science potential in these areas.
|
|
| 6. |
|
|
| 7. |
- Björklund, Andreas, et al.
(författare)
-
Listing Triangles
- 2014
-
Ingår i: Automata, Languages, and Programming (Lecture notes in computer science). - Berlin, Heidelberg : Springer Berlin Heidelberg. - 0302-9743 .- 1611-3349. - 9783662439487 ; 8572, s. 223-234
-
Konferensbidrag (refereegranskat)abstract
- We present new algorithms for listing triangles in dense and sparse graphs. The running time of our algorithm for dense graphs is O~(n^ω+n^3(ω−1)/(5−ω)t^2(3−ω)/(5−ω)), and the running time of the algorithm for sparse graphs is O~(m^2ω/(ω+1)+m^3(ω−1)/(ω+1)t^(3−ω)/(ω+1)), where n is the number of vertices, m is the number of edges, t is the number of triangles to be listed, and ω < 2.373 is the exponent of fast matrix multiplication. With the current bound on ω, the running times of our algorithms are O~(n^2.373+n^1.568t^0.478) and O~(m^1.408+m^1.222t^0.186), respectively. We first obtain randomized algorithms with the desired running times and then derandomize them using sparse recovery techniques. If ω = 2, the running times of the algorithms become O~(n^2+nt^2/3) and O~(m^4/3+mt^1/3), respectively. In particular, if ω = 2, our algorithm lists m triangles in O~(m4/3) time. Pǎtraşcu (STOC 2010) showed that Ω(m^(4/3 − o(1))) time is required for listing m triangles, unless there exist subquadratic algorithms for 3SUM. We show that unless one can solve quadratic equation systems over a finite field significantly faster than the brute force algorithm, our triangle listing runtime bounds are tight assuming ω = 2, also for graphs with more triangles.
|
|
| 8. |
- Björklund, Andreas, et al.
(författare)
-
Shortest Two Disjoint Paths in Polynomial Time
- 2014
-
Ingår i: Lecture Notes in Computer Science. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 0302-9743 .- 1611-3349. - 9783662439470 ; 8572, s. 211-222
-
Konferensbidrag (refereegranskat)abstract
- Given an undirected graph and two pairs of vertices $(s_i,t_i)$ for $i\in\{1,2\}$ we show that there is a polynomial time Monte Carlo algorithm that finds disjoint paths of smallest total length joining $s_i$ and $t_i$ for $i\in\{1,2\}$ respectively, or concludes that there most likely are no such paths at all. Our algorithm applies to both the vertex- and edge-disjoint versions of the problem. Our algorithm is algebraic and uses permanents over the polynomial rings $Z_2[x]$ and $Z_4[x]$ in combination with Mulmuley, Vazirani and Vazirani's isolation lemma to detect a solution. We develop a fast algorithm for permanents over these rings by modifying Valiant's 1979 algorithm for the permanent over $Z_{2^l}$.
|
|
| 9. |
- Dzhigaev, Dmitry, et al.
(författare)
-
Three-dimensional in situ imaging of single-grain growth in polycrystalline In2O3:Zr films
- 2022
-
Ingår i: Communications Materials. - : Springer Science and Business Media LLC. - 2662-4443. ; 3:1
-
Tidskriftsartikel (refereegranskat)abstract
- Strain and interactions at grain boundaries during solid-phase crystallization are known to play a significant role in the functional properties of polycrystalline materials. However, elucidating three-dimensional nanoscale grain morphology, kinetics, and strain under realistic conditions is challenging. Here, we image a single-grain growth during the amorphous-to-polycrystalline transition in technologically relevant transparent conductive oxide film of In2O3:Zr with in situ Bragg coherent X-ray diffraction imaging and transmission electron microscopy. We find that the Johnson-Mehl-Avrami-Kolmogorov theory, which describes the average kinetics of polycrystalline films growth, can be applied to the single grains as well. The quantitative analysis stems directly from imaging results. We elucidate the interface-controlled nature of the single-grain growth in thin films and reveal the surface strains which may be a driving force for anisotropic crystallization rates. Our results bring in situ imaging with coherent X-rays towards understanding and controlling the crystallization processes of transparent conductive oxides and other polycrystalline materials at the nanoscale.
|
|
| 10. |
|
|
