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.     

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

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

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

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

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.     

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₂.     

Realization of fixed point sets

Letf:XX be a selfmap of a compact connected polyhedron, andA a nonempty closed subset ofX. In this paper, we shall deal with the question whether or not there is a mapg:XX homotopic tof such that the fixed point set Fixg ofg equalsA. We introduce a necessary condition for the existence of such a mapg. It is shown that this condition is easy to check, and hence some sufficient conditions are obtained.Partially supported by the Natural Science Foundation of Liaoning University.     

A three‐dimensional Cartesian cut cell method for incompressible viscous flow with irregular domains

A three‐dimensional Cartesion cut cell method is presented for the simulations of incompressible viscous flows with irregular domains. A new model (referred to as ‘6+N’ model) is proposed to describe arbitrarily shaped cut cells and treat all the cells as polyhedrons with 6+N faces. The finite volume discretization of the Navier–Stokes equation is then implemented by using the ‘6+N’ model to separate the surface flux integrals into two parts, that is, the fluxes through the basic face of the hexahedron and those through the cutting surfaces. The previously proposed Kitta Cube algorithm and volume computer‐aided design platform (J. Comput. Aided. Des. 2005; 37(4): 1509–1520. Doi:10.1016/j.cad.2005.03.006) are adopted to generate cut cells and provide shape data and physical attributes for the numerical analysis. A modified SIMPLE‐based smoothing pressure correction scheme is applied to suppress checkerboard pressure oscillations caused by the collocated arrangement of velocities and pressure. The calculation accuracy of the numerical method expressed by L₁ and L _∞ norm errors is first demonstrated by the simulation of a pipe flow. Then its feasibility, efficiency, and potential in engineering applications are verified by applying it to solve natural convections between concentric spheres and between eccentric spheres. The heat transfer patterns in eccentric spheres are also obtained by using the numerical method. Copyright © 2011 John Wiley & Sons, Ltd.     

Emulsions of Heavy Crude Oils. II. Viscous Responses and Their Influence on Emulsion Stability Measurements

The stability of 30 heavy crude oil emulsions was studied in a parallel-plate laboratory coalescer (DC field). Particularly, viscous responses and their influence on the emulsion stability measurements were investigated. In addition to highlighting previous results from the same experimental setup and discussing these based on recent experience, new results at different temperatures and volume fractions of water were presented. A new semi-empirical model for the characteristic time of the destabilization process was presented. The electrical forces were modelled with a point-dipole approximation and the hydrodynamic resistance to droplet transport was modelled with an empirical term including the logarithmic viscosity of the oil phase. The new model clearly performed much better than the previous model, particularly for very viscous crude oils. Studies of the performance of industrial electrocoalescers have showed that simple electrostatic theory can potentially explain complex separation phenomena when the resistance to the coalescence step is reduced by an efficient demulsifier. The ultimate goal is to build a model for both the laboratory setup and the industrial coalescer so that laboratory experiments can be used to predict the behavior of the industrial process.