Accurate real-time forecasts of inundation depth and extent during typhoon flooding are crucial to disaster emergency response. To manage disaster risk, the development of a flood inundation forecasting model has been recognized as essential. In this paper, a forecasting model by integrating a hydrodynamic model, k-means clustering algorithm and support vector machines (SVM) is proposed. The task of this study is divided into four parts. First, the SOBEK model is used in simulating inundation hydrodynamics. Second, the k-means clustering algorithm classifies flood inundation data and identifies the dominant clusters of flood gauging stations. Third, SVM yields water level forecasts with 1–3 h lead time. Finally, a spatial expansion module produces flood inundation maps, based on forecasted information from flood gauging stations and consideration of flood causative factors. To demonstrate the effectiveness of the proposed forecasting model, we present an application to the Yilan River basin, Taiwan. The forecasting results indicate that the simulated water level forecasts from the point forecasting module are in good agreement with the observed data, and the proposed model yields the accurate flood inundation maps for 1–3 h lead time. These results indicate that the proposed model accurately forecasts not only flood inundation depth but also inundation extent. This flood inundation forecasting model is expected to be useful in providing early flood warning information for disaster emergency response.

Summary: CNVDetector is a program for locating copy number variations (CNVs) in a single genome. CNVDetector has several merits: (i) it can deal with the array comparative genomic hybridization data even if the noise is not normally distributed; (ii) it has a linear time kernel; (iii) its parameters can be easily selected; (iv) it evaluates the statistical significance for each CNV calling. Availability: CNVDetector (for Windows platform) can be downloaded from

In 2011, Meunier conjectured that for positive integers n, k, r, s with k ≥ 2, r ≥ 2, and n ≥ max({r, s})k, the chromatic number of sstable r-uniform Kneser hypergraphs is equal to n−max({r,s})(k−1) r−1 . It is a strengthened version of the conjecture proposed by Ziegler (2002), andAlon, Drewnowski andLuczak (2009). The problem about the chromatic number of almost s-stable r-uniform Kneser hypergraphs has also been introduced by Meunier (2011).For the r = 2 case of the Meunier conjecture, Jonsson (2012) provided a purely combinatorial proof to confirm the conjecture for s ≥ 4 and n sufficiently large, and by Chen (2015) for even s and any n. The case s = 3 is completely open, even the chromatic number of the usual almost s-stable Kneser graphs.In this paper, we obtain a topological lower bound for the chromatic number of almost s-stable r-uniform Kneser hypergraphs via a different approach. For the case r = 2, we conclude that the chromatic number of almost s-stable Kneser graphs is equal to n − s(k − 1) for all s ≥ 2. Set t = n − s(k − 1). We show that any proper coloring of an almost s-stable Kneser graph must contain a completely multicolored complete bipartite subgraph K ⌈ t 2 ⌉⌊ t 2 ⌋ . It follows that the local chromatic number of almost s-stable Kneser graphs is at least t 2 + 1. It is a strengthened result of Simonyi and Tardos (2007), and Meunier's (2014) lower bound for almost s-stable Kneser graphs.

No abstract

In defining a bargaining set, it is desirable to require that a counterobjecting coalition has a non-empty intersection with the objecting coalition. We refer to this as the intersection property and define a bargaining set, MB 1 , that imposes this property on a variant of the bargaining set defined by Vohra (1991). To study the existence of MB 1 , a new version of the KKM theorem is proposed and the concept of a subbalanced game is introduced. We also provide conditions for the non-emptiness of MB 2 , a bargaining set introduced by Zhou (1994) which imposes the additional restriction that the objecting coalition not be a subset of the counterobjecting coalition. Copyright Springer-Verlag Berlin/Heidelberg 2006NTU games, Bargaining set, Subbalancedness, KKM theorem.,