− In this paper, we investigate an improved upper bound on the bit error probability of turbo codes for the maximum likelihood (ML) decoding with imperfect channel state information (CSI) in a fully interleaved Rayleigh fading channel. The upper bound is based on recently introduced Viterbi & Viterbi bound and is also compared with iterative decoding using the Log-MAP algorithm. It is shown tha...

this paper considers the economic lot scheduling problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. combination of frequency and timing as well as production quantity make this problem np-hard. a heuristic is developed to obtain a good solution to elsp. the proposed heuristic makes use of the simulated annealing technique...

This paper considers metric spaces where distances between a pair of nodes are represented by distance intervals. The goal is to study methods for the determination of hierarchical clusters, i.e., a family of nested partitions indexed by a resolution parameter, induced from the given distance intervals of the metric spaces. Our construction of hierarchical clustering methods is based on definin...

let be a random sample from a normal distribution with unknown mean and known variance the usual estimator of the mean, i.e., sample mean is the maximum likelihood estimator which under squared error loss function is minimax and admissible estimator. in many practical situations, is known in advance to lie in an interval, say for some in this case, the maximum likelihood estimator changes and d...

with probability 1 − o(1). Last time it was shown that almost surely d ≥ (1 + o(1))(log n/ log d̃), so we now concentrate on proving that this is also an upper bound. We will need three lemmas before attacking the theorem itself. We also mention that some technical details will be omitted, and we refer the reader to [1] for the full treatment. In particular, it is worth mentioning that this theo...

Some type-based approaches to termination use sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted if it is visible in the type system that recursive calls occur just at a smaller size. This approach is only sound if the type of the recursive function is admissible, i.e., depends on the size index in a certain w...

The maximum number of minimal dominating sets that a graph on n vertices can have is known to be at most 1.7159. This upper bound might not be tight, since no examples of graphs with 1.5705 or more minimal dominating sets are known. For several classes of graphs, we substantially improve the upper bound on the maximum number of minimal dominating sets in graphs on n vertices. In some cases, we ...

This paper examines the partial orderings of discrete distributions derived from various poverty indices and sets of welfare functions. The poverty ordering with respect to some index P is the ordering obtained when P ranks consistently over a range of admissible poverty lines. The poverty orderings derived from the headcount ratio, the per-capita income gap and another "distribution-sensitive"...

We consider a finite string where, at both end points, a homogeneous Dirichlet boundary condition holds. One boundary point is fixed, and the other is moving; hence the length of the string is changing in time. The string is controlled through the movement of this boundary point. We consider movements of the boundary that are Lipschitz continuous. Only movements for which at the given finite te...