Control of Supply Chain Systems by Kanban Mechanism.

This research studies the control mechanism of a supply chain system to operate it efficiently and economically under the just-in-time (JIT) philosophy. To implement a JIT system, kanbans are employed to link different plants\u27 production processes in a supply pipeline. Supply chain models may be categorized into single-stage, multi-stage, and assembly-line types of production systems. In order to operate efficiently and economically, the number of kanbans, the manufacturing batch size, the number of batches, and the total quantity over one period are determined optimally for these types of supply chains. The kanban operation at each stage is scheduled to minimize the total cost in the synchronized logistics of the supply chain. It is difficult to develop a generalized mathematical model for a supply chain system that incorporates all its salient features. This research employs two basic models to describe the supply chain system: a mathematical programming model to minimize the supply chain inventory system cost and a queuing model to configure the kanban logistic operations in the supply pipeline. A supply chain inventory system is modeled as a mixed-integer nonlinear programming (MINLP) that is difficult to solve optimally for a large instance. A branch-and-bound (B&B) method is devised for all versions of it to solve the MINLP problems. From the solution of MINLP, the number of batches in each stage and the total quantity of products are obtained. Next, the number of kanbans that are needed to deliver the batches between two adjacent stages is determined from the results of the MINLP, and kanban operations are fixed to efficiently schedule the dispatches of work-in-process. The new solutions result in a new line configuration as to the number and size of kanbans that led to simpler dispatch schedules, better material handling, reduction in WIP and delivery time, and enhancement of the overall productivity. These models can help a manager respond quickly to consumers\u27 need, determine the right policies to order the raw material and deliver the finished goods, and manage the operations efficiently both within and between the plants

ANN Synthesis Model of Single-Feed Corner-Truncated Circularly Polarized Microstrip Antenna with an Air Gap for Wideband Applications

A computer-aided design model based on the artificial neural network (ANN) is proposed to directly obtain patch physical dimensions of the single-feed corner-truncated circularly polarized microstrip antenna (CPMA) with an air gap for wideband applications. To take account of the effect of the air gap, an equivalent relative permittivity is introduced and adopted to calculate the resonant frequency and Q-factor of square microstrip antennas for obtaining the training data sets. ANN architectures using multilayered perceptrons (MLPs) and radial basis function networks (RBFNs) are compared. Also, six learning algorithms are used to train the MLPs for comparison. It is found that MLPs trained with the Levenberg-Marquardt (LM) algorithm are better than RBFNs for the synthesis of the CPMA. An accurate model is achieved by using an MLP with three hidden layers. The model is validated by the electromagnetic simulation and measurements. It is enormously useful to antenna engineers for facilitating the design of the single-feed CPMA with an air gap

On-Line Bayesian Speaker Adaptation By Using Tree-Structured Transformation and Robust Priors

This paper presents new results by using our previously proposed on-line Bayesian learning approach for affine transformation parameter estimation in speaker adaptation. The on-line Bayesian learning technique allows updating parameter estimates after each utterance and it can accommodate flexible forms of transformation functions as well as prior probability density functions. We show through experimental results the robustness of heavy tailed priors to mismatch in prior density estimation. We also show that by properly choosing the transformation matrices and depths of hierarchical trees, recognition performance improved significantly

High-dimensional and banded vector autoregressions

We consider a class of vector autoregressive models with banded coefficient matrices. The setting represents a type of sparse structure for high-dimensional time series, though the implied autocovariance matrices are not banded. The structure is also practically meaningful when the order of component time series is arranged appropriately. The convergence rates for the estimated banded autoregressive coefficient matrices are established. We also propose a Bayesian information criterion for determining the width of the bands in the coefficient matrices, which is proved to be consistent. By exploring some approximate banded structure for the autocovariance functions of banded vector autoregressive processes, consistent estimators for the auto-covariance matrices are constructed