Judul: Respon Kualitas Pascapanen Kenikir (Cosmos caudatus) Terhadap Suhu Penyimpanan
Abstrak: Kenikir merupakan sejenis dedaunan yang biasa dijadikan lalapan, namun kenikir mengandung senyawa yang memiliki daya antioksidan yang cukup tinggi seperti kandungan total fenol. Tujuan dari penelitian ini adalah untuk menganalisis pengaruh suhu penyimpanan terhadap kualitas kenikir segar dan menentukan suhu penyimpanan yang optimum untuk mempertahankan kesegaran dan mutu kenikir segar. Percobaan dilakukan dengan menyimpan kenikir pada tiga tingkat suhu yang yang berbeda yaitu 50C, 150C, dan pada suhu ruangan yaitu 270C-300C. Parameter yang diukur meliputi kadar air susut bobot, daya tarik daun, Total Padatan Terlarut (TPT), uji warna, analisis vitamin C, uji total mikroba serta uji total fenol. Hasil pengukuran menunjukkan bahwa penyimpanan suhu rendah mampu menekan laju respirasi, mengurangi susut bobot, mempertahankan kadar air daun, memperlambat perubahan kecerahan daun, meningkatkan TPT, uji tarik, mampu mengurangi penurunan kadar vitamin C, menekan penurunan kandungan fenol serta dapat mengurangi jumlah koloni mikroba.
Keyword: Kenikir, kualitas, penyimpanan, suhu rendah

Judul: Penentuan Dosis Optimum Pemupukan Nitrogen Dan Kalium Untuk Produksi Benih Kenikir (Cosmos Caudatus)
Abstrak: Kenikir (Cosmos Caudatus) Merupakan Salah Satu Jenis Sayuran Indigenos Dengan Banyak Manfaat. Perbanyakan Tanaman Kenikir Dapat Dilakukan Dengan Menggunakan Benih. Budidaya Tanaman Kenikir Untuk Produksi Benih Belum Banyak Diteliti. Penelitian Ini Bertujuan Menentukan Dosis Optimum Pupuk N Dan K Untuk Produksi Benih Kenikir. Penelitian Ini Dilaksanakan Di Kebun Percobaan Pkht Ipb, Tajur, Bogor Dan Di Laboratorium Ilmu Dan Teknologi Benih, Ipb Pada Bulan April Hingga Oktober 2015. Penelitian Ini Dibagi Menjadi 2 Percobaan Paralel Yaitu Pemupukan N Dan K Dengan Menggunakan Rancangan Kelompok Lengkap Teracak (Rklt) Dengan Empat Ulangan. Perlakuan Pemupukan Terdiri Atas Lima Taraf Dosis Pemupukan Yaitu 0, 50, 100, 150 Dan 200% Dari Dosis Acuan (100% N = 94 Kg Urea Ha-1, 100% K = 112 Kg Kcl Ha-1). Hasil Penelitian Menunjukkan Peningkatan Dosis Pupuk N Tidak Meningkatkan Pertumbuhan Vegetatif, Namun Memperpanjang Masa Pembungaan Tanaman Kenikir, Tetapi Tidak Meningkatkan Produksi Benih Yang Dipanen. Peningkatan Dosis Pupuk K Juga Tidak Meningkatkan Pertumbuhan Vegetatif Dan Produksi Benih Tetapi Meningkatkan Daya Berkecambah Dan Berat Kering Kecambah Normal. Dosis Optimum N Dan K Untuk Produksi Benih Kenikir Belum Dapat Ditentukan Melalui Penelitian Ini.
Keyword: Daya Berkecambah, Pembungaan, Sayuran Indigenos

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