SearcharxivSearch

arXiv subjects

Emmanuel N. Osegi

Publications and source records attributed to Emmanuel N. Osegi.

3 recordsLinked to original sources

A Generative Model for Multi-Dialect Representation

In the era of deep learning several unsupervised models have been developed to capture the key features in unlabeled handwritten data. Popular among them is the Restricted Boltzmann Machines RBM. However, due to the novelty in handwritten multidialect data, the RBM may fail to generate an efficient representation. In this paper we propose a generative model, the Mode Synthesizing Machine MSM for on-line representation of real life handwritten multidialect language data. The MSM takes advantage of the hierarchical representation of the modes of a data distribution using a two-point error update to learn a sequence of representative multidialects in a generative way. Experiments were performed to evaluate the performance of the MSM over the RBM with the former attaining much lower error values than the latter on both independent and mixed data set.

cs.CV

PTILE: A framework for the Evaluation of Power Transformer Insulation Life in Electric Power System

In this paper, a framework is developed for power transformer (Generator Step up Unit) insulation life evaluation (PTILE) study on power system Network. Parameters used for studies include real time sample data obtained from power transformer field studies in the South-South Niger Delta region of Nigeria. It is used for performing simulations over varying number of years. Simulation reports shows a polynomial running time complexity and validates the stochastic Hot Spot theory indicating that the transformers in such region should be replaced sooner due to higher hot spots and transformer loading in such regions

cs.CE

Modified Dijkstra Algorithm with Invention Hierarchies Applied to a Conic Graph

A modified version of the Dijkstra algorithm using an inventive contraction hierarchy is proposed. The algorithm considers a directed acyclic graph with a conical or semi-circular structure for which a pair of edges is chosen iteratively from multi-sources. The algorithm obtains minimum paths by using a comparison process. The comparison process follows a mathematical construction routine that considers a forward and backward check such that only paths with minimum lengths are selected. In addition, the algorithm automatically invents a new path by computing the absolute edge difference for the minimum edge pair and its succeeding neighbour in O (n) time. The invented path is approximated to the hidden path using a fitness criterion. The proposed algorithm extends the multi-source multi-destination problem to include those paths for which a path mining redirection from multi-sources to multi-destinations is a minimum. The algorithm has been applied to a hospital locator path finding system and the results were quite satisfactory.

cs.DS