Judul: Perilaku gizi dan status gizi anak sekolah penerima PMT-As serta Non PMT-As di Kabupaten Cirebon
Abstrak: Tujuan umum dari penelitian ini adalah untuk menganalisis perilaku gizi dan status gizi anak sekolah penerima PMT-AS dan Non PMT-AS. Secara khusus penelitian ini bertujuan untuk; (1) Menganalisis karakteristik anak sekolah (jenis kelamin, umur, riwayat kesehatan anak, uang saku) dan keluarganya (pendidikan orang tua, pekerjaan orang tua, pendapatan orang tua, besar keluarga) di SD PMT- AS dan Non PMT-AS, (2) Menganalisis perilaku gizi anak SD PMT-AS dan SD Non PMT-AS, (3) Menganalisis status gizi anak SD PMT-AS dan SD Non PMT-AS, (4) Menganalisis faktor-faktor yang berhubungan dengan perilaku gizi, konsumsi energi dan protein, serta status gizi anak SD PMT-AS dan SD Non PMT-AS.
Keyword: perilaku gizi, status gizi

Judul: Kinerja penyelenggaraan PMT-AS dan status gizi anak sekolah dasar di dua kecamatan di kabupaten Bogor
Abstrak: Penelitian ini bertujuan untuk mengetahui kinerja penyelenggaraan PMT-AS dan status gizi anak sekolah dasar, baik SD/MI swasta atau negeri di desa tertinggal di wilayah Kabupaten Bogor. Penelitian ini secara khusus bertujuan untuk mengetahui kinerja pengelola PMT-AS tingkat desa dan kecamatan, kinerja pelaksana PMT-AS tingkat SD/MI, kandungan energi dan protein dari makanan kudapan PMT-AS, menganalisa perbedaan status gizi anak SD/MI Tahun II dan Tahun III PMT-AS dan perbedaan status gizi anak sekolah penerima PMT-AS antara daerah IDT pedesaan dan IDT perkotaan. Lokasi penelitian adalah Kecamatan Leuwiliang (IDT Pedesaan) dan Cibungbulang (IDT Perkotaan) di Kabupaten Bogor. Tempat penelitian ini dilakukan di SD Karyasari II dan MI Muhamadiyah Curug II (Desa Karyasan, Kecamatan Leuwiliang), serta di SD Cemplang I dan SD Cemplang III (Desa Sukamaju. Kecamatan Cibungbulang). SD/MI yang terpilih merupakan SD/MI penerima PMT- AS Contoh penelitian dipilih secara purposive yaitu pengelola PMT-AS tingkat kecamatan dan desa yang terdiri dari dua orang camat dan dua orang kepala desa. Pelaksana PMT-AS tingkat SD/MI yang terdiri dari empat orang kepala sekolah SD/MI dan enam orang anggota PKK. Selanjutnya dipilih contoh anak SD/MI sebanyak 681anak yang memiliki kelengkapan data berat badan selama dua periode (bulan Februari 1999 dan bulan Juni 2000). Penelitian ini dilaksanakan selama 16 bulan yaitu dari bulan Februari 1999 dan bulan Juni 2000.
Keyword: status gizi

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