• 산업경영시스템학회지
• /
• 제19권38호
• /
• pp.131-138
• /
• 1996

In real world, the organization has multiple objects. Inorder to solve the multiple objects, we present the goal programming for solving project selection problem we also developed expert system which is focused on function of analysis. User which doesn't have knowledge of goal programming can solve the project selection problem and get a result of analysis.

• 한국경영과학회지
• /
• 제18권2호
• /
• pp.131-145
• /
• 1993

This paper deals with scheduling problem of the chemical process system where aircraft parts go through a given sequence of tanks filled with chemical solutions. The system has two hoists which move carriers holding the parts between tanks. A mixed integer programming model is developed from which a maximum throughput schedule can be found for the hoist movements. To show the validity of the model, a real world problem is solved and the results are compared with those with an existing approach.

• 한국컴퓨터정보학회논문지
• /
• 제24권9호
• /
• pp.9-20
• /
• 2019

In this paper, we study the university timetabling problem, which consists of two subproblems, the university course timetabling problem and the examination timetabling problem. Given a set of classrooms, students, teachers, and lectures, the problem is to assign a number of courses (and examinations) to suitable timeslots and classrooms while satisfying the given set of constraints. We discuss the modeling and solution approaches to construct course and examination timetables for one of the largest Korean university. By using binary integer programming formulations, we describe these two complex real-world problems. Then, we propose a solution method, called NOGOOD, to solve the examination timetabling model. The computation results show that NOGOOD finds the optimal examination schedule for the given instance. Although we consider a specific instance of the university timetabling problem, the methods we use can be applicable to modeling and solving other timetabling problems.

• 한국게임학회 논문지
• /
• 제20권2호
• /
• pp.183-192
• /
• 2020

컴퓨터 그래픽스 기술의 발달과 정보통신 기술의 발달로 증강현실 기술의 많은 발전이 이루어졌다. 하지만 가상의 공간과 실제의 공간이 매칭이 된 이미지를 보면 아직 현실감은 다소 떨어진다. 본 연구에서는 문제의 원인을 가상의 오브젝트가 실제 공간에서의 깊이 감을 고려하지 않고 형성되어 공간감을 파괴시키는 문제와 마커에 의존한 인식 기술의 한계성 두 가지로 설정하고 해결하였다. 공간감은 사람의 신체와 가상의 오브젝트 사이의 위계질서를 형성함으로써, 마커 기술의 한계성은 시간 지연과 카메라 움직임에 따라 마커의 위치를 역으로 추적하는 방식으로 문제를 해결하였다.

• 대한수학교육학회지:수학교육학연구
• /
• 제15권1호
• /
• pp.1-19
• /
• 2005

학생들이 수학을 추상적인 교과로 인식하여 학습에 흥미를 잃거나 실세계 문제를 해결하는 능력이 부족하다는 점이 문제시되어 왔다. 이에 본 연구에서는 사례연구 방법으로 학생들이 모델링 활동을 하는 과정에서 개발하는 모델이 구체와 추상을 연결하는 중재 기능을 할 수 있는지를 조사하였다. 연구결과, 학생들이 개발하는 모델은 탈맥락화 된 추상적 실체라기보다는 구체와 추상이 연결된 관계 망인 상황화된 추상의 영역에 위치하고 있었다. 그러므로 이 모델은 구체와 추상을 연결하는 중재기능을 할 수 있고, 학생들의 모델링 경험이 실세계 문제를 해결하는 능력을 향상시킬 수 있다고 볼 수 있다.

• Journal of Computing Science and Engineering
• /
• 제5권3호
• /
• pp.197-209
• /
• 2011

