Judul: Pengaruh nisbah metanol, suhu, dan waktu reaksi pada rendemen biodiesel dalam transesterifikasi in situ biji bintaro
Abstrak: Cerbera odollam, known as bintaro, is potentially use for raw material in production of biodiesel because it has oil content until 68% dry basis. The purpose of research is to determine the best condition in producing biodiesel that made from bintaro seed through in situ transesterification of bintaro seed. It uses factorial experimental design and it determines the quality of biodiesel that has produced. The parameters of research are methanol ratio influence of the material, time, and reaction temperature toward the biodiesel yield that has produced. The ratio factor and time reaction are dominantly influence toward biodiesel yield that has produced and toward test result variety. Those two factors are significantly influence the yield. Meanwhile the temperature factor doesn’t give significant influence toward the yield. The optimum conditions that has acquired are 7:1 methanol: materials, 4 hours of time reaction, and 40 oC temperature reaction. Also the highest yield is 36.97%. The quality of biodiesel that acquired indicates the qualified biodiesel that regulated by SNI 04-7182-2006.
Keyword: 

Judul: Pengaruh Waktu Reaksi dan Rasio Heksan/Total Pelarut Terhadap Rendemen dan Kualitas Biodiesel Pada Transesterifikasi in Situ Biji Jarak Pagar
Abstrak: Bahan bakar yang berasal dari minyak bumi merupakan sumber energi yang sangat dibutuhkan manusia dalam berbagai bidang. Eksploitasi minyak bumi menyebabkan krisis bahan bakar minyak (BBM) di dunia. Hal ini karena minyak bumi merupakan energi yang tidak terbarukan. Pada tahun 2004 Indonesia sudah menjadi negara pengimpor BBM. Hal ini disebabkan oleh berkurangnya produksi minyak bumi sedangkan permintaannya semakin meningkat. Dengan kondisi tersebut maka pemerintah mengeluarkan kebijakan untuk mengembangkan energi alternatif terbarukan. Salah satunya adalah biodiesel. Biji jarak pagar merupakan salah satu tanaman yang dapat menjadi bahan baku sumber energi alternatif terbarukan. Kandungan minyak biji jarak pagar cukup tinggi, yaitu sekitar 30-40%. Jarak pagar merupakan tanaman yang mudah dibudidayakan di Indonesia sehingga prospektif untuk dijadikan bahan baku biodiesel. Biodiesel merupakan salah satu jenis energi alternatif pengganti fosil. Biodiesel diproduksi melalui proses transesterifikasi dari tanaman penghasil minyak nabati. Akan tetapi, proses transesterifikasi yang ada selama ini memiliki tahapan proses yang panjang, membutuhkan waktu yang lama, dan membutuhkan biaya yang tinggi. Proses transesterifikasi in situ ini merupakan proses produksi biodiesel yang lebih sederhana dengan mengeleminasi proses ekstraksi dan pemurnian minyak sehingga prosesnya lebih singkat dan biaya yang dibutuhkan dapat diminimalisasi. Transesterifikasi in situ ini memanfaatkan trigliserida yang berasal dari bahan baku sumber minyak tanpa perlu mengekstrak dan memurnikannya terlebih dahulu. Penelitian ini bertujuan untuk mengetahui pengaruh waktu reaksi dan rasio heksan/total pelarut pada transesterifikasi in situ biji jarak pagar terhadap rendemen dan mutu biodiesel yang dihasilkan. Bahan yang digunakan adalah biji jarak pagar dengan kadar air < 2% dan ukuran 20 mesh. Kondisi operasi divariasikan pada rasio heksan/total pelarut sebesar 1/6, 2/6 dan 3/6, dan waktu reaksi selama 3, 4 dan 5 jam. Konsentrasi KOH, suhu reaksi dan kecepatan pengadukan ditetapkan pada 0.075 mol/L metanol, 55°C dan 300 rpm. Parameter mutu biodiesel yang dianalisis meliputi bilangan asam, viskositas, kadar abu dan bilangan penyabunan. Hasil penelitian dianalisis menggunakan Response Surface Method (RSM).
Keyword: Biodiesel, Jatropha, In Situ Transesterification, Reaction Time, Solvent ratio

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