• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.10
• /
• pp.124-129
• /
• 1990

This paper describes a new method to eliminate some selected harmonics (5,7,11) in PWM waveforms using Walsh and related orthogonal functions. Previous analyses of PWM waveforms are based on the nonlinear equations requiring iterative solution methods which are not practical in real-time systems. In addition, synthesis of low harmonics waveform at high power system is not easy to implement with power electronic hardware. The goal of this paper is to achieve the harmonics elimination in a PWM waveform by replacing the nonlinear equations in Fourier analysis with linear algebraic equations resulting from the use of orthogonal Walsh equation. This paper also describes how to synthesize low ordered harmonic waveforms with practical power electronic hardware. Walsh and Radmacher functions are easily manipulated by Harmuth's array generator, and those algorithms are accurate, computationally efficient and faster than algorithm based on Fourier analysis. In addition, this method is simulated to synthesize periodic PWM waveforms. From the experi-mental results, it is shown that single-phase PWM waveform are identified with the proposed method. And these methods are also extended to three-phase PWM waveforms in this paper.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.27 no.5
• /
• pp.407-415
• /
• 2016

Recent wireless communication trends have emphasized the importance of energy-efficient transmission. In this paper, link adaptation with machine learning mechanism for maximum energy efficiency in multiple-input multiple-output orthogonal frequency division multiplexing(MIMO-OFDM) wireless system is considered. For reflecting frequency-selective MIMO-OFDM channels, two-dimensional capacity(2D-CAP) feature space is proposed. In addition, machine-learning-based bit and power adaptation(ML-BPA) algorithm that performs classification-based link adaptation is presented. Simulation results show that 2D-CAP feature space can represent channel conditions accurately and bring noticeable improvement in link adaptation performance. Compared with other feature spaces, including ordered postprocessing signal-to-noise ratio(ordSNR) feature space, 2D-CAP has distinguished advantages in either efficiency performance or computational complexity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.6
• /
• pp.273-283
• /
• 2008

Many embedded real-time systems have adopted processors supported with dynamic voltage scaling(DVS) recently. Power is one of the important metrics for optimization in the design and operation of embedded real-time systems. We can save considerable energy by using slowdown of processor supported with DVS. In this paper, we propose heuristic algorithms to calculate task slowdown factors for an efficient energy consumption in embedded real-time systems with task synchronization. The previous algorithm has a following constraint : given the tasks are ordered in a nondecreasing order of their relative deadline, the task slowdown factors computed are in a nonincreasing order. In this paper, we relax the constraint and propose heuristic algorithms which have the same time complexity that previous algorithm has and can save more energy. Experimental results show that the proposed algorithms are energy efficient.

• Journal of Intelligence and Information Systems
• /
• v.25 no.3
• /
• pp.141-160
• /
• 2019

Agile methodologies in software development, including the development of artificial intelligence software, have been widespread over the past several years. In spite of the popularity of agile methodologies in practice, there is a lack of empirical evidence to identify determinants of success of software projects in which agile methods are used. To understand the role of clients in software project where agile methods are used, we examine the effect of client-side factors, including lack of user involvement, unrealistic client expectations, and constant changes of requirements on project success from practitioners' perspective. Survey methods are used in this study. Data were collected by means of online survey to IT professionals who have experience with software development methodologies, and ordered logit regression is used to analyze the survey data. Results of our study imply the following managerial findings. First, user involvement is critical to project success to take advantage of agile methods. Second, it is interesting that, with an agile method, constant changes of client's requirements is not a negative factor but a positive factor of project success. Third, unrealistic client expectations do negatively affect project success even with agile methods.

• 전기의세계
• /
• v.23 no.3
• /
• pp.43-52
• /
• 1974

The matrix inversion is very inefficient for computing direct solutions of the large spare systems of linear equations that arise in many network problems as a large electrical power system. Optimally ordered triangular factorization of sparse matrices is more efficient and offers the other important computational advantages in some applications with this method. The direct solutions are computed from sparse matrix factors instead of a full inverse matrix, thereby gaining a significant advantage is speed and computer memory requirements. In this paper, it is shown that the sparse matrix method is superior to the inverse matrix method to solve the linear equations of large sparse networks. In addition, it is shown that the sparse matrix method is superior to the inverse matrix method to solve the linear equations of large sparse networks. In addition, it is shown that the solutions may be applied directly to sove the load flow in an electrical power system. The result of this study should lead to many aplications including short circuit, transient stability, network reduction, reactive optimization and others.

• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.32-40
• /
• 2016

This paper considers a special case of a three machine flow shop scheduling problem in which operation processing time of each job is ordered such that machine 1 has the longest processing time, whereas machine 3, the shortest processing time. The objective of the problem is the minimization of the total completion time. Although the problem is simple, its complexity is yet to be established to our best knowledge. This paper first introduces the problem and presents some optimal properties of the problem. Then, it establishes several special cases in which a polynomial-time optimal solution procedure can be found. In addition, the paper proves that the recognition version of the problem is at least binary NP-complete. The complexity of the problem has been open despite its simple structure and this paper finally establishes its complexity. Finally, a simple and intuitive heuristic is developed and the tight worst case bound on relative error of 6/5 is established.

• 전기의세계
• /
• v.30 no.6
• /
• pp.375-385
• /
• 1981

New algorithms are derived for nonlinear programming problems which are characterized by their large variables and equality and inequality constraints. The algorithms are based upon the introduction of the Dependent-Variable-Elimination method, Independent-Variable-Reduction method, Optimally-Ordered-Triangular-Factorization method, Equality-Inequality-Sequential-Satisfaction method, etc. For a case study problem relating to the optimal determination of load flow in a 10-bus, 13-line sample power system, several approaches are undertaken, such as SUMT, Lagrange's Multiplier method, sequential applications of linear and quadratic programming method. For applying the linear programming method, the conventional simplex algorithm is modified to the large-system-oriented one by the introduction of the Two-Phase method and Variable-Upper-Bounding method, thus resulting in remarkable savings in memory requirements and computing time. The case study shows the validity and effectivity of the algorithms presented herein.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.54
• /
• pp.87-95
• /
• 2000

To constuct the stochastic model for performance evaluation of Multi-AGV, two aspects must be considered. The first is stochastic situation for moving jobs. The second is the dispatching rule of AGV. In this paper, the stochastic model for performance evaluation of Multi-AGV is developed. The case of stochastic model with two AGV is developed. But it difficult to solve in the case of stochastic model with more than three AGV because the model have three-ordered equations. The evaluation factor of the model is utilization and empty travel time of AGV. Using these factors, one can easily evaluate a wide range of handling and layout alternatives from given flow data. Hence, the model would be most effective when used in the early stage of designing to narrow down the number of alternative prior to simuation.

• Honam Mathematical Journal
• /
• v.28 no.2
• /
• pp.185-196
• /
• 2006

A scheme based on the cryptography for enforcing multilevel security in a system where hierarchy is represented by a partially ordered set was first introduced by Akl et al. But the key generation algorithm of Akl et al. is infeasible when there is a large number of users. In 1985, MacKinnon et al. proposed a paper containing a condition which prevents cooperative attacks and optimizes the assignment in order to overcome this shortage. In 2005, Kim et al. proposed key management systems for multilevel security using one-way hash function, RSA algorithm, Poset dimension and Clifford semigroup in the context of modern cryptography. In particular, the key management system using Clifford semigroup of imaginary quadratic non-maximal orders is based on the fact that the computation of a key ideal $K_0$ from an ideal $EK_0$ seems to be difficult unless E is equivalent to O. We, in this paper, show that computing preimages under the bonding homomorphism is not difficult, and that the multilevel cryptosystem based on the Clifford semigroup is insecure and improper to the key management system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.34
• /
• pp.1-8
• /
• 1995

The practical problem of multi-attribute decision making are formed by the uncertain attribute that the attribute by the alternatives cannot be defined or judged crisphy but only as vague. In this case the final judgements are also represented by vague which have to be ordered to determine the optimal alternative. The problem is more complex if the evaluations of alternatives according to each attribute are expresed vague. This paper described the results of a study done to determine how well multi-attribute decision marking perform in helping a decision maker arrive at a preferred solution to a multi-attribute problem with vague attribute. Particular area of research has concentrated on the issue of combining quantitative and qualitative data supplied by estimation. Futher study considers some method for suitable evaluation of qualitative data.