确定多总线系统容错度的有效算法

利用网络流算法技术，给出了一组求多总线系统容错度的有效算法，分析了算法的时间复杂度。文中结果说明，经典的网络流算法技术是设计多总线系统容错度算法的核心。     

Constructing brain connectivity group graphs from EEG time series

Graphical analysis of complex brain networks is a fundamental area of modern neuroscience. Functional connectivity is important since many neurological and psychiatric disorders, including schizophrenia, are described as ‘dys-connectivity’ syndromes. Using electroencephalogram time series collected on each of a group of 15 individuals with a common medical diagnosis of positive syndrome schizophrenia we seek to build a single, representative, brain functional connectivity group graph. Disparity/distance measures between spectral matrices are identified and used to define the normalized graph Laplacian enabling clustering of the spectral matrices for detecting ‘outlying’ individuals. Two such individuals are identified. For each remaining individual, we derive a test for each edge in the connectivity graph based on average estimated partial coherence over frequencies, and associated p-values are found. For each edge these are used in a multiple hypothesis test across individuals and the proportion rejecting the hypothesis of no edge is used to construct a connectivity group graph. This study provides a framework for integrating results on multiple individuals into a single overall connectivity structure.     

乘积形式的离心连通指数

设G=（V,E）是一个图,定义ηc（G）=∏uv∈E（G）（eu＋ev）,eu表示u点在G中的离心率,ηc（G）表示图G的乘积形式的离心连通指数,该指数对有机分子的结构、性质具有良好的预测作用.通过计算,给出用其他图的不变量对离心连通指数建立上界和下界的方法.此外,还找出了在直径为d、顶点数为n的树（2≤d≤n-2,n〉5）中,乘积形式的离心连通指数的最小值,并推断出顶点数为n的树中,倒数前3位的乘积形式的离心连通指数的3种树如下：1）Sn;2）n个顶点的双星图;3）对有5个顶点道路的中心添加（n-5）条悬挂边而成的树.     

从规范移植到体系建构——再论中国法律的本土化困境及其出路

中国法治建设面临一定的困境,引发对法律移植的检讨。法律多元论与文化多元论强调法律对社会的依赖性,而强调法律体系与社会之间的选择性关联理论却指出了社会是由许多不同的子系统构成,法律系统与其他系统构成了结构耦合的关系,具有相对独立性,法律移植是可能的。但法律移入国的既有法律体系对法律移植之成败具有关键意义。中国法律移植可分成两个层次,两个层次之间关系复杂,第二层次法律移植在分析中国法律移植问题时具有关键意义。     

The combinatorial characterization of certain connected 2×j×k three-way layouts

This paper gives a complete combinatorial solution to classifying connected three-way layouts of a particular kind namely those with 2 rows J columns and K treatments but only one treatment in every row-column cell. Such a design is connected if a certain simple property holds for a graph derived easily from the design.     

Hyperautomobility,the Social Organization of Space,and Health

The development of hyperautomobility in the US is having considerable impact on the social organization of space, on social life, and on public health. The geographic sprawl of urban areas, combined with the dominance of auto connectivity, promote a more privatized and individualized community life, as well as poorer environmental conditions. Public health is effected in a variety of ways, such as through the discouragement of routine walking. In addition to exacerbating the problems of traffic congestion, hyperautomobility is a basis of social exclusion for the many people who do not drive. The full range of its social and public health consequences merit more notice in the growing discourse of sustainable transport. The current intensification and globalization of auto‐centered transport systems make this attention timely.     

A note on the robustness of PBIBD(2)s against breakdown in the event of observation loss

Robustness against design breakdown following observation loss is investigated for Partially Balanced Incomplete Block Designs with two associate classes (PBIBD(2)s). New results are obtained which add to the body of knowledge on PBIBD(2)s. In particular, using an approach based on the E‐value of a design, all PBIBD(2)s with triangular and Latin square association schemes are established as having optimal block breakdown number. Furthermore, for group divisible designs not covered by existing results in the literature, a sufficient condition for optimal block breakdown number establishes that all members of some design sub‐classes have this property.     

A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity

Given an undirected graph G and two vertex subsets H1 and H2, the bi-level augmentation problem is that of adding to G the smallest number of edges such that the resulting graph contains two internally vertex-disjoint paths between every pair of vertices in H1 and two edge-disjoint paths between every pair of vertices in H2. We present an algorithm to solve this problem in linear time. By properly setting H1 and H2, this augmentation algorithm subsumes existing optimal algorithms for several graph augmentation problems.     

基于复杂网络的金融传染风险模型研究

随着金融创新向更广和更深层面发展,金融体系中的传染风险和系统性风险越来越大,对此类风险进行准确度量是有效宏观审慎管理的重要内容。本文基于复杂网络理论,采用模拟方法对金融传染风险模型进行系统研究。首先,借鉴复杂网络的Watts级联动力学理论,构建了基于随机网络的金融传染模型,其较大的网络连通度水平不仅为传染提供更多的传播渠道,而且抵消了风险共享的能力。其次,引入Gleeson和Cahalane(2007)的分析框架,探讨了计算预期违约银行节点规模的解析模型,并对Watts模型中各种参数对系统风险的影响效应进行测度。最终,形成一个包括网络模拟方法、模型解析结论,以及网络统计分析方法等较全面的计算算法工具集合。     

生产性服务业网络的国际化水平分析——广州与亚太主要城市的比较

改革开放以来,广州经济实力不断增强,城市国际化水平极大提高,但广州与亚太城市相比,国际化水平有多高,与亚太区域性国际城市间的联系程度怎样,却少有研究。本文把广州放入到亚太区域城市组成的网络中,通过分析城市之间的网络连接度,笔者发现广州生产性服务业的总体发展水平不高,广州与亚太城市间的联系不够紧密;此外广州与香港的联系程度也并没有人们想象的那么高,甚至落后于北京和上海与香港的联系。因此广州要提高城市的国际化水平,必须加快生产性服务业的发展,尤其是要加强与香港、上海和北京这些周边亚太核心城市的联系。