Judul: Pengaruh Pemupukan Nitrogen dan Jarak Tanam terhadap Pertumbuhan dan Produksi Stevia Rebaudiana Bertoni M.
Abstrak: Stevia rebaudiana Bertoni 1~1. adalah tanaman yang dapat menghasilkan bahan pemanis alami dan merupakan tanaaan yang masih baru di Indonesia. Peningkatan kebutuhan gula di Indonesia dan kekawatiran menggunakan bahan pemahis sintetik menyebabkan pengembangan tanaman stevia menjadi lebih penting. Penelitian ini bertujuan mengetahui pengaruh pernupukan Nitrogen dan jarak tanam terhadap pertumbuhan dan produksi tanaman stevia. Penelitian dilaksanakan d i Kebun Percobaan Pasir Sarongge, Kabupaten Cianjur dari tanggal 14 Oktober 1985 sampai 15 Mei 1986. Bahan tanaman berupa stek pucuk klon BPP 72. Dosis pupuk adalah 1 g TSP/tanaman dan 1 g KC1/ tanaman yang diherikan 1 MST dan seminggu setiap setelah panen serta pupuk kandang kotoran ayam 150 &tanaman diberikan pada saat tanam.
Keyword: 

Judul: Pengaruh naungan dan pemupukan nitrogen terhadap saat pembuangan tanaman Stevia rebaudiana Bertoni M.
Abstrak: Tujuan penelitian ini ialah mempelajari pengaruh naungan dan pemupukan nitrogen, serta interaksinya terhadap saat pembungaan tanaman Stevia rebaudiana Bert. M. Penelitian ini dilaksanakan di rumah kaca BPP Bogor dengan perlakuan naungan 0%, 39.4% dan 59.5% yang dikombinasikan dengan perlakuan pemupukan 1 gram urea dan tanpa pupuk urea. Hasil analisis data menunjukkan bahwa naungan menunda saat pembungaan tanaman stevia, tetapi menurunkan produk bahan kering. Tingkat naungan 59.5% menurunkan persentase tanaman yang berbunga dan kecepatan pembungaan stevia. Tidak ada pengaruh interaksi naungan dan pemupukan N terhadap saat pembungaan, pembungaan tanaman ini tidak dipengaruhi oleh nisbah C/N.
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