Judul: Perkembangan Babesia canis in vitro pada konsentrasi serum 10
Abstrak: Babesia canis penyebab Babesiosis pada anjing didapatkan dari sel darah merah anjing lokal yang terinfeksi secara alami yang telah di splenektomi. Parasit ini dapat dikembangbiakkan secara in vitro dalam media RPMI 1640 dengan konsentrasi serum 10% yang diikubasikan pada suhu 37°C dengan kadar CO2 5%. Peningkatan jumlah eritrosit berparasit terjadi setelah dilakukannya subkultur pertama, peningkatan optimal terjadi pada subkultur keempat dengan jumlah eritrosit berparasit mencapai 5.28±0.19%, akan tetapi jumlah parasit mengalami penurunan pada subkultur kelima hingga mencapai 1.56 ± 0.22%. Bentuk morfologi B. canis dalam media kultur mempunyai kesamaan dengan yang ditemukan pada darah perifer.
Keyword: 

Judul: Teknik biakan Babesia canis secara in vitro dengan konsentrasi serum 40 persen
Abstrak: Penggunaan sistem kultur in vitro sangat berpotensi dimasa mendatang. Akan tetapi potensi ini dipengaruhi oleh faktor individu, institusi, aspek komersial, dan inovasi untuk meneliti dan mengeksploitasi protokol yang ada. Keterbatasan tersebut dapat diminimalkan dengan mempelajari teknik pemupukan Babesia canis (B. canis) secara in vitro untuk kondisi Indonesia. Penggunaan desinfektan (alkohol 70%) pada peralatan kultur sebelum, pada saat dan sesudah bekerja (setelah prosedur standar lainnya diterapkan) merupakan prosedur sterilisasi yang cukup vital dan harus dilaksanakan untuk kondisi Indonesia. Eritrosit terinfeksi B. canis dikoleksi dari darah anjing yang displenektomi. Parasit yang diisolasi dibiakkan secara in vitro dengan media RPMI-1640 dan 40% serum anjing normal, dan diinkubasikan dengan kadar CO2 5% pada suhu 37°C. Pemupukan dapat dipertahankan selama 16 hari dengan prosentase eritrosit berparasit (PPE) tertinggi 8.5145% pada hari pertama pemupukan. Pada kultur awal, parasit tumbuh dengan baik dan PPE meningkat dari 3.888% menjadi 8.5145% setelah 24 jam. Setelah 48 jam, PPE turun menjadi 5.42967%. Konsentrasi serum 40% dapat dipakai sebagai pilihan untuk pembiakan jangka panjang B. canis dengan pertumbuhan yang stabil bila diimbangi dengan penerapan teknik aseptik yang baik dan benar.
Keyword: 

Judul: Algorithm construction of HLI hash function
Abstrak: Cryptography is a study of mathematical techniques related to aspects of information security regarding on confidentiality, data integrity, entity authentication, and data origin authentication. Data integrity is a service, which is associated with the conversion of data carried out by unauthorized parties. To maintain data integrity, one can use hash functions. An hash function is a computationally efficient function to map an arbitrary length bitstring to a fixed length bitstring called as hash value. The use of hash function in maintaining the information integrity and authentication is in digital signatures, virus protection, and software distribution. Illustration of the hash function in the integrity and authentication of information that is emailed as follow. The sender sends the information and hash value to the recipient. If the hash value of the information is equal to the hash value that is sent by the sender, then information has not been changed. Otherwise the information has been changed. An hash function has two properties, one way and collision resistance. An hash function is called one way if it is computationally infeasible to find any input such that when given any hash value . Meanwhile an hash function is called collision resistant if it is computationally infeasible to find any two inputs where such that . The purpose of this study is to construct a HLI hash function algorithm, to analyze the speed and security of the hash functions as a results of construction. Furthermore, it is to compare it with SWIFFT. Hash function is constructed based on the result of algebraic operations on modular polynomial ringwith . Modular polynomial ring noted as is a set of all polynomials of degree at most with coefficients in . can be represented as a set of integer vector of modulo in dimension . So, it is simple to implement in a computer. In vector operations, is lattice . Furthermore, alattice that is defined from certain polynomial ring is called ideal lattice. HLI hash function is consists of addition and multiplication algorithm in the ring. Addition algorithm consists of sumation operations of modulo and multiplication consists of multiplication operations of modulo . Generally, algorithm of HLI hash function consists of multiplication operations of modulo and addition operations of modulo . However, if the input is binary number then multiplication algorithm only consists of multiplication operation of modulo , so algorithm of HLI hash function consists of multiplication operations of modulo and addtion operations of modulo . An hash function is secured if it has two properties, i.e., one way and collision resistance. HLI hash function hash is one way, it is following the proof of Micciancio. It is has collision resistant because of polynomial is irreducible over and monic. Moreover, it is proved that for every unit vector , the vector is small vector. If the input of hash function is a binary number then HLI hash function only involves addition operations of modulo . So the time that used almost same with SWIFFT. The excellence of HLI hash function is the key size smaller than SWIFFT. This effect on
Keyword: hash function, modular polynomial ring, lattice