Dynamic Waveband Switching in WDM Mesh Networks Based on a Generic Auxiliary Graph Model

Waveband switching (WBS) is a promising technique to reduce the switching and transmission costs in the optical domain of a wavelength-division multiplexing (WDM) network. This paper considers the problem of provisioning dynamic traffic using WBS in a WDM mesh network. The network of interest is a homogeneous WBS network, where each node has the functionality of WBS. The problem is called the dynamic WBS problem, which involves searching waveband-routes or wavelength-routes for the dynamically arriving traffic requests. The objective is to minimize the total switching and transmission costs in the optical domain. To solve the dynamic WBS problem, an auxiliary graph model capturing the network state is proposed. Based on the auxiliary graph, two heuristic on-line WBS algorithms with different waveband grouping policies are proposed, namely the wavelength-first WBS algorithm based on the auxiliary graph (WFAUG) and the waveband-first WBS algorithm based on the auxiliary graph (BFAUG). Simulation results indicate that WBS is an attractive technique which reduces the overall switching and transmission costs by up to 30% in the network. The results also show that the WFAUG algorithm outperforms the BFAUG algorithm in terms of port savings and cost savings.     

逻辑程序的一种并行执行模型

本文基于静态相关性分析和动态调整相结合的方法，提出了一种逻辑程序的执行模型，它不仅开发了“与“并行，同进也开发了一定的“或“并行，从而有效地加速了逻辑程序的执行。     

AN EXPERIMENTAL AND NUMERICAL INVESTIGATION OF THE STARTING FLOW OF A UNIFORMLY ACCELERATING CIRCULAR CYLIINDER

The starting flow around a uniformly accelerated circular cylinder is investigatedby flow visualization techncque and solving N-S equations numerically in detail.The results ofthe starting flow are similar with those of the impulsively started one.At lower Re_α,numbers the“phenomenon a”is revealed;the“phenomenon β”appears at higher Re_α numbers,but withonly one secondary vortex.At the early stage of the starting vortex formation,the flow islaminar;at the later stage,the flow transforms into turbulent flow.The velocity distribution inthe flow field is measured with the multiwires installment.The calculational results are comparedwith the results of experiment,and both are in agreement with each other.     

Air flow through a non-airconditioned bus with open windows

Open window buses without air-conditioning are a major mode of urban and inter-city transport in most countries. High occupancy combined with hot and humid conditions makes travel in these buses quite uncomfortable. In this study air flow through a bus has been studied that could be the basis for low cost and eco-friendly methods of increasing passenger comfort and possibly reduce drag. The aerodynamics of such a road vehicle has not been studied as previous investigations have been confined to vehicles with closed windows that present a smooth exterior to air flow. Using a 1:25 scaled Perspex model of an urban bus in Delhi, flow visualization was performed in a water channel. The Reynolds numbers were one-tenth of a real bus moving at 10 m/s. Smoke and tuft visualizations were also performed on an urban bus at 40 km/h. Numerical simulations were performed at the actual Reynolds number. Even though there were Reynolds number differences, the broad features were similar. Air enters the bus from the rear windows, moves to the front (relative to the bus) and exits from the front windows. Inside air velocity relative to the bus is about one-tenth of the free-stream velocity. The flow is highly three-dimensional and unsteady.     

GIS中矢量图形的结构分析与VC++中的实现

简要讨论了GIS各类矢量图形元素间的空间拓朴结构及基位置关系 ,并用VC 6 . 0及MFC具体分析了圆弧与多边形区域的相交关系及实现。为利用VC开发专用图形软件提供了有用帮助。     

Node-pair reliability of network systems with small distances between adjacent nodes

A new method for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence is presented. It is based on a recursive algorithm using the “sliding window” technique, the window being composed of several consecutive nodes. In a single step, the connectivity probabilities for all nodes included in the window are found. Subsequently, the window is moved one node forward. This process is repeated until, in the last step, the window reaches the terminal node. The connectivity probabilities found at that point are used to compute the node-pair reliability of the network system considered. The algorithm is designed especially for graphs with small distances between adjacent nodes, where the distance between two nodes is defined as the absolute value of the difference between the nodes’ numbers. The maximal distance between any two adjacent nodes is denoted by Γ(G), where G symbolizes a random graph. If Γ(G)=2 then the method can be applied for directed as well as undirected graphs whose nodes and edges are subject to failure. This is important in view of the fact that many algorithms computing network reliability are designed for graphs with failure-prone edges and reliable nodes. If Γ(G)=3 then the method's applicability is limited to undirected graphs with reliable nodes. The main asset of the presented algorithms is their low numerical complexity—O(n), where n denotes the number of nodes.     

Adaptive generation of surfaces in volume data

A widespread approach to generating polygonal approximations of iso-surfaces or contour surfaces in volume data is the socalled marching-cubes algorithm. This algorithm, however, has the disadvantage that the number of polygonal chains generated is considerable. The splitting-box algorithm presented here reduces the number of polygonal chains by adapting their size to the shape of the surface. The resulting polygonal chains offer a wide spectrum for representing the contour surface. An exact representation is achieved by a new type of generic patches calculated from the polygonal chains. Approximations of different quality may be obtained by combining the algorithm generating the patches with simple triangulations.