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.
4669631
A new hierarchical control scheme for a class of cyclically repeated discrete-event systems
We extend the hierarchical control method in (Li et al., 2004) to a more generic setting which involves cyclically repeated processes. A hierarchical architecture is presented to facilitate control synthesis. Specifically, a conservative max-plus model for cyclically repeated processes is introduced on the upper level which provides an optimal online plan list. An enhanced min-plus algebra based scheme on the lower level not only handles unexpected events but, more importantly, addresses cooperation issues between sub-plants and different cycles. A rail traffic example is given to demonstrate the effectiveness of the proposed approach.
6720899
Mode selection and mode-dependency modeling for power-aware embedded systems
Among the techniques for system-level power management, it is not currently possible to guarantee timing constraints and have a comprehensive system model supporting multiple components at the same time. We propose a new method for modeling and selecting the power modes for the optimal system-power management of embedded systems under timing and power constraints. First, we not only model the modes and the transitions overhead at the component level, but we also capture the application-imposed relationships among the components by introducing a mode dependency graph at the system level. Second, we propose a mode selection technique, which determines when and how to change mode in these components such that the whole system can meet all power and timing constraints. Our constraint-driven approach is a critical feature for exploring power/performance tradeoffs in power-aware embedded systems. We demonstrate the application of our techniques to a low-power sensor and an autonomous rover.
19454602
Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation
A logarithmic-exponential dual formulation is proposed in this paper for bounded integer programming problems. This new dual formulation possesses an asymptotic strong duality property and guarantees the identification of an optimal solution of the primal problem. These prominent features are achieved by exploring a novel nonlinear Lagrangian function, deriving an asymptotic zero duality gap, investigating the unimodality of the associated dual function and ensuring the primal feasibility of optimal solutions in the dual formulation. One other feature of the logarithmicexponential dual formulation is that no actual dual search is needed when parameters are set above certain threshold-values.
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.
207726898
Quick response policy with Bayesian information updates
Abstract In this paper we investigate the quick response (QR) policy with different Bayesian models. Under QR policy, a retailer can collect market information from the sales of a pre-seasonal product whose demand is closely related to a seasonal product’s demand. This information is then used to update the distribution for the seasonal product’s demand by a Bayesian approach. We study two information update models: one with the revision of an unknown mean, and the other with the revision of both an unknown mean and an unknown variance. The impacts of the information updates under both models are compared and discussed. We also identify the features of the pre-seasonal product which can bring more significant profit improvement. We conclude that an effective QR policy depends on a precise information update model as well as a selection of an appropriate pre-seasonal product as the observation target.