Judul: Aspek pengendalian gulma di perkebunan sagu [Metroxylon spp.] di PT. National Timber and Forest Product, Selat Panjang, Riau
Abstrak: Tujuan pelaksanaan kegiatan magang untuk meningkatkan keterampilan pengetahuan mahasiswa mengenai teknis budidaya sagu di perkebunan, meningkatkan kemampuan mahasiswa dalam memasuki dunia kerja, memperoleh pengetahuan praktis dari pelaksanaan magang di perkebunan, mempelajari pengaruh gulma terhadap pertumbuhan tanaman sagu, mempelajari efektivitas pengendalian gulma secara kimia dan mekanis. Kegiatan magang tersebut dilaksanakan di PT. National Timber and Forest Product, Kecamatan Tebing Tinggi, Kabupaten Meranti, Provinsi Riau pada bulan Februari – Juni 2009.
Keyword: 

Judul: Pengelolaan Perkebunan Sagu (Meltroxylon spp) Aspek Persemaian di PT. National Timber and Forest Product Unit HTI Murni Sagu. Selat Panjang, Riau
Abstrak: Kegiatan magang bertujuan untuk mendapatkan pengetahuan dan keterampilan mahasiswa dalam hal teknis budidaya tanaman sagu. Secara khusus kegiatan magang bertujuan untuk mengetahui dan menganalisis teknis sistim persemaian sagu di PT. National Timber and Forest Product Unit HTI Murni Sagu. Kegiatan magang diIaksanakan dari tanggaI 7 Februari 2006 dan berakhir pada tanggal 7 Juni 2006 di' perkebunan sagu PT. National Timber and Forest Product Unit HTI Murni Sagu. Selat Panjang, Riau. Kegiatan magang dilakukan dengan cara mengikuti secara langsung seluruh kegiatan yang ada di kebun dan melakukan pengamatan langsung terutama mengenai kegiatan budidaya tanaman sagu. Selain itu juga dilakukan pengumpulan data sekunder dan primer yang berhubungan dengan leknis budidaya sagu pada umumnya dan teknis persemaian bibit sagu pada khususnya. Data sekunder diperoleh dari buku-buku, laporan-laporan, dan diskusi dengan pihak kebun mengenai kegiatan budi daya tanaman sagu. Data primer diperoleh dengan membuat percobaan di persemaian, data yang diperoleh dari percobaan persemaian yang menggunakan dianalisis dengan uji DMRT pada taraf 5%.
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