Judul: Manajemen Pemangkasan Tanaman Teh (Camellia sinensis (L.) O. Kuntze) di Unit Perkebunan Tambi, PT Tambi, Wonosobo, Jawa Tengah.
Abstrak: Program magang dilaksanakan di Unit Perkebunan Tambi, PT Tambi, Wonosobo, Jawa Tengah pada bulan Februari hingga Juni 2017. Magang bertujuan untuk meningkatkan pengetahuan, pengalaman, dan kemampuan profesional penulis dalam mengelola perkebunan teh yang diperoleh dari lapangan, terutama pada kegiatan pemangkasan. Kriteria-kriteria sebelum dilaksanakan pemangkasan yaitu tinggi tanaman > 110 cm, diameter bidang petik ± 120 cm, dan persentase pucuk burung > 70%. Pengamatan saat pemangkasan yaitu tinggi pangkasan, alat pangkas, tipe/jenis pangkasan, persentase kerusakan cabang, waktu pemangkasan, luas areal pangkasan, jumlah tenaga kerja dan kapasitas pemangkas, serta daur/gilir pangkasan. Pengamatan setelah pemangkasan yaitu pertumbuhan tunas baru. Hasil pengamatan tinggi tanaman sebelum pemangkasan adalah < 110 cm dengan diameter bidang petik < 120 cm, dan persentase pucuk burung > 70%. Produktivitas tertinggi dicapai pada tahun pangkas III dan menurun pada tahun pangkas IV. Tipe atau jenis pangkasan yang dilakukan di UP Tambi adalah pemangkasan bersih menggunakan sabit pangkas. Gilir pangkas di UP Tambi adalah 4-5 tahun. Kerusakan cabang akibat pemangkasan tidak dipengaruhi oleh lama bekerja dan usia tenaga kerja.
Keyword: kerusakan cabang, pucuk burung, pucuk peko, serasah hasil pangkasan, tinggi pangkasan

Judul: Manajemen Pemangkasan Teh (Camellia sinensis (L.) O.Kuntze) di Unit Perkebunan Tambi, PT Tambi, Wonosobo, Jawa Tengah
Abstrak: Manajemen pemangkasan penting dalam pemeliharaan tanaman teh untuk mendukung produksi maksimum dengan kualitas baik. Tujuan kegiatan magang untuk meningkatkan pengetahuan dan keterampilan dalam teknik budidaya dan manajemen pemangkasan tanaman teh di lapangan. Kegiatan magang telah meningkatkan keterampilan dalam beberapa aspek teknis yang diikuti, salah satunya sebagai tenaga pemangkas dengan prestasi kerja sebesar 0.003 ha HK-1. Magang dilaksanakan di Unit Perkebunan Tambi, PT Tambi, Wonosobo, Jawa Tengah dari Januari hingga Mei 2019. Berdasarkan kriteria diameter bidang petik, persentase pucuk burung, dan penurunan produktivitas pada tahun pangkas ke-4, tanaman teh tahun pangkas ke-4 telah memenuhi syarat untuk dilakukan pemangkasan. Produktivitas teh optimum pada tahun pangkas ke-3. Unit Perkebunan Tambi melaksanakan tipe pangkas bersih sebagai pangkas produksi. Pemangkasan dilaksanakan pada Semester I (Februari-Mei) dan Semester II (Oktober-November). Gilir pangkas antara 4-5 tahun berdasarkan ketinggian tempatnya. Tinggi tanaman setelah dipangkas, yaitu 50.53 cm yang masih berada di bawah standar di Unit Perkebunan Tambi, yaitu 55 cm. Semakin lama pengalaman kerja tenaga pemangkas, maka semakin kecil persentase kerusakan cabang yang dihasilkan.
Keyword: gilir pangkas, kerusakan cabang, pangkasan bersih, pucuk burung, tinggi tunas

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