认知问题和群知识浅析

研究群知识的形式模型有助于澄清抽象的哲学概念以及概念之间的关系。然而，目前群知识的形式化的处理方法和哲学所讨论的群知识是相脱离的。对群知识的形式化的定义可称为集体知识，是关于公共问题的分布知识以及公共知识和全分布知识之间的桥梁。所有的知识都是基于对主体的不同概念的区分而获得的。为了对认知群和集体知识进行模型，需要引入新的克里普模型，即认知群模型。定义一个好的群知识有助于对基于群知识的更高层次的哲学讨论。     

Adaptive designs for single‐arm phase II trials in oncology

Clinical phase II trials in oncology are conducted to determine whether the activity of a new anticancer treatment is promising enough to merit further investigation. Two‐stage designs are commonly used for this situation to allow for early termination. Designs proposed in the literature so far have the common drawback that the sample sizes for the two stages have to be specified in the protocol and have to be adhered to strictly during the course of the trial. As a consequence, designs that allow a higher extent of flexibility are desirable. In this article, we propose a new adaptive method that allows an arbitrary modification of the sample size of the second stage using the results of the interim analysis or external information while controlling the type I error rate. If the sample size is not changed during the trial, the proposed design shows very similar characteristics to the optimal two‐stage design proposed by Chang et al. (Biometrics 1987; 43:865–874). However, the new design allows the use of mid‐course information for the planning of the second stage, thus meeting practical requirements when performing clinical phase II trials in oncology. Copyright © 2012 John Wiley & Sons, Ltd.     

邓小平社会主义核心价值观教育思想探析

以泰州某大跨度连续梁桥的静动载试验为例，建立ANSYS和桥梁博士模型进行静动力有限元数值计算。将试验结果与模型计算值进行比较，试验结果表明,该桥结构刚度和承载能力满足设计要求。     

Production and changeover control policies of a class of failure prone buffered flow-shops

This article deals with a stochastic optimal control problem for a class of buffered multi-parts flow-shops manufacturing system. The involved machines are subject to random breakdowns and repairs. The flow-shop under consideration is not completely flexible and hence requires setup time and cost in order to switch the production from a part type to another, this changeover is carried on the whole line. Our objective is to find the production plan and the sequence of setups that minimise the cost function, which penalises inventories/backlogs and setups. A continuous dynamic programming formulation of the problem is presented. Then, a numerical scheme is adopted to solve the obtained optimality conditions equations for a two buffered serial machines two parts case. A complete heuristic policy, based on the numerical observations which describe the optimal policies in system states, is developed. It will be shown that the obtained policy is a combination of a KANBAN/CONWIP and a modified hedging corridor policy. Moreover, based on our observations and existent research studies extension to cover more complex flow-shops is henceforth possible. The robustness of such a policy is illustrated through sensitivity analysis.     

广告语篇连贯形成的动态模式分析

指出作为一种特殊的交际形式,广告语篇具有隐含性特点,因此,其连贯也呈现出鲜明的特征,即其连贯是隐性的;广告语篇连贯的形成过程是一个语言使用者不断建立心理空间的动态过程。     

Comment on “Constrained Optimization Approaches to Estimation of Structural Models”

We revisit the comparison of mathematical programming with equilibrium constraints (MPEC) and nested fixed point (NFXP) algorithms for estimating structural dynamic models by Su and Judd (2012). Their implementation of the nested fixed point algorithm used successive approximations to solve the inner fixed point problem (NFXP‐SA). We redo their comparison using the more efficient version of NFXP proposed by Rust (1987), which combines successive approximations and Newton–Kantorovich iterations to solve the fixed point problem (NFXP‐NK). We show that MPEC and NFXP are similar in speed and numerical performance when the more efficient NFXP‐NK variant is used.     

Identifying Latent Structures in Panel Data

This paper provides a novel mechanism for identifying and estimating latent group structures in panel data using penalized techniques. We consider both linear and nonlinear models where the regression coefficients are heterogeneous across groups but homogeneous within a group and the group membership is unknown. Two approaches are considered—penalized profile likelihood (PPL) estimation for the general nonlinear models without endogenous regressors, and penalized GMM (PGMM) estimation for linear models with endogeneity. In both cases, we develop a new variant of Lasso called classifier‐Lasso (C‐Lasso) that serves to shrink individual coefficients to the unknown group‐specific coefficients. C‐Lasso achieves simultaneous classification and consistent estimation in a single step and the classification exhibits the desirable property of uniform consistency. For PPL estimation, C‐Lasso also achieves the oracle property so that group‐specific parameter estimators are asymptotically equivalent to infeasible estimators that use individual group identity information. For PGMM estimation, the oracle property of C‐Lasso is preserved in some special cases. Simulations demonstrate good finite‐sample performance of the approach in both classification and estimation. Empirical applications to both linear and nonlinear models are presented.     

A Dynamic Model of Demand for Houses and Neighborhoods

This paper develops a dynamic model of neighborhood choice along with a computationally light multi‐step estimator. The proposed empirical framework captures observed and unobserved preference heterogeneity across households and locations in a flexible way. We estimate the model using a newly assembled data set that matches demographic information from mortgage applications to the universe of housing transactions in the San Francisco Bay Area from 1994 to 2004. The results provide the first estimates of the marginal willingness to pay for several non‐marketed amenities—neighborhood air pollution, violent crime, and racial composition—in a dynamic framework. Comparing these estimates with those from a static version of the model highlights several important biases that arise when dynamic considerations are ignored.     

Benefits of Hybrid Lateral Transshipments in Multi‐Item Inventory Systems under Periodic Replenishment

Lateral transshipments are a method of responding to shortages of stock in a network of inventory‐holding locations. Conventional reactive approaches only seek to meet immediate shortages. The study proposes hybrid transshipments which exploit economies of scale by moving additional stock between locations to prevent future shortages in addition to meeting immediate ones. The setting considered is motivated by retailers who operate networks of outlets supplying car parts via a system of periodic replenishment. It is novel in allowing non‐stationary stochastic demand and general patterns of dependence between multiple item types. The generality of our work makes it widely applicable. We develop an easy‐to‐compute quasi‐myopic heuristic for determining how hybrid transshipments should be made. We obtain simple characterizations of the heuristic and demonstrate its strong cost performance in both small and large networks in an extensive numerical study.