Search results

For a better understanding of the preferences and differences of young consumers in emerging wine markets, this study aims to propose a clustering method to segment the super-new generation wine consumers based on their sensitivity to wine brand, origin and price and then conduct user profiles for segmented consumer groups from the perspectives of demographic attributes, eating habits and wine sensory attribute preferences.

We first proposed a consumer clustering perspective based on their sensitivity to wine brand, origin and price and then conducted an adaptive density peak and label propagation layer-by-layer (ADPLP) clustering algorithm to segment consumers, which improved the issues of wrong centers' selection and inaccurate classification of remaining sample points for traditional DPC (DPeak clustering algorithm). Then, we built a consumer profile system from the perspectives of demographic attributes, eating habits and wine sensory attribute preferences for segmented consumer groups.

In this study, 10 typical public datasets and 6 basic test algorithms are used to evaluate the proposed method, and the results showed that the ADPLP algorithm was optimal or suboptimal on 10 datasets with accuracy above 0.78. The average improvement in accuracy over the base DPC algorithm is 0.184. As an outcome of the wine consumer profiles, sensitive consumers prefer wines with medium prices of 100–400 CNY and more personalized brands and origins, while casual consumers are fond of popular brands, popular origins and low prices within 50 CNY. The wine sensory attributes preferred by super-new generation consumers are red, semi-dry, semi-sweet, still, fresh tasting, fruity, floral and low acid.

Young Chinese consumers are the main driver of wine consumption in the future. This paper provides a tool for decision-makers and marketers to identify the preferences of young consumers quickly which is meaningful and helpful for wine marketing.

In this study, the ADPLP algorithm was introduced for the first time. Subsequently, the user profile label system was constructed for segmented consumers to highlight their characteristics and demand partiality from three aspects: demographic characteristics, consumers' eating habits and consumers' preferences for wine attributes. Moreover, the ADPLP algorithm can be considered for user profiles on other alcoholic products.

The purpose of this paper is to exploit a new and robust method to forecast the long-term extreme dynamic responses for wave energy converters (WECs).

A new adaptive binned kernel density estimation (KDE) methodology is first proposed in this paper.

By examining the calculation results the authors has found that in the tail region the proposed new adaptive binned KDE distribution curve becomes very smooth and fits quite well with the histogram of the measured ocean wave dataset at the National Data Buoy Center (NDBC) station 46,059. Carefully studying the calculation results also reveals that the 50-year extreme power-take-off heaving force value forecasted based on the environmental contour derived using the new method is 3572600N, which is much larger than the value 2709100N forecasted via the Rosenblatt-inverse second-order reliability method (ISORM) contour method.

The proposed method overcomes the disadvantages of all the existing nonparametric and parametric methods for predicting the tail region probability density values of the sea state parameters.

It is concluded that the proposed new adaptive binned KDE method is robust and can forecast well the 50-year extreme dynamic responses for WECs.

The density peak clustering algorithm (DP) is proposed to identify cluster centers by two parameters, i.e. ρ value (local density) and δ value (the distance between a point and another point with a higher ρ value). According to the center-identifying principle of the DP, the potential cluster centers should have a higher ρ value and a higher δ value than other points. However, this principle may limit the DP from identifying some categories with multi-centers or the centers in lower-density regions. In addition, the improper assignment strategy of the DP could cause a wrong assignment result for the non-center points. This paper aims to address the aforementioned issues and improve the clustering performance of the DP.

First, to identify as many potential cluster centers as possible, the authors construct a point-domain by introducing the pinhole imaging strategy to extend the searching range of the potential cluster centers. Second, they design different novel calculation methods for calculating the domain distance, point-domain density and domain similarity. Third, they adopt domain similarity to achieve the domain merging process and optimize the final clustering results.

The experimental results on analyzing 12 synthetic data sets and 12 real-world data sets show that two-stage density peak clustering based on multi-strategy optimization (TMsDP) outperforms the DP and other state-of-the-art algorithms.

The authors propose a novel DP-based clustering method, i.e. TMsDP, and transform the relationship between points into that between domains to ultimately further optimize the clustering performance of the DP.

