Study of filtered interphase heat transfer using highly resolved CFD–DEM simulations

Accurately predicting the complex inhomogeneous heat transfer behavior in gas–solid fluidized beds is of fundamental importance. In this work, we constitute an enhanced filtered interphase heat transfer coefficient (IHTC) closure by systematically filtering the dataset from highly resolved three-dimensional (3D) computational fluid dynamics–discrete element model simulations. Particularly, effects of several potential filtered variable markers on filtered IHTC predictions are examined by statistical analysis. We reveal the formulated filtered IHTC correction closure manifests a systematic dependence on filtered interphase temperature difference as an additional marker. The proposed closure shows good agreement with the filtered fine-grid simulation data in an a priori analysis. Moreover, the difference of filtered IHTC corrections deduced from 3D Euler–Euler and Euler–Lagrange simulations is quantified. Finally, the comparative analysis between our proposed filtered IHTC formulation and those in literature is implemented. This work holds a potential to facilitate the development of thermal gas–solid flow modeling.     

On the gas dynamics of HVOF thermal sprays

An experimental study of the gas-dynamic aspects of the high-velocity oxyfuel (HVOF) thermal spray process has been performed using commercially available HVOF equipment (Hobart-Tafa JP-5000, Ho-bart-Tafa Technologies, Inc., Concord, NH). Optical diagnostic techniques, including microsecond-expo-sure schlieren and shadowgraph imaging, were applied to visualize the hot supersonic jet produced by this equipment without particle injection. Rapid turbulent mixing of the jet with the surrounding atmos-phere was observed, which is an issue of concern in coating quality due to the possibility of oxidation of sprayed particles. This mixing appears to be a function of the ratio of densities of the hot jet and the cold atmosphere as well as a function of the velocity of the jet, rather than one of combustion-chamber pres-sure or barrel length. The supersonic core of the HVOF jet dissipates rapidly due to the mixing, so that the jet is no longer supersonic when it impinges on the target surface being sprayed. Secondary issues also observed in this study include strong jet-noise radiation from the HVOF plume and the entrainment and induced bulk motion of the surrounding air.     

Developing a knowledge-based perspective on coordination: The case of global software projects

We have attempted to bring together two areas which are challenging for both IS research and practice: forms of coordination and management of knowledge in the context of global, virtual software development projects. We developed a more comprehensive, knowledge-based model of how coordination can be achieved, and\illustrated the heuristic and explanatory power of the model when applied to global software projects experiencing different degrees of success. We first reviewed the literature on coordination and determined what is known about coordination of knowledge in global software projects. From this we developed a new, distinctive knowledge-based model of coordination, which was then employed to analyze two case studies of global software projects, at SAP and Baan, to illustrate the utility of the model.     

A Level-Set Method for Computing the Eigenvalues of Elliptic Operators Defined on Compact Hypersurfaces

We demonstrate, through separation of variables and estimates from the semi-classical analysis of the Schrödinger operator, that the eigenvalues of an elliptic operator defined on a compact hypersurface in ? ⁿ can be found by solving an elliptic eigenvalue problem in a bounded domain Ω?? ⁿ . The latter problem is solved using standard finite element methods on the Cartesian grid. We also discuss the application of these ideas to solving evolution equations on surfaces, including a new proof of a result due to Greer (J. Sci. Comput. 29(3):321–351, 2006).     

基于扩充的GIX/M/1/N排队系统的主动队列管理算法性能评价模型

为了评价主动队列管理(AQM Active Queue Management)算法的性能,通过在标准的排队系统GIX/M/1/N中嵌入主动队列管理(AQM)算法的方法,建立了一个扩充的GIX/M/1/N排队系统。利用该扩充的GIX/M/1/N排队系统和Internet业务流量自相似性的特征,提出了一种评价AQM算法在非响应业务流量下的性能的分析方法,并据此评价了TD,RED,GRED和Adaptive RED等4个经典的AQM算法。为了验证该分析方法的合理性,利用NS2进行了一系列的仿真实验。结果表明,该分析方法所得结果与仿真实验所得结果一致,因此该分析方法能用于评价AQM算法的性能。     

