Judul: Toksisitas Niklosamida Terhadap Pertumbuhan, Kondisi  Hematologi dan Histopatologi Juvenil Ikan Mas (Cyprinus  carpio)
Abstrak: Penggunaan pestisida dalam bidang pertanian (sawah) yang semakin meningkat telah menimbulkan dampak negatif bagi menurunnya kualitas lingkungan perairan, karena pada umumnya sebagai tempat pembuangan limbah cair pertanian yang masih mengandung residu pestisida. Akibat kegiatan tersebut maka lingkungan perairan tawar yang merupakan sumber air untuk kegiatan budidaya perikanan berpotensi tercemar oleh berbagai bahan aktif yang terkandung dalam formulasi pestisida.
Keyword: 

Judul: Toksisitas akut dan respon tingkah laku juvenil ikan mas Cyprinus carpio terhadap moluskisida niklosamida
Abstrak: Directorate of Food Crop Protection noted that in 2007 approximately 22 110 ha of rice field pests of mulberry snails (Pomacea canaliculata) and to regions of West Java, there are 6829 hectares affected. Molluscicides containing the active ingredient of niclosamide is a pesticide used by farmers to eradicate the snail. Previously, the active ingredient in the year 1953 is used to eradicate fish lamprey (Petromyzon marinus), which is a parasite for commercial fish in the Great Lake (United States). While in use, that molluscicides have the potential for environmental damage in the surrounding waters used for aquaculture activities is one example is the cultivation of common carp (Cyprinus carpio) and toxicity studies of niclosamide in Indonesian has not yet been done. Therefore, research must be done to determine the acute toxicity of niklosamida on carp and carp find out the response time in direct contact with that poison. Result from this research, the acute toxicity from niclosamide toward juvenile carp (Cyprinus carpio) including at the level A which the power of toxicity is very high because value LC50-96 hour are smaller than 1 mg/L, that is 0.08 mg/L. Initial response of juvenile common carp when exposed the poison of niclosamide are occurrence of fish mucus secretion in the two hour at all concentrations (0.14, 0.28, 0.39, 0.54, dan 0.75 mg/L). Fish solitude which sometimes lean on the corner of the aquarium's going on hour four in the concentration of 0.39 mg/L but at a higher concentration of 0.54 mg/L and 0.75 mg/L fish swam out of balance or weak and go down to the bottom of the aquarium, sometimes with inverted body. Fish prefer to swim on the surface to breathe air that occurred on the twenty-four hour at the concentration of 0.54 mg / L. While the respon of sequel are fish swam out of balance or weak and go down to the bottom of the aquarium which sometimes happens with the body upside down in the thirty-six hours at concentrations of 0.2 mg/L, 0.54 mg/L and 0.75 mg/L. Change of the skin color becomes pale happens on the sixty hours at concentration 0.39 mg/L, 0.54 mg/L, and 0.75 mg/L.
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