Judul: Kondisi Kualitas Air di Tambak Udang Windu Tradisional yang Ditumbuhi Tumbuhan Air (Elecharis sp.) pada Musim yang Berbeda.
Abstrak: Penelitian ini bertujuan untuk mengetahui kondisi kualitas air di ,tambak tradisional yang ditumbuhi tumbuhan air (Eleocharis sp.) pada musim yang berbeda. Adapun parameter yang diukur yaitu suhu, kecerahan, pH, oksigen terlarut, salinitas, amonia (hanya diukur pada musim kemarau), nitrat, persentase penutupan tumbuhan air, dan kelimpahan plankton. Penelitian ini menggunakan data primer dan data sekunder. Data primer diperoleh dari pengamatan langsung yang dilakukan pada Bulan Juli 1999 - Oktober 1999 (musim kemarau), sedangkan data sekunder diperoleh dari Wetlands International-Indonesia Programme yang melakukan penelitian pada Bulan Desember 1998 - Februari 1999 (musim hujan). Lokasi penelitian adalah di tambak percobaan milik Wetlands International-Indonesia Programme yang terletak di Desa Karangsong, Kecamatan Indramayu, Kabupaten Indramayu, Jawa Barat. Pengambilan contoh dilakukan pada dua stasiun yaitu di inlet dan bagian tengah, sedangkan rentang waktu pengambilan contoh adalah dua minggu sekali.
Keyword: 

Judul: Kualitas air dalam pembenihan udang windu (Panaeus monodon Fab.) di PT. Humpuss, Labuan Jawa Barat
Abstrak: Penelitian ini dilakukakn mulai September 1989 sampai akhir Februari 1990, di Labuan, Kabupaten Pandeglang, Jawa Barat. Tujuannya untuk mengetahui kondisi kualitas air dalam usaha pembenihan udang windu (Penaeus monodon Fab.) mulai dari stadia nauplius sampai pasca larva-18, selama satu musim pemeliharaan pada masing-masing musim kemarau dan musim hujan. Wadah penelitian yang digunakan adalah bak penetasan yang terbuat dari fibre glass, bentuk silinder dengan volume 12.000 liter, bak larva yang terbuat dari beton, bentuk empat persegi dengan volume 40.000 liter dan bak pendeder- an yang terbuat dari beton, bentuk empat persegi dengan volume 125.000 liter. Setiap bak dilengkapi dengan perangkat aerasi. Kepadatan awal pemeliharaan (N-6) masing-masing 125 ekor/1 pada musim kemarau dan 80 ekor/1 pada musim hujan. Selama pemeliharaan dilakukan pergantian air 20-60 % setiap hari sesuai dengan stadia benih dan pemberian obat berupa antibiotika yaitu chlorampenicol 2 10 ppm dan oxytetracyclin 2 4 ppm setiap 3 hari sekali. ...
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