The purpose of this paper is to investigate a large‐eddy simulation, using low order numerical discretization and upwinding schemes on unstructured grids, for a turbulent free jet at Mach number 0.95. The accuracy and stability performance is discussed for the finite element/volume upwinding numerical code used.

This code is equipped with a self‐adaptive upwinding method which has been previously developed to reduce the numerical dissipation of applied low order flux calculation on unstructured elements using Roe's scheme. Herein, this method is used to numerically investigate a high Reynolds, compressible turbulent free jet and compare the results with a recently published set of experimental data. The effect of grid size is also investigated. A reasonable good agreement with the experimental measurements is obtained.

Based on the results, it is concluded that the developed self‐adaptive upwinding scheme provides a considerably better emulation of the flow regime in comparison to the full‐upwinding scheme. Different case studies have been carried out to assess the performance of self‐adaptive upwinding method and the effect of the subgrid model.

This paper presents an original research on self‐adaptive upwinding scheme and the effect of the subgrid model on a compressible turbulent free jet.

A planar lattice network of beam elements is used to study the mechanisms of fracture in cement‐based materials. Beam properties are controlled by a nonlinear elastic fracture law which roughly accounts for three‐dimensionality of the material and fracture process. Special attention is given to modeling toughening mechanisms associated with aggregate‐matrix interface failure. The distributions of damage and fracture energy consumption are resolved at the material mesoscale and are shown to depend on strain gradient. An adaptive remeshing procedure is used to reduce computational cost and enable analyses of specimens of significantly differing scale, while keeping the lattice density constant. Larger process zones, higher specific fracture energies, and lower specific peak loads are obtained with increasing specimen size, in agreement with published test results. These computations provide information useful in developing refined macromodels for engineering analyses.

The use of additive manufacturing in many branches of industry is increasing significantly because of its many advantages, such as being able to produce complex parts that cannot be produced by classical methods, using fewer materials, easing the supply chain with on-site production, being able to produce with all kinds of materials and producing lighter parts. The binder jetting technique, one of the additive manufacturing methods researched within the scope of this work, is predicted to be the additive manufacturing method that will grow the most in the next decade, according to many economic reports. Although additive manufacturing methods have many advantages, they can be slower than classical manufacturing methods regarding production speed. For this reason, this study aims to increase the manufacturing speed in the binder jetting method.

Adaptive slicing and variable binder amount algorithm (VBAA) were used to increase manufacturing speed in binder jetting. Taguchi method was used to optimize the layer thickness and saturation ratio in VBAA. According to the Taguchi experimental design, 27 samples were produced in nine different conditions, three replicates each. The width of the samples in their raw form was measured. Afterward, the samples were sintered at 1,500 °C for 2 h. After sintering, surface roughness and density tests were performed. Therefore, the methods used have been proven to be successful. In addition, measurement possibilities with image processing were investigated to make surface roughness measurements more accessible and more economical.

As a result of the tests, the optimum printing condition was decided to be 180–250 µm for layer thickness and 50% for saturation. A separate test sample was then designed to implement adaptive slicing. This test sample was produced in three pieces: adaptive (180–250 µm), thin layer (180 µm) and thick layer (250 µm) with the determined parameters. The roughness values of the adaptive sliced sample and the thin layer sample were similar and better than the thick layer sample. A similar result was obtained using 12.31% fewer layers in the adaptive sample than in the thin layer sample.

The use of adaptive slicing in binder jetting has become more efficient. In this way, it will increase the use of adaptive slicing in binder jetting. In addition, a cheap and straightforward image processing method has been developed to calculate the surface roughness of the parts.

Bayesian cubature (BC) has emerged to be one of most competitive approach for estimating the multi-dimensional integral especially when the integrand is expensive to evaluate, and alternative acquisition functions, such as the Posterior Variance Contribution (PVC) function, have been developed for adaptive experiment design of the integration points. However, those sequential design strategies also prevent BC from being implemented in a parallel scheme. Therefore, this paper aims at developing a parallelized adaptive BC method to further improve the computational efficiency.

