The COllaborative project of Development of Anthropometrical measures in Twins (CODATwins) project is a large international collaborative effort to analyze individual-level phenotype data from twins in multiple cohorts from different environments. The main objective is to study factors that modify genetic and environmental variation of height, body mass index (BMI, kg/m2) and size at birth, and additionally to address other research questions such as long-term consequences of birth size. The project started in 2013 and is open to all twin projects in the world having height and weight measures on twins with information on zygosity. Thus far, 54 twin projects from 24 countries have provided individual-level data. The CODATwins database includes 489,981 twin individuals (228,635 complete twin pairs). Since many twin cohorts have collected longitudinal data, there is a total of 1,049,785 height and weight observations. For many cohorts, we also have information on birth weight and length, own smoking behavior and own or parental education. We found that the heritability estimates of height and BMI systematically changed from infancy to old age. Remarkably, only minor differences in the heritability estimates were found across cultural–geographic regions, measurement time and birth cohort for height and BMI. In addition to genetic epidemiological studies, we looked at associations of height and BMI with education, birth weight and smoking status. Within-family analyses examined differences within same-sex and opposite-sex dizygotic twins in birth size and later development. The CODATwins project demonstrates the feasibility and value of international collaboration to address gene-by-exposure interactions that require large sample sizes and address the effects of different exposures across time, geographical regions and socioeconomic status.

Whether monozygotic (MZ) and dizygotic (DZ) twins differ from each other in a variety of phenotypes is important for genetic twin modeling and for inferences made from twin studies in general. We analyzed whether there were differences in individual, maternal and paternal education between MZ and DZ twins in a large pooled dataset. Information was gathered on individual education for 218,362 adult twins from 27 twin cohorts (53% females; 39% MZ twins), and on maternal and paternal education for 147,315 and 143,056 twins respectively, from 28 twin cohorts (52% females; 38% MZ twins). Together, we had information on individual or parental education from 42 twin cohorts representing 19 countries. The original education classifications were transformed to education years and analyzed using linear regression models. Overall, MZ males had 0.26 (95% CI [0.21, 0.31]) years and MZ females 0.17 (95% CI [0.12, 0.21]) years longer education than DZ twins. The zygosity difference became smaller in more recent birth cohorts for both males and females. Parental education was somewhat longer for fathers of DZ twins in cohorts born in 1990–1999 (0.16 years, 95% CI [0.08, 0.25]) and 2000 or later (0.11 years, 95% CI [0.00, 0.22]), compared with fathers of MZ twins. The results show that the years of both individual and parental education are largely similar in MZ and DZ twins. We suggest that the socio-economic differences between MZ and DZ twins are so small that inferences based upon genetic modeling of twin data are not affected.

We analyzed birth order differences in means and variances of height and body mass index (BMI) in monozygotic (MZ) and dizygotic (DZ) twins from infancy to old age. The data were derived from the international CODATwins database. The total number of height and BMI measures from 0.5 to 79.5 years of age was 397,466. As expected, first-born twins had greater birth weight than second-born twins. With respect to height, first-born twins were slightly taller than second-born twins in childhood. After adjusting the results for birth weight, the birth order differences decreased and were no longer statistically significant. First-born twins had greater BMI than the second-born twins over childhood and adolescence. After adjusting the results for birth weight, birth order was still associated with BMI until 12 years of age. No interaction effect between birth order and zygosity was found. Only limited evidence was found that birth order influenced variances of height or BMI. The results were similar among boys and girls and also in MZ and DZ twins. Overall, the differences in height and BMI between first- and second-born twins were modest even in early childhood, while adjustment for birth weight reduced the birth order differences but did not remove them for BMI.

A trend toward greater body size in dizygotic (DZ) than in monozygotic (MZ) twins has been suggested by some but not all studies, and this difference may also vary by age. We analyzed zygosity differences in mean values and variances of height and body mass index (BMI) among male and female twins from infancy to old age. Data were derived from an international database of 54 twin cohorts participating in the COllaborative project of Development of Anthropometrical measures in Twins (CODATwins), and included 842,951 height and BMI measurements from twins aged 1 to 102 years. The results showed that DZ twins were consistently taller than MZ twins, with differences of up to 2.0 cm in childhood and adolescence and up to 0.9 cm in adulthood. Similarly, a greater mean BMI of up to 0.3 kg/m2 in childhood and adolescence and up to 0.2 kg/m2 in adulthood was observed in DZ twins, although the pattern was less consistent. DZ twins presented up to 1.7% greater height and 1.9% greater BMI than MZ twins; these percentage differences were largest in middle and late childhood and decreased with age in both sexes. The variance of height was similar in MZ and DZ twins at most ages. In contrast, the variance of BMI was significantly higher in DZ than in MZ twins, particularly in childhood. In conclusion, DZ twins were generally taller and had greater BMI than MZ twins, but the differences decreased with age in both sexes.

