S
Seppo J. Ovaska
Researcher at Aalto University
Publications - 281
Citations - 4280
Seppo J. Ovaska is an academic researcher from Aalto University. The author has contributed to research in topics: Soft computing & Adaptive filter. The author has an hindex of 32, co-authored 281 publications receiving 4120 citations. Previous affiliations of Seppo J. Ovaska include Lappeenranta University of Technology & University of Helsinki.
Papers
More filters
Journal ArticleDOI
Industrial applications of soft computing: a review
Yasuhiko Dote,Seppo J. Ovaska +1 more
TL;DR: This paper intends to remove the gap between theory and practice and attempts to learn how to apply soft computing practically to industrial systems from examples/analogy, reviewing many application papers.
Journal ArticleDOI
Noise reduction in zero crossing detection by predictive digital filtering
O. Vainio,Seppo J. Ovaska +1 more
TL;DR: A systematic design procedure is described for the proposed filter-based synchronization method, taking into account the specified line frequency tolerance.
Journal ArticleDOI
Angular acceleration measurement: a review
Seppo J. Ovaska,S. Valiviita +1 more
TL;DR: This paper gives a review of sensors, methods, and algorithms available for the measurement of angular acceleration in delay-sensitive, real-time applications and suggests two principal challenges for the research and development community: to develop economical and accurate angular accelerometers with unlimited rotation range, and to create wideband indirect techniques with small lag and high signal-to-error ratio.
Book
Real-Time Systems Design and Analysis : Tools for the Practitioner
TL;DR: The Fourth Edition of Real-Time Systems Design and Analysis gives software designers the knowledge and the tools needed to create real-time software using a holistic, systems-based approach.
Journal ArticleDOI
A general framework for statistical performance comparison of evolutionary computation algorithms
TL;DR: The proposed method for comparing the performance of evolutionary computation algorithms is sufficiently flexible to allow the researcher to choose how performance is measured, does not rely upon distributional assumptions, and can be extended to analyze many other randomized numeric optimization routines.