Dualities and reciprocities on graphs on surfaces

We extend the duality between acyclic orientations and totally cyclic orientations on planar graphs to dualities on graphs on orientable surfaces by introducing boundary acyclic orientations and totally bi-walkable orientations. In addition, we provide a reciprocity theorem connecting local tensions and boundary acyclic orientations. Furthermore, we define the balanced flow polynomial which is connected with tension polynomial by duality and with totally bi-walkable orientations by reciprocity.     

基于学习—遗忘效应的生产率降低损失索赔研究

建设工程项目很多具有重复性施工的特点,本文利用这种特点将学习-遗忘效应应用到平衡作业线(LOB)方法中,分析因为工程中断造成生产率的降低的现象,认为因生产率降低而导致工程工期的延长实际上超过工程实际中断的时间,最后以一个工程案例来说明分析过程.     

A note on circle patterns on surfaces

In this paper we give two different proofs of Bobenko and Springborn’s theorem of circle pattern: there exists a hyperbolic (or Euclidean) circle pattern with proscribed intersection angles and cone angles on a cellular decomposed surface up to isometry (or similarity). This work is partially supported by NSF Grant #0625935.     

Remarks on continuum cardinals on Boolean algebras

We give some results concerning various generalized continuum cardinals. The results answer some natural questions which have arisen in preparing a new edition of 5 . To make the paper self‐contained we define all of the cardinal functions that enter into the theorems here. There are many problems concerning these new functions, and we formulate some of the more important ones.     

Some remarks on tautological sheaves on Hilbert schemes of points on a surface

We study tautological sheaves on the Hilbert scheme of points on a smooth quasi-projective algebraic surface by means of the Bridgeland–King–Reid transform. We obtain Brion–Danila’s Formulas for the derived direct image of tautological sheaves or their double tensor product for the Hilbert–Chow morphism; as an application we compute the cohomology of the Hilbert scheme with values in tautological sheaves or in their double tensor product, thus generalizing results previously obtained for tautological bundles.      

基于SMMC模型的数据多流形结构分析研究

采用混合多流形谱聚类模型(SMMC)对独立子空间、非独立子空间,非线性良分离及非线性交叉等流形聚类中的四种典型数据进行聚类,并与其他流形聚类方法进行比较,发现SMMC模型聚类效果良好且具有强鲁棒性和泛化能力.将SMMC模型运用于具有混合多流形结构的工件外部边缘轮廓进行聚类,结果显示SMMC模型能够很好的将其分为三类.针对SMMC模型复杂度高、选取参数困难及运行时间长的问题,提出了基于模拟退火遗传算法SMMC模型,结果发现改进后的模型能够大大缩短运行时间.     

More on cancellative semigroups on manifolds

Communicated by D.R.Brown     

关于积流形的P－形式上的Laplace算子谱

本文讨论了积流形的Ｐ－形式上Ｌａｐｌａｃｅ算子谱的唯一性问题，在紧Ｋａｃｈｌｅｒ流形乘积和紧Ｓａｓａｋｉ流形乘积的两类积流形中，ＣＰ^ｎ×ＣＰ^ｎ和Ｓ^２ｎ＋１（１）×Ｓ^２ｎ＋１（１）是Ｐ－形式上Ｌａｐｌａｃｃｅ算子谱特征。     

A counterexample on contractible transformations on graphs

Ivashchenko proposed the study of contractible transformations on graphs because of their applications to computer image analysis, theory of molecular spaces, and digital topology. He published five papers on this subject. Contractible transformations have recently been applied to topological data analysis. This paper presents a counterexample to several results that appeared in one of Ivashchenko’s works.     

基于Vague集的产品选择策略研究

随着市场经济的进一步发展,中小企业面临新的管理危机和生存困境,论文运用Vague集方法,探讨了中小企业得以生存和发展的外部环境,并借助定量方法研究了中小企业突破困境的产品选择与推荐策略,为中小企业管理决策者提供了可供借鉴的科学指导方法.     

一类基于随机着色Petri网的多级供应链可靠性模型研究

由多种要索组成的供应链系统在实际运作过程中必须符合可靠性要求。供应链系统由于内外部的不确定性，特别是外部需求不确定性而与其他可靠性系统有所不同。本文在考虑其可靠性问题的条件下，提出了一种随机着色Petri网来对供应链系统可靠性问题进行建模分析。     

