The constrained pairwise sequence alignment (CPSA) problem aims to align two given sequences by aligning their similar subsequences in the same region under the guidance of a given pattern (constraint). Let the lengths of the sequences be m, and n where n <or= m, and let r <or= n be the length of the given pattern. The optimum constrained pairwise alignment score can be computed using O(rn) spa...

Concerns regarding the Trans-Pacific Partnership (TPP) have raised awareness about the negative public health impacts of trade and investment agreements. In the past decade, we have learned much about the implications of trade agreements for public health: reduced equity in access to health services; increased flows of unhealthy commodities; limits on access to medicines; and constrained policy...

This article discusses what ethicists have called “unacceptable trade-offs” in health policy choices related to universal health coverage (UHC). Since the fiscal space is constrained, trade-offs need to be made. But some trade-offs are unacceptable on the path to universal coverage. Unacceptable choices include, among other examples from low-income countries, to expand coverage for services wit...

Sacrifice of the posterior cruciate ligament (PCL) in revision total knee replacement (TKR) is common, aiding in exposure, restoration of the flexion space, obtaining postoperative stability, and improving the clinical outcomes. Several PCL substituting implants are available including deep-dished, postand-cam, varus/valgus constrained, and hinge implants. Use of the least constrained implant p...

We present algorithms for length-constrained maximum sum segment and maximum density segment problems, in particular, and the problem of finding length-constrained heaviest segments, in general, for a sequence of real numbers. Given a sequence of n real numbers and two real parameters L and U (L 6 U), the maximum sum segment problem is to find a consecutive subsequence, called a segment, of len...

We present a data-driven framework that uses very limited data to learn generalizable bypass transition models. Trained on just two flat plate cases, the augmented model is shown generalize other cases and turbomachinery configurations.

Novelty search is a recent algorithm geared toward exploring search spaces without regard to objectives. When the presence of constraints divides a search space into feasible space and infeasible space, interesting implications arise regarding how novelty search explores such spaces. This paper elaborates on the problem of constrained novelty search and proposes two novelty search algorithms wh...