The one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties is addressed. This problem is NP-complete, so that local search approaches are very useful to efficiently find good feasible schedules. In this paper, we present an extension of the dynasearch neighborhood for this problem. Finding the best schedule in this neighborhood is shown to...

Consider the initial boundary value problem for the system (S) ut = uxx− (uvx)x, vt = u− av on an interval [0, 1] for t > 0 where a > 0 with ux(0, t) = ux(1, t) = 0. Suppose u0, v0 are positive constants. The corresponding spatially homogeneous global solution U(t) = u0, V (t) = u0/a+ (v0 − u0/a) exp(−at) is stable in the sense that if (u0, v ′ 0) are positive constants, the corresponding spati...

Usually ambiguous words contained in article appear several times. Almost all existing methods for unsupervised word sense disambiguation make use of information contained only in ambiguous sentence. This paper presents a novel approach by considering neighborhood knowledge. The approach can naturally make full use of the within-sentence relationship from the ambiguous sentence and cross-senten...

The finding that neighboring eukaryotic genes are often expressed in similar patterns suggests the involvement of chromatin domains in the control of genes within a genomic neighborhood.