This report presents the studies carried out on two modifications suggested in the literature for Levenberg-Marquardt algorithm. The modifications are applicable to feed-forward neural networks. One modification [18], made on performance index, reduces computational complexity of the Levenberg-Marquardt algorithm, while the other one [17], made on calculation of the gradient information, improv...

Interaktive Dienste für das sicherheitskritische System (SKS) Fahrer-Fahrzeug müssen nicht nur ihre Komfortaufgaben erfüllen, sie dürfen auch nicht den Fahrer bei der Wahrnehmung seiner sicherheitskritischen Aufgabe Fahrzeugführung ablenken und somit im Gesamtsystem Fahrer-Fahrzeug Ursache für Auslassungsfehler oder zeitliche Fehler sein. Das aktuelle Methodenarsenal zur Zusicherung dieser Eige...

Geostatistics have become the dominant tool for probabilistic estimation of properties of heterogeneous formations at points where data are not available. Ordinary kriging, the starting point in development of other geostatistical techniques, has a number of serious limitations, chief among which is the intrinsic hypothesis of the (second order) stationarity of the underlying random field. Atte...

Currently, internal combustion engines contribute to the problem of global warming due their need use products derived from fossil resources. To mitigate above problem, this study proposes coatings on cylinder bore in order reduce fuel consumption and polluting emissions. Therefore, present a numerical model is developed which tribological behavior, heat fluxes, leakage gases chamber are consid...

Recension av: Ruukin elämä. Patruunoita ja työläisiä Kellokoskella. Hanna Forssell Gunilla Carlander-Reuterfelt. SKS, Helsingfors, 2009.

Recension av: Hoitotyön muistot. Red. Helga Tahvanainen & Juha Nirkko. Helsinki 2000 (SKS). 384 s., ill.

The relationship between Boolean proof nets of multiplicative linear logic (APN) and Boolean circuits has been studied [Ter04] in a non-uniform setting. We refine the results taking care of uniformity: the relationship can be expressed in term of the (Turing) polynomial hierarchy. We give a proofs-as-programs correspondence between proof nets and deterministic as well as non-deterministic Boole...

Algorithms reducing the storage requirement of the nearest neighbor classifier (NNC) can be divided into three main categories: Fast searching algorithms, Instance-based learning algorithms and Prototype based algorithms. In this paper an algorithm, called LVQPRU, is proposed for pruning NNC prototype vectors so that a compact classifier with good performance can be obtained. The basic condensi...