Judul: Analisis Modal Nafkah dan Konsumsi Pangan Rumah Tangga Petani Kelapa Sawit serta Status Gizi Anak
Abstrak: Kementerian Pertanian RI memaparkan sekitar 500 ribu rumah tangga di Provinsi Riau yang menggantungkan hidup dari sektor perkebunan kelapa sawit. Kondisi modal nafkah hingga berdampak terhadap konsumsi pangan rumah tangga serta status gizi anak menjadi dasar di dalam penelitian ini. Tujuan penelitian ini adalah menganalisis modal nafkah petani kelapa sawit terhadap konsumsi pangan rumah tangga serta status gizi anak. Penelitian dilakukan di Desa Logas Tanah Darat Kabupaten Kuantan Singingi Provinsi Riau pada bulan September – Oktober 2019. Analisis modal nafkah menggunakan metode deskriptif kuantiatif dan kualitatif melalui wawancara mendalam terhadap responden maupun informan. Konsumsi pangan rumah tangga menggunakan metode household dietary diversity score dan food consumption score melalui kuisioner recall 1 x 24 jam dan semi-quantitative food frequency quistionnaire serta catatan riwayat diet secara retrospektif. Peraturan Menteri Kesehatan Republik Indonesia No.2 Tahun 2020 tentang Standar Antropometri Anak dan persepsi ibu terhadap bentuk tubuh anak digunakan sebagai metode analisis status gizi anak. Hasil penelitian menunjukkan hubungan signifikan (p<0.05) antara modal nafkah dengan konsumsi pangan rumah tangga. Konsumsi pangan rumah tangga juga memiliki hubungan signifikan (p<0.05) terhadap status gizi anak.
Keyword: konsumsi pangan rumah tangga, modal nafkah, status gizi anak

Judul: Pola pengeluaran dan konsumsi pangan serta status gizi anak balita pada rumah tangga nelayan pekerja: studi kasus di Muara Angke DKI Jakarta
Abstrak: Penelitian ini bertujuan untuk mempelajari karakte ristik rumah tangga nelayan pekerja termasuk pola penge- luaran yang mempengaruhi konsumsi pangan serta status gizi anak balita. lapis. Data Penarikan contoh dilakukan secara acak ber- yang dikumpulkan meliputi data primer dan sekunder. Pengumpulan data priner dari rumah tangga con- toh dilakukan dengan metode pengamatan нанапсага, langsung. Banyaknya contoh pengukuran dan dalan penelitian ini ditetapkan masing-masing 30 rumah tangga yang nexpu nyai anak balita berstatus gizi baik dan sedang dan 16 runah tangga yang mempunyai anak balita berstatus gizi kurang, sehingga jumlah contoh seluruhnya 76 rumah tangga. Berdasarkan ukuran berat badan menurut unur (BB/U) di- bandingkan standar baku NCHS (National Centre of Health Statistic) untuk masing-masing anak balita yang berstatus gizi baik, sedang dan kurang berturut-turut adalah 87.67 persen (Sd=6.738); 75.40 persen (Sd=2.372 dan 65.56 persen (Sd=3.265).
Keyword: Child feeding, Nutrition, Food consumption

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