Judul: Pengaruh pemberian pangan yang difortifikasi zat multi gizi mikro terhadap status gizi ibu hamil dan berat bayi lahir
Abstrak: Nutritional problems, on pregnant women in Indonesia cover not only macro nutrients but also micronutrients deficiencies like Fe and Vitamin A. Nutritional improvement strategy through supplementary fortified foods for pregnant women nedds to be carried out to improve nutritional status of mothers and infant birth.
Keyword: Multi Micronutrients, Anemia, Ferritin, Retinol, Infant birth weight, Weight gain pregnant mother, Pemberian makanan tambahan (PMT)

Judul: Pengaruh Intervensi Edukasi Gizi, Pemberian Telur dan Susu terhadap Status Gizi Ibu Hamil
Abstrak: Nutritional intervention in pregnant women is needed to prevent any nutritional problems in both the mother and the fetus. Chronic energy malnutrition and anemia are nutritional problems in pregnant women that often occur in developing countries. This study aims to determine the effectiveness of egg and milk supplementation along with nutrition education on nutritional status of a pregnant women and the knowledge and nutritional attitudes. The study design was pre-experimental with one group pretest posttest. Subjects were 45 pregnant women in the 2nd and 3rd trimesters. Nutritional interventions were given in the form of nutrition education along with egg and milk supplementation for pregnant women (90 days). The data collection was done by using interview techniques using questionnaires and direct measurements. The data collected consisted of pregnancy history, food consumption, household food security, mid-upper arm circumference, hemoglobin (Hb) levels and nutritional knowledge and attitudes. T-test, and Wilcoxon test were used. The results showed that egg and milk intervention increased mid-upper arm circumference (MUAC) from 27.7+4.0 cm (baseline) to 30.5+3.7 cm (endline) (p<0.05). However, the hemoglobin levels decreased from 11.9 g/dL (baseline) to 10.9 g/dL (endline) (p<0.01). Meanwhile, nutrition education intervention had a positive effect (p<0.05) on nutritional knowledge of the pregnant women, where the score increased from 66.4+15.1 (baseline) to 72.0+18.7 (endline). Supplementation of egg and milk for three months increased the mid-uppper arm circumference and nutrition education intervention had an effect on increasing nutritional knowledge of pregnant women.
Keyword: nutrition intervention, supplementary feeding, nutritional status, pregnancy

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