Judul: Hubungan Konsumsi Pangan dan Status Gizi dengan Tingkat Kebugaran Atlet Taekwondo Remaja di Pemusatan Latihan Nasional Cipayung, Bogor
Abstrak: The general objective of study was to analyze food consumption, adequacy ratio, nutritional status, and fitness level of adolescents taekwondo athletes in Centralization of National Training Cipayung, Bogor. The research used cross sectional study design with 23 adolescents athletes as samples. The primary data included characteristic of samples, nutritional status by anthropometry (body mass index), and food consumption. The secondary data included fitness level by bleep test (VO2 max values), sit and reach test (flexibility), sit up and squat jump (muscle endurance), and overview of the study site which was Centralization of National Training. The study showed that overall athletes has normal nutritional status. Most athletes were lack of sufficient levels of energy and protein. There was positive correlations between the ages of athletes with flexibility (p<0,05, r=0,456) and muscle endurance (sit up test) (p<0,05, r=0,456). The correlations between with fitness level (VO2 max) was positive significantly correlated (p<0,05, r=0,456).
Keyword: 

Judul: Hubungan Antara Karakteristik Atlet, Tingkat Kecukupan Gizi, dan Status Gizi Dengan Tingkat Kebugaran Atlet Taekwondo di SMA Ragunan Jakarta
Abstrak: Nutrition is a factor to consider for the achievements of athletes to guidance in the training game until the game. For athletes, nutrient intakes associated with the sport had significance in addition to maintain fitness as well to increase the achievements in sport athlete who participated. In this study had been studied about anthropometry, sufficient levels of nutritional status, fitness level of athletes from the Senior High School Ragunan in South Jakarta. The objective of this study was to analyze the characteristics of the athletes, the consumption, level of nutritional adequacy, nutrition status, and fitness level of taekwondo's athletes. Design of the experiments was cross sectional study. The data used were primary and secondary data in the form of characteristic examples, data knowledge of nutrition, anthropometry (weight and height), food consumption, level of fitness results of balke test (VO2 max values), and an overview of the school which is study site. Analyses were performed by data entry, and then processed by a computer program Microsoft Excel 2007 and Statistical Program Social Sciences (SPSS) version 19.0, then the correlation between variables was tested using Pearson and Spearman Correlation test. The results of this study showed most of the taekwondo athletes had normal nutritional status. However, consumption of athletes still do not fulfill the nutrition needs of the athletes, most of the athletes have a lack of sufficient levels of energy. The average value of VO2 max that male athlete were 45.49 ± 4.74 ml/kg/min, while the average value of VO2 max female were below compare to male sex, amounting to 42.03 ± 3.13 ml/kg/min. The relationship between weight loss fitness level had a significant negative correlation (p = 0.028, r = -0.448) and the result of the independent T test between VO2max male and female were highly significant (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