Judul: Angka lempeng total minuman emulsi minyak bekatul-cokelat dan pengaruh intervensinya terhadap kadar malondialdehid (MDA) plasma mahasiswa obes
Abstrak: Tujuan dari penelitian ini adalah untuk mempelajari jumlah plate count minuman emulsi minyak dedak padi-cokelat dan pengaruhnya terhadap kadar malondialdehid (MDA) plasma siswa obesitas. Penelitian ini menggunakan pra-eksperimental yang dirancang dengan one group pretest – posttest. Penelitian ini melibatkan 12 subjek obesitas yang terdiri dari 6 laki-laki dan 6 perempuan. Setiap subjek diberikan 2 gelas per hari setara dengan 57,6 mg -oryzanol. Hasil penelitian menunjukkan bahwa minuman emulsi ini layak dan aman dikonsumsi, karena total mikroba dari analisis Total Plate Count (TPC) berada di bawah batas maksimal yang ditetapkan Standardisasi Nasional Indonesia. Rata-rata kadar MDA plasma subjek mengalami penurunan setelah intervensi, namun analisis uji t menunjukkan tidak signifikan (p>0,005).
Keyword: Total plate count (TPC), Malondialdehyde (MDA), Rice bran oil, Cocoa

Judul: Pengaruh Intervensi Minuman Emulsi Ready to Drink Minyak Bekatul – Cokelat Terhadap Profil Lipid Mahasiswa Obes
Abstrak: Minyak bekatul telah dikenal memiliki efek hipokolesterolemik oleh karena kandungan -oryzanol di dalamnya dan dikembangkan menjadi minuman fungsional. Tujuan penelitian ini adalah untuk mempelajari kebiasaan subyek mengonsumsi makanan sumber lemak, menganalisis kandungan asam lemak minuman ready to drink minyak bekatul-cokelat, serta efeknya terhadap profil lipid plasma pada mahasiswa obes. Desain penelitian yang digunakan adalah pre-eksperimental studi dengan one group pretest-posttest design menggunakan enam mahasiswa dan enam mahasiswi IPB. Setiap subyek diberikan dua gelas setiap harinya atau setara dengan 57.6 mg γ-oryzanol. Tidak terdapat perbedaan signifikan terhadap konsumsi kebiasaan makan sumber lemak subyek pada masa sebelum dan selama masa intervensi. Asam lemak dominan pada minuman emulsi ready to drink minyak bekatul-cokelat adalah asam oleat sebanyak 32.57%, asam linoleat sebanyak 28.44% dan asam palmitat sebanyak 17.51%. Kadar total kolesterol dan kolesterol LDL secara signifikan menurun sebesar 21.2 mg/dl and 18.7 mg/dl, sedangkan kadar kolesterol HDL dan trigliserida tidak mengalami perubahan signifikan. Secara umum minuman bermanfaat bagi kesehatan yaitu dengan cara menurunkan kadar kolesterol dan kolesterol-LDL plasma mahasiswa obes.
Keyword: 

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