Arrays of surface wrinkles of linearly increasing heights (from tens of nanometers to tens of micrometers) were prepared via a spontaneous reaction-diffusion process based on periodic precipitation. The slopes, dimensions, and positions of the precipitation bands could be controlled precisely by adjusting the concentrations of the participating chemicals as well as the material properties of pa...

One of the three most frequently documented copy number variations associated with autism spectrum disorder (ASD) is a 1q21.1 duplication that encompasses sequences encoding DUF1220 protein domains, the dosage of which we previously implicated in increased human brain size. Further, individuals with ASD frequently display accelerated brain growth and a larger brain size that is also associated ...

Four crossbred steers (average BW = 478 ± 33 kg) were used in a 4 × 4 Latin square design to determine the effects of dietary concentration of dry corn distillers grains plus solubles (DDGS) in whole corn-based finishing diets on total tract digestion and nutrient balance and excretion. The DDGS were fed at 0% (control), 16.7%, 33.3%, and 50% of dietary DM. All diets contained 10% (DM basis) al...

The concept of heritability as generally used, involves the assumption that additive genetic variance is a constant proportion of total variance over the entire range of phenotypes. If this assumption holds, selection response will be linearly related to selection differential. If not, prediction of selection response will not be possible from a knowledge of the phenotypic selection differentia...

Given a sequence of integers, we want to find a longest increasing subsequence of the sequence. It is known that this problem can be solved in O(n log n) time and space. Our goal in this paper is to reduce the space consumption while keeping the time complexity small. For √ n ≤ s ≤ n, we present algorithms that use O(s log n) bits and O( 1 s · n · log n) time for computing the length of a longe...

The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be Θ̃( √ N). However, the randomized complexity is wide open. We show that the technique used in earlier work to establish the Ω( √ N) deterministic lower bound fails strongly under randomization: specifically, we show that the communication problems on which...

By reviewing Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS), the Longest Common Increasing Subsequence (LCIS) problem is explored for two non-random input cases in details. Specifically, we designed two algorithms, one solving the input sequence scenario with the case that one sequence is ordered and duplicate elements are allowed in each of sequences, and the second ...

We consider the problem of :nding the longest increasing subsequence in a sliding window over a given sequence (LISW). We propose an output-sensitive data structure that solves this problem in time O(n log log n+OUTPUT) for a sequence of n elements. This data structure substantially improves over the na?@ve generalization of the longest increasing subsequence algorithm and in fact produces an o...

In this paper we give parallel solutions to the problem of finding the Longest Increasing Subsequence of a given sequence of n integers. First, we show the existence of a simple dynamic programming solution. Its running time is Θ(n) and its space requirement is Θ(n). Then, we continue by showing that it is possible to develop two parallel solutions based on optical bus system of n processors, o...