Heritage Institute of Technology

About: Heritage Institute of Technology is a based out in . It is known for research contribution in the topics: Steganography & Support vector machine. The organization has 581 authors who have published 1045 publications receiving 8345 citations.

Impact of COVID-19 pandemic on viral hepatitis in Africa: Challenges and way forward.

Abstract: With the overwhelming COVID-19 pandemic in Africa, many other severe epidemics have been given low priority, such as viral hepatitis. Patient mortality due to viral hepatitis has raised concern to COVID-19 patients due to compromise with undiagnosed hepatitis in Africa. The pandemic has worsened the control of the viral hepatitis epidemic as healthcare control facilities have moved their focus towards curbing COVID-19 infections. However, different challenges have arisen to viral hepatitis patients because of low health attention that declines the progress of already diagnosed hepatitis patients. Follow-up plans, routine testing and treatment plans for viral hepatitis are no longer as strict with the human resources transferred towards combating the pandemic. Thus, a global effort is required to abide by renewed recommendations to eradicate viral hepatitis in Africa that also fit the current picture of the COVID-19 pandemic. The article discusses the current challenges viral hepatitis patients faced during the COVID-19 pandemic and important recommendations that can see through these challenges in Africa.

Automatic Speech Recognition using correlation analysis

Abstract: The growth in wireless communication and mobile devices has supported the development of Speech recognition systems. So for any speech recognition system feature extraction and patter matching are two very significant terms. In this paper we have developed a simple algorithm for matching the patterns to recognize speech. We used Mel frequency cepstral coefficients (MFCCs) as the feature of the recorded speech. This algorithm is implemented simply by using the principle of correlation. All the simulation experiments were carried out using MATLAB where the method produced relatively good results. This paper gives a details introduction of recorded speech processing, design considerations and evaluation results.

Geometrically Linear and Nonlinear First-Ply Failure Loads of Composite Cylindrical Shells

Abstract: Review of the literature on first-ply failure of composite shells shows that research reports on first-ply failure of moderately thin, laminated composite cylindrical shell panels, using a geometrically nonlinear approach, are not available. The present paper aims to fill this deficiency. It uses a finite-element code developed using eight-noded, doubly-curved elements combined with modified Sanders’ first-approximation theory for thin shells and von Karman-type nonlinear strains. The accuracy of the present geometric nonlinear and first-ply failure formulations are verified separately through solutions of two benchmark problems. Failure loads, failure modes (for individual stress or strain failure) or tendencies (for interactive stress failures), and the locations from where the failures initiate are reported. The results are discussed critically to formulate design guidelines, suggesting practical values for factors of safety applicable to failure loads. Such suggestions also consider the servic...

Witness for edge states and its characteristics

Abstract: Edge states lying at the edge of positive-partial-transpose- (PPT-) entangled states have a very intriguing existence and their detection is equally interesting. We present here a witness for detection of edge states. We then compare between our proposed witness operator and the witness operator proposed by Lewenstein et al. [Phys. Rev. A 62, 052310 (2000)] in terms of the efficiency in the detection of PPT entangled states. In this regard we show that this operator is finer than the operator of Lewenstein et al. in some restrictions. We also discuss about its experimental realization via Gell-Mann matrices.

Comparative performance of modified simulated annealing with simple simulated annealing for graph coloring problem

Abstract: The problems which are NP-complete in nature are always attracting the computer scientists to develop some heuristic algorithms, generating optimal solution in time-space efficient manner compared to the existing ones. Coloring of the vertices of a graph with minimum number of colours belongs to the same category, where the algorithm designers are trying to propose some new algorithms for better result. Here, we have designed modified Simulated Annealing (MSA) for optimal vertex coloring of a simple, symmetric and connected graph (GCP). The algorithm has been tested upon a series of benchmarks including large scale test case and has shown better output than the simple or non-modified version of the same algorithm. This paper describes the advancement of performance of simple SA applied upon the problem of graph coloring using a specially designed operator called random change operator instead of the general change operator. Our work is still going on for designing better algorithms generating optimal solutions.