卧式旋转筒体内液体稳定运动的试验研究

采用因次分析法确定了卧式旋转筒体内液体稳定运动的准则数,并通过试验研究了筒体内液环形成与破坏等稳定运动的临界转速、主要准则数间的函数关系。研究表明:形成液环的临界转速ωc主要取决于筒体内径R、液环的厚度h、密度ρ、粘度μ以及重力加速度g;而液环破坏的临界转速ωd主要取决于R、g。     

交错群A_5的4度连通对称图的分类

一个图Г称为G-对称的(symmetric).如果其同构群Aut(r)的一个子群G在图r的有向孤集(set of ordered pairs of adjacent vertices)上的作用是传递的(transitive).本文主要结果是:设图Г是4度对称图.全自同构群Aut(r)=A_5,则图r是且仅是如下图之一:(1)Г是15个点的完全图K_5的三维覆盖(3-fold cover)图.(2)Г是完全图K_5.     

大小样品在液氮中的淬冷沸腾换热比较研究

分析了大小样品在液氮中的淬冷沸腾换热特性。大小样品的淬冷沸腾换热有着明显的差别，小样品的热流密度比大样品的明显高得多。小样品的淬冷沸腾有一起始段，其温降高达６０Ｋ。从实验结果还可以看到，小样品的Ｌｅｉｄｅｎｆｒｏｓｔ点和临界热流点对应的壁面过热度明显比大样品的高。最后还分析了样品直径对临界热流密度的影响。     

挑坎型掺气减蚀设施过流掺气特性研究

采用一维激光测速系统，对掺气减蚀工程中常用的直线型挑坎的流场特性进行试验研究．通过测量挑坎上及空腔区水流的流速分布及紊动特性，探讨通气量与紊动强度的关系．同时在深入研究流场特性和掺气机理的基础上，通过分析影响掺气的因素，从理论上探求临界掺气流速的计算，重点分析挑坎型掺气过流在空腔负压较大的情况下，临界掺气条件的理论预测，并通过试验资料验证了该计算方法．在此基础上，还进一步研究了掺气量的计算公式及其变化规律．     

R－X图解法计算多级串联理想混合反应器

论述Ｒ－Ｘ图解法计算多级串联理想混合反应器的基本原理，并结合实例，对Ｒ－Ｘ法的计算步骤予以详细介绍，为多级串联反应器的设计与计算，提供一种新颖适用的图解计算方法。     

Fast Recognition of Fibonacci Cubes

Fibonacci cubes are induced subgraphs of hypercubes based on Fibonacci strings. They were introduced to represent interconnection networks as an alternative to the hypercube networks. We derive a characterization of Fibonacci cubes founded on the concept of resonance graphs. The characterization is the basis for an algorithm which recognizes these graphs in O(mlog n) time. A. Vesel supported by the Ministry of Science of Slovenia under the grant 0101-P-297.     

On the Fundamental Limits of Topology Control in Ad Hoc Networks

We prove two results that provide new fundamental limits for topology control in large ad hoc and sensor networks. First, we show that it remains true under very general conditions that the maximum expected node degree must grow to infinity at least logarithmically if we want to maintain asymptotic connectivity. This has been known so far only for much more special models than ours. Building on this result, we prove a new fundamental limit regarding link dynamics, which means the worst case length ratio of the longest and shortest link adjacent to the same node. We prove that if link dynamics remains bounded, then no topology control algorithm can keep a large network connected with high probability. Moreover, bounded link dynamics prevents connectivity in the limit without any a priori assumption on node degrees or transmission ranges. Our results hold in a model that is much more general than the frequently used assumption of uniformly distributed nodes in a regularly shaped planar domain. Our more abstract setting also aims at finding (hopefully) more robust and elegant proofs that have less dependence on the special geometry. Since link dynamics is expected to be bounded in practice, the results strenghten the theoretical basis for the argument that a very large ad hoc or sensor network is unable to maintain connectivity if it has a flat, random organization without additional structure. Supported in part by NSF Grants ANI-0220001 and CCF-0634848.     

How to make and defend a proposal in a deliberation dialogue

In this paper it is shown how tools developed in argumentation theory and artificial intelligence can be applied to the development of a new dialectical analysis of the speech act of making a proposal in a deliberation dialogue. These tools are developed, modified and used to formulate dialogue pre-conditions, defining conditions and post-conditions for the speech act of making a proposal in a deliberation dialogue. The defining conditions set out what is required for a move in a dialogue to count as the making of a proposal by one of the parties. What is required are the conditions that (1) the move fit the requirements of the argumentation scheme for practical reasoning, and (2) the premises are propositions describing common goals of both parties or propositions that they reasonably consider means to achieve these goals. The analysis goes beyond the standard speech act approach by specifying not only the normative requirements for making a well-formed proposal, but also the requirements for responding to it by questioning or criticizing it, and the requirements for defending it.     

Longest fault-free paths in hypercubes with vertex faults

The hypercube is one of the most versatile and efficient interconnection networks (networks for short) so far discovered for parallel computation. Let f denote the number of faulty vertices in an n-cube. This study demonstrates that when f ? n − 2, the n-cube contains a fault-free path with length at least 2ⁿ − 2f − 1 (or 2ⁿ − 2f − 2) between two arbitrary vertices of odd (or even) distance. Since an n-cube is a bipartite graph with two partite sets of equal size, the path is longest in the worst-case. Furthermore, since the connectivity of an n-cube is n, the n-cube cannot tolerate n − 1 faulty vertices. Hence, our result is optimal.     

广义AND／OR图的自底向上的启发式搜索算法BHAO

本文首先根据三角模概念，定义了一类新的更具普遍意义的广义ＡＮＤ／ＯＲ图．根据新定义的启发式函数ｈ（ｎ，ｘ）以及广义ＡＮＤ／ＯＲ图的最佳解树之所有子树亦是最佳子解树的原理，提出了广义ＡＮＤ／ＯＲ图的自底向上的启发式搜索算法ＢＨＡＯ．文中证明了算法ＢＨＡＯ的可采纳性．本文还提出了两类新的启发式函数的单调限制概念，并据此研究了算法ＢＨＡＯ的单调限制性质，研究了两个ＢＨＡＯ算法间的比较性质．