工程监督网络一体化集成管理功能探析

通过分析推进工程监督管理制度化、规范化和科学化过程中所表现出的现状特点,进一步提高监督执行力,解决在目前体制下工程监督管理所面临的难题和挑战,需要将监督人员管理和现场工程项目内容管理有机统一起来．构建一个适用的工程监督管理平台,形成工程监督网络一体化集成管理模式。阐述了这一平台所需完善的闭环管理、集成管理、动态管理、网络化培训、自助管理和数量化动态考核等功能。     

Efficiency in coalition games with externalities

A natural extension of superadditivity is not sufficient to imply that the grand coalition is efficient when externalities are present. We provide a condition, analogous to convexity, that is sufficient for the grand coalition to be efficient and show that this also implies that the (appropriately defined) core is nonempty. Moreover, we propose a mechanism which implements the most efficient partition for all coalition formation games and characterizes the resulting payoff division.     

视频流应用层组播系统的设计与实现

文章设计了一个用于视频流分发的应用层组播系统,系统由视频采集、视频编解码、组播传输和服务器4个模块构成。视频捕获采用Video for Windows(VFW)技术实现,编解码基于H.263标准。网络结构上提出使用混合P2P树形结构,降低了中心服务器的压力,服务器负责会议成员信息的管理,为组播树的建立与维护提供支持,组播传输使用基于度约束的构造算法,考虑了节点带宽和计算能力。该系统已投入运行,基本达到设计目标。     

模块化全球生产网络与我国战略性新兴产业嵌入发展

认为模块化全球生产网络的演化是一个一体化—模块化—修正调整—一体化的循环过程,分析了该网络中存在的两类入围竞争以及瀑布效应的形成。在此基础上,提出我国战略性新兴产业嵌入发展应实现的四重转变:从低端的点嵌入转向高端的系统嵌入;随着网络演化阶段的推进实现动态性嵌入发展;从被动单向参与国际分工转向主动双向嵌入发展;从后发嵌入发展转向先发嵌入发展。     

基于知识产权的组织间关系网络的演化特征

分析了基于知识产权的组织间关系网络的基本内涵和构成要素,将基于知识产权的组织间关系网络的生命周期划分为5个阶段——创立阶段、成长阶段、成熟阶段、衰退阶段和解散阶段,具体论述了各阶段的组织间关系网络的演化特征。以对450家企业的深度访谈和问卷调查为基础,通过描述性统计分析、因子分析以及多元方差分析来实证研究目标一致性、信息沟通以及信任等关系属性在各阶段的传递规律。研究结果表明,基于知识产权的组织间关系属性的顶峰阶段并非都出现在关系生命周期的成熟阶段。     

供应链核心企业社会责任研究——以复杂网络理论为视角

核心企业往往通过制定不合理契约将社会责任风险转移到供应链中的相关利益方.通过复杂网络理论构建核心型供应链网络拓扑结构模型,对核心型供应链网络中社会责任风险传播的非线性动力学行为进行分析,研究表明:一方面,由于供应链网络具有非线性的特点,导致社会责任风险在整个供应链网络中涌现,最终严重影响到核心企业以及供应链的适应性成长;另一方面,核心企业在供应链网络中具有较高的度,对供应链网络的稳定性起到决定性作用.因此,有必要通过强化核心企业的社会责任主导作用来实现供应链社会责任治理.     

Approachability with bounded memory

We study Blackwell's approachability in repeated games with vector payoffs when the approaching player is restricted to use strategies with bounded memory: either strategies with bounded recall, or strategies that can be implemented by finite automata. Our main finding is that the following three statements are equivalent for closed sets. (i) The set is approachable with bounded recall strategies. (ii) The set is approachable with strategies that can be implemented with finite automata. (iii) The set contains a convex approachable set. Using our results we show that (i) there are almost-regret-free strategies with bounded memory, (ii) there is a strategy with bounded memory to choose the best among several experts, and (iii) Hart and Mas-Colell's adaptive learning procedure can be achieved using strategies with bounded memory.     

The architecture of R&D joint projects: the social network analysis approach

This paper examines the effect of network properties on the performance R&D joint projects. In particular, we examine the impact of network cohesion, diversity and shape on the performance of these of exploration and exploitation R&D projects. We test these measures using data on projects from European R&D networks developed under the framework of Eureka projects. The empirical results indicated some network properties enhance the project’s performance and these differ depending on the kind of technological project developed. Our results suggest a lower heterogeneity, greater cohesion and network centralisation in exploitation than in exploration projects. Our findings show different types of structures depending on the aim of the joint project and that there exist different degrees of cohesion between the partners that comprise the core and the peripheral nodes.     

商业信用与企业规模的负相关关系——基于关系网络的理论分析与实证检验

企业所提供的商业信用规模和企业规模之间的关系,在发达国家和发展中国家表现迥异,发达国家是正相关关系,而发展中国家是负相关关系。企业规模、关系网络和商业信用三者之间的关系是造成这一差异的主要原因。     

Beliefs and rationalizability in games with complementarities

We propose two characteristics of beliefs and study their role in shaping the set of rationalizable strategy profiles in games with incomplete information. The first characteristic, type-sensitivity, is related to how informative a player thinks his type is. The second characteristic, optimism, is related to how “favorable” a player expects the outcome of the game to be. The paper has two main results: the first result provides an upper bound on the size of the set of rationalizable strategy profiles; the second gives a lower bound on the change of location of this set. These bounds are explicit expressions that involve type-sensitivity, optimism, and payoff characteristics. Our results generalize and clarify the well-known uniqueness result of global games (Carlsson and van Damme, 1993). They also imply new uniqueness results and allow us to study rationalizability in new environments. We provide applications to supermodular mechanism design (Mathevet, 2010b) and information processing errors.