Despite the increased attention on boundary spanning in organiz- ations, we still know surprisingly little about how boundaries are formed and what spanning activities can be applied to the context of offshore outsour...Despite the increased attention on boundary spanning in organiz- ations, we still know surprisingly little about how boundaries are formed and what spanning activities can be applied to the context of offshore outsourcing firms （OOFs）. This paper examines the antecedents of boundary formation in OOFs and proposes that spanning activities can help OOFs to realize return from their IT investment in an effective and efficient manner. Our findings show that two theoretical models have been identified in this paper. The first model proposed that three boundaries are formed in the OOFs, namely structure, knowledge and subcultural boundaries. We explored the formation process and detailed with steps. The second model therefore is proposed to span these three boundaries and we have expiored detailed mechanisms in this paper.展开更多
A fault-tolerant 1-spanner is used to preserve all the minimum energy paths after node failures to cope with fault-tolerant topology control problems in wireless ad hoc networks. A fault-tolerant 1-spanner is a graph ...A fault-tolerant 1-spanner is used to preserve all the minimum energy paths after node failures to cope with fault-tolerant topology control problems in wireless ad hoc networks. A fault-tolerant 1-spanner is a graph such that the remaining graph after node failures will not only remain connected, but also have a stretch factor of one. The fault-tolerant 1-spanner is used in a localized and distributed topology control algorithm, named the k-Fault-Tolerant 1-Spanner （k-FT1S）, where each node constructs a minimum energy path tree for every local failed node set. This paper proves that the topology constructed by k-FT1S is a k-fault-tolerant 1-spanner that can tolerate up to k node failures, such that the remaining network after node failures preserves all the minimum energy paths of the remaining network gained from the initial network by removing the same failed nodes. Simulations show that the remaining network after removal of any k nodes still has the optimal energy efficiency and is competitive in terms of average logical degree, average physical degree, and average transmission radius.展开更多
With applications in communication networks,the minimum stretch spanning tree problem is to find a spanning tree T of a graph G such that the maximum distance in T between two adjacent vertices is minimized.The proble...With applications in communication networks,the minimum stretch spanning tree problem is to find a spanning tree T of a graph G such that the maximum distance in T between two adjacent vertices is minimized.The problem has been proved NP-hard and fixed-parameter polynomial algorithms have been obtained for some special families of graphs.In this paper,we concentrate on the optimality characterizations for typical classes of graphs.We determine the exact formulae for the complete k-partite graphs,split graphs,generalized convex graphs,and several planar grids,including rectangular grids,triangular grids,and triangulated-rectangular grids.展开更多
文摘Despite the increased attention on boundary spanning in organiz- ations, we still know surprisingly little about how boundaries are formed and what spanning activities can be applied to the context of offshore outsourcing firms （OOFs）. This paper examines the antecedents of boundary formation in OOFs and proposes that spanning activities can help OOFs to realize return from their IT investment in an effective and efficient manner. Our findings show that two theoretical models have been identified in this paper. The first model proposed that three boundaries are formed in the OOFs, namely structure, knowledge and subcultural boundaries. We explored the formation process and detailed with steps. The second model therefore is proposed to span these three boundaries and we have expiored detailed mechanisms in this paper.
基金Supported by the National Natural Science Foundation of China (No.60932005)
文摘A fault-tolerant 1-spanner is used to preserve all the minimum energy paths after node failures to cope with fault-tolerant topology control problems in wireless ad hoc networks. A fault-tolerant 1-spanner is a graph such that the remaining graph after node failures will not only remain connected, but also have a stretch factor of one. The fault-tolerant 1-spanner is used in a localized and distributed topology control algorithm, named the k-Fault-Tolerant 1-Spanner （k-FT1S）, where each node constructs a minimum energy path tree for every local failed node set. This paper proves that the topology constructed by k-FT1S is a k-fault-tolerant 1-spanner that can tolerate up to k node failures, such that the remaining network after node failures preserves all the minimum energy paths of the remaining network gained from the initial network by removing the same failed nodes. Simulations show that the remaining network after removal of any k nodes still has the optimal energy efficiency and is competitive in terms of average logical degree, average physical degree, and average transmission radius.
基金by National Key R&D Program of China(No.2019YFB2101604).
文摘With applications in communication networks,the minimum stretch spanning tree problem is to find a spanning tree T of a graph G such that the maximum distance in T between two adjacent vertices is minimized.The problem has been proved NP-hard and fixed-parameter polynomial algorithms have been obtained for some special families of graphs.In this paper,we concentrate on the optimality characterizations for typical classes of graphs.We determine the exact formulae for the complete k-partite graphs,split graphs,generalized convex graphs,and several planar grids,including rectangular grids,triangular grids,and triangulated-rectangular grids.
