An approach to measure route quality and refine the route during the voyage using characteristic coefficients

The paper presents a method to validate and refine the ship's route during the voyage. The method is based on computing several characteristic coefficients that represent and measure route properties. Thru the analysis of the values of these coefficient, one can analyse the overall route quality and detect possibly dangerous discrepancies between the actual route and the planned route.The paper describes the proposed characteristic coefficients, the process of route refinement and the method for prediction and validation of the route's future changes.

Techniques for Vocabulary Expansion in Hybrid Speech Recognition Systems

The problem of out of vocabulary words (OOV) is typical for any speech recognition system, hybrid systems are usually constructed to recognize a fixed set of words and rarely can include all the words that will be encountered during exploitation of the system. One of the popular approach to cover OOVs is to use subword units rather then words. Such system can potentially recognize any previously unseen word if the word can be constructed from present subword units, but also non-existing words can be recognized. The other popular approach is to modify HMM part of the system so that it can be easily and effectively expanded with custom set of words we want to add to the system. In this paper we explore different existing methods of this solution on both graph construction and search method levels. We also present a novel vocabulary expansion techniques which solve some common internal subroutine problems regarding recognition graph processing.

Parallel genetic algorithm for planning safe and optimal route for ship

The paper represents an algorithm for planning safe and optimal routes for transport facilities with unrestricted movement direction that travel within areas with obstacles. Paper explains the algorithm using a ship as an example of such a transport facility. This paper also provides a survey of several existing solutions for the problem. The method employs an evolutionary algorithm to plan several locally optimal routes and a parallel genetic algorithm to create the final route by optimising the abovementioned set of routes. The routes are optimized against the arrival time, assuming that the optimal route is the route with the lowermost arrival time. It is also possible to apply additional restriction to the routes.