• Structural Engineering and Mechanics
• /
• v.23 no.3
• /
• pp.263-278
• /
• 2006

This work presents a time-truncation scheme, based on the Lagrange interpolation polynomial, for the solution of the two-dimensional scalar wave problem by the time-domain boundary element method. The aim is to reduce the number of stored matrices, due to the convolution integral performed from the initial time to the current time, and to keep a compromise between computational economy and efficiency and the numerical accuracy. In order to verify the accuracy of the proposed formulation, three examples are presented and discussed at the end of the article.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.4
• /
• pp.113-118
• /
• 2021

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• Journal of Distribution Research
• /
• v.7 no.1
• /
• pp.1-20
• /
• 2002

Many of logistics-related research in automobile industry has focused on inbound logistics and procurement. Research into outbound logistics is relatively few. As a starting research into outbound logistics in automobile industry, this paper examined its logistics network problems with three aspects - location strategy, inventory strategy and transportation strategy. We proposed alternatives of logistics network design resolution, and presented three practical scenarios based on those alternatives. Based on interview, on-site visit and internal data collection processes, we identified major domestic outbound logistics problems such as redundant logistics bases, inefficient delivery policy, insufficient inventory capacity, inventory stock quality deterioration, inefficient transportation system, and etc. In order to cope with those problems, we proposed such strategic alternatives as introduction of hub-and-spoke system, integration of logistics bases, introduction of (automatic) parking building, diversification of transportation mode, and etc. At the same time, we constructed three practically executable scenarios based on those ideas. The first is "Center Hub" scenario, the second is "Metropolitan Hub" scenario. The third and last scenario is "Regional Consolidation of Warehouses (distribution centers)".

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.6
• /
• pp.943-950
• /
• 2002

Real time strategy game is a computer game genre of Playing with human or computer opponents in real time It differs from turn-type computer games in the game process method. Turn type games, such as chess, allow only one Player to move at a time. Real time strategy games allow two or more Players to move simultaneously. Therefore, in real time strategy computer games, the game components' movement plans must be calculated very quickly in order to not disturb other processes such as gathering resources, building structures, and combat activities. There are many approaches, which can reduce the amount of memory required for calculating path, search space, and reactive time of components. (or units). However, existing path finding algorithms tend to concentrate on achieving optimal Paths that are not as important or crucial in real time strategy game. This Paper introduces Dynamic Heuristic Af(DHA*) algorithm which is capable of reducing search space and reactive time of game units and compares with A* algorithm using static heuristic weighting.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3534-3553
• /
• 2021

The low cost of Bluetooth technology has led to its wide usage in indoor positioning. However, some inherent shortcomings of Bluetooth technology have limited its further development in indoor positioning, such as the unstable positioning state caused by the fluctuation of Received Signal Strength Indicator (RSSI) and the low transmission frequency accompanied by a poor real-time performance in positioning and tracking moving targets. To address these problems, an indoor fusion positioning algorithm of Bluetooth technology and pedestrian dead reckoning (PDR) based on a particle filter with dynamic adjustment of weights calculation strategy (BPDW) will be proposed. First, an orderly statistical filter (OSF) sorts the RSSI values of a period and then eliminates outliers to obtain relatively stable RSSI values. Next, the Group-based Trilateration algorithm (GTP) enhances positioning accuracy. Finally, the particle filter algorithm with dynamic adjustment of weight calculation strategy fuses the results of Bluetooth positing and PDR to improve the performance of positioning moving targets. To evaluate the performance of BPDW, we compared BPDW with other representative indoor positioning algorithms, including fingerprint positioning, trilateral positioning (TP), multilateral positioning (MP), Kalman filter, and strong tracking filter. The results showed that BPDW has the best positioning performance on static and moving targets in simulation and actual scenes.

• Advances in aircraft and spacecraft science
• /
• v.9 no.5
• /
• pp.449-462
• /
• 2022

