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 Pola Konsumsi Pangan, Gaya Hidup Dan Status Gizi Dengan Profil Lipid Darah Pada Perempuan Dewasa Pedesaan
Abstrak: Tujuan penelitian ini adalah untuk mengetahui hubungan pola konsumsi pangan, gaya hidup dan status gizi dengan profil lipid darah pada perempuan dewasa pedesaan. Penelitian ini dilakukan di Desa Cisalak, Kecamatan Cibeber dan Desa Sukamantri, Kecamatan Karang Tengah, Kabupaten Cianjur, Jawa Barat. Penelitian ini menggunakan data sekunder yang merupakan sebagian data dari penelitian payung yang berjudul “Socio-Economic, Demographic, Dietary and Lifestyle Characteristic and the Prevalence of Metabolic Syndrome of Middle Aged Rural People” yang dilaksanakan pada tahun 2014. Desain penelitian yang digunakan adalah cross-sectional study dengan jumlah contoh sebanyak 114 orang perempuan berusia 45-59 tahun. Sebagian besar contoh paling sering mengonsumsi nasi putih sebagai pangan sumber karbohidrat, telur rebus dan kacang-kacangan sebagai pangan hewani dan nabati, kangkung dan mangga untuk golongan sayuran dan buah-buahan, serta ikan asin goreng untuk pangan berlemak. Berdasarkan uji hubungan Rank Spearman, terdapat hubungan yang signifikan antara frekuensi konsumsi sayur dan buah, kadar lemak visceral, dan total lemak tubuh dengan kadar trigliserida darah (p<0.05).
Keyword: Gaya hidup, pola konsumsi pangan, profil lipid, status gizi

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