Judul: Pengaturan Jumlah Baling-Baling Nosel pada Mist Blower untuk Pemupukan Cair pada Budidaya Kacang Panjang.
Abstrak: Kacang panjang (Vigna sinesis L) merupakan tanaman sayuran yang banyak dikonsumsi oleh masyarakat. Kacang panjang memiliki kandungan gizi yang cukup lengkap. Produksi kacang panjang di Indonesia masih rendah. Usaha yang dapat dilakukan untuk meningkatkan produktivitas kacang panjang dengan pemupukan cair menggunakan mist blower dengan cara menyemprotkan stomata daun kacang panjang. Penelitian ini bertujuan menganalisis dan menentukan kinerja pengabutan optimum pupuk cair untuk budidaya kacang panjang menggunakan mist blower pada berbagai jumlah baling-baling nosel. Tahapan penelitian terdiri dari, uji kinerja mist blower menggunakan jumlah baling-baling nosel berbeda, budidaya kacang panjang, dan pengaplikasian pupuk cair. Dosis yang digunakan untuk pemupukan cair yaitu 6 liter ha-1 dan konsentrasi larutan 6 ml liter air-1. Aplikasi pupuk cair dilakukan pada umur tanaman 7 hari, pemupukan dilakukan setiap 7 hari sekali. Hasil penelitian menunjukkan baling- baling nosel 12 dengan hasil yang paling baik ditunjukkan dengan hasil produksi paling tinggi, yaitu dengan tinggi tanaman 141.05 cm, jumlah polong 5 polong tanaman-1 dan bobot segar 78.4 gram tanaman-1. Parameter penyemprotan yaitu diameter droplet 195.44 μm, kerapatan droplet 320 droplet cm-2, lebar pengabutan efektif 1.36 m, tinggi pengabutan efektif sebesar 68 cm, debit pengabutan efektif 4.41 liter menit-1, dan jarak jangkauan pengabutan efektif 5.76 m.
Keyword: baling-baling nosel, kacang panjang, mist blower, pemupukan cair, baling-baling nosel, kacang panjang, mist blower, pemupukan cair

Judul: Performance of Mist Blower for Liquid Organic Fertilizer and Biosaka
Abstrak: Pupuk organik cair dan biosaka merupakan salah satu cara untuk memenuhi kandungan nutrisi serta pencegahan hama pada tanaman. Pengaplikasian pupuk organik cair dan biosaka dapat menggunakan alat dan mesin pertanian yaitu pengabut gendong bermotor (mist blower). Mist blower merupakan salah satu tipe sprayer yang dapat memecah cairan untuk menghasilkan butiran halus (droplet) yang dihembuskan oleh aliran udara dari blower yang digerakkan oleh motor penggerak. Pengujian kinerja mist blower dilaksanakan di laboratorium sprayer. Terdapat enam perlakuan kombinasi dari tiga jumlah baling-baling nosel (balingbaling nosel berjumlah 8, baling-baling nosel berjumlah 10, dan baling-baling nosel berjumlah 12) dan dua jenis larutan (pupuk organik cair dan biosaka). Hasil uji kinerja pengabutan optimum diperoleh pada baling-baling nosel berjumlah 12 menggunakan larutan pupuk organik cair dan biosaka, mampu menghasilkan diameter droplet sebesar 159,6 μm dan 221,4 μm, kerapatan droplet sebesar 308,4 droplet/cm2 dan 190,4 droplet/cm2 , lebar pengabutan efektif sebesar 128 cm, debit pengabutan efektif sebesar 1,43 liter/menit dan 1,46 liter/menit, jangkauan pengabutan efektif sebesar 1,12 m dan 1,04 m, dan jangkauan pengabutan total sebesar 6,56 m dan 6,32 m. Kinerja mist blower dengan jumlah baling-baling nosel yang lebih banyak mampu menghasilkan diameter droplet yang semakin kecil dan kerapatan droplet akan semakin besar.
Keyword: biosaka, liquid fertilizer, mist blower, nozzle propeller

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