Judul: Khasiat ekstrak bawang putih [Allium sativum] sebagai obat antidiare
Abstrak: Penelitian ini bertujuan untuk mengetahui efek antidiare ekstrak bawang putih pada mencit yang diinduksi oleh Oleum Ricini serta membandingkan potensinya dengan sediaan antidiare golongan parasimpatolitikum (Atropin sulfat) dan Karbo Absorbensia. Sebanyak 40 ekor mencit dibagi ke dalam 5 kelompok, yaitu kelompok kontrol negatif dengan hanya diberikan 0.2cc aquades, kelompok kontrol positif golongan parasimpatolitikum yaitu atropin sebanyak 0.2cc, kelompok kontrol positif golongan absorbensia yaitu norit sebanyak 1cc/100gr BB, kelompok ekstrak dosis rendah (0,007cc) dan kelompok ekstrak dosis tinggi (0.35cc). Penelitian ini menggunakan metode proteksi diare terhadap Oleum Ricini dan transit intestinal. Hasil penelitian menunjukkan bawang putih tidak dapat memproteksi diare yang disebabkan Oleum Ricini secara signifikan penurunan frekuensi defeksi, onset diare dan meningkatkan konsistensi feses, memperkecil rasio transit intestinal dan berbeda signifikan (p<0.05) Akan tetapi ekstrak bawang putih dapat memperlambat transit intestinal. Dapat dilihat sifat antidiarenya bawang putih adalah antimikroba dan hanya mempengaruhi diare sekretorik pasif…
Keyword: Anti-diarrhea, Garlic, Extract, Oleum ricini, Transit intestinal

Judul: Effectiveness of Garlic Skin (Allium sativum L.) Infusion as Antidiarrheal in Mice (Mus musculus).
Abstrak: Tanaman bawang putih telah banyak digunakan sebagai obat herbal dalam mengatasi penyakit, akan tetapi belum ada penelitian mengenai aktivitas antidiare pada tanaman ini. Penelitian ini bertujuan mengidentifikasi kandungan senyawa aktif metabolit sekunder kulit bawang putih menggunakan uji fitokimia, serta mengetahui aktivitas antidiare dari infusa kulit bawang putih dengan metode proteksi intestinal. Penelitian ini menggunakan 25 ekor mencit jantan yang dibagi menjadi lima kelompok perlakuan: kelompok kontrol positif (Loperamide HCl), kelompok kontrol negatif (Tween-80 [1%]), dan tiga kelompok perlakuan infusa kulit bawang putih dengan konsentrasi 25%, 50%, dan 100%. Parameter yang diamati pada metode proteksi intestinal yaitu frekuensi defekasi, konsistensi feses, waktu terjadinya diare, durasi diare, dan waktu penyembuhan. Berdasarkan hasil uji fitokimia, infusa kulit bawang putih mengandung senyawa alkaloid, flavonoid, saponin, dan tanin. Hasil penelitian menunjukkan infusa kulit bawang putih dengan konsentrasi 25%, 50%, dan 100% memiliki aktivitas antidiare. Infusa kulit bawang putih konsentrasi 25% merupakan dosis terbaik dalam mengobati diare. / Garlic plants have been widely used as herbal medicine in overcoming diseases, but there has been no research on the antidiarrheal activity of this plant. This study aims to identification several active compounds of garlic skin with phytochemical test, and determine the antidiarrheal activity of garlic skin infusion with intestinal protection method. This study used 25 male mice which were divided into five treatment groups: the positive control group (Loperamide HCl), the negative control group (Tween-80 1%), and three treatment groups of garlic skin infusion with concentrations 25%, 50%, and 100%. The parameters observed for intestinal protection method were defecation frequency, stool consistency, onset of diarrhea, duration of diarrhea, and diarrhea recovery time. Garlic skin infusion contains alkaloid, flavonoid, saponin, and tanin. Based on both methods, garlic skin infusion with concentrations of 25%, 50%, and 100% had antidiarrheal activity. Garlic skin infusion with concentration 25% is the best dose for treating diarrheal.
Keyword: antidiare, bawang putih, infusa, proteksi intestinal, uji fitokimia. / antidiarrheal, garlic, infusion, intestinal protection, phytochemical test.

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