Judul: Pengaruh tingkat pemberian pakan terhadap pertumbuhan nener bandeng (Chanos chanos Forskal)
Abstrak: Tujuan penelitian ini adalah untuk mengetahui jumlah makanan yang dibutuhkan yang dapat mendukung pertumbuhan dan kelangsungan hidup nener bandeng.
Keyword: Chanos chanos, nener bandeng

Judul: Studi Tentang Pertumbuhan dan Perkembangan serta Tingkat Kelangsungan Hidup larva Bandeng (chanos chanos Forsk.) Pada Frekunsi Pemberian Pakan yang berbeda
Abstrak: Ikan bandeng (Chanos chanos Forsk.) merupakan salah satu komoditas perikanan yang memiliki nilai ekonomis, baik untuk memenuhi konsumsi dalam negeri maupun untuk ekspor. Peningkatan kegiatan tambak bandeng di Indonesia mengakibatkan terjadinya peningkatan permintaan benih ikan bandeng (nener). Penangkapan nener yang intensif secara terus menerus dapat mengakibatkan populasi nener semakin menurun dan secara umum dapat membahayakan populasi bandeng di laut. Pengembangan program pembenihan secara buatan merupakan salah satu alternatif untuk mengontrol proses reproduksi bandeng. Pemijahan bandeng dengan menggunakan hormon telah berhasil dilakukan. Sejalan dengan keberhasilan tersebut timbul masalah diantaranya kondisi lingkungan, kualitas air, pakan dan tingkat kelangsungan hidup larva bandeng yang masih rendah. Tujuan penelitian ini adalah untuk mengetahui perkembangan dan pertumbuhan larva bandeng, serta tingkat kelangsungan hidup larva bandeng pada frekuensi pemberian pakan yang berbeda. Pengamatan dilakukan mulai hari ke-0 (larva baru menetas) sampai hari ke-25 (menjadi nener). Jenis pakan yang diberikan adalah Nannochloropsis oculata, plicatilis, dan nauplii Artemia. Brachionus Perkembangan larva bandeng diamati dengan mikroskop binokuler. Pengukuran parameter pertumbuhan dilakukan dengan mengukur panjang total larva bandeng. Tingkat kelangsungan hidup diukur berdasarkan jumlah larva yang mati. Parameter kualitas air yang diukur meliputi suhu, salinitas, pH, DO, ammonia, nitrit dan fosfat. Waktu pengamatan dilakukan pada hari ke-0, 5, 10, 15, 20 dan 25. Rancangan percobaan yang digunakan adalah adalah rancangan acak lengkap (3 perlakuan dan 3 kali ulangan). Pengukuran parameter kualitas air secara umum menunjukkan kisaran yang masih cukup layak bagi kehidupan larva bandeng.
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