• Journal of Information Processing Systems
• /
• 제13권1호
• /
• pp.104-113
• /
• 2017

In this paper, we present an approach to transmit data from the source to the destination through a minimal path (least-cost path) in a computer network of n nodes. The motivation behind our approach is to address the problem of finding a minimal path between the source and destination. From the work we have studied, we found that a Steiner tree with bounded Steiner vertices offers a good solution. A novel algorithm to construct a Steiner tree with vertices and bounded Steiner vertices is proposed in this paper. The algorithm finds a path from each source to each destination at a minimum cost and minimum number of Steiner vertices. We propose both the sequential and parallel versions. We also conducted a comparative study of sequential and parallel versions based on time complexity, which proved that parallel implementation is more efficient than sequential.

• 통합자연과학논문집
• /
• 제14권4호
• /
• pp.197-204
• /
• 2021

Under the two-phase warranty, the warranty period is divided into two intervals, one of which is for renewing replacement warranty, and the other is for minimal repair warranty. Jung^[13] discusses the two types of extended two-phase warranty models. In this paper, we suggest the replacement model after the extended two-phase warranty that has been proposed by Jung^[13]. To determine the optimal replacement policy, we adopt the expected cost rate per unit time. So, the expressions for the total expected cost, the expected length of the cycle and the expected cost rate per unit time from the user's point of view are derived. Also, we discuss the optimal replacement policy and the uniqueness of the solution for the optimization. Furthermore, the numerical examples are provided to illustrate the proposed the replacement model.

• 대한산업공학회지
• /
• 제11권1호
• /
• pp.3-10
• /
• 1985

Periodic replacement policies are proposed for a system whose repair cost, when it fails, can be estimated by inspection. The system is replaced when it reaches age T (Policy A), or when it fails for the first time after age T (Policy B). If it fails before reaching age T, the repair cost is estimated and minimal repair is then undertaken if the estimated cost is less than a predetermined limit L; otherwise, the system is replaced. The expected cost rate functions are obtained, their behaviors are examined, and ways of obtaining optimal T and L are explored.

• Journal of the Korean Statistical Society
• /
• 제28권4호
• /
• pp.515-522
• /
• 1999

A repair process of a system consisting of both perfect repairs and minimal repairs is introduced. The type of repair, when the system fails, is determined by an embedded two state Markov chain. We study several stochastic properties of the process including the preservation of ageing properties and the monotonicities of the time between successive repairs. After assigning repair costs to the process, we also show that an optimal repair policy uniquely exists, if the underlying life distribution of the system has DMRL.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.39.2-39
• /
• 2001

This paper describes the design of an output-feedback controller based on an adaptive fuzzy observer for uncertain single-input single-output nonlinear dynamical systems. Especially, we have focused on the realization of minimal dynamic order of the adaptive fuzzy observer. For the purpose, we propose a new method in which no strictly positive real(SPR) condition is needed and combine dynamic rule activation scheme with on-line estimation of fuzzy parameters. By using proposed scheme, we can reduce computation time, storage space, and dynamic order of the adaptive fuzzy observer ...

• 전기의세계
• /
• 제28권11호
• /
• pp.37-44
• /
• 1979

This paper deals with the computer program of finding the minimal sum-of-products for a switching function by using the MASK method derived from the characteristics of the Boolean algebra. The approach differs from the previous procedures in that all the prime implicants are determined only by the bit operation and the minimal sum-of-products are obtained by the modified Petrick method in this work. The important features are the relatively small amount of the run time and the less memory capacity to solve a problem, as compared to the previous computer programs.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.461-470
• /
• 2007

Parameter identification is studied in viscoelastic rods by solving an inverse problem numerically. The material properties of the rod, which appear in the constitutive relations, are recovered by optimizing an objective function constructed from reference strain data. The resulting inverse algorithm consists of an optimization algorithm coupled with a corresponding direct algorithm that computes the strain fields given a set of material properties. Numerical results are presented for two model inverse problems; (i)the effect of noise in the reference strain fields (ii) the effect of minimal reference data in space and/or time data.

• 한국인터넷방송통신학회논문지
• /
• 제20권1호
• /
• pp.107-112
• /
• 2020

본 연구에서는 IEEE 802.1 time sensitive network(TSN) task group(TG)에서 표준화 중인 asynchronous traffic shaping (ATS) 기술에서 제시된 minimal interleaved regulator(IR) 개념을 확장 적용한 통합 플로우 기반 지연시간 보장 프레임워크를 분석하였다. 해당 프레임워크는 단위 네트워크의 출력포트에 IR을 적용하여 burst 축적을 방지하면서, 동시에 단위 네트워크 안에서는 입출력 포트를 기준으로 플로우를 통합하여 복잡도를 낮출 수 있다. 본 연구에서는 다양한 파라미터들 가진 네트워크에서의 수치적 분석을 통해서, 제안된 낮은 복잡도의 프레임워크의 성능이 기존 integrated services (IntServ) 프레임워크보다 더 우수하거나 비슷함을 보였다. 특히 통합 플로우의 크기와 단위 네트워크의 크기가 클수록 성능이 우수해짐을 확인하였다.

• 한국통신학회논문지
• /
• 제22권10호
• /
• pp.2357-2363
• /
• 1997

본 논문에서는 최소 다중 UIO를 사용했을 때보다 비 최소 다중 UIO를 사용했을 때 시험열의 길이가 줄어들 수 있음을 보여준다. 본 논문에서 제안하는 시험열 생성 방법은 Shen의 방법이 어떤 상태에서 들어오는 에지와 나가는 에지의 차가 클 때에는 최적화된 시험열을 생성하지 못한다는 데에 기초하고 있다. 이 성질을 이용하여 시험열의 길이를 줄이는 관점에서 UIO에 기초한 보다 향상된 기법을 제안하고 기존의 방법과 시험열의 길이와 적합성 검사를 위하여 걸리는 시간, 시험열을 생성하는데 걸리는 시간이 보다 효율적임을 기존의 방법과 비교하여 설명한다.

• 산업경영시스템학회지
• /
• 제17권32호
• /
• pp.7-16
• /
• 1994

In the existing deterministic network, the capacity of each arc has determined property. But actually, it may be a property which cannot be determined. Even though it should be determining, it contains many errors. In treating these kinds of problems, fuzzy theory is suitable. Recently, due to development the study on complicated and indefinited systems which contain fuzziness could be possible. This paper includes that the capacity of each arc and the goal quantity with nonnegative integer have the fuzziness. The object is to search the new mathod of fuzzy maximal flow quantity. If the degree of arc membership function of the minimal cut part is not larger than that of arc membership function of the part except the minimal cut, first calcurate nonfuzzy maximal flow quantity, and then can compute the optimal quantity the 3rd step at one time with Max-Min fuzzy operating in the arc capacity of minimal cut and the goal quantity without a great number of recalculation.