Judul: Ciri limbah industri minuman dan toksisitasnya terhadap ikan mas
Abstrak: Risiko yang diakibatkan oleh pencemaran perairan pada manusia sampai saat ini cukup memprihatinkan. Penelitian ini bertujuan menentukan efek toksisitas limbah minuman pada ikan mas (Cyprinus carprio) dan menentukan efektivitas pengolahan limbah cair industri. Metode yang digunakan dalam penelitian ini adalah metode eksperimen, yaitu melakukan uji definitif dengan ragam konsentrasi air limbah 0, 10, 20, 30, 40, dan 50% (v/v) dengan tiga kali ulangan. Hasil penelitian menunjukkan konsentrasi letal 50 (LC50) sebesar 39.97% untuk area influen. Sementara area efluen memiliki LC50 sebesar 49.53%. Pertumbuhan ikan mas dipengaruhi oleh besarnya konsentrasi air limbah yang diberikan. Hal ini terlihat dari tingkat mortalitasnya. Nilai analisis kekeruhan, bahan organik total, dan amonia bebas pada area influen berada di atas baku mutu kriteria air bersih menurut Menteri Kesehatan. Sementara efluen yang telah mengalami proses pengolahan limbah memenuhi kriteria baku mutu kriteria air bersih sesuai dengan parameter fisika dan kimia air.
Keyword: Cyprinus carpio, Biochemical oxygen demand, Diverfoam acid

Judul: Abnormalitas Ikan Mas Cyprinus carpio pada Air Hasil Treatment Fitoremediasi Akibat Cemaran Limbah Minyak Jelantah
Abstrak: Ikan Mas (Cyprinus carpio) memiliki fungsi sebagai agen bioassay untuk uji efektivitas penggunaan tanaman air dalam fitoremediasi limbah minyak di lingkungan budidaya. Tujuan penelitian ini adalah mengukur efektivitas tiga agen fitoremediator berbeda dan dampaknya terhadap benih ikan mas Cyprinus carpio dalam media air yang tercemar limbah minyak jelantah. Penelitian dilakukan pada media yang tercemar limbah minyak domestik dengan konsentrasi 10 mg L-1, dengan 3 perlakuan, yaitu Eg (eceng gondok), Ki (kiambang), dan Ka (kangkung air) dengan hewan uji benih ikan mas berumur 10 hari dengan panjang rata-rata 0.94±0.05 cm. Hasil penelitian menunjukkan bahwa perlakuan eceng gondok (Eg) memberikan hasil terbaik. Parameter uji abnormalitas sirip terbaik diperoleh pada perlakuan eceng gondok, dimana pada hari ke-21 tidak ditemukan abnormalitas kembali, didukung dengan nilai viskositas air mencapai 0.87±0.06 mPa.s, nilai daya hantar listrik sebesar 0.282±0.001 ms cm-1. Kinerja produksi yaitu nilai tingkat kelangsungan hidup mencapai 100% dan pertumbuhan panjang mutlak 0.57±0.05 cm.
Keyword: Abnormalitas, eceng gondok (Eichhornia crassipes), kangkung air (Ipomoea aquatica), kiambang (Salvinia natans), remediasi

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