北京谱仪Ⅱ顶点探测器的径迹重建

描述了采用模式识别方法的北京谱仪Ⅱ顶点探测器径迹重建软件系统─—VCJULI.经过蒙特卡罗和真实数据的运行检查,证明该程序能对顶点探测器的径迹给出较好的空间分辨和径迹寻找效率.     

几类凝聚图的轮廓

设Ｇ是个图，｜Ｖ（Ｇ）＝ｎ｜对Ｇ上的任一个标号ｆ：Ｖ（Ｇ）→｛１，…，ｎ｝记，且当ｊ≠ｉ时，Ｇ中有边以ｆ（－１）（ｊ）及ｆ（－１）（ｉ）为两端点｝）．称Ｐ（Ｇ）＝ｍｉｎ｛Ｐ（ｆ）：ｆ是Ｇ上的标号｝为图Ｇ的轮廓．对以Ｗ表示Ｇ中Ｗ的边界．本文证明：ｉ）若Ｇ是凝聚图，ｆ及ｆ是Ｇ上一对互逆标号，则Ｐ（Ｇ）＝Ｐ（ｆ）的充要条件是ｆ为凝聚标号，且此时若Ｇ，Ｈ均是凝聚图，则存在阶梯标号。使得路、回、完全留之间的下列乘积图也是凝聚图，且其轮廓为     

度量图上两个微分算子乘积的自伴性

本文研究了度量图上二阶及四阶局部微分算子积的自伴顶点条件.在研究闭区间[a,b]上积算子自伴性的基础上,运用度量图上高阶局部微分算子的自伴顶点条件得到了积算子自伴的充分必要条件.此外,给出了积算子自伴与原算子自伴之间的关系.     

始料未及的定值

题目 等腰直角ZkAOB内接于抛物线y2=2px（p〉0）,0为抛物线的顶点,则△AOB的面积是（ ）     

例谈圆内角与圆外角的计算

我们知道,顶点在圆上,并且两边都与圆相交的角叫圆周角.因为一条弧所对的圆周角的度数等于它所对的圆心角的一半,而圆心角的度数等于它所对的弧的度数,所以圆周角的     

Automorphism group and representation of a twisted multi-loop algebra

Let G be the complexification of the real Lie algebra so（3） and A = C[t1^±1, t2^±1] be the Lau-ent polynomial algebra with commuting variables. Let L：（t1, t2, 1） = G c .A be the twisted multi-loop Lie algebra. Recently we have studied the universal central extension, derivations and its vertex operator representations. In the present paper we study the automorphism group and bosonic representations ofL（t1, t2, 1）.     

Deleting Vertices and Interlacing Laplacian Eigenvalues

The authors obtain an interlacing relation between the Laplacian spectra of a graph G and its subgraph G - U, which is obtained from G by deleting all the vertices in the vertex subset U together with their incident edges. Also, some applications of this interlacing property are explored and this interlacing property is extended to the edge weighted graphs.     

An implicit degree ore-condition for pancyclicity of graphs

In 1989, Zhu, Li and Deng introduced the definition of implicit degree of a vertex v in a graph G, denoted by id(v). In this paper, we prove that if G is a 2-connected graph of order n such that id(u) + id(v) ≥ n for each pair of nonadjacent vertices u and v in G, then G is pancyclic unless G is bipartite, or else n = 4r, r ≥ 2 and G is isomorphic to F4r .     

L（j,k）-number of Direct Product of Path and Cycle

For positive numbers j and k, an L(j,k)-labeling f of G is an assignment of numbers to vertices of G such that |f(u)-f(v)|≥j if uv∈E(G), and |f(u)-f(v)|≥k if d(u,v)=2. Then the span of f is the difference between the maximum and the minimum numbers assigned by f. The L(j,k)-number of G, denoted by λj,k(G), is the minimum span over all L(j,k)-labelings of G. In this paper, we give some results about the L(j,k)-number of the direct product of a path and a cycle for j≤k.     

解法多样 情理之中 意料之外 余味悠长——2012年济南市学考数学第26题赏析

试题如图1,在菱形ABCD中,AC=2,BD=2(3^1/2),AC、BD相交于点O.（1）求边AB的长;（2）如图2,将一个足够大的直角三角板60°角的顶点放在菱形ABCD的顶点A处,绕点A左右旋转,其中三角板