均匀设计在证券投资决策中的应用

在根据均匀设计点产生初始投资组合方案的基础上,应用相对有效性的DEA评价方法,给出最佳投资组合决策方案。实证分析表明了该方法的有效性。     

非均匀分布下区间数排序可能度计算模型及其应用

区间数排序的可能度计算模型是学术界一直在不断探索的基础性问题之一。区间数刻画着事物属性特征的取值范围,以往学术界都假设在区间内的取值服从均匀分布。本文将均匀分布推广到一般分布,运用概率论的方法,构建了一个新的区间数排序的可能度计算模型,由此修正了以往关于两个区间数全等的定义,提出了区间数形等的概念,同时进一步修正了可能度的自反性条件和区间数的综合排序方法,并将理论应用于多属性决策问题,给出了基本的决策过程,通过实例决策问题的计算,呈现了新理论和新方法的可行性和合理性,具有很好的推广应用价值。     

An estimation of distribution algorithm for lot-streaming flow shop problems with setup times

Lot-streaming flow shops have important applications in different industries including textile, plastic, chemical, semiconductor and many others. This paper considers an n-job m-machine lot-streaming flow shop scheduling problem with sequence-dependent setup times under both the idling and no-idling production cases. The objective is to minimize the maximum completion time or makespan. To solve this important practical problem, a novel estimation of distribution algorithm (EDA) is proposed with a job permutation based representation. In the proposed EDA, an efficient initialization scheme based on the NEH heuristic is presented to construct an initial population with a certain level of quality and diversity. An estimation of a probabilistic model is constructed to direct the algorithm search towards good solutions by taking into account both job permutation and similar blocks of jobs. A simple but effective local search is added to enhance the intensification capability. A diversity controlling mechanism is applied to maintain the diversity of the population. In addition, a speed-up method is presented to reduce the computational effort needed for the local search technique and the NEH-based heuristics. A comparative evaluation is carried out with the best performing algorithms from the literature. The results show that the proposed EDA is very effective in comparison after comprehensive computational and statistical analyses.     

Assortment Planning for Vertically Differentiated Products

We consider the problem of a retailer managing a category of vertically differentiated products. The retailer has to pay a fixed cost for each product included in the assortment and a variable cost per product sold. Quality levels, fixed, and variable costs are exogenously determined. Customers differ in their valuation of quality and choose the product (if any) that maximizes their utility. First, we consider a setting in which the selling prices are also fixed. We find that the optimal set of products to offer depends on the distribution of customer valuations and might include dominated products, that is, products which are less attractive than at least one other product, on every possible dimension. We develop an efficient algorithm to identify an optimal assortment. Second, we consider a setting in which the retailer also determines the selling prices. We show that in this case the optimal assortment does not include any dominated product and does not vary with the distribution of customer valuations when there is no fixed cost. We develop several efficient algorithms to identify an optimal assortment and optimally price the products. We also test the applicability of our methods with realistic data for two product categories.     

OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks

This paper investigates the MINimum-length-\(k\)-Disjoint-Paths (MIN-\(k\)-DP) problem: in a sensor network, given two nodes \(s\) and \(t\), a positive integer \(k\), finding \(k\) (node) disjoint paths connecting \(s\) and \(t\) with minimum total length. An efficient distributed algorithm named Optimally-Finding-Disjoint-Paths (OFDP) is proposed for this problem. OFDP guarantees correctness and optimality, i.e., (1) it will find \(k\) disjoint paths if there exist \(k\) disjoint paths in the network or the maximum number of disjoint paths otherwise; (2) the disjoint paths it outputs do have minimum total length. To the best of our knowledge, OFDP is the first distributed algorithm that can solve the MIN-\(k\)-DP problem with correctness and optimality guarantee. Compared with the existing centralized algorithms which also guarantee correctness and optimality, OFDP is shown to be much more efficient by simulation results.     

中国企业渠道联盟关系影响因素研究

渠道联盟被认为是渠道关系中最高、最好的形式。学术界对渠道联盟关系影响因素的研究主要集中在承诺、信任、沟通与合作等方面。本文实证研究了影响中国企业渠道联盟关系的若干因素及其影响程度,特别是探讨了私人关系和行政因素等的影响程度。     

基于流通基本方程的人民币研究

本文在一些假设的基础上推导出了我国货币流通的基本方程,并结合我国的当前实际情况,描述我国的人民币市场。     

The influence of organizational identification on organizational knowledge management (KM)

Information technology (IT) outsourcing vendor organizations contain isolated business units whose creation and sustenance greatly facilitate business operations. But they also introduce important challenges for organizational knowledge management (KM). In this paper, based on 7 months of intensive field-work at India Inc., a leading Indian IT firm, we looked at how members’ identification with two organizations, their own and their client organization, influences their compliance with an organizational KM initiative. The findings show that members have difficulties in complying with the expectations of the organizational KM initiative owing to a stronger identification with their client organizations. At the same time, they comply readily with KM initiatives at the business unit level. The findings show that KM managers at India Inc. use the help of middle level managers in the business units in their efforts to improve members’ compliance with organizational KM. Theoretical and managerial implications of the study are discussed.     

家族性、社会认知与家族创业行为

与非家族性企业创建过程不同,家族性是家族创业行为所独有的特性.具有亲情或血缘关系的家族创业者之间强调奉献和关爱的利他行为,形成家族创业行为的集体性创业智慧即家族性社会认知.本文通过对思凡公司12年的创业历程分析发现,家族性能形成具有稳定性、一致性和可靠性的家族性社会认知,而创业行动可以增强家族性社会认知能力;由家族性产生的集体性社会认知有利于家族创业机会识别和把握、资源能力改进和创业组织形式动态演变.研究表明,以不断提高的家族性社会认知为驱动力,组织认知模式和创业行动路径选择之间互动形成了家族企业创业活动演进过程.