Judul: Penyebaran dan Kelimpahan Udang Palaemoninae di Muara Sungai Buntu Kabupaten Sidoarjo Jawa Timur
Abstrak: Penelitian ini dilakukan dari tanggal 19 Maret sampai dengan 7 Mei 1984. Tujuan penelitian adalah untuk mengetahui penyebaran di knel impahan udang Palaemoninae yang dipengaruhi oleh faktor lingkungan di muara Sungai Buntung, Kabupaten Sidoarjo, Jaiva Timur. Alat tangkap yang digunakan adalah 'small beam trawl' dengan ukuran mata jaring 3 mm. Alat tangkap ini di tarik perahu bermotor berkekuatan 10 tenaga kuda dengan kecepatan rata-rata 6 km per jam selama lima menit atau dengan jarak sapuan sepanjang 500 m setiap pengambilan contoh. Stasiun pengambilan contoh ditentukan sebanyak enam buah berdasarkan posisi dan jarakterhadap mulut muara dan garis pantai.
Keyword: 

Judul: Kelimpahan dan Penyebaran Udang Penaeid di Muara Sunagi Cidurian, Kabupaten Tanggerang dan Kabupaten Serang, Jawa Barat
Abstrak: Penelitian ini dilakukan sejak tanggal 2 Mei sampai dengan 25 Mei 1987, dengan tujuan untuk mengetahui komposisi jenis, kelimpahan dan penyebaran setempat udang penaeid di sekitar muara Sungai Cidurian yang terletak di antara Kabupaten Tangerang dan Kabupaten Serang, Propinsi Jawa Barat. Di lokasi penelitian ditetapkan lima buah stasiun pengambilan contoh, yang posisinya sesuai dengan keadaan muara sungai dan kondisi lingkungan. Pengukuran parameter perairan dan pengambilan udang contoh dilakukan sebanyak empat kali dengan selang waktu satu minggu. Udang contoh diambil dengan menggunakan alat tangkap sudu. Alat ini dioperasikan di setiap stasiun dengan cara mendorongnya ke depan sejauh 10 meter. Lebar mulut sudu 4,95 meter. Dari hasil penelitian didapatkan bahwa suhu perairan berkisar antara 32,0 - 34,0 °C, kedalaman 13,0 - 99,0 cm, kecerahan 8,0 - 55,8 cm, pH 6,0 -8,0 oksigen terlarut 4,2 - 16,6 ppm dan salinitas 7,0, - 35,0°/oo. Substrat dasar perairan terdiri dari empat macam tipe, yakni liat, pasir berlempung, lempung dan pasir. Selama penelitian didapatkan tiga jenis udang penaeid, dengan komposisi masing-masing adalah Penaeus merguiensis (de Man) sebesar 47,69%; Metapenaeus lysianassa (de Man) sebesar 28,46% dan Metapenaeus ensis (de Haan) sebesar 23,85%. Kelimpahan P. merguiensis dan M. ensis tidak berbeda di setiap stasiun, tetapi kelimpahan M. lysianassa berbeda. Kelimpahan rata-rata paling besar didapatkan bahwa P. merguiensis pada stasiun IV, M. ensis di stasiun I dan M. lysianassa pade stasiun II. Penyebaran udang terhadap salinitas rata-rata di setiap stasiun berdasarkan kelimpahan rata-rata, memperlihatkan bahwa jenis P. merguiensis kelimpahan rata-ratanya relatif besar pada salinitas relatif tinggi, yalmi stasiun III, IV dan V, sedangkan M. ensis dan M. lysianassa pada salinitas relatif rendah, yakni di stasiun I dan II…dst
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