Judul: The Correlation Between Knowledge of Anemia and Adherence to Iron Folic Acid (IFA) Supplement Consumption by The Adolescent Girls with Anemia in Kupang District.
Abstrak: Anemia menjadi salah satu masalah gizi yang sering terjadi pada remaja. Penelitian ini bertujuan mengetahui hubungan pengetahuan anemia dan kepatuhan mengonsumsi tablet tambah darah dengan anemia pada remaja putri di Kabupaten Kupang. Penelitian ini menggunakan data sekunder dari data penelitian Better Investment for Stunting Alleviation (BISA). Desain penelitian ini adalah cross sectional dengan jumlah subjek 1.610 siswi dari SMA dan SMK. Hasil penelitian menunjukkan sebanyak 379 (23,5%) siswi memiliki tingkat pengetahuan anemia dalam kategori baik dan 245 (15,2%) siswi patuh mengonsumsi tablet tambah darah. Pengetahuan anemia berhubungan signifikan dengan kepatuhan mengonsumsi TTD 0,154 (p=0,000). Pengetahuan anemia berhubungan signifikan dengan anemia 0,073 (p=0,003). Kepatuhan mengonsumsi TTD berhubungan signifikan dengan anemia -0,102 (p=0,000). Remaja putri perlu memperhatihan kecukupan zat besi agar memiliki kadar hemoglobin dalam rentang normal., Anemia is among nutritional problem that often occurs in adolescents. This study aims to determine the correlation between knowledge of anemia and adherence to IFA supplement consumption by adolescent girl in Kupang District. This study uses secondary data from Better Investment for Stunting Alleviation (BISA). This research design is cross sectional with the number of subjects 1.610 students form Senior High School and Vocational High School. The result showed 379 (23.5%) subjects had good level of anemia knowledge and 245 (15.2%) subjects complied to IFA supplement consumption. Knowledge of anemia significantly correlated with adherence to IFA supplement consumption 0.154 (p=0.000). Knowledge of anemia significantly correlated with anemia status 0.073 (p=0.003). Adherence to IFA supplement consumption significantly correlated with anemia status -0.102 (p=0.000). Adolescent girls need to pay attention to the adequacy of iron to have normal hemoglobin levels.
Keyword: anemia, kepatuhan mengonsumsi TTD, pengetahuan anemia, remaja

Judul: Evaluation of Acceptance and  Compliance with Iron-Folic Acid (IFA) Tablets for Adolescent Girl in Bogor
Abstrak: Anemia menjadi salah satu masalah gizi utama di Indonesia. Data Riskesdas 2018 menunjukkan kejadian anemia sekitar 32% pada kelompok usia remaja 15 – 24 tahun. Suplementasi zat besi menjadi salah satu upaya pemerintah dalam mengatasi anemia remaja. Penelitian ini bertujuan mengkaji penerimaan dan kepatuhan konsumsi tablet tambah darah pada remaja putri di Kota Bogor. Desain penelitian merupakan cross-sectional study yang dilakukan di tiga sekolah dengan total subjek sebanyak 341 siswi. Subjek dipilih berdasarkan simple random sampling. Data kepatuhan, penerimaan, dukungan orang tua dan dukungan guru dikumpulkan melalui pengisian kuisioner secara mandiri oleh siswi. Uji hubungan kepatuhan konsumsi TTD dengan dukungan guru serta tingkat kepatuhan TTD dengan dukungan orang tua menggunakan chi-square. Hasil penelitian menemukan bahwa siswi menerima 4 tablet per bulan sebesar 83%, siswi yang menerima kurang dari 4 tablet per bulan sebesar 5,9% dan siswi yang tidak menerima tablet tambah darah sama sekali sebesar 11,1%. Sebanyak 39% siswi tidak patuh konsumsi TTD dan sebanyak 31,4% siswi tidak sama sekali konsumsi TTD. Sebagian besar siswi kurang mendapat dukungan guru dan dukungan orang tua terhadap konsumsi TTD. Dukungan guru dan dukungan orang tua memiliki hubungan yang signifikan terhadap konsumsi TTD siswi (p<0,05)
Keyword: adolescent girl, anemia, IFA supplementation, parental support, teacher support

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