Judul: Konsumsi Minuman Berpemanis dan Berkafein Kaitannya dengan Usia Menarche.
Abstrak: Penelitian ini bertujuan untuk mempelajari hubungan antara konsumsi minuman berpemanis dan berkafein dengan usia menarche. Penelitian dengan desain cross-sectional study ini dilaksanakan pada bulan Maret sampai April 2017. Contoh dalam penelitian ini sebanyak 82 orang (41 contoh gemuk dan 41 normal) yang berasal dari siswi kelas VII SMP Negeri 1 Ciomas, SMP Informatika Bina Generasi, dan SMP Rimba Teruna, Bogor. Data karakteristik contoh dan keluarga serta usia menarche didapatkan dengan cara pengisian kuesioner, data status gizi didapatkan dengan pengukuran antropometri berdasarkan IMT/U, sedangkan data konsumsi pangan didapatkan dari wawancara food recall 2 x 24 jam dan SQFFQ. Usia menarche contoh gemuk signifikan lebih cepat daripada contoh normal dan usia menarche ibu contoh gemuk cenderung lebih cepat dari usia menarche ibu contoh normal. Terdapat hubungan signifikan negatif antara tingkat kecukupan energi dengan IMT/U (p=0.011;r=-0.281) serta IMT/U dengan usia menarche (p=0.000;r=-0.392). Terdapat hubungan signifikan positif usia menarche ibu dengan usia menarche contoh (p=0.034;r=0.235) dan tidak terdapat hubungan signifikan antara konsumsi minuman berpemanis dan berkafein dengan usia menarche, akan tetapi contoh dengan menarche cepat cenderung mengonsumi kafein lebih tinggi daripada contoh menarche normal. Contoh dengan IMT yang lebih tinggi serta memiliki keturunan menarche cepat cenderung lebih cepat mengalami menstruasi.
Keyword: menarche, minuman berpemanis, minuman berkafein, status gizi

Judul: Keterkaitann konsumsi pangan dan status gizi dengan usia menarche anak perempuan usia sekolah dasar di Bogor
Abstrak: Tujuan penelitian ini adalah menganalisis hubungan konsumsi makanan dan status gizi dengan usia menarche pada anak sekolah dasar di Kota Bogor. Penelitian menggunakan desain cross sectional study, dilakukan pada bulan September sampai November 2011 di enam sekolah dasar di Bogor. Sampel dipilih secara purposif sehingga diperoleh 58 siswa. Data dianalisis menggunakan uji rank spearman. Hasil penelitian menunjukkan rata-rata usia menarche adalah 10,74± 0,71. Lebih dari separuh (62,1%) siswa mengalami menarche pada usia ≥ 10 tahun. Usia menarche berhubungan negatif signifikan dengan konsumsi zat besi tetapi tidak berhubungan dengan status gizi, usia ibu menarche, jumlah anggota keluarga, pengetahuan gizi anak, latar belakang pendidikan ayah, dan pendapatan rumah tangga. Penelitian ini menyarankan agar orang tua lebih memberikan informasi dan dukungan mengenai aspek-aspek yang berkaitan dengan pubertas.
Keyword: Food consumption, Nutritional status, Menarche, Elementary school, Puberty

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