Judul: Pengelolaan Pemangkasan Tanaman Teh (Camellia sinensis (L.) O. Kuntze di Unit Perkebunan Bedakah, PT Tambi, Wonosobo, Jawa Tengah.
Abstrak: Kegiatan magang telah dilaksanakan pada bulan Februari sampai Juni 2017 di Unit Perkebunan Bedakah PT Tambi, Wonosobo, Jawa Tengah. Kegiatan magang bertujuan untuk meningkatkan pengetahuan dan kemampuan teknis budidaya teh secara langsung terutama tentang pengelolaan pemangkasan. Pengelolaan pemangkasan di Unit Perkebunan Bedakah sudah cukup baik dan mendekati standar yang telah ditetapkan. Pengamatan selama magang dilakukan dengan mengikuti kegiatan teknis secara langsung (penyulaman, pemeliharaan, pemetikan, pemangkasan, administrasi dan manajerial), serta mengumpulkan data sekunder dari arsip dan laporan perusahaan. Hasil magang menunjukan bahwa tinggi tanaman yang dipangkas < 120 cm dan diameter bidang petik sudah melebar yakni 104,91 cm dengan persentase pucuk burung sebesar 72,49%. Tinggi pangkasan yaitu 47,17 cm telah mendekati standar yang ditetapkan Unit Perkebunan Bedakah yaitu 50 cm. Gilir pangkas yang ditetapkan Unit Perkebunan Bedakah adalah 4-5 tahun. Produktivitas tanaman teh maksimum pada tahun pangkas 3 dan menurun pada tahun pangkas 4. Rata-rata bobot basah serasah pangkasan teh yaitu 2,76 kg per pohon. Serasah pangkasan menghasilkan bahan organik yang dapat digunakan sebagai penambah unsur hara di dalam tanah.
Keyword: gilir pangkas, pucuk burung, serasah, tinggi pangkas

Judul: Pengelolaan Pemangkasan Teh (Camellia sinensis (L.) O. Kuntze) di Unit Perkebunan Bedakah, PT Tambi Wonosobo, Jawa Tengah. Dibawah
Abstrak: Kegiatan magang telah dilaksanakan di Unit Perkebunan Bedakah PT Tambi, Wonosobo, Jawa Tengah pada bulan Februari sampai Juni 2018. Kegiatan magang dilakukan dengan mengerjakan dan mengamati kegiatan teknis pemangkasan tanaman teh. Hasil magang menunjukan bahwa Unit Perkebunan Bedakah melaksanakan tipe pangkas bersih sebagai pangkas produksi yang paling umum dilakukan. Gilir pangkas yang ditetapkan adalah 4-5 tahun. Produktivitas tanaman teh meningkat dari tahun pangkas pertama hingga tahun pangkas keempat, dan mengalami penurunan pada tahun pangkas kelima. Rata-rata tinggi tanaman sebelum dipangkas 98.04 cm dengan diameter bidang petik rata-rata 119.10 cm. Rata-rata persentase pucuk burung tanaman sebelum dipangkas sebesar 84.18%. Tinggi tanaman setelah dipangkas yaitu 53.63 cm. Tinggi tersebut telah mendekati standar Unit Perkebunan Bedakah yaitu 55 cm.
Keyword: gilir pangkas, pemangkasan teh, produktivitas, sistem pangkas

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