Judul: Kajian penyimpanan irisan segar wortel terolah minimal dalam  kernasan atmosfer termodifikasi
Abstrak: Penelitian ini bertujuan untuk : (1) mempelajari laju respirasi irisan segar wortel, (2) menentukan komposisi atmosfer dan jenis film kemasan yang tepat untuk irisan segar wortel, (3) menentukan berat irisan segar wortel untuk tercapainya kondisi atmosfer modifikasi dan (4) menentukan model empiris hubungan umur simpan dengan parameter mutu kritis irisan segar wortel. Penelitian dilaksanakan di Laboratorium Teknik Pengolahan Pangan dan Hasil Pertanian, Jurusan Teknik Pertanian, Fateta-IPB, dan Laboratorium Rekayasa Proses Pangan, PAU-IPB.
Keyword: 

Judul: Kajian Penyimpanan Rajangan Wortel Segar Terolah Minimal Dalam Kemasan Atmosfer Termodifikasi
Abstrak: Wortel (Daucus carota) terolah minimal dapat dijadikan alternatif penyajian sebagai sayuran segar. Masalah yang terjadi pada pascapanen wortel adalah produk mudah mengalami kerusakan akibat masih berlangsungnya proses fisiologis. Teknologi pascapanen untuk memperpanjang masa simpan sayuran segar dapat dilakukan antara lain penyimpanan dengan atmosfer termodifikasi yang dikombinasikan dengan penyimpanan suhu rendah sehingga konsumen dapat mengetahui secara langsung mutu wortel yang akan dikonsumsinya. Tujuan penelitian secara umum untuk mengkaji kondisi kemasan atmosfer termodifikasi yang sesuai untuk memperpanjang masa simpan rajangan wortel segar/wortel terolah minimal dengan mutu yang masih dapat diterima konsumen, sedangkan tujuan khusus adalah 1) mempelajari laju respirasi rajangan wortel segar pada berbagai tingkat suhu penyimpanan, 2) menentukan komposisi O2 dan CO2 optimum untuk penyimpanan rajangan wortel segar, 3) menentukan jenis film kemasan yang sesuai dan berat optimum untuk penyimpanan rajangan wortel segar, 4) validasi penyimpanan rajangan wortel segar dalam kemasan atmosfer termodifikasi menggunakan film kemasan terpilih, 5) membandingkan rajangan wortel segar dalam kemasan atmosfer termodifikasi dengan kemasan tanpa udara (vakum) dan (6) penentuan parameter mutu kritis dan umur simpan rajangan wortel segar dalam kemasan terpilih.
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