• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.7
• /
• pp.2239-2256
• /
• 2022

In this paper, a model is proposed to comprehensively evaluate the computational power. The five forces model of computational power solves the problem that the measurement units of different indexes are not unified in the process of computational power evaluation. It combines the bidirectional projection method with TOPSIS method. This model is more scientific and effective in evaluating the comprehensive situation of computational power. Lastly, an example shows the validity and practicability of the model.

• Computational Structural Engineering
• /
• v.28 no.4
• /
• pp.12-15
• /
• 2015

• Journal of Computing Science and Engineering
• /
• v.6 no.4
• /
• pp.310-319
• /
• 2012

Next generation wireless receivers demand low computational complexity algorithms with high computing power in order to perform fast signal detections and error estimations. Several signal detection and estimation algorithms have been proposed for next generation wireless receivers which are primarily designed to provide reasonable performance in terms of signal to noise ratio (SNR) and bit error rate (BER). However, none of them have been chosen for direct implementation as they offer high computational complexity with relatively lower computing power. This paper presents a low-complexity power-efficient algorithm that improves the computing power and provides relatively faster signal detection for next generation wireless multiuser receivers. Measurement results of the proposed algorithm are provided and the overall system performance is indicated by BER and the computational complexity. Finally, in order to verify the low-complexity of the proposed algorithm we also present a formal mathematical proof.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.3134-3155
• /
• 2020

In this paper, we study the joint radio and computational resource allocation in the ultra-dense mobile-edge computing networks. In which, the scenario which including both computation offloading and communication service is discussed. That is, some mobile users ask for computation offloading, while the others ask for communication with the minimum communication rate requirements. We formulate the problem as a joint channel assignment, power control and computational resource allocation to minimize the offloading cost of computing offloading, with the precondition that the transmission rate of communication nodes are satisfied. Since the formulated problem is a mixed-integer nonlinear programming (MINLP), which is NP-hard. By leveraging the particular mathematical structure of the problem, i.e., the computational resource allocation variable is independent with other variables in the objective function and constraints, and then the original problem is decomposed into a computational resource allocation subproblem and a joint channel assignment and power allocation subproblem. Since the former is a convex programming, the KKT (Karush-Kuhn-Tucker) conditions can be used to find the closed optimal solution. For the latter, which is still NP-hard, is further decomposed into two subproblems, i.e., the power allocation and the channel assignment, to optimize alternatively. Finally, two heuristic algorithms are proposed, i.e., the Co-channel Equal Power allocation algorithm (CEP) and the Enhanced CEP (ECEP) algorithm to obtain the suboptimal solutions. Numerical results are presented at last to verify the performance of the proposed algorithms.

• KEPCO Journal on Electric Power and Energy
• /
• v.8 no.2
• /
• pp.159-179
• /
• 2022

Often a network becomes complex, and multiple entities would get in charge of managing part of the whole network. An example is a utility grid. While the entire grid would go under a single utility company's responsibility, the network is often split into multiple subsections. Subsequently, each subsection would be given as the responsibility area to the corresponding sub-organization in the utility company. The issue of how to make subsystems of adequate size and minimum number of interconnections between subsystems becomes more critical, especially in real-time simulations. Because the computation capability limit of a single computation unit, regardless of whether it is a high-speed conventional CPU core or an FPGA computational engine, it comes with a maximum limit that can be completed within a given amount of execution time. The issue becomes worsened in real time simulation, in which the computation needs to be in precise synchronization with the real-world clock. When the subject of the computation allows for a longer execution time, i.e., a larger time step size, a larger portion of the network can be put on a computation unit. This translates into a larger margin of the difference between the worst and the best. In other words, even though the worst (or the largest) computational burden is orders of magnitude larger than the best (or the smallest) computational burden, all the necessary computation can still be completed within the given amount of time. However, the requirement of real-time makes the margin much smaller. In other words, the difference between the worst and the best should be as small as possible in order to ensure the even distribution of the computational load. Besides, data exchange/communication is essential in parallel computation, affecting the overall performance. However, the exchange of data takes time. Therefore, the corresponding consideration needs to be with the computational load distribution among multiple calculation units. If it turns out in a satisfactory way, such distribution will raise the possibility of completing the necessary computation in a given amount of time, which might come down in the level of microsecond order. This paper presents an effective way to split a given electrical network, according to multiple criteria, for the purpose of distributing the entire computational load into a set of even (or close to even) sized computational loads. Based on the proposed system splitting method, heavy computation burdens of large-scale electrical networks can be distributed to multiple calculation units, such as an RTDS real time simulator, achieving either more efficient usage of the calculation units, a reduction of the necessary size of the simulation time step, or both.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.29 no.10
• /
• pp.89-96
• /
• 2015

