Judul: Kerentanan kutu ayam Menopon gallinae (Linn) (Mallophaga: Menoponidae) di Bogor dan sekitarnya terhadap beberapa jenis pestisida fosfor-organik dan karbamat bentuk serbuk
Abstrak: Tujuan penelitian ini adalah untuk mengetahui status kerentanan beberapa populasi kutu M. gallinae terhadap coumaphos, carbaryl, trichlorfon, diazinon dan malathion, khususnya untuk mengetahui konsentrasi letal 50 % (KL50), di daerah Bogor dan sekitarnya. Kutu dewasa diambil secara manual dari tubuh ayam-ayam di peternakan-peternakan ayam Sindangbarang, Maseng, Cimanglid, Waru dan Ciapus. Disediakan dua ekor ayam petelur ras coklat untuk memelihara setiap isolat kutu. Ayam-ayam dipelihara terpisah satu dari yang lain agar masing-masing isolat tidak tercampur. Pengujian dilakukan terhadap kutu dewasa yang dikumpulkan dalam gelas-gelas/cawan, menggunakan pestisda i (R) coumaphos (Asuntol 50 WP, carbaryl (Sevin (R) 85 S), diazinon (Neocidol(R) 40 WP), trichlorfon (Neguvon (R)) dan malathion (Malathion (R) 40 WP). Pengujian dilakukan dengan cara menempatkan kutu dewasa ke dalam gelas berisi konsentrasi tertentu masing-masing pestisida, kemudian selama tiga menit gelas digoyang-goyangkan supaya setiap kutu terkena serbuk insektisida dengan cukup. Setelah tiga menit isi gelas dituangkan ke baki dan kutu dibersihkan dari pestisida. Pengamatan dilakukan untuk menghitung respon kutu terhadap pestisida. ...
Keyword: Pesticide resistance, Menopon gallinae

Judul: Efektivitas Sipermetrin terhadap Kutu Menopon galiinae dengan Metode Penyemprotan pada Ayam Petelur
Abstrak: The presence of ectoparasites is one of the obstacles faced by the layer poultry farm. Losses caused by ectoparasites infestation were large enough, such as the decreasing of egg production. Control measures were mostly done by using insecticides. This study aimed to determine the effectiveness of cypermethrin in controlling Menopon gallinae lice infestations by spraying method in laying hens. A total of 51 lice infested laying hens obtained from commercial farms in Ciseeng, Bogor were grouped into fives. Four groups were treated by the cypermethrin, and the rest of the group as a control treated by water. Each group consisted of three chickens, and treated by cypermethrin spraying with four replications. The concentration of cypermethrin for each groups were 0.5 g/L, 0.375 g/L, 0.25 g/L, and 0.125 g/L. Lice were identified and calculated by using the counter. Lice observations were done three times i.e before treatment, 24, and 5 48 hours after cypermethrin treatments. The result showed that the lice found only one species M. gallinae with the largest distribution in the breast region (89.93%). The effect of cypermethrin treatment in different concentration levels showed that the reduction of lice infestations were not significantly differents (p>0.05). The concentration of cypermethrin 0.125-0.5 g/L was effectively to control lice in laying hens by spraying method (reduction values 66.35-100% at 24 hours after treatment).
Keyword: cypermethrin, ectoparasites, insecticide, laying hens, lice, M. gallinae

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