No abstract

No abstract

The maternal manipulation hypothesis for the evolution of reptilian viviparity has been claimed to apply to any situation where gravid females are able to maintain body temperatures different from those available in external nests, but empirical data that support this hypothesis are very limited. Here, we tested this hypothesis using gravid females of a warm‐climate lizard, Mabuya multifasciata, by subjecting them to five thermal regimes for the whole gestation period. We found gravid females selected lower body temperatures and thermoregulated more precisely than did nongravid females. Offspring produced in different treatments differed in head size, limb length and sprint speed, but not in overall body size or mass. Variation in morphological traits of offspring was induced primarily by extreme temperatures. Sprint speed of offspring was more likely affected by the mean but not by the variance of gestation temperatures. Gravid females maintained more stable body temperatures than did nongravid females not because these temperatures resulted in the optimization of offspring phenotypes but because the range of temperatures optimal for embryonic development was relatively narrow. Our data conform to the main predictions from the maternal manipulation hypothesis that females should adjust thermoregulation during pregnancy to provide optimal thermal conditions for developing embryos and that phenotypic traits forged by maternal thermoregulation should enhance offspring fitness.

We consider the multiple traveling salesman problem on a weighted tree. In this problem there are m salesmen located at the root initially. Each of them will visit a subset of vertices and return to the root. The goal is to assign a tour to every salesman such that every vertex is visited and the longest tour among all salesmen is minimized. The problem is equivalent to the subtree cover problem, in which we cover a tree with rooted subtrees such that the weight of the maximum weighted subtree is minimized. The classical machine scheduling problem can be viewed as a special case of our problem when the given tree is a star. We provide approximation and parameterized algorithms for this problem. We first present a PTAS (Polynomial Time Approximation Scheme). We then observe that, the problem remains NP-hard even if tree height and edge weight are constant, and present an FPT algorithm for this problem parameterized by the largest tour length. To achieve the FPT algorithm, we first formulate the problem as an integer linear program having a certain "tree-fold" structure. Then we show that an ILP with such a structure is FPT, which is a generalization of an earlier FPT result for n-fold integer programming by Hemmecke, Onn and Romanchuk [5]. This extension of n-fold ILP may be of independent interest. Keywords: Approximation schemes; Fixed Parameter Tractable; Integer Programming; Scheduling IntroductionWe consider the multiple traveling salesmen problem on a given tree T = (V, E). In this problem there is a root r ∈ V where all the m salesmen are initially located. There is a weight w e ∈ Z + associated with each edge e ∈ E, which is the time consumed by a salesman if he passes this edge. Each salesman starts at r, travels a subset of the vertices and returns to r. The goal is to determine the tours traveled by each salesman such that every vertex is visited by some salesman, and the makespan, i.e., the time when the last salesman returns to r, is minimized.We observe that the tour of every salesman is actually a subtree rooted at r, and the total traveling time of each salesman is exactly twice the total weight

No abstract

No abstract

We consider the online scheduling problem in a CPU-GPU cluster. In this problem there are two sets of processors, the CPU processors and the GPU processors. Each job has two distinct processing times, one for the CPU processor and the other for the GPU processor. Once a job is released, a decision should be made immediately about which processor it should be assigned to. The goal is to minimize the makespan, i.e., the largest completion time among all the processors. Such a problem could be seen as an intermediate model between the scheduling problem on identical machines and unrelated machines. We provide a 3.85-competitive online algorithm for this problem and show that no online algorithm exists with competitive ratio strictly less than 2. We also consider two special cases of this problem, the balanced case where the number of CPU processors equals to that of GPU processors, and the one-sided case where there is only one CPU or GPU processor. For the balanced case, we first provide a simple 3-competitive algorithm, and then a better algorithm with competitive ratio of 2.732 is derived. For the one-sided case, a 3-competitive algorithm is given.

Lactococcus lactis subsp. lactis biovar diacetylactis is widely used in dairy fermentations as it can form the butter aroma compounds acetoin and diacetyl from citrate in milk. Here we explore the possibility of producing acetoin from the more abundant lactose. Starting from a dairy isolate of L. lactis biovar diacetylactis, we obtained a series of mutants with low lactate dehydrogenase (ldh) activity. One isolate, RD1M5, only had a single insertion mutation in the ldh gene compared to its patental strain through whole genome re-sequencing analysis. We tested the ability of RD1M5 to produce acetoin in milk. With aeration all the lactose could be consumed, and the only product was acetoin. In a simulated cheese fermentation, a 50% increase in acetoin concentration could be achieved. RD1M5 turned out to be an excellent cell factory for acetoin and was able to convert lactose in dairy waste into acetoin with high titer (41 g/L) and high yield (above 90% of the theoretical yield). Summing up, RD1M5 was found to be highly robust, and to grow excellently in milk or dairy waste. Being natural in origin opens up for applications within dairies as well as for safe production of food-grade acetoin from low-cost substrates.