Judul: Bakteria yang diisolasi dari benih udang windu (Penaeus monodon Fab.) di PT Udang Asri Kencana, Karawang, Jawa Barat
Abstrak: Penelitian ini bertujuan untuk mengetahui keberadaan serta jenis-jenis bakteri yang terdapat pada benih udang windu (P. monodon Fab.) stadia NPL16, pada musim kema- rau dan musim hujan, yang berlangsung dari bulan September 1989 - Januari 1990. Tahap pelaksanaan penelitian ini, yaitu pengambilan contoh udang periode I pada bulan Sep- tember 1989 - Oktober 1989 (musim kemarau), yang di- lanjutkan dengan pengambilan contoh udang periode II pada musim hujan dari bulan Nopember 1989 Desember 1989 di PT UDANG ASRI KENCANA, sedangkan isolasi dan identifikasi bakteri dilakukan di Laboratorium Kesehatan Ikan. Pe- ngerjaan identifikasi bakteri berakhir pada bulan Januari 1990...
Keyword: 

Judul: Bakteria Pada Benih Udang Windu (Penaeus monodon Fab.) Dari Pt Humpuss, Labuan, Jawa Barat
Abstrak: Penelitian ini bertujuan untuk mengetahui jenis-jenis bakteri yang terdapat pada benih udang windu, keberadaanya pada tiap-tiap stadia dan keberadaan bakteri tersebut menurut musim. Penelitian ini dilaksanakan dari awal bulan September 1989 sampai awal Pebruari 1990. Adapun tempat penelitian meliputi Panti Benur Windu PT HUMPUSS di Labuan Jawa Barat dan Laboratorium Parasit Ikan, Jurusan Budidaya Perairan, Fakultas Perikanan IPB. Pengambilan udang conto dilakukan pada dua siklus produksi benih udang windu, yaitu satu siklus produksi pada musim kemarau dan satu siklus produksi pada musim penghujan. Pengambilan pada siklus produksi di musim kemarau dilakukan pada bulan September sampai bulan Oktober 1989, sedangkan pada siklus produksi di musim penghujan berlangsung pada bulan Nopember sampai bulan Desember 1989. Pengambilan udang yang akan disolasi dilakukan pada stadium nauplii 3, zoea 2, mysis 2, PL 1, PL 6, PL 12 dan PL 16. Kualitas air yang diukur meliputi suhu, salinitas, pH, 02, NH4-N dan NO2. Data yang diperoleh dari hasil penelitian meliputi jenis-jenis bakteri dan jumlah isolat bakteri pada tiap- tiap stadia dan musim yang berbeda, yang diolah secara deskriptif. Pada pengamatan selama musim kemarau didapatkan 25 jenis bakteri yaitu Aeromonas hydrophyla, Acinetobacter anitratum, A. delmarvae, A. butyri, A. eurydice, A. iwoffi, A. marshalli, A. stationis, Alcaligenes faecalis, Chromobacterium Flavobacterium Plesiomonas P. P. violaceum, Escherichia coli, aquatile, F. breve, Gaffkya sp., shigelloides, Pseudomonas denitrifikans, iodinum, P. maltophila, P. piscicida, P, stutzeri, synxontha, RM bacterium, Staphylococcus aureus, S. epidermidis dan Vibrio alginolyticus...dst
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