• Proceedings of the Korean Institute of Surface Engineering Conference
• /
• 2017.05a
• /
• pp.168.2-168.2
• /
• 2017

발열체는 전기 에너지를 열 에너지로 변환시키는 전기 저항체인데, Ni-Cr계 합금이 발열 가능 온도가 범위가 크고 열 효율 및 내 산화성, 내 부식성이 우수하여 발열체로 많이 사용되고 있다. 그리고 기존의 선형 발열체의 효율성을 개선한 면상 발열체가 개발되었고, 최근 나노 기술의 발달로 나노크기의 ITO(Indium Tin Oxide) 입자나 탄소나노튜브가 코팅된 형태의 투명 면상 발열체가 개발되어 주목을 받고 있다. 투명 면상 발열체는 발열체의 형태를 거시적으로 확인할 수 없기 때문에 자동차의 전면 유리 히터 및 건축용 기능성 창호 등의 심미적 효과를 요구하는 제품에 사용될 수 있다. 본 연구에서는 PVP(Poly vinyl Pirrolidone)을 이용하여 Ni-Cr Nanofiber 제조를 위한 효율적인 전기 방사 조건을 도출한다. PVP 질량에 따라서 Ethanol과 Methanol, 물을 이용하여 viscosity와 ion conduciviy를 조절하였고, 전기방사 조건으로 bead를 최소화 하는 나노섬유를 얻었다. 이어서 Ni-Cr/PVP 용액은 Metal Precursor wt.% 조절 및 방사조건으로 100~300nm의 직경을 가진 나노 섬유를 얻을 수 있었다. 산화/환원 열처리 후 PVP와 Oxide가 제거된 Ni-Cr nanofiber를 합성하였다. Nanofiber 형상은 FE-SEM으로 측정하였으며, XRD, FT-IR 분석을 통해 제작된 나노 섬유의 구조적 특성을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.9
• /
• pp.1395-1403
• /
• 1993

Protocol conformance is crucial to inter-operability and cost effective computer communication. Given a protocol specification, the task of checking whether an inplementation conforms to the specification is called conformance testing. The efficiency and fault coverage of conformance testing are largely dependent on how test cases are chosen. Some states may have more one UIO sequence when the protocol is represented by FSM (Finite State Machine). The length of test sequence can be minimized if the optimal test sequences are chosen. In this paper, we construct the depth-tree to find the maximum overlapping among the test sequence. By using the resulting depth-tree, we generate the minimum-length test sequence. We show the example of the minimum-length test sequence obtained by using the resulting depth-tree.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.5
• /
• pp.45-52
• /
• 2015

The read performance of hybrid hard disk is better than the legacy hard disk and power consumption is also considerably low. As blocks with enough localities may be located in the non-volatile cache whose size is generally limited, an effective block replacement scheme is required. As this replacement is inevitably affected by various parameters, we define this issue as a kind of multiple criteria decision model. To solve this problem, this paper suggests a new block replacement algorithm based on the analytic hierarchy process. Through simulation for our model, we confirmed that the proposed model could be used as a replacement algorithm of the hybrid hard disk as it may improve boot time as well as response time of general applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.24-32
• /
• 2001

Recently, in the case that provides electronic services using Internet, we need the non-repudiation service that supplies a technological evidence about actions between a sender and a receiver that violate the promised protocol. Also, this service offers legal evidences while producing controversy. In this paper, we propose a protocol that improves the efficiency and offers the fairness of non-repudiation service by the extension of ability of TTP (Trusted Third Party). The proposed protocol adds a Time Check function and an Alert Message to extend the ability of TTP. Through the computer simulation, we prove that the proposed protocol has better efficiency than previous protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10A
• /
• pp.956-963
• /
• 2008

In a multi-hop wireless ad hoc network broadcasting is an elementary operation to support route discovery, address resolution and other application tasks. Broadcasting by flooding may cause serious redundancy, contention, and collision in the network which is referred to as the broadcast storm problem. Many broadcasting schemes have been proposed to give better performance than simple flooding in wireless ad hoc network. How to decide whether re-broadcast or not also poses a dilemma between reachability and efficiency under different host densities. In this paper, we propose enhanced broadcasting schemes, which can reduce re-broadcast packets without loss of reachability. Simulation results show that proposed schemes can offer better reachability as well as efficiency as compared to other previous schemes.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.14 no.3
• /
• pp.361-369
• /
• 2001

