Judul: Penentuan komposisi atmosfir peyimpanan irisan buah mangga segar terlapis film edibel
Abstrak: Buah mangga merupakan buah yang banyak mengandung zat gizi dan banyak dikonsumsi dalam bentuk segar. Konsumsi buah mangga segar di Indonesia meningkat dari 26.53 kg/kapita dalam tahun 1998 menjadi 30 kg/kapita dalam tahun 1995. Dilain pihak buah mangga sangat mudah rusak, karea setelah dipanen masih melakukan aktivitas kehidupan. Sejalan dengan hal tersebut, masyrakat semakin peduli arti kesehatan, sehingga cenderung menyukai buah segar dibanding buah telah mengalami proses pengolahan.
Keyword: 

Judul: Pengawetan Segar Buah Mangga (Mangifera indica L.) dengan Perlakuan Sucrose Polyester, Semperfresh
Abstrak: Mangga adalah salah satu buah tropis yang tergolong sebagai buah klirnakterik, umumnya rnernpunyai umur simpan yang relatif pendek sehingga perlu dilakukan berbagai usaha untuk memperpanjang umur sirnpannya. .SemperfreshTM rnerupakan bahari kimia yang terbuat dari carnpuran sucrose ester of faffy acids, sodium carb~~xymethylcellulosdea n mono-digliserida of faffy acids yang sering digunakan st.bagei bahan pelapis buah-buahan dan sapuran, dan terbukti cukup efektif digunaan untuk mempertahankan mutu buah-buahan selama penyimpznan. Penel,tian ini bertujuan untuk rnengetahui pengaruh perlakuan semperfresh terhadap umor siinpan mangga dan diharapkan dapat mernpertahankan muiu buah rnangga selaina penyimpznan pada kondisi suhti ruang dan silhu dingin. Selain itu, diharapkan d2pat menentbkan formulasi konsentrasi sernpeifreshTM optirnlurn untuk aplikasinya leoih lanjut. Peneli!ian ini dilakukan dalam dua tahap yaitu tahap penelitian pendahuluan dan penelitian utarna. Perlakuan yang diberikan pada tahap peneltian pendailuluan ini berupa konsentrasi semperfreshTMy, aitu (Al) 0%, (A2)1%. (A3) 2% dan (A4) 4% yang dikombinasikan dengan lama perendarnan, yaitu (81) 30,detik, (82) 60 detik, (83) 90 detik dan (84) 120 detik. Buah yang sudah diberi perlakuan kernudian disimpan pada suhu ruang (27+I0C) dan diamati perubahan penampakannya setiap hari sampai pada saat buah te~seburtn encapai ke?daan lewat matang atau kaadaan yang kurang baik lagi untuk dijual dipasaran. Pada tahap ini digunakan tiga macam varietas rnangga kornersial yaitu mangga Manalagi, mangga Arumanis dan rnangga Cengkir (Indrarnayu).
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