Judul: Pertumbuhan dan Perkembangan Tanaman Gandum (Triticum aestivum L) Pada Periode Tanam dan Taraf Pemupukan Nitrogen Yang Berbeda
Abstrak: Periode tanam mempengaruhi ketersediaan air selama pertumbuhan dan perkembangan tanaman gandum. Sedangkan pemupukan nitrogen memberikan pengaruh terhadap produksi dan kandungan protein biji gandum. Pada penelitian ini dipelajari pengaruh periode tanam dan taraf pemupukan nitrogen terhadap pertumbuhan dan perkembangan tanaman gandum. Penanaman dilakukan empat periode tanam (W) yaitu: periode tanam pertama (WI), periode tanam kedua (W2), periode tanam ketiga (W3) dan periode tanam keempat (W3), sedangkan pemupukan terdiri dari tiga taraf penmpukan yailu: NO (0 Kg N/ha), NI (50 Kg N/ha) dan N2 (100 Kg N/ha).
Keyword: 

Judul: Pertumbuhan dan perkembangan tanaman gandum (Triticum aestivum L.) pada periode tanam dan taraf pemupukan nitrogen yang berbeda
Abstrak: Periode tanam mempengaruhi ketersediaan air selama pertumbuhan dan perkembangan tanaman gandum. Sedangkan pemupukan nitrogen memberikan pengaruh terhadap produksi dan kandungan protein biji gandum. Pada penelitian ini dipelajari pengaruh periode tanam dan taraf pemupukan nitrogen terhadap pertumbuhan dan perkembangan tanaman gandum. Penanaman dilakukan empat periode tanam (W) yaitu: periode tanam pertama (W1), periode tanam kedua (W2), periode tanam ketiga (W3) dan periode tanam keempat (W3), sedangkan pemupukan terdiri dari tiga taraf pemupukan yaitu: NO (0 Kg N/ha), N1 (50 Kg N/ha) dan N2 (100 Kg N/ha). Pada W1 ketersediaan air lebih tersedia saat awal pertumbuhan dibandingkan periode tanam yang lain, sedangkan W3 dan W4 ketersediaan air tinggi saat menjelang tanam yang menyebabkan produksi dan kualitas biji menurun. Pemupukan nitrogen yang tinggi menyebabkan umur tanaman menjadi panjang dan meningkatkan hasil tanaman (ton/ha). Pada kondisi ketersediaan air kurang pemupukan nitrogen akan menurunkan hasil tanaman (ton/ha). Uji statistik pengaruh perkembangan tanaman gandum dengan Rancangan Petak Terbagi (RPT) dengan rancangan dasar Rancangan Acak Kelompok (RAK). Pengaruh periode tanam nyata pada taraf 5% dan 1% terhadap jumlah bunga/malai dan jumlah biji/malai, sedangkan hasil tanaman (ton/ha) dipengaruhi oleh periode tanam, taraf pemupukan nitrogen dan interaksi antara kedua perlakuan. Sedangkan interaksi antara kedua perlakuan diuji lanjutan dengan uji LSD. Berdasarkan persamaan regresi antara laju perkembangan dan suhu udara rata-rata mulai tanam sampai panen dari empat penelitian diperoleh nilai suhu dasar 2.4 °C. Nilai satuan panas mulai tanam sampai panen untuk periode tanam pertama 2216 H°C, periode tanam kedua 2247 H°C, periode tanam ketiga 2267 H°C dan periode tanam keempat 2275 H°C. Sedangkan secara berurutan mulai periode tanam pertama sampai periode tanam keempat, nilai satuan panas fase perkecambahan adalah 104, 134, 134 dan 155 H°C; fase inisiasi pembungaan 870, 866, 884, 884 H°C; fase pembungaan 155, 154, 155 dan 155 H°C; serta fase matang fisiologis 1088, 1093, 1093 dan 1080 H°C. Satuan panas pada semua periode tanam untuk fase perkecambahan memiliki nilai tidak konstan, sedangkan fase pembuahan dan matang fisiologis diperoleh hasil yang konstan.
Keyword: tanaman gandum, botani, pengaruh iklim, fenologi, metode satuan panas

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