• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.616-618
• /
• 2017

최근 여유로운 삶을 추구하는 사람들이 늘어나면서 여가생활, 문화생활에 대한 관심이 높아지고 있다. 그러나 사용자의 정해진 일정 사이의 자투리 시간에 즐길 수 있는 문화콘텐츠를 찾기 위해서는 일일이 공연, 전시, 관람 등의 일정을 확인해야 하는데, 이 일이 번거로워 문화생활을 즐기는 것을 포기하는 경우가 많다. 본 논문에서는 문화데이터 API를 활용하여 사용자의 일정에 맞춰 이용할 수 있는 문화데이터를 추천해주는 캘린더의 개발내용에 대하여 기술한다. 본 캘린더를 활용함으로써 사용자들이 자투리시간을 이용하여 문화생활을 즐길 수 있고, 다양한 문화생활을 즐기면서 여가시간을 보다 효율적으로 사용할 수 있다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.713-716
• /
• 2001

This paper describes Direct load control(DLC) method including unit commitment. To consider the unit commitment on DLC, 3-Dimensional dynamic programming as a new unit commitment method is developed. And, this method is applied to DLC. As result, optimization of operating schedule with DLC is possible. This method is applied to the test system, and usefulness of the method is verified.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.382-389
• /
• 1995

In this paper, we propose an efficient transmission schedule which can be used in indoor wireless LAN. It reduces considerably the time delay and increases the throughput by reusing the bandwidth. We describe the architecture of the wireless LAN, the algorithm of step-by-step allocation of time slot reusing the resource and the results of the computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.5 no.1
• /
• pp.83-87
• /
• 1980

The distributive processing job in a hierarchical computer network, which supervises and controls the complex relations between the variables periodically for raising the fault folerance, can be defined its periodicity and its execution time. All the job may be composed of the subsets in relation of Tree structure. For a processor job set this paper finds out a job scheduling algorithm that has the less loose time between period than that of FCFS.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2013.05a
• /
• pp.160-161
• /
• 2013

Progress measurement is one of key tasks for cost and schedule management in construction management. However, there has been shortage of effort to implement for automated progress measurement. This paper proposes to use a face recognition (FR) technology for automated progress measurement and management in construction sites. The FR technology can acquire detailed progress data that includes the in and out information of labors by location. The expected effectiveness of the proposed system is to provide accurate labor information for progress measurement by utilizing automated data acquisition technology (DAT) with high-speed reading face. In addition, it could be applied to real-time safety and quality management by using the camera images.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.9 no.1
• /
• pp.7-12
• /
• 2010

In this paper, we propose a new prioritized Optical Burst Switching (OBS) protocol based on a hop count, which can provide an efficient utilization in optical Wireless networks. Under several legacy schemes, a switch drops the burst with a shorter time among ones regardless of its traversed hop counts. As a result, the dropped burst that have been traversed more hops might cause to waste bandwidth than the one traversed a few hops. Noting that this problem, we propose the Just Enough Time (JET) with a hop count scheme which can reduce the wasted bandwidth by prioritizing the burst traversed more hops over others. From the simulation result, we show that the proposed scheme is advantageous over the legacy schemes in terms of the burst blocking probability and the link utilization.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06b
• /
• pp.103-105
• /
• 2006

일정관리는 업무 능률을 높이기 위해 일정의 작성, 변경, 조정을 하는 것으로 체계적인 관리를 위해서는 많은 시간과 노력이 필요하다. 일정관리를 대행해주는 지능형 에이전트가 존재한다면 개인의 시간 관리에 많은 도움이 된다. 이미 Calendar Manager, Office Tracker, MS Out look 등의 많은 응용 어플리케이션이 개발되었으나, 이들은 사용자의 성향을 학습하지 않고 수동적인 관리만 하므로 일정관리에 있어서 큰 도움을 주지 못한다. 본 논문에서는 베이지안 네트워크를 이용하여 실시간으로 사용자의 행동 패턴을 모델링하는 사용자 적응적인 지능형 일정관리 에이전트를 제안하고, 정성 정량적 실험을 통해 제안하는 방법의 유용성을 보인다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3055-3063
• /
• 2000

In this paper, a task duplication based heuristic scheduling algorithm is proposed to solve the problem of task scheduling on Shared Memory Multiporcessors (SMM). The proposed algorithm pre-allocates network resources so as to avoid potential communication conlhct, and the algorithm uses heuristies to select duplication tasks so as to recuce of a multiprocessors, and generates scheduling accorting to the available number of processors ina system. The proposed algorithm has been applied to some practical task graphs in the simulation, and the results show that the proposed algorithm achieves considerable performance improvement, in respect of schedule length.

• Journal of Sensor Science and Technology
• /
• v.24 no.2
• /
• pp.107-112
• /
• 2015

HIGHT is an 64-bit block cipher, which is suitable for low power and ultra-light implementation that are used in the network that needs the consideration of security aspects. This paper presents a parallel key scheduler that generates the whitening keys and subkeys simultaneously for both encryption and decryption processes. We construct the reverse LFSR and key generation blocks to generate the keys for decryption process. Then, the new key scheduler is made by sharing the common logics for encryption and decryption processes to minimize the increase in hardware complexity. From the simulation results, the logic size is increased 1.31 times compared to the conventional HIGHT. However, the performance of HIGHT including the proposed key scheduler can be increased by two times compared to the conventional counterpart.

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

This paper focuses on production planning and scheduling problems in an assembly system operating on a make-to-order basis. Due dates are considered as constraints in the problems, that is, tardiness is not allowed. Since the planning problem is a higher-level decision making than the scheduling problem, the scheduling problem is solved using a production plan obtained by solving the planning problem. We suggest heuristic procedures in which aggregated information is used when the production planning problem is solved while more detailed information is used when the scheduling problem is solved. Since a feasible schedule may not be obtained from a production plan, an iterative approach is employed in the two procedures to obtain a solution that is feasible for both the production planning and scheduling problems. Computational tests on randomly generated test problems are done to show the performance of these algorithms, and results are reported.