2003年度本刊被《中国数学文摘》收录论文

薪酬是对劳动者期望的满足,可分为固定薪酬和浮动薪酬。本文根据期望理论及保健激励理论,对固定薪酬和浮动薪酬的激励因素作探索性研究分析。     

于细微处见功力——谈危机事件中政府舆论引导的细节问题

从近期政府对于一系列危机事件的处理来看,政府对于危机事件中的舆论引导日渐重视,舆论引导能力有了一定的提高。但是,欠发达地区政府与发达地区政府、县（区）级政府与市级政府相比,处理危机事件的能力还存在较大差距,舆论引导中细节处理还不到位。政府处理不同地区、不同性质的危机事件时,特别需要注重舆论的引导方式、事件发生所在地区的差异性、网络舆情的监测与引导和成立专门的政府公共关系部门等细节问题,以加强政府与社会、媒体、公众的互动。     

复杂劳动与简单劳动换算的困境与出路

关于复杂劳动与简单劳动换算的辩争持续了一个多世纪.文章从劳动的三个层面入手,运用信息传递与筛选模型进行了研究,结果表明复杂劳动与简单劳动换算的关键在于信息的传递与筛选,而信息的传递与筛选又依赖于一系列的制度.     

用改进的试探函数法求解广义KdV方程

试探函数法求解非线性数学物理中一个非常著名的非线性偏微分方程—广义KdV方程,求得其一般形式的指数函数解,据此不但求得了广义KdV方程的sech2型钟状正则孤波解,而且求得了其csch2型奇异行波解,最后,利用一些熟知的数学关系式,又求得其若干其它显式精确解,包括三角函数型周期波解等。     

论人身损害赔偿金的定期金给付方式

最高人民法院的司法解释确立了人身损害赔偿金以一次性给付为主、定期金给付为补充的给 付原则,从而确立了定期金给付制度。定期金给付的范围限于将来的残疾赔偿金、被扶养人生活费、残疾辅助 器具费。定期金给付的标准,残疾赔偿金按照受诉法院所在地上一年度城镇居民人均可支配收入或者农村居 民人均收入标准,被扶养人生活费按照受诉法院所在地上一年度城镇居民或者农村居民平均生活费标准,残 疾器具费按照普通适用器具的费用标准。采用定期金方式给付相关费用,应当提供相应的担保。定期金给付 与一次性给付并不互相排斥。     

Calculating the simplex median

While much attention has recently focussed on the use of multivariate medians for estimating the centre of a data set, a particular median based upon random simplexes proposed by Liu has been overshadowed by progress on other multivariate medians. The purpose of this paper is to redress the balance, and to show that Liu's simplex median is tractable, and has distinctive desirable properties that recommend it for use in data analysis.     

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.     

Algorithms for restricted least absolute value estimation

We present a concise summary of recent progress in developing algorithms for restricted least absolute value (LAV) estimation (i. e. ?₁ approximation subject to linear constraints). The emphasis is on our own new algorithm, and we provide some numerical results obtained with it.     

Embedding of orthogonal arrays of strength two and deficiency greater than two

Let x ≥ 0 and n ≥ 2 be integers. Suppose there exists an orthogonal array $\text{A(n, q, μ}{}^1\text{)}$ of strength 2 in n symbols with q rows and $\text{n}{}^2\text{μ}{}^1$ columns where $\text{q = q}{}^1\text{? d, q}{}^1\text{= n}{}^2\text{x + n + 1}$, $\text{μ}{}^1\text{= (n ?}\text{1}\text{)x +}\text{1}$ and d is a positive integer. Then d is called the deficiency of the orthogonal array. The question of embedding such an array into a complete array $\text{A(n, q}{}^1\text{, μ}{}^1\text{)}$ is considered for the case d ≥ 3. It is shown that for d = 3 such an embedding is always possible if n ≥ 2(d ? 1)²(2d² ? 2d + 1). Partial results are indicated if d ≥ 4 for the embedding of a related design in a corresponding balanced incomplete block design.     

弱正则环和Reduced弱正则环

本文用本质理想刻划了弱正则环的充要条件，并给出了一个环是Reduced弱正则环的充要条件。