Green consumption behavior prediction based on fan-shaped search mechanism fruit fly algorithm optimized neural network

Predicting consumption behavior is very important for adjusting supplier production plans and enterprise marketing activities. Conventional statistical methods are unable to accurately predict green consumption behavior because it is characterized by multivariate nonlinear interactions. The paper proposes an optimized fruit fly algorithm (FOA) and extreme learning machine (ELM) model for consumption behavior prediction. First, to address the problem of uneven search direction of FOA leading to insufficient search ability and low efficiency, the paper proposes a sector search mechanism instead of a random search mechanism to improve the global search ability and convergence speed of FOA. Second, to address the issue that the initial weights and hidden layer bias values of the ELM are randomly generated, which affects the learning efficiency and generalization of the ELM, the paper uses an improved FOA to optimize the weights and bias values of ELM for improving the prediction accuracy. Taking the green vegetable consumption behavior of Beijing residents as an example, the results show the optimization of the initial weight and threshold of ELM by the GA, PSO, FOA, and SFOA, the prediction accuracy of the GA-ELM, PSO-ELM, FOA-ELM, and SFOA-ELM models all surpass those of ELM. Compared with BPNN, GRNN, ELM, GA-ELM, PSO-ELM, and FOA-ELM models, the RMSE value of SFOA-ELM was decreased by 9.45%, 8.40%, 11.89%, 5.84%, 2.22%, and 2.69%, respectively. These findings demonstrate the effectiveness of the SFOA-ELM model in green consumption behavior prediction and provide new ideas for the accurate prediction of consumption behaviors of other green products with similar characteristics.     

一种动态加权的LDPC译码方法

为了加快低密度奇偶校验（LDPC）码的译码速度，有效改善LDPC码的译码性能，针对校验节点更新过程中的对数似然比（LLR）值的大小，设计了一种LDPC码的动态加权译码方法。以IEEE 802.16e标准的奇偶校验矩阵为例，根据LLR值的变化规律，利用增长因子和抑制因子对和积译码算法和最小和译码算法进行动态加权。仿真结果显示，基于动态加权的译码方法相对于传统译码方法误码率都有明显改进，译码复杂度也有所降低。     

认知型飞蜂窝网络中的子信道分配与功率控制

为了解决宏蜂窝与飞蜂窝构成的两层异构网络上行干扰与资源分配问题，提出了一种在认知型飞蜂窝的双层异构网中结合子信道分配和功率控制进行资源分配的框架。通过对异构网中跨层干扰问题进行分析与建模，将求解最优子信道分配矩阵和用户发射功率矩阵作为干扰管理问题的解决方法。模型中认知型飞蜂窝网络子信道和飞蜂窝网络用户构成非合作博弈，双方利用效用函数最优值进行匹配，构成初始信道分配矩阵；再由接入控制器根据接入条件从初始信道分配矩阵中筛选用户，并优化接入用户的发射功率矩阵，得到最优子信道分配矩阵和功率矩阵。仿真结果表明，优化框架提高了双层异构网络中飞蜂窝网络用户的吞吐量和接入率，降低了异构网中跨层干扰。     

Using machine learning and big data for efficient forecasting of hotel booking cancellations

Cancellations are a key aspect of hotel revenue management because of their impact on room reservation systems. In fact, very little is known about the reasons that lead customers to cancel, or how it can be avoided. The aim of this paper is to propose a means of enabling the forecasting of hotel booking cancellations using only 13 independent variables, a reduced number in comparison with related research in the area, which in addition coincide with those that are most often requested by customers when they place a reservation. For this matter, machine-learning techniques, among other artificial neural networks optimised with genetic algorithms were applied achieving a cancellation rate of up to 98%. The proposed methodology allows us not only to know about cancellation rates, but also to identify which customer is likely to cancel. This approach would mean organisations could strengthen their action protocols regarding tourist arrivals.     

一种基于地理信息系统的异构网络多目标算法

地理信息系统（Geographic Information System,GIS）和多目标算法为异构网络基站部署问题带来新的突破。ArcGIS系列是GIS专业化的管理软件，采用ArcGIS软件对包含学校、医院等场景的中国某市密集城区进行建模分析，并且提出基于目标权重因子的多目标离散粒子群算法（Multi-objective Discrete Particle Swarm Optimization algorithm based on Target Weight Factor,MDPSO/TWF），基于多个目标函数整体最优研究异构网络基站部署问题。仿真结果表明，所提的MDPSO/TWF算法具有可行性和先进性，可以综合考虑网络负载和网络能效多个优化目标，将业务需求与实际基站选址相结合，在满足业务需求的基础上尽可能达到节能的目的。     

