• KIISE Transactions on Computing Practices
• /
• v.24 no.1
• /
• pp.40-45
• /
• 2018

With the advent of big data and social networks, large-scale graph processing becomes popular research topic. Recently, an optimization technique called Gorder has been proposed to improve the performance of in-memory graph processing. This technique improves performance by optimizing the graph layout on memory to have better cache locality. However, since it is designed for in-memory graph processing systems, the technique is not suitable for disk-based graph engines; also the cost for applying the technique is significantly high. To solve the problem, we propose a new graph ordering called I/O Order. I/O Order considers the characteristics of I/O accesses for SSDs and HDDs to improve the performance of disk-based graph engine. In addition, the algorithmic complexity of I/O Order is simple compared to Gorder, hence it is cheaper to apply I/O Ordering. I/O order reduces the cost of pre-processing up to 9.6 times compared to that of Gorder's, still its performance is 2 times higher compared to the Random in low-locality graph algorithms.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.7 no.1
• /
• pp.95-103
• /
• 1998

This paper is concentraed on a study of operation for multiple objectives in a automated manufacturing system with multiple machining cells . Largest Sum Processing-time First(LSPF) was developed in order to minimize makespan, mean flowtime and maximize mean utilization and compare with Ho and Chang's algorithm(HC) and Hunsucker and Shah's algorithm(HS). The results show that LSPF provides better soutions than HC at 78.2% and than HS at 67.8% of total problems to frequency . LSPF reduces 5.8% of makespan by HC and 22.1% of the value by HS and curtails 15.8% , 7.5% of mean flowtime by receptive algorithms(HC, HS). And mean utilization is also higher about 5.5% than HC and HS.

• Journal of KSNVE
• /
• v.7 no.1
• /
• pp.161-168
• /
• 1997

The present paper describes the vibration control experiment of composite plates with bonded piezoelectric sensor and actuator. The system is modeled as two degree-of-freedom system using modal coordinates and the system parameters are obtained from vibration tests. Kalman filter is adopted for extracting modal coordinates from sensor signal, and control algorithms applied to the system are Linear Quadratic Gaussian(LQG) control, Bang-Bang Control (BBC), Negative Velocity Feedback(NVF), Proportional Derivative Control(PDC). From observation of the spillover and control perfomance, it is concluded that a higher order control algorithm such as LQG rather than BBG, NVF, PDC is suitable for efficient simultaneous control of both bending and twisting modes of composite plates.

• IE interfaces
• /
• v.7 no.2
• /
• pp.87-97
• /
• 1994

Many vehicle routing methods have been suggested, which minimize the routing distances of vehicles to reduce the total transportation cost. But the more considerations the method takes, the higher complexites are involved in a large number of practical situations. The purpose of this paper is to develop a vehicle distribution planning system using heuristic algorithms and simulation techniques for home electronics companies. The vehicle distribution planning system developed by this study involves such complicated and stochastic conditions as one depot, multiple nodes(demand points), multiple vehicle types, multiple order items, and other many restrictions for operating vehicles. The proposed system is compared with the nearest neighbor method of the current system in terms of total logistics cost and driving time. This heuristics algorithm and simulation based distribution planning system is efficient in computational complexity, and give improved solutions with respect to the cost as well as the time. This method constructs a route with a minimum number of vehicles for a given demand.

• Journal of Magnetics
• /
• v.19 no.4
• /
• pp.385-392
• /
• 2014

Uncertainties in loads, materials and manufacturing quality must be considered during electromagnetic devices design. This paper presents an effective methodology for robust optimization design based on the variance decomposition in order to keep higher accuracy of the robustness prediction. Sobol' theory is employed to estimate the response variance under some specific tolerance in design variables. Then, an optimal design is obtained by adding a criterion of response variance upon typical optimization problems as a constraint of the optimization. The main contribution of this paper is that the proposed method applies the variance decomposition to obtain a more accurate variance of the response, as well save the computational cost. The performance and robustness of the proposed algorithms are investigated through a numerical experiment with both an analytic function and the TEAM 22 problem.

