Judul: Effectiveness of Cashew Leaf Infusa (Anacardium occidentale L.) as Antidiarrhoea in Mice (Mus musculus)
Abstrak: Diare merupakan masalah kesehatan utama di Indonesia dengan angka kesakitan serta kematian yang masih tinggi. Pengobatan diare dapat diobati menggunakan bahan alami, salah satunya adalah tanaman jambu mete. Jambu mete merupakan tanaman yang tumbuh di Indonesia dan memiliki berbagai manfaat terutama dalam bidang kesehatan. Daun jambu mete (Anacardium occidentale L.) secara empiris telah digunakan oleh masyarakat sebagai obat diare. Penelitian ilmiah terkait infusa daun jambu mete sebagai antidiare belum diketahui. Penelitian ini bertujuan untuk menguji efektivitas infusa daun jambu mete sebagai obat antidiare dan kandungan senyawa metabolit sekunder dalam daun jambu mete. Penelitian ini menggunakan 30 ekor mencit sebagai hewan coba yang dibagi menjadi 5 kelompok. Kelompok perlakuan terdiri atas kontrol negatif (Tween 80 1%), kelompok kontrol positif (loperamid HCl), dan 3 kelompok infusa daun jambu mete konsentrasi bertingkat 25%, 50%, dan 100%. Variabel yang diamati dalam metode proteksi intestinal adalah frekuensi buang air besar, konsistensi tinja, onset, durasi, dan waktu persembuhan diare. Hasil pengujian fitokimia infusa daun jambu mete menunjukkan adanya alkaloid, flavonoid, steroid, terpenoid, saponin, dan tanin. Hasil penelitian dari metode proteksi intestinal menunjukkan efek antidiare pada semua konsentrasi infusa daun jambu mete. Konsentrasi terbaik sebagai antidiare ditunjukkan oleh infusa dengan konsentrasi 100%., Diarrheal diseases are a major health problem in Indonesia with high morbidity and mortality rates. Cashew is a plant that grows in Indonesia and has various benefits, especially in the health sector. According to experience cashew leaves (Anacardium occidentale L.) are used by the population as a medicine against diarrhea. There is no scientific research on cashew leaf infusa as an antidiarrheal. The aim of this study isto determine the efficacy of cashew leaf infusa as an antidiarrheal and the content of secondary metabolites in cashew leaves. For this study, 30 mice were used as experimental animals, which were divided into 5 groups. The treatment groups consisted of negative control (Tween 80 1%), a positive control group (loperamid HCl), and 3 groups of cashew leaf infusa at graded concentrations of 25%, 50%, and 100%. The variables observed in the intestinal protection method were frequency of defecation, stool consistency, onset, duration, and recovery time of diarrhea. The results of the phytochemical investigation of cashew leaf infusa showed the presence of alkaloids, flavonoids, steroids, terpenoids, saponins, and tannins. The results of the intestinal protection method showed antidiarrheal effects at all concentrations of cashew leaf infusa. Infusa showed the best antidiarrheal effect at a concentration of 100%.
Keyword: antidiare, infusa, daun jambu mete

Judul: Effectiveness of Clove Leaves (Syzygium aromaticum) Infusion As Antidiarrheal in Mice (Mus musculus)
Abstrak: Diare adalah penyakit gastrointestinal yang umum terjadi pada berbagai spesies hewan, dengan implikasi yang signifikan terhadap kesehatan dan produktivitas hewan. Penelitian ini menyelidiki khasiat infusa daun cengkeh sebagai agen antidiare pada mencit (Mus musculus). Sebanyak 30 ekor mencit dibagi menjadi lima kelompok, yaitu kontrol negatif, kontrol positif, konsentrasi infusa daun cengkeh 100%, 50%, dan 25%. Tahapan penelitian meliputi skrining fitokimia dan uji antidiare dengan methode proteksi intestinal. Mencit diberikan berbagai perlakuan secara oral berdasarkan pembagian kelompok pada metode proteksi usus dan dipantau selama 9 jam. Parameter yang digunakan dalam metode proteksi intestinal yakni frekuensi defekasi, konsistensi feses, awal mula dan durasi diare. Analisis fitokimia menunjukkan adanya kandungan alkaloid, flavonoid, saponin, dan tanin pada ekstrak daun cengkeh. Uji ANOVA satu arah dan uji Tukey digunakan untuk menganalisis data. Hasil penelitian menunjukkan konsentrasi infusa daun cengkeh 25% dan 50% tidak efektif, sedangkan konsentrasi infusa daun cengkih 100% efektif sebagai antidiare pada mencit. Konsentrasi infusa daun cengkeh 100% terbukti efektif sebagai antidiare., Diarrhea is a prevalent gastrointestinal ailment affecting various animal species, with significant implications for animal health and productivity. This study investigates the efficacy of Clove leaves infusion as an antidiarrheal agent in mice (Mus musculus). A total of 30 mice were divided into five groups: negative control, positive control, 100%, 50%, and 25% concentration of Clove leaves infusion. Intestinal protection methods and phytochemical screening test are used. Mice were orally administered various treatments based on group divisions in the intestinal protection method and monitored for 9 hours. The parameters used in the intestinal protection method are defecation frequency, stool consistency, and the onset and duration of diarrhea. Phytochemical analysis confirmed the presence of alkaloids, flavonoids, saponins, and tannins in the Clove leaves extract. ANOVA one-way test and Tukey tests were used to analyze the data. The result showed that 25% and 50% concentration of Clove leaves infusion are not effective while 100% concentration of Clove leaves infusion is effective as antidiarrheal in the mice. 100% concentration of Clove leaves infusion has show the effectiveness as an antidiarrheal.
Keyword: antidiare, infusa, mencit, antidiarrheal, infusion, mice, daun cengkeh, Clove leaves

