Judul: Perilaku konsumsi jamu pada remaja putri di SMA Negeri 1 Pati Kabupaten Pati, Provinsi Jawa Tengah
Abstrak: Secara umum penelitian ini bertujuan untuk mengetahui perilaku konsumsi jamu pada remaja putri. Adapun tujuan khususnya adalah (1) Mengetahui karakteristik keluarga contoh (pendidikan, pendapatan, umur, besar keluarga dan perilaku konsumsi jamu); (2) Mengetahui karakteristik lingkungan sekolah contoh (perilaku konsumsi jamu kelompok teman); (3) Mempelajari morbiditas (penyakit yang diderita) dan status gizi contoh; (4) Mempelajari pengetahuan tentang jamu dan sikap remaja putri terhadap jamu; (5) Mempelajari perilaku konsumsi jamu (tujuan, manfaat, usia mulai konsumsi, jenis, bentuk, frekuensi, pendorong, pertimbangan memilih jamu dan ada tidaknya jamu pantangan) pada remaja putri. Penelitian ini menggunakan desain survey melalui pendekatan cross sectional study, dilakukan di Kota Pati, Kabupaten Pati, Provinsi Jawa Tengah pada bulan April Mei 2004. Penarikan contoh dilakukan secara purposive sampling terhadap murid-murid wanita SMU Negeri 1 Pati yang berdomisili di Kota Pati dan tinggal bersama orang tua. Jenis data ada dua yaitu data primer (karakteristik sosial ekonomi keluarga, perilaku konsumsi jamu keluarga contoh, pengetahuan tentang jamu, sikap terhadap jamu dan perilaku konsumsi jamu contoh yang meliputi manfaat, tujuan, usia mulai konsumsi jamu, jenis, bentuk, frekuensi, pendorong, pertimbangan memilih jamu jamu pantangan, sumber informasi dan ketersediaan jamu) dan data sekunder (keadaan umum SMU Negeri 1 Pati). Data kemudian ditabulasikan dan dianalisis secara deskriptif dengan menggunakan program SPSS for Windows versi 11.5.
Keyword: jamu, morbiditas

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