Judul: Pemupukan NPK dan bahan organik tanaman teh muda pada seri pamegatan (Andic Humitropept, berliat halus, haloisit bercampur alofan, masam, isotermik, dalam, bergunung) di perkebunan Malabar-Pangalengan
Abstrak: Penelitian ini di latar belakangi oleh kurangnya penelitian pemupukan bahan organik terhadap tanaman teh pada Andisol yang mengandung bahan organik tinggi. Bahan organik diduga dapat meningkatkan produksi teh. Disam- ping itu pemupukan berdasarkan seri tanah masih belum banyak diperhatikan, sehingga pengelolaan lahan yang didasarkan pada sifat-sifat tanah yang lebih teliti belum diaplikasikan. Percobaan ini telah menguji pengaruh kombinasi pupuk NPK dan bahan organik (limbah pabrik teh) terhadap pertum- buhan tanaman teh muda varietas Cinyiruan 143 pada kan- tong-kantong plastik hitam. Penelitian ini dilakukan selama 10 bulan di lapangan dan 2 bulan di laboratorium. Rancangan yang digunakan adalah Rancangan Acak Leng- kap Faktorial, dengan perlakuan pemupukan NPK sebanyak 4 taraf (kg/ha) yaitu: PO (tanpa pupuk NPK), P1 ( 180 N, 30 P205, 60 K2O), P2 (360 N, 60 P2O5, 120 K20), P3 (720 N, 60 P205, 240 K₂O), bahan organik sebanyak 4 taraf yaitu BO...
Keyword: 

Judul: Pemupukan NPK dan Bahan Organik Tanaman Teh Muda (Camellia Sinensis L.) Pada Tanah Seri Pasir Kelar Malabar-Pandeglang
Abstrak: Penelitian ini dilatar belakangi oleh kurangnya penelitian pemupukan bahan organik terhadap tanaman teh pada Andisols yang dikenal mengandung bahan organik tinggi. Bahan organik diduga dapat meningkatkan produksi teh. Disamping itu pemupukan berdasarkan seri tanah masih belum banyak diperhatikan, sehingga pengelolaan lahan yang didasarkan pada sifat-sifat tanah yang lebih teliti belum diaplikasikan. Padahal di negara-negara maju setiap program pemupukan berdasarkan pada sifat-sifat tanah yang tercantum dalam seri. Percobaan ini telah menguji pengaruh kombinasi pupuk NPK dan bahan organik (limbah pabrik teh) terhadap pertumbuhan stek daun teh varitas PPS pada kantong-kantong plastik hitam berisi Andisols seri Pasir Kelar. Penelitian ini telah diamati dan dipelajari selama 15 bulan, walaupun data yang dibahas dalam masalah khusus ini merupakan data tiga bulan terakhir. Rancangan percobaan yang digunakan adalah Rancangan Acak Lengkap Faktorial, dengan perlakuan pemupukan NPK sebanyak 4 taraf (tanpa NPK/P0; 3.0571N,0.5095 P2O5,0.7813K2O / P1; 6.1142 N, 1.090 P2O5, 1.5626 K2O /P2; 12.2284 N, 2.0380 P2O5, 3.1252 K2O / P3 gram/pot/th), bahan organik sebanyak 4 taraf (tanpa bahan organik/B0, 200/B1, 400 /B2, 600/B3 gram/pot/th) dan dilakukan dengan 3 ulangan. Semua perlakuan diberi pupuk dasar berupa ..dst
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