Judul: Biosensor H2O2 Berbasis Katalase Neurospora crassa InaCC F226 Teramobilisasi Glutaraldehid pada Komposit Karbon-Nanoserat Polianilin.
Abstrak: Hidrogen peroksida merupakan senyawa yang banyak dimanfaatkan di berbagai bidang, salah satunya pangan sebagai bahan pengawet pada susu. Konsentrasi H2O2 yang tinggi dapat menurunkan kualitas susu dan dapat menyebabkan gangguan pencernaan. Penelitian ini bertujuan menentukan karakteristik biosensor hidrogen peroksida berbasis katalase teramobilisasi glutaraldehid pada komposit karbon-nanoserat polianilin sehingga dapat mendeteksi keberadaan hidrogen peroksida pada konsentrasi tertentu. Nanoserat polianilin digunakan untuk memodifikasi elektroda agar memiliki konduktivitas yang lebih baik. Nanoserat polianilin memiliki diameter dan panjang rata-rata 120.8 dan 318.6 nm. Kinerja elektroda pasta karbon termodifikasi (EPKT) lebih baik daripada elektroda pasta karbon (EPK). Kinerja elektroda berbasis katalase (106.49 U/mg) (KAT-EPKT) memiliki kinerja optimum pada pH 6. Parameter kinetika enzim pada kondisi pH optimum diperoleh nilai Km, Imaks, dan sensitivitas masing-masing sebesar 0.75 mM, 0.35 mA, dan 0.63 mA/mMcm2.
Keyword: biosensor, elektroda pasta karbon, hidrogen peroksida, katalase, nanoserat polianilin

Judul: Glukosa oksidase teramobil glutaraldehida pada elektroda pasta karbon termodifikasi nanoserat polianilin sebagai biosensor glukosa
Abstrak: Enzim glukosa oksidase (god) sedang banyak dikembangkan dalam aplikasi sensor glukosa salah satunya untuk mengukur kadar glukosa darah, karena sifatnya yang spesifik terhadap oksidasi glukosa. Penelitian ini bertujuan untuk menentukan kondisi optimum dan parameter kinetika aktivitas enzim glukosa oksidase secara voltametri sebagai biosensor glukosa. Enzim god diamobilisasi dengan glutaraldehida secara cross linking pada elektroda pasta karbon termodifikasi polianilin. Polianilin disintesis dengan metode polimerisasi interfasial, menghasilkan morfologi berupa nanoserat berukuran 100-120 nm, dan memiliki konduktivitas yang baik. Kinerja elektroda pasta karbon termodifikasi (epkt) polianilin lebih baik dibandingkan elektroda pasta karbon (epk). Pengaruh ph dan suhu pada kinerja elektroda god/epkt dianalisis secara voltametri, yang menunjukkan kinerja optimum god pada ph 4.5 bufer asetat konsentrasi 0.1 m dan pada suhu 650c. Parameter kinetika enzim diukur pada kondisi ph optimum, diperoleh nilai km dan imaks masing-masing sebesar 0.70 mm dan 4.24 ma dengan sensitivitas sebesar 1.81 mamm-1.
Keyword: glukosa oksidase, polianilin, glutaraldehida, elektroda karbon pasta, biosensor

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