Judul: Tinjauan laboratorik salmonellosis pada ungas yang dipelihara di Taman burung Taman Mini Indonesia Indah
Abstrak: Keadaan stress dan adanya hewan "carrier" salmonellosis dapat menyebabkan kejadian wabah salmonellosis pada suatu tempat konservasi satwa bangsa burung. Salmonellosis merupakan penyakit yang dapat ditularkan melalui makanan dan minuman yang terkontaminasi oleh kuman Salmonella. Kontaminasi kuman Salmonella ini berasal dari tinja burung penderita salmonellosis. Selain itu salmonellosis juga dapat ditularkan secara vertical yaitu lewat telur induk yang tertular. Kelembaban yang tinggi menguntungkan untuk kehidupan kuman Salmonella, sehingga umumnya kasus salmonellosis meningkat pada waktu musim hujan. Dari 30 sampel burung yang diperiksa, diketemukan 3 kasus positif salmonellosis yaitu terjadi pada Ayam hutan (hewan mati), Bebek Bali coklat dan Cendrawasih (hewan hidup) serta dapat diisolasi agen penyebabnya. Dalam penelitian ini berhasil diisolasi 40 isolat bakteri, yang terdiri dari Pseudomonas sp. 9 isolat (22,5%), Enterobacter aerogenes 6 isolat (15%), Edwardsiella tarda 6 isolat (15%), Proteus morganii 4 isolat (10%), Proteus vulgaris 4 isolat (10%), Hafnia alvei 3 isolat (7,5%), Escherichia coli 2 isolat (5%), Salmonella pullorum (5%), Salmonella gallinarum 1 isolat (2,5%), Proteus stuartii 1 isolat (2,5%). Pengendalian salmonellosis lebih dianjurkan dengan cara pencegahan daripada dengan cara pengobatan. Tindakan pencegahan yang dapat dilakukan antara lain ialah tempat pembibitan harus bebas salmonellosis berdasarkan uji serologis, dilakukan desinfeksi dan fumigasi tempat penetasan, kandang dan tempat pakan serta air minum dijaga kebersihannya setiap hari secara teratur serta makanan diberikan dalam keadaan segar dan bebas pencemaran kuman Salmonella…
Keyword: 

Judul: Isolasi dan Identifikasi Salmonella enteritidis pada Telur Saluran Pencernaan dan Feses Ayam Ras dari Peternakan Ayam Petelur di Gunung Sindur Bogor
Abstrak: Salmonella became a major cause of food poisoning. Several types of Salmonella could infect chicken as well as pig, cattle, egg and other fresh product. Poultry could be infected by several types of this bacteria. Adult laying hens infected by Salmonella may carry the organisme in their small intestines and shed it in their faeces, which may lead to contamination of the eggshell surface, alternatively contamination of the laid egg may occur in vivo through the dessemination of the organisme to the egg following localization and colonization of the small intestine by Salmonella, that is by transovarian transmision. Total 6 hens, 12 eggs, and 22 samples of faeces were test. From this case, we must give more our atention to Salmonella so this study evaluated the prevalence of Salmonella in different hatchery by applying Bacteriological Analitycal Methode (BAM) for isolation and identification of this bacteria. The test shown that just faeces from Farm A which were contaminated by Salmonella. Test were not found all kind of species Salmonella in egg and gastrointestine
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