企业技术创新网络及其治理研究

本文论述了企业技术创新网络及其存在的机理，从企业创新网络的选择、治理机制和国家创新系统角度，对企业创新网络的治理进行了初步研究。     

Redundant networks and minimum distance

Networks in which each node is directly linked to its nearest neighbors exhibit high reliability and message handling capability. The construction of such networks guaranteeing minimal length, for a given degree of redundancy, is formulated in zero-one integer linear programming terms. Initial feasible solutions to the programs are presented, but connectedness is not guaranteed. In the latter case further zero-one integer programs are proposed assuring connectedness, with given initial feasible solutions. The inefficiency of zero-one programs for large networks leads to consideration of alternate redundant connected networks, without guaranteed minimal length. These networks are based on “nearest- neighbor edge sets”, and are simple to construct. Various theorems on the properties of such networks are presented with applications to one-way communicability.     

Knowledge networks: Dilemmas and paradoxes

After defining knowledge networks and the basic concepts of paradox and dilemmas, I analyze a sample of paradoxes/dilemmas commonly associated with them involving culture, structure, cognition, and actionable knowledge. In doing this I focus on how one side of the dilemmas is often associated with negative connotations that drive managers away from that choice. So, for example, hoarding, while it clearly benefits individuals in certain contexts, is typically viewed as a selfish act that hurts the collective. I conclude this essay with a discussion of the need for managers to deliberately confront dilemmas.     

Complexity, networks and knowledge flow

Because knowledge plays an important role in the creation of wealth, economic actors often wish to skew the flow of knowledge in their favor. We ask, when will an actor socially close to the source of some knowledge have the greatest advantage over distant actors in receiving and building on the knowledge? Marrying a social network perspective with a view of knowledge transfer as a search process, we argue that the value of social proximity to the knowledge source depends crucially on the nature of the knowledge at hand. Simple knowledge diffuses equally to close and distant actors because distant recipients with poor connections to the source of the knowledge can compensate for their limited access by means of unaided local search. Complex knowledge resists diffusion even within the social circles in which it originated. With knowledge of moderate complexity, however, high-fidelity transmission along social networks combined with local search allows socially proximate recipients to receive and extend knowledge generated elsewhere, while interdependencies stymie more distant recipients who rely heavily on unaided search. To test this hypothesis, we examine patent data and compare citation rates across proximate and distant actors on three dimensions: (1) the inventor collaboration network; (2) firm membership; and (3) geography. We find robust support for the proposition that socially proximate actors have the greatest advantage over distant actors for knowledge of moderate complexity. We discuss the implications of our findings for the distribution of intra-industry profits, the geographic agglomeration of industries, the design of social networks within firms, and the modularization of technologies.     

知识管理和知识管理网络

分析和说明了学习和组织学习、知识和组织知识、知识管理的概念，概括了有关文献对知识的分类，分析了知识交流的模式和知识管理的目的，并提出建立组织知识管理网络的基本思路。     

复杂网络理论在组织网络研究中的应用

本文通过分析复杂网络的结构特征及其内在嵌入性机理,回顾了复杂网络的基本理论现状。然后,分析得到了组织网络的非线性、多模块特征,发现了组织网络与复杂网络共同的行为模式。据此,将复杂网络引入到组织网络的研究中来,分别从组织网络的表示方法与分析手段,组织网络的互动关系和程度对其鲁棒性和适应性的影响,组织网络内在的协调机理,以及其局部互动与全局演化动力学特征之间的关系等几个方面探讨了复杂网络理论在组织网络研究中的应用前景。     

Untangling citation networks

The pattern of citation links between articles permits a placement in a space of points representing these articles. Using the rule that articles are placed at the centroid of the articles to which they are linked, pictures can be drawn revealing key papers and their descendants. This simple rule for placing papers by their citation pattern may also be used to scale other citation-based data. The example used in this paper is the placement of overlapping groups of articles linked by shared articles.     

Totally homogeneous networks

In network science, the non-homogeneity of node degrees has been a concerning issue for study. Yet, with today''s modern web technologies, the traditional social communication topologies have evolved from node-central structures into online cycle-based communities, urgently requiring new network theories and tools. Switching the focus from node degrees to network cycles could reveal many interesting properties from the perspective of totally homogenous networks or sub-networks in a complex network, especially basic simplexes (cliques) such as links and triangles. Clearly, compared with node degrees, it is much more challenging to deal with network cycles. For studying the latter, a new clique vector-space framework is introduced in this paper, where the vector space with a basis consisting of links has a dimension equal to the number of links, that with a basis consisting of triangles has the dimension equal to the number of triangles and so on. These two vector spaces are related through a boundary operator, for example mapping the boundary of a triangle in one space to the sum of three links in the other space. Under the new framework, some important concepts and methodologies from algebraic topology, such as characteristic number, homology group and Betti number, will play a part in network science leading to foreseeable new research directions. As immediate applications, the paper illustrates some important characteristics affecting the collective behaviors of complex networks, some new cycle-dependent importance indexes of nodes and implications for network synchronization and brain-network analysis.     

Random complex networks

