Judul: Pengelolaan Pemangkasan Teh (Camellia sinensis (L.) O. Kuntze) di Unit Perkebunan Malabar, PT Perkebunan Nusantara VIII, Bandung, Jawa Barat.
Abstrak: Magang ini dilakukan di Unit Perkebunan Malabar, PT Perkebunan Nusantara VIII, Bandung, Jawa Barat. Pelaksanaan magang terdiri dari beberapa pekerjaan berdasarkan rekomendasi dari pihak kebun, diantaranya sebagai karyawan pelaksana satu bulan, sebagai pendamping mandor satu bulan, dan sebagai pendamping mandor besar dua bulan. Tujuan umum dari kegiatan magang adalah untuk memperluas pengetahuan mahasiswa magang tentang aspek teknis dan manajerial perkebunan teh, mengasah keterampilan, dan pengalaman kerja. Adapun tujuan khusus yaitu untuk memperoleh informasi mengenai pengelolaan pemangkasan teh di Unit Perkebunan Malabar. Metode yang dilaksanakan selama kegiatan magang yaitu metode langsung dan tidak langsung. Metode langsung dilakukan secara aktif mengikuti dan mengamati kegiatan teknis di lapangan dan wawancara. Metode tidak langsung dilakukan dengan mengumpulkan laporan manajemen, arsip kebun, dan jurnal penelitian teh. Hasil magang menyatakan bahwa pertumbuhan tunas lebih banyak tumbuh pada diameter cabang <1 cm, sedangkan pertumbuhan tunas paling sedikit tumbuh pada diameter cabang ≥2 cm.
Keyword: arsip perusahaan, diameter cabang, tunas

Judul: Pengelolaan Pemangkasan Tanaman Teh (Camellia sinensis L. (O) Kuntze) di Perkebunan Purbasari, PT. Perkebunan Nusantara VIII, Pangalengan, Jawa Barat.
Abstrak: Tanaman teh adalah salah satu komoditas yang berkontribusi dalam devisa Indonesia. Kestabilan produksi dapat dicapai dengan pengelolaan kegiatan pemangkasan oleh perkebunan. Kegiatan magang dilaksanakan bulan Februari hingga Juni 2017 di Perkebunan Purbasari PTPN VIII Jawa Barat. Kegiatan magang bertujuan untuk meningkatkan pengetahuan dan pengalaman mahasiswa dalam aspek budidaya teh secara umum dan khusus mempelajari pengelolaan pemangkasan tanaman teh di Perkebunan Purbasari PTPN VIII Jawa Barat. Kegiatan magang yang dilakukan meliputi aspek teknis sebagai karyawan harian lepas (KHL) dan aspek manajerial sebagai pendamping mandor, serta pendamping mandor besar. Hasil pengamatan yang diperoleh dibandingkan dengan standar kebun, dianalisis kualitatif, kuantitatif dengan metode analisis deskriptif dan menggunakan uji t-student. Kegiatan pemangkasan di Perkebunan Purbasari sudah mengikuti standar operasional dengan ketinggian rata-rata sebelum kegiatan pemangkasan mencapai 163.81 cm. Kegiatan pemangkasan menghasilkan ketinggian 49.61 cm dengan persentase kerusakan cabang 12.66% yang dipengaruhi oleh usia tenaga kerja dan pengalaman kerja pemangkasan. Tipe pemangkasan produksi yang diterapkan adalah pemangkasan kepris karena keputusan manajemen terkait keterbatasan tenaga kerja dan pengguanaan alat pangkas berupa sabit pangkas. Pertumbuhan pucuk setelah kegiatan pemangkasan terjadi pada minggu ke-3 dan pemetikan setelah kegiatan pemangkasan dapat menghasilkan 9,761 kg pucuk setelah 3 bulan kegiatan pemangkasan.
Keyword: produksi, ketinggian, pangkasan, kepris, pucuk

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