Judul: The Construction of Greedy SVP LLL Algorithm
Abstrak: A lattice is a set of all integer linear combination of a set of linearly independent vectors in ℝ𝑛���. The independent vectors are called bases of lattice. Any lattice can be generated from many bases, and these bases have the same cardinality. In the lattice, the most fundamental and renowned problem is the Shortest Vector Problem (SVP). SVP is a tracking problem of the shortest nonzero vector in a lattice with equivalent bases. In two dimensions, SVP problem has resolved exactly by Gauss’ algorithm. When the lattice dimension is higher than two, A.K. Lenstra, H.W. Lenstra and L. Lovasz gave a LLL algorithm to compute approximation of nonzero shortest vector in the lattice. Reduced bases solution obtained from LLL algorithm still be an approximation and has polynomial running time of arbitrary dimension which large enough. In 1994, Schnoor and Euchner modified this LLL algorithm as a new variant which later was named deep insertion LLL algorithm. This algorithm is a modified version of the LLL algorithm to the terms of the exchange step to improve the accuracy of output of LLL reduced bases and applying it to the subset sum problem. The purpose of this research are: (1) Reconstruct the LLL algorithm and deep insertion LLL algorithm using a geometric approach. (2) Construct a greedy SVP LLL algorithm. (3) Implement the three algorithms in a symbolic programming language, and evaluate them experimentally. A bases ℬ=[𝐛���1,𝐛���2,…,𝐛���𝑛���] in ℝ𝑚��� is called reduced LLL with parameter 𝛿��� if satisfies: (a) |𝜇���𝑗���𝑖���|≤12, for every integer 𝑖���,𝑗��� with 1≤𝑖���<𝑗���<𝑛���. (b)𝛿���‖𝜋���𝑗���(𝐛���𝑗���)‖2≤‖𝜋���𝑗���(𝐛���𝑗���+1)‖2, for 𝑗���=1,2,…,𝑛���−1,where 𝛿��� is a reduced parameter of real numbers with 14<𝛿���<1. The first requirement is the reduced basis 𝛿��� must “nearly orthogonal” and in its computation case, this requirement can be reached out by using the Gram-Schmidt’s orthogonalization. While the second requirement is called exchange step, or used to called as Lovasz condition. By using both of these requirements, then they establish the LLL algorithm. Then, Schnoor and Euchner modify the LLL algorithm based on the requirements of the exchange step called the deep insertion LLL algorithm, where the exchange step is based on the comparison of the projected vector in orthogonal complement [𝐛���1,𝐛���2,…,𝐛���𝑘���−1]⊥ after j-th reduction. To construct greedy SVP LLL algorithm, the requirements of the exchange step is based on purely by comparing norm of lattice 𝐛���𝑗��� with norm lattice 𝐛���𝑖��� for 𝑖���=1,2,3…,𝑗���−1. The process of insertion reduced vector after the exchange step also has done greedily. Then, we calculate the number of arithmetic operation in greedy SVP LLL algorithm for further analysis. The result of our exprimentation for three algorithms on the certain matrix size shows that the running time of the three algorithms increases propotional to the size of the matrix. The result also shows that by using 𝛿���=34 for the LLL algorithm and the deep insertion LLL algorithm, and the greedy SVP LLL algorithm which is a new variant made by using no parameter of 𝛿���, outperform of the other of two previous algorithm in terms of speed with the same output.
Keyword: LLL algorithm, LLL deep insertion algorithm, greedy SVP LLL algorithm