Judul: Keragaan Konsumsi Pangan dan Kadar Mineral Besi (Fe) dan Seng (Zn) dalam Serum Darah Ibu Hamil
Abstrak: Penelitian ini bertujuan untuk mempelajari keragaan konsumsi pangan dan kadar mineral besi (Fe) dan seng (Zn) dalam serum darah ibu hamil. Secara khusus penelitian ini bertujuan untuk mengetahui karakteristik ibu hamil, menilai konsumsi energi dan zat gizi (protein, Fe, Zn, Cu dan vitamin C), mempelajari konsumsi pangan ibu hamil, dan mengetahui kadar dan status besi (Fe) dan seng (Zn) dalam serum darah ibu hamil.
Keyword: 

Judul: Beberapa faktor yang mempengaruhi konsumsi makanan, pil besi dan kadar hemoglobin (Hb) ibu hamil
Abstrak: Penelitian ini bertujuan untuk mengetahui konsumsi protein, vitamin C, zat besi, kadar hemoglobin (Hb), pendidikan formal, pengetahuan gizi, pendapatan keluarga, kebiasaan makan, dan informasi pil besi ibu hamil; mengetahui pengaruh pendidikan formal, pengetahuan gizi, pendapatan keluarga, dan kebiasaan makan terhadap konsumsi protein, vitamin C, dan zat besi dari makanan ibu hamil; mengetahui pengaruh pendidikan formal, pengetahuan gizi, dan informasi pil besi terhadap konsumsi pil besi ibu hamil; mengetahui pengaruh konsumsi protein, vitamin C, zat besi dari makanan, dan zat besi dari pil besi terhadap kadar hemoglobin ibu hamil. Penelitian dilakukan di Desa Sukasari, Sirnagalih, dan Rancagoong, Kecamatan Cilaku, Kabupaten Cianjur, Jawa Barat, selama tiga bulan dari bulan Juli sampai September 1995. Penarikan contoh dilakukan secara acak. Masing- masing contoh mendapatkan pil besi dari Puslitbang Gizi Bogor sebanyak 90 tablet untuk tiga bulan (Juli, Agustus, dan September, 1995) dengan aturan minum pil besi satu hari satu tablet. Data yang dikumpulkan terdiri dari data primer dan sekunder. Data primer meliputi identitas diri dan keluarga contoh, pendidikan formal, pengetahuan. gizi, pendapatan keluarga, kebiasaan makan, informasi pil besi, konsusmi pangan, dan kadar Hb contoh. Data primer selain kadar Hb diperoleh melalui wawancara langsung de- ngan menggunakan kuesioner. Data kadar Hb dikumpulkan dengan menggunakan metode Sianmethemoglobin secara lang- sung. Data sekunder diperoleh dari buku potensi masing- masing desa yang diteliti. Untuk mengetahui pengaruh pendidikan formal, pengetahuan gizi, pendapatan keluarga, dan kebiasaan makan (frekuensi makan nasi, lauk pauk, sayur, dan buah) terhadap konsumsi protein, vitamin C, dan zat besi dari makanan contoh; mengetahui pengaruh pendidikan formal, pengetahuan gizi, dan informasi pil besi terhadap konsumsi pil besi contoh, mengetahui pengaruh konsumsi protein, vitamin C, zat besi dari makanan, dan zat besi dari pil besi terhadap kadar hemoglobin contoh digunakan uji regresi berganda.
Keyword: konsumsi pangan

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