Judul: Pengaruh Bahan Pencucuian dan Perilaku Obuki Terhadap Tampilan Buah Mannga (Mangifera Indica L.) cv. Gedong
Abstrak: Getah mangga yang menempel pada kulit buah merupakan masalah serius karena dapat menyebabkan terjadinya luka bakar (sapburn) dan terjadinya kerusakan seperti jamur jelaga (black mildew), pencoklatan (browning), bintik lentisel (lenticels), busuk buah (body root) dan lainnya. Pencucian buah mangga merupakan salah satu metode untuk mengatasi getah, luka bakar, pencoklatan, dan kerusakan lainnya. Tujuan penelitian ini adalah untuk mengetahui bahan pencuci yang paling efektif untuk menghilangkan getah mangga dan menghambat terjadinya luka bakar dan kerusakan pada buah mangga yang mendapat perlakuan Obuki dan yang tidak mendapat perlakuan Obuki.
Keyword: 

Judul: Keefektifan Bahan Pencuci Dan Pencegah Penyakit Terhadap Kualitas Buah Mangga Cv. Gedong Gincu Dan Arumanis
Abstrak: Mangga merupakan salah satu komoditas buah tropis unggulan Indonesia yang mempunyai peluang penting untuk ekspor. Namun, ekspor buah mangga masih menghadapi beberapa permasalahan. Salah satu masalah yakni adanya getah yang mengotori kulit buah mangga. Getah mangga mengandung asam organik dan minyak. Getah juga mengandung karbohidrat yang dapat mengundang cendawan penyebab beberapa kerusakan fisik pada buah, seperti luka bakar, antraknosa dan busuk pangkal buah. Penelitian ini bertujuan untuk mendapatkan bahan pencuci dan pencegah penyakit pascapanen yang paling efektif terhadap kualitas buah mangga kultivar Gedong Gincu dan Arumanis. Pengambilan sampel dilaksanakan di Desa Girinata, Cirebon dan Desa Alas Kandang, Probolinggo. Percobaan dilakukan di Laboratorium Pascapanen, Departemen Agronomi Institut Pertanian Bogor pada bulan November 2013 sampai Januari 2014. Penelitian ini menggunakan Rancangan Acak Lengkap 2 faktor, yaitu bahan pencuci dan pencegah penyakit. Faktor pertama terdiri atas tiga taraf yaitu air (kontrol) (P0), deterjen 1% (P1), deterjen 1% + Ca(OH)2 0.5% (P2). Faktor kedua terdiri atas tiga taraf yaitu, kontrol (T1), fungisida benomil (T1), khamir Cryptococcus albidus dengan konsentrasi 5 g/liter setara dengan 5 x 104 sel/ml (T2). Perlakuan kombinasi bahan pencuci dan pencegah penyakit deterjen 1% + Ca(OH)2 0.5% + khamir 5 x 104 sel/ml dan deterjen 1% + Ca(OH)2 0.5% + fungisida 0.025% yang paling efektif menghilangkan getah, mengurangi luka bakar, bintik lentisel, dan mengurangi terjadinya penyakit antraknosa dan busuk pangkal buah pada mangga Gedong Gincu dan Arumanis.
Keyword: antraknosa, bintik lentisel, busuk pangkal buah, getah, khamir

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