Judul: Struktur komunitas dan distribusi spasial Zooplankton di Perairan Pulau Kapoposang, Sulawesi Selatan
Abstrak: Penelitian tentang struktur komunitas dan distribusi spasial zooplankton di perairan Pulau Kapoposang, Sulawesi Selatan telah dilakukan dari tanggal 9 September sampai 4 Oktober 1995. Hasil penelitian menunjukkan bahwa komposisi jenis zooplankton di perairan Pulau Kapoposang terdiri dari 24 genera yang termasuk dalam filum Protozoa, Crustacea, Chaetognatha, Mollusca (larva), Annelida (larva) dan Arthropoda (larva). Komposisi jenis zooplankton didominasi oleh filum Crustacea terutama dari kelas Copepoda. Kelimpahan zooplankton berkisar antara 11236 2950623 ind/m² dan cenderung semakin meningkat pada stasiun yang dekat dengan pantai. Indeks keanekaragaman genera zooplankton berkisar antara 0.0243 2.0758 dengan keseragaman tinggi (0.6450 0.9012) dan dominansi yang rendah (0.1733 0.3297), kecuali stasiun VIII yang mempunyai keseragaman sangat rendah (0.0009) dan dominansi yang sangat tinggi (0.9946). Pada stasiun VIII pengamatan ...
Keyword: 

Judul: Struktur Komunitas Perifiton pada Ekosistem Padang Lamun di Perairan Pesisir Pulau Kapoposang Sulawesi Selatan
Abstrak: Penelitian dilakukan pada bulan September 1995 di perairan pesisir pulau Kapoposang Sulawesi Selatan, yang kemudian dilanjutkan dengan analisa perifiton di Laboratorium Avertebrata Fakultas Perikanan Institut Pertanian Bogor. Penelitian ini bertujuan untuk mengetahui struktur komunitas perifiton pada ekosistem padang lamun dan mengetahui komposisinya pada berbagai jenis lamun yang terdapat di perairan pesisir pulau Kapoposang. Lokasi penelitian dibagi atas 8 stasiun yang dibedakan menurut arah dan keadaan substrat. Setiap stasiun terdiri dari 4 sub stasiun. Pada substasiun terdiri dari beberapa plot yang dibatasi sampai kedalaman ± 130 em. Jarak antar substasiun dan antar plot adalah 10 m. Pengambilan contoh perifiton dilakukan dengan cara memotong daun lamun sepanjang 10 em, kemudian dikerik, diencerkan ke dalam larutan formalin 10 % sebanyak 10 ml. Jenis lamun yang terdapat di pulau Kapoposang terdiri dari Thalassia hemprichii, Enhalus acoroides, Cymodocea rotundata, C. serntlata dan Syringodium isoetifolium dan Halophila minor. Lamun yang mendominasi adalah Thalassia hemprichii, kecuali di stasiun VII yang lebih didominasi oleh Enhalus acoroides. Komposisi perifiton pada setiap jenis lamun umumnya sarna. Perifiton utama yang ditemukan pada setiap jenis lamun adalah Diatomae, Cyanophyceae dan Rodophyceae. Kelas Diatomae mendominasi baik berdasarkan jenis maupun kepadatannya.
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