基于模糊多属性群决策的维护方式选择研究

维护方式选择是维护管理中的重要工作之一,合理的维护方式既能达到保障设备的稳定运行,又能同时兼顾其它各个方面的要求。由于对维护方式的评价涉及多个部门、人员和属性,有些指标只是一个模糊的概念,因而采用模糊多属性群决策的方法对维护方式进行优先抉择。本文结合A公司的设备维护方式选择问题,尝试使用模糊多属性群决策折衷算法求解最佳的维护方式。     

An extended likelihood framework for modelling discretely observed credit rating transitions

The estimation of the parameters of a continuous-time Markov chain from discrete-time observations, also known as the embedding problem for Markov chains, plays in particular an important role for the modeling of credit rating transitions. This missing data problem boils down to a latent variable setting and thus, maximum likelihood estimation is usually conducted using the expectation-maximization (EM) algorithm. We illustrate that the EM algorithm is likely to get stuck in local maxima of the likelihood function in this specific problem setting and adapt a stochastic approximation simulated annealing scheme (SASEM) as well as a genetic algorithm (GA) to combat this issue. Above that, our main contribution is to extend our method GA by a rejection sampling scheme, which allows one to derive stochastic monotone maximum likelihood estimates in order to obtain proper (non-crossing) multi-year probabilities of default. We advocate the use of this procedure as direct constrained optimization (of the likelihood function) will not be numerically stable due to the large number of side conditions. Furthermore, the monotonicity constraint enables one to combine structural knowledge of the ordinality of credit ratings with real-life data into a statistical estimator, which has a stabilizing effect on far off-diagonal generator matrix elements. We illustrate our methods by Standard and Poor’s credit rating data as well as a simulation study and benchmark our novel procedure against an already existing smoothing algorithm.     

基于PSO的信息熵数据融合非均匀分簇路由算法

针对无线传感器网络分簇算法中能量分布不均衡导致的"热区"和簇头负载过重问题,提出了一种基于PSO算法优化簇头选举的非均匀分簇算法。在候选簇头选举和竞争半径计算过程中综合考虑节点动态能量、节点密度和节点距基站距离,将网络进行非均匀分簇,并引入PSO算法进行最终簇头选举。根据节点能量、节点密度和距基站距离确定簇间单跳多跳结合的路由规则,选取代价函数小的节点作为下一跳节点。基于节点信息熵确定融合阈值,进行簇内数据融合剔除冗余数据。仿真结果表明,改进算法的数据传输量比EEUC算法和UCRA算法分别提高了20%和10%,提升了数据的融合效率,有效延长了网络生命周期,簇头能量消耗得到均衡,减少了网络能量消耗,网络的整体性能显著优于其他对比算法。     

Factor extraction using Kalman filter and smoothing: This is not just another survey

Dynamic factor models have been the main “big data” tool used by empirical macroeconomists during the last 30 years. In this context, Kalman filter and smoothing (KFS) procedures can cope with missing data, mixed frequency data, time-varying parameters, non-linearities, non-stationarity, and many other characteristics often observed in real systems of economic variables. The main contribution of this paper is to provide a comprehensive updated summary of the literature on latent common factors extracted using KFS procedures in the context of dynamic factor models, pointing out their potential limitations. Signal extraction and parameter estimation issues are separately analyzed. Identification issues are also tackled in both stationary and non-stationary models. Finally, empirical applications are surveyed in both cases. This survey is relevant to researchers and practitioners interested not only in the theory of KFS procedures for factor extraction in dynamic factor models but also in their empirical application in macroeconomics and finance.     

Optimal capacity and operation design of a robot logistics system for the hotel industry

This study introduces an optimal capacity and operation design of a robot logistics system that can reduce human workload in the hotel industry. In hotels, there are several duties that can be replaced by robots such as accompanying guests to the certain areas, delivering specific items to the guest rooms, and transporting some items that guests want to be removed from the guest rooms. To apply the robot logistics system in the hotel industry, the capacity and operation design should be prepared adequately. For that, a mathematical model-based optimization technique is used to decide the number of robots with the concept of minimizing total investment cost and to derive the optimal job assigning with the purpose of maximizing total covered jobs. In addition, a numerical example is performed to validate the proposed mathematical model and the sensitivity tests are examined to reflect the random features.