Judul: Kajian Sistem Pengendalian Bahan Baku Teh Botol Frestea Pada PT. Coca-Cola Bottling Indonesia Central Java Semarang
Abstrak: Dewasa ini industri minuman teh botol semakin diminati dan tumbuh seiring dengan meningkatnya minat masyarakat terhadap minuman siap saji. Dalam kurun waktu dua tahun terakhir, persaingan di industri minuman teh botol semakin ketat dengan masuknya frestea sebagai pemain baru. Meningkatnya jumlah perusahaan teh siap saji menyebabkan perusahaan harus bersaing untuk mendapatkan konsumen, dengan mutu produk yang baik dan harga terjangkau. Hal ini harus didukung oleh pengadaan bahan baku yang optimal dan berkesinambungan sehingga kontinuitas produksi dapat terjamin dengan demikian dapat menjamin pemenuhan kebutuhan masyarakat.
Keyword: 

Judul: Analisis preferensi konsumen terhadap frestea teh kita dan teh sosro kemasan botol di Kota Bogor
Abstrak: Teh merupakan minuman yang mudah dalam mendapatkan bahan bakunya serta minuman khas (tradisional) bagi penduduk Indonesia. Teh dijual dalam berbagai bentuk yaitu (1) dalam bentuk teh siap minum yang dikemas dalam kemasan karton dan kemasan botol, (2) dalam bentuk curah dimana konsumen harus menyeduhnya dan mengeluarkan ampasnya atau yang lebih dikenal dengan teh celup. Frestea merupakan salah satu produk teh kemasan botol yang diproduksi oleh PT. Coca-Cola Bottling Indonesia. Minuman ini termasuk dalam minuman teh siap saji beraroma melati yang dikemas dalam botol dan tetra-pack (kotak). Frestea adalah produk teh kemasan botol yang masih baru dikeluarkan perusahaan yaitu pada bulan Juni 2002, sebagai produk yang masih baru dipasaran perusahaan perlu mengetahui bagaimana perilaku konsumen terhadap Frestea kemasan botol untuk dapat menemukan strategi yang tepat untuk menghadapi persaingan minuman teh dalam kemasan.
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