Judul: Pengaruh tingkat pemberian pakan terhadap pertumbuhan nener bandeng (Chanos chanos Forskal)
Abstrak: Tujuan penelitian ini adalah untuk mengetahui jumlah makanan yang dibutuhkan yang dapat mendukung pertumbuhan dan kelangsungan hidup nener bandeng.
Keyword: Chanos chanos, nener bandeng

Judul: Tingkat pupuk triple superfosfat dalam mendukung perkembangan klekap bagi pertumbuhan nener bandeng, Chanos chanos Forskal
Abstrak: Pemupukan triple superfosfat (TSP) dalam upaya peneran bandeng masih terdapat masalah , yaitu jumlah dan k alitas klekap yang dihasilkan belum memadai bagi pertumbuhan nener. Atas dasar tersebut maka dilakukan percobaan untuk mengetahui tingkat aplikasi TSP secara susulan untuk meningkatkan dan mempertahankan ketersediaan klekap yang optimal bagi perumbuhan nener. Percobaan ini dilakukan di Laboratorium Pengembangan Wilayah Pantai UNDIP dan Balai Budidaya Air Payau (BBAP), Jepara mulai 1 Agustus 1990 hingga 30 Juli 1992. Sesuai dengan tujuannya, maka dicoba perlakuan dengan penambahan p puk TSP awal 30, 40, 50 dan 6-0 kg/ha dan secara berkala dilakukan pemupukan susulan sebanyak 3 kali sebesar setengan dos is awal setiap penambahan. Percobaan mengacu pada rancangan acak lengkap, yang setiap tingkat pemupukan diulang 3 kali. Percobaan dilakukan pada petak tambak berukuran 100 x m, sebagai unit percobaan adalah bagian petak tambak ya ng dibatasi oleh s.ekat papan berbentuk empat persegi anjang berukuran 2 x 1 x 1 m yang dilapisi plastik. etiap unit petak terdiri dari dua · bagian, yaitu untuk ercobaan tanpa nener dan percobaan dengan· nener. Peubah utama yang dikaji adalah : (1) perilaku dan nopangan sediaan P0 4 -P, ( b) pertumbuhan klekap dan ( c) emanfaatan P04 -P dan (d) pertumbuhan nener dan keefisienan pemanfaatan klekap. Peubah pendukung adalah beberapa parameter fisika, kimia tanah dan air. Keeratan hubungan antar peubah dikaji dengan analisis regresi yang sesuai model hubungannya, sedang pembandingan antar tingkat dilakukan analisis peragam. dst
Keyword: Chanos chanos

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