Judul: Hubungan Status Gizi, Pola Konsumsi Pangan, Dan Gaya Hidup Terhadap Tekanan Darah Pada Pria Dewasa Perdesaan
Abstrak: Tujuan penelitian ini adalah untuk mengetahui hubungan antara status gizi, pola konsumsi pangan, dan gaya hidup terhadap tekanan darah pada pria dewasa pedesaan. Penelitian ini dilakukan di Desa Sukamantri, Kecamatan Karan Tengah, Kabupaten Cianjur. Desain studi yang digunakan yaitu cross-sectional study dengan jumlah contoh sebanyak 56 orang. Hasil analisis deskriptif menunjukkan status gizi contoh 62.5% tergolong normal dan 19.6% tergolong berlebih. Contoh yang melakukan aktivitas fisik berat sebanyak 80.5% dan lebih dari setengah contoh (55.4%) memiliki kebiasaan aktivitas fisik yang tinggi. Contoh memiliki kebiasaan sering mengonsumsi kopi dengan prevalensi 66.1%. Selain itu 73.2% contoh juga sering mengonsumsi makanan berlemak. Uji korelasi Spearman menunjukkan tidak adanya hubungan yang signifikan (p>0.05) antara status gizi dengan tekanan darah serta gaya hidup dengan tekanan darah. Terdapat hubungan yang signifikan antara konsumsi makanan berlemak dengan tekanan darah (p<0.05).
Keyword: gaya hidup, pola konsumsi pangan, pria dewasa perdesaan, status gizi, tekanan darah

Judul: Hubungan Aktivitas Fisik Dan Pola Konsumsi Pangan Dengan Indeks Massa Tubuh, Lingkar Perut Dan Tekanan Darah Pada Wanita Dewasa Perdesaan
Abstrak: Penelitian ini bertujuan untuk mempelajari hubungan antara aktivitas fisik dan pola konsumsi pangan dengan indeks massa tubuh, lingkar perut dan tekanan darah pada wanita dewasa di Desa Sukamantri, Kabupaten Cianjur. Desain penelitian yang digunakan adalah cross-sectional dengan jumlah contoh 55 orang yang dipilih secara purposive. Hasil penelitian menunjukkan tingkat aktivitas fisik sebagian besar contoh (47.3%) tergolong ringan serta terdapat 41.8% contoh yang terbiasa melakukan aktivitas fisik berat. Sebagian besar contoh tidak terbiasa minum kopi namun tergolong sering mengonsumsi makanan berlemak serta makanan asin dan awetan. Prevalensi obesitas dan obesitas sentral adalah 18.2% dan 65.5%. Sebagian besar contoh (40.0%) tergolong prehipertensi. Berdasarkan uji korelasi Spearman terdapat hubungan signifikan antara aktivitas fisik berat dengan IMT (r=-0.277; p=0.041) dan lingkar perut (r=-0.298; p=0.027) serta konsumsi makanan asin dan awetan dengan IMT (r=-0.265; p=0.050).
Keyword: aktivitas fisik, indeks massa tubuh, lingkar perut, pola konsumsi pangan, tekanan darah

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