Judul: Karakteristik Polycyclic Aromatic Hydrocarbons (PAHs) di Air dan Sedimen Serta Akumulasinya pada Tubuh Ikan Nomei (Horpodon nehereus) Di Kota Tarakan
Abstrak: Karakteristik Polycyclic Aromatic Hydrocarbons (PAHs) di Air dan Sedimen Serta Akumulasinya pada Tubuh Ikan Nomei (Horpodon nehereus) Di Kota Tarakan
Keyword: 

Judul: Bioaccumulation of Polycyclic Aromatic Hydrocarbons (PAHs) and Their Effects on Fish Resources in the Coastal Waters of Tarakan, Kalimantan Utara Province.
Abstrak: PAH merupakan agen mutagenik dan karsinogenik yang mempengaruhi perairan pesisir Kota Tarakan. Tujuan dari penelitian ini adalah menganalisis jenis, konsentrasi dan sumber PAH di perairan dan sedimen, mengevaluasi dan menganalisis risiko ekologi yang diharapkan dari PAH dan pengaruhnya terhadap ikan bandeng (Chanos chanos) dan kerang Kappah (Meritrix sp) di perairan pesisir. Kota Kappah Tarakan Kalimantan Utara. Empat belas sampel air dan sedimen dari stasiun terpilih diperoleh 14 jenis PAH prioritas (USEPA). Konsentrasi PAH di air di lokasi sungai yang berbeda berkisar antara 0,61-62,40, di laut 0,02-43,75, dan tambak payau 0,08-31,77 μg L-1. Konsentrasi sedimen di lokasi sungai berkisar antara 0,72-352,84, antara 1,23-606,74 di laut, dan tambak payau 0,08-2858,88 ng g-1. Konsentrasi di lingkungan pesisir Tarakan menandakan adanya potensi bahaya bagi lingkungan. Selain itu, dua, empat dan lima cincin PAH terlihat mendominasi di air dan sedimen, dengan cincin utama ada di sungai dan kolam payau. PAH adalah sumber petrogenik dan pirolitik yang mungkin berasal dari sungai Pamusian. Konsentrasi dalam tubuh ikan bandeng berkisar antara 0.05-9.91 ng g-1 dan kappah clam 0.04-14.14 ng g-1. Siklik 2-4 mendominasi paparan tubuh biota, tingkat konsentrasi berada pada nilai kontaminasi sedang. Tes histologi menggambarkan disorganisasi dan fusi lamellae, edema dan nekrosis, tubulus regresi dan jaringan daging yang tidak teratur. Perlu ada tindakan korektif dan kontrol untuk mengurangi beban polusi PAH. Langkah-langkah perbaikan yang diusulkan adalah langkah-langkah perbaikan yang diusulkan adalah pengurangan input polutan dari daratan, penyediaan bak air dan kolam pengeringan yang efektif serta penyediaan ruang / kolam khusus pembesaran kerang kappah., PAHs are mutagenic and carcinogenic agents that influence the coastal water of Tarakan City. The purpose of this study is to analyze the type, concentration and source of PAHs in the water and sediment, evaluating and analyzing expected ecological risk of PAHs and their effects on milkfish (Chanos chanos) and Kappah shells (Meritrix sp) in the coastal waters Kappah Tarakan City North Borneo. Fourteen samples of water and sediment from selected stations obtained 14 types of PAHs priority (USEPA). The concentration of PAHs in the water at distinct river locations ranged from 0.61-62.40, at sea 0.02-43.75, and brackish ponds 0.08-31.77 μg L-1 respectively. The concentration in sediments at river locations ranges from 0.72-352.84, between 1.23-606.74 in the sea, and brackish ponds 0.08-2858.88 ng g-1. The concentration in the Tarakan coastal environment signifies the potential hazards to the environment. Furthermore, two, four and five rings of PAHs were shown to dominate in water and sediment, with the major rings present in both river and brackish pond. The PAHs were both petrogenic and pyrolytic sources that were possibly derived from the Pamusian river. Concentration in the body of milkfish ranges from 0.05-9.91 ng g-1 and kappah clam 0.04-14.14 ng g-1. Cyclic 2-4 dominates exposure to biota bodies, concentration level being at moderate contamination values. Histology tests describe disorganization and fusion of lamellae, edema and necrosis, regressing tubules and an irregular meshwork of meat. There needs to be corrective measures and controls to reduce the pollution load of PAHs. The proposed improvement measures are proposed corrective measures is the reduction of pollutant input from the mainland, the provision of
Keyword: PAHs, Waters, sediment, Milkfish, Kappah Shells

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