The increasing popularity of graph data, such as social and online communities, has initiated a prolific research area in knowledge discovery and data mining. As more real-world graphs are released publicly, there is growing concern about privacy breaching for the entities involved. An adversary may reveal identities of individuals in a published graph, with the topological structure and/or basic graph properties as background knowledge. Many previous studies addressing such attacks as identity disclosure, however, concentrate on preserving privacy in simple graph data only. In this paper, we consider the identity disclosure problem in weighted graphs. The motivation is that, a weighted graph can introduce much more unique information than its simple version, which makes the disclosure easier. We first formalize a general anonymization model to deal with weight-based attacks. Then two concrete attacks are discussed based on weight properties of a graph, including the sum and the set of adjacent weights for each vertex. We also propose a complete solution for the weight anonymization problem to prevent a graph from both attacks. In addition, we also investigate the impact of the proposed methods on community detection, a very popular application in the graph mining field. Our approaches are efficient and practical, and have been validated by extensive experiments on both synthetic and real-world datasets.

• International Journal of Computer Science & Network Security
• /
• 제21권1호
• /
• pp.220-225
• /
• 2021

Human population growth rate is an important parameter for real-world planning. Common approaches rely upon fixed parameters like human population, mortality rate, fertility rate, which is collected historically to determine the region's population growth rate. Literature does not provide a solution for areas with no historical knowledge. In such areas, machine learning can solve the problem, but a multitude of machine learning algorithm makes it difficult to determine the best approach. Further, the missing feature is a common real-world problem. Thus, it is essential to compare and select the machine learning techniques which provide the best and most robust in the presence of missing features. This study compares 17 machine learning techniques (base learners and ensemble learners) performance in predicting the human population growth rate of the country. Among the 17 machine learning techniques, random forest outperformed all the other techniques both in predictive performance and robustness towards missing features. Thus, the study successfully demonstrates and compares machine learning techniques to predict the human population growth rate in settings where historical data and feature information is not available. Further, the study provides the best machine learning algorithm for performing population growth rate prediction.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.519-522
• /
• 1998

The Constructive Battle simulation Model is very important to the recent military training for the substitution of the field training. However, real battlefield systems operate under rea-time conditions, they are inherently distributed, concurrent and dynamic. In order to reflect these properties by the computer-based simulation systems which represent real world processes, we have been developing constructive simulation model for several years. The constructive simulation system is one of the famous real-time system software, nd the one common feature of all real-time systems is defined as the correctness of the system depend not only on the logical result of computation, but also on the time at which the results are produced. Conventionally, scheduling and resource allocation activities which have timing constraints are major problem of real-time computing systems. To overcome these constraints, we elaborated on these issues and developed the simulation system on commercially available hardware and operating system with lock-free resource allocation scheme and rae monotonic scheduling.

• Journal of Computational Design and Engineering
• /
• 제3권4호
• /
• pp.295-311
• /
• 2016

This paper addresses to the flowshop scheduling problem with blocking constraints. The objective is to minimize the makespan criterion. We propose a hybrid combinatorial particle swarm optimization algorithm (HCPSO) as a resolution technique for solving this problem. At the initialization, different priority rules are exploited. Experimental study and statistical analysis were performed to select the most adapted one for this problem. Then, the swarm behavior is tested for solving a combinatorial optimization problem such as a sequencing problem under constraints. Finally, an iterated local search algorithm based on probabilistic perturbation is sequentially introduced to the particle swarm optimization algorithm for improving the quality of solution. The computational results show that our approach is able to improve several best known solutions of the literature. In fact, 76 solutions among 120 were improved. Moreover, HCPSO outperforms the compared methods in terms of quality of solutions in short time requirements. Also, the performance of the proposed approach is evaluated according to a real-world industrial problem.

• 경영과학
• /
• 제19권1호
• /
• pp.55-66
• /
• 2002

Given a directed network, a designated arc, and lowers and upper bounds for the distance of each arc, the preprocessing shortest path problem Is a decision problem that decides whether there is some choice of distance vector such that the distance of each arc honors the given lower and upper bound restriction, and such that the designated arc is on some shortest path from a source node to a destination notre with respect to the chosen distance vector. The preprocessing shortest path problem has many real world applications such as communication and transportation network management and the problem is known to be NP-complete. In this paper, we develop an algorithm that solves the problem using the structural properties of shortest paths.