Judul: Imobilisasi Bacillus subtilis dengan Karaginan pada Anoda Microbial Fuel Cell Menggunakan Limbah Pemindangan Ikan
Abstrak: Limbah cair perikanan merupakan jenis limbah yang dapat menimbulkan pencemaran lingkungan. Pengolahan limbah cair perikanan dapat dilakukan melalui microbial fuel cell (MFC) untuk menghasilkan energi listrik dengan memanfaatkan mikroorganisme. Bacillus subtilis termasuk bakteri yang dapat menguraikan bahan organik dan mentransfer elektron untuk menghasilkan listrik. Penelitian ini bertujuan menentukan konsentrasi karaginan (0%, 1%, 1.5%, dan 2%) di anoda terhadap energi listrik dan beban polutan limbah cair ikan pindang setelah lima hari proses MFC. Biofilm bakteri yang terbentuk pada anoda setelah proses MFC mengalami peningkatan dan tertinggi pada konsentrasi karaginan 2% sebesar 6.3x10 cfu/cm2. Nilai tegangan listrik yang dihasilkan mengalami fluktuasi dan tertinggi sebesar 0.39±0.05aV pada karaginan 1%. Nilai chemichal oxygen demand (COD) dan biochemichal oxygen demand (BOD) limbah cair ikan pindang setelah MFC megalami penurunan sebesar 81.41% dan 60.02% pada karaginan 1.5%. Nilai pH pada limbah setelah proses MFC berkisar 7.11-7.33. Nilai total amonia nitrogen (TAN) mengalami peningkatan pada semua perlakuan dan tertinggi pada karaginan 0% sebesar 0.689±0.1 mg/L.
Keyword: energi listrik, limbah cair perikanan, microbial fuel cell

Judul: Imobilisasi Pediococcus acidilactici dan Staphylococcus warneri pada Elektroda Microbial Fuel Cell Limbah Pemindangan Ikan
Abstrak: Bahan organik berlebih pada limbah cair industri perikanan dapat dimanfaatkan menjadi sumber karbon bagi bakteri yang terdapat pada sistem microbial fuel cell (MFC). Pediococcus acidilactici (A1G) dan Staphylococcus warneri (A3T2) merupakan bakteri yang dapat ditemukan pada elektroda MFC. Penelitian ini bertujuan menentukan kinerja MFC yang lebih baik dalam menghasilkan elektrisitas antara penempelan bakteri pada katoda dan anoda serta menentukan perubahan beban polutan limbah cair pemindangan ikan. Penelitian ini dilakukan dalam lima tahap, yaitu kultivasi isolat bakteri, persiapan imobilisasi bakteri pada anoda dan katoda, persiapan desain alat MFC satu bejana, aklimatisasi lumpur aktif, dan proses transformasi MFC. Penempelan bakteri A1G pada anoda menghasilkan nilai elektrisitas MFC yang lebih tinggi dibandingkan dengan penempelan bakteri A3T2 pada katoda. Beban polutan setelah proses MFC mengalami penurunan pada parameter COD, BOD, dan TAN sebesar 50,65%, 35,07%, dan 60,08%. Nilai pH setelah proses MFC berkisar 6,03-6,33., The excessive organic components inside the fisheries wastewater could be utilized as a source of carbon for bacteria found in the microbial fuel cell (MFC) system. Pediococcus acidilactici (A1G) and Staphylococcus warneri (A3T2) are bacteria that could be found in the MFC electrode. The aim of this research was to decide which MFC functioned better in producing electricity between bacterial attachments on the cathode and the anode, as well as for deciding the pollutant load alteration of boiled fish processing wastewater. This research was carried out in five stages, bacterial isolate cultivation, preparation of bacterial immobilization at the anode and cathode, design preparation of single chamber MFC, acclimatization of activated sludge, and the MFC transformation process. The attachment of the AIG bacteria on the anode produced a higher MFC electrical value compared to the A3T2 bacterial attachment on the cathode. The pollutant load after the MFC process, based on the parameter of COD, BOD, and TAN decreased to 50,65%, 35,07%, and 60,08%. pH value after the MFC process was in the 6,03-6,33 range.
Keyword: elektrisitas, limbah cair, microbial fuel cell, penempelan bakteri

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