• Korean Journal of Computational Design and Engineering
• /
• v.12 no.3
• /
• pp.182-192
• /
• 2007

The reduction of product development time is exposed to the competitive pressure due to shortened product-and production technology lifecycles as well as increasingly dynamic markets. Specially in automobile companies, that is of major importance for designing die because it is a bottleneck process in the development of a new car. To improve this conventional design process, this paper describes how to design it fast and flexibly. This was done by a modular method using standard template and a feature and knowledge based design method along the design process.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.4
• /
• pp.265-272
• /
• 2006

For the design and analysis of 3D object featuring complexity and irregularity in shape, sectional digital images measured by an industrial CT scanner are employed to generate a finite element model with uniform voxels. The voxel model plays a key role in developing an integrated reverse engineering system including geometric modeling, simulation and optimization. Design examples applied to topology optimization show that the proposed approach can provide a remarkable reduction in time cost at the conceptual and detail design stages.

• 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.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1995.06a
• /
• pp.141-145
• /
• 1995

Code excited linear prediction speech coders exhibit good performance at data rates as low as 4800 bps. The major drawback to CELP type coders is their large computational requirements. In this paper, we propose a new codebook search method that preserves the quality of the CELP vocoder with reduced complexity. The basic idea is to restrict the searching range of the random codebook by using a searching technique of the regular pulse excitation. Applying the proposed method to the CELP vocoder, we can get approximately 48% complexity reduction in the codebook search.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2002.09a
• /
• pp.116-118
• /
• 2002

It has been noted that Monte Carlo simulations are the most accurate method to calculate dose distributions in any material and geometry. Monte Carlo transport algorithms determine the absorbed dose by following the path of representative particles as they travel through the medium. Accurate Monte Carlo dose calculations rely on detailed modeling of the radiation source. We modeled the effects of beam modifiers such as collimators, blocks, wedges, etc. of our accelerator, Varian Clinac 600C/D to ensure accurate representation of the radiation source using the EGSnrc based BEAM code. These were used in the EGSnrc based DOSXYZ code for the simulation of particles transport through a voxel based Cartesian coordinate system. Because Monte Carlo methods use particle-by-particle methods to simulate a radiation transport, more particle histories yield the better representation of the actual dose. But the prohibitively long time required to get high resolution and accuracy calculations has prevented the use of Monte Carlo methods in the actual clinical spots. Our ultimate aim is to develop a Monte Carlo dose calculation system designed specifically for radiation therapy planning, which is distinguished from current dose calculation methods. The purpose of this study in the present phase was to get dose calculation results corresponding to measurements within practical time limit. We used parallel processing and some variance reduction techniques, therefore reduced the computational time, preserving a good agreement between calculations of depth dose distributions and measurements within 5% deviations.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.3
• /
• pp.295-306
• /
• 2007

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agents. Most of the past research results are thus based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents, for the case of general shaped paths in agent movement. First, to reduce the computation time, an extended collision map is developed and utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, a priority for multi-agents is considered for successive and interactive modifications of the agent movements with lower priority. Various solutions using speed reduction and time delay of the relevant agents are investigated and compared in terms of the computation time. A practical implementation is finally provided for three different types of agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.18 no.1
• /
• pp.17-26
• /
• 2014

This paper presents development of an improved domain decomposition method for large scale structural problem that aims to provide high computational efficiency. In the previous researches, we developed the domain decomposition algorithm based on augmented Lagrangian formulation and proved numerical efficiency under both serial and parallel computing environment. In this paper, new computational analysis by the proposed domain decomposition method is performed. For this purpose, reduction in computational time achieved by the proposed algorithm is compared with that obtained by the dual-primal FETI method under serial computing condition. It is found that the proposed methods significantly accelerate the computational speed for a linear structural problem.

• ETRI Journal
• /
• v.41 no.1
• /
• pp.52-60
• /
• 2019

A fast hologram calculation approach is proposed to reduce computational load by avoiding the recalculation of redundancy information. In the proposed method, the hologram is divided into several sub-holograms that record and reconstruct different views of 3D objects. The sub-hologram is generated from its adjacent calculated sub-holograms by only adding the holograms of difference images between an adjacent pair of views. The repetitive information of two adjacent views is called angular redundancy. Therefore, avoiding the recalculation of this angular redundancy can considerably reduce the computational load. Experimental results confirm that the proposed method can reduce the computational time for the statue head, rabbits, and car to 4.73%, 6.67%, and 10.4%, respectively, for uniform intensity, and to 56.34%, 57.9%, and 66.24%, respectively, for 256 levels intensity, when compared to conventional methods.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.05a
• /
• pp.757-761
• /
• 2001

In order to study noise barriers of complex shapes and to assess their efficiency, precise prediction model is required. For instance, geometrical approaches cannot deal with complex diffraction effects. So that in this paper, the time domain numerical computation method(Computational Aeroacoustics method) is applied to estimate noise reduction by diffraction and finite impedance condition. The CAA method can be used to calculate exactly the pressure of complex barrier shape with different impedance condition, such as T-shape, cylindrical edge and multi-edge noise barriers.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.777-782
• /
• 2007

Displacement amplification factor can be used to estimate inelastic displacement demands from elastic displacement demands, The simple formula for displacement amplification factor considering hysteretic behavior of structural system and earthquake characteristics is proposed. And the effects of several parameters such as displacement ductility, strain hardening ratio, period, characteristics of earthquakes and hysteretic models for the displacement amplification factor are evaluated. Accuracy of the proposed formula is evaluated by comparing the displacement amplification factors estimated by existing and proposed formula with those calculated from inelastic time history analysis. The displacement amplification factors by proposed formulas provide a good agreement with those calculated by inelastic time history analysis.