Judul: Infeksi Cacing Jantung Dirofilaria Immitis, Railliet & Henry, 1911 Pada Anjing
Abstrak: Cacing Dirofilaria immitis dewasa yang tinggal dalm ventrikel kanan jantung anjing, sering kali menimbulkan gejala klinis yang cukup berat. Cacing Tersebut menghasilkan mikrofilaria yang selanjutnya berkembang menjadi larva infektif dalam saluran malphigi induk semang entara, yaitu nyamuk dari genus Culex, Aedes dan Anopheles.
Keyword: 

Judul: Penyakit Cacing jantung Pada Anjing
Abstrak: Penyakit cacing jantung merupakan salah satu penyakit parasiter disebabkan oleh Dirofilaria immitis, termasuk dalam kelas Nematoda, ordo Spirurida dan famili Filariidae. Dirofilaria immitis dewasa berwarna putih, langsing dan panjang. Cacing betina mempunyai ukuran tubuh lebih panjang daripada cacing jantan dan bersifat viviparous, menghasilkan larva vormiform disebut mikrofilaria yang da- pat ditemukan dalam peredaran darah perifer setiap waktu, tetapi umumnya mempunyai kecenderungan kearah waktu ter- tentu. Daur hidupnya tidak langsung, nyamuk merupakan in- duk semang antara yang bertindak sebagai vektor penyakit terutama dari genus Culex, Aedes, Anopheles, Armigerus, Mycorhynchus dan Taeniorhynchus. Telah dilaporkan lebih dari 17 spesies nyamuk dari genus Culex, Aedes dan Anophe- les sangat cocok sebagai induk semang antara untuk perkem- bangan larva. Kejadian penyakit telah tersebar di seluruh dunia, baik di daerah tropis, subtropis maupun di daerah beriklim sedang. Persentase kejadian tinggi ditemukan di Australia dan Amerika Serikat. Di Indonesia juga sering ditemukan, walaupun belum mendapat perhatian sebagai mana mestinya. Induk semang utama adalah anjing dan bertindak seba- gai reservoir penyakit. Kejadian penyakit pada hewan lain pernah ditemukan pada kucing, rubah, coyote, srigala, si- nga laut, anjing laut dan beruang hitam. Beberapa kasus pada manusia juga pernah dilaporkan. Pada umumnya Dirofi- laria immitis dewasa hidup dalam ventrikel kanan jantung dan arteri pulmonalis. Lokasi lain ditemukan pada vena cava, aorta, atrium, ruang abdomen, mata dan ventrikel otak. Gejala penyakit tergantung atas jumlah cacing dalam tubuh penderita dan lamanya penyakit. Pada infeksi perta- ma gejala klinis berupa batuk dan menurunnya stamina, ter- utama akan terlihat setelah latihan atau pertama kali di- latih setelah periode istirahat. Pada kasus berat nafsu makan turun, hewan lesu, berat badan turun, dispnoe, tem- peratur tubah tinggi, cyanotis dan anemia. Tahap selan- jutnya terjadi hydrop ascites, hydrop anasarca, ichterus, haemoglobinuria, bilirubinuria, kadar urea darah, SGPT dan SGOT meningkat. Pada tahap akhir timbul gejala syaraf dan hewan dapat mati dalam beberapa jam…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