中国地级城市投资环境评价研究

外商直接投资在我国不同城市的分布极不平衡,投资环境差异是造成该现象的主要原因。为此提出了城市投资环境评价的指标体系,通过对全国167个城市的数据进行因子分析,研究和评价了各城市的投资环境,并从实证的角度,验证了投资环境与FD I以及GDP的结构关系。     

基于集成供应的RS契约协调模型研究

在由供应商和制造商组成的两级供应链中引入集成商,研究了需求不确定且价格敏感条件下基于集成供应的3级供应链的协调问题,建立了满足渠道协调条件和集成供应条件的RS契约协调模型,给出了模型中RS契约参数的取值范围和取值过程,并用实例加以说明。利用模型不仅可以确定产品的生产量和销售价格,而且还可以通过RS契约参数实现供应链利润的分配。     

家族企业可持续发展的路径选择研究

家族企业在全世界经济中占有重要地位。从各个不同角度研究家族企业可持续发展的理论问题,介绍家族企业可持续发展路径选择的SHEMP理论,并且探讨了此种路径选择与环境的关系:从宏观的角度进行家族企业可持续发展的PEST分析,进而提出在现有融资环境、诚信环境和职业经理人市场条件下,我国家族企业的选择路径。     

Reliable Ad Hoc Routing Based on Mobility Prediction

Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, because some of the wireless links along a shortest path may be broken shortly after the path is established due to mobility of mobile nodes. Rediscovering routes may result in substantial data loss and message exchange overhead. In this paper, we study reliable ad hoc routing in the urban environment. Specifically, we formulate and study two optimization problems. In the minimum Cost Duration-bounded Path (CDP) routing problem, we seek a minimum cost source to destination path with duration no less than a given threshold. In the maximum Duration Cost-bounded Path (DCP) routing problem, we seek a maximum duration source to destination path with cost no greater than a given threshold. We use a waypoint graph to model the working area of a MANET and present an offline algorithm to compute a duration prediction table for the given waypoint graph. An entry in the duration prediction table contains the guaranteed worst-case duration of the corresponding wireless link. We then present an efficient algorithm which computes a minimum cost duration-bounded path, using the information provided in the duration prediction table. We also present a heuristic algorithm for the DCP routing problem. In addition, we show that the proposed prediction and routing schemes can be easily applied for designing reliable ad hoc routing protocols. Simulation results show that our mobility prediction based routing algorithms lead to higher network throughput and longer average path duration, compared with the shortest path routing. This research was supported in part by ARO grant W911NF-04-1-0385 and NSF grant CCF-0431167. The information reported here does not reflect the position or the policy of the federal government.     

Energy conservation through resource-aware movement in heterogeneous mobile ad hoc networks

Energy conservation in mobile ad hoc networks is of paramount importance because most mobile nodes usually have very limited energy supply. Previous research on this issue focused on the design at the network or MAC or physical layer. In this paper, we study this problem from the new perspective of node mobility, i.e., analyzing the impact of node movement on energy conservation. In particular, armed with the inherent resource heterogeneity in mobile ad hoc networks, we propose a novel resource-aware movement strategy to make better use of some powerful nodes to achieve energy conservation. We also formulate the resource-aware movement as a NP-complete distance-constrained least-cost (DCLC) routing problem and propose an efficient heuristic solution. Extensive simulations have been used to demonstrate the effectiveness of the proposed schemes.     

The web proxy location problem in general tree of rings networks

The Web proxy location problem in general networks is an NP-hard problem. In this paper, we study the problem in networks showing a general tree of rings topology. We improve the results of the tree case in literature and get an exact algorithm with time complexity O(nhk), where n is the number of nodes in the tree, h is the height of the tree (the server is in the root of the tree), and k is the number of web proxies to be placed in the net. For the case of networks with a general tree of rings topology we present an exact algorithm with O(kn ²) time complexity.This research has been supported by NSF of China (No. 10371028) and the Educational Department grant of Zhejiang Province (No. 20030622).     

Competitive analysis for make-to-order scheduling with reliable lead time quotation

This paper makes extended studies on the discrete problem of online scheduling and reliable lead time quotation (discrete Q-SLTQ) introduced by Keskinocak et al. (Manag. Sci. 47(2):264–279, 2001). We first relax the assumption on revenue function from a linear decreasing function to any decreasing function. We present an online deterministic strategy which is optimal in competitiveness for concave revenue functions. The above results are further extended to the continuous Q-SLTQ model where orders are released at arbitrary time points. For the discrete Q-SLTQ problem, if orders are with nonuniform lengths, we prove the nonexistence of online strategies with bounded competitive ratios; otherwise if orders are with unit length but various weights, we present an optimal online strategy.     

Multiple L(j,1)-labeling of the triangular lattice

Let n,j,k be nonnegative integers. An n-fold L(j,k)-labeling of a graph G is an assignment f of sets of nonnegative integers of order n to the vertices of G such that, for any two vertices u,v and any two integers a∈f(u), b∈f(v), |a?b|≥j if uv∈E(G), and |a?b|≥k if u and v are distance two apart. The span of f is the absolute difference between the maximum and minimum integers used by f. The n-fold L(j,k)-labeling number of G is the minimum span over all n-fold L(j,k)-labelings of G. Let n,j,k and m be nonnegative integers. An n-fold circular m-L(j,k)-labeling of a graph G is an assignment f of subsets of {0,1,…,m?1} of order n to the vertices of G such that, for any two vertices u,v and any two integers a∈f(u), b∈f(v), min{|a?b|,m?|a?b|}≥j if uv∈E(G), and min{|a?b|,m?|a?b|}≥k if u and v are distance two apart. The minimum m such that G has an n-fold circular m-L(j,k)-labeling is called the n-fold circular L(j,k)-labeling number of G. This paper provides upper and lower bounds for the n-fold L(j,1)-labeling number and the n-fold circular L(j,1)-labeling number of the triangular lattice and determines the n-fold L(2,1)-labeling number and n-fold circular L(2,1)-labeling number of the triangular lattice for n≥3.     

An improved algorithm for tree edit distance with applications for RNA secondary structure comparison

An ordered labeled tree is a tree in which the nodes are labeled and the left-to-right order among siblings is relevant. The edit distance between two ordered labeled trees is the minimum cost of transforming one tree into the other through a sequence of edit operations. We present techniques for speeding up the tree edit distance computation which are applicable to a family of algorithms based on closely related recursion strategies. These techniques aim to reduce repetitious steps in the original algorithms by exploring certain structural features in the tree. When these features exist in a large portion of the tree, the speedup due to our techniques would be significant. Viable examples for application include RNA secondary structure comparison and structured text comparison.     

连带责任治理在供应商集群中的有效性研究

在核心企业与供应商集群的渠道关系情境下探讨连带责任治理对机会主义行为的作用,将网络中心性和使用渠道权力纳入连带责任治理研究框架,考察二者对机会主义行为的影响以及对连带责任与机会主义行为之间关系的调节效应。以一家出口企业的供应商集群为研究对象,获得82个连带责任小组样本共246个被调查者的调查数据,应用SPSS 19．0软件和层级回归法对研究假设进行检验。研究结果表明,供应商之间的连带责任对其机会主义行为有显著的抑制作用;供应商领导者的网络中心性负向影响其他供应商成员的机会主义行为,并强化连带责任对机会主义行为的抑制作用;核心企业通过使用渠道权力负向影响供应商集群的机会主义行为,但会弱化连带责任对机会主义行为的抑制作用。