By theoretically examining the multimodal behavior of the PVC function, it is concluded that the multiple local maxima all have important contribution to the integration accuracy as can be selected as design points, providing a practical way for parallelization of the adaptive BC. Inspired by the above finding, four multimodal optimization algorithms, including one newly developed in this work, are then introduced for finding multiple local maxima of the PVC function in one run, and further for parallel implementation of the adaptive BC.

The superiority of the parallel schemes and the performance of the four multimodal optimization algorithms are then demonstrated and compared with the k-means clustering method by using two numerical benchmarks and two engineering examples.

Multimodal behavior of acquisition function for BC is comprehensively investigated. All the local maxima of the acquisition function contribute to adaptive BC accuracy. Parallelization of adaptive BC is realized with four multimodal optimization methods.

The purpose of this paper is to present an efficient algorithm based on a multi‐level adaptive mesh refinement strategy for the solution of ill‐posed inverse heat conduction problems arising in pool boiling using few temperature observations.

The stable solution of the inverse problem is obtained by applying the conjugate gradient method for the normal equation method together with a discrepancy stopping rule. The resulting three‐dimensional direct, adjoin and sensitivity problems are solved numerically by a space‐time finite element method. A multi‐level computational approach, which uses an a posteriori error estimator to adaptively refine the meshes on different levels, is proposed to speed up the entire inverse solution procedure.

This systematic approach can efficiently solve the large‐scale inverse problem considered without losing necessary detail in the estimated quantities. It is shown that the choice of different termination parameters in the discrepancy stopping conditions for each level is crucial for obtaining a good overall estimation quality. The proposed algorithm has also been applied to real experimental data in pool boiling. It shows high computational efficiency and good estimation quality.

The high efficiency of the approach presented in the paper allows the fast processing of experimental data at many operating conditions along the entire boiling curve, which has been considered previously as computationally intractable. The present study is the authors' first step towards a systematic approach to consider an adaptive mesh refinement for the solution of large‐scale inverse boiling problems.

The primary objective of this paper is to discuss whether complexity science can help overcome management's dilemma of how to balance efficiency and innovation.

Complexity science provides an interdisciplinary theoretical approach for studying complex adaptive systems (CAS), which exhibit adequate combinations of both emergent efficiency and emergent innovation. Based on prominent models from complexity science, a generic framework of CAS is proposed that shows the design levers of such systems. This framework then serves to assess recent literature on applications of complexity science to firms. Applications cover a broad range of objectives and four organizational levels: the individual resource, the organizational sub‐unit (SU), the organizational, and the network levels. The generic framework is used to classify the applications' objectives in terms of efficiency and innovation, and to identify the design levers they use.

CAS offer a valuable theoretical perspective on efficiency and innovation. However, the proposed framework shows that these systems are not utilized to their full potential when applied to firms. Typical applications address either emergent efficiency or emergent innovation and thus fail to balance both.

The paper does not provide an exhaustive literature review on management applications of CAS, but selects exemplary literature.

The paper gives a comprehensive overview of the CAS' perspective in management science. For further research, the proposed generic framework of CAS may serve to analyze, evaluate and integrate applications in order to overcome the efficiency‐innovation dilemma.

One of the fundamental tasks in the field of image processing is image denoising. Images are often corrupted by different types of noise and the restoration of images degraded with random-valued impulse noise is still a challenging task. The paper aims to discuss these issues.

This paper presents an adaptive threshold-based impulse noise detection following by a novel selective window median filter for restoration of RVIN pixels.

The proposed method emphasis a local image statistics using an exponential nonlinear function with an adaptive threshold is derived from the rank-ordered trimmed median absolute difference (ROTMAD) are deliberated to detect the noisy pixels. In the filtering stage, a selective 3×3 moving window median filter is applied to restore the detected noisy pixel.

Experimental result shows that the proposed algorithm outperforms the existing state-of-art techniques in terms of noise removal and quantitative metrics such as peak signal to noise ratio (PSNR), mean absolute error (MAE), structural similarity index metric (SSIM) and miss and false detection rate.