Three methods of approximating the sum lognormal variates to a distribution were studied. They Wilkinson approximation, Monte Carlo version approximation and using estimated maximum likelihood parameters. The generated empirically simulation based on several conditions such as number in sum, sample points variates, are independent identically distributed (IID) also not (NIID) with Evaluation al...

Histamine intolerance occurs when there is an imbalance between histamine production and the capacity for degradation. Diamine oxidase (DAO) main enzyme catabolism of ingested degradation in gastrointestinal tract its deficiency has been linked to allergy-like symptoms. Psychostimulant drugs are commonly used treat Attention Deficit Hyperactivity Disorder (ADHD), but their interaction with DAO ...

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...

In the minimum sum coloring problem, the goal is to color the vertices of a graph with the positive integers such that the sum of all colors is minimal. Recently, it was shown that coloring a graph by iteratively coloring maximum independent sets yields a 4 + o(1) approximation for the minimum sum coloring problem. In this note, we show that this bound is tight. We construct a graph for which t...

The chromatic sum Σ(G) of a graph G is the smallest sum of colors among all proper colorings with natural numbers. The strength s(G) of G is the minimum number of colors needed to achieve the chromatic sum. We construct for each positive integer k a tree Tk with strength k that has maximum degree only 2k − 2. The result is best possible.

We consider the problem of finding a feasible single-commodity flow in a strongly connected network with fixed supplies and demands, provided that the sum of supplies equals the sum of demands and the minimum arc capacity is at least this sum. A fast algorithm for this problem improves the worst-case time bound of the Goldberg-Rao maximum flow method[3] by a constant factor. Erlebach and Hageru...

We give eecient algorithms to compute an optimal bipartition of a set of points or a set of simple polygons in the plane. In particular, we give an O(n 2) algorithm for partitioning a set of n points into two subsets in order to minimize the sum of the perimeters of the convex hulls. We also examine the problems of minimizing the maximum of the perimeters, or the sum/maximum of the areas, for t...

Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In this work, we introduce a linearized version of such codes, called linearized Reed-Solomon codes. We prove that they have maximum sum-rank distance. Such dist...

The Wiener index of a connected graph is the sum of topological distances between all pairs of vertices. Since Wang in [23] gave a mistake result on the maximum Wiener index for given tree degree sequence, in this paper, we investigate the maximum Wiener index of trees with given degree sequences and extremal trees which attain the maximum value.