Dynamic discovery of query path on the lattice of cuboids using hierarchical data granularity and storage hierarchy

Analytical processing on multi-dimensional data is performed over data warehouse. This, in general, is presented in the form of cuboids. The central theme of the data warehouse is represented in the form of fact table. A fact table is built from the related dimension tables. The cuboid that corresponds to the fact table is called base cuboid. All possible combination of the cuboids could be generated from base cuboid using successive roll-up operations and this corresponds to a lattice structure. Some of the dimensions may have a concept hierarchy in terms of multiple granularities of data. This means a dimension is represented in more than one abstract form. Typically, neither all the cuboids nor all the concept hierarchy are required for a specific business processing. These cuboids are resided in different layers of memory hierarchy like cache memory, primary memory, secondary memory, etc. This research work dynamically finds the most cost effective path from the lattice structure of cuboids based on concept hierarchy to minimize the query access time. The knowledge of location of cuboids at different memory elements is used for the purpose.     

Parameter adaptive harmony search algorithm for unimodal and multimodal optimization problems

This paper presents a parameter adaptive harmony search algorithm (PAHS) for solving optimization problems. The two important parameters of harmony search algorithm namely Harmony Memory Consideration Rate (HMCR) and Pitch Adjusting Rate (PAR), which were either kept constant or the PAR value was dynamically changed while still keeping HMCR fixed, as observed from literature, are both being allowed to change dynamically in this proposed PAHS. This change in the parameters has been done to get the global optimal solution. Four different cases of linear and exponential changes have been explored. The change has been allowed during the process of improvization. The proposed algorithm is evaluated on 15 standard benchmark functions of various characteristics. Its performance is investigated and compared with three existing harmony search algorithms. Experimental results reveal that proposed algorithm outperforms the existing approaches when applied to 15 benchmark functions. The effects of scalability, noise, and harmony memory size have also been investigated on four approaches of HS. The proposed algorithm is also employed for data clustering. Five real life datasets selected from UCI machine learning repository are used. The results show that, for data clustering, the proposed algorithm achieved results better than other algorithms.     

An epsilon-based measure of efficiency in DEA – A third pole of technical efficiency

In DEA, we have two measures of technical efficiency with different characteristics: radial and non-radial. In this paper we compile them into a composite model called “epsilon-based measure (EBM).” For this purpose we introduce two parameters which connect radial and non-radial models. These two parameters are obtained from the newly defined affinity index between inputs or outputs along with principal component analysis on the affinity matrix. Thus, EBM takes into account diversity of input/output data and their relative importance for measuring technical efficiency.     

Testing procedures for detection of linear dependencies in efficiency models

The validity of many efficiency measurement methods rely upon the assumption that variables such as input quantities and output mixes are independent of (or uncorrelated with) technical efficiency, however few studies have attempted to test these assumptions. In a recent paper, Wilson (2003) investigates a number of independence tests and finds that they have poor size properties and low power in moderate sample sizes. In this study we discuss the implications of these assumptions in three situations: (i) bootstrapping non-parametric efficiency models; (ii) estimating stochastic frontier models and (iii) obtaining aggregate measures of industry efficiency. We propose a semi-parametric Hausmann-type asymptotic test for linear independence (uncorrelation), and use a Monte Carlo experiment to show that it has good size and power properties in finite samples. We also describe how the test can be generalized in order to detect higher order dependencies, such as heteroscedasticity, so that the test can be used to test for (full) independence when the efficiency distribution has a finite number of moments. Finally, an empirical illustration is provided using data on US electric power generation.     

分析化学有效数字教学中常见问题及分析

Analytical chemistry often involves a large amount of experimental data, and the reliability and accuracy of the experimental results are related to whether the original data can be properly recorded and calculated. In this paper, starting from the importance of significant figures, analyzing the frequently encountered problems related to the significant figures in teaching process, and giving some solutions, we try to help students to learn and master the concept of significant figures, rounding off numerical values, rule of operation and data processing.     

