Judul: Pengaruh Ekstrak Air Bekatul terhadap Kadar Malondialdehid Darah Tikus Sprague Dawley yang Diinduksi High-fat diet dan Propiltiourasil
Abstrak: Ekstrak air bekatul terbukti memiliki aktivitas antioksidan secara in vitro. Aktivitas antioksidan yang dimiliki oleh bekatul dapat mencegah peroksidasi lipid. Penelitian ini bertujuan mengidentifikasi pengaruh ekstrak air bekatul terhadap kadar malondialdehid serum darah tikus Sprague dawley yang diinduksi high-fat diet dan propiltiourasil. Parameter reaksi peroksidasi lipid pada penelitian ini adalah kadar malondialdehid serum darah. Larutan ekstrak air bekatul diberikan kepada tikus selama 7 hari dengan dosis 1.5 g/kg BB dan 3.0 g/kg BB. Pengukuran kadar malondialdehid menggunakan metode Thiobarbituric Acid Reactive Substances (TBARS). Hasil penelitian ini ekstrak air bekatul dapat menurunkan kadar malondialdehid serum darah tikus Sprague dawley. Ekstrak air bekatul dosis 3.0 g/kg BB menurunkan kadar malondialdehid lebih tinggi daripada ekstrak air bekatul dosis 1.5 g/kg BB.
Keyword: Antioksidan, bekatul, malondialdehid, propiltiourasil

Judul: Pengaruh Ekstrak Air Angkak terhadap Kadar Malondialdehid Serum Darah Tikus Sprague Dawley yang Diinduksi High Fat Diet dan Propiltiourasil.
Abstrak: Angkak merupakan produk fermentasi beras oleh kapang Monascus spp. Angkak memiliki aktivitas sebagai antioksidan. Aktivitas antioksidan yang dimiliki oleh angkak dapat mencegah terjadinya reaksi peroksidasi lipid. Penelitian ini bertujuan mengetahui pengaruh ekstrak air angkak terhadap kadar malondialdehid serum darah tikus Sprague Dawley yang diinduksi dengan pakan high fat diet dan dengan propiltiourasil. Kadar malondialdehid merupakan parameter reaksi peroksidasi lipid yang terjadi. Larutan ekstrak air angkak diberikan kepada tikus selama 7 hari dengan dosis 50 mg/kg BB dan 100 mg/kg BB. Pengukuran kadar malondialdehid dilakukan dengan menggunakan metode Thiobarbituric Acid Reactive Subtances (TBARS). Hasil penelitian ini adalah ekstrak air angkak dapat menurunkan kadar malondialdehid serum darah tikus Sprague Dawley. Penurunan kadar malondialdehid tersebut lebih besar untuk pemberian larutan ekstrak air angkak pada dosis 100 mg/kg BB dibandingkan dengan dosis 50 mg/kg BB.
Keyword: Angkak, antioksidan, malondialdehid, propiltiourasil

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