El Paso/Yslete schools Get-Away Special Space Shuttle student projects

Student projects for the Get Away Special (GAS) space shuttle program were summarized. Experimental topics included: seed germination, shrimp growth, liquid lasers, planaria regeneration, fluid dynamics (wicking), soil molds, antibiotics, crystallization, the symbiosis of yeast and fungi, and the performance of electronic chips. A brief experimental design is included for each project

Prophet Inequalities with Limited Information

In the classical prophet inequality, a gambler observes a sequence of stochastic rewards $V_1,...,V_n$ and must decide, for each reward $V_i$, whether to keep it and stop the game or to forfeit the reward forever and reveal the next value $V_i$. The gambler's goal is to obtain a constant fraction of the expected reward that the optimal offline algorithm would get. Recently, prophet inequalities have been generalized to settings where the gambler can choose $k$ items, and, more generally, where he can choose any independent set in a matroid. However, all the existing algorithms require the gambler to know the distribution from which the rewards $V_1,...,V_n$ are drawn. The assumption that the gambler knows the distribution from which $V_1,...,V_n$ are drawn is very strong. Instead, we work with the much simpler assumption that the gambler only knows a few samples from this distribution. We construct the first single-sample prophet inequalities for many settings of interest, whose guarantees all match the best possible asymptotically, \emph{even with full knowledge of the distribution}. Specifically, we provide a novel single-sample algorithm when the gambler can choose any $k$ elements whose analysis is based on random walks with limited correlation. In addition, we provide a black-box method for converting specific types of solutions to the related \emph{secretary problem} to single-sample prophet inequalities, and apply it to several existing algorithms. Finally, we provide a constant-sample prophet inequality for constant-degree bipartite matchings. We apply these results to design the first posted-price and multi-dimensional auction mechanisms with limited information in settings with asymmetric bidders

The effect of worry and rumination on cognitive abilities with considering role of mediating role of emotional intelligence

Background and aims: The cognitive abilities were included functions such as planning, attention, response inhibition, problem solving and cognitive flexibility. The aim of the present study was to investigate effects of worry and rumination on cognitive abilities based on emotional intelligence. Methods: The present study was a correlational and cross-sectional research. For this purpose, from the statistical population of the urmia University students, 340 were selected by multi-stage cluster random sampling. Then, the worry, rumination, emotional intelligence and cognitive abilities questionnaire were distributed among research participants to respond. Collected data were analyzed by using descriptive and correlational indicators, and structural equation modeling. Results: Results indicated that there is a significant negative correlation between worry and rumination and a positive correlation between emotional intelligence with cognitive abilities. Also, path analysis model indicated mediating role of emotional intelligence between worry and rumination with cognitive abilities. Conclusion: The results support the hypothesis that worry and rumination lead to disruption of cognitive abilities and high emotional intelligence can have a moderating role in this regard

Online Makespan Minimization with Parallel Schedules

In online makespan minimization a sequence of jobs $\sigma = J_1,..., J_n$ has to be scheduled on $m$ identical parallel machines so as to minimize the maximum completion time of any job. We investigate the problem with an essentially new model of resource augmentation. Here, an online algorithm is allowed to build several schedules in parallel while processing $\sigma$. At the end of the scheduling process the best schedule is selected. This model can be viewed as providing an online algorithm with extra space, which is invested to maintain multiple solutions. The setting is of particular interest in parallel processing environments where each processor can maintain a single or a small set of solutions. We develop a (4/3+\eps)-competitive algorithm, for any 0<\eps\leq 1, that uses a number of 1/\eps^{O(\log (1/\eps))} schedules. We also give a (1+\eps)-competitive algorithm, for any 0<\eps\leq 1, that builds a polynomial number of (m/\eps)^{O(\log (1/\eps) / \eps)} schedules. This value depends on $m$ but is independent of the input $\sigma$. The performance guarantees are nearly best possible. We show that any algorithm that achieves a competitiveness smaller than 4/3 must construct $\Omega(m)$ schedules. Our algorithms make use of novel guessing schemes that (1) predict the optimum makespan of a job sequence $\sigma$ to within a factor of 1+\eps and (2) guess the job processing times and their frequencies in $\sigma$. In (2) we have to sparsify the universe of all guesses so as to reduce the number of schedules to a constant. The competitive ratios achieved using parallel schedules are considerably smaller than those in the standard problem without resource augmentation

Added distance, entry mode choice, and the moderating effect of experience: The case of British MNEs in emerging markets

We argue that a Developed Market Multinational Enterprise’s (DMNE) decision regarding the mode of entry in an Emerging Market (EM) will be affected by the geographic and administrative distance between the locations in which the MNE has previously held operations. Drawing our arguments on the Transaction Costs Economics (TCE) and Internalization Theory we propose that for low and high geographic and administrative distance, DMNEs will opt to enter EMs via a wholly owned subsidiary (WOS), while for moderate levels of distance via a joint venture (JV). Furthermore, we argue that DMNE’s previous international experience in EMs will have a positive effect on the suggested U-shaped relationship, alleviating the negative effects associated with the coordination and knowledge dissipation costs incurred due to the level of distance. We test our hypotheses against a dataset composed of 316 entries of FTSE 250 British MNEs in 39 EMs over the period 1971 – 2010. The results provide support for the U-shaped relationship, and partial support for the moderating effect of international experience

SUSY dark matter and lepton flavor violation

We study lepton flavor-violating (LFV) processes within a supersymmetric type-I seesaw framework with flavor-blind universal boundary conditions, properly accounting for the effect of the neutrino sector on the dark matter relic abundance. We consider several possibilities for the neutrino Yukawa coupling matrix and show that in regions of SUSY parameter space that yield the correct neutralino relic density, LFV rates can differ from naive estimates by up to two orders of magnitude. Contrary to common belief, we find that current LFV limits do not exclude neutrino Yukawa couplings larger than top Yukawa couplings. We introduce the ISAJET-M program that was used for the computations.Comment: 37 pages, 9 figures, 6 tables. Version to appear in PR

A Supercooled Spin Liquid State in the Frustrated Pyrochlore Dy2Ti2O7

A "supercooled" liquid develops when a fluid does not crystallize upon cooling below its ordering temperature. Instead, the microscopic relaxation times diverge so rapidly that, upon further cooling, equilibration eventually becomes impossible and glass formation occurs. Classic supercooled liquids exhibit specific identifiers including microscopic relaxation times diverging on a Vogel-Tammann-Fulcher (VTF) trajectory, a Havriliak-Negami (HN) form for the dielectric function, and a general Kohlrausch-Williams-Watts (KWW) form for time-domain relaxation. Recently, the pyrochlore Dy2Ti2O7 has become of interest because its frustrated magnetic interactions may, in theory, lead to highly exotic magnetic fluids. However, its true magnetic state at low temperatures has proven very difficult to identify unambiguously. Here we introduce high-precision, boundary-free magnetization transport techniques based upon toroidal geometries and gain a fundamentally new understanding of the time- and frequency-dependent magnetization dynamics of Dy2Ti2O7. We demonstrate a virtually universal HN form for the magnetic susceptibility, a general KWW form for the real-time magnetic relaxation, and a divergence of the microscopic magnetic relaxation rates with precisely the VTF trajectory. Low temperature Dy2Ti2O7 therefore exhibits the characteristics of a supercooled magnetic liquid; the consequent implication is that this translationally invariant lattice of strongly correlated spins is evolving towards an unprecedented magnetic glass state, perhaps due to many-body localization of spin.Comment: Version 2 updates: added legend for data in Figures 4A and 4B; corrected equation reference in caption for Figure 4