Non-exponential photoluminescence decay dynamics of localized carriers in disordered InGaN/GaN quantum wells: the role of localization length

In this article, we report a combined experimental and theoretical study on the luminescence dynamics of localized carriers in disordered InGaN/GaN quantum wells. The luminescence intensity of localized carriers is found to exhibit an unusual non-exponential decay. Adopting a new model taking the radiative recombination and phonon-assisted hopping transition between different localized states into account, which was recently developed by Rubel et al., the non-exponential decay behavior of the carriers can be quantitatively interpreted. Combining with precise structure characterization, the theoretical simulations show that the localization length of localized carriers is a key parameter governing their luminescence decay dynamics. (c) 2006 Optical Society of America.

incomplete exponential sums over galois rings with applications to some binary sequences derived from z(2l)

IEEE Computer Society

Hybrid numerical methods for exponential models of growth

A series of novel numerical methods for the exponential models of growth are proposed. Based on these methods, hybrid predictor-corrector methods are constructed. The hybrid numerical methods can increase the accuracy and the computing speed obviously, as well as enlarge the stability domain greatly. (c) 2005 Published by Elsevier Inc.

Roles of sorting and chemical weathering in the geochemistry and magnetic susceptibility of Xiashu loess；East China

IEECAS SKLLQG

Effects of the initial size, stocking density and sorting on the growth of juvenile Pacific abalone, Haliotis discus hannai Ino

During winter months, a novel overwintering mode of transferring juvenile abalones to open seawaters in southern China rather than keeping them in closed land-based nursery systems in northern China is a popular practice. The initial size, stocking density and sorting are among the first considerations when establishing an abalone culture system. This study aimed to investigate the effects of these factors on the growth of juvenile Pacific abalone, Haliotis discus hannai Ino, during overwintering. Juvenile abalones were reared in multi-tier basket form for overwintering in open seawaters in southern China for 106 days. The daily growth rates (DGRs) in the shell length of all experimental groups ranged from 67.08 to 135.75 mu m day(-1), while the specific growth rates (SGRs) were 0.2447-0.3259% day(-1). Variance analysis indicated that both DGRs and SGRs in shell length were significantly affected by the initial body size and stocking density. Furthermore, the effects of stocking density on DGRs and SGRs varied with the initial size. However, sorting abalones according to their initial sizes may not be necessary in practice as sorting did not alter growth significantly at all densities in this study. Factors potentially affecting abalone growth such as genetic control and intraspecific competition were discussed.

Exponential sensitivity of noise-driven switching in genetic networks

Cells are known to utilize biochemical noise to probabilistically switch between distinct gene expression states. We demonstrate that such noise-driven switching is dominated by tails of probability distributions and is therefore exponentially sensitive to changes in physiological parameters such as transcription and translation rates. However, provided mRNA lifetimes are short, switching can still be accurately simulated using protein-only models of gene expression. Exponential sensitivity limits the robustness of noise-driven switching, suggesting cells may use other mechanisms in order to switch reliably.

Sorting under partial information (without the ellipsoid algorithm)

We revisit the well-known problem of sorting under partial information: sort a finite set given the outcomes of comparisons between some pairs of elements. The input is a partially ordered set P, and solving the problem amounts to discovering an unknown linear extension of P, using pairwise comparisons. The information-theoretic lower bound on the number of comparisons needed in the worst case is log e(P), the binary logarithm of the number of linear extensions of P. In a breakthrough paper, Jeff Kahn and Jeong Han Kim (STOC 1992) showed that there exists a polynomial-time algorithm for the problem achieving this bound up to a constant factor. Their algorithm invokes the ellipsoid algorithm at each iteration for determining the next comparison, making it impractical. We develop efficient algorithms for sorting under partial information. Like Kahn and Kim, our approach relies on graph entropy. However, our algorithms differ in essential ways from theirs. Rather than resorting to convex programming for computing the entropy, we approximate the entropy, or make sure it is computed only once in a restricted class of graphs, permitting the use of a simpler algorithm. Specifically, we present: an O(n2) algorithm performing O(log n·log e(P)) comparisons; an O(n2.5) algorithm performing at most (1+ε) log e(P) + Oε(n) comparisons; an O(n2.5) algorithm performing O(log e(P)) comparisons. All our algorithms are simple to implement. © 2010 ACM.

Estimating equilibrium models of sorting across locations

While there is growing interest in measuring the size and scope of local spillovers, it is well understood that such spillovers cannot be distinguished from unobservable local attributes using solely the observed location decisions of individuals or firms. We propose an empirical strategy for recovering estimates of spillovers in the presence of unobserved local attributes for a broadly applicable class of equilibrium sorting models. Our approach relies on an IV strategy derived from the internal logic of the sorting model itself. We show practically how the strategy is implemented, provide intuition for our instruments, discuss the role of effective choice-set variation in identifying the model, and carry-out a series of Monte Carlo simulations to demonstrate performance in small samples. © 2007 The Author(s). Journal compilation Royal Economic Society 2007.

Matching and sorting in online dating

Using data on user attributes and interactions from an online dating site, we estimate mate preferences, and use the Gale-Shapley algorithm to predict stable matches. The predicted matches are similar to the actual matches achieved by the dating site, and the actual matches are approximately efficient. Out-of-sample predictions of offline matches, i.e., marriages, exhibit assortative mating patterns similar to those observed in actual marriages. Thus, mate preferences, without resort to search frictions, can generate sorting in marriages. However, we underpredict some of the correlation patterns; search frictions may play a role in explaining the discrepancy.

ARFGAP1 plays a central role in coupling COPI cargo sorting with vesicle formation.

Examining how key components of coat protein I (COPI) transport participate in cargo sorting, we find that, instead of ADP ribosylation factor 1 (ARF1), its GTPase-activating protein (GAP) plays a direct role in promoting the binding of cargo proteins by coatomer (the core COPI complex). Activated ARF1 binds selectively to SNARE cargo proteins, with this binding likely to represent at least a mechanism by which activated ARF1 is stabilized on Golgi membrane to propagate its effector functions. We also find that the GAP catalytic activity plays a critical role in the formation of COPI vesicles from Golgi membrane, in contrast to the prevailing view that this activity antagonizes vesicle formation. Together, these findings indicate that GAP plays a central role in coupling cargo sorting and vesicle formation, with implications for simplifying models to describe how these two processes are coupled during COPI transport.