• Journal of the Korean Society for information Management
• /
• v.31 no.1
• /
• pp.189-206
• /
• 2014

The purposes of this study are to analyze relevance judgement of college students' problem solving process and suggest improvements for information literacy education in higher education. The in-depth interviews were conducted with 9 subjects to identify relevance judgement processes and problems. As a result, the main problems during relevance judgement processes were judgement about content of document aligned with subject's opinion, judgement about reliability of newspaper articles, shortage of relevance judgement time due to deadline of an assignment and judgement of relationship of documents and evaluation result. The recommendations for information literacy education are as follows: objective relevance judgement education, guidance of reliable information source;showing guideline of using reference information by professor and emphasis of engaging in information (4.1 stage of Big 6).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1802-1807
• /
• 2015

The cloud computing service provides physical IT resources to VM instances to users using virtual technique and the users pay cost of VM instances to service provider. The auction model based on cloud computing provides available resources of service provider to users through auction mechanism. The users bid spot instances to process their a job until its deadline time. If the bidding price of users is higher than the spot price, the user will be provided the spot instances by service provider. In this paper, we propose a new bidding strategy to minimize the total cost for job completion. Typically, the users propose bidding price as high as possible to get the spot instances and the spot price get high. we lower the spot price using proposed strategy and minimize the total cost for job completion. To evaluate the performance of our strategy, we compare the spot price and the total cost for job completion with real workload data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.11
• /
• pp.2665-2670
• /
• 2015

VANET is ad-hoc network in which vehicles are treated as node and these nodes are communicating with each other as well as RSUs on the road. In VANET, scheduling is a very important issue as the request data are to be delivered to the recipient vehicle properly and accurately. It is also critical that any request data which is sent to the vehicle is received by it in the time period for which the vehicle will be in range of RSU. RSU picks the one with the highest priority to serve based on the scheduling scheme. In this paper, we propose a scheduling algorithm to select the one with the highest priority in RSU, in which an RSU can transfer the overload requests to other RSUs. We use the modified DBP scheme to calculate the priority of request data. Simulation results show that our scheme outperforms other scheduling schemes under various conditions.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.11
• /
• pp.561-572
• /
• 2001

Since energy consumption of CMOS circuits has a quadratic dependency on the supply voltage, lowering the supply voltage is the most effective way of reducing energy consumption. We propose an intra-task voltage scheduling algorithm for low-energy hard real-time applications. Based on a static timing analysis technique, the proposed algorithm controls the supply voltage within an individual task boundary. By fully exploiting all the slack times, as scheduled program by the proposed algorithm always complete its execution near the deadline, thus achieving a high energy reduction ratio. In order to validate the effectiveness of the proposed algorithm, we built a software tool that automatically converts a DVS-unaware program into an equivalent low-energy program. Experimental results show that the low-energy version of an MPEG-4 encoder/decoder (converted by the software tool) consumes less than 7~25% of the original program running on a fixed-voltage system with a power-down mode.

• Asia-Pacific Journal of Business
• /
• v.11 no.3
• /
• pp.169-184
• /
• 2020

Purpose - This research is intended to analyze the current status and problems of tax benefits in the R&D sector and suggest ways to improve tax credit for research and manpower development expenses when various countries fiercely develop efforts to enhance national competitiveness through increased investment in R&D Design/methodology/approach - This study will examine the current status of the tax support system for domestic and foreign R&D, and suggest improvement measures to expand research and development activities in the future. Findings - First, a plan may be considered to abolish and perpetuate the sunset deadline for tax credit for research and manpower development expenses as in the case of the United States and Japan. This perpetuation can be a proactive measure to actively support long-term R & D investment in companies facing economic decisions under uncertainty. Second, it should be revised to raise the tax credit rate of large corporations, which are shrinking every year, compared to SMEs, so that both large corporations and SMEs can improve their international competitiveness and secure excellent technologies through R & D. Finally, the target technologies for each new growth engine and source technology should be expanded to various fields, including national cybersecurity enhancement technology, aviation engine technology, carbon emission and global cooling technologies, which are areas of interest in major overseas R&D countries, to help active R&D and investment in these areas. Research implications or Originality - This study can find a contribution in comparing and analyzing the national R&D tax support system and presenting improvement measures at a time when the benefits of tax credit for research and manpower development expenses of large companies are decreasing due to frequent tax law revisions and the government's factors of increasing tax revenues. In addition, recent research and development items and research technologies of foreign countries were analyzed by Nature's top 10 major science and technology issues, and advanced technologies that should be applied to target technology areas by new growth engine and source technology were specifically investigated and presented.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.11
• /
• pp.1655-1662
• /
• 2021

The purpose of this study is to draw implications through a case study on the curriculum operation of a professor who operated a programming subject as a PBL(project-based learning) method in an untact situation due to COVID-19. A survey was conducted for first-year freshmen students to determine their learning condition before project implementation. Based on the results of the questionnaire, individual interviews were conducted to identify the needs for education, and then, basic grammar for project completion and lectures that segmenting each stage of the project were composed. Repeated learning was induced through weekly quizzes, and feedback was given by giving time in advance until the project deadline. 23 students (40 students in total) completed the project. The remaining 17 students took the exam but did not complete the project. The purpose of this study is significant in that it investigated whether a project can be carried out through instructional design, execution, and interaction while operating a programming subject through PBL in the COVID-19 environment.

