Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Leo Ojala

dblp:39/6058 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3Theory of computation · 2Software engineering, systems software and programming languages · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 100%
Theoretical computer science
2 papers
Mathematical optimization · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Integrated circuit design
digital signal generation
0.011979
Comments on "A Stable, Two-Multiplies-per-Cycle Algorithm for Digital Generation of Sinusoids in Real Time" · IEEE Trans. Computers 1979
Mathematical optimization › numerical analysis
numerical stability
0.011979
Comments on "A Stable, Two-Multiplies-per-Cycle Algorithm for Digital Generation of Sinusoids in Real Time" · IEEE Trans. Computers 1979
Mathematical optimization
stochastic optimization
0.011974
On a Class of Recursive Algorithms for Continuous Estimation of the Mean · IEEE Trans. Computers 1974

Methods — techniques the papers use, named apart from their topics

roundoff error analysis · 0.0recursive algorithm · 0.0statistical efficiency analysis · 0.0recursive estimation · 0.0
YearPublicationVenuePosition
2008 Modelling and Simulation of Quantum Teleportation and Dense Coding Using Predicate/Transition-Nets
Kimmo Varpaaniemi, Leo Ojala
Fundam. Informaticae2
2001 Modeling Feynman's quantum computer using stochastic high level Petri nets
abstract
One of the first and simplest models of a quantum computer was introduced by Richard Feynman (1985). The aim of our study is to extend the application area of Petri nets, which have been very successfully used to model classical engineering systems, by modeling the use and operation of Feynman's quantum computer. Originally, Feynman could not give a time bound for the completion of his computer's computation; a periodical measurement procedure was needed giving rise to a specific computational approach. We have chosen Feynman's NOT-computer, in the form of two /spl radic/NOT gates in series, as our object of demonstration; its use and operation are modeled in detail using stochastic high level Petri net formalism.
Leo Ojala, Elina Parviainen, Olli-Matti Penttinen, Harriett Beaver, Teemu Tynjälä
SMC1
2001 Modelling and analysing a distributed dynamic channel allocation algorithm for mobile computing using high-level net methods
Leo Ojala, Nisse Husberg, Teemu Tynjälä
Int. J. Softw. Tools Technol. Transf.1
1987 A PrT-Net Representation of Graph Grammars
Esa Montonen, Leo Ojala, Timo Tuuliniemi
WG2
1979 Comments on "A Stable, Two-Multiplies-per-Cycle Algorithm for Digital Generation of Sinusoids in Real Time"
abstract
Recently, Silverston1has given an algorithm to produce sinusoids with only two multiplications per cycle. With a simple substitution the algorithm can be further changed to have only one multiplication per cycle. The stability of these recursive algorithms depends on the roundoff errors and it cannot be stated straightforward.
Iiro Hartimo, Leo Ojala
IEEE Trans. Computers2
1974 On a Class of Recursive Algorithms for Continuous Estimation of the Mean
abstract
In this correspondence a class of algorithms for recursive estimation of the mean of a random yariable is described and its properties are studied. New algorithms are presented that are shown to be statisticaily more efficient than the previous algorithms, and only slightly less efficient than the optimal algorithm of the same type. The computation time remains the same as in the best previous algorithm, whereas the optimal algorithm implies a considerably longer computation time.
C. G. Aminoff, Leo Ojala, E. T. Rautanen
IEEE Trans. Computers2
1974 Discretization Error Analysis in Linear DDA Connections
abstract
In this paper mathematical models for digital integrators operating with multidigit increments are given, and the discretization error analysis of their linear connections is studied. The integration methods considered are linear multistep integration methods; some examples are studied in detail. Linear digital differential analyzer (DDA) connections are defined, and their use in connection with the numerical solution of the initial value problem is explained. Finally, the discretization error in these linear DDA connections has been analyzed in detail; the theoretical results have also been verified experimentally.
Lauri Hakkala, Leo Ojala
IEEE Trans. Computers2