Judul: Pengetahuan gizi ibu, pola asuh dan status gizi bayi di Desa Bojong Jengkol, Kecamatan Ciampea, Kabupaten Bogor
Abstrak: The direct factors affecting infant’s nutritional status are energy and nutrients intake, and infection. Factors affecting energy and nutrients intake are nutrition knowledge of mother; childcare practices, included feeding and caring practices; and morbidity. The aim of this study was to analyze association between mother’s nutrition knowledge, feeding practices, and immunization with nutritional status of infant. Design of this study was cross sectional. Samples of this study were 60 infants aged 2-24 which were selected purposively. Samples consist of underweight and normal nutritional status (WAZ), The result showed that mother’s nutrition knowledge was positively significant correlated with infant’s nutritional status (r= 0.016 p<0.05). Furthermore, there were positively significant correlation between feeding practices and immunization with infant’s nutritional status( r= 0.031 p<0.05 and p< 0.01, respectively).
Keyword: 

Judul: Clean and Healthy Lifestyle Behavior, and Balanced Nutrition Behavior of Mothers and it’s Relation to Nutritional Status and Health Status of Children Under Five Years in Bojonegoro.
Abstrak: Secara umum penelitian ini bertujuan untuk mengetahui pengetahuan gizi, perilaku hidup bersih dan sehat (PHBS), dan perilaku gizi seimbang ibu, serta hubungannya dengan status gizi dan kesehatan balita di Kabupaten Bojonegoro. Tujuan khusus dari penelitian ini adalah untuk 1) mengidentifikasi karakteristik balita dan keluarga balita, 2) mempelajari pengetahuan gizi, PHBS, serta perilaku gizi seimbang ibu balita, 3) mempelajari tingkat kecukupan energi dan zat gizi, status gizi, serta status kesehatan balita, 4) menganalisis hubungan pengetahuan gizi dengan PHBS dan perilaku gizi seimbang ibu, 5) menganalisis hubungan perilaku gizi seimbang ibu dengan tingkat kecukupan energi dan zat gizi balita, serta hubungan tingkat kecukupan energi dan zat gizi dengan status gizi balita, 6) menganalisis hubungan PHBS keluarga dengan status gizi dan kesehatan balita, serta 7) mengalisis hubungan perilaku gizi seimbang ibu dengan status gizi dan kesehatan balita. Penelitian ini menggunakan desain population survey dengan teknik wawancara yang dilaksanakan pada bulan Maret-April 2011 di Desa Campurejo, Kecamatan Kota Bojonegoro. Pemilihan lokasi penelitian tersebut berdasarkan pertimbangan terdapat 1.8% balita dengan status gizi buruk dan 10.9% balita dengan status gizi kurang, serta cakupan penerapan PHBS ibu masih tergolong rendah (39.36%). Contoh dalam penelitian ini adalah balita yang tercatat di posyandu desa terpilih, sedangkan responden dalam penelitian ini adalah ibu dari balita yang terpilih sebagai contoh. Adapun populasi pada penelitian ini adalah seluruh balita yang tinggal di Desa Campurejo, Kecamatan Bojonegoro, yaitu sebanyak 242 balita. Perkiraan ukuran minimal contoh ditentukan menggunakan rumus Lemeshow et al. (1997), yaitu 49 contoh yang dipilih dari tiga posyandu di desa terpilih. Kriteria pemilihan contoh adalah balita berusia 13-60 bulan yang tinggal bersama ibunya, tercatat di posyandu di desa terpilih, dan responden bersedia untuk diwawancara. Calon contoh diambil dari populasi yang memenuhi kriteria yaitu sebanyak 190 balita, kemudian selanjutnya dipilih menggunakan metode acak stratifikasi dengan alokasi proporsional, sehingga pada akhirnya diperoleh 55 calon contoh.
Keyword: 

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