关于新中国社会科学院士制度问题的研究

中国的院士制度起步很晚 ,恢复和建立社会科学院士制度更是步履维艰。为此 ,党、政府以及领导人与社会科学界 ,已就这一重大问题做过大量的工作 ,包括论证、讨论和呼吁等 ,尤其是 1980年、1993年和 1994年 ,相继恢复和设立起自然科学方面的科学院学部委员、院士制度与工程院院士制度以来 ,要求恢复和建立中国社会科学院士制度的呼吁与讨论更趋热烈。社会科学院士制度是对有重大社会科学成就者的一种认可和激励机制 ,是全面落实“尊重知识 ,尊重人才”以及“两手抓 ,两手都要硬”的党和国家路线、方针和政策的得力措施。社会科学使命重大 ,恢复和建立社会科学院士制度势在必行 ,不能再拖延了。     

Optimum spacings of elementary treatment contrasts in symmetrical 2-factor pa block designs

The concept of optimum spacing of an arbitrary group of treatments was introduced by Sinha and Sinha (1969) in a study of the relative efficiencies of a group of block designs. In this paper, the optimum spacings of elementary treatment contrasts in a 2-factor symmetrical block design with Property A are studied using the A-optimality criterion. Conditions for optimum spacings are expressed in terms of the relative magnitudes of the efficiency factors.     

Cyclic designs for a covariate model

A linear model with one treatment at V levels and first order regression on K continuous covariates with values on a K-cube is considered. We restrict our attention to classes of designs d for which the number of observations N to be taken is a multiple of V, i.e. N = V × R with R ≥2, and each treatment level is observed R times. Among these designs, called here equireplicated, there is a subclass characterized by the following: the allocation matrix of each treatment level (for short, allocation matrix) is obtained through cyclic permutation of the columns of the allocation matrix of the first treatment level. We call these designs cyclic. Besides having easy representation, the most efficient cyclic designs are often D-optimal in the class of equireplicated designs. A known upper bound for the determinant of the information matrix M(d) of a design, in the class of equireplicated ones, depends on the congruences of N and V modulo 4. For some combinations of parameter moduli, we give here methods of constructing families of D-optimal cyclic designs. Moreover, for some sets of parameters (N, V,K = V), where the upper bound on ∣M(d)∣ (for that specific combination of moduli) is not attainable, it is also possible to construct highly D-efficient cyclic designs. Finally, for N≤24 and V≤6, computer search was used to determine the most efficient design in the class of cyclic ones. They are presented, together with their respective efficiency in the class of equireplicated designs.     

浅析我国的绿色城市设计

分析了绿色城市设计作为未来城市设计发展主要方向的必然性及其特征,并结合北京为响应"绿色奥运"的口号所做的绿色城市设计实例,探讨了绿色城市设计的要求与实施途径。     

On the non-existence of generalised Hadamard matrices

The determinant of a generalized Hadamard matrix over its group ring factored out by the relation Σ_gεG G = 0 is shown to have certain number theoretic properties. These are exploited to prove the non-existence of many generalised Hadamard matrices for groups whose orders are divisible by 3, 5 or 7. For example the GH(15, C₁₅), GH(15, C₃) and GH(15, C₅) do not exist. Also for certain n and G we find the set of determinants of the GH(n, G) matrices.     

Balanced e-optimal designs of resolution III for the 2×3 series

We consider the problem of constructing designs which are E-optimal in the class of all balanced resolution III designs for the 2^m×3ⁿ series. The inverse of the information matrix for general resolution III balanced 2^m×3ⁿ designs is obtained. Optimal designs are constructed for the cases (m,n)=(3, 1), (4, 1), (2, 2) and (3, 2) for various numbers of runs in the practical range.     

A novel test to compare two treatments based on endpoints involving both nonfatal and fatal events

In a clinical trial comparing two treatment groups, one commonly‐used endpoint is time to death. Another is time until the first nonfatal event (if there is one) or until death (if not). Both endpoints have drawbacks. The wrong choice may adversely affect the value of the study by impairing power if deaths are too few (with the first endpoint) or by lessening the role of mortality if not (with the second endpoint). We propose a compromise that provides a simple test based on the time to death if the patient has died or time since randomization augmented by an increment otherwise. The test applies the ordinary two‐sample Wilcoxon statistic to these values. The formula for the increment (the same for experimental and control patients) must be specified before the trial starts. In the simplest (and perhaps most useful) case, the increment assumes only two values, according to whether or not the (surviving) patient had a nonfatal event. More generally, the increment depends on the time of the first nonfatal event, if any, and the time since randomization. The test has correct Type I error even though it does not handle censoring in a customary way. For conditions where investigators would face no easy (advance) choice between the two older tests, simulation results favor the new test. An example using a renal‐cancer trial is presented. Copyright © 2015 John Wiley & Sons, Ltd.     

Construction of Cross-Over Designs for Comparing Test Treatments with Control Using Terraces

Segregated half-and-half and mutually orthogonal power sequence terraces have been used in this article for the construction of some new families of control balanced cross-over designs, which are Schur-optimal. One of the advantages of using terraces is that designs with larger number of treatments can also be constructed with relative ease. Designs up to 17 treatments have been constructed in this article.     

Minimal Markov Basis for Tests of Main Effect Models for 2p-1 Fractional Factorial Designs of Resolution p

We consider conditional exact tests of factor effects in design of experiments for discrete response variables. Similarly to the analysis of contingency tables, Markov chain Monte Carlo methods can be used to perform exact tests, especially when large-sample approximations of the null distributions are poor and the enumeration of the conditional sample space is infeasible. In order to construct a connected Markov chain over the appropriate sample space, one approach is to compute a Markov basis. Theoretically, a Markov basis can be characterized as a generator of a well-specified toric ideal in a polynomial ring and is computed by computational algebraic software. However, the computation of a Markov basis sometimes becomes infeasible, even for problems of moderate sizes. In the present article, we obtain the closed-form expression of minimal Markov bases for the main effect models of 2^{p ? 1} fractional factorial designs of resolution p.