Judul: Hubungan Kebiasaan Makan dengan Status Anemia dan Usia Menarche Pada Remaja Putri di Perkotaan dan di Perdesaan
Abstrak: Unhealthy food habits may cause adolescent girls to be vulnerable to anemia and delayed age of menarche. The objective of this study was to analyze the association of food habit with anemia status and age of menarche of adolescent girls in South Jakarta (represent urban) and in Jasinga (represent rural). A cross sectional study was conducted involving 100 girls of 8th grade junior high school from four schools. The sampling method was Cluster Random Sampling. Adolelescent girls in urban area were more frequently consumed fish, milk, and fast food, as well as having higher intake of carbohydrate and vitamin A compared with adolescent girls in rural area. In addition, age of menarche of adolelescent girls in urban area were earlier than that in rural area. Haemoglobin concentration of adolelescent girls in both rural and urban areas were not different. There was no correlation between iron bioavailability and anemia status (p>0.05), but positive correlation were found between frequency of egg and green mustard consumption with anemia. There was also negative correlation of fat intake and body mass index and age of menarche (p<0.05).
Keyword: menarche., food habit, anemia status, adolescent girls

Judul: Kebiasaan Makan, Perilaku Hidup Bersih dan Sehat, dan Status Anemia pada Remaja Putri Keluarga Pemulung di Kelurahan Sumur Batu Bantar Gebang Bekasi
Abstrak: This study was aimed to analyze the association between food habit, clean and healthy behaviour and anemia status in adolescent girls of scavengers families in Sumur Batu Bantar Gebang Bekasi. Cross sectional design was applied in this study. About 72 adolescent girls of scavengers families were purposing sampled in this study. Food consumption among this girls was collected using semiquantitative food frequency and anemia status was measured by hemoglobin level using cyanmethemoglobin. Most of adolescent girls (19.4%) was anemia and 80.6% were non anemia. The girls had moderate food habit (61.6%) based on the frequency of consumption of food is still a lack of food sources of heme. Clean and healthy behaviour among the girls were in a good category (79.2%). The state of the living environments is in a category quite well (59.7%). History of helminthiasis in adolescent girls (41.7%) were in the low category. The result shown there’s no relationship between food habits, clean and healthy behaviour, living environtments and history of helminthiasis with anemia status (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