Judul: Studi Kasus Ketonuria Berdasarkan Urinalisis Semikuantitatif Strip-Test Pada Sapi Perah Di Peternakan Kunak Bogor
Abstrak: Kesehatan hewan merupakan aspek penting dalam meningkatkan produksi susu sapi perah. Salah satu tantangannya adalah bagaimana petugas di lapangan dapat menerapkan pendiagnosaan secara praktis. Untuk itu dilakukan penelitian berbasis studi kasus menggunakan urinalisis semikuantitatif strip-test terhadap 30 sapi perah di Peternakan KUNAK Bogor. Hasil pengamatan menunjukkan 2/30 hewan mengalami ketonuria. Mengingat ketonuria erat kaitannya dengan penggunaan energi cadangan, dalam penelitian ini dilakukan pemeriksaan Body Condition Score (BCS) dan pengukuran frekuensi pernapasan dan nadi. Hasil pengamatan menunjukkan bahwa sapi perah ketonuria memiliki nilai BCS 1.5 (kurus) dan peningkatan frekuensi pernapasan dan frekuensi nadi. Peningkatan frekuensi pulsus dan nadi ini merupakan indikasi peningkatan metabolisme. Studi kasus ini memberikan perspektif baru bahwa sapi perah kurus dapat mengalami ketosis selain sapi perah gemuk. Dalam konteks ini urinalisis menggunakan striptest merupakan metode yang efektif untuk mendiagnosa status kesehatan hewan. Adapun hewan yang mengalami gangguan keseimbangan energi beru ketonuria perlu di antisipasi dengan perbaikan nutrisi.
Keyword: Ketonuria, Sapi Perah, BCS, Urinalisis Strip-test

Judul: Studi Kasus Proteinuria pada Sapi Perah di Kawasan Usaha Peternakan Cibungbulang, Bogor.
Abstrak: This research aims to study the proteinuria in dairy cows in Region Livestock enterprises (Kunak) Cibungbulang, Bogor, as a guarantee of health status to fulfill the needs of fresh milk in Indonesia. A total of 30 dairy cows were examined using semi-quantitative test strips, three cows that are not pregnant have proteinuria accompanied by increased frequency of pulsus. A total of three dairy cows proteinuria, one of whom suffered pyuria, hematuria, and glucosuria. Results were analyzed using a table of diagnosing disorders prerenal, renal, and Postrenal, dairy cows are thought to potentially suffer from glomerulonephritis, glomerulosclerosis, interstitial nephritis or urolithiasis. This study provides justification for the effective use of semi-quantitative urine test strips.
Keyword: dairy cattle, proteinuria, pyuria, hematuria, glucosuria

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