Judul: Pengaruh intervensi gizi terhadap peningkatan kadar haemoglobin (Hb) darah dan tingkat morbiditas anak balita kurang energi kronik (KEK) di tempat penitipan anak (TPA) di Perkebunan Teh  : (Studi kasus di Perkebunan Teh PTP XIII, Pengalengan, Propinsi Jawa Barat)
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh intervensi gizi terhadap: 1) tingkat konsumsi pangan anak Balita Kurang Energi Kronik (KEK) khususnya yang berusia enam bulan sampai 24 bulan, 2) peningkatan kadar hemoglobin (Hb) darah anak Balita KEK usia antara enam bulan sampai 24 bulan, 3) tingkat morbiditas anak Balita KEK usia enam bulan sampai 24 bulan, serta 4) mengetahui hubungan peningkatan kadar Hb darah terhadap morbiditas anak Balita KEK, usia enam bulan sampai 24 bulan.
Keyword: intervensi gizi

Judul: Pengaruh intervensi gizi terhadap status gizi anak balita kurang energi kronik di tempat penitipan anak di perkebunan teh
Abstrak: Penelitian ini bertujuan mempelajari pengaruh intervensi gizi dalam bentuk pemberian makanan selingan terhadap tingkat konsumsi energi dan protein, morbiditas serta status gizi anak penderita kurang energi kronik (KEK) berusia 6 sampai 24 bulan, serta hubungan dengan faktor-faktor sosial-ekonomi yang diduga mempengaruhinya; meliputi besar keluarga, pendapatan dan pengeluaran keluarga, serta tingkat konsumsi energi dan protein keluarga. Penelitian dilakukan terhadap 94 anak yang ibunya bekerja sebagai karyawan pemetik teh, pemelihara Lanaman, alau di bagian pengolahan, di 6 Kebun yang termasuk di dalam lingkungan perkebunan teh, PT Perkebunan (PTP) XIII, Pangalengan, Bandung. Anak-anak tersebut terdiri atas 54 anak yang pada waktu ibunya bekerja, diasuh di Tempat Penitipan Anak (TPA) dan 40 anak yang diasuh di rumah alau di luar Tempat Penitipan Anak (LTPA). Keseluruhannya anak- anak itu terbagi dalam 3 kelompok, yaitu satu kelompok terdiri atas 38 anak yang diasuh di Tempat Penitipan Anak yang diintervensi gizi (TPAI), kemudian 2 kelompok anak yang tidak mendapat intervensi, yaitu 16 anak yang diasuh di TPA dan 40 anak yang diasuh di rumah sendiri atau di LTPA. Intervensi gizi yang diberikan untuk setiap anak, rata-rata sebanyak 400 Kalori dan 5 gram protein setiap hari selama 3 bulan, dalam bentuk suplementasi makanan selingan Responden adalah ibu atau pengasuh anak.
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