Judul: Potensi Ekstrak Air Angkak dalam Mencegah Peroksidasi Lipid (MDA) dan Efeknya Terhadap Organ Hati Tikus Sprague Dawley.
Abstrak: Angkak merupakan bahan pangan produk fermentasi beras oleh kapang Monascus purpureus. Angkak umum digunakan sebagai obat antihiperkolesterolemik karena mengandung senyawa monakolin K. Di samping itu, angkak juga memiliki beberapa senyawa metabolit lainnya yang memiliki aktivitas antioksidan. Penelitian ini bertujuan menganalisis potensi ekstrak air angkak dalam mencegah peroksidasi lipid di serum dan hati serta menganalisis efeknya terhadap organ hati tikus Sprague Dawley yang diinduksi propiltiourasil dan high fat diet. Parameter uji yang diamati adalah konsentrasi malondialdehid (MDA) serum darah dan hati, aktivitas enzim aminotransferase serum, dan gambaran mikroskopik hati. Tikus sebanyak 25 ekor dibagi menjadi lima kelompok perlakuan secara acak, yaitu kelompok kontrol (normal, positif, dan negatif) dan kelompok yang diinduksi ekstrak air angkak secara peroral dengan dosis 50 mg/kg BB (A1) dan dosis 100 mg/kg BB (A2). Dosis 100 mg/kg BB menunjukkan penghambatan peningkatan konsentrasi MDA pada serum dan hati serta aktivitas enzim ALT dan AST yang paling baik. Histopatologi hati kelompok induksi ekstrak menunjukkan adanya perbaikan jaringan, namun pada A2 ditemukan adanya degenerasi lemak.
Keyword: Angkak, aminotransferase, antioksidan, histopatologi hati, malondialdehid

Judul: Potensi Ekstrak Air Angkak terhadap Malondialdehid, Enzim Aminotransferase, dan Histopatologi Hati dan Ginjal Tikus yang Diinduksi Aloksan.
Abstrak: Angkak merupakan produk fermentasi beras oleh kapang galur Monascus sp. yang banyak digunakan sebagai pewarna makanan. Angkak diketahui memiliki aktivitas antioksidan yang mampu menurunkan kadar glukosa darah pada tikus hiperglikemia yang diinduksi aloksan. Namun, penelitian lebih lanjut tentang efek pemberian ekstrak air angkak belum dilakukan. Penelitian ini bertujuan menguji potensi ekstrak air angkak terhadap konsentrasi malondialdehid serum, aktivitas enzim aminotransferase, dan histopatologi tikus yang diinduksi aloksan. Tikus yang digunakan pada penelitian ini berjumlah 25 ekor yang terbagi dalam 5 kelompok yaitu kelompok normal (NO), kelompok kontrol negatif (NE), kelompok kontrol positif (PO), kelompok ekstrak air angkak 50 mg/kg BB (D1), dan kelompok ekstrak air angkak 100 mg/kg BB (D1). Kadar malondialdehid dan aktivitas enzim AST tidak menunjukkan penurunan, tetapi aktivitas enzim ALT mengalami penurunan. Gambaran histopatologi organ hati menunjukkan adanya degenerasi lemak dan nekrosis, serta pada ginjal menunjukkan adanya pelebaran glomerulus.
Keyword: Aminotransferase, angkak, histopatologi, malondialdehid

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