Data mining technology is applied to extract the water supply operation rules in this study. Five characteristic attributes—reservoir storage water, operation period number, water demand, runoff, and hydrological year—are chosen as the dataset, and these characteristic attributes are applied to build a mapping relation with the optimal operation mode calculated by dynamic programming (DP). A Le...

‎let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and‎ ‎$e_{n,m}$ be the graph obtained from a path‎ ‎$p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of‎ ‎$k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$‎, ‎and by‎ ‎joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$‎ ‎to $v_{d_{n,m}-2}$‎. ‎zhang‎, ‎liu and zhou [on the maximal eccentric‎ ‎connectivity ind...

objective: metal concentrations in 53 soil samples of shahr-e-babak were determined.  methods: assessment of enrichment factor and geo-accumulation index revealed higher degree of contamination of cd, pb, and cu in soil samples. moreover, results of metal fractionation study revealed high amount of cd and pb are associated in weakly bounds may lead to environmental risk of these metals.  result...

conclusions our study showed that arm is a useful approach in determining which combinations of variables or predictors occur together frequently, in people who will develop diabetes. the arm focuses on joint exposure to different combinations of risk factors, and not the predictors alone. background type 2 diabetes, common and serious global health concern, had an estimated worldwide prevalenc...

The K-Nearest Neighbor (KNN) join is an expensive but important operation in many data mining algorithms. Several recent applications need to perform KNN join for high dimensional sparse data. Unfortunately, all existing KNN join algorithms are designed for low dimensional data. To fulfill this void, we investigate the KNN join problem for high dimensional sparse data. In this paper, we propose...

in this paper, some applications of our earlier results in working with chemical graphs arepresented.

Temporal databases added a new dimension to traditional transaction databases. This dimension is the life time of each item, i.e. exhibition period, starting from the partition when this item appears in the transaction database to the partition when this item no longer exists. Mining temporal association rules became very interesting topic in many applications nowadays. In this paper, an effici...

There are some large scale orebodies that extend from surface to the extreme depths of the ground. Such orebodies should be extracted by a combination of surface and underground mining methods. Economically, it is highly important to know the limit of upper and lower mining activities. This concern leads the mine designers to the transition problem, which is one of the most complicated problems...

Determining the convex hull of a point set is a basic operation for many applications of pattern recognition, image processing, statistics, and data mining. Although the corresponding point sets are often large, the convex hull operation has not been considered much in a database context, and state-of-the-art algorithms do not scale well to non main-memory resident data sets. In this paper, we ...

In this paper, the Hyper - Zagreb index of the Cartesian product, composition and corona product of graphs are computed. These corrects some errors in G. H. Shirdel et al.[11].