Judul: Khasiat Antioksidan Ekstrak Pare: Kajian In Vivo Pada Tikus Hiperglikemia
Abstrak: Dewasa ini diabetes merupakan gangguan metabolik dengan prevalensi yang tinggi. Kondisi diabetes dapat memicu timbulnya radikal bebas yang dapat membahayakan sel, antara lain melalui reaksi peroksidasi lipid. Salah satu herbal tradisional yang banyak dikonsumsi masyarakat untuk mengatasi diabetes adalah buah pare. Penelitian ini bertujuan menguji potensi antioksidasi ekstrak buah pare (Momordica charantia) terhadap konsentrasi lipid peroksida hati tikus hiperglikemia. Tikus jantan Sprague Dawley dewasa dibagi menjadi 3 kelompok utama. Kelompok pertama adalah kelompok normal yang hanya diberi pakan standar dan akuades. Kelompok kedua diinduksi STZ secara bertahap (3 kali penyuntikan intraperitoneal dengan selang waktu 1 hari) dengan dosis total 55 mg/kg BB, dan kelompok ketiga diinduksi STZ dengan dosis tunggal 35 mg/kg BB. Setelah mengalami hiperglikemia, tikus pada kelompok 2 dan 3 dibagi lagi menjadi 3 subkelompok, yaitu kelompok kontrol positif (diberi akuades), kelompok yang diberi ekstrak pare dosis rendah (125 mg/kg BB), dan kelompok yang diberi ekstrak pare dosis rendah (575 mg/kg BB). Pemberian ekstrak pare dilakukan selama 2 bulan. Analisis lipid peroksida hati dilakukan dengan metode TBA.
Keyword: 

Judul: Aktivitas Antihiperglikemia Ekstrak Air Angkak pada Tikus Galur Sprague Dawley yang Diinduksi Aloksan
Abstrak: Diabetes mellitus merupakan salah satu gangguan metabolik pada metabolisme karbohidrat, dicirikan dengan kondisi hiperglikemia. Penelitian ini bertujuan menguji aktivitas antihiperglikemia ekstrak air angkak pada tikus yang diinduksi aloksan berdasarkan kondisi klinis, bobot badan dan glukosa darah. Sebanyak 25 ekor tikus dikelompokkan menjadi kelompok normal, kontrol negatif, kontrol positif diberi glibenklamida dengan dosis 5 mg/kg BB, kelompok dosis 1 diberi ekstrak air angkak dengan dosis 50 mg/kg BB dan dosis 2 diberi ekstrak air angkak dengan dosis 100 mg/kg BB. Ekstrak air angkak mengandung flavonoid, saponin dan alkaloid. Aktivitas antihiperglikemia ekstrak air angkak dosis 50 mg/kg BB dapat menurunkan kadar glukosa darah sebesar 31.02% dan menaikkan bobot badan sebesar 3.49%, sedangkan dosis 100 mg/kg BB dapat menurunkan kadar glukosa darah 64.55% dan menaikkan bobot badan sebesar 13.61%.
Keyword: angkak, antihiperglikemia, diabetes mellitus, glukosa darah

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