Judul: Keterdedahan terhadap Tayangan Iklan dan Sikap Ibu dalam Memberi Pangan Balita.
Abstrak: Masa balita merupakan masa kehidupan yang sangat penting dan perlu perhatian yang khusus dari orangtua. Orangtua yang paling berperan dalam tumbuh kembang anak adalah ibu. Sikap diduga merupakan fungsi dari pengetahuan yang diperoleh melalui media tayangan iklan. Penelitian ini bertujuan untuk mengetahui hubungan keterdedahan iklan tentang pangan dan pengetahuan dengan sikap ibu dalam memberi pangan pada balita. Jenis penelitian ini adalah penelitian kuantitatif dengan metode survei yang didukung data kualitatif dengan metode wawancara mendalam. Responden terdiri dari 40 orang ibu. Hasil penelitian menunjukkan tingkat keterdedahan memiliki hubungan signifikan dengan tingkat pengetahuan ibu dan tingkat pengetahuan pangan ibu tidak memiliki hubungan signifikan dengan sikap ibu dalam memberi pangan pada balita.
Keyword: keterdedahan iklan, pengetahuan, sikap

Judul: Hubungan Pengetahuan Gizi Ibu dengan Persepsi dan Perilaku Ibu terhadap Jajanan dan Status Gizi Balita
Abstrak: Penelitian ini bertujuan untuk mengidentifikasi ada tidaknya hubungan antara pengetahuan dan persepsi gizi ibu balita dengan perilaku pemilihan jajanan bagi balita dan status gizi. Studi cross sectional dilakukan pada 93 balita yang dipilih melalui purposive sampling di Desa Babakan, Dramaga, Bogor. Data dikumpulkan dengan antropometri dan wawancara meliputi karakteristik balita dan keluarga, kebiasaan makan balita, pengetahuan gizi, persepsi dan perilaku ibu terhadap jajanan. Analisis hubungan dilakukan dengan uji korelasi Spearman menggunakan SPSS. Rata-rata subjek memiliki status gizi normal. Asupan energi dan zat gizi harian rata-rata defisiensi kecuali protein. Jajanan menyumbang rata-rata 33,6% dari total asupan energi, 26,1% protein, 38,4% lemak, dan 37,4% karbohidrat. Hampir semua subjek sering mengonsumsi jajanan dengan frekuensi 3-4 kali sehari. Terdapat hubungan signifikan antara pengetahuan gizi ibu dengan persepsi ibu terhadap jajanan (p=0,000, r=0,358). Persepsi ibu terhadap jajanan perilaku ibu terhadap jajanan (p=0,050, r=0,596). Perilaku ibu terhadap jajanan juga memiliki hubungan negatif dengan frekuensi jajan balita (p=0,005, r=-0,289). Status gizi balita berhubungan dengan pengetahuan gizi ibu (p=0,003, r=0,779).
Keyword: mother’s behavior to snack, mother’s nutritional knowledge, mother’s perception to snack, snack, toddler

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