Judul: Analisis efektifitas iklan televisi kecap cap Bango dan brand equity produk kecap (Studi kasus di Kota Bogor)
Abstrak: Besarnya potensi pasar kecap Indonesia dengan jumlah penduduk yang mencapai 217.9 juta jiwa pada tahun 2004 (BPS, 2005), dan konsumen kecap yang relatif beragam, mulai dari rumah tangga hingga restoran memicu para produsen kecap untuk meningkatkan dan memperkuat ekuitas merek mereka di mata konsumen dan terus berupaya mengembangkan usahanya. Kondisi persaingan yang semakin tinggi mengharuskan para produsen kecap untuk menjadi merek yang pertama yang konsumen ingat. Tentu tidak semuanya berhasil karena konsumen memiliki saringan yang disebut selective selection, yang berarti konsumen memberikan perhatian pada merek secara selektif.
Keyword: 

Judul: Analisis loyalitas konsumen dan sensitivitas harga beberapa merek kecap manis di kota Depok (kasus kecap merek bango, ABC, dan nasional)
Abstrak: Kecap Manis merupakan salah satu produk makanan tradisional yang bernilai gizi tinggi, sehingga selama ini kecap manis turut berperan dalam memenuhi kebutuhan gizi masyarakat Indonesia. Kecap manis sangat disukai masyarakat Indonesia dan peningkatan konsumsinya terjadi dari tahun ke tahun. Peningkatan konsumsi kecap manis diikuti dengan peningkatan jumlah produsen kecap manis terutama produsen skala besar. Peningkatan jumlah produsen kecap manis di Indonesia menyebabkan merek kecap manis yang beredar menjadi lebih beragam, sehingga konsumen menjadi lebih leluasa dalam memilih. Tingginya keleluasaan konsumen dalam memilih merek kecap menyebabkan setiap produsen perlu bersaing untuk dapat mempertahankan atau meningkatkan pangsa pasarnya. Persaingan diantara produsen kecap ini ditunjukkan dengan adanya perubahan pangsa pasar merek kecap, terutama pangsa pasar kecap merek Bango dan Nasional yang terus meningkat dan pangsa pasar kecap ABC yang terus menurun selama tahun 2001-2005. Persaingan ini berlangsung semakin ketat ketika rata-rata indeks loyalitas konsumen kecap menurun sebesar lima persen dari tahun 2005 ke tahun 2006.
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