• 대한산업공학회지
• /
• 제13권1호
• /
• pp.53-60
• /
• 1987

Karmakar suggested two methods to transform the general linear programming into his specially structured linear programming problem. We show that there are bad cases that cause difficulties in the use of Karmakar's methods. We also develop a new transformation method which can handle those difficulties.

• 정보교육학회논문지
• /
• 제20권5호
• /
• pp.465-474
• /
• 2016

본 연구는 초등학생을 대상으로 PBL 기반의 프로그래밍 학습 과정에서 구조화된 성찰일지 작성 활동이 논리적 사고력에 미치는 영향을 분석하기 위해 성찰일지 작성 전후 논리적 사고력의 차이를 비교하여 효과를 분석하였다. 연구를 위해 초등학교 5학년 59명 학생들을 대상으로 실험집단과 통제집단을 구성하고 실험집단에는 PBL 기반의 프로그래밍 학습 단계별로 내용, 과정, 비판적 성찰일지 작성을 적용하였고 통제집단에는 PBL 기반의 프로그래밍 학습 단계별로 비구조화된 성찰일지 작성을 적용하였다. 연구 결과 실험집단의 구조화된 성찰일지 작성 전후의 논리적 사고력 차이를 공분산분석(ANCOVA)을 통해 분석한 결과 유의수준 .05에서 학습효과가 있음을 확인했고 통제집단과 논리적 사고력의 차이를 비교한 결과에서도 학습효과가 있음을 확인했다. 이를 통해 초등학교 5학년 학생을 대상으로 하는 PBL 기반의 프로그래밍 학습에서 구조화된 성찰일지 작성 학습자의 논리적 사고력 향상에 효과가 있음을 알 수 있었다.

• 한국통신학회논문지
• /
• 제23권9A호
• /
• pp.2313-2324
• /
• 1998

Although visual programming is used in many fields of computer science and engineering, some dis-advantages can be found when they work together in an integrated programming environment. To overcome these shortcomings, there have been researches in combining multiparadigm with visual programming. However they have failed because they tried to combine the paramdigms without any coceptural model and structured method. In this paper, we investigate a new multiparadigm visual programming environment (MVPE), in which dataflow paradigm, form-based paradign, direct manipulation paradigm, and object-oriented paradigm are integrated together in an object-oriented way, based on the conceptual model of "method = paradigm, " This MVPE would overcome the limits of visual programming, and may also lead to the new discipline of visual programming environment.vironment.

• ETRI Journal
• /
• 제31권2호
• /
• pp.121-128
• /
• 2009

In this paper, we describe a fixed-threshold sequential minimal optimization (FSMO) for structured SVM problems. FSMO is conceptually simple, easy to implement, and faster than the standard support vector machine (SVM) training algorithms for structured SVM problems. Because FSMO uses the fact that the formulation of structured SVM has no bias (that is, the threshold b is fixed at zero), FSMO breaks down the quadratic programming (QP) problems of structured SVM into a series of smallest QP problems, each involving only one variable. By involving only one variable, FSMO is advantageous in that each QP sub-problem does not need subset selection. For the various test sets, FSMO is as accurate as an existing structured SVM implementation (SVM-Struct) but is much faster on large data sets. The training time of FSMO empirically scales between O(n) and O($n^{1.2}$), while SVM-Struct scales between O($n^{1.5}$) and O($n^{1.8}$).

• 인터넷정보학회논문지
• /
• 제9권3호
• /
• pp.69-77
• /
• 2008

