Judul: Keanekaragaman Spesies Rayap Tanah di Lingkungan Pemukiman Kota Bogor, Jawa Barat
Abstrak: Kebutuhan masyarakat Kota Bogor akan tempat tinggal semakin meningkat, sehingga mengubah kondisi lingkungan yang dapat memengaruhi keberadaan organisme pengganggu, terutama rayap tanah. Penelitian ini bertujuan untuk mengidentifikasi spesies rayap tanah dan keanekaragamannya di Kota Bogor, mengetahui karakteristik tanah dan cuaca, serta mengetahui intensitas kerusakan dan frekuensi serangan rayapnya. Penelitian dilakukan di 12 kelurahan contoh. Disetiap kelurahan contoh, ditanam 25 kayu umpan (2 x 2 x 46 cm) dari kayu pinus yang sebelumya telah diberi perlakuan tekanan uap air (105 ℃, 1 bar, 5 jam). Disetiap kelurahan contoh diambil tanah contoh. Data cuaca diukur di salah satu kelurahan contoh. Hasil penelitian menunjukkan bahwa spesies rayap yang ditemukan ada 3 jenis yaitu Microtermes sp., Macrotermes sp., dan Schedorhinotermes sp. Spesies rayap tanah di lingkungan pemukiman Kota Bogor didominasi oleh Microtermes sp. Karakteristik tanah dan cuaca sangat mendukung kehidupan rayap di Kota Bogor. Nilai frekuensi serangan rayap sebesar 38% (tinggi) dan nilai intensitas kerusakan kayu adalah 6-9.
Keyword: frekuensi serangan, intensitas kerusakan, karakteristik tanah, Pinus merkusii, tekanan uap panas

Judul: Serangan Rayap Tanah terhadap Tegakan Pohon di Kebun Raya Bogor
Abstrak: Pelestarian dan perlindungan terhadap pohon-pohon yang tersimpan di Kebun Raya Bogor (KRB) perlu dilakukan untuk menghindari kerusakan oleh berbagai macam penyakit maupun serangga perusak termasuk rayap. Penelitian bertujuan menganalisis frekuensi serangan rayap dan mengidentifikasi jenis rayapnya, menganalisis preferensi rayap terhadap jenis pohon, serta tingkat kerusakan pohon akibat serangan rayap di KRB. Penelitian dilakukan dengan menggunakan metode jalur sampling dengan Intensitas Sampling 20%. Hasil penelitian menunjukkan bahwa sebanyak 213 (100%) pohon contoh di KRB terserang rayap. Spesies rayap tanah yang ditemukan sekurang-kurangnya terdapat empat spesies yaitu Coptotermes curvignathus Holmgren, Macrotermes gilvus Hagen, Odontotermes javanicus Holmgren dan Nasutitermes matangensis Haviland. Rayap M. gilvus banyak ditemukan pada pohon Pterocarpus indicus, Dysoxylum spp., Shorea spp., dan Dimocarpus spp.. Rayap O. javanicus banyak ditemukan pada pohon Vitex cofassus, Dehaasia incrassata, Heritiera spp., dan Cordia spp.. Rayap N. matangensis banyak ditemukan pada pohon Canarium indicum, Dysoyylum spp., dan Sindora spp.. Rayap C. curvignathus banyak ditemukan pada pohon Araucaria columnaris, Agathis sp., dan Pinus spp. Tingkat kerusakan pohon contoh akibat serangan rayap sebesar 10-90%., Preservation and protection of trees stored in the Bogor Botanical Gardens (KRB) need to be done to prevent damage by various kinds of diseases and destructive insects including termites. This study aimed to analyze the frequency of termite attacks and to identify the type of termites, to analyze termite preferences for tree species, as well as the degree of tree damage due to termite attacks in KRB. The research was conducted using the path sampling method with a sampling intensity 20%. The results showed that as many as 213 (100%) sample trees in KRB were attacked by termites. There are at least four subterranean termite species found, namely Coptotermes curvignathus Holmgren, Macrotermes gilvus Hagen, Odontotermes javanicus Holmgren, and Nasutitermes matangensis Haviland. Termites M. gilvus are found in Pterocarpus indicus, Dysoxylum spp., Shorea spp., and Dimocarpus spp. Termites O. javanicus are found in Vitex colossus, Dehaasia incrassata, Heritiera spp., and Cordia spp. Termites N. matangensis is found in Canarium indicum, Dysoxylum spp., and Sindora spp. Termites C. curvignathus can be found in Araucaria columnaris, Agathis sp., and Pinus spp. The level of damage to sample trees due to termite attacks is 10-90%.
Keyword: Attack frequency, subterranean termites, termite preferences, tree health

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