The trace reconstruction problem is to reconstruct a string x of length n given m random subsequences where each subsequence is generated by deleting each character of x independently with probability p. Two natural questions are a) how large must m be as a function of n and p such that reconstruction is possible with high probability and b) how can this reconstruction be performed efficiently....

this study was conducted to compare the yield and strength properties of soda and kraft pulp produced from populus deltoeides sapwood and heartwood. initially fiber length, lignin content in both sapwood and heartwood were measured. then from either sapwood or heartwood pulps were prepared with using soda and kraft processes, handsheets were made from this pulp and mechanical properties were me...

we propose a method of estimation of the derivatives of probability density based on wavelets methods for a sequence of random variables with a common one-dimensional probability density function and obtain an upper bound on lp-losses for such estimators. we suppose that the process is strongly mixing and we show that the rate of convergence essentially depends on the behavior of a special quad...

We propose a method of estimation of the derivatives of probability density based on wavelets methods for a sequence of random variables with a common one-dimensional probability density function and obtain an upper bound on Lp-losses for such estimators. We suppose that the process is strongly mixing and we show that the rate of convergence essentially depends on the behavior of a special quad...

We use a two-dimensional deformable mirror to shape the spatial profile of an ultrafast laser beam that is then used to inscribe structures in a soda-lime silica glass slide. By doing so we demonstrate that it is possible to control the asymmetry of the cross section of ultrafast laser inscribed optical waveguides via the curvature of the deformable mirror. When tested using 1.55 mum light, the...

We investigate coordination mechanisms that schedule n jobs on m unrelated machines. The objective is to minimize the latest completion of all jobs, i.e., the makespan. It is known that if the mechanism is non-preemptive, the price of anarchy is Ω(logm). Both Azar, Jain, and Mirrokni (SODA 2008) and Caragiannis (SODA 2009) raised the question whether it is possible to design a coordination mech...

OBJECTIVE This study aimed to compare diet soda drinkers, regular soda drinkers, and individuals who do not regularly consume soda on clinically significant eating disorder psychopathology, including binge eating, overeating, and purging. METHOD Participants (n=2077) were adult community volunteers who completed an online survey that included the Eating Disorder Examination Questionnaire and ...

We develop a new technique for constructing sparse graphs that allow us to prove nearlinear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an Ω̃(n) lower bound for computing the diameter in sparse networks, which was previously known only for dense networks [Frishknecht et al., SODA 2012]. In fact, we can even modify our construction to ob...

Tropical soda apple (Solanum viarum Dunal) is a solanaceous weed, armed with prickles on stems, leaves, petioles, and calyxes. It is native to Argentina, Brazil, Paraguay, and Uruguay (26) and was introduced in the 1980s into Florida, where it thrives as a perennial, particularly in the southern part of the state (11). It has spread rapidly throughout Florida, now occurring on more than 405,000...

At SODA’93, Chazelle and Matoušek presented a derandomization of Clarkson’s sampling-based algorithm [FOCS’88] for solving linear programs with n constraints and d variables in dn deterministic time. The time bound can be improved to dn with subsequent work by Brönnimann, Chazelle, and Matoušek [FOCS’93]. We first point out a much simpler derandomization of Clarkson’s algorithm that avoids ε-ap...