Judul: Praktik Hidup Sehat Dan Persepsi Tubuh Ideal Remaja Putri Sma Negeri 1 Kota Bogor
Abstrak: The research aims were to study healthy living practices and perceptions of ideal body among female students. Design of the research was cross sectional study conducted in October 2010 in senior high school 1 Bogor city. Sample consisted of 40 students thin and 40 students normal. The results showed no significant relationship between personal hygiene practices, smoking practice, sports practice and healthy food practice with the nutritional status (p> 0.05). Vitamin C were the most frequet supplements consumed by the thin group (47.5%) and (45.0%) by the normal group. The thin nutritional status (75.0%) and normal (60.0%) have a negative body perception. It is recommended that the female students perception fit with their actual body size.
Keyword: 

Judul: Correlation Between Eating Behavior and Body Image with Nutritional Status among High School Students in Bogor
Abstrak: Dewasa ini remaja mulai memerhatikan perubahan fisik yang terjadi pada mereka dan tak jarang merasa tidak puas dengan bentuk tubuh yang dimiliki. Hal tersebut dapat mendorong remaja untuk melakukan upaya-upaya tertentu untuk membuat bentuk tubuh sesuai keinginannya, seperti membatasi asupan makan dan melakukan diet berlebih yang dapat memengaruhi perilaku makan, persepsi diri terhadap citra tubuh, dan status gizi. Penelitian ini bertujuan untuk menganalisis hubungan antara perilaku makan dan body image dengan status gizi siswa SMA di Kota Bogor. Desain penelitian ini adalah cross-sectional study. Jumlah sampel yang digunakan sebanyak 114 siswa SMA di Kota Bogor. Pengumpulan data dilakukan melalui wawancara dan self-administered secara online. Sebagian besar subjek memiliki status gizi normal (81,6%), tergolong dalam tipe perilaku makan external eating (75,4%), memiliki persepsi body image negatif (51,8%), dan memiliki kebiasaan makan yang kurang baik (53,5%). Terdapat hubungan signifikan antara status gizi siswa SMA dengan perilaku makan restrained eating (p=0,018) dan body image (p=0,000). Tidak terdapat hubungan signifikan antara perilaku makan emotional eating dan external eating terhadap status gizi (p>0,05). Dapat disimpulkan bahwa perilaku makan dan persepsi body image memengaruhi status gizi siswa., These days, adolescence begine to pay attention to the physical changes that occur to them and often feel dissatisfied with their body shape. This can encourage adolescents to make certain efforts to make the body shape according to their wishes, such as limiting food intake and doing excessive diets that can affect eating behavior, body image, and nutritional status. The purpose of this study was to analyze the correlation between eating behavior and body image with nutritional status among high school students in Bogor. The design of this study was a cross-sectional study. The number of samples used in this study were 114 high school students. Data was collected through interviews and self-administrated online. Most of the subjects had normal nutritional status (81.6%), belonged to the external eating behavior (75.4%), have a negative body image perception (51.8%), had unhealthy eating habits (53.5%). There is a significant relationship between nutritional status in high school students with restrained eating (p=0.018) and body image (p=0.000). However, there is no significant relationship between emotional eating and external eating behavior on nutritional status (p>0.05). It can be concluded that eating behavior and perception of body image affect the nutritional status of students.
Keyword: adolescent, body image, nutritional status, food habits, eating behavior

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