轴向分区双频磁绝缘线振荡器的数值模拟

 为了便于模式变换器的设计,达到双频微波都能集中辐射的目的,提出一种轴向分区的双频磁绝缘线振荡器,该器件束波互作用区为中间隔开、两端不同周期、不同深度的慢波结构,使电子在上下游与不同频率特性的慢波结构进行束波互作用,得到稳定的双频微波输出。使用2.5维全电磁粒子模拟软件进行数值模拟,在工作电压450 kV,电流40 kA条件下输出微波功率为1.4 GW,功率效率约为7%,输出的微波频率分别为1.25 GHz和1.65 GHz,两者频谱幅度相差约为1.5 dB,模式为TEM模。     

轻质建筑中定形相变内隔墙板冬季应用效果研究

现代轻质建筑热容较小,窗墙比较大,冬季在利用透射太阳辐射采暖的同时易造成室内温度波动过大。本文提出将定形相变蓄能板安装在建筑内隔墙表面,以增加建筑热容,减小室温波动。采用经实验验证程序,模拟分析了相变板热物性、表面换热系数和用量对冬季室内温度波动的影响,给出了北京地区相变内隔墙房间的设计原则。     

偶一致超图划分问题的若干结果

划分问题因其在多个领域的重要应用一直是图论的研究热点.利用张量的特征值研究超图的划分与奇划分,并结合边割的界给出最大奇割、平均最小割、等周数等超图拓扑指标的界.当k取2时,这些结果与对应的图谱理论中的经典结论一致,因此可视为这些结论在超图的推广.     

Ramanujan-type congruences for broken 2-diamond partitions modulo 3

The notion of broken k-diamond partitions was introduced by Andrews and Paule.Let△k(n)denote the number of broken k-diamond partitions of n.Andrews and Paule also posed three conjectures on the congruences of△2(n)modulo 2,5 and 25.Hirschhorn and Sellers proved the conjectures for modulo 2,and Chan proved the two cases of modulo 5.For the case of modulo 3,Radu and Sellers obtained an infinite family of congruences for△2(n).In this paper,we obtain two infinite families of congruences for△2(n)modulo 3 based on a formula of Radu and Sellers,a 3-dissection formula of the generating function of triangular number due to Berndt,and the properties of the U-operator,the V-operator,the Hecke operator and the Hecke eigenform.For example,we find that△2(243n+142)≡△2(243n+223)≡0(mod 3).The infinite family of Radu and Sellers and the two infinite families derived in this paper have two congruences in common,namely,△2(27n+16)≡△2(27n+25)≡0(mod 3).     

Dynamic discovery of query path on the lattice of cuboids using hierarchical data granularity and storage hierarchy

Analytical processing on multi-dimensional data is performed over data warehouse. This, in general, is presented in the form of cuboids. The central theme of the data warehouse is represented in the form of fact table. A fact table is built from the related dimension tables. The cuboid that corresponds to the fact table is called base cuboid. All possible combination of the cuboids could be generated from base cuboid using successive roll-up operations and this corresponds to a lattice structure. Some of the dimensions may have a concept hierarchy in terms of multiple granularities of data. This means a dimension is represented in more than one abstract form. Typically, neither all the cuboids nor all the concept hierarchy are required for a specific business processing. These cuboids are resided in different layers of memory hierarchy like cache memory, primary memory, secondary memory, etc. This research work dynamically finds the most cost effective path from the lattice structure of cuboids based on concept hierarchy to minimize the query access time. The knowledge of location of cuboids at different memory elements is used for the purpose.     

A condition-based algorithm for solving polyhedral feasibility problems

It is known that Polyhedral Feasibility Problems can be solved via interior-point methods whose real number complexity is polynomial in the dimension of the problem and the logarithm of a condition number of the problem instance. A limitation of these results is that they do not apply to ill-posed instances, for which the condition number is infinite. We propose an algorithm for solving polyhedral feasibility problems in homogeneous form that is applicable to all problem instances, and whose real number complexity is polynomial in the dimension of the problem instance and in the logarithm of an “extended condition number” that is always finite.     

Comparison study of several numerical integration schemes used in calculations of density functional theory

Several numerical integration schemes for the evaluation of matrix elements in density functional theory calculations have been studied and compared by computational practice. The best scheme was found to be the combination of the atomic partition function proposed by Becke with the scaled generalized Gauss-Laguerre quadrature formula for radial integration suggested by Yang, which achieve the highest convergence rate to the numerical integration. With the same number of integration points, the accuracy of the calculated results by this scheme is higher by 1 to 2 orders of magnitudes than that by other schemes. The reason for achieving higher accuracy by this scheme has been proposed preliminarily.     

有限维路代数的K_1群

本文通过计算有限维路代数k△的单位群和单位群的阿贝尔化,完全刻划了 任意域上有限维路代数的K1群.     

A Note on the Order of Iterated Line Digraphs

Given a digraph G, we propose a new method to find the recurrence equation for the number of vertices of the k‐iterated line digraph , for , where . We obtain this result by using the minimal polynomial of a quotient digraph of G.