Head and neck oncology – 2010, part I

SummaryThis article reviewed the current state of the art in head and neck oncology. These include very important and stimulating new areas of interest including the marked acceptance of chemoradiation in favor of surgery in patients with cancer of the head and neck. The concept of HPV as a cause of cancer of the oropharynx is relatively new and very important in the epidemiology of these tumors. New modalities such as PET CT scanning and robotic surgery are discussed and appear to be very important in management of cancer of the head and neck. Endoscopic endonasal skull base surgery is another new high technology contribution to the field of head and neck surgery as is the use of endoscopic assisted thyroid surgery. These and other new concepts are discussed in this manuscript

Efficient Algorithms for Moral Lineage Tracing

Lineage tracing, the joint segmentation and tracking of living cells as they move and divide in a sequence of light microscopy images, is a challenging task. Jug et al. have proposed a mathematical abstraction of this task, the moral lineage tracing problem (MLTP), whose feasible solutions define both a segmentation of every image and a lineage forest of cells. Their branch-and-cut algorithm, however, is prone to many cuts and slow convergence for large instances. To address this problem, we make three contributions: (i) we devise the first efficient primal feasible local search algorithms for the MLTP, (ii) we improve the branch-and-cut algorithm by separating tighter cutting planes and by incorporating our primal algorithms, (iii) we show in experiments that our algorithms find accurate solutions on the problem instances of Jug et al. and scale to larger instances, leveraging moral lineage tracing to practical significance.Comment: Accepted at ICCV 201

Two algorithms for LCS Consecutive Suffix Alignment

AbstractThe problem of aligning two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence similarity problem is the incremental string comparison problem, denoted Consecutive Suffix Alignment, which is, given two strings A and B, to compute the alignment solution of each suffix of A versus B.Here, we present two solutions to the Consecutive Suffix Alignment Problem under the LCS (Longest Common Subsequence) metric, where the LCS metric measures the subsequence of maximal length common to A and B. The first solution is an O(nL) time and space algorithm for constant alphabets, where the size of the compared strings is O(n) and L⩽n denotes the size of the LCS of A and B.The second solution is an O(nL+nlog|Σ|) time and O(n) space algorithm for general alphabets, where Σ denotes the alphabet of the compared strings

Model studies of box girders

Call number: LD2668 .T4 1969 J28Master of Scienc