仿射Weyl群(E～)6的a值5的左胞腔

Coxeter群的胞腔是1979年Kazhdan和Lusztig中定义的，这些胞腔理论在代数群的表示理论中发挥了重要的作用。对一些特殊的情况，胞腔的分类已经明确地给出了，例如，对于秩为2的群参见，对于An^-参见，对于a值4的典范型和或参见.本文利用时俭益的运算算法给出了仿射Weyl群E6^-的a值等于5的所有左胞腔。     

可变分区存储管理方式的模拟

论述了如何用C语言模拟可变分区存储管理方式的过程。形象地展示了操作系统中可变分区存储管理中采用的最佳适应算法的分配与回收过程，达到了理论与实践相联系的目的。     

Seismic 3D Prestack Time Migration on Parallel Computers

Ｓｅｉｓｍｉｃ３ＤＰｒｅｓｔａｃｋＴｉｍｅＭｉｇｒａｔｉｏｎｏｎＰａｒａｌｌｅｌＣｏｍｐｕｔｅｒｓ￥ＬｉｕＰｉｎｇ＆ＣｈｅｎＹｕｎｈｅ（ＷｕｈａｎＤｉｇｉｔａｌＥｎｇｉｎｅｅｒｉｎｇｉｎｓｔｉｔｕｔｅ，ＷｕｃｈａｎｇＰ．Ｏ．Ｂｏｘ７４２２３，Ｐ．Ｒ．...     

系统结构模型分部的底层要素法

本文从系统的底层要素出发，提出并证明了底层要素存在性、底层要素后果集并集的完全性以及它们在同一部分的充分必要条件，由此导出了系统结构模型分部的算法，实际应用进一步说明了这一方法的有效性。     

A new indolic antiauxin, α-(5,7-dichloroindole-3-)isobutyric acid: its chemical synthesis and biological activity

Summary A new potent antiauxin, -(5,7-dichloroindole-3-)isobutyric acid has been synthesized and shown to inhibit auxin-mediated elongation ofAvena coleoptiles and to stimulate root growth of rice seedlings. Its activity is stronger than -(p-chlorophenoxy)isobutyric acid and is comparable to that of 2,3,5-triiodobenzoic acid, which are typical antiauxins.     

用焓法有限元解相变问题的离散化方法

为了消除应用焓法进行含有相变的有限元传热计算结果呈台阶形的现象,本文作者提出“焓计算单元”和“固相分数”的概念,并将几种一维有限元实施方案的计算结果与精确解对比,说明采用所提出的概念,可以使有限元计算得出更为合理的结果。     

Position of the Y-chromosome at somatic metaphase in patients with chronic myelogenous leukemia (CML)

Summary A random distribution of the Y-chromosome at somatic metaphase was found in 50 patients with Ph' positive chronic myelogenous leukemia (CML). Thus, it is concluded that the positive of the Y-chromosome at somatic metaphase does not appear to influence the loss from bone marrow cells.     

The Young-Householder algorithm and the least squares multidimensional scaling of squared distances

It is shown that replacement of the zero diagonal elements of the symmetric data matrix of approximate squared distances by certain other quantities in the Young-Householder algorithm will yield a least squares fit to squared distances instead of to scalar products. Iterative algorithms for obtaining these replacement diagonal elements are described and relationships with the ELEGANT algorithm (de Leeuw 1975; Takane 1977) are discussed. In large residual situations a penalty function approach, motivated by the ELEGANT algorithm, is adopted. Empirical comparisons of the algorithms are given.An early version of this paper was presented at the Multidimensional Data Analysis Workshop, Pembroke College, Cambridge, July 1985. I want to thank Jan de Leeuw and Yoshio Takane for bringing the ELEGANT algorithm to my attention and for clarifying its rationale and notation. My thanks go also to Stephen du Toit for help with the ALSCAL computations reported in Section 7.     

Learning attention-based strategies to cooperate for multi-agent path finding

Multi-agent path finding (MAPF) is a challenging multi-agent systems problem where all agents are required to effectively reach their goals concurrently with not colliding with each other and avoiding obstacles. In MAPF, it is a challenge to effectively express the observation of agents, utilize historical information, and effectively communicate with neighbor agents. To tackle these issues, in this work, we proposed a well-designed model that utilizes the local states of nearby agents and outputs an optimal action for each agent to execute. We build the local observation encoder by using residual attention CNN to extract local observations and use the Transformer architecture to build an interaction layer to combine local observations of agents. With the purpose of overcoming the deficiency of success rate, we also designed a new evaluation index, namely extra time rate (ETR). The experimental results show that our model is superior to most previous models in terms of success rate and ETR. In addition, we also completed the ablation study on the model, and the effectiveness of each component of the model was proved.