交往的发展——居民参与的社区营造模式探讨

居民参与社区建设和营造是解决我国当代居住社区邻里交往缺失的途径之一。本文探讨了居民参与社区建设应始于何处,建筑师应如何通过设计手段引导和启发居民进行参与活动,在参与的同时促使居住区社会网络的形成与成熟,达到改善居住区人际关系的最终目的。     

A simulation study of the nearest neighbour analysis method of papadakis

The relative performances of randomised block, balanced lattice squares and Papadakis nearest neighbour analyses were compared on two simulated fields whose soil heterogeneity profiles were generated, one with a few evenly spaced contours and the other with many unevenly spaced contours. Four levels of random error were generated to simulate different proportions of random error and soil heterogeneity. Dummy treatments, corresponding to 7 x 7 and 11 x 11 balanced lattice squares were applied to the fields. The results from simulated experiments showed an interaction of error mean square (EMS) between size of experiment (7 x 7, 11 x 11) and levels of soil heterogeneity in the lattice analyses, but no such interaction in the Papadakis analyses. The Papadakis EMS decreased as random error decreased but at a rate depending on the map andthe ratio of soil heterogeneity to random error.     

Missing at random (MAR) in nonparametric regression - A simulation experiment

The additive model is considered when some observations on x are missing at random but corresponding observations on y are available. Especially for this model, missing at random is an interesting case because the complete case analysis is expected to be no more suitable. A simulation experiment is reported and the different methods are compared based on their superiority with respect to the sample mean squared error. Some focus is also given on the sample variance and the estimated bias. In detail, the complete case analysis, a kind of stochastic mean imputation, a single imputation and the nearest neighbor imputation are discussed.     

从连锁餐饮巨头比邻而居看聚合经营

应用纳什均衡理论,并通过创建假设模型,分析两大连锁餐饮巨头麦当劳与肯德基比邻而居的现象,可揭示出连锁超市、连锁企业等聚合选址、聚合经营的原理：聚合选址、聚合经营同类型或者相近产品可以在有效地刺激消费者需求,加速商品流通与周转速度的同时,极大降低商家的经营风险与成本。同时,企业若想在聚合经营中求得生存和发展,还须努力打造出自身特色,塑造拥有竞争力的完美个性。     

Variance estimation when donor imputation is used to fill in missing values

Donor imputation is frequently used in surveys. However, very few variance estimation methods that take into account donor imputation have been developed in the literature. This is particularly true for surveys with high sampling fractions using nearest donor imputation, often called nearest‐neighbour imputation. In this paper, the authors develop a variance estimator for donor imputation based on the assumption that the imputed estimator of a domain total is approximately unbiased under an imputation model; that is, a model for the variable requiring imputation. Their variance estimator is valid, irrespective of the magnitude of the sampling fractions and the complexity of the donor imputation method, provided that the imputation model mean and variance are accurately estimated. They evaluate its performance in a simulation study and show that nonparametric estimation of the model mean and variance via smoothing splines brings robustness with respect to imputation model misspecifications. They also apply their variance estimator to real survey data when nearest‐neighbour imputation has been used to fill in the missing values. The Canadian Journal of Statistics 37: 400–416; 2009 © 2009 Statistical Society of Canada     

Rate of strong uniform convergence of k-NN density estimates

Let f_n(x) be the univariate k-nearest neighbor (k-NN) density estimate proposed by Loftsgaarden and Quesenberry (1965). By using similar techniques as in Bahadur's representation of sample quantiles (1966), and by the recent results on the oscillation of empirical processes by Stute (1982), we derive the rate of strong uniform convergence of f_n(x) on some suitably chosen interval J_δ. Some comparison with the kernel estimates is given, as well as the choice of the bandwidth sequence relative to the sample size.     

A Starting Point for Navigating the World of Daily Fantasy Basketball

Fantasy sports, particularly the daily variety in which new lineups are selected each day, are a rapidly growing industry. The two largest companies in the daily fantasy business, DraftKings and Fanduel, have been valued as high as $2 billion. This research focuses on the development of a complete system for daily fantasy basketball, including both the prediction of player performance and the construction of a team. First, a Bayesian random effects model is used to predict an aggregate measure of daily NBA player performance. The predictions are then used to construct teams under the constraints of the game, typically related to a fictional salary cap and player positions. Permutation based and K-nearest neighbors approaches are compared in terms of the identification of “successful” teams—those who would be competitive more often than not based on historical data. We demonstrate the efficacy of our system by comparing our predictions to those from a well-known analytics website, and by simulating daily competitions over the course of the 2015–2016 season. Our results show an expected profit of approximately $9,000 on an initial $500 investment using the K-nearest neighbors approach, a 36% increase relative to using the permutation-based approach alone. Supplementary materials for this article are available online.     

A permutation test approach to the choice of size k for the nearest neighbors classifier

The k nearest neighbors (k-NN) classifier is one of the most popular methods for statistical pattern recognition and machine learning. In practice, the size k, the number of neighbors used for classification, is usually arbitrarily set to one or some other small numbers, or based on the cross-validation procedure. In this study, we propose a novel alternative approach to decide the size k. Based on a k-NN-based multivariate multi-sample test, we assign each k a permutation test based Z-score. The number of NN is set to the k with the highest Z-score. This approach is computationally efficient since we have derived the formulas for the mean and variance of the test statistic under permutation distribution for multiple sample groups. Several simulation and real-world data sets are analyzed to investigate the performance of our approach. The usefulness of our approach is demonstrated through the evaluation of prediction accuracies using Z-score as a criterion to select the size k. We also compare our approach to the widely used cross-validation approaches. The results show that the size k selected by our approach yields high prediction accuracies when informative features are used for classification, whereas the cross-validation approach may fail in some cases.     

Inference in Dynamic Discrete Choice Models With Serially orrelated Unobserved State Variables

This paper develops a method for inference in dynamic discrete choice models with serially correlated unobserved state variables. Estimation of these models involves computing high‐dimensional integrals that are present in the solution to the dynamic program and in the likelihood function. First, the paper proposes a Bayesian Markov chain Monte Carlo estimation procedure that can handle the problem of multidimensional integration in the likelihood function. Second, the paper presents an efficient algorithm for solving the dynamic program suitable for use in conjunction with the proposed estimation procedure.