• 전기의세계
• /
• v.29 no.3
• /
• pp.193-200
• /
• 1980

A new algorithm for power system stability calculations is developed which considers the nonlinear state equations of 8 state variables for each generator dynamics, expollential load models in respect to bus voltages for nonlinear loads, network equations expressed in terms of bus-injected current sources, various kinds of generator and transmission line outages, abrupt changes in loads, and operations of various kinds of portective relaying systems such as distance relaying, reclosing load shedding by under-frequency relays. In the algorithm are included efficient and reliable schemes for solving network equations by means of the Newton-Raphson iterative method and the Optimally-Ordered Triangular Factorization Technique, and simple procedures for determining fault-point negative and zero sequence impedances for unbalanced line faults. An application of the Optimally-Ordered Triangular Factorization Techniques results in remarkable savings in computing time and memory requirements.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.661-671
• /
• 1998

It is important to minimize the number of disk accesses which is necessary to transfer data in disk into main memory when processing transactions in physical database design. A vertical file partitioning method is used to reduce the number of disk accesses by partitioning relations vertically and accessing only necessay fragments. In this paper, SOFM(Self-Organizing Feature Maps) network is used to solve vertical partitioning problems. This paper shows that SOFM network is efficient in solving vertical partitioning problem by comparing approximate solution of SOFM network with optimal solution of N-ary branch and bound method. And this paper presents a heuristic algorithm for allocating duplicate attributes to vertically partitioned fragments. As branch and bound method requires particularly much computing time to solve large-sized problems, it is shown that SOFM network is able to overcome this limitation of branch and bound method and solve large-sized problems efficiently in a short time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.111-116
• /
• 2019

Recently, GPU expands application domains from graphic processing to various kinds of parallel workloads. However, current GPU systems focus on the maximization of each workload's parallelism through simplified control rather than considering various workload characteristics. This paper classifies the resource usage characteristics of GPU workloads into computing-bound, memory-bound, and dependency-latency-bound, and quantifies the fine-grained bottleneck for efficient workload allocation. For example, we identify the exact bottleneck resources such as single function unit, double function unit, or special function unit even for the same computing-bound workloads. Our analysis implies that workloads can be allocated together if fine-grained bottleneck resources are different even for the same computing-bound workloads, which can eventually contribute to efficient workload allocation in GPU.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.1595_1596
• /
• 2009

In this study reduction effects of magnetic field were analyzed using multi-conductor method in analysis of shield. The method can be effective in the analysis because of reducing the amount of allocated memory and computing time. And also the method can be applicable to analysis of the induced current distributions and skin effect in shield. The results of the analysis are presented.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.6
• /
• pp.598-606
• /
• 1990

Common problems encountered when orthogonal functions are used in system analysis and state estimation are the time consuming process of high order matrix inversion required in finding the Kronecker products and the truncation errors. In this paper, therefore, a method for the analysis of bilinear systems using Walsh, Block pulse, and Haar functions is devised, Then, state estimation of bilinear system is also studied based on single term expansion of orthogonal functions. From the method presented here, when compared to the other conventional methods, we can obtain the results with simpler computation as the number of interval increases, and the results approach the original function faster even at randomly chosen points regardless of the definition of intervals. In addition, this method requires neither the inversion of large matrices on obtaining the expansion coefficients nor the cumbersome procedures in finding Kronecker products. Thus, both the computing time and required memory size can be significantly reduced.

• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• pp.1210-1212
• /
• 1998

The complexity of newly developed protection algorithm and higher performance requested by the user makes the software embedded in the protective relay much harder to develop and maintain. The versatility of 32bit microprocessor and the availability of cheaper memory semiconductors introduced the fertile developing background for the protective relay developers. The use of component object model(COM) in the software developing process enables the developer to write much complex code in the easy and safe way and to maintain the code easily, too. And the aid of the COM library, the distributed computing environment will be expected to appear by the use of the COM programming model in the protective relay firmware program.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.16 no.5
• /
• pp.179-186
• /
• 2021

For stereo matching based on deep learning, the design of network structure is crucial to the calculation of matching cost, and the time-consuming problem of convolutional neural network in image processing also needs to be solved urgently. In this paper, a method of stereo matching using sparse loss volume in parallax dimension is proposed. A sparse 3D loss volume is constructed by using a wide step length translation of the right view feature map, which reduces the video memory and computing resources required by the 3D convolution module by several times. In order to improve the accuracy of the algorithm, the nonlinear up-sampling of the matching loss in the parallax dimension is carried out by using the method of multi-category output, and the training model is combined with two kinds of loss functions. Compared with the benchmark algorithm, the proposed algorithm not only improves the accuracy but also shortens the running time by about 30%.

• IEIE Transactions on Smart Processing and Computing
• /
• v.1 no.3
• /
• pp.192-200
• /
• 2012

In order for humans and robots to interact in daily life, robots need to understand human speech and link it to their actions. This paper proposes a hierarchical behavior model for robot action control using natural language commands. The model, which consists of episodes, primitive actions and atomic functions, uses a sentential cognitive system that includes multiple modules for perception, action, reasoning and memory. Human speech commands are translated to sentences with a natural language processor that are syntactically parsed. A semantic parsing procedure was applied to human speech by analyzing the verbs and phrases of the sentences and linking them to the cognitive information. The cognitive system performed according to the hierarchical behavior model, which consists of episodes, primitive actions and atomic functions, which are implemented in the system. In the experiments, a possible episode, "Water the pot," was tested and its feasibility was evaluated.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.05a
• /
• pp.66-72
• /
• 2000

Aerodynamic sensitivity analysis is performed for the Navier-Stokes equations coupled with two-equation turbulence models using a discrete adjoint method and a direct differentiation method respectively. Like the mean flow equations, the turbulence model equations are also hand-differentiated to accurately calculate the sensitivity derivatives of flow quantities with respect to design variables in turbulent viscous flows. Both the direct differentiation code and the adjoint variable code adopt the same time integration scheme with the flow solver to efficiently solve the differentiated equations. The sensitivity codes are then compared with the flow solver in terms of solution accuracy, computing time and computer memory requirements. The sensitivity derivatives obtained from the sensitivity codes with different turbulence models are compared with each other. Using two-equation turbulence models, it is observed that a usual assumption of constant turbulent eddy viscosity in adjoint methods may lead to seriously inaccurate results in highly turbulent flows.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.22 no.1
• /
• pp.87-95
• /
• 1980

General purpose programs are essential elements for the computerization of structural analysis. This paper is associated with actual formulation of such programs by matrix analysis. The basic theory of matrix analysis for skeletal structures, its implementation and techniques for developing efficient programs are discussed in this paper. Any shape of skeletal structure can be included in a single program for space frames. But in order to economize computing time and computer memory space, it is desirable to develop and operate seperate programs specialized into four categories; truss, planar frame, grid and space frame. As for general purpose programs, simplicity of input format and flexibility of output format should be duly considered. Compaction and solution of system equations are the most important aspects in computer programming of matrix analysis, and worth further study for more efficient computerization.