Judul: Perilaku Konsumsi Suplemen Pangan (Food Supplement) Pada Wanita Dewasa Di Kota Jakarta Timur
Abstrak: Tujuan penelitian hi adalah mengetahui prilaku konsumsi suplemen makanan dikalangan wanita dewasa, sedangkan tujuan khususnya adalah mengetahui karakteristi k contoh (usia, pendidikan, pekerjaan jam kerj a, pendapatan, kondisi kesehatan, kondisi fisiologis dan pengetahuan gizi tentang suplemen) ; jenis dan bentuk; fie kuensi dan j umlah konsumsi; sumber inforrnasi; tempat membeli, alasan dan manfaat mengkonsumsi suplemen; karakteristik produk (harga, label dan klaim, nomor register, kandungan zat gizi, identitas distributor/produsen) dan menganalisa hubungan karakteristik contoh dengan perilaku komsumsi suplemen (frekuensi dan jumlah konsumsi).
Keyword: 

Judul: Perilaku konsumsi suplemen pangan (food supplement) pada wanita dewasa di kota Jakarta Timur
Abstrak: Tujuan penelitian ini adalah mengetahui prilaku konsumsi suplemen makanan dikalangan wanita dewasa, sedangkan tujuan khususnya adalah mengetahui karakteristik contoh (usia, pendidikan, pekerjaan jam kerja, pendapatan, kondisi kesehatan, kondisi fisiologis dan pengetahuan gizi tentang suplemen); jenis dan bentuk; frekuensi dan jumlah konsumsi; sumber informasi; tempat membeli, alasan dan manfaat mengkonsumsi suplemen; karakteristik produk (harga, label dan klaim, nomor register, kandungan zat gizi, identitas distributor/produsen) dan menganalisa hubungan karakteristik contoh dengan perilaku komsumsi suplemen (frekuensi dan jumlah konsumsi). Penelitian ini adalah bagian dari penelitian payung tentang " Perilaku Konsumsi Suplemen di Perkotaan". Penelitian dilakukan di Jakarta Timur pada bulan Maret sampai Mei 2002. Contoh adalah wanita dewasa yang berusia 20-60 tahun, mempunyai pesawat telepon, bersedia diwawancarai secara mendalam melalui telepon dan mengkonsumsi suplemen minimal satu bulan terakhir. Pengambilan contoh secara acak sistematik, dari kerangka contoh (1200 sambungan telepon) yang dihubungi diperoleh 254 contoh yang bersedia diwawancarai secara mendalam. Jenis data yang dikumpulkan adalah data primer dan data sekunder. Data primer meliputi karakteristik contoh; jenis dan bentuk; frekuensi dan jumlah konsumsi; alasan dan manfaat mengkonsumsi; suplemen sumber informasi; tempat membeli. Data sekunder meliputi karakteristik produk suplemen dan keadaan umum kota Jakarta Timur. Setiap peubah diberi kategori untuk memudahkan dalam pengolahan data. Data dianalisis secara statistik deskriptif (karakteristik contoh; jenis dan bentuk; frekuensi dan jumlah konsumsi; alasan dan manfaat mengkonsumsi suplemen; sumber informasi; tempat membeli) dan korelasi Rank Spearman (hubungan karakteristik contoh dengan frekuensi dan jumlah konsumsi).
Keyword: suplemen

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