Judul: Pengaruh Intervensi Minuman Jelly Cincau terhadap Kadar Malondialdehid dan C-Reactive Protein (CRP) pada Pria Perokok Dewasa
Abstrak: Kebiasaan merokok dapat menurunkan status kesehatan, diantaranya ditandai dengan meningkatnya kadar MDA dan CRP tubuh. Pangan fungsional yang mengandung antioksidan seperti jelly cincau merupakan salah satu alternatif untuk menurunkan kadar MDA dan CRP. Tujuan umum penelitian ini adalah menganalisis pengaruh intervensi jelly cincau terhadap kadar MDA dan hs-CRP pada pria perokok dewasa. Desain penelitian ini menggunakan quasi eksperimental dengan pre-post test control. Subjek dibagi menjadi empat kelompok yang terdiri atas 1) Kontrol (K) yang tidak diberikan pangan intervensi apapun; 2) P1 yang diberikan pangan intervensi selama 14 hari; 3) P2 yang diberikan pangan intervensi selama 21 hari; 4) P3 yang diberikan pangan intervensi selama 28 hari. Subjek diminta untuk mengonsumsi jelly cincau 200 gram per hari. Sebelum intervensi, seluruh subjek memiliki kadar MDA diatas normal dan kadar hs-CRP yang normal. Hasil penelitian menunjukkan bahwa kadar MDA subjek pada kelompok perlakuan menurun secara nyata (p<0.05) setelah dilakukan intervensi. Penurunan tertinggi terjadi pada P3 (49,82 %). Hasil uji ANOVA terhadap kadar hs-CRP subjek antar kelompok menunjukkan bahwa tidak terdapat perbedaan yang nyata terhadap kadar hs-crp subjek antar kelompok.
Keyword: hs-CRP, jelly cincau, MDA, merokok

Judul: Pengaruh Intervensi Jelly Cincau Hijau (Premna oblongifolia Merr.) terhadap Profil Lipid Pria Perokok Dewasa
Abstrak: Smoking habit is strongly associated with changes in lipid profile. Functional beverages such as green grass jelly can be used as an alternative to improve lipid profile. The general objective of this study was to analyse the effect of green grass jelly intervention on lipid profile of adult male smokers. This study used an experimental with pre-post test control design. Subjects were divided into four groups, consisting of 1) Control (K) did not received any intervention; 2) P1 received intervention for 14 days; 3) P2 received intervention for 21 days; and 4) P3 received intervention for 28 days. Subjects of the intervention groups were asked to consume 200 grams of green grass jelly per day. The results showed that there was a significant reduction in total cholesterol and LDL cholesterol levels and also a significant increase in HDL cholesterol levels (p<0.05) of subjects in group P1, P2, and P3 after the intervention. The results of ANOVA test on triglyceride levels showed that there was no significant difference in triglyceride levels among subjects of all groups.
Keyword: Bogor Agricultural University (IPB), lipid profile, green grass jelly, smoking

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