Judul: Pembuatan Cider Timun Suri (Cucumis meli L.)
Abstrak: Penelitian ini bertujuan untuk mempelajari cara pengolahan produk fermentasi yaitu pembuatan cider, serta pengaruh penambahan jenis dan konsentrasi starter, serta dan lama aging terhadap mutu cider yang dihasilkan. Kadar alkohol cider bervariasi tergantung pada jenis dan konsentrasi starter. Kadar alkohol tertinggi dipero- leh dengan penggunaan starter dari ragi roti dengan konsentrasi starter 10 persen. Lama aging berpengaruh terhadap pembentukan ester cider. Cider yang disukai adalah cider dengan kadar alkohol rendah. Total asam dan kadar vitamin C akan menurun selama aging berlangsung, sedangkan Kadar alkohol, gula pere- duksi, total padatan terlarut, akan meningkat pada awal aging, dan relatif konstan setelah hari ke-15. Kadar ester dan pH relatif meningkat selama aging, sedangkan kejernihan relatif konstan selama aging….
Keyword: 

Judul: Pemanfaatan pulp kopi untuk pembuatan minimum "Cider"
Abstrak: Cider pulp kopi adalah minuman hasil fermentasi sari pulp kopi yang mempunyai rasa manis keasam-asaman dan mengan- dung sedikit alkohol. Bahan baku yang digunakan adalah pulp kopi, gula pasir dan khamir Saccharomyces cereviceae. Penelitian ini bertujuan untuk mempelajari cara pembu- atan cider pulp kopi dan menentukan kondisi proses yang baik, sehingga diperoleh produk minuman baru yang disukai. Pembuatan cider pulp kopi dilakukan melalui beberapa tahap, yaitu perebusan, pemerasan, penyaringan, pencampuran, sterilisasi, inokulasi, fermentasi, pasteurisasi dan klari- fikasi. Ada tiga tahap penelitian yang dilakukan. Hasil pe- nelitian dua tahap pertama, kondisi yang baik dalam pembuat- an cider pulp kopi adalah konsentrasi sari pulp kopi 3 persen, penambahan nutrien yaitu ammonium sulfat sebanyak 0.33 gram per liter. dan diinokulasi dengan Saccharomyces cerevi- ceae. Pada penelitian tahap ketiga dilakukan 3 perlakuan yaitu konsentrasi gula yang ditambahkan mempunyai 3 taraf yaitu 15, 20 dan 25 persen. Suhu inkubasi mempunyai 2 taraf yaitu 25-28°C dan 30-33°C. Lama fermentasi adalah 3, 4 dan 5 hari. Parameter yang diamati antara lain kadar alkohol, kadar gula pereduksi, total asam dan uji organoleptik. Ran- cangan percobaan yang digunakan adalah Rancangan Acak Leng- kap dengan percobaan faktorial dua kali ulangan. Analisis cider pulp kopi menghasilkan kadar alkohol 4.144-9.9122 persen yang diperoleh dari perlakuan konsentra- si gula 15%, suhu inkubasi 30-33°C dan lama fermentasi 3 hari serta dari perlakuan konsentrasi gula 25%, suhu inkubasi 25- 28°C dan lama fermentasi 3 hari. Kadar gula pereduksi 1.435- 6.248 persen yang diperoleh dari perlakuan konsentrasi gula 15%, suhu inkubasi 25-28°C dan lama fermentasi 4 hari serta dari perlakuan konsentrasi gula 25%, suhu inkubasi 30-33°C dan lama fermentasi 3 hari…dst
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