共查询到20条相似文献，搜索用时 343 毫秒
1.
本文从分析焦点、核心工具使用、方法实用性、临界值的选择以及方法应用上存在的局限等方面,对目前OECD国家最为流行的三种集群识别分析方法——基于"钻石"模型的波特集群分析方法、基于投入产出分析的集群识别方法以及基于有向图分析的集群识别方法进行了深入细致的比较研究,从中分析出三种方法各自所具有的特点、主要优点以及存在的不足。 相似文献
2.
3.
通过科技计划引导与支持,实现高新技术产业集群科技创新资源的优化配置,是提高产业集群科技创新能力的一条有效途径。本文对产业集群不同生命周期阶段特征进行分析,设计产业集群发展阶段识别方法,提出产业集群不同阶段科技计划支持策略及有关建议,旨在为促进产业集群科技创新资源优化配置,加快自主创新提供借鉴与参考。 相似文献
4.
5.
集群持续竞争力的培育 总被引：3，自引：0，他引：3
在描述集群竞争力维度的基础上,对集群竞争力的来源进行了分析,认为集群内的知识转移,共享与创新,对集群外知识源的吸收并在集群内培育具有区别于其他集群的独占性与异质性的知识创新能力是集群竞争力得以持续的重要手段,从培育基于根植性的外部知识吸收能力与提升集群内的知识共享与创新能力两个角度分析了集群如何实现从封闭到开放的知识系统的转变途径。 相似文献
6.
创新集群及其分类研究 总被引：4，自引：0，他引：4
文章从创新集群内外部联系的角度，基于创新集群的一些基本特质，将创新集群分成四种不同的类型，对每种集群的特点进行了深入探讨，并分析了四种集群之间的异同，为制定相应的集群发展政策奠定良好的基础。 相似文献
7.
8.
基于共享性资源的集群企业竞争优势分析 总被引：16，自引：0，他引：16
对基于资源的企业竞争优势理论观点进行了简要评述,引出资源观通常采用的企业资源二分法之外的第三类资源——集群企业的共享性资源;结合产业集群的特性及相关理论,阐明了基于集群的共享性资源形成机理;运用资源观的分析方法,通过分析共享性资源异质性的构成,阐明基于共享性资源的集群企业竞争优势理论观点,并论述了集群企业与共享性资源的互动关系;最后,作出简要总结,并指出研究的不足及今后相关领域进一步研究的方向。 相似文献
9.
黄新月 《内蒙古科技与经济》2023,(14):41-44
在经济转型的大背景下，协同创新是加快产业集群升级发展的有效途径。基于协同创新理论结合知识价值链理论对产业集群竞争力进行了理论分析，并构建协同创新下产业集群竞争力评价指标体系，采用AHP法研究分析了产业集群竞争力评价指标体系，根据指标权重结果给出了提高产业集群竞争力的参考建议。 相似文献
10.
与跨国战略联盟和组织内部的学习不同,企业集群的学习是一种基于区域共同背景和特定环境相联系的地方化学习,它促进了企业间的知识转移和知识分享.阐述了地理临近与企业集群知识转移机理;从前向、后向和多角三个维度对集群地方化学习方式进行阐述,并对基于地方化学习的知识转移影响因素进行分析;针对集群地方化学习的局限性,提出了通过全球-地方网络的互动学习来增强集群的持续发展能力. 相似文献
11.
In this paper, we investigate the cluster anti-consensus problem for multi-agent systems with directed information exchange. The algebra graph theory is reviewed and the properties of signless Laplacian matrix of a directed graph are derived. Then a new control protocol is designed to achieve cluster anti-consensus of multi-agent systems based on the Q-theory. Sufficient conditions are given to guarantee the cluster anti-consensus of multi-agent systems by using the properties of signless Laplacian matrix. Numerical simulations show the effectiveness of our theoretical results. 相似文献
12.
Many science and engineering problems can be represented by a network, a generalization of which is a graph. Examples of the problems that can be represented by a graph include: cyclic sequential circuit, organic molecule structures, mechanical structures, etc. The most fundamental issue with these problems (e.g., designing a molecule structure) is the identification of structure, which further reduces to be the identification of graph. The problem of the identification of graph is called graph isomorphism. The graph isomorphism problem is an NP problem according to the computational complexity theory. Numerous methods and algorithms have been proposed to solve this problem. Elsewhere we presented an approach called the eigensystem approach. This approach is based on a combination of eigenvalue and eigenvector which are further associated with the adjacency matrix. The eigensystem approach has been shown to be very effective but requires that a graph must contain at least one distinct eigenvalue. The adjacency matrix is not shown sufficiently to meet this requirement. In this paper, we propose a new matrix called adjusted adjacency matrix that meets this requirement. We show that the eigensystem approach based on the adjusted adjacency matrix is not only effective but also more efficient than that based on the adjacency matrix. 相似文献
13.
14.
This paper investigates the problem of global leader-following consensus of multiple integrator agents subject to control input saturation. A weighted and saturated consensus algorithm is proposed to solve this problem. Both the case of an undirected communication topology and the case of a directed communication topology are considered. It is shown that global consensus of the multiple integrator agents can be reached under a general undirected graph or a detailed balanced directed graph provided that its generated graph contains a directed spanning tree. Numerical examples are provided to demonstrate the theoretical results. 相似文献
15.
This paper presents novel fixed-time controllers for the distributed tracking of multi-agent systems with double-integrator dynamics based on the input shaping technique under directed graphs. It is assumed that there is no cycle in the directed graph with a globally reachable leader. Distributed fixed-time controllers are designed for cases with various initial conditions by placing input shapers in all communication edges in the graph. Numerical simulations and experimental studies are conducted to verify the effectiveness of the proposed controllers. 相似文献
16.
探讨有向非平衡网络多个系统的加权平均一致性问题,研究发现只要固定拓扑有向网络强连通,系统就可以达到一致性。运用广义李雅普诺夫函数对系统进行收敛性分析,并给出仿真图。 相似文献
17.
In this paper, we provide a new insight into clustering with a spring–mass dynamics, and propose a resulting hierarchical clustering algorithm. To realize the spectral graph partitioning as clustering, we model a weighted graph of a data set as a mass–spring dynamical system, where we regard a cluster as an oscillating single entity of a data set with similar properties. And then, we describe how oscillation modes are related with eigenvectors of a graph Laplacian matrix of the data set. In each step of the clustering, we select a group of clusters, which has the biggest number of constituent clusters. This group is divided into sub-clusters by examining an eigenvector minimizing a cost function, which is formed in such a way that subdivided clusters will be balanced with large size. To find k clusters out of non-spherical or complex data, we first transform the data into spherical clusters located on the unit sphere positioned in the (k−1)-dimensional space. In the sequel, we use the previous procedure to these transformed data. The computational experiments demonstrate that the proposed method works quite well on a variety of data sets, although its performance degrades with the degree of overlapping of data sets. 相似文献
18.
研发项目是涉及顾客需求、产品功能和部件、团队等多知识领域的复杂系统,与大数据技术相关的知识图谱方法可以更加客观全面地展示、分析不同领域间的关联,为此,本文提出新产品开发(NPD)知识图谱,并将其与依赖结构矩阵(DSM)等方法相结合,以识别研发项目中多领域间的相互依赖关系。首先,本文建立依据NPD知识图谱测度顾客需求优先序的模型,并采用DSM和质量功能展开(QFD)方法,建立由“需求-功能”QFD关联推导功能间依赖关系强度的模型。然后,采用“功能-产品”多领域矩阵(MDM)推导部件间的依赖关系强度。最后,对DSM进行聚类,为提高聚类算法的稳定性,采用改进的信息熵,建立了改进的基于信息熵的两阶段DSM聚类模型,算例分析表明,该方法可明显降低类间的协调复杂性并提高算法的稳定性。 相似文献
19.
In this paper, we study the algebraic connectivity of directed complex networks with scale-free property. Algebraic connectivity of a directed graph is the eigenvalue of its Laplacian matrix whose real part is the second smallest. This is known as an important measure for the diffusion speed of many diffusion processes over networks (e.g. consensus, information spreading, epidemics). We propose an algorithm, extending that of Barabasi and Albert, to generate directed scale-free networks, and show by simulations the relations between algebraic connectivity and network size, exponents of in/out-degree distributions, and minimum in/out degrees. The results are moreover compared to directed small-world networks, and demonstrated on a specific diffusion process, reaching consensus. 相似文献