Judul: Manajemen pemetikan tanaman teh (Camellia sinensis (L.) O. Kuntze) di PT Rumpun Sari Kemuning, Karanganyar, Jawa Tengah
Abstrak: This program was apprentice activity have intent to increase the knowledge and experience about pick aspect management and directly involve in the field and can solve the problem happens in the field. The internship program was conducted in PT Rumpun Sari Kemuning Karanganyar, Solo, Central Java almost for four months since February until July 2014. The implementation of apprentice is direct work activity and attend technical activities in the field. Observation is covering the that pluck section surface, diameter pluck section surface, the capacity of plucker thicknes of leaf, conservancy of tip leaf, productivity by age after cutting, pick analysis, bud analysis, services of picker. The result of observations were obtained there are some aspects in picking PT Rumpun Sari Kemuning during internship activities indicate that the execution time and shift plucking stringed jendangan not meet the standards set, still need improvement to meet the standards company, but the production can meet the needs of the target because at the top of the analysis result of the passage remains in compliance with the passage of medium quality standard.
Keyword: Bogor Agricultural University (IPB), tea., analysis tip, plucking pick

Judul: Pengelolaan pemangkasan tanaman teh (Camellia sinensis (l.) O. Kuntze) di perkebunan medini, PT Rumpun sari medini, Kendal, Jawa Tengah
Abstrak: Internship activities carried out in Medini plantation PT Rumpun Sari. Medini Kendal, Central Java for four months from February until June 2011. Internship method is conducting garden has been established by both techical and managerial aspects. Level of work place as field worker for one month. Data collection activities are used direct and indirect methods, Indrirect method used to obtain secondary data. Medini plantation is located at an altitude of 90-1 775 m as with an area 309.28 ha. Pruning is an essential maintenance activities carried out in tea palntations. Clean prunninh is being done on plantation medini with rotation 4 years. Mowed area that is 25% of tea total crop yield by 55-65 cm. clipping height.
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