• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.135-150
• /
• 2002

The present paper discusses non-deterministic finite Rabin-scott's automate. The majority of works recently dealing with this subject were, in fact, concerned only with properties of a canonical term automata or of some objects equivalent to it. This article continues the series of works in which the authors state a different point of view, describing the finite automata as just another invariant of the given regular language called basis finite automaton. In this article the authors argue on some new properties for the basis finite automaton. One of them is included into basis automaton's table of binary relations. It is stated that this table can not contain either identical strings or identical columns. Another property depicts a possibility to obtain any finite automaton for a given regular language by the process of duplicating or combining some of its states.

• International Journal of Reliability and Applications
• /
• v.2 no.4
• /
• pp.253-262
• /
• 2001

A k-out-of-n standby system is considered where all of its components are s-independent and classified either working or cold standby connected with imperfect switches. The probability density function of the life length for this system is established in closed form, when the underlying components have constant failure rates. Also the reliability function of the system is derived. Finally, the reliability functions for one, two and three out of four systems are deduced for perfect or imperfect switches and identical or non-identical constant failure rates for working and standby components.

• International Journal of Reliability and Applications
• /
• v.3 no.4
• /
• pp.185-198
• /
• 2002

In the traditional life testing model, it is assumed that a certain number of identical items are tested under identical condition. This is due to statistical rather than practical considerations. The proportional hazards model can be used to develop a realistic approach to determine the performance of an item. That is also capable of modeling the failure rates of accelerated life testing when the covariates are applied stresses. The proportional hazards model is typically applied for a group of items to assess the importance of factors that may influence the reliability of an item. In this paper we considered the interarrival times of an item rather than the time to first failure for grouped items and provided the availability estimation for the determination of maintenance policy and overhaul time. In order to demonstrate the proposed approach, an example is presented.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.560-567
• /
• 1998

This paper concerned about a imputed color printed material image in camera to decrease noise and distortion by processing median filtering with input image to identical condition. Also this paper proposed the way of compares a normal printed material with an abnormal printed material color tone with trained a learning of the error back-propagation to block classification by extracting five place from identical block(3${\times}$3) of color printed material R, G, B value. As a representative algorithm of multi-layer perceptron the error Back-propagation technique used to solve complex problems. However, the Error Back-propagation is algorithm which basically used a gradient descent method which can be converged to local minimum and the Back Propagation train include problems, and that may converge in a local minimum rather than get a global minimum. The network structure appropriate for a given problem. In this paper, a good result is obtained by improve initial condition and adjust th number of hidden layer to solve the problem of real time process, learning and train.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.1
• /
• pp.108-117
• /
• 2014

This study considers warehouse sizing decisions in an integrated single vendor-single buyer production inventory system by incorporating new decision variables and constraints associated with warehouse size into the formulations. Two typical inventory control policies proposed in the literature (i.e., Identical Delivery Quantity and Deliver What is Produced) have been investigated with consideration of warehouse investment costs. The numerical study shows that Deliver What is Produced is less flexible than Identical Delivery Quantity, resulting in the conclusion that the latter would be preferable when considering warehouse investment costs.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.289-293
• /
• 2005

this paper, we introduce a secure communication method using complex system. We make a complex system with the n-double scroll or Chua's oscillator. The Complex system is created by applying identical n0double scroll or non-identical n-double scroll and Chua's oscillator with weak soupled method to each cell. In order to secure communication, we have synthesizing the desired information with a complex system circuit by adding the information signal to the hyper-chaos signal. And then, transmitting the synthesized signal to the ideal channel, we confirm secure communication by separating the information signal and the complex system signal in the receiver.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.45 no.4
• /
• pp.457-466
• /
• 1996

The Voltage stability problem has recently been dealt with in the literature from various points of view. The diverse theories have been established in voltage stability analysis because of the complicates of power systems and diverse phenomena of voltage collapse. Through rigorous mathematical operations, this paper shows that all the major methods used in static voltage stability, i.e - Jacobian method, voltage sensitivity method, real and reactive power loss sensitivity method and energy function method - have an identical background in theory. The results from the test in sample systems have shown the validity of this verification. (author). refs., figs., tabs.

• Microbiology and Biotechnology Letters
• /
• v.24 no.5
• /
• pp.585-590
• /
• 1996

Peroxidase was purified to homogeneity from cell free extract of Flavobacterium meningosepticum. The molecular weight of the enzyme estimated by gel filtration column chromatography was 220, 000. A identical subunit (54, 000) was detected on SDS-PAGE of the enzyme. From these results, the enzyme was supposed to have four identical subunits. On the basis of the visible absorption spectra of the purified enzyme, the enzyme was a typical hemoprotein. The isoelectric point of the enzyme was 4.1. On using N-ethyl-N-(2-hydroxy-3-sulfopropyl)-m- toluidine (Toos) as a hydrogen donor, the enzyme showed optimum activity at the pH 5.5 and 50$\circ$C. The enzyme activity was inhibited by carbonyl reagent and Hg$^{2+}$ .

• Journal of Korean Institute of Industrial Engineers
• /
• v.1 no.2
• /
• pp.73-81
• /
• 1975

In an earlier paper ('Scheduling Jobs on a Number of Identical Machines' by Elmaghraby and Park, March 1974, AIIE Transactions) a branch-and-bound algorithm was developed for the sequencing problem when all jobs are available to process at time zero and are independet (i.e., there are not a priori precedence relationships among jobs.). However, the amount of computation required by the algorithm was not considered to be short if more than 50 jobs were processed. As an effort to improve the algorithm, the present paper modifies the implicit enumeration procedure in the algorithm so that moderately large problems can be treated with what appears to be a short computational time. Mainly this paper is concerned with improving the lower bound in the implicit enumeration procedure. The computational experiences with this new branch-and-bound algorithm are given.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.431-446
• /
• 1998

In this paper, we consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, we first propose a dynamic programming(DP) algorithm for sequencing jobs processed on a single machine. The algorithm is then extended to handle jobs on parallel-identical machines. Finally, we developed an improved version of the algorithm which generates optimal solutions using much smaller amount of memory space and computing time. Computational results are provided to illustrate the performance of the DP algorithms.