Judul: Faktor-Faktor Yang Berhubungan Dengan Kejadian Anemia Gizi Pada Ibu Hamil Di Kota Bogor Propinsi Jawa Barat
Abstrak: Penelitian ini secara umum bertujuan untuk mengetahui besarnya prevalensi anemia gizi pada ibu hamil dan faktor-faktor yang berhubungan dengan kejadian anemia di Kota Bogor. Secara khusus bertujuan; (1) mengetahui besarnya prevalensi anemia gizi ibu hamil; (2) mengetahlli pola konsumsi pangan sumber zat besi; (3) menganalisis faktor-faktor yang berhubungan dengan kejadian anemia gizi pada ibu hami!.
Keyword: 

Judul: Faktor-faktor yang Berhubungan dengan Anemia pada Ibu Hamil di Kecamatan Gegesik Kabupaten Cirebon
Abstrak: Salah satu masalah gizi di Indonesia adalah anemia pada ibu hamil yang merupakan penyebab tingginya angka kematian dan berat bayi lahir rendah. Tujuan penelitian ini adalah menganalisis faktor-faktor yang berhubungan dengan anemia pada ibu hamil di Kecamatan Gegesik. Desain penelitian yang digunakan adalah potong lintang. Penelitian ini menggunakan data sekunder yang melibatkan total subjek sebanyak 99 ibu hamil, yakni 51 ibu hamil anemia dan 48 ibu hamil non anemia. Tingkat kecukupan energi, protein, dan zat besi semua subjek umumnya berada pada kategori defisit. Frekuensi konsumsi pangan enhancher zat besi lebih tinggi pada ibu hamil normal, sedangkan frekuensi konsumsi inhibitor zat besi lebih tinggi pada ibu hamil anemia. Sebagian besar ibu hamil memiliki jarak kehamilan dan paritas tidak beresiko. Status gizi kurang lebih tinggi pada kelompok ibu hamil anemia. Hasil uji bivariat dengan menggunakan Spearman menunjukan bahwa terdapat hubungan yang signifikan negatif antara usia kehamilan dan frekuensi konsumsi kopi dengan kadar Hb. Selain itu, terdapat hubungan signifikan positif antara frekuensi konsumsi daging sapi/kambing dengan kadar Hb ibu hamil. Hasil analisis multivariat menunjukkan ibu hamil yang mengonsumsi daging sapi/kambing <1 kali/bulan memiliki risiko 2,79 kali mengalami anemia dan ibu hamil yang mengonsumsi daging ayam <3 kali/minggu memiliki risiko 2,39 kali mengalami anemia., One of the nutritional problems in Indonesia is anemia in pregnant women which is a high maternal mortality rate. This study aims to analyze the factors associated with anemia in pregnant women at Gegesik Cirebon Regency. The research design with cross-sectional study. This study used secondary data with subjects of 99 pregnant women, consist of 51 anemic pregnant women and 48 non-anemic pregnant women. The level of energy, protein, and iron sufficiency is generally in defisit category. The frequency consumption of iron enhancher is higher in non-anemic pregnant women, while the frequency consumption of inhibitor iron is higher in anemic pregnant women. Most of pregnant women have pregnancy intervals and parity is not at risk. Underweight nutritional status is higher in the group of anemic pregnant women. The results of bivariate test using Spearman showed that there was a significant negative relationship betweet gestational age and frequency of coffee consumption with Hb levels. There is a significant positive relationship between the frequency of consumption meet/lamb with Hb levels of pregnant women. The results of multivariate analysis showed This study showed meat/lamb consumption less than one times per month associated with increased of the risk of anemic by 2,79 times and chicken consumption less than third time per weeks associated with anemic by 2,39 times compared with pregnant women with third time per weeks.
Keyword: anemia, food consumption, gestational age, pregnant women

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