Judul: Pengaruh Berbagai Media Ringan untuk Taman Atap (Roof Garden ) terhadap Pertumbuhan Beberapa Jenis Tanaman Penutup Tanah (Groud Cover)
Abstrak: Percobaan ini adalah percobaan berfaktor tunggal dengan empat taraf perlakuan, yaitu media tanah ( kontrol ) , tanah + sabut kelapa, tanah + sekam padi dan tanah + sabut kelapa + sekam padi. Tanaman yang dicobakan adalah Aerva sanguinolenta Zebrina pendula dan Zoysia matrella. Peubah yang d i - Y amati adalah tinggi/panjang tanaman, jumlah cabang/pucuk, jumlah daun, persen penutupan tanah dan bobot segar tanaman. Rancangan percobaan yang digunakan adalah Rancangan Acak Lengkap dengan tiga ulangan. Tiga jenis tanaman yang dicobakan dianggap sebagai tiga buah percobaan paralel yang masing-masing lnendapat perlakuan yang sama yaitu komposisi media.
Keyword: 

Judul: Mempelajari sifat fisik dan kimia beberapa komposisi media ringan untuk taman atap ( Roof Garden )
Abstrak: Penelitian ini bertujuan untuk mempelajari sifat fisik dan kimia berbagai komposisi media ringan untuk taman atap, yaitu campuran tanah + gambut, tanah + sabut kelapa, tanah + sekam padi dan tanah + sabut + sekam. Rancangan percobaan yang digunakan adalah Rancangan Acak Lengkap sebagai rancangan lingkungan dan Rancangan Petak Terpisah sebagai rancangan perlakuan. Petak utama adalah tanaman, yaitu jagung dan bunga kertas (Zinnia sp.), sedangkan anak petak adalah komposisi media. Media tanah digunakan sebagai kontrol. Peubah yang digunakan untuk sifat fisik media adalah bobot isi dan air tersedia, sedangkan untuk sifat kimia adalah nisbah C/N dan pH media. Di samping itu dilakukan pengamatan visual gejala kekurangan hara pada tanaman yang tumbuh di setiap media. Hasil percobaan menunjukkan bahwa media tanah + gambut, dalam hal ini gambut sebagian besar sudah matang, mempunyai bobot isi sebesar 0.66 dan kandungan air tersedia 42.79 % berat kering, tetapi tidak berbeda nyata dengan air terse- dia pada media tanah. Nisbah C/N awalnya tinggi (> 20) dan pH rendah (6). Tanaman yang tumbuh di atasnya tidak menunjukkan gejala kekurangan hara N dan P yang menyolok...
Keyword: 

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