基于CAS理论的企业员工群体行为模拟

基于复杂适应性系统理论(complex adaptive system,CAS),利用SWARM平台开发了基于多主体的群体行为模拟系统,应用激励学习和遗传算法实现员工在模拟中的学习与适应能力,用元胞自动机方法模拟员工的行为,并建立了群体系统模型,模型中的各个主体具有其自身的行为规则和策略,通过主体以及主体与其周围环境之间的相互作用和影响,使群体系统涌现出宏观层面上的特征.最后对一个员工群体示例进行模拟试验,分析和预测引起员工群体行为变化的原因.     

公司经营者激励过程的定性模拟技术研究

定性模拟是以非数字化的手段处理信息输入、建模行为分析和结果输出等模拟环节,通过定性建模推导系统的定性行为描述.为了使定性模拟技术在管理领域得到广泛推广,针对公司经营者的激励问题,根据定性模拟理论,在一般激励过程的基础上,提出了在定性关系条件下的经营者激励过程的综合模型,并运用QSIM算法来模拟经营者激励过程的综合模型.     

Total completion time minimization in online hierarchical scheduling of unit-size jobs

This paper investigates an online hierarchical scheduling problem on m parallel identical machines. Our goal is to minimize the total completion time of all jobs. Each job has a unit processing time and a hierarchy. The job with a lower hierarchy can only be processed on the first machine and the job with a higher hierarchy can be processed on any one of m machines. We first show that the lower bound of this problem is at least \(1+\min \{\frac{1}{m}, \max \{\frac{2}{\lceil x\rceil +\frac{x}{\lceil x\rceil }+3}, \frac{2}{\lfloor x\rfloor +\frac{x}{\lfloor x\rfloor }+3}\}\), where \(x=\sqrt{2m+4}\). We then present a greedy algorithm with tight competitive ratio of \(1+\frac{2(m-1)}{m(\sqrt{4m-3}+1)}\). The competitive ratio is obtained in a way of analyzing the structure of the instance in the worst case, which is different from the most common method of competitive analysis. In particular, when \(m=2\), we propose an optimal online algorithm with competitive ratio of \(16\) \(/\) \(13\), which complements the previous result which provided an asymptotically optimal algorithm with competitive ratio of 1.1573 for the case where the number of jobs n is infinite, i.e., \(n\rightarrow \infty \).     

Neighbor sum distinguishing index of 2-degenerate graphs

We consider proper edge colorings of a graph G using colors in \(\{1,\ldots ,k\}\). Such a coloring is called neighbor sum distinguishing if for each pair of adjacent vertices u and v, the sum of the colors of the edges incident with u is different from the sum of the colors of the edges incident with v. The smallest value of k in such a coloring of G is denoted by \({\mathrm ndi}_{\Sigma }(G)\). In this paper we show that if G is a 2-degenerate graph without isolated edges, then \({\mathrm ndi}_{\Sigma }(G)\le \max \{\Delta (G)+2,7\}\).     

股票回购对我国证券市场的现实意义

股票回购在发达国家早已是一个非常成熟的资本运作方式,在我国却是一项金融创新举措,探讨了股票回购对我国证券市场的现实意义,并针对目前我国实施股票回购的障碍提出几点建议。     

On Shortest k-Edge-Connected Steiner Networks in Metric Spaces

Given a set of points P in a metric space, let l(P) denote the ratio of lengths between the shortest k-edge-connected Steiner network and the shortest k-edge-connected spanning network on P, and let r = inf l(P) P for k 1. In this paper, we show that in any metric space, r 3/4 for k 2, and there exists a polynomial-time -approximation for the shortest k-edge-connected Steiner network, where = 2 for even k and = 2 + 4/(3k) for odd k. In the Euclidean plane, and .     

Leader-member exchange as a linking pin in the idiosyncratic deals - Performance relationship in workgroups

In the current investigation, idiosyncratic deals (i-deals; individualized work arrangements) are modeled as differentiated resources that shape leader-member exchange (LMX) relationships in workgroups. We integrate literature on leader-member exchange (LMX) with research on i-deals to argue that employee evaluations of i-deals received from the grantor –typically the leader- enhance employee perceptions of LMX, which in turn become instrumental in generating positive performance outcomes. Furthermore, because workgroup characteristics have potential implications on the relationship between a deal grantor and the deal recipient, drawing upon social identity theory of leadership, we reason that the i-deals-LMX relationship is affected by the overall value congruence among the group members. Cross-level moderated mediation analyses on multi source data obtained from 289 employees nested in 60 workgroups showed that the mediational role of LMX in the i-deals to performance outcomes relationship was weaker in high value congruence groups.     

高新技术网络企业知识创新能力影响因素分析——基于西安高新区企业的实证研究

在知识经济时代,知识创新作为知识管理中的重要环节,是提升竞争能力的有效途径,但现有文献对网络企业知识创新能力的影响因素仍然缺乏系统、全面的分析。通过回顾国内外研究,本文以西安高新区122家企业为研究对象,对知识创新能力的关键影响因素进行了实证研究。结果表明:(1)知识属性虽然对知识创新能力并不能产生直接影响,然而却能够通过知识共享意愿对知识创新能力产生间接影响;(2)知识吸收对知识创新能力并不能产生直接影响,然而却能够通过知识共享意愿或网络异质性间接影响知识创新能力;(3)网络异质性与知识共享意愿直接影响知识创新能力;(4)四个因素对企业知识创新能力的影响程度大小为:知识吸收>网络异质性>知识共享意愿>知识属性。     

Inapproximability and approximability of maximal tree routing and coloring

Let G be a undirected connected graph. Given g groups each being a subset of V(G) and a number of colors, we consider how to find a subgroup of subsets such that there exists a tree interconnecting all vertices in each subset and all trees can be colored properly with given colors (no two trees sharing a common edge receive the same color); the objective is to maximize the number of subsets in the subgroup. This problem arises from the application of multicast communication in all optical networks. In this paper, we first obtain an explicit lower bound on the approximability of this problem and prove Ω(g^1−ε)-inapproximability even when G is a mesh. We then propose a simple greedy algorithm that achieves performance ratio O√|E(G)|, which matches the theoretical bounds. Supported in part by the NSF of China under Grant No. 70221001 and 60373012.