• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.226-234
• /
• 2004

A rapid Prototyping system that laser-cuts and laminates thick layers can fabricate 3D objects promptly with a variety of materials. Building such a system must consider the surface distortions due to both vertical-cut layers and triangular surfaces. We developed a tangential layer-cutting algorithm by rearranging tangential lines such that they reconstruct 3D surfaces more closely and also constitute smoother laser trajectories. An energy function that reflects the surface-closeness with the tangential lines was formulated and then the energy was minimized by a gradient descent method. Since this simple method tends to cause many local minima for complex 3D objects, we tried to solve this problem by adding a simulated annealing process to the proposed method. To view and manipulate 3D objects, we also implemented a 3D visual environment. Under this environment, experiments on various 3D objects showed that our algorithm effectively approximates 3D surfaces and makes laser-trajectory feasibly smooth.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.04a
• /
• pp.361-368
• /
• 2002

A new remeshing algorithm based on the energy minimization is proposed for the finite element method. This utilizes the variation of mapping function between the master and global elements. The resultant equations are only the other form of the governing equations. However the equations have an important information about the relations between the elements. By assuming the solutions of the governing equations, these relations are used very usefully for the mesh optimization. The explicit formulations are presented for the relations of 1-dimensional equations and some examples are solved for comparison with the other methods. In addition, 2-dimensional expansion is presented for the general use.

• KEPCO Journal on Electric Power and Energy
• /
• v.6 no.1
• /
• pp.59-64
• /
• 2020

Scheduling of electric vehicles and optimizing for charging waiting time have been critical. Meanwhile, it is challengeable to exploit the fluctuating data from electric vehicles in real-time. We introduce an optimal routing algorithm and a simulator with electric vehicles obeying the Poisson distribution of the observed information about time, space and energy-demand. Electric vehicle routing is updated in every cycle even it is already set. Also, we suggest an electric vehicle routing algorithm for minimizing total trip time, considering a threshold of the waiting time. Total trip time and charging waiting time are decreased 34.3% and 86.4% respectively, compared to the previous algorithm. It can be applied to the information service of charging stations and utilized as a reservation service.

• Journal of Information Processing Systems
• /
• v.17 no.4
• /
• pp.721-736
• /
• 2021

For the mobile edge computing (MEC) system supporting dense network, a joint allocation algorithm of computing and communication resources based on reinforcement learning is proposed. The energy consumption of task execution is defined as the maximum energy consumption of each user's task execution in the system. Considering the constraints of task unloading, power allocation, transmission rate and calculation resource allocation, the problem of joint task unloading and resource allocation is modeled as a problem of maximum task execution energy consumption minimization. As a mixed integer nonlinear programming problem, it is difficult to be directly solve by traditional optimization methods. This paper uses reinforcement learning algorithm to solve this problem. Then, the Markov decision-making process and the theoretical basis of reinforcement learning are introduced to provide a theoretical basis for the algorithm simulation experiment. Based on the algorithm of reinforcement learning and joint allocation of communication resources, the joint optimization of data task unloading and power control strategy is carried out for each terminal device, and the local computing model and task unloading model are built. The simulation results show that the total task computation cost of the proposed algorithm is 5%-10% less than that of the two comparison algorithms under the same task input. At the same time, the total task computation cost of the proposed algorithm is more than 5% less than that of the two new comparison algorithms.

• Nuclear Engineering and Technology
• /
• v.53 no.4
• /
• pp.1304-1310
• /
• 2021

Two-phase flow, especially gas-liquid two-phase flow, has a wide application in industrial field. The diagnosis of two-phase flow parameters, which directly determine the flow and heat transfer characteristics, plays an important role in providing the design reference and ensuring the security of online operation of two-phase flow system. Computer tomography (CT) is a good way to diagnose such parameters with imaging method. This paper has proposed a novel image reconstruction method for thermal neutron CT of two-phase flow with improved simulated annealing (ISA) algorithm, which makes full use of the prior information of two-phase flow and the advantage of stochastic searching algorithm. The reconstruction results demonstrate that its reconstruction accuracy is much higher than that of the reconstruction algorithm based on weighted total difference minimization with soft-threshold filtering (WTDM-STF). The proposed method can also be applied to other types of two-phase flow CT modalities (such as X(𝛄)-ray, capacitance, resistance and ultrasound).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.626-648
• /
• 2011

