新时代侨校思想政治工作的价值定位和路径优化

侨校思想政治工作是高校思想政治工作的有机构成。进入新时代，要准确把握侨校思想政治工作的价值定位，直面当前侨校思想政治工作中所面临的价值观念多元化、工作队伍薄弱化和工作对象差异化的挑战，创新思路，统筹着力，牢牢掌握侨校意识形态工作的话语权，汇聚侨校思想政治工作的强大合力，构建分层化差异化的教育模式，增强侨校思想政治工作的时代性、针对性和实效性。     

VIF-based adaptive matrix perturbation method for heteroskedasticity-robust covariance estimators in the presence of multicollinearity

In this study, we investigate linear regression having both heteroskedasticity and collinearity problems. We discuss the properties related to the perturbation method. Important observations are summarized as theorems. We then prove the main result that states the heteroskedasticity-robust variances can be improved and that the resulting bias is minimized by using the matrix perturbation method. We analyze a practical example for validation of the method.     

Parametrizing the Kepler exoplanet period-radius distribution with the bivariate normal inverse Gaussian distribution

This paper presents a simple and robust method for obtaining a comprehensive understanding of the joint period and radius distribution in Kepler exoplanets. The proposed method is based on particle swarm optimization and bivariate Normal Inverse Gaussian distribution. Furthermore, in the construction of the probability density function, this study selects planet-host stars with the GK-type. The injecting approach is also employed to solve the survey completeness of sample. The resulting occurrence rate of Earth analogs is 0.025 with a 95% bootstrap confidence interval between 0.023 and 0.032.     

A new algorithm for clustering based on kernel density estimation

In this paper, we present an algorithm for clustering based on univariate kernel density estimation, named ClusterKDE. It consists of an iterative procedure that in each step a new cluster is obtained by minimizing a smooth kernel function. Although in our applications we have used the univariate Gaussian kernel, any smooth kernel function can be used. The proposed algorithm has the advantage of not requiring a priori the number of cluster. Furthermore, the ClusterKDE algorithm is very simple, easy to implement, well-defined and stops in a finite number of steps, namely, it always converges independently of the initial point. We also illustrate our findings by numerical experiments which are obtained when our algorithm is implemented in the software Matlab and applied to practical applications. The results indicate that the ClusterKDE algorithm is competitive and fast when compared with the well-known Clusterdata and K-means algorithms, used by Matlab to clustering data.     

The exponential distribution analog of the Grubbs–Weaver method

Abstract

Grubbs and Weaver (1947 Grubbs, F. E., and C. L. Weaver. 1947. The best unbiased estimate of population standard deviation based on group ranges. Journal of the American Statistical Association 42 (238):224–41. doi: 10.2307/2280652.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]) suggest a minimum-variance unbiased estimator for the population standard deviation of a normal random variable, where a random sample is drawn and a weighted sum of the ranges of subsamples is calculated. The optimal choice involves using as many subsamples of size eight as possible. They verified their results numerically for samples of size up to 100, and conjectured that their “rule of eights” is valid for all sample sizes. Here we examine the analogous problem where the underlying distribution is exponential and find that a “rule of fours” yields optimality and prove the result rigorously.     

Multi-objective optimization in partitioning the healthcare system of Parana State in Brazil

Motivated by a proposal of the local authority for improving the existing healthcare system in the Parana State in Brazil, this article presents an optimization-based model for developing a better system for patients by aggregating various health services offered in the municipalities of Parana into some microregions. The problem is formulated as a multi-objective partitioning of the nodes of an undirected graph (or network) with the municipalities as the nodes and the roads connecting them as the edges of the graph. Maximizing the population homogeneity in the microregions, maximizing the variety of medical procedures offered in the microregions, and minimizing the inter-microregion distances to be traveled by patients are considered as three objective functions of the problem. An integer-coded multi-objective genetic algorithm is adopted as the optimization tool, which yields a significant improvement to the existing healthcare system map of the Parana State. The results obtained may have a strong impact on the healthcare system management in Parana. The model proposed here could be a useful tool to aid the decision-making in health management, as well as for better organization of any healthcare system, including those of other Brazilian States.     

Resource Distribution in Multiple Attacks with Imperfect Detection of the Attack Outcome

This article extends the previous research of consecutive attacks strategy by assuming that an attacker observes the outcome of each attack imperfectly. With given probabilities it may wrongly identify a destroyed target as undestroyed, and wrongly identify an undestroyed target as destroyed. The outcome of each attack is determined by a contest success function that depends on the amount of resources allocated by the defender and the attacker to each attack. The article suggests a probabilistic model of the multiple attacks and analyzes how the target destruction probability and the attacker's relative resource expenditure are impacted by the two probabilities of incorrect observation, the attacker's and defender's resource ratio, the contest intensity, the number of attacks, and the resource distribution across attacks. We analyze how the attacker chooses the number of attacks, the attack stopping rule, and the optimal resource distribution across attacks to maximize its utility.     

A new metamodel-based method for solving semi-expensive simulation optimization problems

In this article, a new algorithm for rather expensive simulation problems is presented, which consists of two phases. In the first phase, as a model-based algorithm, the simulation output is used directly in the optimization stage. In the second phase, the simulation model is replaced by a valid metamodel. In addition, a new optimization algorithm is presented. To evaluate the performance of the proposed algorithm, it is applied to the (s,S) inventory problem as well as to five test functions. Numerical results show that the proposed algorithm leads to better solutions with less computational time than the corresponding metamodel-based algorithm.     

上海城市人口总量控制与结构优化研究

上海的人口总量和结构一直与其独特的工业化、城镇化进程密不可分。工业化带动人口发展,人口发展推动城市发展。改革开放以来,上海正处于第四波工业化时期,人口增长较快。在人口结构上,户籍人口老龄化,而外来人口具有就近流动、城城流动、定居化特点,且教育水平逐年提高。从承载力上看,上海人口总量合理,但人口分布的不合理影响了人口结构的发展、城市社会的融合,带来了核心区人口过密、产城融合不畅的问题,以及偏好"人脑"、排斥"人手"的问题。面对人口老龄化和可能的人口逆流,上海应稳定人口总量,建设整体推进的多中心发展人口分布格局,完善户籍制度改革,破解"新二元结构",推动社会保障和公共服务均等化,同时结合政府改革,完善相关配套改革措施。     

Multinomial Selection in the Presence of Infinite Alternatives

We propose a new procedure for the multinomial selection problem to solve a real problem of any modern Air Force: the elaboration of better air-to-air tactics for Beyond Visual Range air-to-air combat that maximize its aircraft survival probability H(θ, ω), as well as enemy aircraft downing probability G(θ, ω). In this study, using a low-resolution simulator with generic parameters for the aircraft and missiles, we could increase an average success rate of 16.69% and 16.23% for H(θ, ω) and G(θ, ω), respectively, to an average success rate of 76.85% and 79.30%. We can assure with low probability of being wrong that the selected tactic has greater probability of yielding greater success rates in both H(θ, ω) and G(θ, ω) than any simulated tactic.