Judul: Status Hidrasi, Profil Lipid Darah dan Kadar Asam Urat pada Pekerja Berstatus Gizi Normal dan Gizi Lebih
Abstrak: Tujuan penelitian ini adalah mengetahui status hidrasi, profil lipid darah, dan kadar asam urat pada pekerja berstatus gizi normal dan gizi lebih di PT Indocement Tunggal Prakarsa tbk. Desain penelitian ini adalah cross sectional study dengan teknik purposive sampling. Subjek terdiri dari 31 orang berstatus gizi normal dan 34 orang berstatus gizi lebih. Data yang dikumpulkan adalah data profil lipid dan kadar asam urat yang diperoleh dari data hasil medical check up PRODIA, sedangkan status hidrasi ditentukan berdasarkan nilai berat jenis urin dengan metode reflectance photometry. Status hidrasi memiliki hubungan positif bermakna terhadap status gizi (r=0.316; p=0.010). Asupan energi dan karbohidrat tidak memiliki hubungan bermakna terhadap status gizi. Asupan protein (r=0.261; p=0.036) dan lemak (r=0.294; p=0.018) memiliki hubungan positif bermakna terhadap status gizi. Kolesterol HDL (r= -0.271; p=0.029) dan trigliserida (r=0.443; p=0.000) memiliki hubungan positif bermakna terhadap status gizi, sedangkan kolesterol total, kolesterol LDL, dan asam urat tidak memiliki hubungan bermakna terhadap status gizi.
Keyword: asam urat, berat jenis urin, profil lipid darah, status gizi, status hidrasi

Judul: Hubungan Tingkat Kecukupan Zat Gizi dan Gaya Hidup terhadap Status Gizi Pekerja (Studi Kasus di PT. Astra Internasional Tbk. Cabang Bogor)
Abstrak: Penelitian ini bertujuan untuk menganalisis hubungan kecukupan zat gizi, gaya hidup, pengetahuan gizi dan status gizi pada karyawan PT. Astra Internasional Tbk. Cabang Bogor. Desain penelitian yang digunakan adalah cross sectional dengan jumlah subjek 43 orang yang dilaksakan pada bulan November 2016 – Maret 2017. Sebagian besar subjek memiliki kategori usia dewasa madya, pendidikan terakhir sarjana, rata-rata pendapatan Rp 8 052 000 ± Rp 5 236 023, jam kerja rata-rata 8 jam, dan sebagian besar sudah menikah. Sebagian besar memiliki tingkat stress sedang, aktifitas fisik ringan, dan kebiasaan merokok yang ringan. Tingkat kecukupan energi, protein dan lemak tergolong normal, dan defisit berat untuk karbohidrat. Sebagian besar subjek berkategori status gizi lebih. Terdapat hubungan yang signifikan (p<0.05) antara pendapatan, jam kerja, tingkat kecukupan energi, tingkat kecukupan lemak dan lingkar perut dengan IMT. Tidak terdapat hubungan yang signifikan antara umur, pendidikan terakhir, status perkawinan, pengetahuan gizi, pengendalian stress, aktivitas fisik, status merokok, tingkat konsumsi protein dan tingkat konsumsi karbohidrat.
Keyword: Gaya hidup, Konsumsi, Pengetahuan gizi, Karyawan, 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