In this article we explain how to easily compute gene clusters, formalized by classical or generalized nested common or conserved intervals, between a set of K genomes represented as K permutations. A b-nested common (resp. conserved) interval I of size |I| is either an interval of size 1 or a common (resp. conserved) interval that contains another b-nested common (resp. conserved) interval of ...

A concise outline of background is given on assistive methods for writing and communicating for non-speaking people, highlighting the role of efficient text entry in augmentative and alternative communication (AAC). AAC systems are designed to assist people with communication impairments to interact with others and to compose messages and other documents. Efficient text entry is therefore of gr...

This paper chronicles some issues that arose in attempting to implement two simple planners that interleave planning and execution. (For brevity, such planners will be called IPE planners.) The IPE planners are based on UCPOP (Barrett et al. 1993), a classic operator-based planner using goal-regression. Unfortunately, while the planners succeeded on very simple problems, they failed on problems...

Telecommunications is increasingly vital to the society at large, and has become essential to business, academic, as well as social activities. Due to the necessity to have access to telecommunications, the deployment requires regulations and policy. Otherwise, the deployment of the infrastructures would contribute to environment, and human complexities rather than ease of use. However, the for...

Watkins has conjectured that if R is the rank of the group of rational points of an elliptic curve E over the rationals, then 2 divides the modular parametrisation degree. We show, for a certain class of E, chosen to make things as easy as possible, that this divisibility would follow from the statement that a certain 2adic deformation ring is isomorphic to a certain Hecke ring, and is a comple...

In practical system identification it is often desirable to simultaneously handle several objectives and constraints. In some cases, these objectives and constraints are often non-commensurable and the objective functions are explicitly/mathematically not available. In this paper, Interactive Evolutionary Computation (IEC) is used to effectively handle these identification problems. IEC is an o...

The debts’ clearing problem is about clearing all the debts in a group of n entities (eg. persons, companies) using a minimal number of money transaction operations. In a previous paper we conjectured the problem to be NP-complete. In this paper we prove that it is NP-hard in the strong sense and also NP-easy. We also show the same results for a restricted version of the problem.

To facilitate the implementation of workflows, enterprise and workflow system vendors typically provide sets of workflow templates for their software. Each of these templates depicts a variant of how a particular business process can be supported by the software. The user of such a system can save the effort of creating the models and the links to system components from scratch by selecting and...