Judul: Pola Konsumsi Pangan Sumber Lemak, Aktivitas Fisik Dan Tekanan Darah Pada Siswa Sman 10 Kota Bogor Dan Sma Kornita Kabupaten Bogor
Abstrak: Penelitian ini bertujuan untuk menganalisis hubungan antara asupan lemak dan aktivitas fisik dengan tekanan darah pada siswa SMAN 10 Kota Bogor dan SMA Kornita Kabupaten Bogor. Desain penelitian yang digunakan adalah cross sectional study. Subjek adalah siswa SMA kelas X dan XI dengan jumlah subjek 100 orang. Data yang dikumpulkan terdiri atas karakteristik contoh dan sosial ekonomi keluarga, status gizi, konsumsi pangan sumber lemak, asupan energi dan zat gizi, persen lemak tubuh, aktivitas fisik, serta tekanan darah. Hasil penelitian menunjukkan bahwa sebagian besar tekanan darah contoh di kabupaten tergolong pre-hipertensi (63.3%). Berdasarkan uji Spearman, tidak terdapat hubungan yang signifikan antara tingkat kecukupan lemak dan aktivitas fisik dengan tekanan darah (p>0.05). Terdapat hubungan yang signifikan antara status gizi dengan tekanan darah serta antara persen lemak tubuh dengan tekanan darah sistolik maupun diastolik (p<0.05).
Keyword: tingkat kecukupan lemak, status gizi, persen lemak tubuh, aktivitas fisik, tekanan darah, remaja

Judul: Aktivitas Fisik, Asupan Lemak dan Persen Lemak Tubuh Remaja di Kabupaten dan Kotamadya Bogor
Abstrak: Penelitian ini bertujuan untuk menganalisis hubungan antara aktivitas fisik dan asupan lemak dengan persen lemak tubuh pada remaja. Desain penelitian yang digunakan adalah cross sectional dengan jumlah subjek 90 orang, terdiri atas 45 siswa SMPN 3 Cibinong Kabupaten Bogor dan 45 siswa SMPN 8 Kotamadya Bogor. Data asupan energi dan lemak dikumpulkan dengan metode food records selama 4 hari sekolah dan 1 hari libur. Aktivitas fisik diukur dengan metode records 2x24 jam pada satu hari libur dan satu hari sekolah. Hasil uji korelasi Spearman menunjukkan terdapat hubungan (p<0.05) antara tingkat kecukupan energi ataupun tingkat kecukupan lemak dengan persen lemak tubuh. Terdapat hubungan yang signifikan (p<0.05) antara tingkat kecukupan energi, tingkat kecukupan lemak ataupun persen lemak tubuh dengan status gizi.
Keyword: aktivitas fisik, tingkat kecukupan, persen lemak tubuh

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