No abstract

From the very first of human civilization, traditional medicines have been used to treat various ailments. Although herbal medicines have some limitations from a scientific point of view concerning their formulations, they are believed to have fewer side effects and are cost effective as well as available, especially where modern drugs are not easily found, i.e. rural and remote areas. To treat various diseases, traditional medicinal practitioners (TMPs) use different plants which are safe and effective for related ailments. But to find out how TMPs do that without any scientific basement, we conducted a survey at Kishoreganj district of Bangladesh. Here, we found that they use different parts of a plant such as roots, leaves, even the whole plant to treat diseases like schizophrenia. After studying the data collected from the ethnomedicinal study, we found that Allium cepa, Aegle marmelos, Acorus calamus, Brassica oleracea, Ocimum sanctum and Rauvolfia serpentina possess traditional value to treat schizophrenia like psychosis (Table 1). In this present review, we are going to discuss the traditional formulations and their pharmacological activities. We also draw information from some renowned scientific journals to make our studies more authentic. We hope that this study will help to establish the aforementioned plants as traditional anti-psychotic drugs and also help researchers to find a novel compound in the treatment of schizophrenia.

No abstract

No abstract

Addressing scheduling problems with the best graph coloring algorithm has always been very challenging. However, the university timetable scheduling problem can be formulated as a graph coloring problem where courses are represented as vertices and the presence of common students or teachers of the corresponding courses can be represented as edges. After that, the problem stands to color the vertices with lowest possible colors. In order to accomplish this task, the paper presents a comparative study of the use of graph coloring in university timetable scheduling, where five graph coloring algorithms were used: First Fit, Welsh Powell, Largest Degree Ordering, Incidence Degree Ordering, and DSATUR. We have taken the Military Institute of Science and Technology, Bangladesh as a test case. The results show that the Welsh-Powell algorithm and the DSATUR algorithm are the most effective in generating optimal schedules. The study also provides insights into the limitations and advantages of using graph coloring in timetable scheduling and suggests directions for future research with the use of these algorithms.