略论影响清代赋税制度的主要因素

清朝为适应商品经济的发展,屡次改革其赋税制度,虽然取得一定效果,但是从总体上来说未能充分保证中央的财政收入。造成这种状况的根本原因是超稳定的自然经济结构遏制了商品经济的发展,阻碍了社会财富总量的增加;直接原因是中央的“不完全财政制度”造成了赋税征收失控;重要原因是封建官僚制度制约赋税制度的有效执行。     

管理类本科生导师制应用研究

针对管理类本科生培养问题,采用归纳分析的方法,对管理类本科生实行导师制的必要性进行阐述,总结了本科生导师制的遴选、培训、激励以及评价机制的建立及实施效果,指出目前实施管理类本科生导师制存在的主要问题,提出建立导师培训制度、推行双向选择和完善导师评价机制等建议。研究结果对管理专业本科生导师制建设有指导意义。     

Generalized Bhaskar Rao designs

Generalized Bhaskar Rao designs with non-zero elements from an abelian group G are constructed. In particular this paper shows that the necessary conditions are sufficient for the existence of generalized Bhaskar Rao designs with k=3 for the following groups: ?G? is odd, G=Z^r₂, and G=Z^r₂×H where 3? ?H? and r?1. It also constructs generalized Bhaskar Rao designs with υ=k, which is equivalent to υ rows of a generalized Hadamard matrix of order n where υ?n.     

A note on the construction of some lattices for the hypercubic association scheme

This paper presents a method of construction for some PBIB lattices for the hypercubic association scheme.     

Minimal Basis for a Connected Markov Chain over 3 × 3 ×K Contingency Tables with Fixed Two-Dimensional Marginals

This paper considers a connected Markov chain for sampling 3 × 3 ×K contingency tables having fixed two‐dimensional marginal totals. Such sampling arises in performing various tests of the hypothesis of no three‐factor interactions. A Markov chain algorithm is a valuable tool for evaluating P‐values, especially for sparse datasets where large‐sample theory does not work well. To construct a connected Markov chain over high‐dimensional contingency tables with fixed marginals, algebraic algorithms have been proposed. These algorithms involve computations in polynomial rings using Gröbner bases. However, algorithms based on Gröbner bases do not incorporate symmetry among variables and are very time‐consuming when the contingency tables are large. We construct a minimal basis for a connected Markov chain over 3 × 3 ×K contingency tables. The minimal basis is unique. Some numerical examples illustrate the practicality of our algorithms.     

AN ALGORITHM FOR CONSTRUCTING OPTIMAL RESOLVABLE ROW-COLUMN DESIGNS

This paper describes an effective algorithm for constructing optimal or near-optimal resolvable row-column designs (RCDs) with up to 100 treatments. The performance of this algorithm is assessed against 20 2-replicate resolvable RCDs of Patterson & Robinson (1989) and 17 resolvable RCDs based on generalized cyclic designs (GCDs) of Ipinyomi & John (1985). The use of the algorithm to construct RCDs with contiguous replicates is discussed.     

Optimal correction for continuity in the chi-squared test in 2×2 tables

The most common asymptotic procedure for analyzing a 2 × 2 table (under the conditioning principle) is the ‰ chi-squared test with correction for continuity (c.f.c). According to the way this is applied, up to the present four methods have been obtained: one for one-tailed tests (Yates') and three for two-tailed tests (those of Mantel, Conover and Haber). In this paper two further methods are defined (one for each case), the 6 resulting methods are grouped in families, their individual behaviour studied and the optimal is selected. The conclusions are established on the assumption that the method studied is applied indiscriminately (without being subjected to validity conditions), and taking a basis of 400,000 tables (with the values of sample size n between 20 and 300 and exact P-values between 1% and 10%) and a criterion of evaluation based on the percentage of times in which the approximate P-value differs from the exact (Fisher's exact test) by an excessive amount. The optimal c.f.c. depends on n, on E (the minimum quantity expected) and on the error α to be used, but the rule of selection is not complicated and the new methods proposed are frequently selected. In the paper we also study what occurs when E ≥ 5, as well as whether the chi-squared by factor (n-1).     

On the distribution of independence test for the residuals of space-time arma models

The procedure for building space-time autoregressive moving average (STARMA) models depends on the form of the variance-covariance matrix G of the underlying errors (see Pfeifer Deutsch (1980a,c)). In this paper the distribu¬tion of the statistic for testing the hypothesis that G is diagonal is obtained in a very convenient computational form. A table of critical values for the test is given Comparison is made with the approximate values obtained by Pfeifer Deutsch (1980c)     

An algorithm for constructing optimal resolvable incomplete block designs

This paper describes an efficient algorithm for the construction of optimal or near-optimal resolvable incomplete block designs (IBDs) for any number of treatments v < 100. The performance of this algorithm is evaluated against known lattice designs and the 414 or-designs of Patterson & Williams [36]. For the designs under study, it appears that our algorithm is about equally effective as the simulated annealing algorithm of Venables & Eccleston [42]. An example of the use of our algorithm to construct the row (or column) components of resolvable row-column designs is given.