We study the dynamics of diabetes in a population based on the etiology of the disease. In carrying out the study, we proposed that; a population generate non-diabetic non susceptible sub-population, and a non-diabetic susceptible sub-population, the non-diabetic susceptible sub-population can further generate a population of diabetics without complication, who can later transit to a population with diabetic complications. Based on the etiology dynamics, we proposed control measures at the point of transition from the population to non-diabetic susceptible population, and at the point of transition from diabetes without complications to diabetes with complications. For this study, we intend to look at the control measure. In this regard, we proposed a mathematical model for the dynamics of diabetes by incorporating a control parameter h, so as to investigate how to control diabetes in a population. The result of the study suggested that; we need to control the incidence of diabetes, I(t), and improve the control measure, h, for transition from diabetes without complication to diabetes with complication. Thus entailing going further in research to; Look into the dynamics of the genetics of transmission of the diabetic gene, to investigate how to reduce the spread (and hence the incidence I(t)) of diabetes, and to also look into the influence of the control factor h, on the dynamics of glucose metabolism, this will give an insight on how to manage diabetic patients.

No abstract

No abstract

Assuming the desire of a 9-man Election Tribunal Judges is to protect their judgment from public knowledge before judgment is delivered. They decided to lock up their judgment in a cabinet. They agree that any 5 judges can open the cabinet to retrieve the document, but not less than 5 can do so. To achieve this, they will need 126 5 9  c padlocks to secure the cabinet. This is prohibitive and impracticable in real life. A secret sharing algorithm will achieve the judges' desire without having to purchase 126 padlocks to secure the cabinet.

Okike's Merged Irregular Transposition Cipher is a new technique for enciphering information along the superhighway. In this method, a message to be transmitted along the superhighway is first split into parts and each part is encrypted separately before transmission occurs. The positions of the split encrypted messages may be swapped. This work deployed a message with approximately 58 characters to study the behavior of the error level as the message is split from 2 through 10. It was observed that as the number of split increases, the error level decreases. Similarly, the optimal split number occurs when the integer value of the error begins to repeat as is seen when the split number equals 8.