• Journal of Korean Society for Quality Management
• /
• v.16 no.2
• /
• pp.48-55
• /
• 1988

There have been several papers to illustrate how an information system is used in an automated warehouse system. These papers, however. do not carefully address the role of warehouse planning/control systems nor do they recognize how to integrate the management planning/control systems, and automated warehouse system. This article addresses such issues and shows how a business computer system can be used to integrate and unify the warehouse planning/control systems and the automated warehouse system into it single and highly productive operating system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.96-98
• /
• 2000

현행 토지 지번 중심의 주소체계는 불규칙적인 지번의 배열으로 상호 연계성이 부족하여 사회적 비용이 발행, 이러한 문제 해결하고 국가경쟁력을 높이고자 선진국과 같은 체계적이고 합리적인 주소체계와 정확성, 일관성, 융통성, 경제성 등을 갖출 수 있는 도로방식에 의한 도로명과 건물번호를 체계적으로 부여하는 새로운 주소 체계를 도입하기로 하였다. 이에 본 논문에서는 새주소 사업에 있어 핵심이 되는 새주소 관리 시스템과 관리시스템의 부 시스템인 도로명판관리 시스템에 관하여 제시한다.

• Proceedings of the CALSEC Conference
• /
• 2001.02a
• /
• pp.499-520
• /
• 2001

◈ B2B e-commerce is set to grow significantly in the next 5 years ◈ There is a growing trend towards leveraging the information asset to win new business in the Maintenance, Repair and Overhaul (MRO) market ◈ After-market service is forecast to be a significant element of the B2B market ◈ Existing standards do not fully address the product support requirement ◈ PLCS standards will allow support information to be aligned with the changing product over its entire life cycle ◈ Adoption of PLCS standard will lead to reduced operating costs and increased product availability.(omitted)

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.120-122
• /
• 1998

본 논문에서는 토지지번 중심의 현행 주소체계를 도로 중심의 새로운 주소체계로 변환시키기 위해 시스템 설계의 기본원칙을 설정하고, 건물과 도로의 공간정보를 이용한 지리정보시스템(GIS)를 활용하여 신주소변환 시스템을 구현한다. 이는 도로중심선과 건물좌표의 직교점을 찾아 도로기점과의 거리에 따라 건물번호를 부여하고, 도로와 골목길에서의 건물번호를 서로 다른 방식으로 부여하여 차별화된 주소체계를 유도하였다. 특히, 도로내의 골목길은 네트워크로 구성된 위상관계를 가지도록 설계하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.11-19
• /
• 2013

Most modern computer systems employ cache systems in order to alleviate the access time gap between processor and memory system. The power dissipated by the cache systems becomes a significant part of the total power dissipated by whole microprocessor chip. Therefore, power reduction in the cache system becomes one of the important issues. Partial tag cache is the system for the least power consumption. The main power reduction for this method is due to the use of small partial tag matching, not full tag matching. In this paper, we first analyze the previous regular partial tag cache systems and propose a new address matching mechanism by using locality buffer and address compression. In simulation results, the proposed model shows 18% power reduction in average, still providing same performance level, compared to regular cache.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.71-79
• /
• 2006

Address lookup is an essential function in the Internet routers, and it determines overall router performance. In this paper, we have thoroughly investigated the binary-search-based address lookup algorithms and proposed a new algorithm based on binary search on prefix lengths. Most of the existing binary search schemes perform binary search on prefix values, and hence the lookup speed is proportional to the length of prefixes or the log function of the number of prefixes. The previous algorithm based on binary search on prefix lengths has superior lookup performance than others. However, the algorithm requires very complicated pre-computation of markers and best matching prefixes in internal nodes since naive binary search is not possible in their scheme. This complicated pre-computation makes the composition of the routing table and incremental update very difficult. By using leaf-pushing, the proposed algorithm in this paper removes the complicated pre-computation of the Previous work in performing the binary search on prefix lengths. The performance evaluation results show that the proposed scheme has very good performance in lookup speed compared with previous works.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.2
• /
• pp.95-103
• /
• 2006

IPv6 is a new version of the Internet protocol, designed as the successor to IPv4. Among the changes from IPv4 to IPv6, we focused on the stateless address auto-configuration mechanism. The address auto-configuration mechanism is used by nodes in an IPv6 network to learn the local topology. The current specifications suggest that IPsec AH may be used to secure the mechanism, but there is no security association during address auto-configuration process because it has no initial IP address. As there are so many suity threats, SEND protocol was designed to counter these threats. In this paper we analyzed the security problems in NDP and SEND protocol. So we proposed the Modified NDP mechanism using PKC and AC in order to solve these problems.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2320-2331
• /
• 1999

Over the Internet, in order to utilize a collection of idle computers as a parallel computing platform, we propose a new scheme called GICE(Global Internet Computing Environment). GICE is motivated to obtain high programmability, efficient support for heterogeneous computing resources, system scalability, and finally high performance. The programming model of GICE is based on a single address space. GICE is featured with a Java based programming environment, a dynamic resource management scheme, and efficient parallel task scheduling and execution mechanisms. Based on a prototype implementation of GICE, we address the concept, feasibility, complexity and performance of Internet computing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.1
• /
• pp.114-123
• /
• 2007

As a promising technology that enables ubiquitous computing and will lead the information technology industries of the next generation, the new field of sensor networks is one of the most active research topics today. From now on, each node, the network formation, and even the sensor network itself will interact with the generic network and evolve dynamically according to environmental changes, in a process of continual creation and extinction. In this paper, we propose a address-Internetworking scheme for interactive networking between a sensor network and the Internet based on the TCP port-numbers. The proposed scheme enables internetworking between a sensor network address scheme based on Zigbee and the Internet address scheme based on the Internet Protocol version 6 (IPv6). We implement the proposed address-Internetworking scheme using Berkeley TinyOS, Mica Motes, and IP. In addition we verify the proposed scheme by an interconnection experiment, which involves wireless sensor networks and the Internet, using IPv4/IPv6.

• The Journal of Information Technology and Database
• /
• v.6 no.1
• /
• pp.103-114
• /
• 1999

Marketing decision support systems rely on an underlying enterprise information infrastructure. In traditional business situations, a limited number of product lines and markets divided into large chunks were adequately served by existing management information systems. With the advent of an increasingly segmented focus on niche markets and individual customers, the demand for market information has grown exponentially. The practical solutions offered by such data warehousing tools as OLAP and data mining directly address this need, allowing organizations to discover new niches. Marketing decision support systems built on these foundations provide organizations with new avenues for creating specifically targeted marketing strategies and promotional campaigns. The contribution of this article lies in introducing a graphical framework for data warehousing applications. Based on prior research, the framework links data warehousing and database marketing. To illustrate the effectiveness of this approach, three case examples of successful database marketing conclude the paper.