نتایج جستجو برای: shabe 10011

تعداد نتایج: 62  

2014
Ron Cheung Rachel Meltzer

Homeowners associations (HOAs) have proliferated in recent decades as an important provider of local public services, particularly in fast growing states such as Florida. What explains their popularity, and specifically, their formation? We argue that the location and the timing of HOA formation are driven by demand-side, supply-side and institutional factors. Our data comes from the most compr...

Journal: :Trends in plant science 2004
Raoul J Bino Robert D Hall Oliver Fiehn Joachim Kopka Kazuki Saito John Draper Basil J Nikolau Pedro Mendes Ute Roessner-Tunali Michael H Beale Richard N Trethewey B Markus Lange Eve Syrkin Wurtele Lloyd W Sumner

Plant Physiology Department, Wageningen University, Arboretumlaan 4, 6703 BD Wageningen, The Netherlands Plant Research International B.V., POB 16, 6700 AA Wageningen, The Netherlands Centre for BioSystems Genomics, POB 98, 6700 AB Wageningen, The Netherlands Max-Planck Institute of Molecular Plant Physiology, 14424 Potsdam, Germany Graduate School of Pharmaceutical Sciences, Chiba University, ...

Journal: :Math. Comput. 2015
Amir Akbary Keilan Scholten

Abstract. We define an Artin prime for an integer g to be a prime such that g is a primitive root modulo that prime. Let g ∈ Z \ {−1} and not be a perfect square. A conjecture of Artin states that the set of Artin primes for g has a positive density. In this paper we study a generalization of this conjecture for the primes produced by a polynomial and explore its connection with the problem of ...

2017
Nick Gravin Yuval Peres Balasubramanian Sivan

We study the fundamental problem of prediction with expert advice and develop regret lower bounds for a large family of algorithms for this problem. We develop simple adversarial primitives, that lend themselves to various combinations leading to sharp lower bounds for many algorithmic families. We use these primitives to show that the classic Multiplicative Weights Algorithm (MWA) has a regret...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 2000
T Loerting K R Liedl

The hydration rate constant of sulfur trioxide to sulfuric acid is shown to depend sensitively on water vapor pressure. In the 1:1 SO3-H2O complex, the rate is predicted to be slower by about 25 orders of magnitude compared with laboratory results [Lovejoy, E. R., Hanson, D. R. & Huey, L. G. (1996) J. Phys. Chem. 100, 19911-19916; Jayne, J. T., Poschl, U., Chen, Y.-m., Dai, D., Molina, L. T., W...

2013
Alina Ene Nitish Korula Ali Vakilian

A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. A dominating set is connected if the subgraph induced by its vertices is connected. The connected domatic partition problem asks for a partition of the nodes into connected dominating sets. The connected domatic number of a graph is the size of a largest connected domatic partition and it...

2010
Nicholas Morsillo Gideon S. Mann Christopher Joseph Pal

As video content on the web continues to expand, it is increasingly important to properly annotate videos for effective search and mining. While the idea of annotating static imagery with keywords is relatively well known, the idea of annotating videos with natural language keywords to enhance search is an important emerging problem with great potential to improve the quality of video search. H...

2016
Ting-Wen Chang Jeffrey Kurcz Moushir M. El-Bishouty

Working memory capacity (WMC) is a cognitive characteristic that affects students’ learning behaviors to perform complex cognitive tasks. However, WMC is very limited and can be easily overloaded in learning activities. Considering students’WMC through personalized learning materials and activities helps in avoiding cognitive overload and therefore positively affects students’ learning. However...

2009
Nitish Korula Martin Pál

We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L,R. We develop an 8-competitive algorithm for the following secretary problem: Initially given R, and the size of L, the algorithm receives the vertices of L sequentially, in a random order. When a vertex l ∈ L is seen, all e...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید