Judul: Keanekaragaman dan Kelimpahan Arthropoda pada Perkebunan Teh 0-1000 Meter dari Permukiman Warga Di PTPN VIII Kebun Ciater, Subang.
Abstrak: Terdapat berbagai jenis Arthropoda yang berasosiasi dengan tanaman teh. Arthropoda herbivor merupakan arthropoda yang dapat menurunkan produksi teh. Perbedaan kondisi di lapang dapat memengaruhi keanekaragaman, kelimpahan, dan peran Arthropoda pada suatu ekosistem. Penelitian bertujuan mengetahui hubungan jarak kebun dari permukiman warga terhadap keanekaragaman dan kelimpahan Arthropoda beserta proporsi peranannya pada perkebunan teh PTPN VIII Ciater, Subang. Penelitian dilakukan dari bulan Desember 2016 hingga Februari 2017. Lokasi pengambilan sampel di perkebunan teh yang berjarak 0-250 (lokasi A), 250-500 (lokasi B), 500-750 (lokasi C), dan 750-1000 m (lokasi D) dari permukiman warga. Metode pengambilan sampel menggunakan sweep net, branches beating, pitfall trap, dan light trap. Hasil penelitian menunjukkan jumlah Arthropoda yang diperoleh selama pengamatan lapang adalah 10 204 individu yang terdiri dari 5 kelas, 18 ordo, dan 100 famili. Keanekaragaman dan Kelimpahan Arthropoda tertinggi terdapat pada lokasi D (750-1000 m dari permukiman warga). Lokasi A (0-250 m dari permukiman warga) memiliki dominansi terhadap beberapa jenis Arthropoda herbivor. Proporsi peranan Arthropoda herbivor, predator, parasitoid, detrivor, dan lainnya pada pertanaman teh secara berturut-turut adalah 41.96%, 38.49%, 8.79%, 8.06%, dan 0.11%. Penelitian ini menunjukkan bahwa jarak perkebunan teh yang semakin jauh dari permukiman warga memiliki keanekaragaman yang tinggi dan kelimpahan terhadap Arthropoda dominan yang rendah.
Keyword: arthropoda, keanekaragaman, kelimpahan, permukiman warga, teh

Judul: Keanekaragaman dan Kelimpahan Arthropoda pada Perkebunan Teh 0-300 meter dari Tepi Hutan di PTPN VIII Gunung Mas, Kabupaten Bogor
Abstrak: Knowledge of pests and natural enemies diversity and abundance on the tea plantation is the essential considetarion for pest control descision by integrated pest management system. This study, conducted in PTPN VIII Gunung Mas tea plantation during 3 months, considered the effect of forest edge through tea boundaries (0-100, 100-200, 200-300 meters from forest edge) on diversity, abundance and family function proportion of Arthropods by pitfall trap, sweep net and branches beating methods for a week. Totally, the classes of Arthropod are Arachnida (3 orders, 19 families, and 1383 species), Diplopoda (3 orders, 6 families, and 27 species) and Insecta (13 orders, 73 families, and 5048 species). The 0-100 meters tea plantation from forest edge has highest number of Arthropods diversity. The highest number of Arthropods abundance is in 100-200 meters from forest edge. A lot of Arthropods have a role as predator on tea plantation (55.53% from total Arthropods). The proportions of herbivore, detrivore, parasitoid, and other are 21.52%, 20.94%, 1.38%, and 0.63%.
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