구조화 조명을 사용한 거리측정에 동적계획법을 적용함으로써 거리 측정의 정확성이 대폭 향상된 방법을 제안하였다. 구조화 조명을 사용한 거리 측정방법은 거리정보가 조명에 해당하는 화소의 위치에 의해 계산될 수 있다는 점을 이용한 것이다. 그러나, 이 구조화 조명 빛이 물체의 표면에서 흡수되거나 반사됨으로서 흐리거나 잘 보이지 않는 경우가 많다. 이 문제를 해결하기 위해서 본 연구에서는 동적계획법을 사용하였다. 동적 계획법을 위한 셀간 비용(cost)값은 화소 밝기 값의 역수를 사용하였으며, 상단과 하단에 각각 시작선 혹은 목표선을 설정하였다. 이 알고리즘의 장점은 동적 계획 법의 최적화 능력을 사용하므로, 구조화 조명선의 약한 흔적이나 부분적으로 절단된 조명선 위치도 잘 찾아낼 수 있다. 이 알고리즘을 사용하여 다양한 3 차원 물체를 복원한 실험 결과를 제시하였다.

• 한국경영과학회지
• /
• 제15권2호
• /
• pp.85-95
• /
• 1990

Structured modeling provides a formal mathematical framework, language, and computer-based environment for conceiving, representing, and manipulating a wide variety of model. It provides a natural framework for integrated modeling owing to its explicit representation power for computational dependencies among submodles. Nevertheless, it doesn't seem to offer a systematic way of composing a structured model from submodels. In order to develop a systematic way, this paper discusses three key issues : (1) Genus structure for model composition, (2) Storage of structured models, and (3) Integration of structured models. To formalize and visualize the approach, a programming module is developed to implemented the step-by-step integration.

• 한국컴퓨터정보학회논문지
• /
• 제23권9호
• /
• pp.163-169
• /
• 2018

Problem solving by programming has a lot of influence on computational thinking improvement. Programming learning has been self-directed based on the individual's thoughts and principles. However, the revised informatics curriculum in 2015 puts importance on collaborative learning. Collaborative learning emphasizes results differently from cooperative learning, which emphasizes problem-solving processes. And cooperative learning leads to structured learning, such as role sharing and activity stages, within a small group, while collaborative learning leads to unstructured learning. Therefore, it is becoming more in collaborative learning that peer interaction can be affected by learners' cognitive style. In this paper, we propose the effect of cognitive style on problem solving ability in collaborative learning for problem solving by programming. As a result, collaborative learning was effective in improving problem solving ability and there was no significant difference in cognitive style.

• 대한산업공학회지
• /
• 제27권3호
• /
• pp.250-259
• /
• 2001

Given a tree structured network in which each node has its own demand and also stands for a candidate location of a potential facility, such as plant or warehouse, a capacitated facility location problem on the network (CFLPOT) is to decide capacitated facility locations so that the total demand occurred on the network can be satisfied from those facilities with the minimum cost. In this paper, we first introduce a mixed integer programming formulation for CFLPOT with two additional assumptions, the indivisible demand assumption and the contiguity assumption and then show that it can be reformulated as a tree partitioning problem with an exponential number of variables. We then show that it can be solved in O($n^2b$) time by utilizing the limited column generation method developed by Shaw (1993), where n is the total number of nodes in the network and b is the maximum facility capacity. We also develop a depth-first dynamic programming algorithm with a running time of O(nb) for finding the locally maximal reduced cost which plays an important role in the limited column generation method. Finally, we implement our algorithms on a set of randomly generated problems and report the computational results.

• 연구논문집
• /
• 통권33호
• /
• pp.27-38
• /
• 2003

The object-oriented programming languages are widely used in the modern software engineering. The procedural type FEM codes are still used because it is very hard and cost consuming job to re-code them into object-oriented programs. In this study, a FEM program was newly designed and coded with C++, an object-oriented language. Also a special programming technique, auto-loading technique was developed for open structured program, with which the extension and maintenance can be carried out easily. For example, the additions of element libraries to an existence FEM program do not require any modifications of the program.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.236-243
• /
• 1994

In this paper we consider the part-machine cell formation decision of the generalized Group Technology(GT) problem in which multiple process routes can be generated for each part. The existing p-median model and similarity coefficient algorithm can solve only small-sized or well-structured cases. We suggest an assignment method for the cell formation problem. This method uses an assignment model which is a simple linear programming. Numerical examples show that our assignment method provides good separable cells formation even for large-sized and ill-structured problems.