Sparse graph certificates for mixed connectivity

We give a short proof for the Mixed Connectivity Certificate Theorem of Even, Itkis and Rajsbaum and provide an upper bound on the edge number of a certificate of local T-mixed connectivity up to k.     

工程施工中运输网络优化方案

施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 .     

聚类分析在髁突骨密度分析中的应用

本研究应用聚类分析的方法，对人离休髁突×片进行数字图像技术处理所获得的影像密度数值做了详细分析，取得人髁突不同区的骨密度分布及不同年龄阶段髁突密度变化的情况。该方法避免了人为因素的影响，其结果较客观地反映了髁突的骨质密度；为研究病理状态时髁突骨密度的改变提供参考。     

一类常微分方程组的紧支撑样条小波方法探讨

应用三次紧支撑样条小波插值函数得到了求一类常微分方程组数值解的隐式公式,并求得到其局部截断误差为O(-h5).在此基础上给出1个显式校正求解公式,并讨论得到其局部截断误差为O(-h4).     

Identifying Linking-Pin Organizations in Inter-Organizational Networks

Within the large literature on inter-organizational networks, there has been some discussion of linking-pin organizations and the role they play in integrating these networks. Based on this verbal specification of linking-pin organizations, we construct operational criteria and empirical methods for identifying these structurally important organizations in potentially large and complex inter-organizational networks. These methods are based on ideas drawn from blockmodeling, structural holes, centrality and centralization of networks, and identifying cut-points in networks. These methods are applied to a constructed example and then to real empirical inter-organizational networks. Implications and contrasts with other methods are discussed, together with some open problems.     

纵横扩张的优化

得到了最小折数纵横扩张的判别准则．针对4-正则图的平面嵌入的纵横扩张的特殊性，给出了它的最小折数纵横扩张判别准则．     

Sequent calculi for propositional star-free likelihood logic

We consider classical, multisuccedent intuitionistic, and intuitionistic sequent calculi for propositional likelihood logic. We prove the admissibility of structural rules and cut rule, invertibility of rules, correctness of the calculi, and completeness of the classical calculus with respect to given semantics.__________Published in Lietuvos Matematikos Rinkinys, Vol. 45, No. 1, pp. 3–21, January–March, 2005.     

Boundedness and Dissipativity of Truncated Rotations on Uniform Planar Lattices

The finiteness of computer arithmetic can lead to some dramatic differences between the behaviour of a continuous dynamical system and a computer simulation. A thorough rigorous theoretical analysis of what may or what does happen is usually extremely difficult and to date little has been done even in relatively simple contexts. The comparative behaviour of a rotation mapping in the plane and on a uniform lattice in the plane is one such example. Simulations show that the rounding operator applied to a planar rotation mapping more or less preserves the qualitative behaviour of the original mapping, whereas the application of the truncation operator to a planar rotation can lead to quite different dynamical features. In this paper a theoretical justification of the properties of the planar rotation mappings under truncation to a, uniform integer lattice is provided, in particular properties of boundedness and dissipativity are investigated.     

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s₁ and s₂ to, respectively, a given vertex t₁, and each vertex of a given subset of vertices T₂.     

Mineral–water interfacial structures revealed by synchrotron X-ray scattering

Chemical reactions occurring at the mineral–water interface are controlled by an interfacial layer, nanometers thick, whose properties may deviate from those of the respective bulk mineral and water phases. The molecular-scale structure of this interfacial layer, however, is poorly constrained, and correlations between macroscopic phenomena and molecular-scale processes remain speculative. The application of high-resolution X-ray scattering techniques has begun to provide substantial new insights into the molecular-scale structure of the mineral–water interface. In this review, we describe the characteristics of synchrotron-based X-ray scattering techniques that make them uniquely powerful probes of mineral–water interfacial structures and discuss the new insights that have been derived from their application. In particular, we focus on efforts to understand the structure and distribution of interfacial water as well as their dependence on substrate properties for major mineral classes including oxides, carbonates, sulfates, phosphates, silicates, halides and chromates. We compare these X-ray scattering results with those from other structural and spectroscopic techniques and integrate these to provide a conceptual framework upon which to base an understanding of the systematic variation of mineral–water interfacial structures.