Judul: Hubungan status gizi, asupan zat gizi Mikro, dan Minuman Berkafein dengan Dismenorea primer pada Remaja putri di Sman 1 Pamekasan dan Sman 1 Galis
Abstrak: This study was aimed to analyze correlation of nutritional status, menstrual characteristics, food consumption, and caffeine beverages to primary dysmenorrhoea of adolescent school girls at urban and rural high school. A cross sectional study of 53 girls at SMAN 1 Pamekasan and 35 girls at SMAN 1 Galis was conducted. The sample was determined by Sample random sampling based on inclusion criteria. Correlation test showed there was no significant correlation between menstrual characteristics, nutritional status, and macronutrient to primary dysmenorrhoea (p>0.05). While there was significant correlation between intake of vitamin B1 and primary dysmenorrhoea (p<0.05) there was no significant correlation between Zn, vitamin E, vitamin B6, and caffeine beverages with primary dysmenorrhoea (p>0.05)., Penelitian bertujuan untuk menganalisis hubungan status gizi, karakteristik menstruasi, konsumsi pangan, dan minuman berkafein terhadap dismenorea primer pada remaja putri di SMA perkotaan dan SMA perdesaan. Desain penelitian yang digunakan adalah cross sectional dengan subjek penelitian yang digunakan dalam penelitian ini adalah 53 siswi SMAN 1 Pamekasan dan 35 siswi SMAN 1 Galis. Pengambilan sampel dengan cara Sample random sampling berdasarkan kriteria inklusi. Hasil uji korelasi antara karakteristik menstruasi, status gizi, dan zat gizi makro terhadap derajat dismenorea primer menunjukkan tidak terdapat hubungan yang signifikan (p>0.05). Sementara itu, terdapat hubungan yang signifikan antara asupan zat gizi mikro (vitamin B1) dan derajat dismenorea primer (p<0.05). Berbeda halnya antara Zn, vitamin E, vitamin B6, dan minuman berkafein terhadap derajat dismenorea primer yang menunjukkan tidak terdapat hubungan yang signifikan (P>0.05).
Keyword: dismenorea primer, kafein, menstruasi, status gizi

Judul: Faktor-Faktor yang Berhubungan dengan Kejadian Dismenorea Primer pada Remaja
Abstrak: Penelitian ini bertujuan untuk mempelajari faktor-faktor yang berhubungan dengan kejadian dismenorea primer pada remaja. Desain penelitian yang digunakan dalam penelitian ini adalah cross sectional study dengan jumlah subjek sebanyak 85 orang. Subjek dalam penelitian ini adalah siswi kelas X dan XI SMA Kornita Bogor. Penelitian dilakukan pada bulan April – Mei 2016. Data yang dikumpulkan meliputi karakteristik subjek, karakteristik menstruasi, status gizi, aktivitas fisik, keluhan menstruasi, dan asupan energi dan zat gizi. Hasil penelitian menunjukkan sebagian besar (74.1%) subjek penelitian mengalami dismenorea primer. Berdasarkan uji regresi logistik bivariat diketahui bahwa status gizi lebih (p-value 0.803 OR=1.157 95% Cl 0.368-3.645), usia menarche dini (p-value 0.083 OR=2.4 95% Cl 0.892-6.454), tingkat kecukupan vitamin B1 (p-value 0.197 OR=2.0 95% Cl 0.698-5.729), dan kalsium (p-value 0.765 OR=1.452 95% 0.125- 16.850) yang kurang belum menjadi faktor risiko terjadinya dismenorea primer namun sudah berpeluang meningkatkan kejadian dismenorea primer.
Keyword: aktivitas fisik, dismenorea primer, status gizi, tingkat kecukupan gizi

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