Judul: Keracunan Merkuri (Hg) pada Unggas
Abstrak: Tujuan penulisan ini adalah mengumpulkan pengetahuan tentang keracunan Merkuri ( Hg ) pada unggas, yang kebanyakan disebabkan oleh karena pencemaran yang terjadi pada lingkungan. Bahan penulisan ini diperoleh dari kepustakaan yang tersedia. Topik pembicaraan mencakup sejarah keracunan merkuri ( Hg ); etiologi yang mencakup ·sumber merkuri sebagai penyebab keracunan, merkuri di dalam tubuh, toksisitas merkuri; pathogenesa; gejala klinis, pathologi.klinis, pasca mati keracunan merkuri pad a unggas; penanggulangan keracunan merkuri pada unggas; diagnosa dan diagnosa banding terhadap keracunan merkuri.
Keyword: 

Judul: Pencemaran Merkuri di Sungai Cisuren Hilir Taman Nasional Gunung Halimun Salak, Jawa Barat
Abstrak: Taman Nasional Gunung Halimun Salak (TNGHS) memiliki manfaat utama sebagai sumber air. Kondisi perairan di TNGHS memiliki potensi yang tinggi untuk tercemar limbah pertambangan seperti merkuri karena jumlah Penambangan Emas Tanpa Izin (PETI) yang banyak dilakukan dan sudah berangsur lama. Pemanfaatan air sungai sebagai pengairan sawah serta menjadi habitat tempat satwa hidup akan terkena dampak apabila sungai tercemar merkuri. Merkuri sangat berbahaya apabila terpapar manusia yang akan menyebabkan kerusakan fungsi otak, gangguan ezim, bahkan kematian. Oleh karena itu diperlukan penelitian terkait pencemaran merkuri di Sungai Cisuren TNGHS. Penelitian dilakukan pada bulan Juli sampai Agustus 2019. Metode yang digunakan untuk pengambilan sampel ialah purposive sampling sedangkan uji kandungan merkuri menggungakan Atomic Absorption Spectroscopy (AAS), sampel diambil pada 3 stasiun yang masing-masing berjarak 100 meter. Hasil penelitian mendapatkan bahwa air, sedimen sawah, sedimen sungai, dan biota air yang berupa susuh kura (Sulcospira testudinaria), udang kali (Macrobrachium lanchesteri), dan katak tegalan (Fejervarya limnocharis) telah tercemar merkuri. Hasil menunjukkan merkuri pada air berkisar antara 1.4 – 1.7 μg/L, di biota air sebesar 39.33 – 309.96 μg/kg, serta kandungan merkuri tertinggi terdapat pada sedimen yang berkisar 330 – 590 μg/kg dan telah melebihi baku mutu yang ditetapkan yaitu sebesar 130 μg/kg untuk sedimen sungai dan 1 μg/kg untuk sedimen sawah. Pencemaran air sungai terjadi karena pembuangan limbah langsung dari pengolahan, sedangkan sedimen tercemar disebabkan pengendapan dan proses adsorpsi pada merkuri, serta biota air tercemar diakibatkan oleh proses makan, bernafas, dan paparan pada kulit.
Keyword: merkuri, pencemaran, PETI, TNGHS

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