Judul: Studi Literatur Biosensor Fenol dengan Biofilm Pseudomonas fluorescens Termodifikasi pada Permukaan Screen Printed Carbon Electrode.
Abstrak: Sampel air limbah mengandung senyawa organik aromatik seperti fenol. Fenol merupakan zat polutan prioritas dan berbahaya. Metode deteksi fenol secara konvensional menggunakan alat deteksi seperti kromatografi dan spektrofotometri tidak efektif. Alternatif deteksi fenol yakni menggunakan biosensor fenol dengan metode voltametri siklik. Studi literatur ini bertujuan mengkaji mekanisme tirosinase yang tepat, mengkaji optimasi pengukuran biosensor senyawa fenol dengan biofilm P. fluorescens, mengkaji modifikasi elektrode kerja dengan penambahan supporting material, dan mengkaji hasil kinerja analitik biosensor fenol. Pembentukan biofilm P.fluorescens di permukaan SPCE akan mempermudah imobilisasi enzim tirosinase. Keberhasilan imobilisasi ditandai dengan munculnya arus reduksi dan oksidasi. Penambahan magnetit-PEG akan meningkatkan deteksi biosensor fenol sehingga menghasilkan linearitas sebesar 0,9925 dan 0,9989., Wastewater samples contain aromatic organic compounds such as phenol. Phenols are the priority and harmful pollutant substances. Conventional phenol detection methods using detection tools such as chromatography and spectrophotometry are ineffective. An alternative to phenol detection is to use phenol biosensors with the cyclic voltammetry method. This literature study aims to examine the proper mechanism of tyrosinase, review the optimization of biosensor measurements of phenol compounds with biofilm P. fluorescens, review the modification of working electrodes with the addition of supporting materials, and review the analytical performance results of phenol biosensors. The formation of P.fluorescens biofilms on the surface of the SPCE will facilitate the immobilization of the enzyme tyrosinase. The success of immobilization is characterized by the emergence of reduction and oxidation currents. The addition of magnetite-PEG will improve the detection of phenol biosensors resulting in the linearity of 0,9925 and 0,9989.
Keyword: biofilm, biosensor, phenol, Pseudomonas fluorescens, tyrosinase

Judul: Biosensor Elektrokimia Berbasis Biofilm Bacillus licheniformis untuk Mendeteksi Senyawa Fenol
Abstrak: Fenol merupakan salah satu limbah berbahaya yang banyak dihasilkan dari berbagai aktivitas industri seperti industri tekstil, minyak bumi, farmasi, pestisida, dan plastik. Standar ambang batas fenol pada air minum adalah 0.002 ppm dan pada lingkungan perairan adalah 0.5-1 ppm. Metode alternatif yang dapat digunakan untuk mendeteksi fenol adalah menggunakan metode biosensor. Biosensor merupakan perangkat analisis yang mengintegrasikan biokomponen dengan transduser yang dapat mengubah sinyal hayati menjadi sinyal yang terukur. Penelitian ini bertujuan untuk membuat biosensor elektrokimia berbasis biofilm dari Bacillus licheniformis dengan menggunakan screen printed carbon electrode (SPCE) dan melakukan validasi kinerja biosensor tersebut. Hasil penelitian menunjukkan bahwa nilai koefisien determinasi yang diperoleh pada penelitian ini adalah 0.7287, sensitivitas 0.0089 mA ppm-1, dan presisi sebesar 1.2607 %SBR. Biosensor fenol berbasis biofilm Bacillus licheniformis memiliki presisi yang baik ditandai dengan nilai simpangan baku relatif yang rendah.
Keyword: Bacillus licheniformis, biofilm, biosensor, fenol, SPCE

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