Packet Forwarding Algorithms in a Line Network

Abstract. We initiate a competitive analysis of packet forwarding poli-cies for maximum and average flow in a line network. We show that the policies Earliest Arrival and Furthest-To-Go are scalable, but not con-stant competitive, for maximum flow. We show that there is no constant competitive algorithm for average flow.

The Design and Use of F1 Softgauges for Validating Surface Metrology Software

This paper presents a methodology for validating surface metrology software. Based uncertainty analysis, a set of reference data sets with mathematical correct results, call the type F1 softgauges, have been developed. Special designed profiles can be used to check specification uncertainty and algebra calculation is used to lower method uncertainty. The results shown that specification uncertainties were main uncertainty contributors

On the Complexity of Constrained Sequences Alignment Problems

Lecture Notes in Computer Science, vol. 8497 entitled: Frontiers in algorithmics : 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014: proceedingsWe consider the problem of aligning a set of sequences subject to a given constrained sequence, which has applications in computational biology. In this paper we show that sequence alignment for two sequences A and B with a given distance function and a constrained sequence of k identical characters (say character c) can be solved in O( min {kn 2,(t − k)n 2}) time, where n is the length of A and B, and t is the minimum number of occurrences of character c in A and B. We also prove that the problem of constrained center-star sequence alignment (CCSA) is NP-hard even over the binary alphabet. Furthermore, for some distance function, we show that no polynomial-time algorithm can approximate the CCSA within any constant ratio

The point placement problem on a line improved bounds for pairwise distance queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)4645 LNBI372-38