Energy consumption of wireless access networks is in permanent increase, which necessitates development of more energy-efficient network management approaches. Such management schemes must result with adaptation of network energy consumption in accordance with daily variations in user activity. In this paper, we consider possible energy savings of wireless local area networks (WLANs) through development of a few integer linear programming (ILP) models. Effectiveness of ILP models providing energy-efficient management of network resources have been tested on several WLAN instances of different sizes. To cope with the problem of high computational time characteristic for some ILP models, we further develop several heuristic algorithms that are based on greedy methods and local search. Although heuristics obtains somewhat higher results of energy consumption in comparison with the ones of corresponding ILP models, heuristic algorithms ensures minimization of network energy consumption in an amount of time that is acceptable for practical implementations. This confirms that network management algorithms will play a significant role in practical realization of future energy-efficient network management systems.

• Journal of Computational Design and Engineering
• /
• v.2 no.4
• /
• pp.218-232
• /
• 2015

Piecewise linear (G01-based) tool paths generated by CAM systems lack $G_1$ and $G_2$ continuity. The discontinuity causes vibration and unnecessary hesitation during machining. To ensure efficient high-speed machining, a method to improve the continuity of the tool paths is required, such as B-spline fitting that approximates G01 paths with B-spline curves. Conventional B-spline fitting approaches cannot be directly used for tool path B-spline fitting, because they have shortages such as numerical instability, lack of chord error constraint, and lack of assurance of a usable result. Progressive and Iterative Approximation for Least Squares (LSPIA) is an efficient method for data fitting that solves the numerical instability problem. However, it does not consider chord errors and needs more work to ensure ironclad results for commercial applications. In this paper, we use LSPIA method incorporating Energy term (ELSPIA) to avoid the numerical instability, and lower chord errors by using stretching energy term. We implement several algorithm improvements, including (1) an improved technique for initial control point determination over Dominant Point Method, (2) an algorithm that updates foot point parameters as needed, (3) analysis of the degrees of freedom of control points to insert new control points only when needed, (4) chord error refinement using a similar ELSPIA method with the above enhancements. The proposed approach can generate a shape-preserving B-spline curve. Experiments with data analysis and machining tests are presented for verification of quality and efficiency. Comparisons with other known solutions are included to evaluate the worthiness of the proposed solution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5712-5728
• /
• 2017

Recently, there are many studies, that considering green wireless cellular networks, have taken the energy consumption of the base station (BS) into consideration. In this work, we first introduce an energy consumption model of multi-mode sharing BS powered by multiple energy sources including renewable energy, local storage and power grid. Then communication load requests of the BS are transformed to energy demand queues, and battery energy level and worst-case delay constraints are considered into the virtual queue to ensure the network QoS when our objective is to minimize the long term electricity cost of BSs. Lyapunov optimization method is applied to work out the optimization objective without knowing the future information of the communication load, real-time electricity market price and renewable energy availability. Finally, linear programming is used, and the corresponding energy efficient scheduling policy is obtained. The performance analysis of our proposed online algorithm based on real-world traces demonstrates that it can greatly reduce one day's electricity cost of individual BS.

• Journal of IKEEE
• /
• v.16 no.4
• /
• pp.316-321
• /
• 2012

In this paper, we study the energy-efficient deployment strategy for micro base station (BS) in wireless cellular systems. Firstly, we formulate a general problem pertaining to total energy consumption minimization with the requirement of area spectral efficiency (ASE). We start from an observation about the correlation between the area covered by an additional micro BS and the increment of ASE. Under such an observation, we propose an efficient greedy micro BS deployment algorithm. Simulations show that the proposed deployment algorithm can deploy micro BSs with a slight performance reduction comparing with the optimal solution.

• International Journal of Precision Engineering and Manufacturing
• /
• v.7 no.1
• /
• pp.47-50
• /
• 2006

An active contour model has been used to detect the edges in a still image. In order to apply the active contour model to edge detection, the energy function which consists of internal, external and image energies should be defined. After defining the energy function, the edge of an object is detected through minimization of the value of the energy function. In this paper, the modified internal energy function is proposed to improve the convergence of the energy function when the active contour model is applied to the tracking of deformable objects using the greedy algorithm. In order to show the performance of the proposed energy function, experiments were carried out for the still and animated images.