• Management Science and Financial Engineering
• /
• v.14 no.2
• /
• pp.25-44
• /
• 2008

This paper concentrates on reduction of a Quadratic Fractional Integer Programming Problem (QFIP) to a 0-1 Mixed Linear Programming Problem (0-1 MLP). The solution technique is based on converting the integer variables to binary variables and then the resulting Quadratic Fractional 0-1 Programming Problem is linearized to a 0-1 Mixed Linear Programming problem. It is illustrated with the help of a numerical example and is solved using the LINDO software.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.525-529
• /
• 1996

Decision environments involve a high degree of uncertainty as well as multiple, conflicting goals. Although traditional goal programming offers a means of considering multiple, conflicting goals and arrives at a satisficing solution in a deterministic manner, its major drawback is that decision makers often specify aspiration level of each goal as a single number. To overcome the problem of setting aspiration levels, chance constrained programming can be incorporated into goal programming formulation so that sampling information can be utilized to describe uncertainty distribution. Another drawback of goal programming is that it does not provide a systematic approach to set priorities and trade-offs among conflicting goals. To overcome this weekness, the analytic hierarchy process(AHP) is used in the model. Also, most goal programming models in the literature are of a linear form, although some nonlinear models have been presented. Consideration of risk in technological coefficients and right hand sides, however, leads to nonlinear goal programming models, which require a linear approximation to be solved. In this paper, chance constrained reformulation with linear approximation is presented for a 0-1 goal programming problem whose technological coefficients and right hand sides are stochastic. The model is presented with a numerical example for the purpose of demonstration.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.3
• /
• pp.7-13
• /
• 2004

In this paper, machine cell formation problem is discussed. To reflect precisely actual manufacturing situations such as routing sequences, production quantities, and machining (or operation) characteristics, a new network presentation (or the problem is proposed. It is formulated as a simple 0-1 quadratic programming model with linear constraints. Then, the model is converted into a 0-1 integer programming model using a variable transformation technique. Lastly, some computational results are presented.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.145-170
• /
• 2005

This paper presents scheduling models for dispatching vehicles to accomplish a sequence of container jobs at the container terminal, in which the starting times as well as the order of vehicles for carrying out these jobs need to be determined. To deal with this scheduling problem, three mixed 0-1 integer programming models, Model 1, Model 2 and Model 3 are provided. We present interesting techniques to reformulate the two mixed integer programming models, Model 1 and Model 2, as pure 0-1 integer programming problems with simple constraint sets and present a lower bound for the optimal value of Model 1. Model 3 is a complicated mixed integer programming model because it involves a set of non-smooth constraints, but it can be proved that its solutions may be obtained by the so-called greedy algorithm. We present numerical results showing that Model 3 is the best among these three models and the greedy algorithm is capable of solving large scale problems.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.3
• /
• pp.107-116
• /
• 1996

Recently, the flash memory has been abstracting great attention in the semiconductor market in the world because of its potential applications as mass storage devices. One of the most significant barriers to the scalling-down of the stacked-gate devices such as EPROM's and flash EEPROM's is the large subthreshold leakage in the unselected cells connected with the bit line of a selected cell in the array during programming. The large subthreshold leakge is majorly due to the capacitive coupling between the floating gates of the unselectd cells and the bit line of selected cell. In this paper, a new programming method to redcue significantly the drain turn-on leakage in the unselected cells during programming has been studied, where a little positive voltage (0.25-0.75V) is applied to the soruce during programming unlike the conventional programming method in which the source is grounded. The resutls of the PISCES simulations and the electrical measurements for the standard EPROM with 0.35.mu.m effective channel length and 1.0.mu.m effective channel width show that the subthreshold leakage in the unselectd cells is significantly large when the source is grounded, whereas it is negligibly small when the source is biased ot a little positive voltage during programming. On the other hadn, the positive bias on the source is found to have little effects on the programming speed of the EPROM.

• Journal of the military operations research society of Korea
• /
• v.25 no.1
• /
• pp.133-140
• /
• 1999

Preprocessing for the -01 integer programming can reduce the size of problem instance as well as tighten its linear programming relaxations. In this research, the preprocessing techniques are classified into two categories. First, for the reduction of problem size, there are variable fixing and constraint elimination techniques. Second, for the reduction of feasible region, there are coefficient reduction and Euchidean reduction techniques. These methods are implemented and the effects are shown by experimental results.

• Journal of The Korean Association of Information Education
• /
• v.18 no.3
• /
• pp.413-422
• /
• 2014

The positive impacts of robotics education and programming education on learners are similar. However, robotics education differs from programming education because it includes purchasing and building robots that cause financial and cognitive load of learners. Due to these differences, two kinds of education may not possess equal efficacies for all schools or all learning objectives. To verify this hypothesis, we conducted meta-analysis of studies on robotics education published in South Korea to estimate the effect sizes and compare it to that of programming education. The difference between the average effect sizes of robotics education and of programming education was significant, as the former was 0.4060 and the latter 0.6664. The average effect size of programming education was significantly larger than that of robotics education for primary school students. Middle school students achieved the highest results in both robotics education and programming education. Also, robotics education became more effective than programming education as students were older. Analysis on objectives showed that programming education uniformly affected all areas, whereas robotics education had more impact on affective domain than cognitive domain. Robot construction had the largest effect size, followed by robot construction and programming, robot programming, and robot utilization. Programming education has larger positive impacts on students overall compared to robotics education. Robotics education is more effective to upperclassmen than programming education, and improves affective domain of students. Also, robotics education shows higher efficacy when combined with various subjects.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.3
• /
• pp.61-67
• /
• 2003

We propose a systolic array for dynamic programming which is a technique for solving combinatorial optimization problems. We derive a systolic array for single source shortest path Problem, SA SSSP, and then show that the systolic array serves as dynamic Programming systolic array which is applicable to any dynamic programming problem by developing a systolic array for 0 1 knapsack problem, SA 01KS, with SA SSSP for a basis. In this paper, each of SA SSSP and SA 01KS is modeled and simulated in RT level using VHDL, then synthesized to a schematic and finally implemented to a layout using the cell library based on 0.35${\mu}{\textrm}{m}$ 1 poly 4 metal CMOS technology.

• Journal of The Korean Association of Information Education
• /
• v.14 no.1
• /
• pp.13-23
• /
• 2010

In recent creativity becomes a new request in the knowledge and information age. Robot programming education is an effective teaching method for improvement of creativity. Existing robot programming tools includes text-based or GUI-based development environment. Most of programming tools provide a simple tutorial system without interactive activity for beginners. In this paper, we propose an online robot programming education system based on web2.0, which embedded collaborative code creating tool, interactive tutorial chat and video conference tool to support collaborative code creating via web 2.0. Knowledge sharing tool allows users to share their collaborative source code. Besides, it makes users gained the experience and knowledge of program designing efficiently.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.38
• /
• pp.139-146
• /
• 1996

In this thesis, we suggest the application of dock scheduling which is based on zero-one integer programming. A knowledge based system for dock scheduling was developed to implement this mathematical method.