Judul: Pengetahuan Dan Sikap Mahasiswi Ipb Tentang Seribu Hari Pertama Kehdiupan Terkait Masa Prenatal.
Abstrak: Tujuan penelitian ini adalah mengkaji pengetahuan dan sikap mahasiswi IPB tentang 1000 HPK terkait masa prenatal. Penelitian ini menggunakan desain cross-sectional study. Contoh dalam penelitian ini adalah 46 mahasiswi Tingkat Persiapan Bersama (TPB) semester 2 dan 40 mahasiswi mayor Gizi Masyarakat (GM) semester 8. Evaluasi pengetahuan dan sikap mahasiswi tentang 1000 HPK terkait masa prenatal dibagi menjadi tiga komponen yang terdiri dari kesehatan reproduksi, masa kehamilan, dan Perilaku Hidup Bersih dan Sehat. Hasil penelitian menunjukkan bahwa pengetahuan mahasiswi TPB semester 2 tergolong kurang (skor<60.0%) dan sikap tergolong sedang (skor 60.0-80.0%) sedangkan pengetahuan mahasiswi GM semester 8 tergolong sedang (skor 60.0-80.0%) dan sikap tergolong baik (skor >80.0%). Tingkat pengetahuan 1000 HPK terkait masa prenatal mahasiswi di GM semester 8 (55.0%) secara signifikan lebih tinggi dibandingkan dengan mahasiswi TPB semester 2 (54.3%) (p<0.05) dan sikap kedua contoh di TPB semester 2 dan GM semester 8 (58.7% dan 50.0%) tergolong sedang.
Keyword: mahasiswi, pengetahuan, prenatal, sikap

Judul: Pengetahuan dan Sikap Mahasiswi IPB tentang Seribu Hari Pertama Kehidupan terkait Masa Postnatal.
Abstrak: Penelitian ini bertujuan untuk mengkaji pengetahuan dan sikap mahasiswi IPB tentang 1000 HPK terkait masa postnatal. Desain penelitian yang digunakan adalah cross-sectional study dengan jumlah contoh sebanyak 46 mahasiswi Tingkat Persiapan Bersama (TPB) semester 2 dan 40 mahasiswi semester 8 Program Studi Ilmu Gizi (GM) yang dipilih secara acak. Evaluasi pengetahuan dan sikap mahasiswi tentang 1000 HPK terkait masa postnatal dibagi menjadi tiga komponen yang terdiri dari masa bayi 0-6 bulan, masa anak 7-24 bulan, serta perilaku hidup bersih dan sehat. Pengumpulan data dilakukan dengan cara pengisian kuesioner. Tingkat pengetahuan 1000 HPK terkait masa postnatal mahasiswi GM (83.7%) adalah signifikan lebih tinggi dibandingkan dengan mahasiswi TPB (52.8%) dan sikap kedua contoh baik TPB (7.7%) maupun GM (77.0%) tergolong kategori sedang. Semakin meningkat jumlah uang saku dan usia, maka semakin baik pengetahuan dan sikap contoh terhadap 1000 HPK terkait masa postnatal.
Keyword: mahasiswi, pengetahuan, postnatal, sikap

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