34229141
Spatio-Temporal Association Mining for Un-sampled Sites
In this paper, we investigate interpolation methods that are suitable for discovering spatio-temporal association rules for unsampled points with an initial focus on drought risk management. For drought risk management, raw weather data is collected, converted to various indices, and then mined for association rules. To generate association rules for unsampled sites, interpolation methods can be applied at any stage of this data mining process. We develop and integrate three interpolation models into our association rule mining algorithm. The performance of these three models is experimentally evaluated comparing interpolated association rules with rules discovered from actual raw data.
38979960
Interpolation Techniques for Geo-spatial Association Rule Mining
Association rule mining has become an important component of information processing systems due to significant increase in its applications. In this paper, our main objective is to find which interpolation approaches are best suited for discovering geo-spatial association rules from unsampled points. We investigate and integrate two interpolation approaches into our geo-spatial association rule mining algorithm. We call them pre-interpolation and post-interpolation approaches.
5115871
Temporal Knowledge Discovery with Infrequent Episodes
In this paper, we present an efficient algorithm which discovers rare episodes with a combination of bottom-up and top-down scanning schema. The information sharing between bottom-up and top-down scannings helps prune candidate episodes, and thus, efficiently find infrequent episodes that are interesting to user: We evaluate the performance of the algorithm using real-life weather databases. We observe from experimental results that our approach results in 30%-90% reduction in computation time and 25%-75% reduction in the number of candidates comparing with Apriori algorithm.
7985665
Eulerian subgraphs and Hamilton-connected line graphs
Let C(l,k) denote a class of 2-edge-connected graphs of order n such that a graph G ∈ C(l,k) if and only if for every edge cut S ⊆ E(G) with |S| ≤ 3, each component of G-S has order at least (n-k)/l. We prove the following: (1) If G ∈ C(6,0), then G is supereulerian if and only if G cannot be contracted to K2,3, K2,5 or K2,3(e), where e ∈ E(K2,3) and K2,3(e) stands for a graph obtained from K2,3 by replacing e by a path of length 2. (2) If G ∈ C(6, 0) and n≥7, then L(G) is Hamilton-connected if and only if κ(L(G))≥3. Former results by Catlin and Li, and by Broersma and Xiong are extended.
7717414
A time interval based consistency control algorithm for interactive groupware applications
Traditional concurrency control methods such as locking and serialization are not suitable for distributed interactive applications that demand fast local response. Operational transformation (OT) is the standard solution to concurrency control and consistency maintenance in group editors, an important class of interactive groupware applications. It generally trades consistency for local responsiveness, because human users can often tolerate temporary inconsistencies but do not like their interactions be lost or nondeterministically blocked. This paper presents a time interval based operational transformation algorithm (TIBOT) that overcomes the various limitations of previous related work. Our approach guarantees content convergence and is significantly more simple and efficient than existing approaches. This is achieved in a pure replicated architecture by using a linear clock and by posing some constraints on communication that are reasonable for the application domain.
8785272
A Framework for Building Collaboration Tools by Leveraging Industrial Components
Groupware applications allow a distributed group of human users to work apart together over a computer network They are difficult to develop due to the needs to suit a range of collaboration tasks that are often with diverse and evolutionary requirements To address this problem, we propose a new framework in which shared data components conforming to a well-defined interface can be dynamically plugged in for flexible sharing, and a simple transformation tool is provided such that the myriad of industrial collaboration-transparent components can be transformed into shared components The validity of our framework is evaluated by building a suite of typical collaboration tools such as group editors Under our framework, most components in the Java Development Kit (JDK) can be transformed automatically for prototyping collaboration tools With minimal manual work, those tools can be adapted to achieve advanced flexibility, e.g., data and control components can be bound dynamically to switch control protocols.
17329223
Supereulerian planar graphs
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoint spanning trees, then G is supereulerian except a few classes of graphs. This is applied to show the existence of spanning Eulerian subgraphs in planar graphs with small edge cut conditions. We also determine several extremal bounds for planar graphs to be supereulerian.
7454095
On the relationship between the integer and continuous solutions of convex programs
Abstract A bound is obtained in this note for the distance between the integer and real solutions to convex quadratic programs. This bound is a function of the condition number of the Hessian matrix. We further extend this proximity result to convex programs and mixed-integer convex programs. We also show that this bound is achievable in certain situations and the distance between the integer and continuous minimizers may tend to infinity.