Judul: Toleransi Hotong (Setaria italica L. Beauv) pada berbagai  Cekaman Kekeringan: Pendekatan Anatomi dan Fisiologi
Abstrak: Hotong (Setaria italica L. Beauv) merupakan salah satu komoditi tanaman pangan unggul lokal yang dikonsumsi masyarakat di Pulau Buru sebagai pangan alternatif penghasil karbohidrat. Tanaman ini tumbuh pada lahan kering dan toleran terhadap suhu tinggi namun tidak toleran pada periode cekaman kekeringan yang panjang. Budidaya tanaman hotong terutama di prioritaskan pada lahan-lahan kering dengan pola penanaman tadah hujan, sehingga kondisi kekeringan merupakan salah satu faktor lingkungan utama yang dapat menghambat pertumbuhan dan produksinya.
Keyword: 

Judul: Pertumbuhan dan Produksi Sepuluh Genotipe Hotong (Setaria italica (L.) Beauv)
Abstrak: Hotong (Setaria italica (L.) Beauv) merupakan salah satu tanaman pangan yang berpotensi untuk dikembangkan dalam rangka mendukung diversifikasi pangan di Indonesia. Hotong memiliki kandungan karbohidrat, protein dan lemak yang cukup tinggi serta memiliki indeks glikemik yang rendah. Meskipun memiliki kandungan gizi yang cukup tinggi, tanaman ini kurang dipelajari dan dikembangkan di Indonesia. Tujuan dari penelitian ini adalah untuk mengetahui pertumbuhan dan hasil sepuluh genotipe hotong dari Balitsereal. Penelitian ini dilaksanakan di Kebun Percobaan Cikabayan Bawah pada ketinggian ± 240 m dpl, pada bulan Februari-Juni 2016. Percobaan disusun berdasarkan rancangan kelompok lengkap teracak dengan tiga ulangan. Hasil analisis korelasi menunjukkan bahwa panjang daun bendera, rasio panjang dan lebar daun bendera, bobot malai utama, bobot biji isi malai utama, serta bobot malai per tanaman berkorelasi positif dengan daya hasil (bobot biji per tanaman). Scatter plot dibangun untuk membagi genotipe berdasarkan bobot malai per tanaman dan bobot biji per tanaman. Empat genotipe yaitu ICERI 1, ICERI 2, ICERI 4 dan ICERI 10 terletak di kuadran I, yang mengindikasikan bahwa keempat genotipe tersebut memiliki bobot malai per tanaman dan bobot biji per tanaman yang lebih tinggi dibandingkan dengan genotipe lainnya.
Keyword: diversifikasi, pangan fungsional, produksi, tanaman pangan minor

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