Judul: Pengamatan Penyakit Penting Tanaman Tebu (Saccharum officinarum L.) di KEcamatan Babakan Wilayah Kerja Pabrik Gula Tersana Baru PT. Perkebunan XIV (Persero) Kabupaten Cirebon
Abstrak: Tujuan Praktek Lapang ini adalah untuk mengamati penyakit-penyakit penting tanaman tebu serta penilaian persentase serangannya. Selain itu diadakan pula pengamatan terhadap penyakit-penyakit lainnya, hama-hama penting, keadaan lingkungan serta cara budidaya yang mungkin dapat mempengaruhi perkembangan penyakit. Kebun contoh terdiri dari dua buah Kebun Bibit Datar (KBD) milik pabrik dengan jenis tebu BZ.148 dm B0.653 berumur empat bulan, lima buah kebun Tebu Rakyat Intensifikasi tanah Sawah untuk tanarnan pertama (TRIS I) dengan jenis tebu BZ.132 berumur tujuh sampai delapan bulan, BZ.148 berumur delapan sampai sembilan bulan, dan B0.655 berumur delapan sampai sembilan bulan, dan empat buah kebun Tebu Rakyat Intensifikasi tanah Sawah untuk tanaman keprasan (TRIS II) dengan jenis tebu BZ.132 berumur delapan bulan, BZ.148 berumur enam dan delapan bulan, dan B0.657 berumur delapan sampai sembilan bulan.
Keyword: 

Judul: Pengamtan Hama Penting Tanaman Tebu (Saccharum officinarum Linn.) di Kecamatan Babakan, Wilayah Kerja Pabrik Gula Tersana Baru PT. Perkebunan XIV (Persero) Kabupaten Cirebon
Abstrak: PraJstek lapang ini dilakukan di kebun tebu bibit datar (KBD) milik pabrik gula, serta kebun tebu giling (KTG) mile rakyat yang meliputi tanaman TRIS I dan TRIS II. Varietas tebu yang dijumpai di lapang adalah BZ 132, BZ 148 dan BO 653. Praktek lapang ini dimulai dari tanggal 6 Pebruari 1985 sampai dengan tanggal 4 Mei 1985. Tujuan praktek lapang adalah mengamati hama penting tanaman tebu, luas serangan serta tindakan pengendalian yang dilakukan. Pengmbilan sampel kebun coatoh dilakukan secara sistematis, dengan luasan 10 persen dari luas kebun tebu di daerah lokasi praktek lapang. Pada tiap kebun contoh diambil petak-petak contoh, kemudian dari petak contoh diambil bak-bak contoh dan aJshirnya dari bak contoh diambil barisan tanaman (jolang) contoh yang &an diamati.
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