Sciweavers

EOR
2016
54views more  EOR 2016»
10 years 1 months ago
Customer-base analysis using repeated cross-sectional summary (RCSS) data
Kinshuk Jerath, Peter S. Fader, Bruce G. S. Hardie
ENVSOFT
2016
39views more  ENVSOFT 2016»
10 years 1 months ago
New formulation and optimization methods for water sensor placement
Optimal sensor placement for detecting contamination events in water distribution systems is a well explored problem in water distribution systems security. We study herein the pr...
Yue Zhao, Rafi Schwartz, Elad Salomons, Avi Ostfel...
ENVSOFT
2016
44views more  ENVSOFT 2016»
10 years 1 months ago
Paradigm shift to enhanced water supply planning through augmented grids, scarcity pricing and adaptive factory water: A system
: This paper details a system dynamics model developed to simulate proposed changes to water governance through the integration of supply, demand and asset management processes. To...
Oz Sahin, Raymond S. Siems, Rodney A. Stewart, Mic...
EM
2016
85views Management» more  EM 2016»
10 years 1 months ago
Evidence for the Dynamical Brauer-Manin Criterion
Let ϕ: X → X be a morphism of a variety over a number field K. We consider local conditions and a “Brauer-Manin” condition, defined by Hsia and Silverman, for the orbit of...
Ekaterina Amerik, Pär Kurlberg, Khoa D. Nguye...
EM
2016
82views Management» more  EM 2016»
10 years 1 months ago
How to Repair Tropicalizations of Plane Curves Using Modifications
Tropical geometry is sensitive to embeddings of algebraic varieties inside toric varieties. The purpose of this paper is to advertise tropical modifications as a tool to locally r...
María Angélica Cueto, Hannah Markwig
EM
2016
85views Management» more  EM 2016»
10 years 1 months ago
On Generalized Schur Numbers
Let L(t) represent the equation x1 + x2 + · · · + xt−1 = xt. For k 1, 0 i k − 1, and ti 3, the generalized Schur number S(k; t0, t1, . . . , tk−1) is the least positive i...
Tanbir Ahmed, Daniel Schaal
EJC
2016
10 years 1 months ago
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
Let C(n) denote the maximum number of induced copies of C5 in graphs on n vertices. For n large enough, we show that C(n) = a · b · c · d · e + C(a) + C(b) + C(c) + C(d) + C(e...
József Balogh, Ping Hu, Bernard Lidick&yacu...