Joint pricing and advertising strategy with reference price effect

Consumers are susceptible to reference price effects when they make purchase decisions for a certain product. Meanwhile, the sales price and advertisement are the determinable factors that have impact on consumers’ reference price which are also fundamental marketing strategies. Therefore, how to determine an appropriate sales price and advertising effort level to maximise firms’ profits is an essential task. A joint pricing and advertising problem for a monopolistic firm with consideration of reference price effect is investigated, where consumer demand rate is price-sensitivity and depends on the gap between the sales price and the reference price in consumers’ mind. An optimisation model is established to maximise the firm’s total profit by making a joint pricing and advertising strategy. The static and dynamic joint strategies are obtained by applying Pontryagin’s maximum principle. Results show that the dynamic strategies dominate the static ones. Furthermore, the dynamic pricing and dynamic advertising strategies are strategic complements. Additionally, the length of the sales period plays a key role in determining the superiority of the two dynamic strategies. Specifically, a relatively short sales period highlights the value of the dynamic advertising while a long sales period strengthens the function of the dynamic pricing.     

Improved robust exponential stability for Takagi–Sugeno fuzzy uncertain systems with time-varying delays

This paper concerns managing the robust exponential stability problem of uncertain Takagi–Sugeno fuzzy systems with time-varying delay by employing a further improved integral inequality matrix approach. Based on the linear matrix inequality (LMI) approach, delay-dependent robust exponential stability criteria have been developed. By taking the relationship among the time-varying delay, its upper bound and their difference into account, some less conservative LMI-based delay-dependent robust exponential stability criteria are obtained without ignoring any useful terms in the derivative of Lyapunov–Krasovskii functionals. Maximum allowable upper bound for time-varying delays is determined. Numerical examples are provided to show that the obtained results significantly improve the allowed upper bounds of delay size over some methods existing in the literature.     

Different Estimation Methods for Constant Stress Accelerated Life Test under the Family of the Exponentiated Distributions

The Accelerated Life Testing (ALT) has been used for a long time in several fields to obtain information on the reliability of product components and materials under operating conditions in a much shorter time. One of the main purposes of applying ALT is to estimate the failure time functions and reliability performance under normal conditions. This paper concentrates on the estimation procedures under ALT and how to select the best estimation method that gives accurate estimates for the reliability function. For this purpose, different estimation methods are used, such as maximum likelihood, least squares (LS), weighted LS, and probability weighted moment. Moreover, the reliability function under usual conditions is predicted. The estimation procedures are applied under the family of the exponentiated distributions in general, and for the exponentiated inverted Weibull (EIW) as a special case. Numerical analysis including simulated data and a real life data set is conducted to compare the performances between these four methods. It is found that the ML method gives the best results among other estimation methods. Finally, a comparison between the EIW and the Inverted Weibull (IW) distributions based on a real life data set is made using a likelihood ratio test. It is observed that the EIW distribution can provide better fitting than the IW in case of ALT. Copyright © 2015 John Wiley & Sons, Ltd.     

一种快速自适应谱估计算法

通过对梯度格型快速自适应算法的研究,结合最大熵谱外推目前存在的缺点,将梯度格型算法应用于最大熵谱外推中,并将其与伯格算法进行了比较。     

黄河下游防洪减灾效益分析

由于黄河多泥沙的特性和特殊的自然条件,黄河下游河道在历史上决口频繁。人民治黄５０年来,黄河下游的防洪减灾措施确保了黄淮海太平原的安全,取得了巨大的社会经济效益。,采用“实际发生年法”对黄河下游防洪减灾效益进行了分析。结果表明,人民治黄以来,黄河下游防洪工程减免大堤决口、减少滩地淹没、减少凌汛决口及河道淤积所取得的直接经济效益分析另３４００．１、６５．８、１２０．０、４５．０亿元,由于黄河问题的复杂     

基于Matlab的光伏阵列数学模型的研究

