Application domains for the Delta method

The Delta method uses truncated Lagrange expansions of statistics to obtain approximations to their distributions. In this paper, we consider statistics Y=g(μ+X), where X is any random vector. We obtain domains 𝒟 such that, when μ∈𝒟, we may apply the distribution derived from the Delta method. Namely, we will consider an application on the normal case to illustrate our approach.     

Chisquared and related inducing pivot variables: an application to orthogonal mixed models

Abstract

We use chi-squared and related pivot variables to induce probability measures for model parameters, obtaining some results that will be useful on the induced densities. As illustration we considered mixed models with balanced cross nesting and used the algebraic structure to derive confidence intervals for the variance components. A numerical application is presented.     

Sensitivity analysis in multivariate methods: Decomposition of an arbitrary influence into a finite number of components

The influence function of the covariance matrix is decomposed into a finite number of components. This decomposition provides a useful tool to develop efficient methods for computing empirical influence curves related to various multivariate methods. It can also be used to characterize multivariate methods from the sensitivity perspective. A numerical example is given to demonstrate efficient computing and to characterize some procedures of exploratory factor analysis.     

Nonparametric estimation of the hazard function under dependence conditions

The estimation of the hazard rate has a great number of practical appli¬cations in dependence situations (seismicity analysis, reliability, economics), Based on kernel estimates of the density and the distribution function, we study the properties of the nonparametric estimator of the hazard function as-sociated with a strongly mixing time series. We prove consistency and asymp¬totic normality properties, and a cross-validation method for the smoothing parameter selection is studied. Some simulations and a practical application to real data are also shown.     

The Estimation and Testing of the Cointegration Order Based on the Frequency Domain

ABSTRACT

This article proposes a method to estimate the degree of cointegration in bivariate series and suggests a test statistic for testing noncointegration based on the determinant of the spectral density matrix for the frequencies close to zero. In the study, series are assumed to be I(d), 0 < d ? 1, with parameter d supposed to be known. In this context, the order of integration of the error series is I(d ? b), b ∈ [0, d]. Besides, the determinant of the spectral density matrix for the dth difference series is a power function of b. The proposed estimator for b is obtained here performing a regression of logged determinant on a set of logged Fourier frequencies. Under the null hypothesis of noncointegration, the expressions for the bias and variance of the estimator were derived and its consistency property was also obtained. The asymptotic normality of the estimator, under Gaussian and non-Gaussian innovations, was also established. A Monte Carlo study was performed and showed that the suggested test possesses correct size and good power for moderate sample sizes, when compared with other proposals in the literature. An advantage of the method proposed here, over the standard methods, is that it allows to know the order of integration of the error series without estimating a regression equation. An application was conducted to exemplify the method in a real context.     

SNA关于雇员股票期权核算方法的研究及其对中国国民经济核算的影响

本文首先综述了雇员股票期权的定义以及国际企业会计准则对雇员股票期权的处理方法.接着介绍了2008年SNA关于雇员股票期权的处理方法,并通过雇员股票期权账户登录表,更直观地展示了雇员股票期权在授权日、含权日和行权日之间,如何分别在雇主账户与雇员账户中记录.最后,对部分国家的经验数据进行了分析,并探讨了雇员股票期权作为雇员报酬处理对于中国国民经济核算,特别是收入分配核算的影响.     

An ant colony optimization approach for the proportionate multiprocessor open shop

Multiprocessor open shop makes a generalization to classical open shop by allowing parallel machines for the same task. Scheduling of this shop environment to minimize the makespan is a strongly NP-Hard problem. Despite its wide application areas in industry, the research in the field is still limited. In this paper, the proportionate case is considered where a task requires a fixed processing time independent of the job identity. A novel highly efficient solution representation is developed for the problem. An ant colony optimization model based on this representation is proposed with makespan minimization objective. It carries out a random exploration of the solution space and allows to search for good solution characteristics in a less time-consuming way. The algorithm performs full exploitation of search knowledge, and it successfully incorporates problem knowledge. To increase solution quality, a local exploration approach analogous to a local search, is further employed on the solution constructed. The proposed algorithm is tested over 100 benchmark instances from the literature. It outperforms the current state-of-the-art algorithm both in terms of solution quality and computational time.

     

On total and edge coloring some Kneser graphs

Journal of Combinatorial Optimization - In this work, we investigate the total and edge colorings of the Kneser graphs K(n,&nbsp;s). We prove that the sparse case of Kneser graphs, the odd...     

Exact algorithms for scheduling programs with shared tasks

We study a scheduling problem where the jobs we have to perform are composed of one or more tasks. If two jobs sharing a non-empty subset of tasks are scheduled on the same machine, then these shared tasks have to be performed only once. This kind of problem is known in the literature under the names of VM-PACKING or PAGINATION. Our objective is to schedule a set of these objects on two parallel identical machines, with the aim of minimizing the makespan. This problem is NP-complete as an extension of the PARTITION problem. In this paper we present three exact algorithms with worst-case time-complexity guarantees, by exploring different branching techniques. Our first algorithm focuses on the relation between jobs sharing one or more symbols in common, whereas the two other algorithms branches on the shared symbols.