Incorporating the learning effect into data envelopment analysis to measure MSW recycling performance

The effect of organizational learning, which results in continuous improvement of organizational performance over time, has been widely discussed. The cumulative learning effect may form as a source of intellectual capital. Thus far, the static data envelopment analysis (DEA) model has not been used to examine the longitudinal learning effect. Therefore, a two-stage approach is developed together with the estimation of a latent learning effect using time-series data; the estimated learning effect is then used as an input in the DEA Slacks-Based Measure (SBM) model. The proposed DEA SBM model can be used to investigate the efficiency of the organizational learning effect of Municipal Solid Waste (MSW) recycling systems.     

4D variational data assimilation for locally nested models: Complementary theoretical aspects and application to a 2D shallow water model

We consider the application of a four‐dimensional variational data assimilation method to a numerical model, which employs local mesh refinement to improve its solution. We focus on structured meshes where a high‐resolution grid is embedded in a coarser resolution one, which covers the entire domain. The formulation of the nested variational data assimilation algorithm was derived in a preliminary work (Int. J. Numer. Meth. Fluids 2008; under review). We are interested here in complementary theoretical aspects. We present first a model for the multi‐grid background error covariance matrix. Then, we propose a variant of our algorithms based on the addition of control variables in the inter‐grid transfers in order to allow for a reduction of the errors linked to the interactions between the grids. These formulations are illustrated and discussed in the test case experiment of a 2D shallow water model. Copyright © 2010 John Wiley & Sons, Ltd.     

Super efficiencies or super inefficiencies? Insights from a joint computation model for slacks-based measures in DEA

The slacks-based measure (SBM) can incorporate input and output slacks that would otherwise be neglected in the classical DEA model. In parallel, the super-efficiency model for SBM (S-SBM) has been developed for the purpose of ranking SBM efficient decision-making units (DMUs). When implementing SBM in conjunction with S-SBM, however, several issues can arise. First, unlike the standard super-efficiency model, S-SBM can only solve for super-efficiency scores but not SBM scores. Second, the S-SBM model may result in weakly efficient reference points. Third, the S-SBM and SBM scores for certain DMUs may be discontinuous with a perturbation to their inputs and outputs, making it hard to interpret and justify the scores in applications and the efficiency scores may be sensitive to small changes/errors in data. Due to this discontinuity, the S-SBM model may overestimate the super-efficiency score. This paper extends the existing SBM approaches and develops a joint model (J-SBM) that addresses the above issues; namely, the J-SBM model can (1) simultaneously compute SBM scores for inefficient DMUs and super-efficiency for efficient DMUs, (2) guarantee the reference points generated by the joint model are Pareto-efficient, and (3) the J-SBM scores of a firm are continuous in the input and output space. Interestingly, the radial DEA efficiency and super-efficiency scores for a DMU are continuous in the input–output space. The J-SBM model combines the merits of the radial and SBM models (i.e., continuity and Pareto-efficiency).     

Comparison of sequential data assimilation methods for the Kuramoto–Sivashinsky equation

The Kuramoto–Sivashinsky equation plays an important role as a low‐dimensional prototype for complicated fluid dynamics systems having been studied due to its chaotic pattern forming behavior. Up to now, efforts to carry out data assimilation with this 1‐D model were restricted to variational adjoint methods domain and only Chorin and Krause (Proc. Natl. Acad. Sci. 2004; 101 (42):15013–15017) tested it using a sequential Bayesian filter approach. In this work we compare three sequential data assimilation methods namely the Kalman filter approach, the sequential Monte Carlo particle filter approach and the maximum likelihood ensemble filter methods. This comparison is to the best of our knowledge novel. We compare in detail their relative performance for both linear and nonlinear observation operators. The results of these sequential data assimilation tests are discussed and conclusions are drawn as to the suitability of these data assimilation methods in the presence of linear and nonlinear observation operators. Copyright © 2009 John Wiley & Sons, Ltd.