Judul: Aplikasi Desinfektan untuk Mencegah dan Menghambat Kerusakan Pascapanen Pisang Barangan (Musa acuminata L.).
Abstrak: Cendawan Colletotrichum sp dan Botryodiplodia sp pada umumnya menginfeksi pohon pisang Barangan sejak di lapang dan dapat terbawa pada bagian buahnya setelah dipanen. Penelitian ini bertujuan untuk mengkaji dua jenis desinfektan yaitu benomyl dan larutan daun sirih dalam menghambat kerusakan pascapanen pisang Barangan yang disebabkan oleh cendawan. Sampel pisang berumur 12 minggu setelah anthesis, dibagi menjadi tiga kelompok untuk perlakuan perendaman dengan larutan benomyl (300 ppm, 400 ppm, dan 500 ppm), larutan daun sirih (10%, 15%, dan 20%), dan tanpa perlakuan (kontrol). Sampel pisang disimpan pada suhu ruang. Variabel yang diamati adalah gejala penyakit pada kulit buah, warna dan kekerasan kulit serta jumlah mikroba. Penelitian menunjukkan bahwa perendaman dengan larutan benomyl 500 ppm memberikan hasil terbaik dalam menghambat pertumbuhan mikroba hingga hari ke-12 penyimpanan dengan jumlah mikroba 5667 koloni/ml, penurunan kekerasan kulit rendah (0,12 kgf), perubahan warna (kematangan) lambat dengan nilai hue 255,340 dan kecerahannya (L) 52,67. Sementara untuk larutan daun sirih yang terbaik adalah pada konsentrasi 10% yang dapat menghambat pertumbuhan mikroba lebih rendah dari larutan benomyl sampai dengan hari ke-6 penyimpanan (3000 koloni/ml) namun pada hari ke-12 perkembangan mikrobanya meningkat mencapai 9000 koloni/ml.
Keyword: cendawan, desinfektan, pascapanen, pisang Barangan

Judul: Aplikai Zat Pengatur Tumbuh dalam Penanganan Pasca Panen Pisang Cavendish (Musa cavendishii L.)
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh aplikasi gabungan spermidin dengan asam giberelat dan pengaruh asam giberelat serta spermidin dalam menghambat efek etephon yang diaplikasikan pada pisang cavendish. Ada 8 macam perlakuan yang diberikan yaitu kontrol, kontrol infiltrasi air, spermidin 1 mM, asam giberelat 200 ppm, etephon 250 ppm, etephon 250 ppm + spermidin 1 mM, etephon 250 ppm + asam giberelat 200 ppm, spermidin 1 mM + asam giberelat 200 ppm. Aplikasi perlakuan dengan dua macam teknik yaitu infiltrasi bertekanan dan perendaman. Infiltrasi bertekanan diberikan pada perlakuan kontrol infiltrasi, spermidin 1 mM, asam giberelat 200 ppm dan spermidin 1 mM + asam giberelat 200 ppm. Perendaman dilakukan pada buah yang diberi perlakuan etephon 250 ppm. Pisang dibungkus dengan plastik polietilen yang berlubang delapan dan disimpan dalam ruangan pada suhu kamar (25-30 derajat cellcius). Rancangan yang digunakan adalah rancangan acak lengkap dengan tiga ulangan.
Keyword: 

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