Judul: Perilaku konsumsi susu pada ibu hamil di pusat kesehatan masyarakat wilayah kecamatan Bogor Barat
Abstrak: the aims of this research were to know 1) characteristics of individual, family and milk product consumed by pregnant woman, 2) milk consummption behaviour of pregnant woman and 3) correlation between milk consumption behaviour with individual and family charactreistics. This research was carried out from August 7th to September 7th, 2006 at Pusat Kesehatan Masyarakat (Puskesmas) Kecamatan Bogor Barat.
Keyword: 

Judul: Pola Konsumsi Pangan dan Konsumsi Susu serta Status Gizi Ibu Hamil di Kota Bogor
Abstrak: Milk is very important for pregnant women, it is a liquid diet rich of nutrients needed by pregnant women. The aim of this study to analyze food intake, dairy consumption, and nutritional status of pregnant women in the Bogor city. The research design was a cross sectional study. The research was conducted by using secondary data from a study conducted by the Southeast Asian Food and Agricultural Science and Technologi (SEAFAST) Center, Bogor Agricultural University. The data are from pregnant women taken from six districts in the Bogor city, include West, South Bogor, Bogor City, East Bogor and Tanah Sareal Bogor in November 2010 to Februari 2011. The number of samples are 203 people selected from the Integrated Public Service Post (Posyandu). The results showed that the majority of pregnant women’s food consumptions are drinks, the grain, vegetables and milk. The frequency of milk powder consumption among the sample who have low socioeconomic level was still relatively rare (<7 kali/minggu) while the samples who have medium and high socioeconomic level have high frequency (≥14 kali/minggu). The frequency of sweetened condensed milk, fresh milk, ice cream, cheese, yogurt and probiotics consumptions are included in the category of very rare. The most kind of milk consumed is milk powder. The energy sufficient level of most samples is in category of heavy deficit levels as well as adequacy of protein levels. Sufficient level of calcium is included in the adequate category, but the sufficient level of iron and folic acid are included in the less category. Based on measurements of nutritional status by using the LILA, more than 80% samples were not in risk of chronic energy (KEK).
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