Orthogonal Arrays Robust to a Specified Set of Nonnegligible Effects

This paper considers experimental situations where the interested effects have to be orthogonal to a set of nonnegligible effects.It is shown that various types of orthogonal arrays with mixed strength are A-optimal for estimating the parameters in ANOVA high dimension model representation.Both cases including interactions or not are considered in the model.In particularly,the estimations of all main effects are A-optimal in a mixed strength(2,2)_3 orthogonal array and the estimations of all main effects and two-factor interactions in G_1×G_2 are A-optimal in a mixed strength(2,2)_4 orthogonal array.The properties are also illustrated through a simulation study.     

Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties

This paper studies the batch sizing scheduling problem with earliness and tardiness penalties which is closely related to a two-level supply chain problem. In the problem, there are K customer orders, where each customer order consisting of some unit length jobs has a due date. The jobs are processed in a common machine and then delivered to their customers in batches, where the size of each batch has upper and lower bounds and each batch may incur a fixed setup cost which can also be considered a fixed delivery cost. The goal is to find a schedule which minimizes the sum of the earliness and tardiness costs and the setup costs incurred by creating a new batch. The authors first present some structural properties of the optimal schedules for single-order problem with an additional assumption (a): The jobs are consecutively processed from time zero. Based on these properties, the authors give a polynomial-time algorithm for single-order problem with Assumption (a). Then the authors give dynamic programming algorithms for some special cases of multiple-order problem with Assumption (a). At last, the authors present some structural properties of the optimal schedules for single-order problem without Assumption (a) and give a polynomial-time algorithm for it.     

An empirical investigation on the risk-return relationship of carbon future market

This paper examines the risk-return relationship for the carbon future market during Phases I, II and III of the European Union Emission Trading Scheme (EU ETS). The risk factors derived from the newly developed LSW model, are embedded into a GARCH framework. This new specification is compared with several GARCH-M type models analyzing the risk-return relationship in the carbon market. The results show that the new specification consistently achieves a good fit and possesses superior explanatory power for the European Union Allowance (EUA) data. Some policy suggestions regarding market efficiency are also provided.     

The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail

This paper considers an on-line scheduling and routing problem concerning the automated storage and retrieval system from tobacco industry. In this problem, stacker cranes run on one common rail between two racks. Multiple input/output-points are located at the bottom of the racks. The stacker cranes transport bins between the input/output-points and cells on the racks to complete requests generated over time. Each request should be accomplished within its response time. The objective is to minimize the time by which all the generated requests are completed. Under a given physical layout, the authors study the complexity of the problem and design on-line algorithms for both one-stacker-crane model and two-stacker-crane model. The algorithms are validated by instances and numerical simulations.     

Empirical likelihood for partially linear models under negatively associated errors

This paper proposes to use the blockwise empirical likelihood(EL) method to construct the confidence regions for the regression vector β in a partially linear model under negatively associated errors. It is shown that the blockwise EL ratio statistic for β is asymptotically χ~2 distributed. The result is used to obtain an EL-based confidence region for β. Results of a simulation study on the finite sample performance of the proposed confidence regions are reported.     

The equivalent representation of the breadth-one <Emphasis Type="Italic">D</Emphasis>-invariant polynomial subspace and its discretization

This paper demonstrates the equivalence of two classes of D-invariant polynomial subspaces, i.e., these two classes of subspaces are different representations of the breadth-one D-invariant subspace. Moreover, the authors solve the discrete approximation problem in ideal interpolation for the breadth-one D-invariant subspace. Namely, the authors find the points, such that the limiting space of the evaluation functionals at these points is the functional space induced by the given D-invariant subspace, as the evaluation points all coalesce at one point.     

A two-dimensional improvement for Farr-Gao algorithm

Farr-Gao algorithm is a state-of-the-art algorithm for reduced Gröbner bases of vanishing ideals of finite points, which has been implemented in Maple as a build-in command. This paper presents a two-dimensional improvement for it that employs a preprocessing strategy for computing reduced Gröbner bases associated with tower subsets of given point sets. Experimental results show that the preprocessed Farr-Gao algorithm is more efficient than the classical one.     

Stability of coupled impulsive Markovian jump reaction-diffusion systems on networks

This paper is devoted to the investigation of stability for a class of coupled impulsive Markovian jump reaction-diffusion systems on networks (CIMJRDSNs). By using graph theory, a systematic method is provided to construct global Lyapunov functions for the CIMJRDSNs. Based on Lyapunov functions and stochastic analysis method, some novel stability principles associated with the topology property of the networks are established.     

The effect of corporate governance on debt financing cost of listed companies

In recent years,bank credit business is booming with the increasing borrowing intention of China’s listed companies,and debt financing has become the major approach among listed companies’financing strategies.As a series of institutional arrangements about rights,responsibilities and benefits between different shareholders,corporate governance mechanism has a significant influence on the cost of debt financing.This paper employs variable coefficient panel data model to investigate the relationship of the listed company’s debt financing costs and corporate governance mechanism in terms of structural characteristics and time series characteristics.The results show that optimizing the structure of both Board of Directors and Board of Supervisors,establishing a reasonable management incentive system and reducing the concentration of ownership properly can directly contribute to a lower company’s debt financing costs.Meanwhile,property rights have an interactive influence on corporate governance from four aspects,which indirectly effect in company’s debt financing costs.     

Knowledge-scientific evaluation of community service systems

This paper proposes a knowledge-scientific approach to evaluation of community service systems from the viewpoints of knowledge creation, consciousness reform, and value co-creation. A concrete example of the community service system treated here is an education program for old men to find their reason for living after the retirement. After introducing this program and the traditional evaluation methods for such a program, the paper emphasizes the necessity of developing new evaluation methods for such a community service system based on knowledge science. The paper proposes a new evaluation framework and reports an actual evaluation result using the interview data from participants in that program.