Judul: Pengaruh aplikasi berbagai konsentrasi paklobutrazol dan media tanam terhadap pembungaan bugenvil, Bougainvillea spectabillis di area berpolusi udara
Abstrak: Penelitian ini dilakukan untuk mengetahui komposisi media dan mencari konsentrasi paklobutrazol yang tepat dan interaksinya dalam menstimulasi pembungaan bugenvil (Bougainvillea spectabillis) di area berpolusi udara. Penelitian ini dilaksanakan di median jalan tol jagorawi KM 43, Bogor mulai April sampai denagn Nopember 2005. Penelitian menggunakan rancangan acak kelompok dua faktor. Faktor pertama adalah media tanam yakni campuran tanah: pupuk kandang = 1:1 (v/v), tanah pupuk kandang pasir = 1:1:3 (v/v), dan tanah pupuk kandang: sirtu =1:1:3 (v/v). Faktor kedua yaitu konsentrasi paklobutrazol yang terdiri atas 0 ppm, 250 ppm, 500 ppm, dan 700 ppm. Percobaan terdiri atas 12 kombinasi perlakuan yang diulang tiga kali atau disusun dalam tiga blok. Tiap satuan percobaan terdiri dari satu tanaman, sehingga jumlah tanaman seluruhnya adalah 36 tanaman. Pada penelitian ini bahan tanaman yang digunakan adalah stek tanaman bugenvil dengan panjang 30 cm dan diameter batang 1.5 cm. Pengakaran stek menggunakan media tanah pupuk kandang sekam = 1:1:1 (v/v). Setelah stek bugenvil berakar dilakukan repotting ke media sesuai dengan perlakuan. Aplikasi paklobutrazol dilaksanakan dua kali yaitu pada 4 dan 8 minggu setelah tanam. Pengamatan dilakukan setiap minggu sekali meliputi pertambahan tinggi tanaman, pertambahan cabang primer, pertambahan cabang sekunder, pertambahan cabang tersier, jumlah bunga cluster, jumlah bunga non cluster, jumlah bunga total, jumlah klorofil, dan warna bunga. ...
Keyword: 

Judul: Pembungaan Bugenvil Bunga Putih Dengan Rekayasa Zat Penghambat Tumbuh Dan Media Tanam Pada Lingkungan Berpolusi Udara
Abstrak: Bugenvil (Bougainvillea spectabilis Willd) atau yang lebih dikenal dengan sebutan bunga kertas merupakan salah satu jenis tanaman tropis yang sudah sangat popular di Indonesia. Penelitian ini bertujuan untuk mengetahui ketebalan lapisan media penghambat pertumbuhan akar dan konsentrasi zat penghambat tumbuh yang paling efektif untuk menstimulasi pembungaan pada tanaman bugenvil. Rancangan percobaan yang digunakan adalah Rancangan Acak Kelompok faktorial terdiri dari dua faktor yaitu ketebalan kerikil sebagai media penghambat pertumbuhan akar 0 cm, 5 cm dan 10 cm , serta konsentrasi paclobutrazol 0 ppm, 50 ppm, 100 ppm, 200 ppm. Hasil yang didapat dari penelitian ini menunjukkan bahwa penanaman bugenvil di tepi jalan ataupun median jalan yang paling cepat dan banyak menghasilkan bunga menggunakan media penghambat setebal 10 cm dan diberi zat penghambat tumbuh (paclobutrazol) dengan konsentrasi 200 ppm, walaupun demikian pengaruh 200 ppm tidak berbeda nyata dengan perlakuan 100 ppm, sehingga disarankan penggunaan media 10 cm dan 100 ppm paclobutrazol untuk menstimulasi pembungaan.
Keyword: bugenvil, polusi udara, media, paclobutrazol

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