基于偏序集的PROMETHEE方法优化研究

尽管PROMETHEE是当前最受欢迎的多准则决策方法之一,但在实践应用过程中,模型的应用范围与质量依然受制于指标权重问题。一些常用的赋权方法,不仅没有解决不确定权重问题,反而增加了决策风险。在偏序集相关定理的基础上,给出权重的定性信息即权重次序,由流出矩阵、流入矩阵和净流矩阵等定义,得到了PROMETHEE的偏序集表达形式。当流入和流出之和为常数时,证明了模型存在对偶性质。根据对偶性质,简化了PROMETHEE方法的分析步骤,删减模型冗余信息。应用偏序集表示的PROMETHEE,突破了模型没有具体权重便无法应用的思维定势,解决了模型赋权困难,增强了模型的鲁棒性,拓展了模型处理数据类型的范围。     

A note on compact operators on matrix domains

We establish some identities or estimates for the operator norms and Hausdorff measures of noncompactness of linear operators given by infinite matrices that map the matrix domains of triangles in arbitrary BK spaces with AK, or in the spaces of all convergent or bounded sequences, into the spaces of all null, convergent or bounded sequences, or of all absolutely convergent series. Furthermore, we apply these results to the characterizations of compact operators on the matrix domains of triangles in the classical sequence spaces, and on the sequence spaces studied in [I. Djolovi?, Compact operators on the spaces and , J. Math. Anal. Appl. 318 (2) (2006) 658-666; I. Djolovi?, On the space of bounded Euler difference sequences and some classes of compact operators, Appl. Math. Comput. 182 (2) (2006) 1803-1811].     

基于偏好锥的DEA-DA模型研究

扩展的DEA-DA模型是一种结合数据包络分析(DEA)和判别分析(DA)的非参数判别分析方法。一种锥比率DEA模型C^2WH可以利用锥比率体现决策对样本指标和决策单元的偏好。因此，本将C^2WH模型和DA模型结合，建立了基于偏好锥的DEA-DA模型与方法，并就偏好锥为多面凸锥的情况给出了实例分析。结果表明，所建模型可以在判别分析过程中体现决策的偏好，从而形成主观与客观的集成评价。     

A Note on Semilocal Reciprocity Laws on Curves

The aim of this work is to offer a definition of the Contou-Carrère symbol associated with a closed point of an algebraic curve and with a local ring of dimension zero, first, and then with a semilocal ring of dimension zero, from the commutator of a certain central extension. When the curve is complete, we deduce the reciprocity law in both cases. Moreover, we give some applications to the residues, and obtain explicit relations between the classic residue and the Witt residue.

Communicated by C. Pedrini.     

Cops and Robbers on Graphs Based on Designs

We investigate the cop number of graphs based on combinatorial designs. Incidence graphs, point graphs, and block intersection graphs are studied, with an emphasis on finding families of graphs with large cop number. We generalize known results on Meyniel extremal families by supplying bounds on the incidence graphs of transversal designs, certain G‐designs, and BIBDs with Families of graphs with diameter 2, C₄‐free, and with unbounded chromatic number are described with the conjectured asymptotically maximum cop number.     

基于实验设计的炉渣流动性能研究

介绍了主要炉渣成份对炉渣流动性能影响的实验研究,利用minitab分析了碱度、MgO以及Al_2O_3对炉渣熔化性温度、粘度与热稳定性的影响程度,并用方差分析找到了Al_O_3对炉渣流动性能影响的拐点,为高炉生产提供指导,并对今后大高炉的优化配矿提供技术支撑。     

A note on node packing polytopes on hypergraphs

A facial structure of the node packing polytope, i.e., of the convex hull of integer solutions of the node packing problem, on hypergraphs is studied. First, the results extracted by Chvàtal and by Balas and Zemel on canonical facets of the node packing polytopes on graphs are generalized to derive some specific hypergraphs having canonical facets. Second, it is shown that the facial structure of the node packing polytope on a hypergraph, named a fat graph, has a very close relationship to the facial structures of the node packing polytope and also of the convex hull of integer solutions of an integer linear program, which are defined on a specific graph corresponding to the fat graph.