Judul: Efek imbuhan tepung dalam nasi yang difermentasi oleh kapang monascus purpureus JMBa terhadap kadar kolesterol dan histopatologi hati tikus galur sprague dawley
Abstrak: Radikal bebas dapat menyerang ikatan-ikatan rangkap dari lipida yang terdapat di dalam sel, akibatnya fluiditas menbran dan sederetan reseptor seluler akan berkurang, selain itu juga dapat menimbulkan penumpukan kalsium dan lipofusin. Sistem antioksidan mampu melindungi jaringan tubuh dari serangan radikal bebas. Glutation Peroksidase (GPx) merupakan antioksidan primer yang bersifat enzimat, berperan dalam aktifasi biologis yang bersifat khas, mengkatalisis reaksi kimiawi, mendegradasi substrat
Keyword: 

Judul: Potensi Ekstrak Air Bekatul dalam Menurunkan Peroksidasi Lipid dan Efeknya terhadap Organ Hati Tikus
Abstrak: Bekatul memiliki aktivitas antioksidan yang berfungsi sebagai penghambat terjadinya stres oksidatif. Stres oksidatif dapat menimbulkan peroksidasi lipid. Penelitian ini bertujuan menentukan potensi ekstrak air bekatul dalam menurunkan peroksidasi lipid pada tikus yang diinduksi pakan tinggi lemak dan PTU (propiltiourasil) serta menganalisis efeknya terhadap organ hati tikus. Parameter yang diamati meliputi kadar MDA (malondialdehid) serum dan hati, aktivitas enzim aminotransferase serum (ALT (alanin aminotransferase) dan AST (aspartat aminotransferase)), serta kondisi histopatologi hati tikus. Tikus sebanyak 25 ekor dibagi ke dalam lima kelompok, yaitu kelompok normal (N), simvastatin (K+), kontrol negatif (K-), bekatul dosis 1.5 g/KgBB (B1), dan bekatul dosis 3 g/KgBB (B2). Ekstrak air bekatul yang diberikan selama 24 hari pada tikus yang diinduksi pakan tinggi lemak dan PTU memiliki potensi mencegah peroksidasi lipid dengan menurunkan MDA serum darah secara signifikan (p<0.05) dan MDA hati secara tidak signifikan (p>0.05) dengan dosis 1.5 gram/KgBB yang memberikan efek penurunan terbaik. Organ hati tikus yang diinduksi ekstrak air bekatul juga mengalami perbaikan jaringan didukung dengan aktivitas ALT dan AST yang masih tergolong normal dan gambaran histopatologi organ hati.
Keyword: aminotransferase, antioksidan, bekatul, histopatologi, peroksidasi lipid

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