Retransmission-based failure recovery represents a primary approach in existing communication networks that guarantees data delivery in the presence of channel failures. Recent work has shown that, when data sizes have infinite support, retransmissions can cause long (-tailed) delays even if all traffic and network characteristics are light-tailed. In this paper we investigate the practically important case of bounded data units 0 ≤ Lb ≤ b under the condition that the hazard functions of the distributions of data sizes and channel statistics are proportional. To this end, we provide an explicit and uniform characterization of the entire body of the retransmission distribution ℙ[Nb > n] in both n and b. Our main discovery is that this distribution can be represented as the product of a power law and gamma distribution. This rigorous approximation clearly demonstrates the coupling of a power law distribution, dominating the main body, and the gamma distribution, determining the exponential tail. Our results are validated via simulation experiments and can be useful for designing retransmission-based systems with the required performance characteristics. From a broader perspective, this study applies to any other system, e.g. computing, where restart mechanisms are employed after a job processing failure.

For over 100 years, the genetics of human anthropometric traits has attracted scientific interest. In particular, height and body mass index (BMI, calculated as kg/m2) have been under intensive genetic research. However, it is still largely unknown whether and how heritability estimates vary between human populations. Opportunities to address this question have increased recently because of the establishment of many new twin cohorts and the increasing accumulation of data in established twin cohorts. We started a new research project to analyze systematically (1) the variation of heritability estimates of height, BMI and their trajectories over the life course between birth cohorts, ethnicities and countries, and (2) to study the effects of birth-related factors, education and smoking on these anthropometric traits and whether these effects vary between twin cohorts. We identified 67 twin projects, including both monozygotic (MZ) and dizygotic (DZ) twins, using various sources. We asked for individual level data on height and weight including repeated measurements, birth related traits, background variables, education and smoking. By the end of 2014, 48 projects participated. Together, we have 893,458 height and weight measures (52% females) from 434,723 twin individuals, including 201,192 complete twin pairs (40% monozygotic, 40% same-sex dizygotic and 20% opposite-sex dizygotic) representing 22 countries. This project demonstrates that large-scale international twin studies are feasible and can promote the use of existing data for novel research purposes.

In this work we reported low and high repetition frequency femtosecond laser-induced modifications of tungsten-based thin film. The tungsten-titanium (WTi) thin film, thickness of 190 nm, was deposited by sputtering on single crystal Si (100) wafer. Irradiations were performed in air by linearly polarized and focused femtosecond laser beams with following parameters: (1) pulse duration 160 fs, wavelength 800 nm, laser repetition frequency (LRF) 75 MHz — high LRF, and (2) duration 40 fs, wavelength 800 nm, LRF of 1 kHz — low LRF. The results of femtosecond lasers processing of the WTi thin film revealed laser induced periodical surface structures (LIPSS) in the case of low LRF regime. LIPSSs were formed with different periodicity and different orientation to the laser polarization at the surface: micro-scale LIPSSs with orientation perpendicular to the laser polarization and nano-scale LIPSSs parallel and perpendicular to the laser polarization. After processing of the WTi/Si system in high LRF regime ablation and nano-particles formation were registered.

We consider possibly nonlinear distributional fixed-point equations on weighted branching trees, which include the well-known linear branching recursion. In Jelenković and Olvera-Cravioto (2012), an implicit renewal theorem was developed that enables the characterization of the power-tail asymptotics of the solutions to many equations that fall into this category. In this paper we complement the analysis in our 2012 paper to provide the corresponding rate of convergence.

