Past price ‘memory’ in the housing market: testing the performance of different spatio-temporal specifications

Recent methodological developments provide a way to incorporate the temporal dimension when accounting for spatial effects in hedonic pricing. Weight matrices should decompose the spatial effects into two distinct components: bidirectional contemporaneous spatial connections; and unidirectional spatio-temporal effects from past transactions. Our iterative estimation approach explicitly analyses the role of time in price determination. The results show that both spatio-temporal components should be included in model specification; past transaction information stops contributing to price determination after eight months; and limited temporal friction is exhibited within this period. These findings highlight the decidedly non-linear temporal patterns of such information effects.     

空间目标的联合矩阵束极点估计

极点作为谐振区雷达目标的最主要电磁特性，具有很大的空间目标识别前景。但是在使用频域观测数据提取目标极点时，存在虚假极点和估计精度问题。针对上述问题，首先通过加窗和截断改进了后时响应信号的获取流程，抑制了虚假极点影响；然后采用最小描述长度法（MDL）估计极点个数，避免了定阶错误引起的虚假极点；最后采用联合矩阵束法估计极点，有效减少了单角度数据估计极点时存在的遗漏极点和虚假极点问题。FEKO软件验证表明，所提算法具有更高的精度和抗噪能力。     

我国林业扶贫工作的主要问题及优化措施研究

林业扶贫是当前我国扶贫工作的重要内容。通过介绍开展林业扶贫工作的政策背景、理论背景以及经济背景,分析林业扶贫工作开展过程中存在的基础设施落后、针对性差等问题,提出了因地制宜,互联网+林业扶贫,鼓励社会资本进入扶贫工作、志智双扶等应对措施。     

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.     

The problem of employees' network centrality and supervisors' error in performance appraisal: A multilevel theory

This article reveals an unexplored paradox for HR managers: the centrality of an employee in the social network benefits performance but hampers performance appraisal because it affects supervisors' rating errors. Central employees can be erroneously rated high on performance even when they are not high performers because supervisors tend to overappraise their performance. A distinction is made between rating precision, which depends on supervisors' uncertainty regarding employees' performance, and rating accuracy, which depends on supervisors' bias in favor of employees. Employee centrality is posited to be beneficial to precision but deleterious to accuracy because it regulates the diffusion of positive information, status, and power, all of which distort supervisors' capacity and motivation to accurately appraise performance. It is then argued that rating errors caused by network centrality affect aggregate perceptions of justice in organizations. When employees are highly connected to each other in a dense network, organizations have a strong and positive justice climate. Yet when some employees are more central than others in a centralized network, organizations have a negative and weak justice climate. The article contributes to the literature because it identifies an unexplored dark side of network centrality and offers recommendations for HR managers to cope with its deleterious consequences and for scholars to study them.     

Limitations of portfolio diversification through fat tails of the return Distributions: Some empirical evidence

This study investigates the level of risk due to fat tails of the return distribution and the changes of tail fatness (TF) through portfolio diversification. TF is not eliminated through portfolio diversification, and, interestingly, the positive tail has declining fatness until a certain level is reached, while the negative tail has rising fatness. This indicates that fat tails are highly relevant to common factors on systematic risk and that the relevance of common factors is higher for the negative tail compared to the positive tail. In the portfolio diversification effect, the declining fatness of the positive tail further reduces risk, but the rising fatness of the negative tail does not contribute to this effect. The asymmetry between the fatness of the positive and negative tails in the return distribution corresponds to the asymmetry of the trade-off relationship between loss avoidance and profit sacrifice that is expected as a consequence of portfolio diversification. Investors use portfolio diversification to reduce their risk of suffering high losses, but following this strategy means sacrificing high-profit potential. Our study provides empirical confirmation for the practical limitation of portfolio diversification and explains why investors with diversified portfolios suffer high losses from market crashes. An examination of the Northeast Asian stock markets of China, Japan, Korea, and Taiwan show identical results.     

融合反距离加权和矩阵填充的位置指纹库构建

为解决位置指纹定位在离线阶段构建位置指纹库时耗费的人力和时间成本较大，构建指纹库效率低和利用空间插值法构建的指纹库精度不高的问题，提出了一种融合反距离加权和矩阵填充的位置指纹库构建算法。该算法仅需人工采集定位区域内少量参考点的接收信号强度值用作信标点指纹信息，结合反距离加权算法特性计算出次信标点指纹信息，根据位置指纹库数据矩阵的低秩性，应用奇异值阈值矩阵填充算法构建出位置指纹数据库。仿真实验结果表明，所提算法有效降低了矩阵填充算法构建位置指纹库所需的人工和时间成本，构建出的位置指纹库定位性能优于反距离加权和克里金空间插值法，接近传统人工采集法，显著地提高了位置指纹库的构建效率。     

双平行线阵的快速一维DOA估计

针对传统子空间算法需要进行特征值分解或奇异值分解等复杂计算的问题，提出一种双平行线阵（Double Parallel Linear Array,DPLA）的快速一维波达方向（Direction of Arrival，DOA）估计算法。算法通过处理互协方差矩阵的第一列元素构造出等效的噪声子空间，再通过求根MUSIC（Multiple Signal Classification）算法得到DOA估计，有效避开了特征值分解或奇异值分解，降低了计算复杂度，提高了运算速度。仿真结果表明，该算法在提高了估计精度的同时减少了估计时间。     

Theoretical analysis and model design of search for ecological conservation redlines based on the sensitivity assessment of ecosystem services

Most small-scale social economies are characterised by their deficiency, lack, and/or difficulty in matching natural data. Against this backdrop, this paper builds a relatively uniform theoretical framework and designs a more economical and objective method for demarcating ecological conservation redlines (ECR) based on sensitivity assessment of ecosystem services. The results show that the sensitivity assessment model designed in this study can identify sensitive zones effectively, and that the ECR in Hubei Province are well within the sensitive zones so identified. The delimited areas based on the sensitive assessment of ecosystem services have great similarities (95%) with the actual ECR areas in Hubei Province. The most ecologically important functional zones (EIFZ) can also be identified using the regional ecological sensitivity coefficient. When the threshold of EIFZ is set higher, the probability that it falls within the ecologically sensitive areas is greater and the ECR delimited by the method proposed in this study will be more reliable. Theoretically, the delimitation of ECR can be inserted at any evaluation level with a grid resolution higher than that of the land use data, which can be used as a supplement to the ECR delimitation method in ecology or geography.     

一种基于自适应相似矩阵的谱聚类算法

为了消除在构建谱聚类算法的相似矩阵时,高斯核函数中尺度参数的波动影响,构建了一种自适应相似矩阵,并应用到谱聚类算法中。自适应相似矩阵中数据点间的距离度量采用测地距离算法,相距较近的两点间的距离近似于欧氏距离,相距较远的两点则先根据欧氏距离得到每个数据点的k个近邻点,然后累加近邻点的测地距离,由此得到每对数据点间的最短距离。两点间的局部密度用共享近邻的定义来表示,更好地刻画了数据集的本征结构。在5个人工数据集和国际通用UCI数据库中的5个真实数据集上进行实验。实验结果表明,所提算法的聚类准确率高于对比算法的准确率,对复杂分布数据有很强的自适应能力。研究成果为数据挖掘及机器学习提供了思路和方法。