Publication Title A Comparative Survey of an Approximate Solution Method for Stochastic Delay Differential Equations
Publication Type journal
Publisher Applied Mathematics, 2023, 14, *-*
Publication Authors Emenonye Christian Emenonye 1 , Donatus Anonwa 2
Year Published 2023-04-04
Abstract This study is focused on the approximate solution for the class of stochastic
delay differential equations. The techniques applied involve the use of Cara-
theodory and Euler Maruyama procedures which approximated to stochastic
delay differential equations. Based on the Caratheodory approximate proce-
dure, it was proved that stochastic delay differential equations have unique
solution and established that the Caratheodory approximate solution con-
verges to the unique solution of stochastic delay differential equations under
the Cauchy sequence and initial condition. This Caratheodory approximate
procedure and Euler method both converge at the same rate. This is achieved
by replacing the present state with past state. The existence and uniqueness of
an approximate solution of the stochastic delay differential equation were
shown and the approximate solution to the unique solution was also shown.
Publication Type journal
Publisher International Journal of Basic Science and Technology March, Volume 8, Number 2, Page 59 - 63
Publication Authors Emenone, C.E.
Year Published 2022-04-20
Abstract A monoid M = (M, . , e) is an algebraic structure which under a defined binary
operation possesses the property of associativity and has identity element. i.e.
for all x,y,z in M, the operation x.(y.z) = (x.y).z and x.e = e.x = e in the operation
(x,y) ?(x.y). If M is a monoid and R in M an equivalence relation on M
satisfying the property x R u and y R v implies x.y R u.v , then R is a congruence
relation. The usefulness of function to monoids transformation in connection to
word construction in computer arithmetic is investigated. Machine approaches
derived from homomorphic theory are used to demonstrate the linked concepts
of simulation and realisation. Some theorems about algebraic structures and
machines are given and demonstrated with appropriate illustrations.
Publication Type journal
Publisher International Journal of Basic Science and Technology March, Volume 8, Number 3, Page 87 - 91
Publication Authors Emenonye, C.E.
Year Published 2022-06-28
Abstract Sequence / scheduling is the process of “turning arrivals and /or departure of
units to their required service”. It is used to refer to the “order” in which
problems are solved. Some types of scheduling are considered, the formula for
determining the total elapsed time derived and relevant theorems stated and
proved. It is also shown that with any sequence S 0 , the optimal sequence S * can
be obtained by the successive interchanges of consecutive jobs. For such
interchange each value of D n (s) is smaller than or equal to the one preceding the
interchange.
Publication Type journal
Publisher FUDMA Journal of Sciences (FJS)
Paper Link https://doi.org/10.33003/fjs-2022-0601-xxx
Publication Authors Emenonye, E. C., Nwakego, S. O. and Ehiwario, J. C.
Year Published 2022-08-08
Abstract Information technology has made the world a global village and tele communication plays an indispensible
role in this. Queues are predominant features in information processing and transfer. This work examines queue
model in relation to telecommunication transfer/ processing problems. Some of the prevalent questions in tele-
traffic are “how do we minimize time wastage (how long do I wait?) in the system and what will be the effect
on waiting time if the number of operations are altered. In this work, tele-traffic problem was formulated and
solution established through a model. Focasting ideas were also suggested. The queue theory has been applied
to answer the above questions. The model has shown increased service satisfaction and in turn minimizes cost.
Publication Type journal
Publisher FUDMA Journal of Sciences (FJS)
Paper Link https://doi.org/10.33003/fjs-2022-0601-1075
Publication Authors 1 Christian E. Emenonye, 2 Chinyere R. Chikwendu
Year Published 2022-08-04
Abstract The usefulness of machine in industries and other areas of life cannot be overemphasized. This work considers
the effect of wears and tears of machines as a result of usage and the value of depreciation with their effect on
productivity on the long run of an industrial machine. A consideration of machine whose life depends on the
rate of depreciation with time and magnitude of usage in production process has been identified to exhibit
some functional expression. The life span of a machine with effect from the date of acquisition in conjunction
with its capacity at book value is modeled as a geometric sequence a, ar, ???????? 2 ,…, ???????? ?????1 ,... . This model is used
to demonstrate some managerial decisions to maintain optimal production from machine usage with less break
down time. The practical application of these expressions is illustrated and the method proves effective in
machine life management. The method also proves helpful in production control for optimal yield for the
industry.
Publication Title Orthogonal Polynomial Technique For Achieving Optimum Stock Allocation I n N - Deport Firms
Publication Type journal
Publisher sJournal of Multidisciplinary Engineering Science and Technology (JMEST) ISSN: 2458-9403 Vol. 9 Issue 10, October - 2022
Publication Authors Emenonye Christian E. 1 2 and Chikwendu, Chinyere R.
Year Published 2022-10-10
Abstract Goods need to be kept in stock to meet demand timely. Stock control is a functional part of every manufacturing/distribution organization as goods need to move from the manufacturers to the consumers. The ability to keep goods in stock has its associated cost likewise the act of not keeping stock. The need to manage stock allocation makes for control so as to optimize returns. This research develops a polynomial approximation technique for optimizing stock allocation for multi-depot firms. It used polynomial as the basis for approximation based on the "Weiestrass theorem on polynomial approximation" to design an allocation technique that maximizes returns and minimizes costs. The number of warehouses is used on the polynomial to obtain a new allocation. The new allocation is weighted with the observed allocation by a normalizer to get the approximate (expected) allocation. The final allocations are then got by applying the stock approximation algorithm developed. Theorems showing that the cost associ- ated with the expected allocation is always lower than that of the observed and the algorithm is idempotent are proved. The technique is applied to a firm with eight depots and the outcome shows minimal cost and better returns. From the illustration shows the technique is suitable for multi-warehouse organizations. The results also show a better associated minimum costs and better returns. The technique yields an optimum allocation.