Heat transfer behaviour of nanofluids in a uniformly heated circular tube fitted with helical inserts in laminar flow

The CFD simulation of heat transfer characteristics of a nanofluid in a circular tube fitted with helical twist inserts under constant heat flux has been explained using Fluent version 6.3.26 in laminar flow. Al₂O₃ nanoparticles in water of 0.5%, 1.0% and 1.5% concentrations and helical twist inserts of twist ratios 2.93, 3.91 and 4.89 has been used for the simulation. All thermophysical properties of nanofluids are temperature dependent. The heat transfer enhancement increases with Reynolds number and decreases with twist ratio with maximum for the twist ratio 2.93. By comparing the heat transfer rates of water and nanofluids, the increase in Nusselt number is 5%–31% for different helical inserts and different volume concentrations. The maximum heat transfer enhancement is 31.29% for helical insert of twist ratio 2.93 and for the volume concentration of 1.5% corresponding to the Reynolds number of 2039. The data obtained by simulation match with the literature value of water with the discrepancy of less than ±10% for plain tube and tube fitted with helical tape inserts for Nusselt number.     

单可变资源最小化加权完工时间和排序问题的强NP-困难性

Baker和Nuttle提出了下述单可变资源排序问题：扎个工件利用某个单资源进行加工使得工件的完工时间的某个函数达到最小,而资源的可利用率是随着时间而变化的．当最小化的目标函数是工件的加权完工时间和时,Baker和Nuttle猜测该问题是NP-困难的．最近,Yuan、Cheng和Ng证明该问题在一般意义下是NP-困难的,但是问题的精确复杂性仍然是悬而未决的．本文我们证明了该问题是强NP-困难的．     

Zassenhaus猜想的一个注记

在这篇注记中,通过研究两个有限群直积的整群环的正规化挠单位的偏增广,证明了在某些条件下这些正规化挠单位与该群中的元素在有理群代数中共轭.     

Directed vertex-connectivity augmentation

Received August 1995 / Revised version received January 1997 Published online March 16, 1999     

Resource allocation for end-to-end QoS provisioning in a hybrid wireless WCDMA and wireline IP-based DiffServ network

In the future UMTS network, the heterogeneous traffics of multimedia services demand various QoS provisioning. At the same time, the seamlessly conveying of information between mobile users and a hybrid network requires the networking from wireless to wireline domains. However, in both academia and industries, the end-to-end QoS provisioning in the integration of wireline and wireless networks remains a challenge. In this paper, a modeling of a hybrid wireless WCDMA and wireline IP-based DiffServ network is presented to investigate the resource allocation for end-to-end QoS provisioning for multimedia services. In the wireless domain, the mathematical modeling of the cross-layer model including the physical layer, the link layer and the network layer is built. The connection admission control scheme is implemented based on the cross-layer model to determine the amount of resource for different services. In the wireline domain, we define the mapping of QoS classes between UMTS and DiffServ networks according to different QoS requirements. We propose a bandwidth allocation scheme to provide satisfactory packet loss and delay guarantee in DiffServ networks. The final end-to-end admission control scheme combines the resource allocation and admission control in both wireless and wireline domains. The analytical and simulation results show that the proposed resource allocation and admission control schemes work cooperatively in the presented hybrid wireless and wireline networks to guarantee the end-to-end QoS requirements for multimedia services.     

限制性多源点偏心距增广问题

给定一个赋权图$G=（V,E;w,c）$以及图$G$的一个支撑子图$G_{1}=（V,E_{1}）$,这里源点集合$S=\{s_{1},s_{2},\cdots,s_{k}\}\subseteq V$,权重函数$w：E\rightarrow\mathbb{R}^{+}$,费用函数$c：E\setminus E_{1}\rightarrow\mathbb{Z}^{+}$和一个正整数$B$,本文考虑两类限制性多源点偏心距增广问题,具体叙述如下：（1）限制性多源点最小偏心距增广问题是要寻找一个边子集$E_{2}\subseteq E\setminus E_{1}$,满足约束条件$c（E_{2}）$$\leq$$B$,目标是使得子图$G_{1}\cup E_{2}$上源点集$S$中顶点偏心距的最小值达到最小;（2）限制性多源点最大偏心距增广问题是要寻找一个边子集$E_{2}\subseteq E\setminus E_{1}$,满足约束条件$c（E_{2}）$$\leq$$B$,目标是使得子图$G_{1}\cup E_{2}$上源点集$S$中顶点偏心距的最大值达到最小。本文设计了两个固定参数可解的常数近似算法来分别对上述两类问题进行求解。     

Extremal graphs in connectivity augmentation

Let A(n, k, t) denote the smallest integer e for which every k‐connected graph on n vertices can be made (k + t)‐connected by adding e new edges. We determine A(n, k, t) for all values of n, k, and t in the case of (directed and undirected) edge‐connectivity and also for directed vertex‐connectivity. For undirected vertex‐connectivity we determine A(n, k, 1) for all values of n and k. We also describe the graphs that attain the extremal values. © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 179–193, 1999     

一种适用于光突发交换的区分型资源预留机制

将边缘结点突发汇聚算法与核心结点资源预留机制有机结合,提出了一种适用于光突发交换的区分型资源预留机制.引入“突发流”的概念,在边缘结点采用基于线性预测的突发汇聚算法将输入IP分组汇聚为单个突发或突发流;在核心结点引入“搭载请求”的思想,对单个突发和突发流采用不同的资源预留方案.仿真结果表明区分型资源预留机制可以明显改善光突发交换网络的丢失性能.     

树脂吸附法处理有毒有机化工废水及其资源化研究

介绍了大孔树脂的发展及在有机化工废水处理及资源化领域的应用,包括大孔树脂的合成、吸附作用的基本原理以及在具体化工废水处理项目（如2,3-酸、对硝基酚等）的应用。     

THE ROBUST CONTROL SCHEME FOR FREEFLOATING SPACE MANIPULATOR TO TRACK *THE DESIRED TRAJECTORY IN JOINTSPACE

The control of a free-floating space manipulator system is discussed. With the augmentation approach, the nonlinear parameterization problem of the dynamic equations of the space manipulator system is overcome. Based on the results, the robust control scheme for free-floating space manipulator with uncertain payload parameters to track the desired trajectory in jointspace is proposed, and the global convergence of the tracking is verified by using the Lyapunov method. The proposed control scheme is computationally simple, because we choose to make the controller robust to the uncertain inertial parameters rather than explicitly estimate them online. In particular, it needn't control the position and attitude of the floating base. A two-link planar space manipulator system is simulated to verify the control scheme proposed. Project supported by the National Natural Science Foundation of China (No. 19872032), Aeronautical Science Foundation, and Science Foundation of Fuzhou University.