Judul: Hubungan Pola Asuh Dan Pengetahuan Gizi Ibu Dengan Status Gizi Dan Kesehatan Anak Balita
Abstrak: Penelitian ini bertujuan untuk menganalisis hubungan antara pola asuh dan pengetahuan gizi ibu dengan status gizi dan kesehatan anak balita dengan desain penelitian cross sectional study. Jumlah sampel dalam penelitian ini 50 orang. Hasil penelitian menunjukkan bahwa 58% ibu telah memiliki pengetahuan gizi yang cukup baik dan menerapkan pola asuh makan yang baik serta 70% pada pola asuh kesehatan dengan kategori baik. Status gizi sampel sebagian besar telah termasuk ke dalam kategori baik (BB/TB) (92%), (TB/U) (90%), dan (BB/U) (92%). Sebanyak 80% sampel memiliki skor morbiditas yang rendah. Terdapat hubungan yang signifikan (p<0,05) antara pengetahuan gizi dengan pola asuh (makan dan kesehatan). Terdapat hubungan yang signifikan (p<0,05) antara status gizi (BB/TB dan BB/U) dengan tingkat konsumsi energi. Terdapat hubungan (p<0,05) antara tingkat asupan protein dengan status gizi.
Keyword: Balita, Pola Asuh, Pengetahuan Gizi, Status Gizi

Judul: Hubungan Pengetahuan Gizi dan 1000 HPK Ibu serta Pola Asuh dengan Status Gizi Balita (BB/U) di Kecamatan Jasinga Kabupaten Bogor.
Abstrak: Kualitas sumber daya manusia idealnya memiliki kondisi fisik yang tangguh, mental kuat, kesehatan prima, serta kognitif yang baik dan ditentukan oleh kondisi gizi sejak masa pertumbuhan dini. Penelitian ini bertujuan bertujuan untuk menganalisis hubungan pengetahuan gizi dan 1000 HPK ibu serta pola asuh dengan status gizi balita (BB/U). Desain penelitian yang digunakan adalah crosssectional study dengan jumlah subjek 98 anak balita yang berstatus gizi kurang (18 subjek), gizi kurang (32 subjek) dan gizi baik (48 subjek). Subjek berusia 12-59 bulan yang dipilih secara purposive sampling. Hasil penelitian menunjukkan 24.5% ibu subjek memiliki pengetahuan gizi rendah, 44.9% ibu subjek memiliki pengetahuan 1000 HPK rendah, 75.5% subjek mendapatkan pola asuh makan yang baik dan 97.0% subjek mendapatkan pola asuh kesehatan yang baik. Tidak terdapat hubungan antara pengetahuan gizi dan 1000 HPK dengan status gizi. Terdapat hubungan positif signifikan pola asuh makan dengan status gizi (p>0.05), namun tidak terdapat hubungan antara pola asuh kesehatan dengan status gizi.
Keyword: 1000 HPK, balita, pengetahuan gizi, pola asuh, 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