Conference key agreement protocol with non-interactive fault-tolerance over broadcast network

Most conventional conference key agreement protocols have not been concerned with a practical situation. There may exist some malicious conferees who attempt to block conference initiation for some purposes, e.g. commercial, political or military benefit. Instances where conference must be launched immediately due to emergency, efficient detection of malicious behavior would be needed. Recently, Tzeng (IEEE Trans. Comput. 51(4):373–379, 2002) proposed a fault-tolerant conference key agreement protocol to address the issue where a conference key can be established among conferees even though malicious conferees exist. However, his protocol might be complex and inefficient during fault-detection. In the case where a malicious conferee exists and a fault-tolerant mechanism is launched, complicated interactions between conferees will be required. In this paper, we introduce a novel strategy, where any malicious conferee may be identified and removed from the conferee list without any interaction. With such a non-interactive fault-tolerance, conferences could be established and started efficiently. A complete example of our protocol will be given to describe the fascinating fault-tolerance. We analyse the security of our protocol regarding four aspects, i.e. correctness, fault-tolerance, active attack and passive attack. The comparisons of performance between our protocol and that of Tzeng are also shown. As a whole, the advantage of our protocol is superior to that of Tzeng under the situation where malicious conferees exist.

A dynamical systems approach to weighted graph matching

Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal graph matching problem for weighted graphs, which is computationally challenging due the combinatorial nature of the set of permutations. Contrary to optimization-based relaxations to this problem, in this paper we develop a novel relaxation by constructing dynamical systems on the manifold of orthogonal matrices. In particular, since permutation matrices are orthogonal matrices with nonnegative elements, we define two gradient flows in the space of orthogonal matrices. The first minimizes the cost of weighted graph matching over orthogonal matrices, whereas the second minimizes the distance of an orthogonal matrix from the finite set of all permutations. The combination of the two dynamical systems converges to a permutation matrix, which provides a suboptimal solution to the weighted graph matching problem. Finally, our approach is shown to be promising by illustrating it on nontrivial problems.     

一种基于加法链的快速标量乘算法

给出一种标量的串长加法链算法来提高椭圆曲线标量乘法的效率。新的标量乘算法结合底层域直接计算2Q+P、2^nR+S算法,使用大小窗口法将串长算法和滑动窗口算法结合,加法链长度、存储空间和预计算都减少,其效率比二元法提高53%,比NAF法提高47.5%,比串长算法提高46.2%,比Windows法提高42.2%。     

基于ECC的无可信中心的(t，n)门限秘密共享方案

利用椭圆曲线离散对数问题(ECDLP),设计了一个无可信中心(SDC)的(t,n)门限秘密共享方案。系统的初始化、组成员的私钥、公钥的产生都不需要SDC的参与,利用各成员之间的秘密共享值,构造了秘密共享矩阵,结合Lagrange插值定理,实现了(t,n)门限秘密共享。分析表明,该方案具有较高的安全性和一定的实用价值。     

Coherent structure formation,phase correlations,and finite-size effects in 2D turbulence

General conditions for the formation of long-lived coherent vortices in decaying and force-driven 2-D turbulence are investigated. It is shown by a series of numerical simulations that the emergence of closed streamlines leading to the trapped trajectories of vorticity is a necessary, but not sufficient condition for this phenomenon, so that these trapped trajectories may be considered only as seed vortices. Numerical experiments which demonstrate the relations between phase correlations, finite-size effects, and the formation of coherent vortices in 2-D decaying turbulence are presented. It is shown that there is a universal dimensionless time for the onset of intermittency in the flow which corresponds to the time of establishment of phase correlations. The stricter conditions for appearance of coherent vortices in forced turbulence in comparison with decaying turbulence are associated with phase mixing introduced by random forcing. The universal features of decaying turbulence are discussed in terms of phase portraits based on inviscid constants of motion and their decay rates.