Judul: Pengaruh jenis kemasan terhadap mutu tempe kedelai (Glycine max) berbumbu selama penyimpanan
Abstrak: Tempe merupakan salah satu jenis makanan khas Indonesia yang sangat popular dan banyak dikonsumsi oleh masyarakat Lndonesia. Akan tetapi popularitas rnakanan tradisional di Indonesia dirasakan semakin menurun jika dibandingkan dengan berbagai jenis pangan impor. Citra rendahan, yang mefekat pada tempe, mungkin berpengaruh besar terhadap popularitasnya.
Keyword: 

Judul: Kajian pengaruh pemberian bumbu dan kemasan terhadap daya simpan dan daya tarik produk tempe
Abstrak: Tujuan penelitian ini adalah untuk mempelajari teknik pengolahan dan modi- fikasi pengemasan dalam rangka meningkatkan daya simpan dan daya tarik (peneri- maan konsumen) produk tempe. Namun penelitian yang dilakukan merupakan lang- kah awal yang perlu ditindaklanjuti dengan berbagai penelitian lainnya. Sasaran penelitian adalah untuk memperpanjang umur simpan tempe dan meningkatkan citra tempe sebagai bagian dari gerakan nasional Aku Cinta Makanan Indonesia (ACMI). Tempe berbumbu sebagai hasil diversifikasi produk tempe diusahakan menjadi tempe yang tahan lama dan menarik minat konsumen. Terdapat tiga tahap pelaksanaan penelitian, yaitu uji coba pembuatan tempe berbumbu, uji karakteristik bahan pengemas (film plastik) dan pembuatan kemasan, serta uji mutu produk berikut uji penerimaan konsumen. Tempe berbumbu yang dihasilkan terdiri dari empat macam produk, yaitu (1) AIB1, tempe berbumbu merah dengan film plastik Ni/PE, (2) A1B2, tempe berbumbu merah dengan film plastik PFX, (3) A2B1, tempe berbumbu kari dengan film plastik Ni/PE, (4) A2B2, tempe berbumbu kari dengan film plastik PFX. Secara umum kömposisi kimia tempe berbumbu mengalami peningkatan jika di- bandingkan dengan bahan baku sekalipun tidak bersifat ekstrim, kecuali kadar air untuk produk berbumbu kari dan kadar lemak untuk produk berbumbu merah. Lama penyimpanan tempe berbumbu berlangsung selama 4 minggu dalam suhu dingin dan tetap layak untuk dimakan sampai dengan minggu ke-3...
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