Dynamic Multicast Session Provisioning in WDM Optical Networks with Sparse Splitting Capability

In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes.     

A classification of tournaments having an acyclic tournament as a minimum feedback arc set

Given a tournament with an acyclic tournament as a feedback arc set we give necessary and sufficient conditions for this feedback arc set to have minimum size.     

一种采用单台微机控制的标签粘贴机

标签粘贴机是一种可自动进行标签打印和粘贴的设备装置,在工业自动化生产中有着广泛的应用.介绍了一种采用单台微机进行控制的全自动标签粘贴机的工作原理及各部分组成,以及使用过程中对其进行设置和调整的方法.该标签粘贴机已实际应用于华飞彩色显示系统有限公司29英寸彩色显像管生产线的屏网组装工序,取得了良好的效果.     

The pickup and delivery problem: Faces and branch-and-cut algorithm

This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented.     

Time-Space Label Switching Protocol (TSL-SP)—A New Paradigm of Network Resource Assignment

In this paper we propose a new protocol called time-space label switching protocol (TSL-SP) in optical burst switching (OBS), and define the terms time-space label (TSL) and time-space routing (TSR). An important concept of response time is introduced in the time label mechanism. The TSL-SP is a new technology that can quickly and efficiently forward data with a label on the optical networks. A two-dimension label switched path (TD-LSP) can be set up, that is maintained and deleted by the TSL-SP. For clearly illuminating the operation principles of the TSL-SP, we propose a new approach of orthogonal time-space coordinates in which the vertical coordinate is the space label and the horizontal coordinate is the time label. The proposed TD-LSP can dramatically reduce the routing failure probability and greatly improve the link network efficiency compared with other signaling protocols. Moreover, we define the time-space label control plane that can achieve the higher efficiency. When the TSL-SP is applied to networks, switching performance can be improved by two orders compared to the switching performance with the conventional OBS signaling protocols. The fundamental goal of TSL-SP is to band the signaling and routing functions together closely. Also, the TSL-SP can reduce the complexity of the network, support automatic service offering, and provide traffic engineering.     

下一代网络--多协议标记交换MPLS思想剖析

多协议标记交换MPLS通过在传统的IP包里加入标记，使原来依赖于IP头标分析的路由转发转变为依赖于标记的转发，这不仅可以大大地提高IP包的转发速度，更可使传统IP网络具有QoS能力。本文深入分析了标记转发的思想．并指出了MPLS实现其优点所用的机制与原理。     

Study of miscibility enhancement in poly(styrene‐co‐4‐vinylphenol)/poly(ethylene oxide) blends by the spin labelling method

The electron spin resonance (ESR) spectra of end‐group spin labelled poly(ethylene oxide) (SLPEO) using 2,2,6,6‐tetramethyl‐piperdine‐1‐oxyl nitroxide and its blends with poly(styrene‐co‐4‐vinylphenol) (STVPhs) of different hydroxyl contents were recorded over a wide temperature range. For a blend of SLPEO and pure polystyrene (PS), the ESR spectrum was composed of a single motion component, indicating that PS was immiscible with PEO. For blends composed of SLPEO and different‐hydroxyl‐content STVPhs, two spectral components with different motion rates were observed over a certain temperature range. The difference between the motion rates should be attributed to micro‐heterogeneity in the blends, with the faster rate corresponding to a nitroxide radical motion trapped in the PEO‐rich domain and the slower rate corresponding to a nitroxide radical motion trapped in the STVPh‐rich domain. Variations in the values of a number of the ESR parameters (T_a, T_d and T_50G) and the apparent activation energy (E_a) with hydroxyl content in the blends indicated that the miscibility of the blends increased with increasing hydrogen‐bonding density due to specific interactions between the hydroxyl groups in STVPh and the ether oxygens in PEO. Copyright © 2004 Society of Chemical Industry     

A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry

The molten iron allocation problem (MIAP) is to allocate molten iron from blast furnaces to steel-making furnaces. The allocation needs to observe the release times of the molten iron defined by the draining plan of the blast furnaces and the transport time between the iron-making and steel-making stages. Time window constraints for processing the molten iron must be satisfied to avoid freezing. The objective is to find a schedule with minimum total weighted completion time. This objective reflects the practical consideration of improving steel-making efficiency and reducing operation cost caused by the need for reheating. Such a problem can be viewed as a parallel machine scheduling problem with time windows which is known to be NP-hard. In this paper, we first formulate the molten iron allocation problem as an integer programming model and then reformulate it as a set partitioning model by applying the Dantzig–Wolfe decomposition. We solve the problem using a column generation-based branch-and-price algorithm. Since the subproblem of column generation is still NP-hard, we propose a state-space relaxation-based dynamic programming algorithm for the subproblem. Computational experiments demonstrate that the proposed algorithm is capable of solving problems with up to 100 jobs to optimality within a reasonable computation time.     

Ranking with uncertain labels and its applications

The techniques for image analysis and classification generally consider the image sample labels fixed and without uncertainties. The rank regression problem studied in this paper is based on the training samples with uncertain labels, which often is the case for the manual estimated image labels. A core ranking model is designed first as the bilinear fusing of multiple candidate kernels. Then, the parameters for feature selection and kernel selection are learned simultaneously by maximum a posteriori for given samples and uncertain labels. The provable convergency Expectation Maximization (EM) method is used for inferring these parameters in an iterative manner. The effectiveness of the proposed algorithm is finally validated by the extensive experiments on age ranking task and human tracking task. The popular FG-NET and the large scale Yamaha aging database are used for the age estimation experiments, and our algorithm outperforms those state-of-the-art algorithms ever reported by other interrelated literatures significantly. The experiment result of human tracking task also validates its advantage over conventional linear regression algorithm. A short version of this paper appeared in ICME07.     

用C语言链表解决大整数运算的精度问题

介绍用C语言链表解决大整数运算的精度问题的方法。