Judul: Keterkaitan Komunitas Zooplankton Dan Kualitas Air Di Perairan Danau Ebony, Pantai Indah Kapuk, Jakarta Utara
Abstrak: Danau Ebony adalah perairan buatan yang di sekitarnya terdapat aktivitas domestik yang menghasilkan limbah yang dapat mempengaruhi zooplankton. Perairan Danau Ebony dijadikan objek studi untuk melihat keterkaitan antara komunitas zooplankton dengan kualitas air. Penelitian dilakukan pada bulan April sampai Agustus 2014. Pengambilan contoh zooplankton dan kualitas air dilakukan pada lima Stasiun dengan interval satu bulan. Komunitas zooplankton di perairan Danau Ebony terdiri atas kelompok Rotifera (7 genera), Crustacea (3 genera), dan Protozoa (2 genera). Kelimpahan zooplankton tertinggi adalah genus Brachionus dari kelompok Rotifera. Kelompok Rotifera berkorelasi negatif kuat dengan TSS, kekeruhan, ammonia dan berkorelasi positif kuat dengan pH. Ini berarti tingginya TSS, kekeruhan, ammonia diikuti oleh rendahnya kelimpahan Rotifera, sedangkan tingginya pH diikuti oleh tingginya rotifer. Kelompok Protozoa berkorelasi positif kuat dengan TSS dan berkorelasi negatif kuat dengan suhu. Berarti tingginya TSS diikuti oleh tingginya kelimpahan Protozoa, sedangkan tingginya suhu diikuti oleh rendahnya kelimpahan protozoa.
Keyword: komunitas zooplankton, Danau Ebony, kualitas air

Judul: Keterkaitan Antara Suksesi Fitoplankton Dengan Kualitas Air Di Danau Ebony, Pantai Indah Kapuk, Jakarta Utara
Abstrak: Danau Ebony, Pantai Indah Kapuk, Jakarta Utara, sering mendapatkan limpasan bahan organik dari aktivitas domestik, seperti limbah rumah tangga, rumah makan, dan fresh market di sekitar danau. Limpasan tersebut berpotensi menjadi nutrien, yang kemudian akan dimanfaatkan oleh fitoplankton. Perubahan kelimpahan, komposisi, dan biomassa fitoplankton yang terjadi akibat pengaruh kualitas air disebut sebagai suksesi. Tujuan dari penelitian ini adalah untuk mengkaji keterkaitan antara suksesi fitoplankton dengan nutrien dan kualitas air di Danau Ebony. Suksesi fitoplankton dapat digambarkan dengan grafik suksesi Frontier, SDI (laju suksesi) dan SIMI. Berdasarkan grafik suksesi Frontier, fitoplankton Danau Ebony berada pada stadia 2 dan 3 dengan laju suksesi pada kisaran 0,008-0,003 dan nilai SIMI pada kisaran 0,68-0,97. Hasil biplot AKU dan uji korelasi, fitoplankton berkaitan dengan amonia, pH, suhu, konduktivitas, dan salinitas.
Keyword: grafik suksesi Frontier, kualitas air, SDI, SIMI

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