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: Pengaruh kontaminasi Pb dan Cd dari limbah industri tekstik terhadap LC50 ikan mas dan ikan lele
Abstrak: Logam berat adalah salah satu bahan pencemar yang dapat membahayakan lingkungan karena umumnya pada kadar rendah sudah beracun bagi tumbuhan, hewan dan manusia. Logam berat yang sering dilaporkan membawa keracunan ialah Pb, Hg, Cd, Cr, dan V. Pb bersifat racun terhadap manusia karena mempengaruhi metabolisme Ca dan menghalangi beberapa sistem enzim. Keberadaan Cd di dalam tubuh manusia sama sekali tidak dibutuhkan karena bisa menurunkan kadar besi dalam darah dan kekurangan Ca di tulang. Kadar Pb dan Cd limbah industri tekstil ditentukan dengan spektrofotokopi absorpsi atom dengan penambahan HNO3 pekat. Nilai LC50 ditentukan melalui pengamatan selama 96 jam terhadap ikan mas dan ikan lele dengan menggunakan analisis probit. Nilai LC50 limbah cair industri tekstil jam ke-36 dari ikan mas 71% (v/v), jam ke-72 ikan lele 76% (v/v). Waktu yang paling efektif terhadap mortalitas ikan mas dan ikan lele ialah jam ke-36 dan ke-72, karena pada jam tersebut tingkat kematian ikan paling tinggi. Jenis ikan mempengaruhi mortalitasnya. Kadar logam berat Pb dan Cd limbah cair industri tekstil mempengaruhi ekosistem akuatik dan lingkungan sekitarnya.
Keyword: 

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