Judul: Analisis Perbandingan Sikap Dan Minat Konsumen Dalam Membeli Sayuran Anorganik Dan Organik Di Kota Bogor
Abstrak: Pengembangan sayuran organik di Bogor masih mengalami kendala. Salah satunya adalah kegagalan dalam menjaga kepercayaan pasar. Kegagalan tersebut tercermin dari perilaku konsumen yang enggan membeli produk. Hal ini menunjukkan kepercayaan masyarakat mengenai atribut dan manfaat produk organik (sayuran organik) yang belum mampu memenuhi kebutuhannya dan menciptakan kepuasan di benak konsumen. Penelitian ini bertujuan untuk 1) Mengidentifikasi persepsi konsumen terhadap sayuran anorganik dan organik, 2) Menganalisis pengaruh bauran pemasaran, sikap konsumen, dan minat konsumen terhadap keputusan pembelian sayuran anorganik dan organik, 3) Merumuskan strategi pemasaran sayuran anorganik dan organik. Penelitian ini dilakukan pada bulan Februari-April 2016 di enam kecamatan Kota Bogor. Jumlah responden sebanyak 100 orang dipilih secara purposive sampling dengan kriteria bahwa responden telah melakukan pembelian dan mengkonsumsi sayuran anorganik dan organik. Penelitian ini menggunakan data primer yang didapatkan melalui wawancara dengan menggunakan instrumen kuesioner berskala likert. Data sekunder didapatkan melalui kajian pustaka dari berbagai sumber yang relevan. Analisis data menggunakan analisis deskriptif, uji beda dan Structural Equation Modelling. Hasil penelitian menunjukkan bahwa ada perbedaan antara responden yang memilih sayuran anorganik dan organik. Analisis terhadap bauran pemasaran, sikap konsumen, minat konsumen, secara langsung berpengaruh positif dan signifikan terhadap keputusan pembelian. Namun ada tiga yang tidak berpengaruh dan signifikan antar variabelnya, yaitu hubungan antara minat konsumen sikap konsumen, dan bauran pemasaran.
Keyword: Bauran pemasaran, keputusan pembelian, minat konsumen, sayuran anorganik dan organik, sikap konsumen

Judul: Analisis Preferensi Konsumen Terhadap Atribut Sayuran Organik di Kota Bogor
Abstrak: Organic vegetables are now widely available in the markets; it has brought a tight inter-brand competition in the market. The increased competition will lead the organic vegetable producer to understand their costumers’ interest in buying organic vegetables offered. This study aims to identify the characteristics of the consumer and the buying decision process using descriptive analysis, and analyze attributes preferences in the organic vegetables as well as combinations of attributes that are most preferred by consumers using conjoint analysis. The attributes that will be examined includes; price, packaging, labeling, and diversity/variety of organic vegetables. The data used are primary data obtained from questionnaires to 100 respondents, analyzed using descriptive and analytical tools with the conjoint analysis software SPSS for windows. The results showed that the organic label is the most important attribute in organic vegetable products. While the combination most preferred by consumers is price 15% lower than the average price of non-organic vegetables, plastic box packaging, has an organic label, and has a lot of diversity/variety of organic vegetables.
Keyword: Consumer Preferences, Organic, Conjoint, Attributes

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