Consider a generic data unit of random size L that needs to be transmitted over a channel of unit capacity. The channel availability dynamic is modeled as an independent and identically distributed sequence {A, Ai}i≥1 that is independent of L. During each period of time that the channel becomes available, say Ai, we attempt to transmit the data unit. If L <Ai, the transmission is considered successful; otherwise, we wait for the next available period Ai+1 and attempt to retransmit the data from the beginning. We investigate the asymptotic properties of the number of retransmissions N and the total transmission time T until the data is successfully transmitted. In the context of studying the completion times in systems with failures where jobs restart from the beginning, it was first recognized by Fiorini, Sheahan and Lipsky (2005) and Sheahan, Lipsky, Fiorini and Asmussen (2006) that this model results in power-law and, in general, heavy-tailed delays. The main objective of this paper is to uncover the detailed structure of this class of heavy-tailed distributions induced by retransmissions. More precisely, we study how the functional relationship ℙ[L>x]-1 ≈ Φ (ℙ[A>x]-1) impacts the distributions of N and T; the approximation ‘≈’ will be appropriately defined in the paper based on the context. Depending on the growth rate of Φ(·), we discover several criticality points that separate classes of different functional behaviors of the distribution of N. For example, we show that if log(Φ(n)) is slowly varying then log(1/ℙ[N>n]) is essentially slowly varying as well. Interestingly, if log(Φ(n)) grows slower than e√(logn) then we have the asymptotic equivalence log(ℙ[N>n]) ≈ - log(Φ(n)). However, if log(Φ(n)) grows faster than e√(logn), this asymptotic equivalence does not hold and admits a different functional form. Similarly, different types of distributional behavior are shown for moderately heavy tails (Weibull distributions) where log(ℙ[N>n]) ≈ -(log Φ(n))1/(β+1), assuming that log Φ(n) ≈ nβ, as well as the nearly exponential ones of the form log(ℙ[N>n]) ≈ -n/(log n)1/γ, γ>0, when Φ(·) grows faster than two exponential scales log log (Φ(n)) ≈ nγ.

We extend Goldie's (1991) implicit renewal theorem to enable the analysis of recursions on weighted branching trees. We illustrate the developed method by deriving the power-tail asymptotics of the distributions of the solutions R to and similar recursions, where (Q, N, C1, C2,…) is a nonnegative random vector with N ∈ {0, 1, 2, 3,…} ∪ {∞}, and are independent and identically distributed copies of R, independent of (Q, N, C1, C2,…); here ‘∨’ denotes the maximum operator.

In this paper we consider the stochastic analysis of information ranking algorithms of large interconnected data sets, e.g. Google's PageRank algorithm for ranking pages on the World Wide Web. The stochastic formulation of the problem results in an equation of the form where N, Q, {Ri}i≥1, and {C, Ci}i≥1 are independent nonnegative random variables, the {C, Ci}i≥1 are identically distributed, and the {Ri}i≥1 are independent copies of stands for equality in distribution. We study the asymptotic properties of the distribution of R that, in the context of PageRank, represents the frequencies of highly ranked pages. The preceding equation is interesting in its own right since it belongs to a more general class of weighted branching processes that have been found to be useful in the analysis of many other algorithms. Our first main result shows that if ENE[Cα] = 1, α > 0, and Q, N satisfy additional moment conditions, then R has a power law distribution of index α. This result is obtained using a new approach based on an extension of Goldie's (1991) implicit renewal theorem. Furthermore, when N is regularly varying of index α > 1, ENE[Cα] < 1, and Q, C have higher moments than α, then the distributions of R and N are tail equivalent. The latter result is derived via a novel sample path large deviation method for recursive random sums. Similarly, we characterize the situation when the distribution of R is determined by the tail of Q. The preceding approaches may be of independent interest, as they can be used for analyzing other functionals on trees. We also briefly discuss the engineering implications of our results.

The interaction of Ti:sapphire laser, operating at high repetition rate of 75 MHz, with nickel-based super-alloy Inconel 600 was studied. The laser was emitting at 800 nm and ultrashort pulse duration was 160 fs. Nickel-based super-alloy surface modification was studied in a low laser energy/fluence regime of maximum 20 nJ–15 mJ/cm2, for short (10 s) and long irradiation times (range of minutes). Surface damage threshold of this material was estimated to be 1.46 nJ, i.e., 0.001 J/cm2 in air. The radiation absorbed from Ti:sapphire laser beam under these conditions generates at the surface a series of effects, such as direct material vaporization, plasma creation, formation of nano-structures and their larger aggregates, damage accumulation, etc. Laser induced surface morphological changes observed on Inconel 600 were: (1) intensive removal of surface material with crater like features; (2) material deposition at near and farther periphery and creation of nano-aggregates/nano-structures; (3) sporadic micro-cracking of the inner and outer damage area. Generally, features created on nickel-based super-alloy surface by high repetition rate femtosecond pulses are characterized by low inner/outer damage diameter of less than 11 µm/30 µm and relatively large depth on the order of 150 µm, in both low (10 s) and high (minutes) irradiation time regimes.

It was recently proved by Jelenković and Radovanović (2004) that the least-recently-used (LRU) caching policy, in the presence of semi-Markov-modulated requests that have a generalized Zipf's law popularity distribution, is asymptotically insensitive to the correlation in the request process. However, since the previous result is asymptotic, it remains unclear how small the cache size can become while still retaining the preceding insensitivity property. In this paper, assuming that requests are generated by a nearly completely decomposable Markov-modulated process, we characterize the critical cache size below which the dependency of requests dominates the cache performance. This critical cache size is small relative to the dynamics of the modulating process, and in fact is sublinear with respect to the sojourn times of the modulated chain that determines the dependence structure.

