• Journal of Internet Computing and Services
• /
• v.8 no.6
• /
• pp.75-85
• /
• 2007

One of important factors for improving the learning achievement of students in computer programming education is to provide plenty of opportunities of problem-solving experiences through variety forms of assignments, However, for the most cases, evaluation of programming assignments is performed manually by instructors and automated tools for the accurate evaluation are not equipped at the present time. Under this restricted environment instructors need much work and time to grade assignments so that instructors could not deliver sufficient programming assignments to students, In order to overcome this problem. au automated programming assignment evaluation system is needed that would enable instructors to evaluate assignments easily in an effective and consistent way and also to detect any plagiarism activities among students in program source codes readily, Accordingly, in this paper we design and implement a Web-based programming assignment grading system that allows instructors to evaluate program performance automatically as well as to evaluate program styles and piagiarism easily with appropriate feedback.

• Journal of the military operations research society of Korea
• /
• v.26 no.1
• /
• pp.56-69
• /
• 2000

A frequency assignment problem on time division duplex system is considered. Republic of Korea Army (ROKA) has been establishing an infrastructure of tactical communication (SPIDER) system for next generation and it will be a core network structure of system. VHF system is the backbone network of SPIDER, that performs transmission of data such as voice, text and images. So, it is a significant problem finding the frequency assignment with no interference under very restricted resource environment. With a given arbitrary configuration of communications network, we find a feasible solution that guarantees communication without interference between sites and relay stations. We formulate a frequency assignment problem as an Integer Programming model, which has NP-hard complexity. To find the assignment results within a reasonable time, we take a genetic algorithm approach which represents the solution structure with available frequency order, and develop a genetic operation strategies. Computational result shows that the network configuration of SPIDER can be solved efficiently within a very short time.

• Journal of the Korean Institute of Navigation
• /
• v.13 no.3
• /
• pp.37-44
• /
• 1989

Recently recognize the labor productivity of port physical distribution system in the port and shipping areas, Much Efforts for evaluating this productivity has been made continuously. BUt still there is little study, so far, on a systematic research for the management of port labor gangs, and even those were mainly depended on a rule of thumb. Especially the object of this study is to introduce the method of optimal allocation and assignment for the labor gangs per pier unit in the multiple ships berthed at an arbitary pier or port. In case the multiple ships have a homogeneous cargoes or do not have sufficient labor gangs to be assigned. The problem of optimal allocation and assignment of the labor gangs to be i) formalized with multi-state decision process in form of difference equation as the pattern which converted the independent multiple ships into a single ship with the intra-multiple ships, and ii) the optimal size of labor gangs could be obtained through the simple mathematical method instead of complicated dynamic programming, and iii) In case of shortage of labor gangs available the evaluation function considering the labor gangs available and total shift times was introduced, and iv) the optimal allocation and assignment of labor gangs was dealt at the point of minimizing the summation of the total shift times and at the point of minimizing the total cost charged for the extra waiting time except PHI time during port times for the multiple ships combinations.

• Proceedings of the Korea Contents Association Conference
• /
• 2016.05a
• /
• pp.43-44
• /
• 2016

최근 국내외에서 프로그래밍 교육이 주목받고 있다. 그중 초보자를 위한 한글 프로그래밍 언어인 새싹은 소프트웨어 프로그래밍 교육에 적합한 언어이다. 하지만 새싹을 위한 과제 평가 시스템은 아직 개발되어 있지 않다. 이 논문에서는 새싹을 위한 과제 평가 시스템을 개발하고자 한다. 이를 위해 기존 과제 평가 시스템인 neoESPA를 수정하여 새싹을 지원하도록 한다. 그리고 새싹을 위한 과제 간의 표절 여부를 판단하는 도구를 개발하고 이를 neoESPA에 탑재하여 정당한 평가를 도와주는 과제 평가 시스템을 제안한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.2
• /
• pp.105-116
• /
• 2018

In this study, we consider the assembly line balancing (ALB) problem which is known as an very important decision dealing with the optimal design of assembly lines. We consider ALB problems with soft constraints which are expected to be fulfilled, however they are not necessarily to be satisfied always and they are difficult to be presented in exact quantitative forms. In previous studies, most researches have dealt with hard constraints which should be satisfied at all time in ALB problems. In this study, we modify the mixed integer programming model of the problem introduced in the existing study where the problem was first considered. Based on the modified model, we propose a new algorithm using the genetic algorithm (GA). In the algorithm, new features like, a mixed initial population selection method composed of the random selection method and the elite solutions of the simple ALB problem, a fitness evaluation method based on achievement ratio are applied. In addition, we select the genetic operators and parameters which are appropriate for the soft assignment constraints through the preliminary tests. From the results of the computational experiments, it is shown that the proposed algorithm generated the solutions with the high achievement ratio of the soft constraints.