A comparative analysis of experts’ and consumers’ perceptions of regionality in Australian wine purchase decisions

This study provides insight into consumers’ perception of regionality when purchasing regional wine in terms of regional specialisation for style, volume of production of the wine style, quality of the wine, heritage of the wine region and the distinctiveness of the wine styles produced in the wine regions of Australia. Data were collected from 203 Australian wine consumers through an online survey. The study compares the results of this study with Easingwood et al. [2011. The drivers of wine regionality. Journal of Wine Research, 22(1), 19–33.] study on experts’ opinion of regionality drivers. This paper will expand knowledge on how consumer involvement levels impact decisions relating to purchasing regional wine. This study is of value to academics and wine practitioners alike. It contributes to the wine literature by providing a new perspective on consumers’ perception and draws attention to the risk of drawing conclusions about wine consumption based on experts’ opinions as being reflective of the average consumers’ purchase decision-making.     

弧面分度凸轮机构在YB47型硬盒包装机包装轮中的应用

YB47型硬盒包装机包装轮的间歇运动对机器造成的冲击,易使包装轮包装过程产生铝箔纸破损或铝箔纸缺失现象.为此,利用弧面分度凸轮机构在高速运动中的高精度分度功能,应用于3号包装轮的驱动机构中,采用弧面分度凸轮机构代替槽轮机构,以减少分度机构对机器造成的冲击.应用效果表明,采用该机构的3号包装轮分度精度高,定位准确,传动平稳,结构紧凑,装配弧面分度凸轮机构步骤简化,操作方便.与YB45型硬盒包装机3号包装轮相比,YB47型包装机中的弧面分度凸轮机构有效减少了3号轮在高速运动中的振动和对机器的冲击;与YB45小包铝箔纸缺陷数据相比(5～9包/月),改进后YB47在3号轮包装过程中未出现铝箔纸破损或铝箔纸缺失现象,提高了烟包包装质量.     

经纬仪检定装置校准方法的研究

本文在分析经纬仪检定装置产生使用现状的基础上,提出了校准项目及校准方法,适用于多目标装置和多齿台装置的校准。     

Supporting exact indexing of arbitrarily rotated shapes and periodic time series under Euclidean and warping distance measures

Shape matching and indexing is important topic in its own right, and is a fundamental subroutine in most shape data mining algorithms. Given the ubiquity of shape, shape matching is an important problem with applications in domains as diverse as biometrics, industry, medicine, zoology and anthropology. The distance/similarity measure for used for shape matching must be invariant to many distortions, including scale, offset, noise, articulation, partial occlusion, etc. Most of these distortions are relatively easy to handle, either in the representation of the data or in the similarity measure used. However, rotation invariance is noted in the literature as being an especially difficult challenge. Current approaches typically try to achieve rotation invariance in the representation of the data, at the expense of discrimination ability, or in the distance measure, at the expense of efficiency. In this work, we show that we can take the slow but accurate approaches and dramatically speed them up. On real world problems our technique can take current approaches and make them four orders of magnitude faster without false dismissals. Moreover, our technique can be used with any of the dozens of existing shape representations and with all the most popular distance measures including Euclidean distance, dynamic time warping and Longest Common Subsequence. We further show that our indexing technique can be used to index star light curves, an important type of astronomical data, without modification. Reproducible Research Statement: All datasets and images used in this work are freely available at .     

一种大容量文本集的智能检索方法

分析了潜在语义模型,研究了潜在语义空间中文本的表示方法,提出了一种大容量文本集的检索策略。检索过程由粗粒度非相关剔除和相关文本的精确检索两个步骤组成。使用潜在语义空间模型对文本集进行初步的筛选,剔除非相关文本;使用大规模文本检索方法对相关文本在段落一级进行精确检索,其中为了提高检索的执行效率,在检索算法中引入了遗传算法;输出这些候选的段落序号。实验结果证明了这种方法的有效性和高效性。     

Efficient image retrieval through vantage objects

We describe a new indexing structure for general image retrieval that relies solely on a distance function giving the similarity between two images. For each image object in the database, its distance to a set of m predetermined vantage objects is calculated; the m-vector of these distances specifies a point in the m-dimensional vantage space. The database objects that are similar (in terms of the distance function) to a given query object can be determined by means of an efficient nearest-neighbor search on these points. We demonstrate the viability of our approach through experimental results obtained with two image databases, one consisting of about 5200 raster images of stamps, the other containing about 72,000 hieroglyphic polylines.     

A configurable type hierarchy index for OODB

With respect to the specific requirements of advanced OODB applications, index data structures for type hierarchies in OODBMS have to provide efficient support for multiattribute queries and have to allow index optimization for a particular query profile. We describe the multikey type index and an efficient implementation of this indexing scheme. It meets both requirements: in addition to its multiattribute query capabilities it is designed as a mediator between two standard design alternatives, key-grouping and type-grouping. A prerequisite for the multikey type index is a linearization algorithm which maps type hierarchies to linearly ordered attribute domains in such a way that each subhierarchy is represented by an interval of this domain. The algorithm extends previous results with respect to multiple inheritance. The subsequent evaluation of our proposal focuses on storage space overhead as well as on the number of disk I/O operations needed for query execution. The analytical results for the multikey type index are compared to previously published figures for well-known single-key search structures. The comparison clearly shows the superiority of the multikey type index for a large class of query profiles. Edited by E. Bertino. Received October 7, 1996 / Accepted March 28, 1997     

Multimedia indexing and retrieval: ever great challenges

In this introduction, we present a brief state of the art of multimedia indexing and retrieval as well as highlight some notions explored in the special issue. We hope that the contributions of this special issue will present ingredients for further investigations on this ever challenging domain. The special issue is actually situated between old problems and new challenges, and contribute to understand the next multimedia indexing and retrieval generation. The contributions explore wide range of fields such as signal processing, data mining and information retrieval.