• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.4
• /
• pp.589-605
• /
• 1996

Recycling of used products and components has been considered as one of promising strategies for resolving environmental problems. In this respect, most manufacturing companies begin to consider possible recycling (e.q., reuse or re-production) of the components contained in their products. The primary objective of this research is to develop a multiple criteria decision making model for systematic management of recycle-oriented manufacturing components. The production planning problem of recycle-oriented manufacturing components is first formulated as a multiobjective mixed 0-1 integer programming model with three conflicting objectives. An interactive multiple criteria decision making method is then developed for solving the mathematical model. Also, an Input/Output analysis software is developed to help practitioners apply the model to real problems without much knowledge on computers and mathematical programming. A numerical example is used in examining the validity of the proposed model and to investigate the impact of the input variables on recycling production strategy.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.714-716
• /
• 1996

This paper presents an optimization method for optimal reactive power dispatch which minimizes real power loss and improves voltage profile of power systems using evolutionary computation such as genetic algorithms(GAs), evolutionary programming(EP). and evolution strategy(ES). Many conventional methods to this problem have been proposed in the past, but most these approaches have the common defect of being caught to a local minimum solution. Recently, global search methods such as GAs, EP, and ES are introduced. The proposed methods were applied to the IEEE 30-bus system. Each simulation result, compared with that obtained by using a conventional gradient-based optimization method, Sequential Quadratic Programming (SQP), shows the possibility of applications of evolutionary computation to large scale power systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.2
• /
• pp.478-493
• /
• 2024

In this paper, the Mixed Integer Linear Programming (MILP) model is improved for searching differential characteristics of block cipher Midori-64, and 4 search strategies of differential path are given. By using strategy IV, set 1 S-box on the top of the distinguisher to be active, and set 3 S-boxes at the bottom to be active and the difference to be the same, then we obtain a 5-round differential characteristics. Based on the distinguisher, we attack 12-round Midori-64 with data and time complexities of 2⁶³ and 2^103.83, respectively. To our best knowledge, these results are superior to current ones.

• The KIPS Transactions:PartD
• /
• v.17D no.5
• /
• pp.337-346
• /
• 2010

Timing diagram is popularly utilized for the reason of its advantages; it is convenient for timing diagram to describe behavior of system and it is simple for described behaviors to recognize it. Various techniques are needed to test systems described in timing diagram. One of them is a technique to derive the system into a certain condition under which a test case is effective. This paper proposes a technique to automatically generate the test input sequence to reach the condition for systems described in timing diagram. It requires a proper input set which satisfy transition condition restricted by input waveform and timing constraints to generate a test input sequence automatically. To solve the problem, this paper chooses an approach utilizing the linear programming, and solving procedure is as follows: 1) Get a Timing diagram model as an input, and transforms the timing diagram model into a linear programming problem. 2) Solve the linear programming problem using a linear programming tool. 3) Generate test input sequences of a timing diagram model from the solution of linear programming problem. This paper addresses the formal method to drive the linear programming model from a given timing diagram, shows the feasibility of our approach by prove it, and demonstrates the usability of our paper by showing that our implemented tool solves an example of a timing diagram model.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.471-477
• /
• 2005

This paper proposes an efficient constraint-based optimization model for the design of 3G mobile networks, such as universal mobile telecommunications system (UMTS). The model concerns about finding a set of sites for locating radio network controllers (RNCs) from a set of pre-defined candidate sites, and at the same time optimally assigning node Bs to the selected RNCs. All these choices must satisfy a set of constraints and optimize an objective function. This problem is NP-hard and consequently cannot be practically solved by exact methods for real size networks. Thus, this paper proposes a hybrid search strategy for tackling this complex and combinatorial optimization problem. The proposed hybrid search strategy is composed of three phases: A constraint satisfaction method with an embedded problem-specific goal which guides the search for a good initial solution, an optimization phase using local search algorithms, such as tabu algorithm, and a post­optimization phase to improve solutions from the second phase by using a constraint optimization procedure. Computational results show that the proposed search strategy and the model are highly efficient. Optimal solutions are always obtained for small or medium sized problems. For large sized problems, the final results are on average within $5.77\%$ to $7.48\%$ of the lower bounds.

