Institution
Helsinki University of Technology
About: Helsinki University of Technology is a based out in . It is known for research contribution in the topics: Artificial neural network & Finite element method. The organization has 8962 authors who have published 20136 publications receiving 723787 citations. The organization is also known as: TKK & Teknillinen korkeakoulu.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: Results suggest that the pre-attentive change-detection process generating the MMN utilized both auditory (sensory) and phonetic (categorical) representations of the test vowels.
212 citations
••
TL;DR: In this paper, the Coulomb potential was examined in terms of electron-positron production and the Klein paradox was reassessed, and it was shown that a Coulomb barrier in the Dirac equation can produce positron or electron emission spontaneously if the potential is strong enough.
212 citations
••
TL;DR: This paper characterise the key performance measures, mean handover rate and mean sojourn time from the point of view of an arbitrary cell, as well as the mean hand over rate in the network, and presents an exact analytical formula for the mean arrival rate across an arbitrary curve.
Abstract: In this paper we study the so-called random waypoint (RWP) mobility model in the context of cellular networks. In the RWP model the nodes, i.e., mobile users, move along a zigzag path consisting of straight legs from one waypoint to the next. Each waypoint is assumed to be drawn from the uniform distribution over the given convex domain. In this paper we characterise the key performance measures, mean handover rate and mean sojourn time from the point of view of an arbitrary cell, as well as the mean handover rate in the network. To this end, we present an exact analytical formula for the mean arrival rate across an arbitrary curve. This result together with the pdf of the node location, allows us to compute all other interesting measures. The results are illustrated by several numerical examples. For instance, as a straightforward application of these results one can easily adjust the model parameters in a simulation so that the scenario matches well with, e.g., the measured sojourn times in a cell.
211 citations
••
TL;DR: This Letter presents an experimental demonstration of cloaking for microwaves and simulation results for cloaking in the visible range and uses a simple structure made of metal layers to demonstrate a wideband and low-loss cloak.
Abstract: Electromagnetic cloaks are devices that make objects undetectable for probing with electromagnetic waves. The known realizations of transformational-optics cloaks require materials with exotic electromagnetic properties and offer only limited performance in narrow frequency bands. Here, we demonstrate a wideband and low-loss cloak whose operation is not based on the use of exotic electromagnetic materials, which are inevitably dispersive and lossy. Instead, we use a simple structure made of metal layers. In this Letter, we present an experimental demonstration of cloaking for microwaves and simulation results for cloaking in the visible range.
211 citations
••
21 Apr 1997TL;DR: It is shown how almost any error function can be used to construct a contrast function to perform the ICA estimation, and this means that one can use contrast functions that are robust against outliers.
Abstract: Independent component analysis (ICA) is a statistical signal processing technique whose main applications are blind source separation, blind deconvolution, and feature extraction. Estimation of ICA is usually performed by optimizing a 'contrast' function based on higher-order cumulants. It is shown how almost any error function can be used to construct a contrast function to perform the ICA estimation. In particular, this means that one can use contrast functions that are robust against outliers. As a practical method for finding the relevant extrema of such contrast functions, a fixed-point iteration scheme is then introduced. The resulting algorithms are quite simple and converge fast and reliably. These algorithms also enable estimation of the independent components one-by-one, using a simple deflation scheme.
211 citations
Authors
Showing all 8962 results
Name | H-index | Papers | Citations |
---|---|---|---|
Ashok Kumar | 151 | 5654 | 164086 |
Hannu Kurki-Suonio | 138 | 433 | 99607 |
Nicolas Gisin | 125 | 827 | 64298 |
Anne Lähteenmäki | 116 | 485 | 81977 |
Riitta Hari | 111 | 491 | 43873 |
Andreas Richter | 110 | 769 | 48262 |
Mika Sillanpää | 96 | 1019 | 44260 |
Markku Leskelä | 94 | 876 | 36881 |
Ullrich Scherf | 92 | 735 | 36972 |
Mikko Ritala | 91 | 584 | 29934 |
Axel H. E. Müller | 89 | 564 | 30283 |
Karl Henrik Johansson | 88 | 1089 | 33751 |
T. Poutanen | 86 | 120 | 33158 |
Elina Lindfors | 86 | 420 | 23846 |
Günter Breithardt | 85 | 554 | 33165 |