Judul: Konsumsi energi minuman berkalori dan kontribusinya terhadap total konsumsi energi pada remaja dan dewasa
Abstrak: The objective of this research was to analyze energy intake from calorie beverages (EICB) and it’s contribution total energy intake of adolescents and adults. The research was carried out throught analyzing a data set of THIRST (The Indonesian Regional Hydration Study) collected in 2008 and 2009 by applying a crossectional study design among 606 adolescents (male and female aged 15-18 yrs) and 594 adults (male and female aged 25-55 yrs) in North Jakarta, West Bandung, Surabaya, Malang, Makasar and Malino. Data processing and analysis were conducted in Bogor in April-July 2011. The results showed that the mean EICB among adolescents was 420 ± 406 kcal/d and emong adults was 450 ± 382 kcal/d, which is 21.2% and 23.4% of the total energy intake (TEI) of adolescents and adults respectively. EICB was moderately associated with TEI of adolescents (r= 0.58, p<0.05 ), of adults (r= 0.51 , p<0.05), and of both adolescents and adults (r= 0.54 and p<0.05). This could be lead to over energy intake, obesity and other possible adverse effects. Further studies are required to analyze causal relationship between EICB and obesity, and other possible adverse effects among Indonesians; while at the same time it is also important to start promoting an advice for healthier and wiser beverages choices.
Keyword: 

Judul: Aktivitas fisik dan konsumsi energi minuman berkalori pada laki-laki dan perempuan gemuk dan tidak gemuk
Abstrak: The objective of this research was to study physical activity level (PAL) and energy intake from calorie beverages (EICB) of overweight (OW) and nonoverweight (NOW) males and females. The research was carried out throught analyzing a data set of THIRST (The Indonesian Regional Hydration Study) collected in 2008 and 2009 by applying a cross sectional study design among 606 adolescents (male and female aged 15-18 years) and 594 adults (male and female aged 25-55 years) in North Jakarta, West Bandung, Surabaya, Malang, Makasar, and Malino. Data processing and analysis were conducted in Bogor in Maret-July 2011. Since the prevalence of OW in adolescent is small (13.5%), the analysis was combined for both adolescent and adults, regardless the age goups. The results showed that the prevalence of OW was 31.8%, which is higher among female (35.5%) than male (27.9%). The mean BMI for overall subjects was 23.0 ± 4.9 (kg/m2), among female and male was 23.5 ± 5.2 (kg/m2) and 22.5 ± 4.6 (kg/m2) respectively, and among OW and NOW was 29.1 ± 3.9 (kg/m2) and 20.6 ± 2.7 (kg/m2) respectively. The mean PAL for overall subjects was 1.65 ± 0.19, among female and male was 1.62 ± 0.16 and 1.69 ± 0.21 respectively; and among OW and NOW was 1.60 ± 0.16 and 1.67 ± 0.19 respectively. The mean intake of EICB was 439 ± 394 kcal/day, among female and male was 409 ± 367 kcal/day and 471 ± 420 kcal/day respectively, and among OW and NOW was 395 ± 360 kcal/day and 477 ± 408 kcal/day respectively. The five types of calorie beverages most consumed by OW and NOW were the same, namely unpacked tea, unpacked coffee, unpacked juice, packed milk and unpacked yoghurt. There was significant correlation between PAL and BMI, but not for EICB and BMI, which more likely explained by the low energy adequacy level (84.3%) among subjects and the weaknesses of the cross sectional study design. This implies that increasing physical activity and limiting energy adequacy level is important to prevent overweight. Further studies with better design are required in this field in Indonesia.
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