Judul: Hubungan Gaya Hidup dan Pengetahuan Gizi terhadap Kebiasaan Makan Remaja di Pedesaan dan Perkotaan
Abstrak: The objective of this research was to study correlation between life styles and nutrition knowledge with eating habit of rural and urban adolescent. Research design was cross sectional study.Samples were selected from adolescent of Senior High School of 10th grader at SMA Negeri 109 Jakarta Selatan and SMK Giri Taruna Jasinga, Kabupaten Bogor. Sampling was done using Simple Random Sampling. The sample consisted of 110 students. The results that the higher the smoking habit the lower the habit of buying street or junk food, the higher internet usage the higher the water consumption, and the higher the nutrition knowledge the lower the eating frequency and the water consumption.
Keyword: eating habit, nutrition knowledge, internet usage, smoking habit, adolescent

Judul: Hubungan antara Kebiasaan Makan dengan Status Gizi pada Remaja di Perkotaan dan Perdesaan
Abstrak: Double burden of nutritional problems are not only faced by urban societies but also rural societies. This study aimed to analyze association of eating habits, physical activities and nutritional status of adolescence in urban and rural areas. The study used cross sectional design involved 102 adolescences. There were significant differences (p<0.05) between subject in urban and rural in term of age, daily pocket money, parents’ educational background, family income, family size, frequency consumption of noodles, chicken, tofu, soybean, carrot, banana, orange, physical activity of school day. There was no significant difference in frequency of a having meal and habit on buying snacks. There was significant correlation between ages, genders, parents’ educational level, family size, family income and nutritional status (TB/U), as well as gender and nutritional status (IMT/U). However, there was no significant correlation between eating habits, physical activities, energy and nutrients adequacy levels and nutritional status (p>0.05).
Keyword: nutritional status, adolescence, food consumption, eating habits, physical activities

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