Judul: Pengaruh penambahan CaCo3 dengan dosis 50-200mg/l pada media pemeliharaan terhadap pertumbuhan Cherax quadricarinatus
Abstrak: Cherax quadricarinatus nerupakan komoditas budidaya air tawar yang saat ini banyak diminati oleh masyarakt. Namun, produksinya masih terkendala dengan produktivitasnya yang rendah serta ukuran individu yang tidak seragam.
Keyword: 

Judul: Preferensi benih lobster air tawar (Cherax quadricarinatus) terhadap alkalinitas
Abstrak: Cherax quadricarinatus merupakan lobster air tawar yang digemari sebagai udang konsumsi maupun sebagai udang hias sehingga berpotensi untuk dikembangkan usaha budidayanya. Kondisi air sebagai media hidup udang akan menentukan kelangsungan hidup dan pertumbuhannya. Salah satu parameter kualitas air yang diperkirakan mempengaruhi kelangsungan hidup dan pertumbuhan biota air adalah alkalinitas. Tujuan penelitian ini adalah mendapatkan informasi tentang kisaran alkalinitas yang dapat ditolerir oleh Cherax quadricarinatus serta alkalinitas optimum yang dapat menunjang kelangsungan hidup dan pertumbuhan benih Cherax quadricarinatus. Penelitian ini terdiri atas percobaan pendahuluan dengan 5 perlakuan alkalinitas yaitu 80, 110, 140, 170, dan 200 mg/l CaCO3, percobaan utama dan percobaan pendukung dengan 4 perlakuan alkalinitas yaitu 100, 140, 180, dan 220 mg/l CaCO3 serta 1 kontrol (50 mg/l). Benih Cherax berumur 2 minggu dipelihara dalam akuarium dengan kepadatan 8 ekor/wadah. Pakan berupa cacing Tubifex sp. diberikan secara adlibitum pada pagi dan sore hari. Parameter yang diukur yaitu tingkat kelangsungan hidup, bobot biomassa, pertumbuhan bobot rata-rata individu, laju pertumbuhan bobot rata-rata harian, frekuensi molting, dan periode waktu antar molting serta parameter fisika-kimia air (suhu, DO, pH, ammonia, dan nitrit). Berdasarkan hasil penelitian, Cherax quadricarinatus mampu hidup pada kisaran alkalinitas antara 50 - 220 mg/l CaCO3. Kisaran alkalinitas optimum 100 180 mg/l CaCO3, dengan titik alkalinitas optimum pada 140 mg/l CaCO3.
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