Judul: Pengaruh Pemupukan Nitrogen terhadap Pertumbuhan dan Produksi Tanaman Pegagan (Centella asiatica L. Urban) di Dataran Tinggi.
Abstrak: Penelitian ini dilaksanakan untuk mengetahui pengaruh dosis pupuk nitrogen terhadap pertumbuhan dan produksi tanaman pegagan (Centella asiatica L. Urban), serta memperoleh informasi dosis pupuk nitrogen optimum yang dapat meningkatkan pertumbuhan dan produksi tanaman pegagan di dataran tinggi. Penelitian dilaksanakan di Kebun Percobaan Gunung Putri Balai Penelitian Tanaman Obat dan Aromatik (Ballitro) Pacet, Cianjur, Jawa Barat pada ketinggian 1 500 m di atas permukaan laut (dpl) pada tanah Andisols. Percobaan menggunakan rancangan kelompok lengkap teracak (RKLT) dengan faktor tunggal pemupukan nitrogen dan terdiri atas lima taraf dosis pupuk nitrogen yaitu 0 kg N/ha, 67.5 N/ha, 135 kg N/ha, 202.5 kg N/ha, dan 270 kg N/ha. Setiap perlakuan diulang sebanyak lima kali sehingga terdapat 25 satuan percobaan. Sumber bibit yang digunakan adalah bibit pegagan aksesi Boyolali yang berumur empat minggu. Penanaman dilakukan pada petak berukuran 2 m x 3 m dengan jarak tanam 30 cm x 40 cm. Pemupukan nitrogen dibagi menjadi tiga kali aplikasi yaitu pada saat tanam, 40 hari setelah tanam (HST), dan 80 HST. Hasil penelitian menunjukkan bahwa perlakuan pemupukan nitrogen berpengaruh nyata meningkatkan jumlah daun tanaman induk, panjang daun, dan lebar daun. Selain itu, pemupukan nitrogen berpengaruh nyata meningkatkan jumlah sulur primer (2 dan 16 MST), panjang sulur primer (4 dan 6 MST), jumlah buku (4 MST), jumlah sulur sekunder (10 MST), panjang tangkai daun (16 MST), dan diameter tangkai daun (8 MST). Pemupukan nitrogen berpengaruh sangat nyata meningkatkan bobot panen pada 5 BST dan kandungan nitrogen dalam jaringan daun. Pemupukan 270 kg N/ha meningkatkan bobot kering total panen pada 5 BST sebanyak 89.94 % dibandingkan perlakuan tanpa pemupukan. Dosis pupuk nitrogen optimum untuk bobot kering total pada panen 5 BST adalah 216. 40 kg N/ha.
Keyword: 

Judul: Pengaruh Pemupukan Fosfor Terhadap Pertumbuhan Dan Produksi Tanaman Pegagan (Centella Asiatica (L.) Urban) Di Dataran Tinggi
Abstrak: Penelitian ini dilakukan untuk mengetahui pengaruh pemupukan fosfor terhadap pertumbuhan dan produksi tanaman pegagan, serta memperoleh informasi dosis optimum pupuk fosfor yang dapat meningkatkan pertumbuhan dan produksi tanaman pegagan (Centella asiatica L. Urban) di dataran tinggi. Penelitian ini dilaksanakan pada bulan Oktober 2008-April 2009 di Kebun Percobaan Gunung Putri Cipanas Balai Penelitian Tanaman Obat dan Aromatik (Balittro), Pacet, Kabupaten Cianjur, pada jenis tanah Andisols dengan ketinggian tempat 1 500 m di atas permukaan laut (dpl). Penelitian ini menggunakan metode Rancangan Kelompok Lengkap Teracak (RKLT) dengan satu faktor yaitu pemupukan fosfor. Dosis pupuk fosfor yang digunakan terdiri atas 5 taraf yaitu 0, 30, 60, 90, dan 120 kg P2O5/ha. Percobaan ini menggunakan 5 ulangan dengan 5 petak setiap ulangan sehingga total satuan percobaan adalah 25 satuan percobaan. Bahan tanam yang digunakan adalah bibit pegagan aksesi Boyolali. Bibit ditanam di lapang dengan jarak tanam 30 cm x 40 cm dengan ukuran petakan 2 m x 3 m sehingga terdapat 50 tanaman per petak. Jadi total bibit yang digunakan
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