• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.98-101
• /
• 2003

To classify desired and undesired documents on the web according to each user's view, FOCUS (Fuzzy dOCUment ordering System) is developed based on fuzzy concept extraction, fuzzy fish eye matching, and fuzzy selection. Experiments are done using the concept-system-dictionary by EDR (Electronic Dictionary Research Institute) including 140,000 words and web-based documents related to movie.

• 한국산학기술학회논문지
• /
• 제20권7호
• /
• pp.45-51
• /
• 2019

현대 파일 시스템은 예기치 못한 시스템 크래시 또는 재난 상황에서도 데이터의 일관성 유지를 위해 저널링 메커니즘을 유지한다. 그러나 저널링은 I/O 처리율을 떨어뜨리는 문제가 있다. 이 성능 저하 문제는 데이터 버퍼와 메타데이터 버퍼간의 오더링 메커니즘과 2단계 버퍼쓰기에서 기인하는데. 특히, 만약 데이터 버퍼와 메타데이터 버퍼가 동시에 저널링이 되면, 2단계 쓰기 때문에 심각한 성능저하가 발생하며, 이는 I/O 성능과 시스템 신뢰도 간의 Trade-off 관계가 있음을 나타낸다. 본 논문은 RFJ라는 신뢰성 있는 고속 저널링 기법을 제안한다. 이 기법은 Ordering enforced writeback 저널링 모드와 selective journaling 메커니즘을 도입해서 높은 신뢰도와 동시에 고성능 I/O가 가능하게 한다. 본 논문에서 제안한 기법의 실험 결과 기존 Ext3 저널링 모드 대비 약 5배 이상 빠른 I/O 처리량을 지원하면서 동시에 Ext3 저널링과 동일한 수준의 신뢰성을 나타는 것을 확인 할 수 있었다.

• Bulletin of the Korean Chemical Society
• /
• 제35권5호
• /
• pp.1491-1494
• /
• 2014

High-crystallinity poly(3-hexylthiophene) (P3HT) thin films were prepared by aging the precursor solutions, prepared using a good solvent, chloroform, at low temperatures prior to spin-casting. Lower solution temperatures significantly improved the molecular ordering in the spin-cast P3HT films and, therefore, the electrical properties of field-effect transistors prepared using these films. Solution cooling enhanced the electrical properties by shifting the P3HT configuration equilibrium away from random coils and toward more ordered aggregates. At room temperature, the P3HT molecules were completely solvated in chloroform and adopted a random coil conformation. Upon cooling, however, the chloroform poorly solvated the P3HT molecules, favoring the formation of ordered P3HT aggregates, which then yielded more highly crystalline molecular ordering in the P3HT thin films produced from the solution.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권10호
• /
• pp.615-619
• /
• 2005

