Judul: Hubungan konsumsi cairan periode latihan dengan status hidrasi pada anggota UKM futsal putra IPB
Abstrak: Tujuan penelitian ini untuk menganalisis hubungan konsumsi cairan periode latihan dengan status hidrasi setelah latihan pada anggota ukm futsal IPB. Penelitian dilakukan di Unit Kegiatan Mahasiswa (UKM) Futsal putra IPB dan bersifat cross-sectional study. Jumlah subjek yang digunakan sebanyak 20 orang yang bergabung dalam anggota UKM Futsal IPB dan telah memenuhi kriteria inklusi yaitu berusia 18 sampai dengan 25 tahun, berjenis kelamin laki-laki, mahasiswa yang sedang menjalani pelatihan, tidak sedang sakit, dapat diajak berinteraksi, dan bersedia mengisi informed consent serta bersedia mengikuti jalannya penelitian. Hasil penelitian menunjukkan status gizi sebagian besar contoh 75% tergolong normal dengan rata-rata 20.83 kg/m2. Rata-rata konsumsi cairan selama latihan sebesar 1255.75 ml, sebagian besar contoh 80% mengalami kurang konsumsi cairan selama latihan. Sebagian besar contoh mengalami dehidrasi ringan dengan prevalensi 75%. Uji korelasi Pearson didapatkan terdapat hubungan yang signifkan (p<0.05) antara konsumsi cairan periode latihan dengan status hidrasi setelah latihan. Tidak terdapat hubungan yang signifikan antara status gizi dengan status hidrasi setelah latihan (p>0.05). Kata kunci: konsumsi cairan, status gizi, status hidrasi
Keyword: fluid intake, hydration status, nutritional status

Judul: Status Hidrasi, Aktivitas Fisik Dan Tingkat Kebugaran Atlet Futsal Remaja Putri
Abstrak: Tujuan penelitian ini adalah menganalisis hubungan antara status hidrasi, aktivitas fisik dan tingkat kebugaran atlet futsal remaja Putri. Penelitian ini merupakan penelitian cross sectional study. Penelitian dilakukan di tim futsal NLFC (Netic Ladies Futsal Club), dengan jumlah 21 responden. Penelitian dimulai pada bulan Februari 2015. Penelitian ini menggunakan data primer dengan cara wawancara dan observasi langsung responden dan data sekunder yang berasal dari administrasi sekolah. Terdapat hubungan signifikan antara pengetahuan gizi dengan status gizi (p<0.05), tingkat kecukupan gizi dengan status gizi, dan asupan air dengan tingkat kecukupan air. Namun tidak terdapat hubungan signifikan antara aktivitas fisik dengan asupan air (p>0.05), asupan air dengan status hidrasi, tingkat kecukupan air dengan status hidrasi, status hidrasi dengan tingkat kebugaran, dan status gizi dengan tingkat kebugaran.
Keyword: aktivitas fisik, pengetahuan gizi, status gizi, status hidrasi, tingkat kebugaran

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