Judul: Perikanan payang di kotamadya padang
Abstrak: Tujuan penelitian ini adalah untuk Mempelajari perikanan payang di Kodya Padang. Univers Penelitian ini dilaksanakan di Kodya Padang, Propinsi Sumatera Barat. Waktu penelitian terhitung mulai tanggal 11 Agustus sampai tanggal 30 September 1985. Metode yang dipakai dalam penelitian ini adalah merupakan studi kasus.. Analisa data berdasarkan analisa "Break- Even" dan "B/C ratio". Pengembangan alat tangkap, didekati berdasarkan produksi dan nilai produksi tahunan, biaya investasi, biaya tetap, biaya tidak tetap dan potensi lestari. sumberdaya. Potensi sumberdaya perikanan laut di Propinsi Sumatera Barat diperkirakan masih besar, potensi lestari ikan pelagis kecil 35 464,9 ton per tahun, ikan pelagis besar 11 915,9 ton per tahun dan ikan karang/demersal 24 078,6 ton per tahun. Berarti tingkat pengusahaan pada tahun 1984, baru mencapai 42,48 persen untuk ikan pelagis kecil, 82,84 persen untuk ikan pelagis besar dan ikan karang/demersal 13,44 persen. Unit penangkapan payang terdiri dari perahu kayu, mempunyai nilai gross tonage berkisar 1,32 ton sampai 2,20 ton, material jaring payang terbuat dari bahan sintetis, warna jaring coklat. Daerah penangkapan nelayan meliputi perairan laut Kodya Padang dengan jarak tiga mil sampai lima mil dari pantai. Hasil tangkapan dengan alat tangkap payang adalah, ikan tongkol (Euthynus sp), tembang (Sardinella fimbriata), kembung (Rastrelliger sp), layang (Decapterus sp), selar (Caranx sp) dan beberapa jenis ikan lainnya. ...
Keyword: 

Judul: Analisis Aspek Bio-TEknis Unit Penangkapan Payang Di Perairan Ulak Karang, Sumatera Barat
Abstrak: Payang merupakan salah satu unit penangkapan ikan yang umum dikenal dan dioperasikan hampir di seluruh perairan Indonesia. Di Perairan Padang Sumatera Barat, banyak dioperasikan payang. Menurut Statistik Perikanan Sumatera Barat (2001), terdapat 92 unit payang yang beroperasi di sekitar Perairan Padang dengan produksi sebesar 595,l ton per tahun atau sebesar 4,80 % dari total produksi perikanan laut Sumatera Barat.
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