Token coherence protocol has many good reasons against snooping/directory-based protocol in terms of latency, bandwidth, and complexity. Token counting easily maintains correctness of the protocol without global ordering of request which is basis of other dominant cache coherence protocols. But this lack of global ordering causes starvation which is not happening in snooping/directory-based protocols. Token coherence protocol solves this problem by providing an emergency mechanism called persistent request. It enforces other processors in the competition (or accessing same shared memory block, to give up their tokens to feed a starving processor. However, as the number of processors grows in a system, the frequency of starvation occurrence increases. In other words, the situation where persistent request occurs becomes too frequent to be emergent. As the frequency of persistent requests increases, not only the cost of each persistent matters since it is based on broadcasting to all processors, but also the increased traffic of persistent requests will saturate the bandwidth of multiprocessor interconnection network. This paper proposes a new request mechanism that defines order of requests to reduce occurrence of persistent requests. This ordering mechanism has been designed to be decentralized since centralized mechanism in both snooping-based protocol and directory-based protocol is one of primary reasons why token coherence protocol has advantage in terms of latency and bandwidth against these two dominant Protocols.

• 산업공학
• /
• 제21권4호
• /
• pp.354-364
• /
• 2008

This paper deals with a design problem of simulation for MIME (multi indenture and multi echelon) with lateral transshipment. Especially, we consider lateral transshipments in case that (S-1, S) ordering policy is used in multi echelon repair system. Some rules for ordering spare parts in lateral transshipments between the lowest-level units are studied and are implemented by an activity diagram in object-oriented method. By numerical examples, we compare regular (S-1, S) ordering policy and (S-1, S) policy with lateral transshipment.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.327-331
• /
• 2006

This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands and the product is provided to the warehouse via procurement ordering from any manufacturing plant or market The Problem is formulated as an Mixed Integer Programming with the objective function of minimizing the sum of inventory holding cost (at the warehouse and retailers), and transportation cost and procurement ordering cost at the warehouse, subject to inventory-balancing constraints, ordering constraints, vehicle capacity constraints and transportation time constraints. The problem is Proven to be NP-hard. Accordingly, a Lagrangean heuristic procedure is derived and tested for its effectiveness through computational experiments with some numerical instances.

• 산업경영시스템학회지
• /
• 제32권3호
• /
• pp.118-126
• /
• 2009

This research investigates the problem of minimizing setup costs in resequencing jobs having first-in, first-out(FIFO) constraints at conveyorized production or assembly systems. Sequence changing at conveyor junctions in these systems is limited due to FIFO restriction. We first define the general problem of resequencing jobs to workstations satisfying precedence relationships between jobs(Generalized Sequential Ordering Problem, GSOP). Then we limit our scope to FIFO precedence relationships which is the conveyor selection problem at a diverging junction(Diverging Sequential Ordering Problem, DSOP), modeling it as a 0-1 integer program. With the capacity constraint removed, we show that the problem can be modeled as an assignment problem. In addition, we proposed and evaluated the heuristic algorithm for the case where the capacity constraint cannot be removed. Finally, we discuss the case study which motivated this research and numerical results.

• 대한산업공학회지
• /
• 제29권3호
• /
• pp.222-229
• /
• 2003

In this paper, we address a layout design problem, PTN[2], for determining an appropriate 2-class-based dedicated storage layout in a class of unit load storage systems. Our strong conjecture is that PTNI2] is NP-hard. Restricting PTN[2], we provide three solvable cases of PTN[2] in which an optimal solution to the solvable cases is one of the partitions based on the PAI(product activity index)-nonincreasing ordering. However, we show with a counterexample that a solution based on the PAI-non increasing ordering does not always give an optimal solution to PTN[2]. Utilizing the derived properties, we construct an effective heuristic algorithm for solving PTN[2] based on a PAI-non increasing ordering with performance ratio bound. Our algorithm with O($n^2$) is effective in the sense that it guarantees a better class-based storage layout than a randomized storage layout in terms of the expected single command travel time.

• 한국산학기술학회논문지
• /
• 제7권2호
• /
• pp.251-256
• /
• 2006

본 논문은 다단계, 다품종 조립라인을 고려한 모델이며 JIT 생산시스템에서의 최적의 발주량 계산을 목적으로 하고 있다. 제안 모델의 목적함수는 재고비와 setup 비의 합이 최소화되도록 설계되어 있다. 이는 대부분의 자동차 부품회사의 경우 setup 공정을 포함하고 있기 때문이다. 마지막으로 수치실험을 통해 제안 모델의 유효성을 보여 주고 있다.

• International Journal of Reliability and Applications
• /
• 제16권1호
• /
• pp.27-34
• /
• 2015

Based on increasing concave ordering a new class of life distribution is introduced. The new class of life distribution is named used better than aged in increasing concave ordering and is denoted by UBAC(2). The implication of our proposed class of life distribution with other classes is given. The properties of UBAC(2) under convolution, discrete mixture and formation of a coherent system are studied. Finally a characterization of the proposed class of life distributions by Laplace transform is discussed.