设计语言与传统绘画

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

On a Dualization of Graphical Gaussian Models: A Correction Note

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

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

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

论日本狭隘的集团意识对侵略战争及战后反省的影响

日本传统社会的核心是由上下级隶属关系所产生的报恩观念和忠诚思想,这种思想在战争时期强烈地影响了日本民族的群体行为,使日本全民族投入到了对战争的狂热支持之中,并出于对民族集团的忠诚意识而拒绝或淡化战后对战争的反省。     

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

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

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.     

图的点星荫度

引入了图的点星荫度的概念,研究了一般图的点星荫度的上界,着重讨论了平面图和外平面图的点星荫度。     

k+l色k-饱和图

给出了一类具有较多边数的k+1色k-饱和图(不含K_k,但添加任一边都含K_k的图)的结构。导出了n点最大k+1色k-饱和图的边数的下界。