Institution
Aalto University
Education•Espoo, Finland•
About: Aalto University is a education organization based out in Espoo, Finland. It is known for research contribution in the topics: Population & Carbon nanotube. The organization has 9969 authors who have published 32648 publications receiving 829626 citations. The organization is also known as: TKK & Aalto-korkeakoulu.
Topics: Population, Carbon nanotube, Cellulose, Graphene, Thin film
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The European Space Agency's Planck satellite was launched on 14 May 2009, and has been surveying the sky stably and continuously since 13 August 2009 as mentioned in this paper, and it will continue to gather scientific data until the end of its cryogenic lifetime.
Abstract: The European Space Agency's Planck satellite was launched on 14 May 2009, and has been surveying the sky stably and continuously since 13 August 2009. Its performance is well in line with expectations, and it will continue to gather scientific data until the end of its cryogenic lifetime. We give an overview of the history of Planck in its first year of operations, and describe some of the key performance aspects of the satellite. This paper is part of a package submitted in conjunction with Planck's Early Release Compact Source Catalogue, the first data product based on Planck to be released publicly. The package describes the scientific performance of the Planck payload, and presents results on a variety of astrophysical topics related to the sources included in the Catalogue, as well as selected topics on diffuse emission.
547 citations
••
TL;DR: This work presents a general method of folding arbitrary polygonal digital meshes in DNA that readily produces structures that would be very difficult to realize using previous approaches.
Abstract: It was suggested more than thirty years ago that Watson-Crick base pairing might be used for the rational design of nanometre-scale structures from nucleic acids. Since then, and especially since the introduction of the origami technique, DNA nanotechnology has enabled increasingly more complex structures. But although general approaches for creating DNA origami polygonal meshes and design software are available, there are still important constraints arising from DNA geometry and sense/antisense pairing, necessitating some manual adjustment during the design process. Here we present a general method of folding arbitrary polygonal digital meshes in DNA that readily produces structures that would be very difficult to realize using previous approaches. The design process is highly automated, using a routeing algorithm based on graph theory and a relaxation simulation that traces scaffold strands through the target structures. Moreover, unlike conventional origami designs built from close-packed helices, our structures have a more open conformation with one helix per edge and are therefore stable under the ionic conditions usually used in biological assays.
547 citations
••
TL;DR: In this article, the authors describe the all-sky Planck catalogue of clusters and cluster candidates derived from Sunyaev-Zeldovich (SZ) effect detections using the first 15.5 months of Planck satellite observations.
Abstract: We describe the all-sky Planck catalogue of clusters and cluster candidates derived from Sunyaev-Zeldovich (SZ) effect detections using the first 15.5 months of Planck satellite observations. The catalogue contains 1227 entries, making it over six times the size of the Planck Early SZ (ESZ) sample and the largest SZ-selected catalogue to date. It contains 861 confirmed clusters, of which 178 have been confirmed as clusters, mostly through follow-up observations, and a further 683 are previously-known clusters. The remaining 366 have the status of cluster candidates, and we divide them into three classes according to the quality of evidence that they are likely to be true clusters. The Planck SZ catalogue is the deepest all-sky cluster catalogue, with redshifts up to about one, and spans the broadest cluster mass range from (0.1 to 1.6) x 10(15) M-circle dot. Confirmation of cluster candidates through comparison with existing surveys or cluster catalogues is extensively described, as is the statistical characterization of the catalogue in terms of completeness and statistical reliability. The outputs of the validation process are provided as additional information. This gives, in particular, an ensemble of 813 cluster redshifts, and for all these Planck clusters we also include a mass estimated from a newly-proposed SZ-mass proxy. A refined measure of the SZ Compton parameter for the clusters with X-ray counter-parts is provided, as is an X-ray flux for all the Planck clusters not previously detected in X-ray surveys.
545 citations
••
TL;DR: The balanced scorecard (BSC) seems to be the latest management fashion to sweep the organizational world as discussed by the authors. Despite its apparent popularity, we have only limited systematic, research-based evidence on BSC applications.
544 citations
••
TL;DR: The COST 2100 channel model is a geometry-based stochastic channel model (GSCM) that can reproduce MIMO channels over time, frequency, and space as mentioned in this paper.
Abstract: The COST 2100 channel model is a geometry- based stochastic channel model (GSCM) that can reproduce the stochastic properties of MIMO channels over time, frequency, and space. In contrast to other popular GSCMs, the COST 2100 approach is generic and flexible, making it suitable to model multi-user or distributed MIMO scenarios. In this article a concise overview of the COST 2100 channel model is presented. Main concepts are described, together with useful implementation guidelines. Recent developments, including dense multipath components, polarization, and multi-link aspects, are also discussed.
544 citations
Authors
Showing all 10135 results
Name | H-index | Papers | Citations |
---|---|---|---|
John B. Goodenough | 151 | 1064 | 113741 |
Ashok Kumar | 151 | 5654 | 164086 |
Anne Lähteenmäki | 116 | 485 | 81977 |
Kalyanmoy Deb | 112 | 713 | 122802 |
Riitta Hari | 111 | 491 | 43873 |
Robin I. M. Dunbar | 111 | 586 | 47498 |
Andreas Richter | 110 | 769 | 48262 |
Mika Sillanpää | 96 | 1019 | 44260 |
Muhammad Farooq | 92 | 1341 | 37533 |
Ivo Babuška | 90 | 376 | 41465 |
Merja Penttilä | 87 | 303 | 22351 |
Andries Meijerink | 87 | 426 | 29335 |
T. Poutanen | 86 | 120 | 33158 |
Sajal K. Das | 85 | 1124 | 29785 |
Kalle Lyytinen | 84 | 426 | 27708 |