Explicit numerical integration methods for power system transient stability simulation require very small time steps to avoid numerical instability. The EXST1 exciter model is a primary source of fast dynamics in power system transients. In case of the EXST1, the required small integration time step for entire system simulation increases the computational demands in terms of running time and storage. This paper presents a practical exciter model reduction approach which allows the increase of the required step size and thus the method can decrease the computational demands. The fast dynamics in the original EXST1 are eliminated in the reduced exciter model. The use of a larger time step improves the computational efficiency. This paper describes the way to eliminate the fast dynamics from the original exciter model based on linear system theory. In order to validate the performance of the proposed method, case studies with the GSO-37 bus system are provided. Comparisons between the original and reduced models are made in simulation accuracy and critical clearing time.

• Nuclear Engineering and Technology
• /
• v.48 no.1
• /
• pp.43-54
• /
• 2016

In the present paper, development of the three-dimensional (3D) computational code based on Galerkin finite element method (GFEM) for solving the multigroup forward/adjoint diffusion equation in both rectangular and hexagonal geometries is reported. Linear approximation of shape functions in the GFEM with unstructured tetrahedron elements is used in the calculation. Both criticality and fixed source calculations may be performed using the developed GFEM-3D computational code. An acceptable level of accuracy at a low computational cost is the main advantage of applying the unstructured tetrahedron elements. The unstructured tetrahedron elements generated with Gambit software are used in the GFEM-3D computational code through a developed interface. The forward/adjoint multiplication factor, forward/adjoint flux distribution, and power distribution in the reactor core are calculated using the power iteration method. Criticality calculations are benchmarked against the valid solution of the neutron diffusion equation for International Atomic Energy Agency (IAEA)-3D and Water-Water Energetic Reactor (VVER)-1000 reactor cores. In addition, validation of the calculations against the $P_1$ approximation of the transport theory is investigated in relation to the liquid metal fast breeder reactor benchmark problem. The neutron fixed source calculations are benchmarked through a comparison with the results obtained from similar computational codes. Finally, an analysis of the sensitivity of calculations to the number of elements is performed.

• Journal of Power System Engineering
• /
• v.17 no.2
• /
• pp.46-55
• /
• 2013

In this paper, the computational algorithm for free vibration analysis of an axisymmetric cylindrical shell is formulated by the Sylvester-transfer stiffness coefficient method (S-TSCM) which combines the Sylvester's inertia theorem and the transfer stiffness coefficient method. After the computational programs for obtaining the natural frequencies and natural modes of the axisymmetric cylindrical shell are made by the S-TSCM and the finite element method (FEM), the computational results which are natural frequencies, natural modes, and computational times by both methods are compared. From the computational results, we can confirm that S-TSCM has the reliability in the free vibration analysis of the axisymmetric cylindrical shell and is superior to FEM in the viewpoint of computational times.

• Journal of computational fluids engineering
• /
• v.7 no.2
• /
• pp.43-52
• /
• 2002

This paper presents the numerical methodology of ATHOS3 code for thermal hydraulic analysis of steam generators in nuclear power plant. Topics include porous media approach, governing equations, physical models and correlations for solid-to-fluid interaction and heat transfer, and numerical solution scheme. The ATHOS3 code is applied to the thermal hydraulic analysis of steam generator in the Korea Kori Unit-1 nuclear power plant and the computed results are presented

• Journal of Electrical Engineering and Technology
• /
• v.11 no.2
• /
• pp.329-337
• /
• 2016

With the increasing deployment of distributed generators in the distribution system, a very large search space is required when dynamic programming (DP) is applied for the optimized dispatch schedules of voltage and reactive power controllers such as on-load tap changers, distributed generators, and shunt capacitors. This study proposes a new optimal voltage and reactive power scheduling method based on dynamic programming with a heuristic searching space reduction approach to reduce the computational burden. This algorithm is designed to determine optimum dispatch schedules based on power system day-ahead scheduling, with new control objectives that consider the reduction of active power losses and maintain the receiving power factor. In this work, to reduce the computational burden, an advanced voltage sensitivity index (AVSI) is adopted to reduce the number of load-flow calculations by estimating bus voltages. Moreover, the accumulated switching operation number up to the current stage is applied prior to the load-flow calculation module. The computational burden can be greatly reduced by using dynamic programming. Case studies were conducted using the IEEE 30-bus test systems and the simulation results indicate that the proposed method is more effective in terms of saving electric charges and improving the voltage profile than loss minimization.