Judul: Pengaturan Padat Tebar pada Pendederan Ikan Kerapu Cantang (Epinephelus sp.) dalam Karamba Jaring Apung Laut untuk  Menekan Kanibalisme
Abstrak: Pengembangan usaha pendederan benih ikan kerapu dalam keramba jaring apung (KJA) di laut dihadapkan kepada tingginya tingkat kematian akibat kanibalisme. Pengaturan padat tebar diharapkan bisa menekan kanibalisme dalam pendederan tersebut. Penelitian ini bertujuan menganalisis pengaruh padat tebar terhadap tingkat kanibalisme dan kinerja produksi pendederan ikan kerapu cantang dalam KJA laut. Penelitian menggunakan rancangan acak lengkap dengan perlakuan padat tebar berbeda, yaitu 75, 100, 125 ekor m-3 dengan tiga kali ulangan. Ikan kerapu cantang ukuran 4-5 cm dipelihara selama 30 hari dalam waring berukuran 1 m ×1 m ×1 m bermata jaring 5 mm yang ditempatkan dalam KJA berukuran 3 m × 3 m ×3 m bermata jaring 1 inci. Ikan kerapu diberi pakan sebanyak enam kali sehari dengan jumlah 30 g hari-1 secara at satiation mengunakan pakan komersial tenggelam Otohime® (EP 2 dan EP 3) berukuran 2,3 dan 3,1 mm dengan kandungan protein minimal 48%. Panjang, bobot, sampel darah ikan, dan fisika kimia air diukur setiap 10 hari. Penelitian menunjukkan bahwa pada padat tebar 75 ekor m-3 diperoleh tingkat kanibalisme terendah sebesar 29,33% dan kinerja produksi terbaik, yaitu tingkat kelangsungan hidup sebesar 70,67%, laju pertumbuhan panjang mutlak sebesar 0,170 cm hari-1, pertumbuhan panjang spesifik 2,49% hari-1, pertumbuhan bobot mutlak sebesar 0,520 g hari-1, pertumbuhan bobot spesifik sebesar 7,53% hari-1, dan nilai rasio konversi pakan sebesar 1,16.
Keyword: growth, production performance, survival rate

Judul: Kinerja Produksi Pendederan Kerapu Cantang dalam Karamba Jaring Apung Dasar Bertingkat
Abstrak: Kanibalisme pada pendederan ikan kerapu cantang perlu ditekan untuk meningkatkan produktivitasnya, yakni dengan mengurangi frekuensi temu ikan melalui aplikasi karamba jaring apung (KJA) dasar bertingkat. Penelitian ini bertujuan menganalisis kinerja produksi pendederan ikan kerapu cantang dalam KJA dasar bertingkat. KJA berukuran 1 m × 1 m × 1,5 m dengan dasar tidak bertingkat, bertingkat satu, dan bertingkat dua. Rangka bertingkat dibuat dari pipa polyvinyl chloride (PVC) berdiameter 1 inci dilengkapi jaring berdiameter mata jaring 5 mm, ditempatkan di tengah dasar karamba. Dasar karamba berukuran 1 m × 1 m, dan tingkat di atasnya berukuran 0,6 m × 0,6 m, dengan jarak setiap tingkat 30 cm. Kerapu cantang dengan ukuran 9 cm ditebar dengan kepadatan 67 ekor m-3 dan dipelihara selama 42 hari dengan diberi pakan buatan berupa pelet sebanyak 3 kali sehari dengan pemberian sekenyangnya. Pengukuran panjang dan bobot ikan dilakukan setiap 7 hari. Hasil penelitian menunjukan bahwa KJA dasar bertingkat tidak berpengaruh terhadap tingkat kanibalisme, tingkat kelangsungan hidup, dan rasio konversi pakan pada pendederan ikan kerapu cantang di laut (P>0,05). Walaupun demikian, laju pertumbuhan spesifik (2,94-3,18 % hari-1), pertambahan panjang mutlak (4,67-4,93 cm), dan laju pertumbuhan bobot harian (0,94-1,08 g hari-1) yang dicapai pada KJA dasar bertingkat lebih tinggi dibandingkan KJA dasar tidak bertingkat (P<0,05).
Keyword: kanibalisme, kelangsungan hidup, kinerja produksi, pertumbuhan

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