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.     

On zeta-functions associated to certain cusp forms. I

In the paper the asymptotics for Dirichlet polynomials associated to certain cusp forms are obtained. Partially supported by Lithuanian Foundation of Studies and Science     

纵横扩张的优化

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

On inequalities of Lieb-Thirring type

Applying the method proposed by Kashin for proving inequalities of Lieb-Thirring type for orthonormal systems, we prove a similar inequality in the multidimensional case.     

双包层椭圆光波导解析解

解析求解了双包层椭圆光纤中的波动方程，得到了模式精确解有模式特征方程。对基模的特征方程进行了数值计算，给出了不同椭圆比下的归一化双折射和模间色散随归一化频率的变化关系曲线，并与高斯近似解的结果进行了比较。     

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

也谈中文丛书题名的规范著录

简述了目前中文丛书题名著录和标目选取中存在的问题,分析了产生这些问题的原因,提出了规范化著录中应注意的问题。     

剃齿时齿形中凹现象的形成机理

本文综合啮合原理、微分几何和弹性力学的基础理论,对剃齿过程中刀具齿面和被剃齿轮齿面间的失配进行了分析。最后利用径向力求出了齿面间的压切量,从而解释并验证了剃齿过程中产生的齿形中凹现象。这对提高剃齿精度、降低噪音有着重要意义。