花丝内插物强化竖直管内凝结换热的实验研究

1前言大空隙率多孔体管内插物-绕花丝内插物，被认为是强化管内凝结换热的最有效途径之一[1]．但以往的研究，由于实验雷诺数范围较小，蒸汽速度较低，要正确全面评价其性能尚显不够。本文在原有工作的基础上，进一步完善了实验系统，改进了测试手段，扩大了实验雷诺数范围，并测试了其阻力性能，对花丝内插物强化管内凝结换热进行了较深入全面的实验研究，以全面评价花丝内插物对管内凝结换热的强化效果。2实验系统本文实验系统如图1所示。实验段是一个竖直套管冷凝器，如图2所示．本试验研究蒸汽完全凝结时的传热。凝结水流量采用容积法计…     

Resource augmentation for online bounded space bin packing

We study online bounded space bin packing in the resource augmentation model of competitive analysis. In this model, the online bounded space packing algorithm has to pack a list L of items in (0,1] into a small number of bins of size b1. Its performance is measured by comparing the produced packing against the optimal offline packing of the list L into bins of size 1.We present a complete solution to this problem: For every bin size b1, we design online bounded space bin packing algorithms whose worst case ratio in this model comes arbitrarily close to a certain bound ρ(b). Moreover, we prove that no online bounded space algorithm can perform better than ρ(b) in the worst case.     

On a Problem of Karpilovsky

Let G be a finite elementary group. Let ⁿ (G) denote the nth power of the augmentation ideal (G) of the integral group ring G. In this paper, we give an explicit basis of the quotient group Q_n(G) = ⁿ(G)/ⁿ⁺¹ (G) and compute the order of Qⁿ (G).2000 Mathematics Subject Classification: 16S34, 20C05     

Stability Relationships Among the Gibbs Sampler and its Subchains

The use of Gibbs samplers driven by improper posteriors has been a controversial issue in the statistics literature over the last few years. It has recently been demonstrated that it is possible to make valid statistical inferences through such Gibbs samplers. Furthermore, theoretical and empirical evidence has been given to support the idea that there are actually computational advantages to using these nonpositive recurrent Markov chains rather than more standard positive recurrent chains. These results provide motivation for a general study of the behavior of the Gibbs Markov chain when it is not positive recurrent. This article concerns stability relationships among the two-variable Gibbs sampler and its subchains. We show that these three Markov chains always share the same stability; that is, they are either all positive recurrent, all null recurrent, or all transient. In addition, we establish general results concerning the ways in which positive recurrent Markov chains can arise from null recurrent and transient Gibbs chains. Six examples of varying complexity are used to illustrate the results.     

Covering symmetric semi-monotone functions

We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-monotone function is NP-complete if all the values of the function are in {0,1} and we provide a minimax theorem if all the values of the function are different from 1. Our problem is equivalent to the node to area augmentation problem. Our contribution is to provide a significantly simpler and shorter proof.     

几类非Abel群之增广商群的结构

记ZG为有限群G的整群环,△n(G)为增广理想△(G)的n次幂,Qn(G)=△"(G)/△n 1(G)为G的增广商群.本文考虑了二面体群D2tk(k 奇)和m次对称群Sm,证明了Qn(D2tk)为秩不超过2t 1的基本2-群以及Qn(Sm)≌Z2.     

A study on volunteer augmentation navigation technology

Navigation augmentation technology is one of the most common methods to increase the continuity,reliability and integrity of the global satellite navigation system.The concept of volunteer augmentation navigation (VNA) is proposed and the elements and topological structure of VNA are also analyzed in this paper.The study focuses on the neural network model that volunteers and ordinary users use modern communication information network to exchange self-organizing information.The neural cell model of Voluntee...     

Edge-splittings preserving local edge-connectivity of graphs

Let G=(V+s,E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs,st is called admissible if splitting off these edges (replacing rs and st by rt) preserves the local edge-connectivity (the maximum number of pairwise edge disjoint paths) between each pair of vertices in V. The operation splitting off is very useful in graph theory, it is especially powerful in the solution of edge-connectivity augmentation problems as it was shown by Frank [Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Math. 5(1) (1992) 22-53]. Mader [A reduction method for edge-connectivity in graphs, Ann. Discrete Math. 3 (1978) 145-164] proved that if d(s)≠3 then there exists an admissible pair incident to s. We generalize this result by showing that if d(s)?4 then there exists an edge incident to s that belongs to at least ⌊d(s)/3⌋ admissible pairs. An infinite family of graphs shows that this bound is best possible. We also refine a result of Frank [On a theorem of Mader, Discrete Math. 101 (1992) 49-57] by describing the structure of the graph if an edge incident to s belongs to no admissible pairs. This provides a new proof for Mader's theorem.     

Experimental investigation of various turbulator inserts in gas-heated channels

This experimental research was focused on the investigation of the heat transfer augmentation by various turbulator inserts in gas-heated channels. The work was conducted directly in a convective part of a two fire-tube boiler. The flue ducts were positioned vertically and horizontally for various design applications. Twisted-tape insert (with the twist ratio y=4.12), the straight-tape insert, and the combined turbulator insert (the internal twisted tape with the twist ratio of 180° y=2.16 and an external tape, which spirally winded on an internal tape, with longitudinal pitch H_360°=110 mm and the relative height of a tape (rib) e/D₀=0.098;0.2) were investigated. The working fluids were the combustion products of light oil fuel and wood pellets. In addition, the experiments were conducted in the two fire-tube boiler without any inserts. Despite of relatively large data scattering obtained in these experiments some qualitative and quantitative conclusions were drawn.