通过对单体光伏电池的物理模型的研究,给出了易于求解、便于仿真的光伏阵列的数学模型,该模型可以计算在任一环境温度、太阳辐射强度下光伏电池的I-V特性;以该模型为基础,在工程误差允许的范围内,给出了可行的最大功率点的计算公式。Matlab仿真结果表明,光伏阵列的输出特性随温度和光强的变化而变化,并且光伏阵列I-V和P-V特性呈非线性;在不同光强和温度下,光伏阵列最大功率点不同,它能较好地反应光伏阵列的实际特性。     

基于模糊极大似然估计聚类的点云数据分块

对散乱点云数据采用微切平面法进行法矢估计,对法矢方向进行全局协调性调整。采用稳定性较好的二次曲面拟合法估算点云数据的高斯曲率和平均曲率。将点的坐标、法矢和曲率合并为八维特征向量,通过模糊极大似然估计聚类技术,将具有类似几何特征的向量聚为一类,从而实现点云数据的分块。实验证明该方法有效。     

基于特征选择和最大熵模型的汉语词义消歧

词义消歧是自然语言处理中一类典型的分类问题.在分类中,特征的选择至关重要.通常情况下,特征是由人工选择的,这就要求特征选取者对于待分类的问题本身和分类模型的特点有深刻的认识.分析了汉语词义消岐中特征模板对消歧结果的影响,在此基础上提出一套基于最大熵分类模型的自动特征选择方法,包括针对所有歧义词的统一特征模板选择和针对单个歧义词的独立特征模板优化算法.实验结果表明,使用自动选择的特征,不仅简化了特征模板,而且提高了汉语词义消歧的性能.与SemEval 2007:task #5的最好成绩相比,该方法分别在微平均值MicroAve(micro-average accuracy）)和宏平均值MacroAve(macro-average accuracy）)上提升了3.10%和2.96%.     

二维直方图θ-划分最大平均离差阈值分割算法

鉴于常用二维直方图区域直分法存在错分, 最近提出的斜分法不具普遍性, 而基于L1范数的最小一乘准则比最小二乘准则更为合理且简捷, 提出了适用面更广的基于二维直方图θ-划分和最大类间平均离差的图像阈值分割算法. 首先给出了二维直方图θ-划分方法, 采用4条平行斜线及1条其法线与灰度级轴成 θ 角的直线划分二维直方图区域, 按灰度级和邻域平均灰度级的加权和进行阈值分割, 斜分法可视为该方法中θ=45° 的特例; 然后导出了二维直方图θ-划分最大类间平均离差阈值选取公式及其快速递推算法; 最后给出了θ 取不同值时的分割结果及运行时间. θ 取较小值时, 边界形状准确性较高, θ 取较大值时, 抗噪性较强, 应用时可根据实际图像特点及需求合理选取 θ 的值. 与常规二维直方图直分最大类间方差法及最大类间平均离差法相比, 所需运行时间相近, 但本文提出的方法所得分割结果更为准确, 抵抗噪声更为稳健, 且存储空间也大为减少.     

Adaptive beam search lookahead algorithms for the circular packing problem

This paper addresses the circular packing problem (CPP), which consists in packing n circles C_i, each of known radius r_i, i∈N={1, …, n}, into the smallest containing circle C. The objective is to determine the radius r of C as well as the coordinates (x_i, y_i) of the center of C_i, i∈N. CPP is solved using two adaptive algorithms that adopt a binary search to determine r, and a beam search to check the feasibility of packing n circles into C when the radius is fixed at r. A node of level ?, ?=1, …, n, of the beam search tree corresponds to a partial packing of ? circles of N into C. The potential of each node of the tree is assessed using a lookahead strategy that, starting with the partial packing of the current node, assigns each unpacked circle to its maximum hole degree position. The beam search stops either when the lookahead strategy identifies a feasible packing or when it has fathomed all nodes. The computational tests on a set of benchmark instances show the effectiveness of the proposed adaptive algorithms.