• Journal of Korea Multimedia Society
• /
• v.5 no.4
• /
• pp.372-385
• /
• 2002

In this paper, we propose an efficient buffer replacement method for the real-time multimedia data. The proposed method has multi level priority to consider the real-time characteristics. Each priority level is divided into a cold data set that is likely to be referenced for the first time and a hot data set that is likely to be re-referenced. An operation to select the victim data is sequentially executed from the cold set with the minimum priority level to the hot set with the maximum Priority level. It is chosen only at the lower level than or equal to the priority of the transaction that requests a buffer allocation. In the cold set, our method selects a media that has the maximum size in the level for a target of victim first of all. And in the hot set, our method selects a medium that has the maximum interval of the reference first of all. Since it maintains many popular media in the limited buffer space, the buffer hit ratio is increased. It also manages many service requests. As a result, our method improves the overall performance of the system. We compare the proposed method with the Priority-Hints method in terms of the buffer hit ratio and the deadline missing ratio of transactions. It is shown through the performance evaluation that our method outperforms the existing methods.

• Journal of KIISE:Databases
• /
• v.29 no.4
• /
• pp.297-310
• /
• 2002

The 2PL-HP(Two Phase Locking with High Priority) method has been used to guarantee preceding process of a high priority transaction(HPT) in real-time database systems. The method resolves a conflict through aborting or blocking of a low priority transaction(LPT). However, if HPT is eliminated in a system because of its deadline missing, an unnecessary aborting or blocking of LPT is occurred. Recently, to resolve the problem, a concurrency control algorithm using alternative version was proposed. However, the algorithm must always create the alternative version and needs an addtional technique to manage complex alternative versions. In this paper, we propose an efficient concurrency control algorithm that prevents needless wastes of resources and eliminates unnecessary aborting or blocking of LTP. And it is shown through the performance evaluation that the proposed concurrency control algorithm outperforms the existing concurrency control algorithm using alternative version.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.307-318
• /
• 2003

In this paper, we design and construct a TMO object group that provides the guaranteed real-time services in the distributed object computing environments, and verify execution power of its model for the correct distributed real-time services. The TMO object group we suggested is based on TINA's object group concept. This model consists of TMO objects having real-time properties and some components that support the object management service and the real-time scheduling service in the TMO object group. Also TMO objects can be duplicated or non-duplicated on distributed systems. Our model can execute the guaranteed distributed real-time service on COTS middlewares without restricting the specially ORB or the of operating system. For achieving goals of our model. we defined the concepts of the TMO object and the structure of the TMO object group. Also we designed and implemented the functions and interactions of components in the object group. The TMO object group includes the Dynamic Binder object and the Scheduler object for supporting the object management service and the real-time scheduling service, respectively The Dynamic Binder object supports the dynamic binding service that selects the appropriate one out of the duplicated TMO objects for the clients'request. And the Scheduler object supports the real-time scheduling service that determines the priority of tasks executed by an arbitrary TMO object for the clients'service requests. And then, in order to verify the executions of our model, we implemented the Dynamic Binder object and the Scheduler object adopting the binding priority algorithm for the dynamic binding service and the EDF algorithm for the real-time scheduling service from extending the existing known algorithms. Finally, from the numerical analyzed results we are shown, we verified whether our TMO object group model could support dynamic binding service for duplicated or non-duplicated TMO objects, also real-time scheduling service for an arbitrary TMO object requested from clients.

• Journal of Intelligence and Information Systems
• /
• v.27 no.1
• /
• pp.177-190
• /
• 2021

Due to the development of the fourth industrial revolution technology, efforts are being made to improve areas that humans cannot handle by utilizing artificial intelligence techniques such as machine learning. Although on-demand production companies also want to reduce corporate risks such as delays in delivery by predicting total production time for orders, they are having difficulty predicting this because the total production time is all different for each order. The Theory of Constraints (TOC) theory was developed to find the least efficient areas to increase order throughput and reduce order total cost, but failed to provide a forecast of total production time. Order production varies from order to order due to various customer needs, so the total production time of individual orders can be measured postmortem, but it is difficult to predict in advance. The total measured production time of existing orders is also different, which has limitations that cannot be used as standard time. As a result, experienced managers rely on persimmons rather than on the use of the system, while inexperienced managers use simple management indicators (e.g., 60 days total production time for raw materials, 90 days total production time for steel plates, etc.). Too fast work instructions based on imperfections or indicators cause congestion, which leads to productivity degradation, and too late leads to increased production costs or failure to meet delivery dates due to emergency processing. Failure to meet the deadline will result in compensation for delayed compensation or adversely affect business and collection sectors. In this study, to address these problems, an entity that operates an order production system seeks to find a machine learning model that estimates the total production time of new orders. It uses orders, production, and process performance for materials used for machine learning. We compared and analyzed OLS, GLM Gamma, Extra Trees, and Random Forest algorithms as the best algorithms for estimating total production time and present the results.