How does distance affect market entry mode choice? Evidence from French companies

The objective of this article is to examine the relevant dimensions of distance for foreign market entry mode choice. Based on a sample of 203 interfirm linkages formed by French multinationals with partners across the world, we analyze the impact of four dimensions of distance on the choice between cooperative alliances and mergers-acquisitions. The findings indicate that administrative and economic distance have a significant influence on market entry mode choice, whereas the impact of cultural and geographic distance is not significant. They further highlight the important role of the host country's government effectiveness for market entry mode decisions.     

设计语言与传统绘画

民族文化除了它的民族性以外,还有它的时代性。运用现代的美学观念与传统文化相结合,是我国艺术设计发展的必然之路。     

On a Dualization of Graphical Gaussian Models: A Correction Note

Abstract.  We correct two proofs concerning Markov properties for graphs representing marginal independence relations.     

非负权最短路问题的一种简便算法

提出了非负权最短路问题的一种新算法。与有名的Ｄｉｊｋｓｔｒａ算法相比，这种算法计算简便、容易理解、易于编程。     

R＆D经费投入的国际比较与借鉴

R&D经费投入是评价国家科技实力和科技发展水平的首选指标 ,长期以来已为世界各国和重要国际组织所普遍采用。本文主要针对我国R&D经费投入与国际间的比较 ,分析我国R&D投入所处的阶段及R&D投入方面存在的差距与困难 ,最后提出对策与建议     

略论现代远程教育中素质教育的实现途径

现代远程教育具有独特的教与学模式、教学管理模式和运行机制。现代远程教育领域实施素质教育,在教育理念及实现途径上,都必须考虑到技术层面的因素、学习者的特征、教与学模式的特点。为此,必须重点把握如下环节:确定素质教育的重点内容,创设基于计算机网络的学习环境,确立专业教育和课程教学在素质教育中的主渠道作用,创新教与学模式,探索有效的实践教学方式,营造富有特色的校园文化,建立科学的评价体系。     

汉、藏、蒙古族大学生创造性思维与推理能力比较研究

本文采用问卷调查,对汉、藏和蒙古族大学生的创造性思维发展水平和推理能力进行调研。结果表明:汉、藏、蒙古族大学生创造性思维的发展从总体趋势上呈现不均衡;不同民族大学生的创造性思维和推理能力发展呈现出各自的特点;认识水平与概括能力制约着不同民族大学生推理能力的发展。     

Bayesian analysis of directed graphs data with applications to social networks

Summary.  A fully Bayesian analysis of directed graphs, with particular emphasis on applica- tions in social networks, is explored. The model is capable of incorporating the effects of covariates, within and between block ties and multiple responses. Inference is straightforward by using software that is based on Markov chain Monte Carlo methods. Examples are provided which highlight the variety of data sets that can be entertained and the ease with which they can be analysed.     

Markov Properties for Acyclic Directed Mixed Graphs

We consider acyclic directed mixed graphs, in which directed edges ( x → y ) and bi-directed edges ( x ↔ y ) may occur. A simple extension of Pearl's d -separation criterion, called m -separation, is applied to these graphs. We introduce a local Markov property which is equivalent to the global property resulting from the m -separation criterion for arbitrary distributions.     

A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs

Abstract.  A Markov property associates a set of conditional independencies to a graph. Two alternative Markov properties are available for chain graphs (CGs), the Lauritzen–Wermuth–Frydenberg (LWF) and the Andersson–Madigan– Perlman (AMP) Markov properties, which are different in general but coincide for the subclass of CGs with no flags . Markov equivalence induces a partition of the class of CGs into equivalence classes and every equivalence class contains a, possibly empty, subclass of CGs with no flags itself containing a, possibly empty, subclass of directed acyclic graphs (DAGs). LWF-Markov equivalence classes of CGs can be naturally characterized by means of the so-called largest CGs , whereas a graphical characterization of equivalence classes of DAGs is provided by the essential graphs . In this paper, we show the existence of largest CGs with no flags that provide a natural characterization of equivalence classes of CGs of this kind, with respect to both the LWF- and the AMP-Markov properties. We propose a procedure for the construction of the largest CGs, the largest CGs with no flags and the essential graphs, thereby providing a unified approach to the problem. As by-products we obtain a characterization of graphs that are largest CGs with no flags and an alternative characterization of graphs which are largest CGs. Furthermore, a known characterization of the essential graphs is shown to be a special case of our more general framework. The three graphical characterizations have a common structure: they use two versions of a locally verifiable graphical rule. Moreover, in case of DAGs, an immediate comparison of three characterizing graphs is possible.