We analyse a class of randomized Least Recently Used (LRU) cache replacement algorithms under the independent reference model with generalized Zipf's law request probabilities. The randomization was recently proposed for Web caching as a mechanism that discriminates between different document sizes. In particular, the cache maintains an ordered list of documents in the following way. When a document of size $s$ is requested and found in the cache, then with probability $p_s$ it is moved to the front of the cache; otherwise the cache stays unchanged. Similarly, if the requested document of size $s$ is not found in the cache, the algorithm places it with probability $p_s$ to the front of the cache or leaves the cache unchanged with the complementary probability $(1-p_s)$. The successive randomized decisions are independent and the corresponding success probabilities $p_s$ are completely determined by the size of the currently requested document. In the case of a replacement, the necessary number of documents that are least recently moved to the front of the cache are removed in order to accommodate the newly placed document.

In this framework, we provide explicit asymptotic characterization of the cache fault probability. Using the derived result we prove that the asymptotic performance of this class of algorithms is optimized when the randomization probabilities are chosen to be inversely proportional to document sizes. In addition, for this optimized and easy-to-implement policy, we show that its performance is within a constant factor from the optimal static algorithm.

For a given k ≥ 1, subintervals of a given interval [0, X] arrive at random and are accepted (allocated) so long as they overlap fewer than k subintervals already accepted. Subintervals not accepted are cleared, while accepted subintervals remain allocated for random retention times before they are released and made available to subsequent arrivals. Thus, the system operates as a generalized many-server queue under a loss protocol. We study a discretized version of this model that appears in reference theories for a number of applications, including communication networks, surface adsorption-desorption processes, and reservation systems. Our primary interest is in steady-state estimates of the vacant space, i.e. the total length of available subintervals kX - ∑ℓ i , where the ℓ i are the lengths of the subintervals currently allocated. We obtain explicit results for k = 1 and for general k with all subinterval lengths equal to 2, the classical dimer case of chemical applications. Our focus is on the asymptotic regime of large retention times.

Consider an aggregate arrival process AN obtained by multiplexing N on-off processes with exponential off periods of rate λ and subexponential on periods τon. As N goes to infinity, with λN → Λ, AN approaches an M/G/∞ type process. Both for finite and infinite N, we obtain the asymptotic characterization of the arrival process activity period.

Using these results we investigate a fluid queue with the limiting M/G/∞ arrival process At∞ and capacity c. When on periods are regularly varying (with non-integer exponent), we derive a precise asymptotic behavior of the queue length random variable QtP observed at the beginning of the arrival process activity periods

where ρ = 𝔼At∞ < c; r (c ≤ r) is the rate at which the fluid is arriving during an on period. The asymptotic (time average) queue distribution lower bound is obtained under more general assumptions regarding on periods than regular variation.

In addition, we analyse a queueing system in which one on-off process, whose on period belongs to a subclass of subexponential distributions, is multiplexed with independent exponential processes with aggregate expected rate 𝔼et. This system is shown to be asymptotically equivalent to the same queueing system with the exponential arrival processes being replaced by their total mean value 𝔼et.

Let {(Xn,Jn)} be a stationary Markov-modulated random walk on ℝ x E (E is finite), defined by its probability transition matrix measure F = {Fij}, Fij(B) = ℙ[X1 ∈ B, J1 = j | J0 = i], B ∈ B(ℝ), i, j ∈ E. If Fij([x,∞))/(1-H(x)) → Wij ∈ [0,∞), as x → ∞, for some long-tailed distribution function H, then the ascending ladder heights matrix distribution G+(x) (right Wiener-Hopf factor) has long-tailed asymptotics. If 𝔼Xn < 0, at least one Wij > 0, and H(x) is a subexponential distribution function, then the asymptotic behavior of the supremum of this random walk is the same as in the i.i.d. case, and it is given by ℙ[supn≥0Sn > x] → (−𝔼Xn)−1 ∫x∞ ℙ[Xn > u]du as x → ∞, where Sn = ∑1nXk, S0 = 0. Two general queueing applications of this result are given.

First, if the same asymptotic conditions are imposed on a Markov-modulated G/G/1 queue, then the waiting time distribution has the same asymptotics as the waiting time distribution of a GI/GI/1 queue, i.e., it is given by the integrated tail of the service time distribution function divided by the negative drift of the queue increment process. Second, the autocorrelation function of a class of processes constructed by embedding a Markov chain into a subexponential renewal process, has a subexponential tail. When a fluid flow queue is fed by these processes, the queue-length distribution is asymptotically proportional to its autocorrelation function.