Windows的优化

本文从分析Ｗｉｎｄｏｗｓ与系统间的关系入手，论述了从多方面配合以优化Ｗｉｎｄｏｗｓ的具体措施及实现方法。     

Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast

Abstract. Let G=(V,E) be a 2-edge connected, undirected and nonnegatively weighted graph, and let S(r) be a single source shortest paths tree (SPT) of G rooted at r ∈ V . Whenever an edge e in S(r) fails, we are interested in reconnecting the nodes now disconnected from the root by means of a single edge e' crossing the cut created by the removal of e . Such an edge e' is named a swap edge for e . Let S _e/e' (r) be the swap tree (no longer an SPT, in general) obtained by swapping e with e' , and let S _e be the set of all possible swap trees with respect to e . Let F be a function defined over S _e that expresses some feature of a swap tree, such as the average length of a path from the root r to all the nodes below edge e , or the maximum length, or one of many others. A best swap edge for e with respect to F is a swap edge f such that F(S _e/f (r)) is minimum. In this paper we present efficient algorithms for the problem of finding a best swap edge, for each edge e of S(r) , with respect to several objectives. Our work is motivated by a scenario in which individual connections in a communication network suffer transient failures. As a consequence of an edge failure, the shortest paths to all the nodes below the failed edge might completely change, and it might be desirable to avoid an expensive switch to a new SPT, because the failure is only temporary. As an aside, what we get is not even far from a new SPT: our analysis shows that the trees obtained from the swapping have features very similar to those of the corresponding SPTs rebuilt from scratch.     

电信话单去重技术的研究

电信行业由于在话单采集过程中的某些异常可能会产生重复话单,如果不及时剔除,将导致用户的费用统计有误,引起客户投诉,造成客源流失。本文通过对电信行业海量数据的分析提出了一个利用文件索引、Swap技术、事务控制和并发处理相结合的方法解决话单判重和去重的问题,为设计去重算法提供了一个可以借鉴的方案。     

The approximate swap and mismatch edit distance

There is no known algorithm that solves the general case of the approximate edit distance problem, where the edit operations are insertion, deletion, mismatch, and swap, in time o(nm), where n is the length of the text and m is the length of the pattern.In the effort to study this problem, the edit operations have been analyzed independently. Karloff [10] showed an algorithm that approximates the edit distance problem with only the mismatch operation in time . Amir et al. [4] showed that if the only edit operations allowed are swap and mismatch, then the exact edit distance problem can be solved in time .In this paper, we discuss the problem of approximate edit distance with swap and mismatch. We show a randomized time algorithm for the problem. The algorithm guarantees an approximation factor of (1+?) with probability of at least .     

The Swap Edges of a Multiple-Sources Routing Tree

Let T be a spanning tree of a graph G and S⊂V(G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap edge of e is the edge f minimizing the routing cost of the tree formed by replacing e with f. Given an undirected graph G and a spanning tree T of G, we investigate the problem of finding the swap edge for every tree edge. In this paper, we propose an O(mlog n+n ²)-time algorithm for the case of two sources and an O(mn)-time algorithm for the case of more than two sources, where m and n are the numbers of edges and vertices of G, respectively.     

A general variable neighborhood search for the swap-body vehicle routing problem

The Swap-Body Vehicle Routing Problem, a generalization of the well known Vehicle Routing Problem, can be stated as follows: the vehicle fleet consisting of trucks, semi-trailers, and swap bodies, is available at a single depot to serve a given set of customers. To serve a subset of customers, one may use either a truck carrying one swap body or a train (a truck with a semi-trailer attached to it) carrying two swap bodies. In both cases, a vehicle (a truck or a train) must perform a route starting and ending at the depot, so to satisfy demands of visited customers, maximal allowed route duration, allowed load on the used vehicle, and accessibility constraint of each customer. The accessibility constraint indicates whether a customer is allowed to be visited by a train or not. In addition, a set of swap locations is given where semi-trailers and swap bodies may be parked or swapped. The goal of the Swap-Body Vehicle Routing Problem is to minimize the total costs consisting of the fixed costs for using vehicles and costs for performing routes. In this paper, we propose two general variable neighborhood search heuristics to solve this problem. The quality of the proposed methods is evaluated on the instances provided by the organizers of VeRolog Solver Challenge 2014.     

一种计算机串行接口保护电路的设计

基于ESD保护的原理及TVS二极管的特性,设计了一种计算机串行接口的专用保护电路,并对电路板的PCB布线及器件的布置提出了一些原则要求,最后对此接口电路进行静电放电抗扰度试验。结果表明该保护电路具有一定的抗接触放电及空间放电能力,满足IEC61000-4-2标准的要求,此串行接口具有热插拔功能。     

Robotics in the factory of the future Role of Robots in the Factory of the Future

Robots represent a flexible source of automation in a variety of manufacturing processes today. As a result of this, robots are being increasingly used as an alternative for automation in a large number of manufacturing concerns. The present trend has been to link these islands of automation together with efficient material handling and computer control to attain to totally automated environment, what is commonly referred to as the “Factory of the Future”. This paper discusses the role of robots in such a factory and draws upon a case study to illustrate the varied aspects that one deals with in robotization in such an environment.     

一种在原始视频帧中嵌入的鲁棒的数字水印

该文提出的在原始视频帧中的扩频水印方案,使用二值图像作为水印,采用每帧索引的办法,并且利用相邻帧的统计相关性来嵌入水印。对于丢帧、帧重组以及共谋攻击有很强的鲁棒性。水印提取时不需要用到原始视频。文中对该方案进行了详细的介绍,并给出了仿真实验结果。