Judul: Profile Cholesterol and Trigliserid In Diabetic Rats Effects of Functional Drinks Cats Whisker Leaf Extract (Orthosiphon aristatus BI.Miq).
Abstrak: Minuman fungsional berbasis ekstrak kumis kucing diketahui mampu mengatasi hiperglikemik, namun belum diketahui potensi terhadap antihiperkolesterol. Pelitian ini bertujuan untuk mengetahui profil kolesterol dan trigliserida setelah pemberian minuman fungsional berbasis ekstrak daun kumis kucing pada tikus diabetes. Minuman fungsional terdiri atas minuman nanoenkapsulasi, mikroenkapsulasi dan ready to drink. Pengukuran kadar kolesterol serum darah dilakukan dengan metode CHOD-PAP dan pengukuran kadar trigliserida menggunakan metode GOD-PAP. Pengukuran kadar kolesterol di dalam hati menggunakan metode Lieberman buchart. Hasil penelitian bila dibandingkan dengan kadar normal menunjukkan penekanan kenaikan kadar kolesterol serum darah oleh minuman mikroenkapsulasi (KM) dengan persentase sebesar 38.61% dan penekanan penurunan kadar kolesterol pada hati sebesar 48,42% oleh minuman nanoenkapsulasi dosis tinggi. Sedangkan kadar trigliserida dalam darah pada seluruh kelompok berada pada rentang normal.
Keyword: Bogor Agricultural University, Institut Pertanian Bogor, IPB, Orthosiphon aristatus, functional drink, cholesterol, triglyceride, Tumbuhan obat, Konsumsi pakan tikus, Kadar kolesterol, Bobot badan tikus

Judul: Penghambatan Malondialdehid pada Tikus Diabetes yang Diberi Minuman Fungsional Berbasis Ekstrak Daun Kumis Kucing (Orthosiphon aristatus Bl. Miq).
Abstrak: Daun kumis kucing merupakan salah satu tanaman herbal yang telah teruji berkhasiat sebagai antioksidan dalam menangani penyakit diabetes. Ekstrak daun kumis kucing telah dilaporkan memiliki efek antioksidan secara in vitro tetapi secara in vivo belum dilaporkan. Penelitian ini bertujuan menentukan dan membandingkan aktivitas antioksidan minuman fungsional nanoenkapsulasi dan nonenkapsulasi berbasis ekstrak daun kumis kucing dalam menghambat pembentukan malondialdehid serum darah dan hati tikus diabetes menggunakan metode TBA. Minuman fungsional diberikan kepada tikus Sprague Dawley jantan diabetes dalam bentuk mikroenkapsulasi dosis 18.2 mL/kg bb, nanoenkapsulasi dosis 18.2 mL/kg bb, nanoenkapsulasi dosis 36.4 mL/kg bb dan ready to drink dosis 18.2 mL/kg bb selama 14 hari. Minuman fungsional nanoenkapsulasi dosis 18.2 mL/kg bb pada penelitian ini memiliki potensi antioksidan terbaik terlihat dari kemampuannya untuk menurunkan kadar malondialdehid serum darah dan hati tikus yang paling signifikan dengan persentase penurunan 48.83% dan 37.77%, nilai tersebut tidak berbeda nyata (p<0.05) dengan kelompok tikus normal.
Keyword: antioksidan, kumis kucing, malondialdehid, nanoenkapsulasi

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