A heuristic for the label printing problem

Label printing finds many applications in industry. However, this task is still labor intensive in many printing factories. Since each template can only accommodate a fixed number of labels, an important task is to work out the compositions of templates by allocating suitable labels to each template in order to fulfill the order requirements effectively. The template design could be rather arbitrary, which usually ends up with a lot of excessive printed labels. Enhancing the template design will significantly improve the efficiency of the printing process, and, at the same time, reduce the waste of resources. This motivates the study of more automatic design methods. In this paper, the problem is first formulated as a nonlinear integer programming problem. The main variables in the formulation are the compositions and the printing frequencies of templates. For practical purpose, each type of label is confined to one template only which allows automated packing and handling. The structure of the problems is carefully analyzed and a new algorithm is proposed. Numerical results show that the proposed method is a simple but effective way of generating good template designs.     

视频识别中基于簇的在线运动分割算法研究

仿射相机模型下,运动分割问题转化为子空间分离问题,处理这类问题的算法大多是离线算法,当假设不满足时性能很不理想.针对上述问题,提出一种在线运动分割算法,通过动态标签传输和簇分割进行运动分割.首先,根据固定数量的帧进行初始化,接着,通过在线策略更新轨迹相似性,最后,利用动态标签传输技术在帧间传输信息,对簇进行评估和归一化切分成本估计,实现动态的簇分割.基于基准数据集的仿真实验结果表明,算法的运行结果与离线算法相当.     

Convolutional neural networks recognition algorithm based on PCA

To improve the insufficiency of Synthetic Aperture Radar(SAR) labeled training data for Convolutional Neural Networks(CNN) and the recognition rate for large variations, a novel CNN recognition algorithm is proposed. Firstly, a set of features is extracted from the original data by unsupervised training based on PCA as the initial filter set for CNN. Secondly, in order to accelerate the training speed while avoiding over-fitting, the Rectified Linear Units(ReLU) is adopted as the non-linear function. Thirdly, to strengthen robustness and mitigate the defects of pooling upon features, a probabilistic max-pooling sampling method is introduced and local contrast normalization is exploited on features after the convolutional layer. Experiments demonstrate that our algorithm outperforms the original CNN in recognition rate and achieves better robustness for large variations and complex background.     

基于核心图的标签传播算法

网络中的社团发现是当前的一个研究热点.在众多社团发现算法中,标签传播算法因简单快速而被广泛应用,但标签传播算法也存在结果稳定性较差的问题.基于此对标签传播算法的初始化过程进行改进,提出了基于核心图的标签传播算法.通过计算图中任意两点的k阶公共邻居,将具有最大相似性的节点及k阶邻居作为初始核心社团,并为其分配初始标签.通过上述过程,提取一些较为紧密的子结构来作为标签传播的初始社团,并给这些结构分配初始社团标签.在真实网络中的实验结果表明,该算法可以大幅提高结果的稳定性.     

一道数字排列题算法演示的C#实现

编程解决实际问题,不仅通过大量的编程实践,掌握一定的编程技巧,同时也需要找到解决问题的正确方案。通过一道数字排列题的解决演示,灵活运用C#语言编程实现该问题算法的可视化演示。     

MPLS网络工程流量分析

多协议标签交换MPLS（Multi-Protocol Label Switching）是一种高效的数据包交换技术,提供了标记、路由、转发等能力．论文使用OPNET软件,对MPLSTE技术在网络流量管理与负载均衡等方面进行仿真对比,与传统的IP网络相比具有更优异的表现。     

Lagrangean relaxation with clusters for point-feature cartographic label placement problems

This paper presents two new mathematical formulations for the point-feature cartographic label placement problem (PFCLP) and a new Lagrangean relaxation with clusters (LagClus) to provide bounds to these formulations. The PFCLP can be represented by a conflict graph and the relaxation divides the graph in small subproblems (clusters) that are easily solved. The edges connecting clusters are relaxed in a Lagrangean way and a subgradient algorithm improves the bounds. The LagClus was successfully applied to a set of instances up to 1000 points providing the best results of those reported in the literature.     

基于基本回路的MPLS网络重路由故障恢复机制

研究MPLS网络中的重路由故障恢复机制,提出一种新的计算备用路径的方法,将备用路径的计算分为预处理和在线计算2个过程,给出一种基于基本回路的重路由故障恢复机制(FC-R)。仿真分析表明,FC-R恢复时间较短,可以对抗节点故障或链路故障,大大缩短在线计算时间,减轻节点负担,能够得到性能较优的备用路径,进一步节省网络资源。     

用VB标签控件实现动态效果

在VB程序设计里．标签通常是作为在窗口里显示文字信息的。用活标签的常用属性。并合理使用计时器控件。就能够呈现出动态的文字效果。为窗口界面增添活力。     

Redirection based recovery for MPLS network systems

To provide a reliable backbone network, fault tolerance should be considered in the network design. For a multiprotocol label switching (MPLS) based backbone network, the fault-tolerant issue focuses on how to protect the traffic of a label switched paths (LSP) against node and link failures. In IETF, two well-known recovery mechanisms (protection switching and rerouting) have been proposed. To further enhance the fault-tolerant performance of the two recovery mechanisms, the proposed approach utilizes the failure-free LSPs to transmit the traffic of the failed LSP (the affected traffic). To avoid affecting the original traffic of each failure-free LSP, the proposed approach applies the solution of the minimum cost flow to determine the amount of affected traffic to be transmitted by each failure-free LSP. For transmitting the affected traffic along a failure-free working LSP, IP tunneling technique is used. We also propose a permission token scheme to solve the packet disorder problem. Finally, simulation experiments are performed to show the effectiveness of the proposed approach.