Exactly what is meant by a ‘complex' network is not clear; however, what is clear is that it is something other than a random graph. Complex networks arise in a wide range of real social, technological and physical systems. In all cases, the most basic categorization of these graphs is their node degree distribution.Particular groups of complex networks may exhibit additional interesting features, including the so-called small-world efect or being scale-free. here are many algorithms with which one may generate networks with particular degree distributions(perhaps the most famous of which is preferential atachment). In this paper, we address what it means to randomly choose a network from the class of networks with a particular degree distribution, and in doing so we show that the networks one gets from the preferential atachment process are actually highly pathological. Certain properties(including robustness and fragility) which have been atributed to the(scale-free) degree distribution are actually more intimately related to the preferential atachment growth mechanism. We focus here on scale-free networks with power-law degree sequences—but our methods and results are perfectly generic.     

团队成员网络中心性、网络信任对知识转移成效的影响研究

 实现个人知识在研发团队内部的有效转移对组织的知识创造至关重要,而团队内社会网络又是影响团队内知识转移的重要渠道。研究考察了团队成员个人团队内的社会网络中心性和网络信任对团队内部知识转移成效的影响。研究认为团队成员个人在团队内的社会网络中心性对个人知识在团队内转移的成效以及个人团队内的网络信任均具有促进作用,在此基础上进一步提出了团队成员的网络信任在网络中心性影响知识转移成效中的中介作用。研究对所提假设进行了实证检验,并对结果进行了进一步的解释,旨在进一步剖析知识活动的规律,从而为企业有效的管理知识提供指导。     

Analysis and synthesis of resistive n-port networks

Various aspects of analysis and synthesis of resistive n-port networks are considered in this paper. Two different characterizations of the network are examined, the Y matrix characterization and the K matrix characterization. Based on these characterizations, a set of equations is derived which relate the edge admittances with the elements of these matrices. When the K matrix is given, these equations are linear and can be solved analytically. When the Y matrix is given, the equations are bilinear and cannot be solved analytically. In this case, the problem is formulated as an optimization problem and techniques of nonlinear programming are used to obtain a realization. Synthesis from the Y matrix is finally extended to include sensitivity considerations.     

战略网络理论溯源与研究综述

简单探讨战略网络的理论渊源,重点从战略网络的形成与进化、组织间的相互联系、价值创造及功能等几个方面,总结目前国内外战略网络理论研究的现状,并进一步指出其不足以及对有关研究方向的建议。     

Brokerage in SME networks

This study focuses on SME networks of design and high-tech companies in Southeast Netherlands. By highlighting the personal networks of members across design and high-tech industries, the study attempts to identify the main brokers in this dynamic environment. In addition, we investigate whether specific characteristics are associated with these brokers. The main contribution of the paper lies in the fact that, in contrast to most other work, it is of a quantitative nature and focuses on brokers identified in an actual network. Studying the phenomenon of brokerage provides us with clear insights into the concept of brokerage regarding SME networks in different fields. In particular we highlight how third parties contribute to the transfer and development of knowledge. Empirical results show, among others, that the most influential brokers are found in the non-profit and science sector and have a long track record in their branch.     

Optimal nonuniform distributed networks

Techniques developed in the Sturm—Liouville problem and its Inverse problem are well known in solving the analysis and synthesis problems of non-uniform distributed networks (or NUDN) (1)-(6), (15). However, very few practical results have been obtained from the theory, especially as regards the synthesis part of the problem. In this paper, we show that the chain matrix of an inhomogeneous ladder network (or IHLN) of N sections has undergone exactly the limit process of first-order difference equation approximation of the corresponding differential equation converges to the chain matrix of the corresponding NUDN uniformly on every compact subset of p = z(s)y(s) plane. Therefore an optimal NUDN is proven to be either symmetrical or antimetrical (7). Specifically, a class of optimal NUDN which is optimal on every subinterval of [O,L] has closed-form solutions, and is proven to be both symmetrical and antimetrical.     

Finite-time dynamic coverage for mobile sensor networks in unknown environments using neural networks

This paper addresses the finite-time dynamic coverage problem for mobile sensor networks in unknown environments. By introducing a condition where dynamic coverage of all points within the sensing range of each sensor exceeds the desired coverage level by a positive constant, a switching control strategy is developed to guarantee the achievement of desired coverage of the whole mission domain in finite time. The environment is modeled by a density function and neural networks are introduced to learn the function. Due to the approximation capability of neural networks, the proposed control scheme can learn the environment without a priori knowledge on the structure of the density function.     

Towards data-driven identiication and control of complex networks

<正>Control theory has been well recognized as a‘mature’discipline,but research interest has repeatedly been renewed due to the emergence of new viewpoints and introduction of new methodologies[1].Recent interests on identiication and control of complex networks provide excellent examples of such evidence(Fig.1).Uncovering complex networked sys-     

Identification and stabilization of faulty Boolean control networks

Fault-tolerant control is a fundamental branch in the modern control theory, and has wide applications such as aerospace, automotive technology and nuclear engineering. Particularly, the study of faulty Boolean control networks (BCNs) is meaningful to the disease treatment. This paper focuses on both stuck-at fault and bridging fault in BCNs, and investigates the identification and stabilization of BCNs subject to these two faults. The basic mathematical tool is semi-tensor product (STP) of matrices, which is used to determine the algebraic formulation of faulty BCNs. Through the construction of invariant sets corresponding to the faulty nodes, the relations between these two faults and state transition matrices are presented, which is helpful to identify the faulty nodes. In addition, the robust stabilization of BCNs subject to these two faults is discussed and several new criteria are derived. Finally, the obtained results are applied to analyze the stabilization of oxidative stress response pathways.