• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.8
• /
• pp.659-666
• /
• 1990

Curing recent years, several state-space models describing discrete two dimensional systems are proposed. In this paper, we consider the problem of pole assignment of two dimensional systems using state feedback, based on state-space model proposed by Roessser. The design procedure is seperated into two steps. in thie first step, the sufficient condition for off diagonal matrix of the input transformed system to be zero is derived and in the second step, it is shown that the pole assignment problem of two dimensional systems is divided into the one of two 1-dimensional systems. Finally, a numerical example for illustrating the technique is given.

• Communications for Statistical Applications and Methods
• /
• v.18 no.2
• /
• pp.257-266
• /
• 2011

The rapid development of airlines, has made airports busier and more complicated. The assignment of scheduled to available gates is a major issue for daily airline operations. We consider the over-constrained airport gate assignment problem(AGAP) where the number of flights exceeds the number of available gates, and where the objectives are to minimize the number of ungated flights and the total walking distance or connection times. The procedures used in this project are to create a mathematical model formulation to identify decision variables to identify, constraints and objective functions. In addition, we will consider in the AGAP the size of each gate in the terminal and also the towing process for the aircraft. We will use a greedy algorithm to solve the problem. The greedy algorithm minimizes ungated flights while providing initial feasible solutions that allow flexibility in seeking good solutions, especially in case when flight schedules are dense in time. Experiments conducts give good results.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.397-401
• /
• 2002

We consider a routing and wavelength assignment (RWA) problem on wavelength division multiplexing (WDM) ring networks, which is to maximize the established connections between nodes, given a set of usable wavelengths. We propose two new mathematical formulations of it and efficient algorithms based on branch-and-price method. Computational experiments on random instances show that cue of the proposed formulations yields optimal solutions in much shorter time on the average than the previous formulation due to Lee (1998).

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.3
• /
• pp.63-80
• /
• 2007

This study is a generalization of 'stable dynamics' recently suggested by Nesterov and de Palma[29]. Stable dynamics is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with user equilibrium model that is common in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on the congestion. Therefore it is expected to be an useful analysis tool for transportation planners. An equilibrium in stable dynamics needs only maximum flow in each arc and Wardrop[33] Principle. In this study, we generalize the stable dynamics into the model with multiple traffic classes. We classify the traffic into the types of vehicle such as cars, buses and trucks. Driving behaviors classified by age, sex and income-level can also be classes. We develop an equilibrium with multiple traffic classes. We can find the equilibrium by solving the well-known network problem, multicommodity minimum cost network flow problem.

• Journal of the military operations research society of Korea
• /
• v.18 no.1
• /
• pp.47-60
• /
• 1992

A class of allocation problems can be modeled in a linear programming formulation. But in reality, the coefficient of both the cost and constraint equations can not be generally determined by crisp numbers due to the imprecision or fuzziness in the related parameters. To account for this. a fuzzy version is considered and solved by transforming to a conventional non-linear programming model. This gives a solution as well as the degree that the solution satisfies the objective and constraints simultaneously and hence will be very useful to a decision maker. An attacker assignment problem for multiple fired targets has been modeled by a linear programming formulation by Lemus and David. in which the objective is to minimize the cost that might occur on attacker's losses during the mission. A fuzzy version of the model is formulated and solved by transforming it to a conventional nonlinear programming formulation following the Tanaka's approach. It is also expected that the fuzzy approach will have wide applicability in general allocation problems

• 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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.85-85
• /
• 2000

• 대한공업교육학회지
• /
• v.38 no.1
• /
• pp.239-258
• /
• 2013

The purpose of this study is to define what circuit repairing ability is and to check improvement in learner's circuit repairing abilities by verifying conformity of learner's achievement of target goals that have been derived from headlight assignment based on circuit repairing ability that has been categorized into six sub-factors, which are preparing ability, attaching/detaching ability, circuit analyzing ability, inspecting and measuring ability, repairing (problem solving) ability and organizing ability. In order to achieve the purpose of study, degree of improvement in circuit repairing ability of learner's group was measured through experiment design and verification by group of experts. SPSS statistics program was used for statistical analysis in which average value for descriptive statistics, Cronbach ${\alpha}$ coefficient and t-test were conducted. Level of significance for t-test was p<.05. The conclusions from conducting this study are as follows. Firstly, the usage of terminology 'circuit repairing ability' pertaining to ability to repair failure of electrical devices in automobiles was confirmed to be appropriate. Secondly, the categorization of circuit repairing ability into sub-factors of preparing ability, attaching/detaching ability, circuit analyzing ability, inspecting and measuring ability, repairing (problem solving) ability and organizing ability was confirmed to be appropriate. Thirdly, field instruction on headlight assignment that has been revised according to achievement of learner's goals was confirmed to be effective in improving learner's circuit repairing abilities compared to regular training. Fourthly, field instruction on headlight assignment that has been revised according to achievement of learner's goals was confirmed to be effective in improving sub-factors of circuit repairing abilities, which are preparing ability, attaching/detaching ability, circuit analyzing ability, inspecting and measuring ability, repairing (problem solving) ability and organizing ability.

• Journal of the Korean Chemical Society
• /
• v.67 no.4
• /
• pp.281-295
• /
• 2023

The purpose of this study was to investigate the effects of role assignment in a group on collaboration in a mid- dle school science class to which Collaborative Problem Solving for Character Competency (CoProC) model was applied. For this purpose, 4 classes in the second year of a middle school located in a small and medium-sized city were selected, two classes among these were assigned roles, and the other classes were not. The science class with 4 topics using CoProC model was carried out. As a result of the study, in middle school science class to which CoProC was applied, it was effective in increasing the collaboration. As a result of analyzing the discussion process using the analysis framework for collaboration developed in this study, the group without role assignment was statistically significantly higher than the group with role assignment in the total score and the four sub-factors, especially in 'partnership building' and 'consensus building' which is a high level of collaboration.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7B
• /
• pp.417-426
• /
• 2005

Routing and wavelength assignment problem is one of the most important issues in optical transport networks based on wavelength division multiplexing(WDM) technique. In this paper, we propose a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths. And then we compare the performance of the proposed algorithm with that of bounded greedy approach for EDP(BGAforEDP). The proposed one outperforms up to about 20$\%$ in the fixed traditional topology(NSFNET) and about 32$\%$ in random topologies over the BGA for EDP algorithm.