企业集团内部管理体制的生成与演进分析--以湖南华菱集团"二元分层经营"体制为例

华菱集团"二元分层经营"体制是由参与人关联博弈产生的"内生性规则",它的多条反馈路径构成了复杂的互动机制,使"二元分层经营"体制具有自我维系或自组织倾向,路径依赖和创新是其演进特征.     

试论比较文学与翻译研究的关系

本文通过分别探寻比较文学与翻译研究的定义,认为比较文学与翻译研究的关系既不是许多比较文学家以为的＂翻译研究是比较文学之下的一个分支＂,也不是巴斯奈特宣称的＂比较文学是翻译研究之下的一个分支＂。事实上两者之间具有＂交而不同＂的关系,它们的不同在于两者有各自关注的对象：文学和翻译;它们的相交点在于二者共同关注文学翻译并且都开始＂文化转向＂。     

串联延伸系统网络化教学及其实践研究

探索适合需求的教学法是提高本科教学质量的重点研究课题。论文对课题组教学改革探索总结的"串联延伸系统网络化教学法"理论进行了阐述,该教学法包括课堂"三二三"讲授法、串联延伸系统网络化教与学、多元化教学方法和综合教学评价,该教学法在中兽医教学中进行了实践,教学效果良好。     

Robustness group divisible designs

Robustness of group divisible (GD) designs is investigated, when one block is lost, in terms of efficiency of the residual design. The exact evaluation of the efficiency can be made for singular GD and semi-regular GD designs as ell as regular GD designs with λ₁ = 0. In a regular GD design with λ₁ > 0, the efficiency may depend upon the lost block and sharp upper and lower bounds on the efficiency are presented. The investigation shows that GD designs are fairly robust in terms of efficiency. As a special case, we can also show the robustness of balanced incomplete block design when one block is lost.     

“联系阅读”在《历史与社会》教学中的价值与实施方法

在《历史与社会》课程教学中实施的阅读活动必须体现综合性学习特征,必然发展成为“联系阅读”。“联系阅读”有助于提升学习者的综合思维能力、落实自主学习与探究学习、优化教学结构、提升教师教学能力。根据学习目标和内容的不同,“联系阅读”可以分为“单次联系阅读”与“多次联系阅读”两种主要课型。“联系阅读”要求教师设计合理的阅读目标、进行得当的阅读指导、选择精准的阅读内容、保障充足的阅读时间并重视阅读测评的及时反馈。     

环的连通性与半自反模

本文利用连通性和半自反模刻划了环，得到了域，遗传环，priffer整环，Dedekind整环，VN正则环等常见环的连通特征及其相互之间的等价关系。     

Approximation algorithms for connected facility location problems

We study Connected Facility Location problems. We are given a connected graph G=(V,E) with nonnegative edge cost c _e for each edge e∈E, a set of clients D⊆V such that each client j∈D has positive demand d _j and a set of facilities F⊆V each has nonnegative opening cost f _i and capacity to serve all client demands. The objective is to open a subset of facilities, say , to assign each client j∈D to exactly one open facility i(j) and to connect all open facilities by a Steiner tree T such that the cost is minimized for a given input parameter M≥1. We propose a LP-rounding based 8.29 approximation algorithm which improves the previous bound 8.55 (Swamy and Kumar in Algorithmica, 40:245–269, 2004). We also consider the problem when opening cost of all facilities are equal. In this case we give a 7.0 approximation algorithm.     

A characterization of a universally optimal design within a class of block designs

It is shown that within the class of connected binary designs with arbitrary block sizes and arbitrary replications only a symmetic balanced incomplete block design produces a completely symmetric information matrix for the treatment effects whenever the number of blocks is equal to the number of treatments and the number of experimental units is an integer multiple of the number of treatments. Such a design is known to be universally optimal.     

Some bounds on balanced block designs

Bounds on the latest root of the C-matrix and the number of blocks for a variance-balanced block design are given. These results contain the well-known results as special cases.     

Interacting neighbour point processes: Some models for clustering

We introduce a class of spatial point processesinteracting neighbour point (INP) processes, where the density of the process can be written by means of local interactions between a point and subsets of its neighbourhood but where the processes may not be Ripley-Kelly Markov processes with respect to this neighbourhood. We show that the processes are iterated Markov processes defined by Hayat and Gubner (1996). Furthermore, we pay special attention to a subclass of interacting neighbour processes, where the density belongs to the exponential family and all neighbours of a point affect it simultaneously. A simulation study is presented to show that some simple processes of this subclass can produce clustered patterns of great variety. Finally, an empirical example is given.