This paper deals with numerical efficiency of nonlinear solution technique for space trusses. It will propose the combined Arc-length method to trace structural behavior after reaching buckling load as opposed to the current Arch-length method. The combined Arc-length method uses the current stiffness parameter as a control variable. It uses Secant-Newton method in stable path and applies Arc-length method in unstable path. To evaluate efficiency of solution technique, the accuracy of solution, convergence, and computing time concerning illustrative numerical examples are compared with the current Arc-length method. It show that the combined Arc-length method, as proposed in this paper, is superior to the current Arc-length method in numerical nonlinear analysis.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.3
• /
• pp.78-92
• /
• 1999

In mobile computing environments, to efficiently use the narrow bandwidth of wireless networks a mobile host caches the data that are frequently accessed. To guarantee the correctness of the mobile transaction, the data cached in a mobile host must be consistent with the data in a server. This paper proposes a new strategy which maintains cache consistency efficiently when the data cached in a mobile host are inconsistent with the data in a server by the mobility of the mobile host at the asynchronous mobile environment. In this strategy, the size of the invalidation message is relatively small and is independent of the number of data to be invalidated under conditions of variable update rates/patterns. So this strategy uses the narrow bandwidth of wireless networks efficiently and reduces the communication cost.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.443-448
• /
• 2005

Efficient using of the web cache is becoming important factors that decide system management efficiency in the web base system. The cache performance depends heavily on the replacement algorithm which dynamically selects a suitable subset of objects for caching in a finite cache space. In this paper, the web caching algorithm is proposed for the efficient operation of the web base system. The algorithm is designed based on a divided scope that considered size reference characteristic and heterogeneity on web object. With the experiment environment, the algorithm is compared with conservative replacement algorithms, we have confirmed more than $15\%$ of an performance improvement.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.590-592
• /
• 2003

최근 XML이 웹 상의 데이터의 표현, 교환, 중재의 표준으로 각광받으면서 이러한 XML 문서를 효과적으로 저장, 접근 및 검색하기 위한 기법에 대한 연구가 많았으나, 기존의 연구들은 하나의 XML 문서를 저장 및 검색의 대상으로 하는 경우가 대부분이였다. 그러나 XML 문서를 데이터의 표현과 교환의 표준으로 이용하는 애플리케이션의 개발이 점차 활성화됨에 따라 저장해야하는 XML 문서의 수가 크게 증가하면서 의미나 구조적으로 많은 유사성을 지니는 XML 문서들을 함께 효율적으로 저장하고 검색하기 위한 기법의 연구가 요구된다. 따라서 본 논문에서는 의미 및 구조적으로 유사성을 가지는 여러 XML 문서들을 통합하는 기법을 제안한다. 제안된 통합 기법은 같은 DTD나 XML Schema를 가지는 경우와 다른 DTD나 XML Schema를 가지는 경우를 모두 고려한다. 또한 특별한 구조적 정보를 가지지 않는 XML 문서의 경우도 다른 DTD나 XML Schema를 가지는 경우와 마찬가지로 처리함으로써 다양한 XML 문서들에 대한 통합이 가능하도록 한다. 이러한 통합 기법은 중복되는 엘리먼트나 애트리뷰트에 대한 저장 공간의 낭비를 최소화한다. 또한 의미적으로 또는 구조적으로 관련성있는 여러 XML 문서의 부분들을 디스크 상의 페이지내에 서로 가까이 저장할 수 있기 때문에 사용자의 일반적인 질의에 대해 효율적이고 빠른 검색 결과를 유도할 수 있고, I/O 횟수를 줄임으로써 그에 따른 오버헤드를 줄일 수 있는 장점이 있다.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.120-127
• /
• 2002

The common problems found in the data mining methods current in use have following problems. First: It is ineffective in searching for frequent items due to changing of minimal support values. Second: It is not adaptable to occurring of unuseful relation rules. Third: It is very difficult to re-use preceding results while adding new transactions. In this paper, we introduce a new method named as SPM-IRG(Selective Patters Mining using item Relation Graph), that is designed to solve above listed problems. SPM-IRG method creates a frequent items using minimal support values obtained by investigating direct or indirect relation of all items in transaction. Moreover, the new method can minimize inefficiency of existing method by constructing frequent items using only the items that we are interested.