Judul: Skenario Pengelolaan Sumberdaya Perikanan Berkelanjutan (Studi Kasus Sumberdaya Larva Ikan Bandeng Di Pesisir Kota Jayapura, Provinsi Papua)
Abstrak: Teluk Youtefa dan Kampung Holtekamp merupakan kawasan pesisir yang secara administratif masuk dalam wilayah Kota Jayapura. Berdasarkan RTRW Kota Jayapura, pemanfaatan kedua kawasan ini diarahkan untuk wisata pantai dan budidaya perikanan berbasis masyarakat, termasuk budidaya tambak ikan bandeng. Akan tetapi komitment Pemerintah Daerah setempat dan koordinasi antar instansi teknis dalam mendukung pengelolaan kedua kawasan tersebut masih sangat kurang. Kondisi ini berdampak pada meningkatnya sedimentasi dan sampah yang berasal dari kawasan bisnis Entrop dan saluran pembuangan Pasar Youtefa, erosi akibat konversi mangrove, dan semakin maraknya aktivitas penangkapan ikan dengan menggunkanan bom ikan. Permasalahan ini diduga menjadi penyebab berkurangnya beberapa jenis benih alam dari kawasan ini termasuk larva ikan bandeng (C. chanos, Forsskal) sejak tahun 2003. Larva ikan bandeng di kedua kawasan ini, dimanfaatkan sebagai benih oleh petambak di Kampung Holtekamp sejak tahun 1993.
Keyword: 

Judul: Kajian Beban Limbah Budidaya Ikan terhadap Lingkungan Perairan Pesisir Holtekam Kota Jayapura Provinsi Papua.
Abstrak: Kawasan pesisir Holtekam potensial bagi pengembangan budidaya perikanan pantai (tambak). Luas areal tambak saat ini sekitar 583 hektar, telah berproduksi sekitar 350 hektar dengan jumlah produksi ikan tahun 2009 adalah 275.18 ton. Data spesifik jumlah buangan limbah budidaya tambak dan dampak ekologisnya terhadap perairan pesisir Holtekam masih sangat kurang. Oleh sebab itu, diperlukan suatu kajian tentang kondisi kualitas air dan daya dukung perairan pesisir Holtekam serta kegiatan budidaya tambak yang berperan menghasilkan limbah. Mengkaji pengaruh limbah buangan budidaya terhadap status lingkungan perairan pesisir Holtekam. Hasil kajian ini diharapkan sebagai data awal dan masukan bagi pelaku usaha tambak dan Pemerintah Kota Jayapura dalam memformulasi kebijakan pengelolaan lingkungan perairan pesisir Holtekam bagi pengembangan perikanan budidaya secara lestari dan bertanggung jawab.
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