Judul: Studi Kinetika Perubahan Mutu Tempe selama Proses Pemanasan
Abstrak: Tempe merupakan produk fermentasi tradisional Indonesia dari kacang kedelai dengan menggunakan kapang. Kapang utama yang berperan dalam fermentasi tempe adalah Rhizopus sp. Konsumsi tempe kedelai di Indonesia cenderung menurun selama lima tahun terakhir, yaitu dari 22.7 g/kapita/hari pada tahun 2002 menjadi 21.7 g/kapita/hari pada tahun 2007 (Hardinsyah et. al, 2008). Djanuwardi dan Silitonga (2001) menyatakan bahwa pada tahun 1983 sekitar 50% konsumsi kedelai di Indonesia digunakan untuk produk tempe. Penyimpanan tempe segar pada suhu ruang memiliki keterbatasan umur simpan, yaitu sekitar 48 jam (Nuraini, 1995). Terbatasnya umur simpan tempe segar disebabkan aktivitas enzimatik dari kapang tempe. Kerusakan tempe dapat dilihat dari perubahan warna miselium kapang menjadi coklat, pelunakan tekstur dan pembentukan odor amonia (Nout dan Rambots, 1990) yang terjadi akibat degradasi protein oleh enzim-enzim proteolitik menghasilkan amoniak (NH3).
Keyword: 

Judul: Mempelajari pengaruh pengeringan dan penyimpanan tempe berflavor sintetis terhadap penerimaan
Abstrak: Tempe kedelai (untuk selanjutnya disebut tempe) adalah salah satu produk fermentasi kedelai yang merupakan makan- an orisinal dari Indonesia dan dikonsumsi secara luas oleh masyarakat Indonesia. Tempe segar sangat mudah rusak dan hanya dapat berta- han satu dua hari pada suhu kamar. Kerusakan tempe teru- tama disebabkan oleh aktifitas enzim yang mendegradasi pro- tein, sehingga terbentuk amoniak. Fengeringan merupakan salah satu alternatif untuk memperpanjang masa simpan tem- pe. Fenelitian ini menggunakan dua macam suhu pengeringan, yaitu 90°C selama 2 jam dan 70°C selama 6 jam. Fenyimpan- an dilakukan pada suhu kamar dengan dua macam pengemas, ya- itu plastik biasa dan pengemasan vakum, selama enam minggu. Analisa yang dilakukan adalah daya rekonstitusi, kadar air, nilai pH, total asam, daya tahan terhadap ketengikan, teks- tur secara obyektif dan uji organoleptik terhadap warna, aroma, tekstur dan rasa. Analisa dilakukan setiap dua minggu sekali. Dari hasil analisa sidik ragam didapatkan bahwa inter aksi suhu pengeringan dan waktu penyimpanan berpengaruh nyata terhadap ...
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