• Journal of the Korean Institute of Navigation
• /
• v.25 no.4
• /
• pp.371-379
• /
• 2001

We have reported the new measurement system which was substituted digital filter for the analog filter in order to develop the optimal system that could find the time delay between each sensors with high accuracy. And also we have confirmed through the experiments that the accuracy of measurements were differentiated by the methods what kind of digital filter had been adopted. This paper suggests two algorithms which approximate the sound source's bearing and distance. One is that sound source's relative bearing can be approximately regarded as the gradient of hyperbolic asymptote, the other is that the source's range can be approximated under the condition of a long range source relative to the sensor's interval. And a series of experiments were carried out with the source's distance 22.42meters and the random bearing interval within the limits of $-90^{\circ}$~$+90^{\circ}$. As a result, we have recognized that the approximation methods could measure the bearing and distance with higher accuracy than the method using trigonometric relation could do.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.51-54
• /
• 1992

Protection and control systems play a prominent part in avoiding power delivery interruptions and help to get a fast and secure restoration when a failure occurs. In order to meet the higher functional requirements on modern power system, protection speed, selectivity, sensitivity, dependability, and security are essential to ensure reliability. These functions on be satisfied by taking advantage of microprocessor and communication technologies, and digital protection relays (systems) have been developed and applied to real power system enhancing reliability and saving money. It is necessary to have a tool to analyze the functions and algorithms of digital relays for installing them to power system. The purpose of this study is to develop a digital relay simulation program to estimate digital relay performances during system faults. Components of digital protective relay including analog filter, sampling unit, digital filter, and relay logic are modeled in this program.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.1
• /
• pp.118-125
• /
• 2016

This paper presents a new high-efficient algorithm and architecture for an elliptic curve cryptographic processor. To reduce the computational complexity, novel modified Lopez-Dahab scalar point multiplication and left-to-right algorithms are proposed for point multiplication operation. Moreover, bit-serial Galois-field multiplication is used in order to decrease hardware complexity. The field multiplication operations are performed in parallel to improve system latency. As a result, our approach can reduce hardware costs, while the total time required for point multiplication is kept to a reasonable amount. The results on a Xilinx Virtex-5, Virtex-7 FPGAs and VLSI implementation show that the proposed architecture has less hardware complexity, number of clock cycles and higher efficiency than the previous works.

• Journal of the military operations research society of Korea
• /
• v.22 no.2
• /
• pp.182-199
• /
• 1996

Many vehicle routing methods have been suggested, which minimize the routing distances of vehicles to reduce the total transportation cost. But the more considerations the method takes, the higher complexites are involved in a large number of practical situations. The purpose of this paper is to develop a vehicle distribution planning system using heuristic algorithms and simulation techniques for home electronics companies. The vehicle distribution planning system developed by this study involve so complicated and stochastic conditions such as one depot, multiple nodes(demand points), multiple vehicle types, multiple order items, and other many restrictions for operating vehicles. The proposed system is compared with the nearest neighbor method and the savings method in terms of total logistics cost and driving time. This heuristic algorithm and simulation based distribution planning system is efficient in computational complexity, and give improved solutions with respect to the cost as well as the time. This method constructs a route with a minimum number of vehicles for a given demand.

• Journal of Information Processing Systems
• /
• v.16 no.2
• /
• pp.478-493
• /
• 2020

We designed a new meta-heuristic algorithm named Photon Search Algorithm (PSA) in this paper, which is motivated by photon properties in the field of physics. The physical knowledge involved in this paper includes three main concepts: Principle of Constancy of Light Velocity, Uncertainty Principle and Pauli Exclusion Principle. Based on these physical knowledges, we developed mathematical formulations and models of the proposed algorithm. Moreover, in order to confirm the convergence capability of the algorithm proposed, we compared it with 7 unimodal benchmark functions and 23 multimodal benchmark functions. Experimental results indicate that PSA has better global convergence and higher searching efficiency. Although the performance of the algorithm in solving the optimal solution of certain functions is slightly inferior to that of the existing heuristic algorithm, it is better than the existing algorithm in solving most functions. On balance, PSA has relatively better convergence performance than the existing metaheuristic algorithms.