Judul: Penyebaran dan Kelimpahan Beberapa Jenis Keong Gondang (Pila spp.) di Perairan Rawa Pening, Jawa Tengah
Abstrak: Penelitian terhadap penyebaran dan kelimpahan keong gondang di perairan Rawa Pening, Jawa Tengah, dilakukan mulai pertengahan Xaret sampai denpan akhir Mei 1984. Penelitian ini bertujuan untuk mengetahui beberapa aspek ekologi dari keong gondang, disamping menambah informasi mengenai perikehidupannya di Indonesia. Untuk mendapat kan data keong, ditetapkan 5 stasiun pengamatan yang masing-masing terdiri dari 2 transek. Data yang diperoleh berupa jurnlah individu masing-masing jenis keong gondang pada tiap transek pengamatan. Untuk menunjang data tersebut diamati pula kondisi fisika-kirnia perairan yaitu suhu, O2 terlarut, C02 bebas, pH, kesadahan (ca++), kedalaman, dan beberapa faktor lingkungan lainnya.
Keyword: 

Judul: Beberapa Aspek Bilologi Keong Gondang Bola (Pila ampullacea) Di Laboratorium
Abstrak: Penelitian dilakukan di pekarangan rumah Tegal Manggah dan Laboratorium Biologi Air, Fakultas Perikanan IPB Darmaga dari Agustus 1990 sampai dengan 1 Oktober 1991 dengan tujuan untuk mengetahui pertumbuhan dan preferensi makanannya guna menunjang kemungkinan pilihan pemanfaatannya. Juga untuk mengetahui estivasi dan mobilitasnya di daratan guna menunjang kemungkinan pilihan pengendaliannya. Penelitian pertumbuhan dan preferensi makanan menggu- nakan keong berumur satu bulan berjumlah 240 ekor dan pakan berupa sawi hijau (Brassica campestis), daun, keladi (Xanthosoma sp); sawi putih (B. juncea) dan campuran ketiganya, kakareoan (Azolla pinata); mata lele (Lemna sp), ganggeng (Hydrilla verticillata) serta campuran dari ketiganya. X Wadah yang digunakan adalah akuarium berukuran (60 40 x 40) cm yang disekat menjadi empat dan diisi air kurang lebih 15 cm. Penelitian perbandingan pengukuran berdasarkan tinggi dan bobot, menggunakan keong beberapa ukuran dengan pakan ganggeng. Penelitian estivasi menggunakan keong dengan tinggi (15 - 24); (25 - 34) dan (35 44) mm yang masing-masing berjumlah 18 ekor. Wadah yang digunakan adalah ember yang diisi lumpur Penelitian tambahan estivasi menggunakan keong beberapa ukuran, dengan wadah ember yang diisi lumpur dan dibiarkan sampai retak-retak. Penelitian mobilitas di daratan menggunakan keong dari beberapa ukuran dengan media tanah yang keras dan kering.
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