Judul: Effectiveness of Gambier Extract Infusion (Uncaria gambir Roxb) as Antidiarrhea in Mice (Mus musculus)
Abstrak: Getah gambir sudah banyak dimanfaatkan oleh masyarakat untuk mengatasi berbagai penyakit, salah satunya adalah diare. Penelitian ini bertujuan untuk mengetahui efektivitas getah gambir sebagai antidiare dengan menggunakan metode proteksi intestinal yang dilihat dari parameter frekuensi, konsistensi, dan durasi. Penelitian ini juga bertujuan menentukan konsentrasi yang paling efektif dalam memberikan efek antidiare pada mencit dan mengetahui metabolit sekunder yang terkandung dalam getah gambir dengan uji fitokimia. Hewan coba dalam penelitian ini menggunakan mencit sebanyak 30 ekor dengan dibagi menjadi 5 kelompok. Kelompok perlakuan terdiri atas kelompok kontrol negatif, kontrol positif, dan tiga kelompok perlakuan yang diberi infusa getah gambir dengan konsentrasi 25%, 50%, dan 100% secara oral. Parameter yang dinilai dalam metode proteksi intestinal adalah frekuensi defekasi, konsistensi feses, dan durasi diare. Hasil penelitian menunjukkan getah gambir memiliki metabolit sekunder yang berpotensi sebagai antidiare seperti alkaloid, flavonoid, saponin, dan tanin pada uji fitokimia. Hasil dari metode proteksi intestinal menunjukkan kelompok perlakuan infusa getah gambir konsentrasi 25%, 50%, dan 100% terbukti mampu menurunkan frekuensi defekasi, memperbaiki konsistensi, dan mempersingkat waktu diare. Kelompok konsentrasi 25% dan 50% menunjukkan aktivitas antidiare lebih baik daripada konsentrasi 100%., Gambier extract has been widely used by the community to treat various diseases, one of which is diarrhea. This study aims to determine the effectiveness of gambier sap as an antidiarrhea using intestinal protection methods as seen from the parameters of frequency, consistency and duration. This research also aims to determine the most effective concentration in providing antidiarrheal effects in mice and determine the secondary metabolites contained in gambier sap using phytochemical tests. The experimental animals in this study used 30 mice divided into 5 groups. The treatment groups consisted of a negative control group, a positive control, and three treatment groups that were given gambier extract infusion at concentrations of 25%, 50%, and 100% orally. The parameters assessed in the intestinal protection method are defecation frequency, fecal consistency, and duration of diarrhea. The research results showed that gambier extract has secondary metabolites that have the potential to act as antidiarrhea such as alkaloids, flavonoids, saponins and tannins in phytochemical tests. The results of the intestinal protection method showed that the gambier extract infusion treatment group with concentrations of 25%, 50%, and 100% was proven to be able to reduce the frequency of defecation, improve consistency, and shorten the time of diarrhea. The 25% and 50% concentration groups exhibited better antidiarrheal activity than the 100% concentration
Keyword: antidiare, infusa, proteksi intestinal, uji fitokimia, Getah gambir

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