股份制公司的综合投资方案决策模型

对股份制公司的综合投资方案的决策问题进行了研究.首先依据多个投资方案的风险与收益并存的实际情况,建立了最佳投资组合方案的多目标决策模型.然后,由董事会综合各股东所持股份和相互评价权值,利用群决策的方法得到一个最终投资方案,此方案在理论上能使公司获得最大收益.     

The Compactness of Commutators on the Heisenberg Group

We consider the commutators of the HSrmander multiplier with CMO-functions on the Heisenberg group. The result of compactness on L^P spaces is proved.     

Nd:LuVO_4晶体的拉曼光谱研究

采用不同的几何配置测量了Nd:LuVO4晶体的室温拉曼光谱,根据群论对称性分类计算了该晶体的红外和拉曼活性振动模并与实验结果做了比较,指认了测定的特征谱线。测量并分析了Nd:LuVO4晶体A1g全对称类的高温拉曼光谱,讨论了拉曼频移随温度变化的关系,认为晶体的热膨胀是引起拉曼频移变化的主要原因。     

聚异丁烯高活性端基含量及相对分子质量测定方法的研究

综合使用核磁，VPO和近红外光谱分析技术对聚异丁烯活性端基含量以及相对分子质量的测定进行了详细研究，分别建立核测定聚异丁烯活性端基含量以及其他烯键含量和近红外光谱快速测量聚异聚丁烯活性端基含量。其他烯键含量和相对分子质量的分析方法。成对t检验结果表明，近红外光谱分析方法测定结果与核磁和VPO方法测定结果之间无显著性差异。     

利用手征SU(3)夸克模型研究轻双Λ超核^6_ΛΛHe,^5_ΛΛHe,^5_ΛΛH,^4_ΛΛHe,和^4_ΛΛH的结合能

在手征SU(3)夸克集团模型下, 通过共振群方法(RGM)计算了双Λ超核^6_ΛΛHe,^5_ΛΛHe,^5_ΛΛH,^4_ΛΛHe,和^4_ΛΛH的结合能. 结果表明, 假定双Λ超核具有双Λ集团和壳心核集团构成的两集团结构, 得到的^6_ΛΛHe超核的结合能与实验值基本吻合, 表明手征SU(3)夸克集团模型不仅能较好地描述重子谱、N-N和Y-N相互作用及轻Λ超核的结合能, 也能较好地描述Y-Y相互作用及双Λ超核^6_ΛΛHe,^5_ΛΛHe,^5_ΛΛH,^4_ΛΛHe,和^4_ΛΛH的结合能, 指出了它们存在的可能性.     

关于“级别婚”的数学分析

介绍了19世纪存在于澳大利亚土著中的一种婚姻形式—级别婚,从群论的角度说明级别婚的三种主要形式都对应于一个对称群,从而可以用几何方法形象的表示这种婚姻形式;进而,从对称的观点说明婚姻形式从简单到复杂的演化过程,代数上对应于对称群阶数的增加,几何上则对应于对称性的加强.     

可解群的若干充分条件

A subgroup if of a group G is called semipermutable if it is permutable with every subgroup K of G with (|H|, |K|) - 1, and s-semipermutable if it is permutable with every Sylow p-subgroup of G with (p, |H|) = 1. In this paper, some sufficient conditions for a group to be solvable are obtained in terms of s-semipermutability.     

Graphs with Special Arcs and Cryptography

A combinatorial method of encryption with a similarity to the classical scheme of linear coding has been suggested by the author. The general idea is to treat vertices of a graph as messages and arcs of a certain length as encryption tools. We will study the quality of such an encryption in the case of graphs of high girth by comparing the probability to guess the message, (vertex) at random with the probability of breaking the key, i.e. guessing the encoding arc. In fact, the quality is good for graphs which are close to the Erdös bound, defined by the Even Cycle Theorem.In the case of parallelotopic graphs, there is a uniform way to match arcs with strings in a certain alphabet. Among parallelotopic graphs we distinguish linguistic graphs of affine type whose vertices (messages) and arcs (encoding tools) both could be naturally identified with vectors over the GF(q), and neighbors of the vertex defined by a system of linear equations. We will discuss families of linguistic and parallelotopic graphs of increasing girth as the source for assymmetric cryptographic functions and related open key algorithms.Several constructions of families of linguistic graphs of high girth with good quality, complexity and expansion coefficients will be considered. Some of those constructions have been obtained via group-theoretical and geometrical techniques.     

Explicit formula of holomorphic automorphism group on complex homogeneous bounded domains

We known that the maximal connected holomorphic automorphism group Aut (D)(0) is a semi-direct product of the triangle group T(D) and the maximal connected isotropic subgroup Iso(D)(0) of a fixed point in the complex homogeneous bounded domain D and any complex homogeneous bounded domain is holomorphic isomorphic to a normal Siegel domain D(VN,F). In this paper, we give the explicit formula of any holomorphic automorphism in T(D(VN, F)) and Iso(D(VN,F))(0), where G(0) is the unit connected component of the Lie group G.