Judul: Analisis Menu Makan Terkait Risiko Obesitas dan Hipertensi pada Karyawan Tambang (Operator) PT. Pamapersada Nusantara
Abstrak: Penerapan porsi makan yang besar dan tidak terbatas mempunyai kaitan dengan status gizi dan tekanan darah operator. Tujuan dari penelitian ini adalah menganalisis hubungan asupan energi dan zat gizi dengan risiko terjadinya obesitas dan hipertensi. Desain penelitian ini adalah cross-sectional. Responden dari penelitian ini adalah operator PT. Pamapersada Nusantara. Jumlah responden berjumlah 100. Data dikumpulkan melalui kuesioner. Hasilnya terlihat Terdapat hubungan positif antara kecukupan energi dengan status gizi (r=0,473, p<0,05) protein dengan status gizi (r=0,475, p<0,05), lemak dengan status gizi (r=0,475, p<0,05), % lemak tubuh dengan status gizi (r=0,373, p<0,05), natrium dengan tekanan darah (r=0,576, p<0,05), aktivitas olahraga dengan darah tekanan darah (r=-0,357, p<0,05), kebiasaan merokok dengan tekanan darah (r=0,423, p<0,05) dan status gizi dengan tekanan darah (r=0,534, p<0,05).
Keyword: Energy and nutrient intake, Obesity, Hypertension

Judul: Analisis Aktivitas Fisik, Konsumsi Sayur, Buah Dan Kopi, Serta Sindrom Metabolik Karyawan Di Pt Indocement Citeureup
Abstrak: Penelitian ini dilakukan untuk menganalisis aktivitas fisik, konsumsi sayur, buah dan kopi, tekanan darah, profil lipid, sindrom metabolik dan status gizi karyawan middle age non-obese di PT Indocement Citeureup. Desain cross sectional dengan purposive sampling 59 orang karyawan middle age non-obese di PT Indocement digunakan pada studi ini. Hasil penelitian menunjukkan sebanyak 34% contoh memiliki status gizi lebih dan 88% contoh memiliki persen lemak yang tinggi. Sebanyak 17% contoh mengalami hipertensi dan 80% contoh mengalami dislipidemia. Sebanyak 49% contoh termasuk ke dalam kategori aktivitas fisik ringan. Sebanyak 20% contoh mengalami kejadian sindrom metabolik. Hasil penelitian menunjukkan bahwa rata-rata konsumsi sayur contoh adalah 61.5±44.8 gram yang masih rendah dibandingkan dengan anjuran dari PGS, rata-rata konsumsi buah contoh adalah 159.5±104.7 gram yang sudah sesuai dengan anjuran dari PGS dan rata-rata konsumsi kopi contoh adalah 250.1±259.8 ml yang masih termasuk dalam konsumsi wajar. Terdapat hubungan negatif yang signifikan antara konsumsi sayur dengan lingkar perut (p<0.05). Tidak ada hubungan yang signifikan antara aktivitas fisik, konsumsi sayur, buah dan kopi dengan kejadian sindrom metabolik (p>0.05).
Keyword: middle age, non-obese, sindrom metabolik

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