Judul: Prevalensi anemia dan perilaku makan remaja puteri di SMUN 2 Kuningan kabupaten Kuningan
Abstrak: Penelitian ini secara umum bertujuan untuk mengetahui prevalensi anemia dan perilaku makan remaja puteri SMUN 2 Kuningan. Adapun tujuan khususnya adalah untuk mengetahui prevalensi anemia remaja puteri, karakteristik contoh dan keluarganya, pengetahuan tentang anemia, sikap tentang anemia, kebiasaan makan, dan tingkat konsumsi protein, zat besi, vitamin A dan vitamin C, serta mengetahui perbedaan pengetahuan, sikap, kebiasaan makan, dan tingkat konsumsi antara remaja puteri anemia dengan non anemia. Penelitian ini dilakukan di SMUN 2 Kuningan yang berada di Kabupaten Kuningan, Jawa Barat, dari Bulan April sampai Mei 2001. Contoh dalam penelitian ini adalah remaja puteri Kelas 1 dan Kelas 2. Jumlah contoh diambil secara proporsional adalah 20% dari jumlah siswa yang diperiksa (236) yakni 48 orang yang diambil secara Systematic Sampling. Data yang dikumpulkan adalah data primer dan data sekunder. Data primer meliputi kadar Hb untuk menentukan status anemia dengan menggunakan metode Sahli, keadaan umum contoh, keadaan sosial ekonomi keluarga, pengetahuan, sikap, kebiasaan makan yang dikumpulkan melalui kuesioner, serta konsumsi pangan dengan metode recall. Data sekunder meliputi keadaan umum daerah dan sekolah. Analisis data dilakukan secara statistik deskriptif dan inferensial yang menggunakan uji Man Whitney U dan t-test dengan menggunakan program komputer Excel 2000 dan SPSS 10,0 for windows.
Keyword: anemia

Judul: Pola Konsumsi, Status Gizi, Dan Status Anemia Pada Remaja Putera Dan Puteri
Abstrak: Tujuan umum penelitian adaiah untuk mengetahui pola konsumsi, status gizi dan status anemia pada remaja putera dm puteri di SMUN 1 Kecamatan Guguk Kabupaten Lima Puluh Kota. Adapun tujuan khusus penelitian ini adalah (1) Mengethi ksrakteristik remaja (umur, uang saku, jenis kelamin, aktivitas fisik, keadaan kesehatan, pengetahuan gizi, pendidikan dan peke jaan orangtua, serta besar keluarga). (2) Mengetahui pola konaumsi dan tingkat konsumsi zat gizi (energi. protein, Fe, vitamin C) remaja putera dan puteri. (3) Menganalisis perbedaan status gizi dan status anemia remaja putera dan puteri. (4) Menganalisis pengaruh tingkat pengetahuan gizi, konsumsi zat gizi (energi, protein, vitamin C dan Fe), total aktivitas fisik dan jenis kelamin terhadap status gizi dan status anemia remaja.
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