Judul: Pengaruh perlakuan panas dengan metode Hot Water Traetment terhadap mutu paprika Capsicum annum L.var. Grossum selama penyimpanan
Abstrak: Paprika merupakan jenis tanaman hortikultura yang baru dikenal masyarakat Indonesia. Tanaman hortikultura, memegang peranan yang penting dalam meningkatkan gizi masyarakat. Gizi yang banyak terkandung dalam sayuran yaitu vitamin, mineral, dan karbohidrat. Seiring dengan meningkatnya kebutuhan gizi masyarakat kebutuhan akan sayuran semakin meningkat dan semakin bervariasi. Perkembangan ekspor komoditi hortikultura untuk negara Indonesia mengalami kenaikan sebesar 2.85% dengan total berat bersih ekspor bulan Januari-Juni 2000 sebesar 1 334 137 ton menjadi 1 372 223 ton pada bulan Januari-Juni 2001 (BPS, 2001). Cabai manis atau paprika mempunyai rasa manis yang menjadi keunikannya. Cabai pada umumnya mengandung zat capcaisin (C9H12O2) yang menyebabkan rasa pedas. Namun pada paprika zat ini hampir tidak ditemukan sehingga rasanya tidak pedas, melainkan manis. Paprika merupakan salah satu komoditi ekspor yang penting di Indonesia, mengingat nilai ekonomisnya yang tinggi, oleh karena itu diperlukan adanya usaha-usaha peningkatan, pemanfaatan produk dan mutu paprika. Dalam usaha peningkatan mutu paprika banyak kendala yang ditemui oleh produsen mengingat paprika bukan tanaman asli Indonesia melainkan berasal dari negara empat musim. ...
Keyword: 

Judul: Respon Kualitas Pascapanen Paprika Hijau (Capsicum Annum L.) Pada Beberapa Tingkat Suhu Penyimpanan
Abstrak: Paprika hijau adalah produk hortikultura yang termasuk mudah rusak, baik kerusakan fisik, mekanik, ataupun mikrobiologis. Untuk mempertahankan kualitas paprika dibutuhkan penanganan pascapanen yang tepat, terutama pada tahap penyimpanan. Tujuan dari penelitian ini adalah menganalisis perubahan kualitas pascapanen paprika hijau pada beberapa tingkat suhu penyimpanan. Paprika hijau yang telah disortasi dan dibersihkan kemudian disimpan pada suhu 10⁰C, 15⁰C dan suhu ruang (27-30⁰C). Parameter kualitas yang diamati yaitu laju respirasi, warna, susut bobot, tingkat kekerasan kulit, total padatan terlarut, kadar air, dan kandungan vitamin C. Penyimpanan suhu rendah (15 dan 10⁰C) mampu memperpanjang umur simpan paprika hijau hingga 22 hari pada suhu 15⁰C dan 28 hari pada suhu 10⁰C.
Keyword: kualitas pascapanen, paprika hijau, penyimpanan suhu rendah

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