设计语言与传统绘画

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

On a Dualization of Graphical Gaussian Models: A Correction Note

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

论李燮和与辛亥上海光复

在辛亥上海光复过程中,光复会第三号领袖人物李燮和的功劳最大,但他在随后争夺沪军都督时首先被排挤出局,则是他自身诸多不足所造成的。李燮和在辛亥上海光复过程中所表现出来的不计个人名利得失、顾全革命大局的高姿态值得大书一笔,这是整个辛亥革命史上的一个亮点。后来的国民党官方史学家们以李燮和后来参加“筹安会”为口实,刻意贬低李燮和在上海光复中的作用与贡献,是站不住脚的,也是不足取的。     

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

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

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

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

日据至光复初期台湾博物馆管窥

日据至光复初期台湾的主要博物馆有4个,其中首推台湾总督博物馆,次为台中教育博物馆,台南教育博物馆,嘉义通俗博物馆。台湾总督博物馆,是台湾最早的博物馆,历史可追溯到1899年;1945年台湾光复,改称为台湾省博物馆。此外,当时台湾的部分院校和科研机构,亦设置有博物馆、植物园及小型的陈列馆或标本室。     

归入权问题之研究

通过对归入权行使对象、行使主体、行使范围的论述 ,对《证券法》第 42条的修改提出了相关建议 :归入权行使对象应当扩大 ,行使主体不仅应包括董事会、监事会、股东 ,在一定条件下 ,证监会也可以作为行使主体。在计算归入权的收益上可采取最高卖价减最低买价法予以计算。     

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.