Judul: Tingkat Kelangsungan Hidup dan Laju Pertumbuhan Karang Jenis Euphylia sp (Dana, 1846), Plerogyra sinuosa (Dana 1846) dan Cyarina lacrymallis (Edwards & Halima, 1848) yang Ditransplatasikan di Perairan Pulau Pari, Jakarta.
Abstrak: Penelitian ini bertujuan untuk mengetahui tingkat kelangsungan hidup dan laju pertumbuhan karang jenis Euphyl/ia sp, Plerogyra sinuosa dan Cynarina lacrymalis yang ditransplantasikan. Penelitian transplantasi karang ini dilaksanakan selama 6 bulan, mulai Maret sampai September 2001. Lokasi penelitian di perairan Pulau Pari, Kabupaten Kepulauan Seribu Jakarta. Berdasarkan jenis fragmen koral yang ditransplantasikan ternyata memiliki tingkat kelangsungan hidup yang berbeda. Tingkat kelangsungan hidup Euphilla sp sebesar 77,78 %. Plerogyra sinuosa dan Cynarina /acryma/is masing-masing sebesar 33,33% dan 22,22%.
Keyword: 

Judul: Tingkat Kelangsungan Hidup, Laju Pertumbuhan Dan Rasio Pertumbuhan Beberapa Jenis Karang Batu Dan Karang Api Yang Ditransplantasikan Di Perairan Pulau Pari, Kepulauan Seribu, Jakarta
Abstrak: Transplantasi karang (coral transplantaiion) merupakan suatu teknik penanaman dan penumbuhan koloni karang dengan metode fragmentasi, dimana koloni tersebut diambil dari suatu induk koloni tertentu. Transplantasi karang bertujuan untuk mempercepat regenerasi terumbu karang yang telah mengalami kerusakan atau sebagai sebuah metode untuk memperbaiki daerah terumbu karang yang telah terdegradasi terutama untuk meningkatkan keanekaragaman dan persen penutupan. Penelitian ini bertujuan untuk mengetahui tingkat kelangsungan hidup (survival rate), laju pertumbuhan dan rasio pertumbuhan karang jenis Trachyphyllia geoffroyi, Wellsophyllia radiata, Acropora inlermedia dan Millepora tenella yang ditransplantasikan di perairan Pulau Pari, Kepulauan Seribu serta mengamati beberapa parameter fisika dan kimia perairan sebagai pendukung kehidupannya. Penelitian ini dilaksanakan di perairan Pulau Pari, Kepulauan Seribu, Jakarta selama 6 bulan dimulai pada bulan Maret - September 2001. Lokasi stasiun penelitian berada pada gugusan karang tepi (fringing reef) di sebelah selatan Pulau Pari pada kedalaman 12 meter. Parameter yang diamati dalam penelitian ini adalah kelangsungan hidup (survival rate), laju pertumbuhan, dan rasio pertumbuhan karang. Variabel pertumbuhan karang yang diukur adalah pertambahan lebar dan tinggi fragmen karang, pertambahan tunas dan mortalitas. Parameter lingkungan perairan yang diukur adalah suhu, salinitas, kecepatan dan arah arus serta pH.
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