Judul: Distribusi Virus Avian Influenza (H5N1) Pada Jaringan Tubuh Itik Dengan Metode Imunohistokimia
Abstrak: Penelitian ini bertujuan untuk mengetahui distribusi virus H5N1 pada jaringan tubuh itik melalui deteksi antigen spesifik dengan menggunakan metode imunohistokimia dan mempelajari keterkaitan antara keberadaan virus AI dengan keamanan pangan daging itik sebagai ternak konsumsi. Menggunakan hewan percobaan 12 ekor jenis itik tegal yang diperoleh dari peternakan di Cirebon umur 4 bulan dan 6 bulan (telah berproduksi). Itik dikadangkan secara individual yang dibagi dalam empat kelompok perlakuan. Setiap perlakuan terdiri atas 3 ekor itik. Kelompok kontrol ditempatkan dalam ruang yang berbeda dengan kelompok perlakuan lainnya. Setelah melalui proses adaptasi, pada kelompok perlakuan I dilakukan pemberian vaksin inaktif dengan dosis 0,5 ml/ ekor pada hari ke 3. Selanjutnya pada hari ke 6 pada kelompok perlakuan I, II dan III semua itik ditantang dengan virus AI (H5N1)(FKH/IPB/Duck/NG29) dengan dosis 104 EID50 per ekor. Pada hari ke 11 semua itik telah menunjukkan gejala klinis berupa sinusitis, konjungtivitis dan diare berwarna putih. Selanjutnya dilakukan nekropsi dan pengambilan sampel organ trakea, paru-paru, jantung, hati, limpa, ginjal, pankreas, usus, otak, ovarium, isthmus otot dada dan otot paha. Dimasukkan dalam buffered Neutral Formalin (BNF) 10%. Tahap selanjutnya pembuatan blok parafin dan dilanjutkan dengan pembuatan preparat untuk pewarnaan Hemaktosilin dan Eosin/HE dan imunohistokimia. Hasil positif dinyatakan positif (+) apabila terdapat warna merah kecoklatan dan negatif jika warna tersebut tidak terdeteksi, data yang diperoleh dianalisis dengan menggunakan Kruskal Wallis.
Keyword: 

Judul: Kajian Persistensi dan Penularan Virus Avian Influenza di Peternakan Itik menggunakan Teknik Real Time RT-PCR
Abstrak: Highly pathogenic avian influenza (HPAI) H5N1 virus has been a major threat to poultry industry and human health in Indonesia over the past several years. The existence of backyard and free-range duck raising system has been hypothesized to play role in the disease circulation. This study investigated H5 virus infection and circulation occurring in three types of free-range duck farms in Indramayu District, West Java, Indonesia from September 2009 to March 2010. One hundred and eighty pairs of cloacal-oropharyngeal swab samples from sentinel ducks placed in six farms of the three farm types were collected every month for seven months period and screened in pools for influenza A virus. In addition to the sentinel ducks, 30 non-sentinel ducks were included at the first and the last sampling month. Of the total 648 pool samples collected for seven months, 91 pools (14%) were found influenza A positive at repeated events. The virus was more commonly found on type 1 farms followed by type 2 and 3 farms. The individual swab samples of influenza A positive pools were tested for H5 subtype. Of the total 91 pools of influenza A positive samples, 455 individual samples were tested for H5 subtype and 50 (11%) individual samples were found H5 positive. The H5 subtype was found at certain points of sampling time and was more commonly found in type 2 farms followed by type 1 and was not found on type 3 farms. The H5 virus was likely to be transmitted within duck farm but was unlikely to be maintained for a long time.
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