Space-telescopes placed in the Sun-Earth second Lagrange point (L2) observe the sky following a scan strategy that is usually based on a spin-precession motion. Knowing which regions of the sky will be more observed by the instrument is important for the science operations and the instrument calibration. Computing sky observation parameters numerically (discretizing time and the sky) can consume large amounts of time and computational resources, especially when high resolution isrequired.This problem becomesmore critical if quantities are evaluated at detector level instead of considering the instrument entire Field of View (FoV). In previous studies, the authors have derived analytic solutions for quantities that characterize the observation of each point in the sky in terms of observation time according to the scan strategy parameters and the instrument FoV. Analytic solutions allow to obtain results faster than using numerical methods as well as capture detailed characteristics which can be overseen due to discretization limitations. The original approach is based on the analytic expression of the instrument trace over the sky. Such equations are implicit and thusrequiresthe use of numeric solversto compute the quantities.In this work, a new and simpler approach for computing one ofsuch quantities(mean observation time) is presented.The quantity is first computed for pure spin motion and then the effect of the spin axis precession is incorporated under the assumption that the precession motion is slow compared to the spin motion.In this sense, this new approach further simplifies the analytic approach, sparing the use of numeric solvers, which reduces the complexity of the implementation and the computing time.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.24 no.2
• /
• pp.127-136
• /
• 2016

The camera based object detection systems should satisfy the recognition performance as well as real-time constraints. Particularly, in safety-critical systems such as Autonomous Emergency Braking (AEB), the real-time constraints significantly affects the system performance. Recently, multi-core processors and system-on-chip technologies are widely used to accelerate the object detection algorithm by distributing computational loads. However, due to the advanced hardware, the complexity of system architecture is increased even though additional hardwares improve the real-time performance. The increased complexity also cause difficulty in migration of existing algorithms and development of new algorithms. In this paper, to improve real-time performance and design complexity, a task scheduling strategy is proposed for visual object tracking systems. The real-time performance of the vision algorithm is increased by applying pipelining to task scheduling in a multi-core processor. Finally, the proposed task scheduling algorithm is applied to crosswalk detection and tracking system to prove the effectiveness of the proposed strategy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.670-686
• /
• 2017

MapReduce (MRV1), a popular programming model, proposed by Google, has been well used to process large datasets in Hadoop, an open source cloud platform. Its new version MapReduce 2.0 (MRV2) developed along with the emerging of Yarn has achieved obvious improvement over MRV1. However, MRV2 suffers from long finishing time on certain types of jobs. Speculative Execution (SE) has been presented as an approach to the problem above by backing up those delayed jobs from low-performance machines to higher ones. In this paper, an adaptive SE strategy (ASE) is presented in Hadoop-2.6.0. Experiment results have depicted that the ASE duplicates tasks according to real-time resources usage among work nodes in a cloud. In addition, the performance of MRV2 is largely improved using the ASE strategy on job execution time and resource consumption, whether in a multi-job environment.

• Structural Engineering and Mechanics
• /
• v.44 no.3
• /
• pp.379-403
• /
• 2012

In recent years, the need for optimal design of structures under time-history loading aroused great attention in researchers. The main problem in this field is the extremely high computational demand of time-history analyses, which may convert the solution algorithm to an illogical one. In this paper, a new framework is developed to solve the size optimization problem of steel truss structures subjected to ground motions. In order to solve this problem, the covariance matrix adaptation evolution strategy algorithm is employed for the optimization procedure, while a generalized regression neural network is utilized as a meta-model for fitness approximation. Moreover, the computational cost of time-history analysis is decreased through a wavelet analysis. Capability and efficiency of the proposed framework is investigated via two design examples, comprising of a tower truss and a footbridge truss.

• Structural Engineering and Mechanics
• /
• v.40 no.2
• /
• pp.233-243
• /
• 2011

This paper presents a theoretical study of a model predictive control (MPC) strategy employed in semi-active control system with magnetorheological (MR) dampers to reduce the responses of seismically excited structures. The MPC scheme is based on a prediction model of the system response to obtain the control actions by minimizing an objective function, which can compensate for the effect of time delay that occurred in real application. As an example, a 5-story building frame equipped with two 20 kN MR dampers is presented to demonstrate the performance of the proposed MPC scheme for addressing time delay and reducing the structural responses under different earthquakes, in which the predictive length l = 5 and the delayed time step d = 10, 20, 40, 60, 100 are considered. Comparison with passive-off, passive-on, and linear quadratic Gaussian (LQG) control strategy indicates that MPC scheme exhibits good control performance similar to the LQG control strategy, both have better control effectiveness than two passive control methods for most cases, and the MPC scheme used in semi-active control system show more effectiveness and robustness for addressing time delay and protecting structures during earthquakes.