Demographic crisis: The impact of the Bangladesh civil war (1971) on births and deaths in a rural area of Bangladesh

Summary In Matlab Bazaar Thana the Cholera Research Laboratory has registered the births, deaths and migrations in a population of approximately 125,000 since 1966. Although this rural area was not the scene of any significant armed encounters, striking changes in birth and death rates were registered during and after the conflict. Birth rates did not change during the relatively brief period of the civil war, but a small decline was registered for one year after the war. Fertility rates which had been declining slightly and irregularly in the pre-war baseline period may have increased slightly during the war and fell substantially in all age groups in the year following the war. The crude death rate, which rose by 37 per cent during the war, was a very sensitive reflection of the administrative and economic problems. Overall infant mortality rose by only 15 per cent over pre-war levels because all of the increase was observed in the post-neo-natal component, which traditionally accounts for less than one-third of the total infant mortality in Bangladesh. Children and older adults accounted for the majority of excess deaths which were largely attributed to acute diarrhoeas and other gastro-intestinal causes. The death rate at ages 1-4 rose by 43 per cent and at ages 5-9 soared to 208 per cent above pre-war baseline rates. All increases in age-specific mortality rates fell to baseline levels during the year following the war, except the 5-9-year age group, in which rates continued to be high largely because of deaths due to dysentery.     

Task partitioning in new product development teams: A knowledge and learning perspective

R&D alliances and outsourcing elements of the new product development process are now commonplace practices among many firms. However, little previous work has examined how these organizational choices influence project knowledge and learning. Based on a comparison of three new product development projects in the software industry, this paper examines how task partitioning in the project influences learning and knowledge development within the firm. The paper suggests that internal development projects encourage synthetic learning and development of architectural and tacit knowledge; in contrast, outsourcing and joint ventures encourage analytic learning and development of component and explicit knowledge.     

基于网络的企业营销活动实证分析

网络的应用对企业传统的营销方式产生了冲击。本文利用对近百家企业问卷调查获得的数据,运用实证的方法,证明了我国企业由于使用网络改善了其营销活动并有利于提高了营销绩效,并进一步分析了客户关系管理与信息管理在网络环境下职能的变化。     

公司企业家精神培育的系统理论假设模型及验证

企业家精神是企业永续发展的不竭动力。是21世纪推动一个国家经济发展最主要的动力之一。本文从微观角度出发,研究公司如何采取有效的措施促进公司企业家精神的培育,进而提高公司的经营业绩。笔者在国内外相关领域研究成果的基础上,提出了影响公司企业家精神培育的系统理论假设模型,并通过实证研究验证了假设模型。     

由现收现付制向基金制转轨的经济学分析

文章讨论了有关养老保险体系转轨的几个基本的经济学问题。首先从宏观经济运行的角度出发探讨了以下两个问题 :为什么要从现收现付制向基金制转轨 ?对于现阶段的中国来说马上向基金制转轨是否是最优的选择 ?文章还阐释了基金制下的收益率的决定因素并对基金制与现收现付制的风险因素进行了比较 ,最后对养老保险体系的改革提出了几点建议     

Chinese version of the OSI: A validation study

This article examines the construct validity of the Occupational Stress Indicator (OSI) in its Chinese version as well as its criterion-oriented validity against self-reported data on absenteeism and accidents, using a final sample of 1054 workers in the Chinese manufacturing and power industries. The divergent and convergent validities of five of the OSI scales—Job satisfaction, Physical ill-health, Mental ill-health, Type A behaviour and Control—were examined by a multimethod-multitrait matrix technique. Results indicated that the Chinese OSI had fairly good validity in relation to other well-established measures as well as relevant organizational behaviours.     

One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions

Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned n_i numbers with n_i lying in a given range. The goal is to maximize a Schur convex function F whose ith argument is the sum of numbers assigned to part i. The shape of a partition is the vector consisting of the sizes of its parts, further, a shape (without referring to a particular partition) is a vector of nonnegative integers (n₁,..., n_p) which sum to n. A partition is called size-consecutive if there is a ranking of the parts which is consistent with their sizes, and all elements in a higher-ranked part exceed all elements in the lower-ranked part. We demonstrate that one can restrict attention to size-consecutive partitions with shapes that are nonmajorized, we study these shapes, bound their numbers and develop algorithms to enumerate them. Our study extends the analysis of a previous paper by Hwang and Rothblum which discussed the above problem assuming the existence of a majorizing shape. This research is partially supported by ROC National Science grant NSC 92-2115-M-009-014.     

Inapproximability and approximability of maximal tree routing and coloring

Let G be a undirected connected graph. Given g groups each being a subset of V(G) and a number of colors, we consider how to find a subgroup of subsets such that there exists a tree interconnecting all vertices in each subset and all trees can be colored properly with given colors (no two trees sharing a common edge receive the same color); the objective is to maximize the number of subsets in the subgroup. This problem arises from the application of multicast communication in all optical networks. In this paper, we first obtain an explicit lower bound on the approximability of this problem and prove Ω(g^1−ε)-inapproximability even when G is a mesh. We then propose a simple greedy algorithm that achieves performance ratio O√|E(G)|, which matches the theoretical bounds. Supported in part by the NSF of China under Grant No. 70221001 and 60373012.     

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).     

基于反向物流的商品定价和退货政策研究

综述了基于反向物流的商品定价和退货政策的最新研究成果。在此基础上,通过建立模型,对基于反向物流的商品定价策略和退货政策进行了进一步的研究,并求出了商品的最优价格和最优退货价格。基于模型,对管理提出了一些建议。最后指出了将来可能的研究方向。