Development of a new meshless technique is described that presents certain advantages over conventional meshless schemes due to unique weights that force alignment of the derivative approximation. The method is completelymeshless, yet retains the low storage and simple fluxdistribution technique that are characteristic of finite volumemethods. The newmethod is based on thewell-knownTaylor serie...

In many situations, automated multi-alignment programs are not able to correctly align families of nucleic acid or protein sequences. Difficult cases comprise not only distantly related sequences but also tandem duplications independent of their evolutionary age. Frequently, additional biological information is available that establishes homologies at least in parts of the sequences based on st...

Optimizing highway alignments is a very complex engineering problem. None of existing methods has totally solved the problem In this paper we build an optimization model for highway 3D alignment based on two-stage dynamic programming, in which the comprehensive cost and design constraints are embedded. In the first stage: we formulate the optimization of alignment as a network problem by establ...

The local sequence alignment problem is the detection of similar subsequences in two given sequences of lengths n m. Unfortunately the common notion of local alignment suuers from some well-known anomalies which result from not taking into account the lengths of the aligned subsequences. We introduce the length restricted local alignment problem which includes as a constraint an upper limit T o...

This article presents a method for aligning words between translations, that imposes a compositionality constraint on alignments produced with statistical translation models. Experiments conducted within the WPT-03 shared task on word alignment demonstrate the effectiveness of the proposed approach.

This paper describes a tool for aligning and searching parallel treebanks. Such treebanks are a new type of parallel corpora that come with syntactic annotation on both languages plus sub-sentential alignment. Our tool allows the visualization of tree pairs and the comfortable annotation of word and phrase alignments. It also allows monolingual and bilingual searches including the specification...

Unit quaternion is an ideal parameterization for joint rotations. However, due to the complexity of the geometry of S group, it’s hard to specify meaningful joint constraints with unit quaternion. In this paper, we have proposed an effective and accurate method to specify the rotation limits for joints parameterized with the unit quaternion. Joint constrains constructed with our method are adeq...

In Optimality Theory (OT), recent work has been exploring the idea that the order of constituents in syntax is determined by alignment constraints, developed within the theory of Generalized Alignment (see McCarthy and Prince (1993)). Costa (1998) and Samek-Lodovici (1998) present general overviews, and both have specifically argued that OT analyses are superior to proposals expressed in terms ...

We cast the word alignment problem as maximizing a submodular function under matroid constraints. Our framework is able to express complex interactions between alignment components while remaining computationally efficient, thanks to the power and generality of submodular functions. We show that submodularity naturally arises when modeling word fertility. Experiments on the English-French Hansa...