Judul: The Correlation of Food Consumption and Iron Supplementation and Food Taboo with Hemoglobin Concentration of Pregnant Women at RSKIA Kota Bandung
Abstrak: Anemia pada ibu hamil dapat meningkatkan resiko kematian pada ibu hamil serta pertumbuhan dan perkembangan janin tidak optimal. Penelitian bertujuan untuk menganalisis hubungan antara konsumsi pangan dan tablet tambah darah (TTD) serta food taboo dengan kadar hemoglobin (Hb) ibu hamil. Desain penelitian adalah cross sectional yang melibatkan 41 contoh dan dilakukan pada bulan Oktober sampai November 2019 di RSKIA Kota Bandung. Data konsumsi pangan diperoleh dengan food recall 1x24 jam dan FFQ. Data food taboo dan konsumsi TTD dikumpulkan dengan wawancara. Data kadar Hb diperoleh dari buku Kesehatan Ibu dan Anak (KIA). Hasil uji korelasi menunjukkan tidak terdapat hubungan yang signifikan antara food taboo dengan tingkat kecukupan energi dan zat gizi (protein, lemak, karbohidrat, vitamin C, folat, dan zat besi) (p>0.05). Tingkat kecukupan zat besi (p=0.046, r=-0.314) dan asam folat (p=0.013, r=-0.384) berhubungan signifikan negatif dengan kadar Hb. Tidak terdapat hubungan yang signifikan antara konsumsi TTD dengan kadar Hb, namun konsumsi TTD kelompok non anemia (103.7±32.7 tablet) adalah lebih banyak daripada kelompok anemia (87.8±49.3 tablet). Hal ini mengindikasikan bahwa konsumsi TTD yang lebih banyak, kadar Hb contoh lebih tinggi (tidak anemia)., Anemia in pregnancy could increase the risk of maternal death and adverse effect on pregnancy outcomes. The study aimed to analyze the correlation between food consumption, iron supplementation and food taboo with hemoglobin concentration of pregnant women. This cross-sectional study was conducted on 41 pregnant women at RSKIA Kota Bandung from October until November 2019. Food consumption data was collected by food recall 1x24 hours and FFQ. Food taboo and the consumption of iron supplement collected by questionnaire. Hemoglobin concentration was obtained from the subjects’ KIA book. This study showed that food taboo had no significant correlation with the adequacy level of energy and nutrients (protein, fat, carbohydrate, vitamin C, folate, and iron) (p>0.05). There was a negative correlation between the adequacy level of iron (p=0.046, r=-0.314) and folate (p=0.013, r=-0.384) with subjects’ hemoglobin concentration. The consumption of iron supplement and hemoglobin concentration was found not correlated. But, the consumption of iron supplement of non-anemic subjects was higher (103.7±32.7 tablets) than anemic subjects (87.8±49.3 tablets). This indicated that the higher consumption of iron supplement, the better subjects’ hemoglobin concentration.
Keyword: food consumption, food taboo, hemoglobin concentration, iron supplement, pregnant women

Judul: Hubungan Tingkat Kecukupan Protein dan Zat Besi (Fe) dengan Kadar Hemoglobin Ibu Hamil di Kota Bogor
Abstrak: Levels of hemoglobin is one of the most common indicator used to determine the status of iron deficiency anemia, which is closely related by intake of protein and iron that increased and must be adequate during pregnancy. The aim of study was to explain relationship between %RDA of protein and iron with levels of hemoglobin at pregnant mother in Bogor City. The design of this study was cross-sectional study, and the number of samples were 45 pregnant women. The result of the research show that the anemia prevalence was 22.2%. Consumption of animal foods as a source of iron was still low (60.3 g) it might for 68.8% of the samples had inadequate iron. Intake of vitamin C as a enhancer of iron bioavailability was 27.0 mg. This study has shown that intake of heme iron (6.9 mg) was lower than the non-heme iron (10.4 mg). Most of sample on group anemia and non anemia has %RDA of energy and protein as a deficit level of heavy and then %RDA of vitamin A, vitamin C, folic acid, and iron as a deficit. Results test correlation show there is no relation between %RDA of protein and iron with levels of hemoglobin (p>0.05)
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