• The Journal of the Korea Contents Association
• /
• v.14 no.2
• /
• pp.161-171
• /
• 2014

This research aims to analyze the characteristics of the channel brand components, identities in accordance with the organizational strategies of the programmes, and brand structures of the comprehensive programming channels. The channels promote themselves mobilizing a variety of channel brand components and, ecxept Channel A, JTBC, TV Chosun, and MBN coined its names which are reminiscent of their parents corporations. The organizational strategies of the programmes are related with the channel identities. TV Chosun, for instance, branded themselves as 'conservative advocate' while focusing on news programs, and Channel A also takes conservative bias strategy focusing on the news programmes, especially after the 2012 presidential election. JTBC, however, organizes drama and entertainment programmes intensively being equivalent to that of terrestrial broadcasting programmes, and MBN positioned neutral and center with the news and cultural programmes. Referring to the brand architecture, which reveals the structural system of the brand, it is argued that TV Chosun and MBN take the integrated corporate brand strategy, while JTBC tries to mix and balance the brands of the parent corporation and its own independent one. Channel A, exceptionally, doesn't take a name of its parent corporation 'Dong-A'. In conclusion, it is argued that the comprehensive programming channels utilize and take the parent corporate brand, mixed brand, and independent brand in accordance with the brand power and circumstances of their own parent corporates.

• Journal of Practical Engineering Education
• /
• v.7 no.1
• /
• pp.17-23
• /
• 2015

Growing worldwide interest in software and spread awareness of the need for education. A software-driven society realization strategy will achieve mandatory training on software. This policy will be applied from middle school students in 2015. Students who are interested in computers, like many positive responses, student learning may seem hard to have a negative reaction. Thus, the present obligation as simple in practice education only and discarded before actually lost interest awarded a systematic education does not work properly, but rather that education could happen to entirely discard turn our attention. Accordingly, what you need is to have a systematic training from the basics that I need to worry about software that can recognize easy and fun. In this paper, we propose a hardware and basic software that allows you to proceed software training more easy and efficient as it can be modified and applied to the program in the production unit to learn programming tools and programming languages.

• Journal of The Korean Association of Information Education
• /
• v.13 no.1
• /
• pp.50-59
• /
• 2009

This research pursued improvement of learning motives and accomplishment of study by developing storytelling based education model and applying them to field for elementary students study of programming. As a result of inspection on study motives, two groups showed statistically significant different with experiment group showing higher average than comparison group. As a result of inspection on study accomplishment, both groups showed improved average points over previous inspection, and particularly experiment group showed higher average than that of comparison group The results of this research showed that storytelling strategy has direct relation with improvement of programming study motives and study accomplishment

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.737-742
• /
• 2011

Navigation problems include the task of determining the control input under various constraints for systems such as mobile robots subject to uncertain disturbance. Such tasks can be modeled as constrained stochastic control problems. In order to solve these control problems, one may try to utilize the dynamic programming(DP) methods which rely on the concept of optimal value function. However, in most real-world problems, this trial would give us many difficulties; for examples, the exact system model may not be known; the computation of the optimal control policy may be impossible; and/or a huge amount of computing resource may be in need. As a strategy to overcome the difficulties of DP, one can utilize ADP(approximate dynamic programming) methods, which find suboptimal control policies resorting to approximate value functions. In this paper, we apply recently proposed ADP methods to a class of navigation problems having complex constraints, and observe the resultant performance characteristics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2755-2762
• /
• 1997

Open Network Management Systems (NMS) are not sufficient to use in a large and complex computer network environment because many-year experiences and skills are requeired for using NMS. And also, customizing NMS means a difficult programming with API(Application programming Interface) supplied by NMs. The more intelligent NMS you want, the more difficult programming you must do. In this paper, we proposed an intelligent network management system suign a structure of multiple and distributed expert systems, so as to represent expertises and knowledges of network managers into rule format, maintain the knowledgesstructurally and perform the network managmenet intelligently. expert system for amanaging computer network should understand the management protocol, analyze messages from agents, take a proper action, and report the situations by pre-defined network operation principle and strategy. A multiple expert sytem is composed of monitor expert module, fault expert module and manager expert module which are controlled by enconded knowledges.